Digital Commons Network^™

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 …

Approaching Distributed Database Implementations Through Functional Programming Concepts, Robert M. Keller, Gary Lindstrom

All HMC Faculty Publications and Research

The application of functional programming concepts to the data representation and querying aspects of databases has been discussed by Shipman and Buneman, et al. respectively. We argue the suitability of a function-based approach to additional aspects of database systems, including updating, transaction serialization, and physical distribution and communication. It is shown how the NmergeH extension of a purely functional model permits serializable concurrent "primary site" distribution control. We also present preliminary experimental results which indicate that a reasonable degree of concurrency is attainable from the functional approach.

Collecting Data About Logic Simulation, Roger D. Chamberlain, Mark A. Franklin

All Computer Science and Engineering Research

Design of high performance hardware and software based gate-switch level logic simulators requires knowledge about the logic simulation process itself. Unfortunately, little data is publically available concerning key aspects of this process. An example of this is the lack of published empirical measurements relating to the time distribution of events generated by such simulators. This paper presents a gate-switch level logic simulator lsim which is oriented towards the collection of data about the simulation process. The basic components of lsim are reviewed, and its relevant data gathering facilities are discussed. An example is presented which illustrates the use of lsim …

Finding A Minimum Independent Dominating Set In A Permutation Graph, Mikhail J. Atallah, Glenn Manacher, J. Urritia

Department of Computer Science Technical Reports

No abstract provided.

Some Thoughts On A Uniform Generic Command Interface, Balachander Krishnamurthy

Department of Computer Science Technical Reports

No abstract provided.

Performance Analysis Of Network File Systems, Walter F. Tichy, Zuwang Ruan

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.

A Study Of Data Interlock In Vlsi Computational Networks For Sparse Matrix Multiplication, Rami G. Melhem

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.

A Parallel Array Scanning Algorithm, Ralph M. Butler, Ralph W. Wilkerson

Computer Science Technical Reports

Suppose we are given a vector X of n real numbers and we want to find the maximum sum found in any contiguous subvector of X. In Jon Bentley's article [l] on algorithm design and technique, a simple vector scanning problem and a series of progressively more efficient algorithms to solve this problem were discussed in some detail. Clearly, any algorithm must visit each location of X at least once and consequently a lower bound on the running time for problem is 0(n), which is in fact attainable as Bentley’s paper illustrates. However, the original motivation for this problem was …

Doctor Of Education In Computer Education Center For Computer-Based Learning 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.

Creating Havoc: Havoc Development Program, David Cohn, Stephen Madancy

Dartmouth College Undergraduate Theses

One area where use of the computer is essential is in the modern scientific laboratory. High speed computation, data storage and data analysis enable scientists to perform experiments that would otherwise be impractical. A problem inherent to the effective use of special purpose laboratory computers, however, is the fact that this equipment has generally been developed for highly specific uses, and has either tried to cope with existing high-level languages or has abandoned the attempt and required the user to program in a low-level assembly or machine language. Our idea was to design, develop and implement a programming language that …