Digital Commons Network^™

Comparison Of Steady-State Pipe Network Computer Programs, Michael Bernice Holloway

Civil & Environmental Engineering Theses & Dissertations

Four widely used computer programs for the analysis of steady state flows in pipe networks are compared. These programs are NEWTH, written by Jeppson; KENTUCKY, written by Wood; FLOW, written by Epp and Fowler; and LIQSS, written by Stoner. Differences, similarities, advantages and disadvantages of these programs, and various options available are discussed for the benefit of possible future users. In addition, the efficiency of NEWTH, KENTUCKY, and FLOW was tested by simulating a typical network by each program. The listing of LIQSS was not available, and thus was not included in this comparison. In simulation, KENTUCKY used over twice …

Recipe Design And Management In A Nutritional Data Base System, Robert G. Trenary

Masters Theses

The Nutritional Data Base System (NDBS) is an interactive information system which provides the user the ability to create and process menus, recipes and food items. Three primary program modules are thus indicated along with modules to translate user requests and process file and directory information. A discussion of standard data base concepts and an application of these concepts to the processing of recipes in the NDBS system is presented. Future possible expansions are suggested and other similar information systems are discussed.

A Computer System For Understanding English Text In A Kindergarten Story, Janice Anne Freyburger

Masters Theses

A computer system for natural language understanding is presented in this thesis. The system attempts to understand English in a limited domain, a kindergarten-level story about three frogs and a puppy. The system is designed with two modes of operations: the text of the story is processed and its information incorporated into a knowledge database; and as a test of the system's understanding, the system answers questions from the user about the text. If any parts of the test or questions cannot be processed, the user is asked for clarification. The functions of this system are described and analyzed. A …

The Online Subject/Title Catalog Of Western Michigan University, James N. Sleep

Masters Theses

An online subject searchable catalog has been developed to allow public access to the OCLC-MARC subscription tapes of the Western Michigan University Libraries. The system has been implemented on the Western Michigan University Academic Computer Center DECsystem-10 computer and is currently running with access to nearly one hundred thousand citations. During the design of the Online Subject/Title Catalog, statistical analysis of the source data was performed. Paper products based on the OCLC-MARC subscription tapes, such as KWOC indexes, were also developed. A novel feature of this project was the use of SN0B0L4 as the main computer language used.

Interfacing The Sdk-85 With Common Laboratory Equipment, Thomas A. Boerjan

Graduate Research Papers

The-SDK-85 is a low-cost microcomputer trainer well-suited for entry and intermediate level programming and also interfacing. From it the fundamentals of digital electronics and computer programming can be taught at the high school and college level. The objectives of this paper are to learn:

1. The basic hardware required for a simple computer trainer.

2. The software necessary to do simple tasks.

3. How to interface the SDK-85 to common laboratory equipment.

4. How industry is using digital electronics.

5. Basic hardware and software troubleshooting • techniques.

6. Instructional methodology to be used with the SDK-85.

Development Of An On-Line Computer System For Enzyme Kinetics Studies, Jacqueline R. Thweatt

Chemistry & Biochemistry Theses & Dissertations

The PDP-11/10 minicomputer was interfaced to the Beckman 25 ultraviolet/visible spectrophotometer and this on-line computer system was applied to enzyme kinetics studies. This interface involved hardware equipment to locate, amplify, and transmit the analog signal to an analog-to-digital converter, and software to acquire and store the digital data. Data processing programs were used to calculate kinetic parameters and statistical information from the acquired data.

The Varian Cary 219 ultraviolet/visible spectrophotometer can be readily interfaced to the Apple II Plus microcomputer by hardware equipment which can be purchased from the manufacturer. Various software may also be purchased for use in enzyme …

A Simple Macro Processor-User's Guide, John R. Rice, William A. Ward

Department of Computer Science Technical Reports

No abstract provided.

A Simple Macro Processor, John R. Rice, William A. Ward

Department of Computer Science Technical Reports

No abstract provided.

The Ellpack Processor And The Pg Preprocessor Generator System, John F. Brophy

Department of Computer Science Technical Reports

No abstract provided.

Error Analysis Of The Mean Busy Period Of A Queue, Peter J. Denning, Wolfgang Kowalk

Department of Computer Science Technical Reports

No abstract provided.

An Interval Arithmetic Newton Method For Solving Systems Of Nonlinear Equations, Ronald I. Greenberg, Eldon R. Hansen

Computer Science: Faculty Publications and Other Works

We introduce an interval Newton method for bounding solutions of systems of nonlinear equations. It entails three sub-algorithms. The first is a Gauss-Seidel type step. The second is a real (non-interval) Newton iteration. The third solves the linearized equations by elimination. We explain why each sub-algorithm is desirable and how they fit together to provide solutions in as little as 1/3 to 1/4 the time required by a commonly used method due to Krawczyk.

