Digital Commons Network^™

On Maximally Parallel Schemata, Robert M. Keller

All HMC Faculty Publications and Research

A model for parallel computation called a schema is presented. This model is similar to that presented in the recent work of Karp and Miller. Section 1 presents a description of the model, and some results on the characterization of computations within it. Section 2 summarizes some results on determinacy and equivalence. Section 3 presents a formalization of the property of maximal parallelism in schemata. Several alternate characterizations are shown to be equivalent for certain classes. Section 4 presents results on the complexity of a maximally parallel schema equivalent to a given schema.

Some Results On The Distance Properties Of Convolutional Codes, Luther D. Rudolph, Alexander Miczo

Electrical Engineering and Computer Science - Technical Reports

Rate 1/2 binary convolutional codes are analyzed and a lower bound on free distance in terms of the minimum distances of two associated cyclic codes ìs derived. Next, the complexity of computing the free distance is discussed and a counterexample to a conjecture on the relationship of row distance to free distance for systematic codes Ìs presented. Finally, an improved Gilbert bound for definite decoding is derived.

Opset Program For Computerized Selection Of Watershed Parameter Values For The Stanford Watershed Model, Earnest Yuan-Shang Liou, L. Douglas James

KWRRI Research Reports

The advent of high-speed electronic computer made it possible to model complex hydrologic processes by mathematical expressions and thereby simulate streamflows from climatological data. The most widely used program is the Stanford Watershed Model, a digital parametric model of the land phase of the hydrologic cycle based on moisture accounting processes. It can be used to simulate annual or longer flow sequences at hourly time intervals. Due to its capability of simulating historical streamflows from recorded climatological data, it has a great potential in the planning and design of water resources systems. However, widespread use of the Stanford Watershed Model …

Modified Method Of Linear Associative Retrieval, James Donald Byrd

Masters Theses

"It is becoming increasingly important for those in decision making positions to have the most current and accurate data possible as related to their particular needs. Although there are several well known retrieval techniques available an intensified effort is being made at many installations to provide a retrieval system that will supply the demands of their own needs. One well known approach to the solution of information retrieval is linear associative retrieval. The solution that has been proposed requires several computer runs on some requests and therefore is very time consuming. The author has implemented a method to eliminate unnecessary …

Manipulation Of Data Structure In A Numerical Analysis Problem Solving Systems, Lawrence R. Symes

Department of Computer Science Technical Reports

No abstract provided.

Terminal Talk - The Wofford Connection - October 1969, Wofford College Computer Center

Terminal Talk

No abstract provided.

A Mathematical Problem Solving Language And Its Interpreter, Lawrence R. Symes

Department of Computer Science Technical Reports

No abstract provided.

New Computer Methods For Protein Crystallography, Martin Zwick

Complex Systems Faculty Publications and Presentations

New Computer Methods for Protein Crystallography, by Martin Zwick. Submitted to the Department of Biology on 30 August 1968 in partial fulfillment of the requirements for the degree of Doctor of Philosophy. The section, "MYOGLOBIN REFINEMENT," describes the fitting of an idealized polypeptide chain to a set of approximate backbone coordinates for the protein, sperm whale myoglobin. This procedure refines the structure by imposing upon it known bond distances and angles, and simultaneously derives a representation of the polypeptide conformation in terms of the values of the rotation angles about its single bonds. The overall rms and mean deviation between …

Numerical Analysis For The Consumer, D. Dodson, J. Ewing, P. Miller, W. Nylin, E. Petarik, S. Prues

Department of Computer Science Technical Reports

No abstract provided.

Electronic Computers - A Historical Survey In Print, Saul Rosen

Department of Computer Science Technical Reports

No abstract provided.

Economic Analysis Of Flood Detention Storage By Digital Computer, James Ray Villines, L. Douglas James

KWRRI Research Reports

