Digital Commons Network^™

Micro Database Management System Language, Karen Yingling Tam, George Winston Zobrist

Computer Science Technical Reports

There are two approaches to solve computational problems in a microcomputer environment:

1. Non-database approach: uses a high level programming language with non-database files as input and/or output files.
2. Database approach: uses the programming language embedded in the micro Data Base Management System(DBMS), with the database defined by the integrated database definition language as input and/or output files.

Adopting the appropriate approach in any single application may save cost and time. This paper compares the two different approaches while solving the same Control Section (CSECT) Interaction Hierarchy problem and suggests which to use when.

Implementation Of Raid, Bharat Bhargava, John Riedl

Department of Computer Science Technical Reports

No abstract provided.

Reconstruction Of A Real Object Using Stereo Vision, Ignatios E. Vakalis

Masters Theses

The problem of reconstructing a three dimensional object from its two dimensional image is the most critical problem which any powerful visual system must solve. The human visual system is known to solve this problem with impressive range and resolution. Computer solutions have fallen far short of human performance mainly because the solution process is poorly understood.

The reconstruction problem is solved using stereo vision. The distance of points on the object from the viewing device and the orientation of specific patches of the visual surface with respect to the viewing device are computed. Discontinuities in distance and orientation are …

Algorithms For Planar Geometric Models, Chanderjit Bajaj, Myung-Soo Kim

Department of Computer Science Technical Reports

No abstract provided.

Potential Evaluation Directions For Ellpack, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

On The Effects Of Synchronization In Parallel Computing, Dan C. Marinescu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Deduction Of A Functional Dependency From A Set Of Functional Dependencies, James M. Richardson, Daniel C. St. Clair

Computer Science Technical Reports

This paper describes an algorithm called the Deduction Tracing Algorithm (DTA) which utilizes basic properties of functional dependencies from database systems and a modification of a tree search algorithm from artificial intelligence. The algorithm takes a set of functional dependencies, F, along with a specific functional dependency L → R as input and produces a list of functional dependencies from F that can be used to deduce L → R. The resulting algorithm is easily automated to provide relational database users with a tool for organizing their queries.

Intensity Blending Of Computer Image Generation-Based Displays, Elizabeth Scheppler Reidelberger, Daniel C. St. Clair

Computer Science Technical Reports

State-of-the-art combat simulators require a 360 degree field of view, allowing the pilot and radar intercept officer to have the same visibility in the simulator that they would experience in the aircraft. The sky/earth display must be computer - generated and displayed with a minimum of two channels to provide the most realistic display possible. The two channels of display come together in the dome, forming an equator, that must be as indiscernible to the aircrew as possible. To accomplish this, an algorithm has been developed for controlling the video output which makes the two separate channel displays appear as …

Multiple-Screen Panning System, Abdo Fathy Youssef

Theses

There is a need to provide graphics capabilities for the objective of "Group Graphics". This is the ability of a group of humans to work collaboratively on the same diagram. It is the intent of this project to provide some of the fundamental software tools to allow a group of individuals to deal with a "mosaic" form of graphics made up of many separate screens that can be panned and conceptually edited by each individual who is working on portions of the overall document.

Simple tools are provided for the creation of graphics screens as well as saveing and retrieving …

A Linear-Processor Algorithm For Depth-First Search In Planar Graphs, Gregory E. Shannon

Department of Computer Science Technical Reports

No abstract provided.

A Parallel Spline Collocation-Capacitance Method For Elliptic Parallel Differential Equations, C. C. Christara, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Comments On Mohr And Henderson's Path Consistency, Ching-Chih Han, Chia-Hoang Lee

Department of Computer Science Technical Reports

No abstract provided.

Structure And Motion From Two Perspective Views Via Planar Patch, Chia-Hoang Lee

Department of Computer Science Technical Reports

No abstract provided.

Fault Tolerance In Networks Of Bounded Degree, Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal

All HMC Faculty Publications and Research

Achieving processor cooperation in the presence of faults is a major problem in distributed systems. Popular paradigms such as Byzantine agreement have been studied principally in the context of a complete network. Indeed, Dolev [J. Algorithms, 3 (1982), pp. 14–30] and Hadzilacos [Issues of Fault Tolerance in Concurrent Computations, Ph.D. thesis, Harvard University, Cambridge, MA, 1984] have shown that Ω(t) connectivity is necessary if the requirement is that all nonfaulty processors decide unanimously, where t is the number of faults to be tolerated. We believe that in forseeable technologies the number of faults will grow with the size of the …

