Digital Commons Network^™

Lily-A Generator For Compiler Frontends, Thomas J. Sager

Computer Science Technical Reports

No abstract provided.

Lily: A Parser Generator For Ll(1) Languages, Timothy Topper Taylor

Masters Theses

This paper discusses the design and implementation of Lily, a language for generating LL(1) language parsers, originally designed by Dr. Thomas J. Sager of the University of Missouri--Rolla. A method for the automatic generation of parser tables is described which creates small, highly optimized tables, suitable for conversion to minimal perfect hash functions.

An implementation of Lily is discussed with attention to design goals, implementation of parser table generation, and table optimization techniques. Proposals are made detailing possibilities for further augmentation of the system. Examples of Lily programs are given as well as a manual for the system.

The Implementation Of A Compiler Targeted To A Multiprocessor Environment, R. Dwight Schettler

Masters Theses

"This research is an application of the techniques which have been developed for the detection and exploitation of implicit parallelism. A system has been developed based on Intel 86/12A single board computers utilizing dual-port RAM for communication. The compiler system accepts the source code of a simple block structured language and generates parallel programs to be executed on the Multibus system. The techniques used for detection of parallelism are stressed"--Abstract, page ii.

Performance Parameter Measurements Of Generic Files, Sankarraman Subramanian

Masters Theses

"This study discusses the performance parameter measurements of generic files, the pile file, the sequential file, the indexed-sequential file, the indexed file and the direct file. The file performance measurements are compiled in a software package. The study then describes the use of such software package as a simulation tool in a file design environment"--Abstract, page iii.

Decoding Substitution Ciphers By Means Of Word Matching With Application To Ocr, George Nagy, Sharad C. Seth, Kent Einspahr

School of Computing: Faculty Publications

A substitution cipher consists of a block of natural language text where each letter of the alphabet has been replaced by a distinct symbol. As a problem in cryptography, the substitution cipher is of limited interest, but it has an important application in optical character recognition. Recent advances render it quite feasible to scan documents with a fairly complex layout and to classify (cluster) the printed characters into distinct groups according to their shape. However, given the immense variety of type styles and forms in current use, it is not possible to assign alphabetical identities to characters of arbitrary size …

Intensional Reasoning About Knowledge, Oliver B. Popov

Doctoral Dissertations

"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.R.M.S., Arbitrary Robot Modeling System, William Richard Gerlt

Masters Theses

“This paper deals with the mathematical modeling of robot arms. Modeling robot arms includes finding a suitable way to describe a robot, turning the description into a mathematical system, and using the system to find a set of equations which can be used to control the robot.

One of the problems associated with robot modeling is that it involves a great deal of mathematics. When the process is done by hand, the large volume of mathematics makes the process very time consuming and prone to errors. These problems are part of the motivation for automating the modeling of robots.

ARMS …

The Use Of Services In The Tilde Environment, Craig E. Wills

Department of Computer Science Technical Reports

No abstract provided.

The Cypress Network, Douglas E. Comer, Thomas Narten, Rajendra Yuavatkar

Department of Computer Science Technical Reports

No abstract provided.

The Cypress Coaxial Backbone Packet Switch, Douglas E. Comer, Thomas Narten, Rajendra Yuavatkar

Department of Computer Science Technical Reports

No abstract provided.

Some Explicit Formulas For Mixed Exponential Service Systems, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.

Availability Driven Multiple Access Network Architecture, Dan Cristian Marinescu, Vernon J. Rego, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Horizontal Fragmentation And Allocation In A Distributed Database For Cost Minimization With Reliability And Space Constraints, Elmo Loren Ivey

Masters Theses

In this paper a method for horizontal fragmentation of a relational database is presented. A method is given for calculating the benefit or cost savings obtained by allocating a given fragment to a site, independently for each site.

To obtain optimal benefit each fragment is allocated to all sites where there is a positive benefit. This may result in the allocation of some fragments to multiple sites.

