Physical Sciences and Mathematics Commons^™

Data Base Design For Research In Comparative Zapotec, Anita C. Bickford

Theses and Dissertations

This thesis explores the nature and content of a comparative data base for the Zapotec languages of Mexico that may be produced. Many questions are discussed: how to sub-divide and list the Zapotec languages and dialects; what data format will be most accessible to researchers as well as to field workers with data to add; computer software considerations (designing computational tools); how to handle non-cognates with shared meanings, non-overlap of glosses (i.e., one Zapotec gloss covers several Spanish words, or vice versa), semantic shifts and secondary meanings, and other problems such as special characters, free variation, elisions, etc.; whether to …

An Efficient Implementation Of Logical Design For Relational Databases, Shakeel Ishaque

Masters Theses

This work presents efficient methodology for the design of relational databases and an implementation of a design tool. A set of algorithms and supporting theory are discussed. Improvements are made on existing decomposition approaches.

The Dependency Preserving Normal Fom (DPNF), which is stronger than 3NF, is presented. It guarantees a decomposition with lossless join property and at the same time preserves all of the functional dependencies.

An algorithm to obtain DPNF decomposition is presented. The algorithm computes DPNF decomposition in polynomial time. It converts supplied functional dependencies to annular cover and uses reduced annular cover to compute closures and decomposition. …

A Generalized Data Distribution Model For Distributed Relational Databases, Patrick D. Yurk

Masters Theses

This thesis presents a generalized model for the allocation of data in a distributed relational database. The model is applicable to a network of computers where there are different retrieval and update costs at the various sites, and different communication costs between sites.

The method used in this model is based upon clustering of similar computers within the network. Clusters are derived from grouping together sites with similar update, retrieval and communication costs. Data is then allocated to a cluster based on actual communication and processing costs.

The data distribution method between clusters uses a technique where the benefit of …

Software Reliability Models, Syed Afzal Hossain

Mathematics & Statistics Theses & Dissertations

The problem considered here is the building of Non-homogeneous Poisson Process (NHPP) model. Currently existing popular NHPP process models like Goel-Okumoto (G-O) and Yamada et al models suffer from the drawback that the probability density function of the inter-failure times is an improper density function. This is because the event no failure in (0, oo] is allowed in these models. In real life situations we cannot draw sample(s) from such a population and also none of the moments of inter-failure times exist. Therefore, these models are unsuitable for modelling real software error data. On the other hand if the density …

On The Unique Tree Representation Of Graphs, Beverly Jamison

Computer Science Theses & Dissertations

This dissertation investigates classes of graphs which admit tree representations unique up to isomorphism. The definitions of these classes are based on local properties of P₄'s, A template structure theorem is given which illustrates the nature of the local properties. The template theorem is instantiated for three different classes of graphs. Properties specific to each of the classes are used to produce a tree representation which can be used for graph computations, such as efficient resolution of graph isomorphism. Linear time algorithms for the recognition of three classes of graphs and for the construction of their tree representations …

The Implementation Of A Generalized Database Directory, Claudia Helms-Vaccaro

Masters Theses

This paper presents the use of an index made up of a single B+ tree connected at its leaf nodes to a lower set of B+ trees--a multitree. It may be utilized to index dense or non-dense attributes of a file. An extra benefit of this structure is the ability to store a secondary attribute value for use when searching the index, often decreasing accesses and time required to complete the search.

Improved efficiency over current indices, such as conventional B+ trees or inverted files, is evaluated.

An Analysis Of High Dimensional Data, Ravishankar Swamy

Masters Theses

Projection of a high dimensional data set into a two dimensional subspace can lead to very interesting projections. Note that P dimensional data can be projected onto P orthogonal two dimensional planes, which completely determines the original data. Two dimensional orthogonal projections can be analyzed for patterns in several ways.

In this work we will be trying to explore an unknown P dimensional data set by comparing its test projections with a set of standard patterns. A set of P dimensional data is transformed into K.K grid counts and the whole process of recognition is done using these K.K grid …

