Digital Commons Network^™

Display Oriented Front End Interfaces, Balachander Krishnamurthy, Francie J. Newbery, Craig E. Wills

Department of Computer Science Technical Reports

No abstract provided.

Eliminating Proofs Of Interference-Freedom From Levin-Gries Csp Program Proofs, Thomas P. Murtagh

Department of Computer Science Technical Reports

No abstract provided.

A Parallel Branch And Bound Algorithm For Integer Linear Programming Models, Rochelle L. Boehning, Billy E. Gillett

Computer Science Technical Reports

A parallel branch and bound algorithm is developed for use with MIMD computers to study the efficiency of parallel processors on general integer linear programming problems. The Haldi and IBM test problems and a System Design model are used in the implementation of the algorithm. Initially the algorithm solves the Haldi and IBM test problems on a single processor computer which simulates a multiple processor computer. The algorithm is then implemented on the Denelcor HEP multiprocessor using two of the IBM problems to compare the results of the simulation to the results using an MIMD computer. Finally the algorithm is …

Predicting Success In High School Computer Programming, John C. Gevedon

Graduate Theses and Dissertations

There are great differences in performance among students taking high school programming courses, and instructors debate over what elements contribute to these differences. Some students develop logical thinking abilities and problem solving techniques, while others fail to develop skills beyond memorization of specific terms and procedures. It is not known whether these differences are causally related to the specific educational environment or student backgrounds. Without more information, the factors that actually contribute to the success of high school students in computer programming courses cannot be accurately determined. It was the purpose of this study then to isolate certain student characteristics …

Analog Computer Simulation With Automatic Scaling By Digital Computer, Mark Anthony Motter

Electrical & Computer Engineering Theses & Dissertations

A computer-aided design approach for the simplification of analog computer simulation is presented. The simulation configuration consists of an EAI 2000 analog computer with serial communications link to a PDP — 11/24 digital computer. Under control of the PDP-11, the analog simulations are realized with appropriate time and magnitude scaling which adjusts the range of the simulation coefficients and prevents overloads of the analog components. The analog computer hardware configuration accommodates both stable plants up to eighth order and closed-loop systems up to tenth order. Cascade compensation is provided for the closed-loop systems.

The plant may be described by either …

Color Display Of Vowel Spectra As A Training Aid For The Deaf, Amir Jalali Jagharghi

Electrical & Computer Engineering Theses & Dissertations

The objective of this research was to develop a transformation for mapping speech parameters to color parameter. This transformation is done in real-time, and the resulting color parameter are continuously displayed on a color monitor. This visual speech display is to be used as a speech articulation training aid for the deaf. The conversion of speech acoustic signals into speech parameter was accomplished using special -purpose electronics. The real-time conversion of speech parameter to display parameter was controlled by an 8086/8088 microprocessor operating in an S-100 bus structure. The coefficients of the Karhunen-Loeve series expansion of speech power spectra were …

Multidimensional Timestamp Protocols For Concurrency Control, Pei-Jyun Leu, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

Representing Graph Families With Edge Grammars, Francine Berman, Gregory Shannon

Department of Computer Science Technical Reports

No abstract provided.

Solving Tree Problems On A Mesh-Connected Processor Array, Mikhail J. Atallah, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

An Algorithm For Parallel Subsumption, Ralph M. Butler, Arlan R. Dekock

Computer Science Technical Reports

Many current automated theorem provers use a refutation procedure based on some version of the principle of resolution. These methods normally lead to the generation of large numbers of new clauses. Subsumption is a process that eliminates the superfluous clauses from the clause space, thus speeding up the proof. The research presented in this thesis is concerned with the design and implementation of a subsumption algorithm which exploits the parallelism provided by a multiprocessor. For portability, all coding is done in the programming language C. Monitors are used as the synchronization mechanism. Correct performance in both a multiprocessor and uniprocessor …

A Meta-Level Extension Of Prolog, Kenneth A. Bowen, Tobias Weinberg

Electrical Engineering and Computer Science - Technical Reports

Prolog has many attractive features as a programming tool for artificial intelligence. These include code that is easy to understand, programs that are easy to modify, and a clear relation between its logical and procedural semantics. Moreover, it has proved possible to create clear and efficient implementations. Nonetheless, we perceive several shortcomings. Chief among these is difficulty representing dynamic databases (databases which change in time) and an apparent restriction to backward chaining, backtracking, and depth-first search. Our intent in this paper is to present an extension to Prolog, called metaProlog, which preserves the virtues of Prolog while introducing powerful constructions …

Some Thoughts On A Uniform Generic Command Interface, Balachander Krishnamurthy

Department of Computer Science Technical Reports

No abstract provided.

Electing A Leader In A Synchronous Ring, Greg N. Frederickson, Nancy A. Lynch

Department of Computer Science Technical Reports

No abstract provided.

A Survey Of Program Design Languages (Pdls), Brian A. Nejmeh, Herbert E. Dunsmore

Department of Computer Science Technical Reports

No abstract provided.

On The Existence Of Analytical Proofs For Vlsi Computational Networks, Rami Melhem

Department of Computer Science Technical Reports

