Digital Commons Network^™

Cylindrical Algebraic Decomposition I: The Basic Algorithm , Dennis S. Arnon, George E. Collins, Scot Mccallum

Department of Computer Science Technical Reports

No abstract provided.

A Study Of Flow Languages, Vector Machines, Petri Nets And Convex Languages, Shyam Kishore Bajpai

Masters Theses

In this work, relations have been established among vector machines and augmented vector machines, vector machines and Petri nets, and augmented vector machines and generalized Petri nets. At each stage, number of examples are given to illustrate the theory of Petri nets, vector machines and augmented vector machines.

Should Distributed Systems Be Hidden?, Peter J. Denning, Robert L. Brown

Department of Computer Science Technical Reports

No abstract provided.

On Linear-Time Algorithms For 5-Coloring Planar Graphs, Greg N. Frederickson

Department of Computer Science Technical Reports

No abstract provided.

A Model For Analyzing Generalized Interprocessor Communication Systems, Janice D. Cuny, Lawrence Synder

Department of Computer Science Technical Reports

No abstract provided.

Solving Elliptic Problems Using Ellpack Part 1: Ellpack User's Guide; Part 2: The Problem Solving Modules, John R. Rice, Ronald F. Boisvert

Department of Computer Science Technical Reports

No abstract provided.

The Performance Of The Collocation And Galerkin Methods With Hermite Bi-Cubics, W. R. Dyksen, Robert E. Lynch, John R. Rice, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

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.

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 …

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.

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

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.

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 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 …

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 …

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.

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

Graduate Bulletins (Catalogs)

No abstract provided.

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 …

Cost-Performance Bounds For Multi-Microcomputer Networks, Daniel A. Reed, Herbert D. Schwetman

Department of Computer Science Technical Reports

No abstract provided.

Some Observations On The Development Of Use Of Computer Informational Systems In Hospital Settings And Recommendations For Proposed Implementation At St. Joseph's Hospital, Andrew Z. Richardson

Theses

An intent is stated to discuss the developmental history and social impact of computer information retrieval systems on the hospital setting with primary area of focus being the Pharmacy Department. The interrelationship among various areas in the hospital setting are considered for need and cost/benefit associated with the use of a computerized information retrieval system.

A Case Study of St. Joseph Hospital is presented in example of evaluative consideration for implementation of a computerized information retrieval system.

Different forms of the "state-of-the-art" in informational systems are considered for their effective impact on cost/ benefit ratios to patient care and hospital …

The Purdue Multimachine Pipeline: A High Bandwidth Machine Network And Programming Environment For Research In Large Scale Computation, Douglas E. Comer, Peter J. Denning, John R. Rice, Lawrence Snyder

Department of Computer Science Technical Reports

No abstract provided.

The Flat File Database Generator Ffg, Douglas E. Comer

Department of Computer Science Technical Reports

No abstract provided.

Testing The Coordination Predicate, Janice D. Cuny, Lawrence Synder

Department of Computer Science Technical Reports

No abstract provided.

A Computer-Assisted Instructional System And Its Application To A Course On Computer Structures And Hardware, Tahir Mufti

Masters Theses

Computer-Assisted Instruction is a powerful tool which is fast becoming an integral part of the instructional system in schools.

The objective of this study is to review the techniques used to provide Computer-Assisted Instruction and to present such an instructional system called LEARN which is general enough to be applied towards the teaching of any subject. Also included are notes on the application of the LEARN system to a subject entitled "Computer Structures and Hardware".

Problems With Cobol--Some Empirical Evidence, D. M. Volpano, Herbert E. Dunsmore

Department of Computer Science Technical Reports

No abstract provided.

The Csnet User Environment, Peter J. Denning, Douglas E. Comer

Department of Computer Science Technical Reports

No abstract provided.

Mathematics As Rhyme, Vern Poythress

ACMS Conference Proceedings 1981

Using the analogy between the universe and a choral poem, one may view mathematics as the “rhyme” of the universe. In that perspective new light is thrown on the unique subject matter of mathematics, the a priori character of its truths, and the relation of mathematics to other areas of knowledge. A route is thereby opened for richer use of creativity in mathematics.

Science As Allegory, Vern Poythress

ACMS Conference Proceedings 1981

The universe is God’s choral poem, and science is a system of allegories within it. That is the thesis that I propose to expound and defend. Yet it is not a “thesis” at all, if the word “thesis” commits me to a certain kind of strict logical defense. I am not putting forward my thesis that science is allegory as the endpoint of a deductive or inductive argument. Rather, it is a springboard for a program of exploration and reflection that turns upside-down some conventional ways of thinking about science.

On App Decoding, Carlos R.P. Hartmann, Luther D. Rudolph, Kishan Mehrotra, Guy J. Snedeker

Electrical Engineering and Computer Science - Technical Reports

In this paper we show that APP decoding for a linear code C is optimum not for C, but for a minimum-distance-2 code which contains C as a subcode when the codewords of are transmitted with equal probability. However, APP decoding is shown to be a symptotically optimum for C for high SNR when C is a binary one-step orthogonolizable code with equiprobable codewords transmitted over the AWGN channel.