Computer Sciences Commons^™

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.

Medial Axis Transform Using Ridge Following, Richard Mark Volkmann, Daniel C. St. Clair

Computer Science Technical Reports

The intent of this investigation has been to find a robust algorithm for generation of the medial axis transform (MAT). The MAT is an invertible, object centered, shape representation defined as the collection of the centers of disks contained in the shape but not in any other such disk. Its uses include feature extraction, shape smoothing, and data compression. MAT generating algorithms include brushfire, Voronoi diagrams, and ridge following. An improved implementation of the ridge following algorithm is given. Orders of the MAT generating algorithms are compared. The effects of the number of edges in the polygonal approximation, shape area, …

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 …

Ethernet Performance: Design And Implementation Study, Michael M. Chaney, Tachen L. Lo, Daniel C. St. Clair

Computer Science Technical Reports

General concepts concerning local area network designs, functions and topologies will be presented. Ethernet as a multipoint bus topology local area network will be presented in detail. The Carrier Sense Multiple Access/Collision Detect (CSMA/CD) method of fairly regulating access to the shared network bus is studied. The Ethernet Network in relation to the Open Systems Interconnect (OSI) is reviewed, but only the layers pertaining to Ethernet are discussed throughout the majority of the paper. The specifications as described by Xerox, Digital and Intel are presented to help the designer understand the network's physical limitations. Analytical models are used to predict …

A Representation For Serial Robotic Tasks, Barry Ross Fox, Arlan R. Dekock

Computer Science Technical Reports

The representation for serial robotic tasks proposed in this thesis is a language of temporal constraints derived directly from a model of the space of serial plans. It was specifically designed to encompass problems that include disjunctive ordering constraints. This guarantees that the proposed language can completely and, to a certain extent, compactly represent all possible serial robotic tasks. The generality of this language carries a penalty. The proposed language of temporal constraints is NP-Complete. Specific methods have been demonstrated for normalizing constraints posed in this language in order to make subsequent sequencing and analysis more tractable. Using this language, …

A Routing Algorithm For Three Stage Rearrangeable Clos Networks, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

No abstract provided.

A Logic Programming Model Of The Game Of Sprouts, Ralph M. Butler, Selden Y. Trimble, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

The Game of Sprouts Has Intrigued Mathematicians for Nearly Twenty Years. This Paper Describes a Representation Scheme Which Simplifies Much of the Geometry of the Game. using This Representation, We Develop a Prolog Program Which Will Play Sprouts. It is Hoped that the Program Will Prove to Be a Useful Research Tool in Finding the Key to a Winning Strategy for Sprouts and that the Representation Will Serve as a Useful Model for Studying Planar Graphs.

A Logic Programming Model Of The Game Of Sprouts, Ralph M. Butler, Selden Y. Trimble, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

The Game of Sprouts Has Intrigued Mathematicians for Nearly Twenty Years. This Paper Describes a Representation Scheme Which Simplifies Much of the Geometry of the Game. using This Representation, We Develop a Prolog Program Which Will Play Sprouts. It is Hoped that the Program Will Prove to Be a Useful Research Tool in Finding the Key to a Winning Strategy for Sprouts and that the Representation Will Serve as a Useful Model for Studying Planar Graphs. © 1987, ACM. All Rights Reserved.

A Dynamic Caching Algorithm Based On C. C. Chang's Ordered Minimal Perfect Hashing Scheme, Thomas J. Sager

Computer Science Technical Reports

No abstract provided.

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

Computer Science Technical Reports

In this paper, LILY, a generator for compiler frontends is described. LILY uses a generator of minimal perfect hash functions, MPHF , to create small fast compilers.

A Dynamic Caching Algorithm Based On C. C. Chang's Ordered Minimal Perfect Hashing Scheme, Thomas J. Sager

Computer Science Technical Reports

An algorithm for storage and retrieval in a small dynamic cache is presented. This algorithm is based on C.C. Chang’s ordered minimal perfect hashing scheme. Our algorithm has the property that it divides the set of objects that could occupy the cache into an arbitrary number of equivalence classes. The only restriction on which objects can occupy the cache are that no two objects in the same equivalence class can be in the cache at the same time. Retrieval from the cache is performed in constant time. Update of the cache is performed in logarithmic time.

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 …

Multilist And Inverted File System Performance Measurements, Ashok Chandramouli

Masters Theses

"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"--Abstract, page ii.

A Proposed C Language Binding For The Graphical Kernel System-3d, Mark Gerard Bolten

Masters Theses

"This thesis introduces a proposed C language binding definition for the International Standards Organization's draft international standard of the Graphical Kernel System-3D. 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"--Abstract, page ii.

Ethernet Performance: Design And Implementation Study, Michael M. Chaney

Masters Theses

"General concepts concerning local area network designs, functions and topologies will be presented. Ethernet as a multipoint bus topology local area network will be presented in detail. The Carrier Sense Multiple Access/Collision Detect (CSMA/CD) method of fairly regulating access to the shared network bus is studied. The Ethernet Network in relation to the Open Systems Interconnect (OSI) is reviewed, but only the layers pertaining to Ethernet are discussed throughout the majority of the paper. The specifications as described by Xerox, Digital and Intel are presented to help the designer understand the network's physical limitations. Analytical models are used to predict …

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.

Medial Axis Transform Using Ridge Following, Richard Mark Volkmann

