Digital Commons Network^™

Design And Implementation Of A Distributed System With Dynamic Resource Allocation Based Upon Bidding Schemes, Dan C. Marinescu, Kenneth Wenstrup, Patrick Davis

Department of Computer Science Technical Reports

No abstract provided.

Smili-Visualization Of Asynchronous Massively Parallel Programs, Rashi Khanna, Bruce M. Mcmillin

Computer Science Technical Reports

A visualization model has been developed to analyse the performance of a massively parallel algorithm. Most visualization tools that have been developed so far for performance analysis are based generally on individual processor information and communication patterns (eg. processor load, message traffic etc.). These tools, however, are inadequate for massively parallel computations. It is difficult to comprehend the visual information for many processors. The model, SMil...l (Scientific visualization in Multicomputing for Interpretation of Large amounts of Information), addresses this problem by using abstract representations to attain a composite picture which gives better insight to the behavior of the algorithm. Chernoff's …

Comparison Of Three Axiomatic Systems For Csp, Hanan Lutfiyya, Bruce M. Mcmillin

Computer Science Technical Reports

Currently software engineering practices use relatively few formal methods. However, formal methods can be used to find errors earlier in the software cycle and hence reduce software cost. One useful formal method is program verification. The axiomatic approach to program verification uses assertions to characterize properties of program variables and relationships between them at various stages of program execution. In order to verify these assertions, axioms or inference rules are needed for each statement as well as some statement-independent inference rules. The message passing and nondeterminism of a distributed programming language present special difficulties. This paper examines and compares three …

Smili-Visualization Of Asynchronous Massively Parallel Programs, Rashi Khanna, Bruce M. Mcmillin

Computer Science Technical Reports

A visualization model has been developed to analyse the performance of a massively parallel algorithm. Most visualization tools that have been developed so far for performance analysis are based generally on individual processor information and communication patterns (eg. processor load, message traffic etc.). These tools, however, are inadequate for massively parallel computations. It is difficult to comprehend the visual information for many processors. The model, SMil...l (Scientific visualization in Multicomputing for Interpretation of Large amounts of Information), addresses this problem by using abstract representations to attain a composite picture which gives better insight to the behavior of the algorithm. Chernoff's …

Comparison Of Three Axiomatic Systems For Csp, Hanan Lutfiyya, Bruce M. Mcmillin

Computer Science Technical Reports

Currently software engineering practices use relatively few formal methods. However, formal methods can be used to find errors earlier in the software cycle and hence reduce software cost. One useful formal method is program verification. The axiomatic approach to program verification uses assertions to characterize properties of program variables and relationships between them at various stages of program execution. In order to verify these assertions, axioms or inference rules are needed for each statement as well as some statement-independent inference rules. The message passing and nondeterminism of a distributed programming language present special difficulties. This paper examines and compares three …

Performance Experiments And Optimizations Of Pde Sparse Solvers On Hypercubes,, Mo Mu, John R. Rice, Jingwen Wang

Department of Computer Science Technical Reports

No abstract provided.

Fundamental Techniques For Geometric And Solid Modeling, Christoph M. Hoffmann, George Vanĕček

Department of Computer Science Technical Reports

No abstract provided.

Corrigendum To "Taxonomies Of Model-Theoretically Defined Topological Properties", Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

An error has been found in the cited paper; namely, Theorem 3.1 is false.

Time Delay Neural Networks And Speech Recognition: Context Independence Of Stops In Different Vowel Environments, Gregory Andrew Makowski

Masters Theses

A series of speech recognition experiments was conducted to investigate time-dynamic speech recognition of stop consonants invariant of vowel environment using data from six talkers. The speech preprocessing was based on previous studies investigating acoustic characteristics which correlate to the place of articulation (Blumstein and Stevens 1979). The place of articulation features were statistically abstracted using four moments and the energy level of the speech sample.

Both statistical and neural network pattern recognition methods were used. Statistical methods included linear and quadratic discriminant functions, maximum likelihood estimator (MLE) and K-nearest neighbors (KNN). The neural network approach used was Time Delay …

A Visualization Model For Massively Parallel Algorithms, R. Khanna, Bruce M. Mcmillin

Computer Science Technical Reports