Data Reduction Procedure For An Experimental Method Of Measuring The Velocity-Coupled Response Function Of Solid Propellants, William H. Jarvis

Master's Theses - Daytona Beach

A computer program has been developed for calculation of the velocity-coupled response function of solid-propellants from experimentally measured pressure data. The proposed velocity-coupled response function measurement apparatus consists of an end-burner combustor where the propellant sample is oscillated in a direction normal to the flow in the presence of a standing acoustic wave within the combustion chamber. The pressure measurements are made at select points along the length of the chamber.

The data reduction program consists of a Runge-Kutta routine driven by a BFGS multivariable search routine. The Runge-Kutta routine determines the pressure distribution within the chamber of the proposed …

A Classification Approach For Automated Reasoning Systems--A Case Study In Graph Theory, Rong Lin

Computer Science Theses & Dissertations

Reasoning systems which create classifications of structured objects face the problem of how object descriptions can be used to reflect their components as well as relations among these components. Current reasoning systems on graph theory do not adequately provide models to discover complex relations among mathematical concepts (eg: relations involving subgraphs) mainly due to the inability to solve this problem. This thesis presents an approach to construct a knowledge-based system, GC (Graph Classification), which overcomes this difficulty in performing automated reasoning in graph theory. We describe graph concepts based on an attribute called Linear Recursive Constructivity (LRC). LRC defines classes …

Performance Modeling And Enhancement For The Atamm Data Flow Architecture, Sukhamoy Som

Electrical & Computer Engineering Theses & Dissertations

Algorithm To Architecture Mapping Model (ATAMM) is a new marked graph model from which the rules for data and control flow in a homogeneous, multicomputer, data flow architecture may be defined. This research is concerned with performance modeling and performance enhancement for periodic execution of large-grain, decision-free algorithms in such an ATAMM defined architecture. Performance measures and bounds are established. Algorithm transformation techniques are identified for performance enhancement and reduction of computing element requirements. Operating strategies are developed for optimum time performance and for sub-optimum time performance under limited availability of computing elements. An ATAMM simulator is used to test …

Library Automation In South Carolina Media Centers, Nellita P. Dubose

CCE Theses and Dissertations

This investigation, which was started in April, 1988, was designed to assess the extent of automation in academic and public libraries and school library media centers in the state of South Carolina as well as the prevailing attitude toward library automation. School media specialists were surveyed at their annual convention, and public and academic librarians were mailed the same surveys to ascertain the percentage of media centers in the process of automating a part or all its processes and to determine their attitude toward library automation. From the results of the study, one sees that the direction of library automation …

Interactive Simulations For Knowledge Acquisition, Sorel Bosan

Dissertations, Theses, and Masters Projects

No abstract provided.

Adaptation Of Lr Parsing To Production System Interpretation, Louis Paul Slothouber

Dissertations, Theses, and Masters Projects

This thesis presents such a new production system architecture, called a palimpsest parser, that adapts LR parsing technology to the process of controlled production system interpretation. Two unique characteristics of this architecture facilitate the construction and execution of large production systems: the rate at which productions fire is independent of production system size, and the modularity inherent in production systems is preserved and enhanced. In addition, individual productions may be evaluated in either a forward or backward direction, production systems can be integrated with other production systems and procedural programs, and production system modules can be compiled into libraries and …

Teacher Utilization Of A Middle School Media Program: A Case Study, Earnestine T. Mccloud

CCE Theses and Dissertations

The goal of this research study was to determine the effectiveness of the media center within the school environment. The components of the media center program that should be strengthened were identified. The role of the media center, teachers, and staff in facilitating media center goals and objectives were evaluated.

Permission to survey teachers of the Lemmel Middle School was granted by the assistant Superintendent of Planning and Research. The letter of introduction, the questionnaire, directions for completing the questionnaire, and self-addressed, return envelopes were placed in the teachers' mailboxes.