Masters Theses

"The intent of this investigation has been to find a robust algorithm for generation of the medial axis transform (MAT). The MAT is an invertible, object centered, shape representation defined as the collection of the centers of disks contained in the shape but not in any other such disk. Its uses include feature extraction, shape smoothing, and data compression. MAT generating algorithms include brushfire, Voronoi diagrams, and ridge following. An improved implementation of the ridge following algorithm is given. Orders of the MAT generating algorithms are compared. The effects of the number of edges in the polygonal approximation, shape area, …

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.

Training For The Airland Battle With Modeling And Simulation On The Microcomputer, David Dean Holmes

Masters Theses

"This paper describes a methodology for modifying a combat training simulation model to include a comprehensive data structure and computer software, to allow the model to be implemented on a microcomputer. It begins by developing a topology for combat simulation models and proceeds to define a data structure suitable for describing military units and facilitating the varied aspects of the simulation. An eclectic approach to the development of the model and the implementing software is followed throughout. Appropriate aspects of a number of models are incorporated into a single model suitable for training military commanders and their staffs. PASCAL, a …

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

Computer Science Technical Reports

No abstract provided.

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 …

Mica: Prototyping An Expert System Consultant, Joseph Howard Marchal, Arlan R. Dekock

Computer Science Technical Reports

The United States, as the world's largest producer and consumer of scrap and flake mica, has an obvious economic interest in applications of artificial intelligence technology that would expedite beneficiation of mica. In the fall of 1985, personnel of the Tuscaloosa and Rolla research centers of the Bureau of Mines and of the University of Missouri-Rolla, Institute for Artificial Intelligence started the following long term research project: Develop an Expert System Consultant for the three basic stages of mica beneficiation: Stage 1: characterization of the material; Stage 2: treatment to obtain a concentrate; and Stage 3: evaluation of the resulting …

Genesis Of An Expert System For Umr Degree Auditing, Ruth Sue Dare, Arlan R. Dekock

Computer Science Technical Reports

This paper describes the features, design, and development of an expert system for degree auditing at the University of Missouri--Rolla. It summarizes artificial intelligence as it is known today while specifically addressing expert systems. It describes selected expert systems currently in existence.

The present audit procedure utilized at the University of Missouri--Rolla is discussed. A description is given of the design and development of an expert system, written in LISP, to conduct a degree audit. Finally there are concluding remarks which include an analysis of the system and a discussion of possible system enhancement.

A Computerized Audio-Visual Speech Model, Joaquin Alberto Vila Ruiz, Arlan R. Dekock

Computer Science Technical Reports

This thesis describes an expert system able to animate (graphically) and reproduce (acoustically) a text in any language which uses the Latin alphabet. A rule editor has been developed to create and modify the set of letter-to-sound rules of the target language. A parser has been implemented to apply the set of rules and translate text-to-speech. Each phoneme has a unique sound and thus requires its particular positioning of the vocal organs which are displayed in two different projections: a front view and a profile cross view of a human face in synchronization with the output sounds of the speech …

Data Structure For The Use Of Patterns In The Perceptual Ordering Of The Game Of Chess, Russ L. Hanna, Arlan R. Dekock

Computer Science Technical Reports

It is well known that the way one perceives a problem can influence the difficulty of solving the problem in a profound way. In the case of computer chess playing programs, one finds that most programs perceive the game in much the same way. They are all based on Shannon's original proposal for chess playing programs. His approach was to generate all of the possible combinations of moves up to a certain number of plays and then a subset of all combinations to a deeper level thereafter. Each of these moves would then be evaluated as to its relative worth. …

A Semantic Basis For Parallel Algorithm Design, Roger E. Eggen, John R. Metzner

Computer Science Technical Reports

As computing demands increase, emphasis is being placed on parallel architectures- To efficiently use parallel machines, software must be designed to take advantage of these machines. This research concentrates on an abstraction of algorithm design to permit the expression of parallel programs. The abstraction emphasizes thought about algorithms at a high level as opposed to algorithm implementation at a statement level. A model based on data flow allows algorithm expression using flow diagrams. The model specifies operating system requirements that support parallel programming at a module level. Paths are used to carry data between modules. Data enter modules through ports. …

Lexical Analysis Using Table Look-Up, Brian Keith Smith, Dominic Soda, George Winston Zobrist

Engineering Management and Systems Engineering Faculty Research & Creative Works

No abstract provided.

Prolog., Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

A Description is Given of Prolog, a Contraction of Programming in Logic, Which Uses the Formalism of Mathematical Logic as its Primary Design Principle. the Structure of Prolog is Examined, and a Database Program is Described to Illustrate its application. an Application to an Artificial Intelligence Problem, the Towers of Hanoi, is Also Given.

Specification And Efficiency Evaluation Of A Data Communications Protocol, Patricia Ann Anderson

Masters Theses

"A data communications protocol for an established operating environment is formally specified. Motivation for the development of this protocol is presented, with consideration for the future communications requirements of the system.

Factors influencing the performance of a protocol are reviewed. Error recovery, network addressing, flow control, traffic prioritization, and initialization and termination sequences are examined in general and with respect to the protocol development.

In conclusion, a mathematical evaluation of the efficiency of the protocol is provided, using Tanenbaum's equations for determining channel utilization. The theoretical channel utilization of a perfect system, without propagation delay or error, is compared with …