Digital Commons Network^™

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 …

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.

Distributed Algorithms For Selection In Sets, Greg N. Frederickson

Department of Computer Science Technical Reports

No abstract provided.

Test Generation By Fault Sampling, Vishwani Agrawal, Hassan Farhat, Sharad C. Seth

School of Computing: Conference and Workshop Papers

This paper presents a novel technique of generating tests from a random sample of faults. The entire fault population of the circuit is randomly divided into two groups. Only one group, usually the smaller one, is used for test generation by the test-generator and fault-simulator programs. This group is known as the sample and its coverage is deterministic. The coverage of faults in the remaining group is similar to that of random vectors and is estimated from the distribution of fault detection probabilities in the circuit. As the sample size increases, the fraction of unsampled faults reduces. At the same …

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 …

What Is The Path To Fast Fault Simulation?, Miron Abramovici, Balaji Krishnamurthy, Rob Mathews, Bill Rogers, Michael Schulz, Sharad C. Seth, John Waicukauski

School of Computing: Faculty Publications

Motivated by the recent advances in fast fault simulation techniques for large combinational circuits, a panel discussion has been organized for the 1988 International Test Conference. This paper is a collective account of the position statements offered by the panelists.

Matrix Methods Of Approximating Classical Predator-Prey Problems, E. Y. Rodin, R. Greenberg, B. Nelson

Computer Science: Faculty Publications and Other Works

No abstract provided.

Digital Neural Networks, Tony R. Martinez

Faculty Publications

Demands for applications requiring massive parallelism in symbolic environments have given rebirth to research in models labeled as neural networks. These models are made up of many simple nodes which are highly interconnected such that computation takes place as data flows amongst the nodes of the network. To present, most models have proposed nodes based on simple analog functions, where inputs are multiplied by weights and summed, the total then optionally being transformed by an arbitrary function at the node. Learning in these systems is accomplished by adjusting the weights on the input lines. This paper discusses the use of …

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 …

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.

An Integrated Programming Environment For Pseudo-Code Development, Ipe-Pc, Nurcan Coskun

Doctoral Dissertations

"An Integrated Programming Environment, IPE-PC, that supports pseudo-code development has been designed and implemented. This environment is based on a Pascal-like language which is designed according to the requirements of a language-based environment. The nucleus of IPE-PC is a language-based editor which represents programs as graphs internally. The same representation is used in every mode of the environment (i.e., editing, compilation, execution, debugging and translation). The system provides facilities to take advantage of both top-down and bottom-up programming. Stepwise refinement has been supported by providing comment structures that can be transformed into procedures. Bottom-up programming is supported because it is …

The Role Of Term Symmetry In E-Unification And E-Completion, Blayne E. Mayfield

Doctoral Dissertations

“A major portion of the work and time involved in completing an incomplete set of reductions using an E-completion procedure such as the one described by Knuth and Bendix [KB70] or its extension to associative-commutative equational theories as described by Peterson and Stickel [PS81] is spent calculating critical pairs and subsequently testing them for coherence. A pruning technique which removes from consideration those critical pairs that represent redundant or superfluous information, either before, during, or after their calculation, can therefore make a marked difference in the run time and efficiency of an E-completion procedure to which it is applied.

The …

Symbolic Automation And Numerical Synthesis For Robot Kinematics, Jen Sriwattanathamma

Doctoral Dissertations

"This research analyzes three topics in robot arm kinematics. First, the direct kinematics which determines the Cartesian position and orientation of the end effector for the specified values of joint parameters is analyzed. Second, the differential motions concerning the differential relationships between the command variables in position and orientation of the end effector and the joint-controlled variables are studied. Finally, the inverse kinematics which determines the joint variables for a specified Cartesian position and orientation of the end effector is considered.

This dissertation presents a methodology for incorporating the artificial intelligence types of knowledge into automating solutions for the direct …

Executable Assertion Development For The Distributed Parallel Environment, Bruce M. Mcmillin, L. M. Ni

Computer Science Faculty Research & Creative Works

The use of executable assertions is a powerful tool with which to perform program verification, provide software fault-tolerance, and provide hardware fault-tolerance via the application-oriented paradigm. The authors show that assertions commonly used in the sequential programming environment are inadequate for the distributed parallel environment. In particular, it is shown that even design-based assertions are myopic and provide inadequate error coverage. In their place, a triad of basic metrics is proposed for certain classes of problems that, when applied beginning with the specification phase of the life cycle, produce assertions that are better suited to the parallel environment. This method …

No Antitwins In Minimal Imperfect Graphs, Stephan Olariu

Computer Science Faculty Publications

It is customary to call vertices x and y twins if every vertex distinct from x and y is adjacent either to both of them or to neither of them. By analogy, we shall call vertices x and yantitwins if every vertex distinct from x and y is adjacent to precisely one of them. Lovász proved that no minimal imperfect graph has twins. The purpose of this note is to prove the analogous statement for antitwins.

Deduction Of A Functional Dependency From A Set Of Functional Dependencies, James M. Richardson

Masters Theses

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

A Parallel Implementation Of Stickel's Ac Unification Algorithm In A Message-Passing Environment, David John Kleikamp

Masters Theses

"Unification algorithms are an essential component of automated reasoning and term rewriting systems. Unification finds a set of substitutions or unifiers that, when applied to variables in two or more terms, make those terms identical or equivalent. Most systems use Robinson's unification algorithm or some variant of it. However, terms containing functions exhibiting properties such as associativity and commutativity may be made equivalent without appearing identical. Systems employing Robinson's unification algorithm must use some mechanism separate from the unification algorithm to reason with such functions. Often this is done by incorporating the properties into a rule base and generating equivalent …

Self-Alignments In Words And Their Applications, Alberto Apostolico, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Architecture And Operation Invocation In The Clouds Kernel, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Towards Implementing Robust Geometric Computations, Christoph M. Hoffmann, John E. Hopcroft, Michael S. Karasick

Department of Computer Science Technical Reports

No abstract provided.

Some Efficient Computational Algorithms Related To Phase Models, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.

A Robust Distributed Termination Detection Algorithm, Niraj K. Sharma, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

A System For Experimentation In Replicated Copy Control, Bharat Bhargava, Paul Noll, Andrew Royappa, Donna Sabo

Department of Computer Science Technical Reports

No abstract provided.

Multilist And Inverted File System Performance Measurements, Ashok Chandramouli, George Winston Zobrist

Computer Science Technical Reports

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.

Performance Parameter Measurements Of Generic Files, Sankarraman Subramanian, George Winston Zobrist

Computer Science Technical Reports

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.

Heuristic Coloring Algorithm For The Composite Graph Coloring Problem, Johnnie C. Roberts, Billy E. Gillett

Computer Science Technical Reports

A composite graph is a finite undirected graph in which a positive integer known as a chromaticity is associated with each vertex of the graph. The composite graph coloring problem (CGCP) is the problem of finding the chromatic number of a composite graph, i.e., the minimum number of colors (positive integers) required to assign a sequence of consecutive colors to each vertex of the graph in a manner such that adjacent vertices are not assigned sequences with colors in common and the sequence assigned to a vertex has the number of colors indicated by the chromaticity of the vertex. The …