Physical Sciences and Mathematics Commons^™

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 …

A General Design Tool For Computer Directories, Edward J. Peeler

Masters Theses

The primary objective of a directory is to organize information for efficient retrieval. There are many techniques that can be applied to the design of a directory. One particularly useful technique employs the use of inverted files on range attributes. The technique provides an effective directory for a variety of applications and for very large databases. This paper examines the technique and describes the implementation of a general design tool based on these principles.

An Investigation Into The Numeric Solution Of Linear Recurrence Relations, Dennis Lee Kapenga

Masters Theses

This is an investigation of the use of some techniques from numerical linear algebra in solving linear recurrence relations.

The classic methods of Oliver and Lozier are compared with several alternatives. These alternatives center on using advances in the theory of numerical linear algebra, computer software, and raw computer performance which have been made in the 15 years since the original research into linear recurrence relations was done.

A set of test examples is presented to provide a basis to compare solution methods. This set of examples was selected to allow experiments associated with the Poincare class of recurrence relations. …

A Query Optimization Method For Use In A Generalized Database, Caroline D. Mautz

Masters Theses

Currently proposed methods for retrieval of records from a generalized file organization are not optimal, causing more I\0 retrievals than are necessary. This paper proposes another technique that has near optimal results and has a polynomial order of complexity.

The technique takes as input a query in disjunctive form, sorts the keys in the query in ascending order according to the number of records associated with them, then using a table much like a prime implicant table, systematically searches for a complete cover of the query conjuncts with a minimum total number of records associated with the keys that are …

Syntactic Representation And Analysis Of The Cognitive Structures Underlying Ritual Acts, Robert G. Hardin

Masters Theses

A formal grammar was proposed by Lawson and McCauley (1980) to model the cognitive structures underlying an informant's representation of religious ritual acts. This study classifies the language generated by that grammar as context-sensitive, presents an LR(1) parser for the language, and specifies a computer program to implement that model. The system functions as an Intelligent assistant using techniques involving rule-based systems, non-monotonic logic, and multiple levels of abstraction. Knowledge is represented in a parse tree, rules stored as patterns, and the inference engine uses a pattern matcher. The consequences of an act change over time and can change previous …

A Model Of Syntax-Directed Transduction Of Unrestricted Grammars Using 2pda With Multisymbol Matching Production Rules, Steven William Cooke

Masters Theses

Syntax-directed transduction of unrestricted grammars is modeled by 2PDA automata with multisymbol matching production rules. Syntax-directed transduction normal form grammars (SDT) are constructed for unrestricted grammars. Transduction of sequences of derivation directives to sequences of derivation steps is defined for SDT grammars. E2PDA, a superset of 2PDA with input, output, and multi-symbol matching production rules, is formalized. The class of languages generated by unrestricted grammars. E2PDA syntax-directed transducers are conducted for SDT grammars.

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

Masters Theses

"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 Computerized Audio-Visual Speech Model, Joaquin Alberto Vila Ruiz

Masters Theses

"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 …

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 …

Genesis Of An Expert System For Umr Degree Auditing, Ruth Sue Dare

Masters Theses

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

Mica: Prototyping An Expert System Consultant, Joseph Howard Marchal

Masters Theses

"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 …