Finally a method is given for removing or reallocating certain fragments from sites with insufficient storage. Also, a method is given for allocating fragments to multiple sites to meet constraints on the required …

An Efficient Algorithm For Maxdominance, With Applications, Mikhail J. Atallah, S. Rao Kosaraju

Department of Computer Science Technical Reports

No abstract provided.

An O(N Log N) Cost Parallel Algorithm For The Single Function Coarsest Partition Problem, A. Apostolico, C. S. Iliopoulos, Robert Paige

Department of Computer Science Technical Reports

No abstract provided.

Simulation Of Physical Systems From Geometric Models, Christoph M. Hoffmann, John E. Hopfcroft

Department of Computer Science Technical Reports

No abstract provided.

Computers And The Nature Of Man: A Historian's Perspective On Controversies About Artificial Intelligence, Judith V. Grabiner

Pitzer Faculty Publications and Research

The purpose of the present paper is to provide a historical perspective on recent controversies, from Turing's time on, about artificial intelligence, and to make clear that these are in fact controversies about the nature of man. First, I shall briefly review three recent controversies about artificial intelligence, controversies over whether computers can think and over whether people are no more than information-processing machines. These three controversies were each initiated by philosophers who, irrespective of what the programs of their time actually did, viewed with alarm the argument that if a machine can think, a thinking being is just a …

Wind Streamline Ambiguity Removal Of Microwave Scatterometer Data, Hans W. Zaepfel

Electrical & Computer Engineering Theses & Dissertations

There is a class of satellite microwave scatterometers that return oceanographic information which includes wind vectors with directional ambiguity. The first part of the ambiguity removal process is to reduce the data to a directional ambiguity of 180°. This thesis shows that wind direction change contains the information required for streamline ambiguity removal and that syntactic pattern recognition techniques can be used to locate the areas of wind direction change. Spreading the information along the areas of wind direction change results in the removal of the streamline ambiguity. The algorithm is implemented and the results are presented showing that it …

Verification Of Loops And Exceptions, Ryan Stansifer

Department of Computer Science Technical Reports

No abstract provided.

Parallel Log-Time Construction Of Suffix Trees, Alberto Apostolico, Costas Iliopoulos

Department of Computer Science Technical Reports

No abstract provided.

Design Of A Tensor Product Population Of Pde Problems, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Cache Coherence In Distributed Systems (Thesis), Christopher Angel Kent

Department of Computer Science Technical Reports

No abstract provided.

Modeling Of An Availability Driven Computer Network Architecture, Dan C. Marinescu, Vernon J. Rego, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Structure From Motion: An Augmented Problem And A New Algorithm, Chia-Hoang Lee

Department of Computer Science Technical Reports

No abstract provided.

Matching And Motion Of Four Points In Two Views, Chia-Hoang Lee

Department of Computer Science Technical Reports

No abstract provided.

Synthesizing Non-Uniform Systolic Designs, Concettina Guerra, Rami Melhem

Department of Computer Science Technical Reports

No abstract provided.

Automatic Parameterization Of Rational Curves And Surfaces Iii: Algebraic Plane Curves, Shreeram S. Abhyankar, Chanderjit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.

An O(H**6) Quintic Spline Collocation Method For Fourth Order Two-Point Boundary Value Problems, M. Irodotou-Ellina, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

Parallel Algorithms For Some Functions Of Two Convex Polygons, Mikhail J. Atallah, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.

Distributed Recovery In Applicative Systems, Frank C. H. Lin, Robert M. Keller

All HMC Faculty Publications and Research

Applicative systems are promising candidates for achieving high performance computing through aggregation of processors. This paper studies the fault recovery problems in a class of applicative systems. The concept of functional checkpointing is proposed as the nucleus of a distributed recovery mechanism. This entails incrementally building a resilient structure as the evaluation of an applicative program proceeds. A simple rollback algorithm is suggested to regenerate the corrupted structure by redoing the most effective functional checkpoints. Another algorithm, which attempts to recover intermediate results, is also presented. The parent of a faulty task reproduces a functional twin of the failed task. …