Digital Commons Network^™

Deduction Of A Functional Dependency From A Set Of Functional Dependencies, James M. Richardson

Masters Theses

"This paper describes an algorithm called the Deduction Tracing Algorithm (DTA) which utilizes basic properties of functional dependencies from database systems and a modification of a tree search algorithm from artificial intelligence. The algorithm takes a set of functional dependencies, F, along with a specific functional dependency L→R as input and produces a list of functional dependencies from F that can be used to deduce L→R. The resulting algorithm is easily automated to provide relational database users with a tool for organizing their queries"--Abstract, page iii.

Architecture And Operation Invocation In The Clouds Kernel, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Some Efficient Computational Algorithms Related To Phase Models, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.

A Robust Distributed Termination Detection Algorithm, Niraj K. Sharma, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

A System For Experimentation In Replicated Copy Control, Bharat Bhargava, Paul Noll, Andrew Royappa, Donna Sabo

Department of Computer Science Technical Reports

No abstract provided.

Multilist And Inverted File System Performance Measurements, Ashok Chandramouli, George Winston Zobrist

Computer Science Technical Reports

This study evaluates the multilist and inverted file systems. It describes the structure of the two file system and then proceeds to investigate the performance. The performance is based on quantitative estimates of space requirements for file system, time to retrieve records, time to insert a record, time to delete a record, time to update a record and time to exhaustively read and reorganize the file system. The study then investigates specific situations in which one file system seems to perform better than the other.

The Western Michigan University Programming Contest Proctor System, Joel Marshall Fletcher

Masters Theses

A software package for administering programming contests has been developed for DECsystem-10 timesharing computers. This package provides a neutral editing environment for contestants, a method for submitting problems for execution, and an automatic judging facility for evaluating contestants' solutions and tabulating scores. The proctor system has been used in numerous competitions, including a regional contest sponsored by the Association for Computing Machinery.

A Proposed C Language Binding For The Graphical Kernel System 3-D, M. G. Bolten, C. Y. Ho

Computer Science Technical Reports

This thesis introduces a proposed C language binding definition for the International standards Organization's draft international standard of the Graphical Kernel System-JD. This work augments the earlier C language binding of the two-dimensional version of the Graphical Kernel System commonly known as GKS. The proposed function interface will provide a basis for, if not a final, C language binding for the three-dimensional version of the Graphical Kernel System.

Parallel Symmetry-Breaking In Sparse Graphs, Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon

Department of Computer Science Technical Reports

No abstract provided.

Shape Recognition By Curvature Changing Points And Fourier Transform, Jianzhong Li

Masters Theses

Computer vision is a relatively new and fast-growing field. Shape representation and recognition is a very important but difficult branch in this field.

One method of using curvature changing points and Fourier transform to recognize the shape is described in this thesis. Also an important feature in computer vision, multiscaling, is achieved by this method.

A Microprocessor-Based Multivariable Interactive Control System, Sayed Mehdi Khayam-Nekouei

Electronic Theses & Dissertations

This study outlines the various types of control systems and reviews the necessary mathematical techniques to solve the problem of multivariable interactive control. The characteristics as well as the state representation for control processes involving either p or v type canonical structures are discussed. Next, the characteristics of multivariable interactive discrete control systems are discussed in detail. The advantages of flexibility and speed of microprocessors are used as powerful tools to implement a microprocessor-based system can be employed to control discrete processes. To demonstrate a practical application of a microprocessor-based system in a multivariable interactive discrete process, the algorithm and …

Efficient Parallel Algorithms For String Editing And Related Problems, Alberto Apostolico, Mikhail J. Atallah, Lawrence L. Larmore, Scott Mcfaddin

Department of Computer Science Technical Reports

No abstract provided.

Shadow Editing: A Distributed Service For Supercomputer Access, Douglas E. Comer, Jim Griffioen, Rajendra Yavatkar

Department of Computer Science Technical Reports

No abstract provided.

