Physical Sciences and Mathematics Commons^™

Consistency Testing For Data-Flow Circuits, Chu S. Jhon, Robert M. Keller

All HMC Faculty Publications and Research

One means of making VLSI design tractable is to proceed from a high-level specification of a circuit in terms of functionality, to the circuit level. A notable error which may occur in a topdown design starting with a data-flow graph representation of a circuit is a design inconsistency due to deadlock. This paper attempts to further develop the theoretical basis for algorithms which analyze the deadlock property of circuits on the basis of their data-flow graph representations. A systematic scheme to verify the absence of deadlock in data-flow graphs is also presented.

On Monotone Formulae With Restricted Depth, Maria M. Klawe, Wolfgang J. Paul, Nicholas J. Pippenger, Mihalis Yannakakis

All HMC Faculty Publications and Research

We prove a hierarchy theorem for the representation of monotone Boolean functions by monotone Boolean functions by monotone formulae with restricted depth. Specifically, we show that there are functions with Π_k-formulae of size n for which every Σ_k-formula has size exp Ω(n^1/(k-1)). A similar lower bound applies to concrete functions such as transitive closure and clique. We also show that any function with a formula of size n (and any depth) has a Σ_k-formula of size exp O(n^1/(k-1)). Thus our hierarchy theorem is the best possible.

An Analysis Of The Use Of Rademacher-Walsh Spectrum In Compact Testing, Ten-Chuan Hsiao, Sharad C. Seth

School of Computing: Faculty Publications

Earlier approaches to random compact testing use a random pattern generator which depends on the combinational function under test and a circuit signature which remains the same independent of the circuit. In this correspondence we analyze the performance of a new scheme in which the pattern generator is simple and independent of the function being tested but the circuit signature is chosen to be a coefficient from the Rademacher-Walsh (RW) spectrum of the function under test. The analysis provides guidelines for choosing an RW coefficient, a test length, and an error tolerance so as to minimize the probabilities of rejecting …

Characterizing The Lsi Yield Equation From Wafer Test Data, Sharad C. Seth, Vishwani D. Agrawal

School of Computing: Faculty Publications

The results of production test on LSI wafers are analyzed to determine the parameters of the yield equation. Recognizing that a physical defect on a chip can produce several logical faults, the number of faults per defect is assumed to be a random variable with Poisson distribution. The analysis provides a relationship between the yield of the tested fraction of -the chip area and the cumulative fault coverage of test patterns. The parameters of the yield equation are estimated by fitting this relation to the measured yield versus fault coverage data.

Toward A Normative Computer-Aided Contingency Planning Protocol, Peter H. Aiken

Theses and Dissertations

This thesis effort is an investigation into the subject of contingency planning.

Increases in the number of organizations operating in "turbulent environments" have highlighted deficiencies in planning methodologies which attempt to base continued organizational survival upon a single course of action. In these instances, organizations experience an increase in the number of variables and possible events for which they must be prepared. Traditional contingency planning efforts attempt to prepare the organization for the occurrence of events that are foreseen deviations from "the master plan". When operating in turbulent environments, organizations must plan to move quickly through a series of differing …

A Focus Of Attention Algorithm For Expert Systems, Kevin W. Whiting

Masters Theses

"This research is primarily concerned with increasing the performance of expert systems. A refined focus of attention strategy and its affect on performance are discussed. Early expert systems used a brute force approach to process the knowledge base. Each production rule in the knowledge base was evaluated each cycle. More recently, processing efficiency has been increased by focusing the attention of the inference engine on a subset of the rules by "filtering" for further testing, only rules that could possibly fire given the current content of the context base. Focus of attention as developed in this research increases performance over …

Program Modeling And Control Synthesis For Robotic Manipulators, Ramiz Najib Ballou

Masters Theses

"The control and programming methodology of industrial robots is becoming increasingly important. The speed and accuracy of data generation, and the performance of the robot are considered the most important factors in robotics control.