Design, Implementation And Evaluation Of A Revision Control System, Walter F. Tichy

Department of Computer Science Technical Reports

No abstract provided.

The Subjective Nature Of Programming Complexity, Daniel G. Mcnicholl, Kenneth I. Magel

Computer Science Faculty Research & Creative Works

One of the more difficult problems confronting software engineers today is the construction of accurate predictive models of the software development process, [21,[8] and [93. It has long been recognized that one of the most essential elements of any successful model of this process is a quantification of the complexity of software systems. During the past several years a great deal of work has been performed by researchers such as Halstead [3], McCab [5], and others in an attempt to develop metrics which adequately capture the complexity of software systems. Yet one very important aspect of software development complexity seems …

Pg - A Preprocessor Generator, John Brophy

Department of Computer Science Technical Reports

No abstract provided.

Data Flow Program Graphs, Alan L. Davis, Robert M. Keller

All HMC Faculty Publications and Research

Data flow languages form a subclass of the languages which are based primarily upon function application (i.e., applicative languages). By data flow language we mean any applicative language based entirely upon the notion of data flowing from one function entity to another or any language that directly supports such flowing. This flow concept gives data flow languages the advantage of allowing program definitions to be represented exclusively by graphs. Graphical representations and their applications are the subject of this article.

A Hidden-Line Algorithm For Hyperspace, Robert P. Burton, David R. Smith

Faculty Publications

An object-space hidden-line algorithm for higher-dimensional scenes has been designed and implemented. Scenes consist of convex hulls of any dimension, each of which is compared against the edges of all convex hulls not eliminated by a hyperdimensional clipper, a depth test after sorting and a minimax text. Hidden and visible elements are determined in accordance with the dimensionality of the selected viewing hyperspace. When shape alone is the attribute of interest, hidden-line elimination need be performed only in that hyperspace. The algorithm is of value in the production of shadows of hyperdimensional models, including but not limited to four-dimensional space-time …

A Theory Of Small Program Complexity, Kenneth I. Magel

Computer Science Faculty Research & Creative Works

Small programs are those which are written and understood by one. person. Large software systems usually consist of many small programs. The complexity of a small program is a prediction of how difficult it would be for someone to understand the program. This complexity depends of three factors: (1) the size and interelationships of the program itself; (2) the size and interelationships of the internal model of the program's purpose held by the person trying to understand the program; and (3) the complexity of the mapping between the model and the program. A theory of small program complexity based on …

Stochastic Modeling Of Individual Resource Consumption During The Programming Phase Of Software Development, Daniel G. Mcnicholl, Kenneth Magel

Computer Science Technical Reports

In the past several years there has been a considerable amount of research effort devoted to developing models of individual resource consumption during the software development process. Since many conditions affect individual resource consumption during the software development process, including several which are difficult if not impossible to quantify, it is our contention that a stochastic model is more appropriate than a deterministic model.

In order to test our hypothesis we conducted an experiment based upon several student programming assignments. Data from this experiment is used to demonstrate that the two parameter Log-Normal distribution is appropriate for describing the probabilistic …

A Finitary Retract Model For The Polymorphic Lambda-Calculus, Nancy Mccracken

Electrical Engineering and Computer Science - Technical Reports

There has been great interest in recent years in designing programming languages which permit functions which may accept types as parameters (polymorphic functions) and types with type parameters (type generators). Unfortunately the semantics of such functions and types has not been as well understood as their practical use in software design. In [McCracken 1979], a denotational semantics was given for a simple programming language with these features. The semantics used closures, which are a special case of the more familiar retractions, over the Scott universal domain, Pw to represent types. It was then possible to interpret polymorphic functions as continuous …

Ua35/11 Student Honors Research Bulletin, Wku Honors Program

WKU Administration Documents

The WKU Student Honors Research Bulletin is dedicated to scholarly involvement and student research. These papers are representative of work done by students from throughout the university.

• Garvin, Catherine. The Recognition of Anticipatory Grieving and Associated Needs of the Family of a Critically Ill Patient
• Parks, Barbara. Energy Properties of Textiles
• Martin, Lanna. A Historical Approach to the Understanding of Civil Disobedience
• Atwood, Tammy. The Computer Manufacturing Industry and the Burroughs Corporation
• Allen, Christopher. The Battle of Marathon: Athens' Magnificent Triumph
• Martin, Lanna. Melville's Creation of Captain Vere as Pontius Pilate in Billy Budd
• Boles, Barbara. Emerson's Uriel and the …

An Approximation Theory For Conjugate Surfaces And Solutions Of Elliptic Multiple Integral Problems: Application To Numerical Solutions Of Generalized Laplace's Equation, John Gregory, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

An Approximation Theory is Given for a Class of Elliptic Quadratic Forms Which Include the Study of Conjugate Surfaces for Elliptic Multiple Integral Problems. These Ideas Follow from the Quadratic Form Theory of Hestenes, Applied to Multiple Integral Problems by Dennemeyer, and Extended with Applications for Approximation Problems by Gregory. the Application of This Theory to a Variety of Approximation Problem Areas in This Setting is Given. These Include Conjugate Surfaces and Conjugate Solutions in the Calculus of Variations, Oscillation Problems for Elliptic Partial Differential Equations, Eigenvalue Problems for Compact Operators, Numerical Approximation Problems, And, Finally, the Intersection of These …

Probabilistic Simulations, Nicholas J. Pippenger

All HMC Faculty Publications and Research

The results of this paper concern the question of how fast machines with one type of storage media can simulate machines with a different type of storage media. Most work on this question has focused on the question of how fast one deterministic machine can simulate another. In this paper we shall look at the question of how fast a probabilistic machine can simulate another. This approach should be of interest in its own right, in view of the great attention that probabilistic algorithms have recently attracted.

Bachelor's Degree Programs In Electrical Engineering, Computer Science, Computer Systems 1982-83, Nova University

College of Engineering and Computing Course Catalogs

No abstract provided.

Center For Science And Engineering, Master Of Science, Computer Science 1982, Nova University

College of Engineering and Computing Course Catalogs

No abstract provided.

Graduate Bulletin, 1982-1984 (1982), Moorhead State University

Graduate Bulletins (Catalogs)

No abstract provided.

Simulation Of Burley Tobacco Harvesting-Housing Systems, Ronald L. Bingner, Larry G. Wells, Thomas C. Bridges, George A. Duncan

Biosystems and Agricultural Engineering Faculty Publications

A computer model has been developed using systems analysis techniques to simulate the labor and equipment aspects of harvesting burley tobacco. By varying the parameters of the model the user can determine a harvesting and housing strategy based on labor and equipment availability.

Fault Coverage Requirement In Production Testing Of Lsi Circuits, Vishwani D. Agrawal, Sharad C. Seth, Prathima Agrawal

School of Computing: Faculty Publications

A technique is described for evaluating the effectiveness of production tests for large scale integrated (LSI) circuit chips. It is based on a model for the distribution of faults on a chip. The model requires two parameters, the average number (n₀) of faults on a faulty chip and the yield (y) of good chips. It is assumed that the yield either is known or can be calculated from the available formulas. The other parameter, n₀, is determined from an experimental procedure. Once the model is fully characterized, it allows calculation of the field …

Octal-Tree Spatial Sorting And Its Applications, Jeffrey L. Posdamer

All Computer Science and Engineering Research

An octal tree subdivision recursively divides a bounded three-dimensional volume into octanta about an internal division point. This scheme has been used to represent cellular or enumerated voxel models of solid objects. Given one or more sets of points sampled from the surface of a solid, an octal tree may be generated in which each leaf node contains m or less points. By specifying the tree traversal rule, the points are accessed in a sorted order. By defining m=3, a divide-and-conquer surface triangulation algorithm may be developed which does not require special sampling conditions (such as co-planarity) on subsets of …

Robotics And The Conservation Of Human Resources, Robert U. Ayres, Steven M. Miller

Research Collection School Of Computing and Information Systems

Due to rapid expansion in the field of robotics, policy issues have arisen in regard to developing human skills to deal with the new technology and to deal with the obsolescent human skills which are the inevitable result of this growth pattern. Industrialists, educators, union leaders, and government officials must work cooperatively to insure that the coming changes are made with minimum disruption. Improved training methods and courses have to be developed for the skills needed to control, manage and supervise the new machines. Some of the ways in which this can be accomplished are through offering financial incentives for …

Some Results On Optimum Premium Payment Plans, Jeyaraj Vadiveloo, Kishan Mehrotra, Kenneth Kaminsky

Electrical Engineering and Computer Science - Technical Reports

Any insurance plan consists of a sequence of payments every year (or some other fixed time interval) in return for certain death benefits. The benefits may take the form of a wide variety of insurances or annuities. For simplicity, we will assume that premiums and benefits are paid annually. In this paper, we investigate the appropriateness of this type of plan. Naturally, appropriateness of any plan cannot be measured without an optimality criteria. Three such criteria, which are statistical in nature, are introduced in this paper. For the principal "safety" criterion which we use, the optimal premium are those which …