Digital Commons Network^™

Highly Parallel Processing Of Relational Databases (Thesis), Ching-Chih Hsiao

Department of Computer Science Technical Reports

No abstract provided.

A Computer Assisted Instruction Package For Computer Graphics, Robert Normand Dutilly

Masters Theses

The purpose of this thesis is to:

(1) Present the concepts and significance of Computer Assisted Instruction (CAI).

(2) Demonstrate the usefulness of CAI by the implementation of a system to instruct in the fundamentals of Computer Graphics.

(3) Describe methods used for implementing a large CAI package on a microcomputer.

(4) Development of software tools to assist in the creation of CAI programs.

The paper will also cover the historical perspectives on the growth of CAI, its impact on the educational field and the proper construction of CAI materials. The system is written in the UCSD Pascal computer programming …

Estimating The Performance Of Multi- Microcomputer Networks, Daniel A. Reed

Department of Computer Science Technical Reports

No abstract provided.

Signature Protocols For Rsa And Other Public- Key Cryptosystems, Dorothy E. Denning

Department of Computer Science Technical Reports

No abstract provided.

Numerical Computation With General Two Dimensional Domains, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Algorithm: A Two Dimensional Domain Processor, John R. Rice

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.

Course Syllabus: Perspectives On Computers And Society, Judith V. Grabiner

Pitzer Faculty Publications and Research

Weizenbaum's statement is a compelling exhortation to his fellow professionals; nevertheless, I cannot wholly agree. It should be possible for nonprofessionals to understand, as a result of their own reading and experience, how computers interact with the rest of human life. The problems are not just technical, and their nature is not entirely unprecedented.

Speech Spectral Modeling And Speech Synthesis Using Finite Impulse Response Digital Filters, Paul Edward Gordy

Computational Modeling & Simulation Engineering Theses & Dissertations

Synthetic speech can be produced using a discrete-time model of human speech production. This model depends on the use of digital filters to model the spectral characteristics of the vocal tract. Speech spectra can be efficiently encoded using a set of principal components basis vectors; however, these vectors are not in a convenient mathematical form for directly determining a digital filter for the speech production model. If discrete cosine basis vectors are used to approximate the principal components basis vectors, then the cosine basis vector coefficients can be used to determine a Finite Impulse Response(FIR) digital filter for speech spectral …

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.

Ua66/16/2 Ogden Instructional Computing Newsletter, Vol. 3, No. 1, Wku Mathematics & Computer Science

WKU Administration Documents

Newsletter created by the Ogden Computer Laboratory to promote services, courses, hardware, software and student activities.

Symmetric Versus Nonsymmetric Differencing For Self-Adjoint Elliptic Problems, Wayne R. Dyksen, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

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.

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.

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 …