The objective of this study was to develop a digital computer procedure for preliminary analysis of the economic justification of reservoir detention storage for flood control and to present a sample study illustrating its application. A computer program called the University of Kentucky Flood Control Planning Program III was developed and tested on the flood plain of the South Fork of the Licking River in northeastern Kentucky.

Given a specified reservoir site and a downstream flood plain divided into planning units, Program III selects the economically efficient combination of reservoir detention storage and the associated combination of channel improvement, flood …

Planning Flood Control Measures By Digital Computer, James Norris Cline, L. Douglas James

KWRRI Research Reports

The purpose of this study was to develop adequate guidelines whereby those interested in flood control planning would be able to apply a pair of digital computer programs known as the University of Kentucky Flood Control Planning Programs to ease the computational burden of evaluating specific flood control situations. Program II determines the economically optimum combination of channel improvement, land use restriction, and flood proofing for flood damage abatement. Program III also incorporates reservoir storage into the planning process. The Programs are not intended to provide a finished design but rather to select the optimum combination of flood control measures …

Problems Encountered With Control Networks In Highly-Restructurable Digital Systems, Donald F. Wann, Robert A. Ellis, Mishell J. Stucki, Robert M. Keller

All HMC Faculty Publications and Research

This paper discusses problems encountered with control networks in highly restructurable digital systems. In particular the treatment of implementation errors is covered with emphasis on concurrent processing. The implementation of concurrent processing networks may result in errors which will be quite complex to detect and systematic methods are warranted. Four meta control elements are employed in obtaining convenient concurrent structures. We analyze several error detecting schemes and conclude that the arc-node method with node partitioning appears to be the most realistic approach at this time.

Air Force Rotc At The University Of Richmond, 1951-1957, Robert J. Dandridge

Honors Theses

In the summer of 1950, after the seriousness of the Korean conflict had become evident, a special committee appointed three years earlier by the Executive Committee of the Board of Trustees was reactivated for the purpose of considering "the feasibility of applying for a Reserve Office Training Corps unit" for the University of Richmond. This special committee, called the ROTC Committee, after thorough study, rendered a unanimous recommendation to the Board that a unit of Army ROTC be applied for. The application was completed and mailed to the Department of the Army. Approval of the application was not long in …

Economic Analysis Of Alternative Flood Control Measures By Digital Computer, Thomas M. Rachford

KWRRI Research Reports

The purpose of this project was to develop a digital computer program for selecting the optimum combination of flood proofing, flood-plain land use, channel improvement, and residual flood damage for a given floodplain. Based on economic efficiency, the optimum policy is selected for each planning unit of the total flood-plain for each period of time called a planning stage. The program was written in Fortran IV for the IBM 7040 and the University of Kentucky Computing Center compiler. The program requires about 23,000 words of core storage and about 30 seconds of execution time per planning-unit-stage for typical conditions. The …

A Study Of The Development Of A Heuristic Program That Solves Symbolic Laplace Transformation Problems, Arthur E. Zackrison

Masters Theses

"A medium-speed general purpose digital computer (IBM 1620 Model II) was programmed to solve symbolic Laplace transformation problems. Although the applied mathematician and modern engineer has many uses for the symbolic solution of a problem, the potential of symbolic manipulation by a computer has not yet been sufficiently developed to help them because of many problems. This paper discusses the program and based on the author’s experience with it’s [sic] performance, clarifies the position of several of these difficulties and reaches some conclusions concerning computer solution of such problems"--Abstract, page ii.

Grade Herd Recording : 1962-63, Maurice C. Cullity

Journal of the Department of Agriculture, Western Australia, Series 4

A poor season coupled with a 16 per cent, increase in the number of cows tested during 1962-63 led to a drop in the average yields of cows in the Grade Herd Recording Scheme.

Electronic Data Processing--Its Place In The Administrative And Academic Areas At Eastern Illinois University, John Walstrom

Masters Theses

No abstract provided.