Digital Commons Network^™

A 15-Valued Algorithm For Test Pattern Generation, Akhtar Uz Zaman, M. Ali, Carlos R.P. Hartmann

Electrical Engineering and Computer Science - Technical Reports

In this report we present a new algorithm for detecting single stuck-at faults in combinational circuits. This algorithm is based on a 15-valued system and introduces several new concepts to make test generation more efficient. This 15-valued system allows us to impose all the constraints that must be satisfied in order to sensitize a single path. Consequently all deterministic implications are fully considered prior to the enumeration process. The resulting ability to identify inconsistencies prior to enumeration improves the possibility of quicker identification of redundant faults. Instead of sensitizing a single gate at a time, we sensitize subpaths by sensitizing …

Center For Computer And Information Sciences Interim Application Package 1989, Nova University

College of Engineering and Computing Course Catalogs

No abstract provided.

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 …

Parity Retransmission Hybrid Arq Using Rate 1/2 Convolutional Codes On A Nonstationary Channel, L. R. Lugand, D. J. Costello, Jr., Robert H. Deng

Research Collection School Of Computing and Information Systems

A parity retransmission hybrid automatic repeat request (ARQ) scheme is proposed which uses rate 1/2 convolutional codes and Viterbi decoding. A protocol is described which is capable of achieving higher throughputs than previously proposed parity retransmission schemes. The performance analysis is based on a two-state Markov model of a nonstationary channel. This model constitutes a first approximation to a nonstationary channel. The two-state channel model is used to analyze the throughput and undetected error probability of the protocol presented when the receiver has both an infinite and a finite buffer size. It is shown that the throughput improves as the …

Adaptable Recovery Using Dynamic Quorum Assignments, Bharat Bhargava, Shirley Browne

Department of Computer Science Technical Reports

No abstract provided.

Strokes For Representing Univariate Vector Field Maps, David Fowler, Colin Ware

Center for Coastal and Ocean Mapping

Particle systems make an excellent tool for creating tracks (which we call strokes) in vector fields. The question addressed in this paper is how such tracks should be made to vary in size and colour in order to reveal properties such as local direction and strength of the field. We find that for strokes that vary from large to small, direction is indicated by the large end. We also find that for strokes that vary in colour, the colour of the background is the most important determinant of perceived direction.

User's Manual For Ccrc: (Common Lisp Version) Computing Reference Classes Statistical Reasoning Shell V. 2.5, R. P. Loui

All Computer Science and Engineering Research

CCRC implements a subset of Kyburg's rules for statistical inference. The system states from 1961 and is briefly described in "The Reference Class," (H. Kyburg Philosophy of Science 50, 1982). Consult the paper "Computing Reference Classes" (R. Loui, in Kanal, L. and Lemmer, J., Uncertainty in AI, v.1, North-Holland 1987) for a precis of the ideas underlying this program. This document is only the skeleton of a manual. It is designed to get the novice on the program as quickly as possible, and to provide some guidance for advanced questions. This piece of software is the extended version of a …

Back Propagation With Integer Arithmetic, Takayuki Dan Kimura

All Computer Science and Engineering Research

The present work investigates the significance of arithmetic precision in neural network simulation. Noting that a biological brain consists of a large number of cells of low precision, we try to answer the question: With a fixed size of memory and CPU cycles available for simulation, does a larger sized net with less precision perform better than smaller sized one with higher precision? We evaluate the merits and demerits of using low precision integer arithmetic in simulating backpropagation networks. Two identical backpropagation simulators, ibp and fbp, were constructed on Mac II, ibp with 16 bits integer representations of network parameters …

Defeasible Decisions: What The Proposal Is And Isn't, R. P. Loui

All Computer Science and Engineering Research

In two recent papers, I have proposed a description of decision analysis that differs from the Bayesian picture painted by Savage, Jeffrey and other classic authors. Response to this view have been either overly enthusiastic or unduly pessimistic. In this paper I try to place the idea in its proper place, which must be somewhere in between. Looking at decision analysis as defeasible reasoning produces a framework in which planning and decision theory can be integrated, but work on the details has barely begun. It also produces a framework in which the meta-decision regress can be stopped in a reasonable …

Cascading Lzw Algorithm With Huffman Coding : A Variable To Variable Length Compression Algorithm, Ashish Khandubhai Mehta

Theses

Two common schemes in data compression are fixed to variable length coding and variable to fixed length coding. Higher compression is expected from the more flexible scheme of variable to variable length coding. In such a scheme a compression dictionary is used to transfer variable length string over the text alphabet into variable length strings over the coding alphabet. The compression is achieved due to matching longer more frequent text strings with shorter coding strings.

To obtain a variable to variable length coding we choose to cascade the LZW , variable to fixed , coding with the Huffman , fixed …

Program Analysis Tool For Extensive Reverse Software Engineering : A Tool To Understand The Software (Patern), Bubulal R. Rawal

Theses

This thesis describes a computer aided software engineering tool called Program Analysis Tool for Extensive Reverse software eNgineering (PATERN). Conceptually, PATERN provides systems analysts/programmers with a powerful tool independent of programming language, operating system, and programmer style of coding for documenting existing software. PATERN has been tested with C code in the UNIX environment. This thesis also describes the interface between PATERN and two subsystems that interact with PATERN: relational databases and data flow diagram generators. The implementation of these interfaces was investigated using Informix and another software tool, Directed Acyclic Graphs (DAG) for generating hierarchical structure charts and flow …