A visualization model has been developed to analyze the performance of a massively parallel algorithm. Most visualization tools that have been developed so far for performance analysis are based generally on individual processor information and communication patterns (eg. processor load, message traffic etc.). These tools, however, are inadequate for massively parallel computations. It is difficult to comprehend the visual information for many processors. The model, SMILI (Scientific visualization in Multicomputing for Interpretation of Large amounts of Information), addresses this problem by using abstract representations to attain a composite picture which gives better insight to the behavior of the algorithm. Chernoff's …

Connectionist Expert System With Adaptive Learning Capability, B. T. Low, Hochung Lui, Ah-Hwee Tan, Hoonheng Teh

Research Collection School Of Computing and Information Systems

A neural network expert system called adaptive connectionist expert system (ACES) which will learn adaptively from past experience is described. ACES is based on the neural logic network, which is capable of doing both pattern processing and logical inferencing. The authors discuss two strategies, pattern matching ACES and rule inferencing ACES. The pattern matching ACES makes use of past examples to construct its neural logic network and fine-tunes itself adaptively during its use by further examples supplied. The rule inferencing ACES conceptualizes new rules based on the frequencies of use on the rule-based neural logic network. A new rule could …

An Ada Based Expert System For The Ada Version Of Satool Ii, Min-Fuh Shyong

Theses and Dissertations

This thesis continues the work of implementing the expert system for the Ada version of SAtool II, an software design requirement analysis tool. The background, history, design process together with the design results and validation of the implementation with Ada and CLIPS/Ada is presented.

Graphical User Interface For Image Processing, Kumar Chebrolu

Theses

A user friendly, menu driven, highly interactive X Windows package for Image Processing Applications using Motif Widget Set under Motif Window Manager is developed. Modules related to Segementation, Enhancement, Representation, Transformations are developed. The above routines are useful for image manipulation. The current gray scale/binary image is displayed on the window. Online histogram is provided so that the user can change the threshold value interactively. The OSF/Motif toolkit is used efficiently and also Xlib calls to display the image by allocating colormap. An on-line image manipulation help menu facility is incorparated in the tool to make it more versatile.

Cystic Fibrosis: Cluster Analysis Of Microbiology And Pulmonary Function, Lori Lee M. Larson '91

Honors Projects

In an attempt to find a relationship between pulmonary infection and pulmonary function in cystic fibrosis (CF) patients, microbiology data and pulmonary function test (PFT) data for clinic patients' visits were obtained from the University of Minnesota Relational Database. The two files were merged, totaling 12,193 cases, and then analyzed using a quick cluster subroutine of SPSSX on the University of Illinois IBM Mainframe System. QUICK CLUSTER analysis showed a relationship between the virulence of the microorganisms, the amount of growth of the microorganisms, and the pulmonary function test scores of CF patients

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

BITs and PCs Newsletter

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

Applying Parallel Bidirectional Search To A System For The Diagnosis Of Faults, J. E. Finlay, R. W. Wilkerson

Computer Science Technical Reports

Decreasing the time it takes an application to run is always an important concern. One of the ways to achieve this is through separating work in the application that need not be run sequentially onto two or more processors to be run in parallel. This work will take a look at an attempt to do this in one of the primary application areas of Artificial Intelligence, diagnosis.

Reiter's theory is presented for the diagnosis of faults from first principles, as well as a correction to the algorithm which defines the theory. An existing implementation of the theory is also discussed. …

Object Orientation In The Cim Environment, B. M. Higgins, J. B. Prater

Computer Science Technical Reports

Manufacturing industries are constantly looking for better ways to develop the software required to plan and control production processes. Experimental software is being developed using objectoriented program development techniques. There are many prototypes being used and tested at both academic and industrial institutions around the world.

The purpose of this paper is to examine a selection of these systems in order to highlight some of the main benefits which are being achieved by using object-oriented methods over the use of conventional approaches. Practical considerations are made concerning the long-term adoption of object-oriented methodologies in software development for Computer Integrated Manufacturing …

Investigation Of Threaded Code, K. E. Graves, Paul D. Stigall

Computer Science Technical Reports

The design, structure and performance of threaded code are examined through the development of a threaded. code classification system and the modification of the threaded code technique used by a Forth programming language implementation. The classification system distinguishes threaded code designs by three elements: the interpreter, the code structure and the reference method to routines. Threaded code designs from the literature are described using the new classification scheme. The threaded code techniques of variable depth indirect threaded code and token indirect token threaded code are examined in a Forth programming language system on an INMOS IMS T222 transputer. Their design …