Resource Sharing: A Study Of Florida's Shared-Used Library Collections, Susan Anderson

CCAC Theses and Dissertations

Designed to provide library service for two or more different groups of library users in one library facility, shared-use or joint-use libraries are a unique aspect of library resources sharing. Thirteen examples of shared-use library collections in shared or joint-use library facilities in Florida were examined in this investigation. Special focus was placed on the perceptions of librarians who work in these libraries in order to determine how well the libraries meet the information needs on users and how successful the libraries are in conserving financial resources as a result of combined collections. A design of a special resource collections …

The Utilization Of Competitive Intelligence In Strategic Planning, Sallyann Carr

CCAC Theses and Dissertations

No abstract provided.

Evaluation Of 3d Voxel Rendering Algorithms For Real-Time Interaction On A Simd Graphics Processor, Don Schreiter, John B. Zimmerman

All Computer Science and Engineering Research

The display of three-dimensional medical data is becoming more common, but current hardware and image rendering algorithms do not generally allow real-time interaction with the image by the user. Real-time interactions, such as image rotation, utilize the motion processing capabilities of the human visual system, allowing a better understanding of the structures being imaged. Recent advances in general purpose graphics display equipment could make real-time interaction feasible in clinical setting. We have evaluated the capabilities of one type of advanced display architecture, the PIXAR Imaging Computer, for real-time interaction while displaying three-dimensional medical data as two-dimensional projections. It was discovered …

Micro Database Management System Language, Karen Yingling Tam

Masters Theses

"There are two approaches to solve computational problems in a microcomputer environment:

1. Non-database approach: uses a high level programming language with non-database files as input and/or output files.
2. Database approach: uses the programming language embedded in the micro Data Base Management System(DBMS), with the database defined by the integrated database definition language as input and/or output files.

Adopting the appropriate approach in any single application may save cost and time. This paper compares the two different approaches while solving the same Control Section (CSECT) Interaction Hierarchy problem and suggests which to use when"--Abstract, page ii.

Metaprolog User Manual, Hamid Bacha

Electrical Engineering and Computer Science - Technical Reports

MetaProlog is a logic-based programming language which subsumes the full Prolog language. This implementation is an incremental compiler (which also looks and feels like an interpreter) supporting meta-level constructs that are usually provided by the underlying architecture in other systems and are not directly available to the user. The most obvious feature of MetaProlog is the ability to handle multiple databases (referred to as theories) at the same time. In contrast to ordinary Prolog’s single-theory database, a MetaProlog database is a collection of theories. A theory is a first-class object and can be passed around as the value of a …

Hardware Algorithms For Data Compression, N. Ranganathan

Retrospective Theses and Dissertations

Data compression is the reduction of redundancy m data representation in order to decrease storage and communication costs. Data compression techniques have been used in practice primarily through software implementations which fail to meet the speed and performance requirements of current and future systems. This Ph.D. dissertation presents a set of hardware algorithms for compression and decompression techniques and the results of detailed simulations performed to quantify the effects of incorporating such hardware in various architectural environments. A new pipelined algorithm for data compression applicable to static binary encoding schemes is presented. A fast hardware algorithm for decompression that uses …

Automatically Generating Syntax-Directed Editors For Graphical Languages, Farahangiz Arefi

Retrospective Theses and Dissertations

This research is concerned with the automatic generation of syntax-directed editors for graphical programming languages. A specification technique that is used to uniformly define graphical languages along with their syntax-directed editors is developed. The novel aspect of this specification technique, called a general graph transformation system, is that the graphical languages are described by specifying a family of editing operations. In this manner, a language is defined as a dynamic object which, by applying different editing operations, changes from one form to another, each form representing a sentence of the language. In order to demonstrate this process, the language of …

Generating Multiple User Interfaces For Multiple Application Domains, Mahesh Hassomal Dodani

Retrospective Theses and Dissertations

This Ph.D. dissertation presents a classification scheme for User Interface Development Environments (UIDEs) based on the multiplicity of user interfaces and application domains that can be supported. The SISD, SIMD and MISD [S= Single, I= user Interface(s), M= Multiple, D= application Domain(s)] generator classes encompass most of the UIDEs described in the literature. A major goal of this research is to allow any user to develop a personalized interface for any interactive application, that is, the development of an MIMD UIDE.

Fundamental to the development of such a UIDE is the complete separation of the user interface component from the …

On K - Y - Insensitive Donimation, Teresa Haynes Rice

