Digital Commons Network^™

The Application Of A Sequence Notation To The Design Of Systolic Computations, Rami Melhem, Conceltina Guerra

Department of Computer Science Technical Reports

No abstract provided.

An Exact Analysis For Efficient Computation Of Random-Pattern Testability In Combinational Circuits, Sharad C. Seth, Bhargab B. Bhattacharya, Vishwani Agrawal

School of Computing: Conference and Workshop Papers

Experimental evidence shows that low testability in a typical circuit is much more likely due to poor observability than poor controllability. Thus, from theoretical and practical standpoints, it is important to develop an accurate model for observability computation. One such model, in terms of supergates, is proposed in the first part of this paper thus complimenting our earlier work. It is now possible to obtain exact random-pattern testability for each line in a circuit.

The second part of the paper analyzes the supegate structure of a circuit from a graph theoretic viewpoint. Finding a supergate is related to determining the …

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 …

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

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

Structure Of A Rigid Smooth Space Curve, Chia-Hoang Lee

Department of Computer Science Technical Reports

No abstract provided.

Generation Of Configuration Space Obstacles I: The Case Of A Moving Sphere, Chanderjit Bajaj, Myung-Soo Kim

Department of Computer Science Technical Reports

No abstract provided.

Site Recovery In Replicated Distributed Database Systems, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

Efficient Plane Sweeping In Parallel, Mikhail J. Atallah, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.

Fast Detection And Display Of Symmetry In Trees, Joseph Manning, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.

Industrial Simulation With Animation, Edward T. Hammerand, Chung You Ho

Computer Science Technical Reports

This thesis examines and evaluates the new simulation language PCModel. Prior to the arrival of PCModel, simulation via computer typically resulted in pages of statistics compiled over the duration of the simulation. PCModel's approach is to simulate the model on the display before the user in real time. Additionally, user interaction is supported to allow changes to be made throughout the simulation run.

The evaluation of PCModel is accomplished through inspection of a pair of examples already simulated in a conventional simulation language. The examples show the relative strong and weak points of the language, as well as demonstrating how …

A Generalized Information Structure To Be Used In A Human-Factors Knowledge Base, Bruce J. Wachlin

Theses and Dissertations

The purpose of this thesis is to design a generalized information structure that can be used in a human-factors knowledge base. The information structure will take into account the human factors requirements and the hardware characteristics of the system. In this thesis the design and implementation of several prototype systems of a generalized information structure to be used in a human-factors knowledge base are presented.

A Queueing Model For Token-Passing Computer Networks, Vernon J. Rego, Lionel M. Ni

Department of Computer Science Technical Reports

No abstract provided.

Overloading Of Names In Distributed Systems, Douglas E. Comer, Ralph E. Droms

Department of Computer Science Technical Reports

No abstract provided.

Structure And Motion Of A Rigid Object Having Unknown Constant Motion, Chia-Hoang Lee, Azriel Rosenfeld

Department of Computer Science Technical Reports

No abstract provided.

The Myriad Virtues Of Subword Trees, Alberto Apostolico

Department of Computer Science Technical Reports

No abstract provided.

Data Structures And Algorithms For The String Statistics Problem, A. Apostolico, F. P. Preparata

Department of Computer Science Technical Reports

No abstract provided.

Structural Properties Of The String Statistics Problem, A. Apostolico, F. P. Preparata

Department of Computer Science Technical Reports

No abstract provided.

Remark On Hsu-Du New Algorithm For The Lcs Problem, A. Apostolico

Department of Computer Science Technical Reports

No abstract provided.

Improving The Worst Case Performance Of The Hunt-Szymanski Strategy For The Longest Common Subsequence Of Two Strings, Alberto Apostolico

Department of Computer Science Technical Reports

No abstract provided.

The Longest Common Subsequence Problem Revisited, A. Apostolico, C. Guerra

Department of Computer Science Technical Reports

No abstract provided.

The Boyer-Moore-Galil String Searching Strategies Revisited, Alberto Apostolicao, Raffaele Giancarlo

Department of Computer Science Technical Reports

No abstract provided.

Order Statistics And Other Complex Data Operations On Tree-Structured Dictionary Machines, Michael T. Goodrich, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.

Method And Apparatus For Performing Hashing Operations Using Galois Field Multiplication, John L. Carter, George Markowsky, Mark N. Wegman

Computer Science Faculty Research & Creative Works

The invention comprises a method and apparatus for performing a hashing operation on an N bit number under control of a prespecified N bit hashing constant which comprises performing N/K finite field partial multiplications of the object to be hashed by the hashing constant, utilizing K logic and combinatorial circuits all of which operate in parallel to completely evaluate the number in N/K operations.

Another feature of the present invention is that the hashing constant loaded into the system may be changed at will with a resultant changing of the hashing characteristics to suit a particular class of objects to …

An Efficient Parallel Solution For Euclidean Shortest Paths In Three Dimensions, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.

An Optimal Parallel Algorithm For The All Nearest -- Neighbor Problem For A Convex Polygon, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.

A Distributed Shortest Path Algorithm For A Planar Network, Greg N. Frederickson

Department of Computer Science Technical Reports

No abstract provided.

Generalized Unfoldings For Shortest Paths In Euclidean 3-Space, C. Bajaj, T. T. Moh

Department of Computer Science Technical Reports

No abstract provided.