This paper presents and discusses algorithms that solve for the inverse solution for a given point in space at a very high speed based on the top down abstract method. The algorithms are independent of any specific type of manipulator configuration or programming language. The algorithms were implemented or the IBM-PC using the FORTRAN language to control the Armdroid robot. The program generates 500 sets of …

A Simple Method For Organizing Nearly Optimal Binary Search Trees, Joy L. Henderson

Masters Theses

"Improving the efficiency of retrieving information concerns users of computer systems involved in many applications- One way of addressing this concern is to organize a sorted sequence into a binary search tree. Knuth's Algorithm K is a bottom-up organization algorithm that always constructs a binary tree which minimizes average search time. However, the cost of executing Algorithm K is prohibitive for a large tree. The aim of this work is to find a less costly method of organizing sorted sequences into nearly-optimal binary search trees.

We present a top-down organization method which yields better average search times than top-down methods …

The Optimal Trajectory Modelling Of Robot Manipulators, Mary Claire Miller

Masters Theses

"Greater robot capability can be achieved through the use of robot manipulator control systems. Crucial to the success of these control systems is the optimal trajectory modelling of the path traced by the end- effector. To create this optimal path the utilization of B-Spline curve functions will be investigated, and compared to Cubic Spline curve functions"--Abstract, page ii.

The Design And Implementation Of The Programming Language Natural, Alan L. Sparks

Masters Theses

"This paper reports progress on the development of the programming language Natural, currently under design by Dr. Thomas J. Sager at the University of Missouri--Rolla. Natural is a very high-level language with a mathematical flavor, and includes several concepts relatively uncommon in programming language design.

The text also discusses an implementation on the IBM Personal Computer of Mini-Natural, a subset of Natural, and presents examples of programs written in Mini-Natural"--Abstract, page ii.

A Graphical Representation Of An Executing Program, Sherry A. Lile

Masters Theses

"This thesis describes the rationale for a computer program used as a teaching aid, as well as, the design, development, and implementation of that computer program. The program is a prototype that displays, line by line, a graphical depiction of a BASIC program being executed. Icons are used to represent FOR-NEXT loops, the contents of variables, I/O, and other programming elements. The internal logic associated with the Arithmetic-Logic Unit is also represented. The purpose is to produce an environment where the student may visualize the processes occurring in memory by viewing a symbolic portrayal of an executing program. The example …

Incompleteness, Negation, Hazard: On The Precariousness Of Systems, Martin Zwick

Systems Science Faculty Publications and Presentations

An account is offered of the dialectical tensions which afflict systems of widely differing type, "contradictions" which cannot be fully or permanently resolved, and from which follow the lawfulness of both hazard and opportunity.

An Experimental Study Of The Effects Of Modularity On Resource Consumption In Software Development, Alan D. Christiansen

Masters Theses

"Many authors have encouraged the use of modular programming techniques in software development. In fact, there is almost total agreement within industrial and academic circles that modularity is a desirable feature of any software package. Unfortunately, the desirability of modular design is almost always voiced without support from experimental evidence.

This thesis consists of an experiment comparing the resource consumption of programmers based on the modularity practices employed during the design and programming phases of software development. The experiment tests the effectiveness of modularity in reducing psychological complexity of software.

The results of the research show that in some cases …

Survey Of Routing Algorithms For Computer Networks, Lu Yu

Masters Theses

"This thesis gives a general discussion of routing for computer networks, followed by an overview of a number of typical routing algorithms used or reported in the past few years. Attention is mainly focused on distributed adaptive routing algorithms for packet switching (or message switching) networks. Algorithms for major commercial networks (or network architectures) are reviewed as well, for the convenience of comparison"--Abstract, page ii.

Software And Development Process Quality Metrics, Robert Yacobellis

Robert H Yacobellis

No abstract provided.

Method And Apparatus For Division Employing Associative Memory Us:4466077, Robert Iannucci, James Kleinsteiber

Robert A Iannucci

No abstract provided.

Theology In A Digital World - Speech, October 2, 1984, David Morgan Lochhead

Dr. David Morgan Lochhead

David Morgan Lochhead promoted to Full Professor of the Vancouver, October 2, 1984. His address was entitled: Theology in a Digital World. Epiphany Chapel, VST