No abstract provided.

Efficient Parallel Solutions To Some Geometric Problems, Mikhail J. Atallah, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.

The Analysis Of Software Development And Testing Processes: An Empirical Study, T. J. Yu, Herbert E. Dunsmore

Department of Computer Science Technical Reports

No abstract provided.

The Tilde File Naming Scheme, Douglas E. Comer, Thomas P. Murtagh

Department of Computer Science Technical Reports

No abstract provided.

Tilde Trees In The Unix Environment, Douglas E. Comer, Ralph E. Droms

Department of Computer Science Technical Reports

No abstract provided.

Finding All Solutions To A System Of Polynomial Equations, Alden H. Wright

Computer Science Faculty Publications

Given a polynomial equation of degree d over the complex domain, the Fundamental Theorem of Algebra tells us that there are d solutions, assuming that the solutions are counted by multiplicity. These solutions can be approximated by deforming a standard n th degree equation into the given equation, and following the solutions through the deformation. This is called the homotopy method. The Fundamental Theorem of Algebra can be proved by the same technique.

In this paper we extend these results and methods to a system of n polynomial equations in I complex variables. We show that the number of solutions …

Designing A Relational Data Base For A Problem Solving Environment, Kathryn S. Dawson

Theses and Dissertations

When choosing a system design in which to solve a recurring problem which depends on interrelated data a relational data base environment should be considered. The original problem can be solved through this design and by allowing users to view the data in the relational constructs the data can be easily used in numerous other applications. Theoretical support insures the design is sound avoiding inaccurate results. Independence between the logical and physical views of the data enables the data base administrator to adjust the physical data structures in order to optimize system performance without affecting existing user applications.

Center For Computer Based Learning--Relational Data Base Management On Unix 1985, Nova University

College of Engineering and Computing Course Catalogs

The Center for Computer-Based Learning was formed in 1983 and began offering online programs in 1985. The publication date of this item is approximate and should be considered as published during the mid to late 1980s.

Utilization Of The Digital Vax 11/750 Computer In The Administration Of An Adult Evening Collegiate Program, Barbara Barr Dabbs

Theses

Unavailable.

Nova University Doctor Of Education In Computer Education An Online Program For Professional Success [No Date], Nova University

Abraham S. Fischler College of Education and School of Criminal Justice College Archive

No abstract provided.

Industrial Simulation With Animation, Edward T. Hammerand

Masters Theses

"This thesis examines and evaluates the new simulation language PCModel. Prior to the arrival of PCModel, simulation via computer typically resulted in pages of statistics compiled over the duration of the simulation. PCModel's approach is to simulate the model on the display before the user in real time. Additionally, user interaction is supported to allow changes to be made throughout the simulation run.

The evaluation of PCModel is accomplished through inspection of a pair of examples already simulated in a conventional simulation language. The examples show the relative strong and weak points of the language, as well as demonstrating how …

Parallel Algorithms For Bridge- And Bi-Connectivity On Minimum Area Meshes, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

Computer Aided Simulation Of A Heating, Ventilating, And Air Conditioning System In A Building, Sunil Shrikrishna Kulkarni

Mechanical & Aerospace Engineering Theses & Dissertations

The Godwin Life Science Building on the Old Dominion University campus presents an interesting problem in terms of energy conservation. The building is the maximum energy resource consumer on the campus, having a criterion value of 234 KBtu/sq.ft-year (2657 MJoules/sq. rneter-year). A Simplified Energy Analysis Method (ASEAM) loads and systems computer program was used to simulate the building and its heating, ventilating, and air conditioning (HVAC) plant in order to understand the building's high annual energy resource consumption rate, and to devise ways to overcome it. The main goal was to assess and propose energy conservation improvements to the existing …

A Study Of Controlling Variables Using A Microcomputer Program Compared To The Piagetian Bending Rods Task, Rita Arlene Hrecz

Dissertations and Theses @ UNI

This study compared two formats of controlling variables. Subjects' performance of controlling variables in the Piagetian Bending Rods Task was compared to their performance of controlling variables in the microcomputer interactive program called Measuring Gravitational Forces. The correlation result (0.78 on the Spearman rho and the Pearson Product Moment correlations) and results of the nonparametric Wilcoxon t test and the parametric correlated t indicated no statistically significant difference of subjects' performance of controlling variables in either task. No statistically significant gender difference of subjects' performance of either the Bending Rods Task or the Measuring Gravitational Forces computer program was found. …

A Parallel Branch And Bound Algorithm For Integer Linear Programming Models, Rochelle L. Boehning

Doctoral Dissertations

"A parallel branch and bound algorithm is developed for use with MIMD computers to study the efficiency of parallel processors on general integer linear programming problems. The Haldi and IBM test problems and a System Design model are used in the implementation of the algorithm. Initially the algorithm solves the Haldi and IBM test problems on a single processor computer which simulates a multiple processor computer. The algorithm is then implemented on the Denelcor HEP multiprocessor using two of the IBM problems to compare the results of the simulation to the results using an MIMD computer. Finally the algorithm is …

Blas, Linear, Algebra Modules And Supercomputers Parvec Workshop #4, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.