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

Quick Ceph™, A Computer Program For Cephalometric Analysis And Treatment Planning, Günther Blaseio

Loma Linda University Electronic Theses, Dissertations & Projects

The quantification of cephalometric radiographs is an integral part of orthodontic treatment planning. Numerous computer programs have been designed to digitize headfilms and to provide accurate graphic output and exact measurements. Yet these early systems were either huge, bulky and expensive or were limited in their practical use. The aim of this development was to combine modern computer and electronic equipment with advanced software engineering. The result is a universal cephalometric program written in the computer language "C" with presently seven standard and virtually limitless user definable analyses, growth forecasting, mouse-driven interactive VTO, arch length calculation, superimpositions, table of values …

Making Mail Friendlier: Adding Macintosh Features And Multimedia Documents In Unix Mail, John R. Meier

Dartmouth College Undergraduate Theses

This paper describes a Macintosh application which acts as a front-end to Unix mail. Features of the Macintosh interface such as icons, menus, and windows replace the command driven interface. Complicated editing commands are replaced with mouse selection and cut, copy, and paste. Message can be composed of text, pictures, and any Macintosh file, because they are encoded into plain text, sent through the mail system,and then unencoded by the receiving end. The designs of the mail server and communications interface are such that mail servers and communications other than Unix mail and a serial line may be easily implemented.

Direct Simulation From A Model Specification Language, Richard Pimentel

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

The purpose of this thesis was to develop a program that would accept, as input, a finite set of algebraic equations and simple if-then conditional expressions that model a natural system, and then produce a continuous computer simulation with graphics and tabular output. The equations and conditionals can be in any order and key elements can be missing. The program can be used to run existing models or as a development tool to produce immediate prototypic computer simulations through synergistic man-machine interactions.

The theoretical aspects of automatic program generation were discussed, as well as the architectural design of the system. …

Generic Specifications In Lil And In Ada Via Analogies, George Chester Harrison

Computer Science Theses & Dissertations

We address the problem of .making verifiable specifications in generic program units in the Ada Programming Language*. We illustrate the methodologies of LIL proposed by Joseph Goguen and Justify the use of such a specification languages using analogy programming originally proposed by Nachum Dershowitz. The work in these areas is new and noticeably incomplete. We address our concern about the reusability of Ada software in a programming environment that includes a specification language like LIL. * Ada is a registered trademark of the U.S. Government (Ada Joint Program Office)

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.

Epsilon Precedence Grammars And Languages, Masoud T. Milani

Retrospective Theses and Dissertations

The classes of simple and weak precedence grammars are generalized to include ε-rules (productions with the empty right parts). The descriptive power of epsilon simple precedence (ESP) grammars increases directly with the number of ε-rules permitted; the class of ESP grammars with no ε-rules, ESP₀, is identical to the class of simple precedence grammars; ESP grammars with at most one ε-rule, ESP₁, define a class of languages which properly includes the class of ESP₀ languages, but is itself properly included in the class of deterministic, context-free languages. In general, ESP grammars having at most i …

Automatic Ordering Of Program Units For Execution, Ronald D. Williams

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

A program written in today's sequential programming languages must be written according to a rule which states that source instructions must be written in their exact order of execution. A better rule would be to let the programmer write the instructions in any order he wants- - then let a program figure out the proper order of execution. Such a system applies not only to individual instructions in a procedure or program, but to procedures in a program and to programs in a job stream.

This paper and its associated automatic ordering program introduce a method by which instructions can …

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 …

Multiprocessor Scheduling With Practical Constraints, Kenneth Burton Donovan

Retrospective Theses and Dissertations

The problem of scheduling tasks onto multiprocessor systems has increasing practical importance as more applications are being addressed with multiprocessor systems. Actual applications and multiprocessor systems have many characteristics which become constraints to the general scheduling problem of minimizing the schedule length. These practical constraints include precedence relations and communication delays between tasks, yet few researchers have considered both these constraints when developing schedulers.

This work examines a more general multiprocessor scheduling problem, which includes these practical scheduling constraints, and develops a new scheduling heuristic using a list scheduler with dynamically computed priorities. The dynamic priority heuristic is compared against …

Intra Region Routing, Robert Alan Eustace

Retrospective Theses and Dissertations

The custom integrated circuit routing problem normally requires partitioning into rectangular routing regions. Natural partitions usually result in regions that form both "channels" and "areas". This dissertation introduces several new channel and area routing algorithms and measures their performance.

A formal description of the channel routing problem is presented and a relationship is established between the selection of intervals for each track and the number of tracks in the completed channel. This relationship is used as an analysis tool that leads to the development of two new and highly effective channel routing algorithms: the Revised and LCP algorithms. The performance …

Tutorials For Software : A Comparison Of The Appleworks Software Tutorial With Pre-Entered Data And An Experimental Tutorial With User Entered Data, Toni L. Steil

University of the Pacific Theses and Dissertations

The attention directed toward computer software research has been sparse which is quite evident in particular facets such as learning methods, specifically towards tutorials. Some authors have identified various important issues which include cognitive factors, reduction of presentation of superfluous information, and the importance of interaction with software and hardware. The present . study examined two tutorials which were similar except in their level of required user behaviors. Tutorial A required only user manipulation of disk stored data. Tutorial B required the user to enter the data into the computer, design the screen format, and then to manipulate it. It …

Senior Honors Project, Kelly Dyksterhouse

Honors Theses

The Statistical Analysis Project is a computer program that interacts with a person to discover the type of statistical test that person should use. Essentially, this program is intended to assist students, faculty and researchers in choosing the correct statistical procedure to use in a particular situation. For example, there are many different types of tests a person can use to test the mean of data but each test is used in a different situation. This program will tell you which test to use based on the situation you give it. This project was started by Anika Forsblad in 1985.

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 …

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

Doctoral Dissertations

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