Parvec Workshop On Very Large Least Squares Problems And Supercomputers, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A Linear Time Algorithm For The Minimum Area Rectangle Enclosing A Convex Polygon, Dennis S. Arnon, John P. Gieselmann

Department of Computer Science Technical Reports

No abstract provided.

Ads Formal Semantics, Takayuki Kimura

All Computer Science and Engineering Research

Abstract Database System (ADS) is a data model developed for an enduring medical information system where frequent changes in the conceptual schema are anticipated and multi-level abstraction is required. The mechanism of abstraction in ADS is based on the abstraction operator of the lamba calculus. The formal semantics of a subset of the ADS model is presented using the denotational specification method.

Specification Of Synchronizing Processes, Krithivasan Ramamritham, Robert M. Keller

All HMC Faculty Publications and Research

The formalism of temporal logic has been suggested to be an appropriate tool for expressing the semantics of concurrent programs. This paper is concerned with the application of temporal logic to the specification of factors affecting the synchronization of concurrent processes. Towards this end, we first introduce a model for synchronization and axiomatize its behavior. SYSL, a very high-level language for specifying synchronization properties, is then described. It is designed using the primitives of temporal logic and features constructs to express properties that affect synchronization in a fairly natural and modular fashion. Since the statements in the language have intuitive …

Robotic Realities: Near Term Prospects And Problems, Robert U. Ayres, Steven M. Miller

Research Collection School Of Computing and Information Systems

Industrial robots are automation, but with a difference. Other machine tools are extensions of human capabilities, while robots are seen mainly as substitutes for human workers. Robots will find most of their industrial applications during the next decade or two in the metal-working sectors, where they will begin to displace semiskilled machine operatives in medium to large batch production operations. They cannot substitute for skilled machinists or other workers doing nonroutine jobs, or specialized, dedicated hard automation used in mass production. The current generation of robots, lacking sensory data processing and interpretation capabilities, can potentially replace up to 1.3 million …

Implementing A Scalar C Compiler On The Cyber 205, Kuo-Cheng Li, Herb Schwetman

Department of Computer Science Technical Reports

No abstract provided.

Channel Routing Algorithms For Overlap Models, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

The Proposed Darpa Ip-To-X.25 Interface Standard: Performance Optimization With Multiple Circuits, Douglas E. Comer, John T. Korb

Department of Computer Science Technical Reports

No abstract provided.

Ua66/10/2 Newsletter, Wku Mathematics

WKU Archives Records

Newsletter created by and about the WKU Mathematics department.

Design Of Efficient Algorithms Through Minimization Of Data Transfers, Yong Mo Chong

Electrical & Computer Engineering Theses & Dissertations

This thesis explores the time optimal implementation of computational graphs on a finite register machine. The implementation fully exploits the machine architecture, especially, the number of registers. The derived algorithms allow one to obtain time efficient implementations of a given graph in machines with a known number of registers.

These optimization procedures are applied to digital signal processing graphs. It is shown that the regular structure of these graphs allows one to identify computational kernels which, when used repeatedly, can cover the entire graph, The l- and r-register implementations of Hadamard and Fast Fourier Transforms using various computational kernels are …

Expansion Of The Performance Evaluation Capabilities Of Ellpack, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Proportional Advancement From Regional Programming Contests, John R. Metzner

Computer Science Faculty Research & Creative Works

No abstract provided.

Cost-Benefit Analysis Of Computer Systems In Community Hospital Food Service, Beverly Kittle

Loma Linda University Electronic Theses, Dissertations & Projects

Cost containment has always been a major concern to managers. Therefore, any system which decreases costs by reducing labor time is given serious evaluation.

A five week comparison was made between financial record keeping by the manual method and by the computerized method. A continuous time study was utilized to make this comparison.

Over the five weeks, an average overall time savings of 245 minutes for the computerized versus the manual method was observed. The net savings to the institution was 223 minutes per week which translates to approximately $140.00 per month over a 5 year period.

The rapid payback …