Digital Commons Network^™

An Optimal Parallel Algorithm For The All Nearest -- Neighbor Problem For A Convex Polygon, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.

On Multidimensional Arrays Of Processors, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.

A Distributed Shortest Path Algorithm For A Planar Network, Greg N. Frederickson

Department of Computer Science Technical Reports

No abstract provided.

Generalized Unfoldings For Shortest Paths In Euclidean 3-Space, C. Bajaj, T. T. Moh

Department of Computer Science Technical Reports

No abstract provided.

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 Monte Carlo Analysis Of The Mincycle Algorithm For Generating Minimal Perfect Hash Functions, Pao-Po Hou, Thomas J. Sager

Computer Science Technical Reports

In this paper, several minimal perfect hashing function generating methods are examined. One of them, the mincycle method by Sager is evaluated by the Monte Carlo method. The results are represented in graphs and tables.

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 …

Development Of An On-Line Computer System For Cyclic Voltammetry Studies, Tai-Lee Leo Huo

Chemistry & Biochemistry Theses & Dissertations

An Apple II Plus microcomputer was interfaced to a PAR 174A Polarographic Analyser, an HP 7O4OA X-Y recorder and a three-electrode system. This on-line computer system was applied to Cyclic Voltammetry (CV) studies. The interfacing involved both hardware and software development. Various hardware components were used to amplify and transmit the analog signal both going into the computer and coming from the computer. Software programs were written for staircase waveform generation, data acquisition, and plotting the voltammograms obtained.

A package was designed for CV experiments to be used by the students in the instrumental analysis laboratory. This package contains several …

The Algebraic Complexity Of Shortest Paths In Polyhedral Spaces, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.

On The Probable Performance Of Graph Coloring Algorithms, Jonathan S. Turner

All Computer Science and Engineering Research

We define a natural probability distribution over the set of k-colorable graphs on n vertices and study the probable performance of several algorithms on graphs selected from this distribution. The main results are listed below. • We describe an algorithm to determine if a given n vertex graph is k-colorable, which runs in time O(n + m log k), where m is the number of edges. We show that this algorithm can successfully identify almost all random k-colorable graphs for constant or slowly growing values of k. • We show that an algorithm proposed by Brelas, and justified on experimental …

Least Squares Approximation By One-Pass Methods With Piecewise Polynomials, Fujiichi Yoshimoto

Department of Computer Science Technical Reports

No abstract provided.

On Universal Tests For The Truth Of World Views: Their Existence And Identifiability, William Buttelmann, Paul Fienberg

ACMS Conference Proceedings 1985

In his book, Christian Apologetics, Norman Geisler proposes a universal test for the truth of world views. We examine this concept and find that it raises serious difficulties. This paper first presents some basic definitions for "world view" and "truth-value of a world view," then studies the concept of a universal test for the truth of world views in light of these definitions. Geisler has proposed what amounts to a universal decision procedure to determine the truth-value of world views. We show that, in the general case, no such universal decision procedure exists. Whether or not such universal tests for …

Selected Bibliography Of Donald Maccrimmon Mackay, Gene B. Chase

ACMS Conference Proceedings 1985

A selected bibliography of Donald MacCrimmon MacKay, including his written works and biographical sources.

The Significance Of Formally Undecidable Propositions For The Use Of Classical Logic In Theological Arguments, Gordon E. Whitney

ACMS Conference Proceedings 1985

No abstract provided.

Faith And Mathematics - A Different Perspective, James E. Mann, Jr.

ACMS Conference Proceedings 1985

No abstract provided.

Artificial Intelligence? - A Christian Appraisal, Donald M. Mackay

ACMS Conference Proceedings 1985

No abstract provided.

Is Rational Thinking The Best Thinking?, Richard Laatsch

ACMS Conference Proceedings 1985

No abstract provided.

Undergraduate Mathematical Modeling: When And What To Teach, Frank R. Giordano, Maurice D. Weir

ACMS Conference Proceedings 1985

No abstract provided.

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

Department of Computer Science Technical Reports

No abstract provided.

Introduction (1985), Robert Brabenec

ACMS Conference Proceedings 1985

A Fifth Conference on Mathematics from a Christian Perspective

Edited by Robert L. Brabenec, Wheaton College

Table Of Contents (1985), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1985

A Fifth Conference on Mathematics from a Christian Perspective

Edited by Robert L. Brabenec, Wheaton College

Bruce: A Graphics System With Hidden Line And Hidden Surface Algorithms, Keith Vetter, Christopher Roche

Computer Science Technical Reports

Accurately representing the physical world by computer is a topic which has direct benefits to fields like chemistry and architecture, and is a source of much research in computer science. This paper examines the steps necessary to develop and implement a graphical system that will allow for the modeling of physical world objects. In particular, this is a description of BRUCE: a graphical system that will describe a world of three dimensional polyhedra, implementing algorithms for hidden line and hidden surface removal. This paper also deals with the problems incurred along the way and suggestions for further improvement of BRUCE.

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 …