To facilitate in the processing of the questionnaires, the data …

A Microcomputer-Based Cia System Designed To Compliment Traditional Instruction In Navy Technical Training, John M. Kaiser

CCE Theses and Dissertations

A prototype microcomputer-based CBI program was developed to provide review, structured self-study, and remediation to students undergoing initial skills training at the Naval Air Technical Training Center (NATTC), Lakehurst, NJ. The program demonstrates the capabilities of the authoring (LSAUT) and delivery (LSSTU) programs that are parts of the Language Skills Computer Aided Instruction (LSCAI) system developed by the Navy Personnel Research and Development Center and the University of Utah. A course of instruction at NATTC, Lakehurst was selected for this project on the basis of level of training, student throughput, attrition and setback rates, and category of learning objectives. Student …

Edge Contours, Donna J. Williams

Retrospective Theses and Dissertations

The accuracy with which a computer vision system is able to identify objects in an image is heavily dependent upon the accuracy of the low level processes that identify which points lie on the edges of an object. In order to remove noise and fine texture from an image, it is usually smoothed before edge detection is performed. This smoothing causes edges to be displaced from their actual location in the image. Knowledge about the changes that occur with different degrees of smoothing (scales) and the physical conditions that cause these changes is essential to proper interpretation of the results …

Automated Translation Of Digital Logic Equations Into Optimized Vhdl Code, John Evan Stark

Masters Theses

"It was desired to develop an algorithm for the automated translation of' finite slate machines from state table form to optimized VHDL form. To do this, algorithms arc needed for reducing the state machine to simplest form, making state assignments, producing minimal logic equations to represent the state machine, and producing VHDL code which describes the intended circuit. Various such algorithms were examined and a prototype program written to perform this translation"--Abstract, page ii.

Graph Coloring Algorithms On Random Graphs, Shi-Jen Lin

Doctoral Dissertations

"The graph coloring problem, which is to color the vertices of a simple undirected graph with the minimum number of colors such that no adjacent vertices are assigned the same color, arises in a variety of scheduling problems. This dissertation focuses attention on vertex sequential coloring. Two basic approaches, backtracking and branch-and-bound, serve as a foundation for the developed algorithms. The various algorithms have been programmed and applied to random graphs. This dissertation will present several variations of the Korman algorithm, Korw2, Pactual, and Pactmaxw2, which produce exact colorings quicker than the Korman algorithm in the average for some classes …

The Directed Steiner Problem On Graphs: A Simulated Annealing Approach, Lawrence Joseph Osborne

Doctoral Dissertations

"The well-known Steiner Problem on Graphs is an NP-complete problem for which there are many heuristic and exact algorithms that are deterministic. In this dissertation a new approach to the directed version of this problem is made by applying the ideas of statistical mechanics through the use of the method of simulated annealing. A version of annealing is developed for the Directed Steiner Problem and compared with one of the best general annealing schemes. Then a comparison is made between simulated annealing and the traditional branch and bound technique. The dual ascent algorithm of Richard T. Wong is used to …

Ordering Events In A Distributed System: A Performance Evaluation, Jeffrey E. Payne

Dissertations, Theses, and Masters Projects

No abstract provided.

Task-Oriented Display Design: Concept And Example, Terence S. Abbott

Dissertations, Theses, and Masters Projects

No abstract provided.

Small-Kernel Image Restoration, Stephen Edward Reichenbach

Dissertations, Theses, and Masters Projects

The goal of image restoration is to remove degradations that are introduced during image acquisition and display. Although image restoration is a difficult task that requires considerable computation, in many applications the processing must be performed significantly faster than is possible with traditional algorithms implemented on conventional serial architectures. as demonstrated in this dissertation, digital image restoration can be efficiently implemented by convolving an image with a small kernel. Small-kernel convolution is a local operation that requires relatively little processing and can be easily implemented in parallel. A small-kernel technique must compromise effectiveness for efficiency, but if the kernel values …