Robust Set Operations On Polyhedral Solids, Christoph M. Hoffmann, John E. Hopcroft, Michael S. Karasick

Department of Computer Science Technical Reports

No abstract provided.

Do We Really Need To Balance Patricia Tries?, Peter Kirschenhofer, Helmut Prodifger, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Load And Communications Balancing On Multiprocessor Logic Simulation Engines, Ken Wong, Mark A. Franklin

All Computer Science and Engineering Research

The problem considered in this paper is to find an assignment of logic components to processors which will achieve logic simulation speed-ups approaching the ideal for large processor populations. This problem becomes particularly important when a significant portion of the speed-up expected from logic simulation engines is attributed to load sharing (as opposed to obtaining speed-up by employing specialized hardware to carry out specific tasks associated with the simulation process such as event queue manipulation or function evaluation). Our research considers this problem for a particular multiprocessor simulation architecture for which a performance model has bene developed. The model is …

Parallel Construction Of A Suffix Tree With Applications, A. Apostolico, C. Iliopoulos, G. M. Landau, B. Schieber, U. Vishkin

Department of Computer Science Technical Reports

No abstract provided.

Mathematical Aspects Of Scientific Software, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A Dynamic Majority Determination Algorithm For Reconfiguration Of Network Partitions, Bharat Bhargava, Peter Lei Ng

Department of Computer Science Technical Reports

No abstract provided.

Ultimate Characterizations Of The Burst Response Of An Interval Searching Algorithm, Philippe Jacquet, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Partitioning The Process Of Interaction: An Implementation, Balachander Krishnamurthy

Department of Computer Science Technical Reports

No abstract provided.

Partitioning The Process Of Interaction: An Abstract View, Balachander Krishnamurthy

Department of Computer Science Technical Reports

No abstract provided.

Shells In An Interactive System, Balachander Krishnamurthy

Department of Computer Science Technical Reports

No abstract provided.

Raid Programmers's Manual, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

Supercomputing About Physical Objects, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Advanced Communications Systems, Jonathan S. Turner

All Computer Science and Engineering Research

The Advanced Communication Systems Project is concerned with new communication technologies that can support a wide range of different communication applications in the context of large public networks. Communications networks in common use today have been tailored to specific applications and while they perform their assigned functions well, they are difficult to adapt to new uses. There currently are no general purpose networks, rather there are telephone networks, low-speed data networks and cable television networks. As new communications applications proliferate, it becomes clear that in the long term, a more flexible communications infrastructure will be needed. The Integrated Services Digital …

Independent Checkpointing And Concurrent Rollback For Recovery In Distributed System—An Optimistic Approach, Bharat Bhargava, Shy-Renn Lian

Department of Computer Science Technical Reports

No abstract provided.

Intensional Reasoning About Knowledge, Oliver B. Popov, Arlan R. Dekock

Computer Science Technical Reports

As demands and ambitions increase in Artificial Intelligence, the need for formal systems that facilitate a study and a simulation of a machine cognition has become an inevitability. This paper explores and developes the foundations of a formal system for propositional reasoning about knowledge. The semantics of every meaningful expression in the system is fully determined by its intension, the set of complexes in which the expression is confirmed. The knowledge system is based on three zeroth-order theories of epistemic reasoning for consciousness, knowledge and entailed knowledge. The results presented in the paper determine the soundness and the completeness of …

A Study Of Automated Reasoning In A Brain Tumor Diagnosis Expert System, Aung Zaw Maung

Masters Theses

The objective of this study is to survey various theorem-proving methods and to evaluate how these methods can be applied as inference engines in a brain tumor diagnosis expert system.

Various applications of automated reasoning based on the resolution principle are discussed. Knowledge representations and inference mechanisms used in expert systems are also surveyed.

An actual application of this method for a medical diagnosis problem is implemented and explained, and the limitations of this approach and possible future enhancements are discussed.

A Characterization Of Digital Search Trees From The Average Complexity Viewpoint, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.