Modeling The Software Design Project, C. C. Dziedzic, D. C. St. Clair

Computer Science Technical Reports

The information content of the software design product as needed by various user communities is identified. Definitions of design in classical engineering disciplines are investigated and then applied specifically to the area of software design. The Entity-Relationship model is used to describe the information content of the software design product. All the relationship types and entity types that compose the design product are described in detail. The Military Standard: Defense System Software Development, DOD-STD-2167A, is analyzed to determine how it meets the relationship type requirements.

On The Relationship Between Parsimonious Covering And Boolean Minimization, Venu Dasigi, Krishnaprasad Thirunarayan

Kno.e.sis Publications

Minimization of Boolean switching functions is a basic problem in the design of logic circuits. The designer first comes up with a switching function expressed in terms of several binary input variables that satisfies the desired functionality, and then attempts to minimize the function as a sum of products or product of sums. It turns out that a sum of products form of a switching function that has no redundancy is a union of prime implicants of the function.

In this paper we would like to explicate some of the relationships of the boolean minimization problem to a formalization of …

Applying Parallel Bidirectional Search To A System For The Diagnosis Of Faults, J. E. Finlay, R. W. Wilkerson

Computer Science Technical Reports

Decreasing the time it takes an application to run is always an important concern. One of the ways to achieve this is through separating work in the application that need not be run sequentially onto two or more processors to be run in parallel. This work will take a look at an attempt to do this in one of the primary application areas of Artificial Intelligence, diagnosis.

Reiter's theory is presented for the diagnosis of faults from first principles, as well as a correction to the algorithm which defines the theory. An existing implementation of the theory is also discussed. …

Object Orientation In The Cim Environment, B. M. Higgins, J. B. Prater

Computer Science Technical Reports

Manufacturing industries are constantly looking for better ways to develop the software required to plan and control production processes. Experimental software is being developed using objectoriented program development techniques. There are many prototypes being used and tested at both academic and industrial institutions around the world.

The purpose of this paper is to examine a selection of these systems in order to highlight some of the main benefits which are being achieved by using object-oriented methods over the use of conventional approaches. Practical considerations are made concerning the long-term adoption of object-oriented methodologies in software development for Computer Integrated Manufacturing …

Modeling The Software Design Project, C. C. Dziedzic, D. C. St. Clair

Computer Science Technical Reports

The information content of the software design product as needed by various user communities is identified. Definitions of design in classical engineering disciplines are investigated and then applied specifically to the area of software design. The Entity-Relationship model is used to describe the information content of the software design product. All the relationship types and entity types that compose the design product are described in detail. The Military Standard: Defense System Software Development, DOD-STD-2167A, is analyzed to determine how it meets the relationship type requirements.

Investigation Of Threaded Code, K. E. Graves, Paul D. Stigall

Computer Science Technical Reports

The design, structure and performance of threaded code are examined through the development of a threaded. code classification system and the modification of the threaded code technique used by a Forth programming language implementation. The classification system distinguishes threaded code designs by three elements: the interpreter, the code structure and the reference method to routines. Threaded code designs from the literature are described using the new classification scheme. The threaded code techniques of variable depth indirect threaded code and token indirect token threaded code are examined in a Forth programming language system on an INMOS IMS T222 transputer. Their design …

Stability Of Token Passing Rings, Leonidas Greorgiadis, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Indifference Graphs And The Single Row Routing Problem, Peter J. Looges

Computer Science Theses & Dissertations

This thesis investigates the subclass of interval graphs known as indifference graphs. New optimal algorithms for recognition, center, diameter, maximum matching, Hamiltonian path and domination in indifference graphs are presented. The recognition algorithm produces a linear order with properties which allow the solution of the other problems in linear time. Indifference graphs are further applied to the single row routing problem which results in both sequential,. and parallel routing algorithms.

Route Adaptation And Persistence In Networks, Kenneth R. Rodemann

Department of Computer Science Technical Reports

No abstract provided.

A Framework For Intelligent Parallel Compilers, Ko-Yang Want

Department of Computer Science Technical Reports

No abstract provided.

On The Impossibility Of Atomic Commitment In Multidatabase Systems, James G. Mullen, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

Preventing Weak Password Choices, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.