Retrospective Theses and Dissertations

A connected graph G is defined to be k-1-insensitive if the domination number 1(G) is unchanged when an arbitrary set of k edges is removed. The problem has been solved fork= 1. This Ph.D. dissertation focuses on finding extremal k-1-insensitive graphs on p nodes, fork~ 2. A graph is extremal if it has the minimum number of edges. Two subproblems are considered. The first, which has been solved completely, specifies that the same set of nodes dominates each graph obtained from G by removing k edges. The second requires only that the graph G be connected. This is a much …

A Relational Object-Oriented Management System And An Encapsulated Object-Oriented Programming System, Michael L. Nelson

Retrospective Theses and Dissertations

The purpose of the Relational Object-Oriented Management System (ROOMS) is to show that the relational database scheme is a viable approach for storing objectoriented data. ROOMS is designed so that it can be implemented in any object-oriented language with appropriate I/O commands, or added to any objectoriented database management system that allows userdefined collections of data. Various problems were encountered in developing ROOMS. While these problems have been solved, the best solution is to use the Encapsulated Object-Oriented Programming System (EOOPS) . EOOPS is based upon an inheritance scheme which preserves encapsulation. This encapsulated approach avoids the problems associated with …

Some Optimally Adaptive Parallel Graph Algorithms On Erew Pram Model, Sajal K. Das

Retrospective Theses and Dissertations

The study of graph algorithms is an important area of research in computer science, since graphs offer useful tools to model many real-world situations. The commercial availability of parallel computers have led to the development of efficient parallel graph algorithms.

Using an exclusive-read and exclusive-write (EREW) parallel random access machine (PRAM) as the computation model with a fixed number of processors, we design and analyze parallel algorithms for seven undirected graph problems, such as, connected components, spanning forest, fundamental cycle set, bridges, bipartiteness, assignment problems, and approximate vertex coloring. For all but the last two problems, the input data structure …

Fractals With Arbitrary Segment Lengths, Daniel Michael Doerer

Masters Theses

"Work in the area of fractal geometry has generally focused on a specific facet of the discipline at the expense of other interesting features. This approach often generates more questions than answers for the general audience due to the lack of unification across all views. It appears that a common thread to relate all aspects of fractal characteristics is missing. This paper addresses this question and presents some new and fascinating results. For example, in-depth mathematical analysis often defers to the intriguing and attractive graphical displays produced by mapping the complex plane to the pixel field on a CRT. Both …

Intensity Blending Of Computer Image Generation-Based Displays, Elizabeth Scheppler Reidelberger

Masters Theses

"State-of-the-art combat simulators require a 360 degree field of view, allowing the pilot and radar intercept officer to have the same visibility in the simulator that they would experience in the aircraft. The sky/earth display must be computer - generated and displayed with a minimum of two channels to provide the most realistic display possible. The two channels of display come together in the dome, forming an equator, that must be as indiscernible to the aircrew as possible. To accomplish this, an algorithm has been developed for controlling the video output which makes the two separate channel displays appear as …

Computer Control Of A Pbx Washout Plant, Scott Cameron Sharp

Masters Theses

"A fully automated, computer controlled plant has been designed specifically for safe removal of plastic bonded explosives (PBX) from obsolete military munitions. This PBX washout plant consists of a two stage delivery system and robotically operated high pressure waterjet lance. The assigned task was to develop control packages for each component.

The first stage of the delivery system is a battery operated overhead trolley. Its control package consist of a dedicated computer, DC motor and custom positioning subprograms. The dedicated computer communicates through an infrared link to the operator's computer. This link was developed due to requirements of a hazardous …

A Study Of Connected Component Labeling Algorithms On The Mpp, Susanne E. Hambrusch, Lynn Tewinkel

Department of Computer Science Technical Reports

No abstract provided.

A Fast Fault Simulation Algorithm For Combinational Circuits, Wuudiann Ke, Sharad C. Seth, Bhargab B. Bhattacharya

School of Computing: Conference and Workshop Papers

The performance of a fast fault simulation algorithm for combinational circuits, such as the critical path tracing method, is determined primarily by the efficiency with which it can deduce the detectability of stem faults (stem analysis). We propose a graph based approach to perform stem analysis. A dynamic data structure, called the criticality constraint graph, is used during the backward pass to carry information related to self masking and multiple-path sensitization of stem faults. The structure is updated in such a way that when stems are reached their criticality can be found by looking at the criticality constraints on their …