Towards A Bound For The Compression Of The Lzw Algorithm, Anoop Kumar Srivastava, Shinu Gupta

Theses

The LZW algorithm is a well known efficient adaptive compression algorithm. It is based on constructing a dictionary containing character strings from the text. A number of researchers have attempted to add variations to the original algorithm to achieve higher compression values. In this thesis we attempt to find a bound for the LZW approach. That is, we build a dictionary which gives maximum compression and satisfies prefix property of LZW algorithm.

In order to build such an optimum dictionary, the dynamic programming technique is applied. The final dictionary selected consists of entries which give maximum overall compression and also …

Supporting Value Dependency For Nested Transactions In Interbase, Ahmed K. Elmagarmid, Weimin Du

Department of Computer Science Technical Reports

No abstract provided.

A Virtual Memory Operating System For A Distributed Workstation Environment, James Griffioen

Department of Computer Science Technical Reports

No abstract provided.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, May 1989, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

The Coupon-Collector Problem Revisited, Arnon Boneh, Micha Hofri

Department of Computer Science Technical Reports

No abstract provided.

High Rate Concatenated Coding Systems Using Bandwidth Efficient Trellis Inner Codes, Robert H. Deng, D. J. Costello, Jr.

Research Collection School Of Computing and Information Systems

High-rate concatenated coding systems with bandwidth-efficient trellis inner codes and Reed-Solomon (RS) outer codes are investigated for application in high-speed satellite communication systems. Two concatenated coding schemes are proposed. In one the inner code is decoded with soft-decision Viterbi decoding, and the outer RS code performs error-correction-only decoding (decoding without side information). In the other the inner code is decoded with a modified Viterbi algorithm, which produces reliability information along with the decoded output. In this algorithm, path metrics are used to estimate the entire information sequence, whereas branch metrics are used to provide reliability information on the decoded sequence. …

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 …

Efficient Multi-Layer Channel Routing, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

No abstract provided.

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 …

On The Parallel-Decomposability Of Geometric Problems, Mikhail J. Atallah, Jyh-Jong Tsay

Department of Computer Science Technical Reports

No abstract provided.

Model-Based Interpretation Of Time-Varying Medical Data, Michael G. Kahn, Lawrence M. Fagan Washington University In St. Louis, Lewis B. Sheiner Washington University In St. Louis

All Computer Science and Engineering Research

Temporal concepts are critical is medical therapy-planning. If given early enough, specific therapeutic choices may abort or suppress evolving undesired changes in a patient’s clinical status. Effective medical decision making demands recognition and interpretation of complex temporal changes that permeate the medical record. This paper presents a methodology for representing and using medical knowledge about temporal relationships to infer the presence of clinically relevant events, and describes a program, called TOPAZ, that uses this methodology to generate a narrative summary of such events. A unique feature of TOPAZ is the use of numeric and symbolic modeling techniques to perform temporal …

The Nature Of Parallel Programming, Per Brinch Hansen

Electrical Engineering and Computer Science - Technical Reports

Parallel programming is the art of writing programs for computers that perform many operations simultaneously. This essay discusses the nature of parallel programming without going into technical details. It uses a sorting problem to illustrate what it means to solve a problem in parallel, how we write parallel programs, how parallel computers execute them, and how fast they run. The author expects that scientific users of parallel computers may find ease of programming more important than maximum performance. He suggests ways to make this possible.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, March 1989, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Impacts Of Industrial Robotics: Potential Effects On Labor And Costs Within The Metalworking Industries, Steven M. Miller

Research Collection School Of Computing and Information Systems

According to leading expert opinion, industrial robots are among the most important innovations of recent decades. Yet there is very considerable uncertainty (and disagreement) as to the rate at which the use of robots will spread and what their effects on employment, costs, and market structure will be. As stressed in 1983 by Congress’s Office of Technology Assessment: “A central question for an analysis of the social and economic impacts of programmable automation is whether programmable automation is likely to spread especially rapidly among firms and industries, and why.” The author analyzes the job displacement effects of industrial robots, as …

Description Of Semilog, Ryan Stanisfer, Chul Hung, Andrew B. Whinston, Parthasarathy Bhasker

Department of Computer Science Technical Reports

No abstract provided.

Semi Iterative Methods On Distributed Memory Multiprocessor Architectures, A. Hadjidimos, Elias N. Houstis, John R. Rice, M. K. Samartzis, E.A. Vavalis

Department of Computer Science Technical Reports

No abstract provided.

The New Generation Of Computer Literacy, J. Paul Myers Jr.

Computer Science Faculty Research

A tremendous mismatch is developing between two of the most critical components of any computer literacy course: the textbooks and the students. We are encountering a "new generation" of students (literally as well as figuratively!) who are much better acquainted with computer usage than their earlier counterparts. Yet many textbooks with increasing emphasis in those same computer tools continue to appear. There are signs of a coming change in that a few authors and publishers apparently are becoming aware of the need for innovations in texts for non-scientists. These textbooks open the door for a new orientation to principles in …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, February 1989, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.