Digital Commons Network^™

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 …

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.

A Variable-Free Logic For Mass Terms, William C. Purdy

Electrical Engineering and Computer Science - Technical Reports

This paper presents a logic appropriate for mass terms, that is, a logic that does not presuppose interpretation in discrete models. Models may range from atomistic to atomless. This logic is a generalization of the author's work on natural language reasoning. The following claims are made for this logic. First, absence of variables makes it simpler than more conventional formalizations based on predicate logic. Second, capability to deal effectively with discrete terms, and in particular with singular terms, can be added to the logic, making it possible to reason about discrete entities and mass entities in a uniform manner. Third, …

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 …

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

Correspondence Problem In Image Sequence Analysis, Chia-Hoang Lee, Anupam Joshi

Department of Computer Science Technical Reports

No abstract provided.

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

An Implementation Of "Theorem Proving With Lemmas", C. J. Merz, R. W. Wilkerson

Computer Science Technical Reports

Two resolution proof strategies developed by Peterson [ Pe76j are implemented by modifying Otter, an existing automated theorem prover. The methods, Lock-T refutation and LNL-T refutation, are generalizations of unit refutation and input refutation, respectively, to non-Hom sets and represent independent, equivalent but opposite ways of searching. Thus, the two techniques can be run simultaneously, exchanging only important intermediate results known as lemmas.

The algorithms used in the implementation, which are based on a corrected version of the foundational work, are outlined in detail and justified. Next, the newly implemented strategies are tested individually and together on various non-Horn challenge …

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 …

Incremental Learning Of Numeric Clusters In Classifier Systems, K. R. Hacke, D. C. St. Clair

Computer Science Technical Reports

Classifier systems are knowledge-based learning algorithms which take training instances as input and produce a set of rules as output Many classifier systems represent the knowledge they learn in the form of one or more decision trees. Accurate knowledgebase systems for a variety of domains have been constructed by generating decision trees using J. R. Quinlan's (1986) inductive algorithm ID3 and P. E. Utgoffs (1988) IDS. IDS is an incremental version of ID3.

Unfortunately, all these algorithms suffer from the inability to easily and effectively handle domains with numeric-valued attributes. Numeric attributes are those whose values are taken from a …

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.

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.

Stability Of Token Passing Rings, Leonidas Greorgiadis, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

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 …

Maximum Queue Length And Waiting Time Revisited: Multiserver G|G|C Queue, John S. Sadowsky, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Logical Inference Of Horn Clauses In Petri Net Models, C. Lin, A. Chaudhury, A. B. Whinston, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Performance Prediction For Distributed Load Balancing In Multicomputer Systems, Ishfaq Ahmad, Arif Ghafoor, Kishan Mehrotra

Electrical Engineering and Computer Science - Technical Reports

Computing literature has being flooded recently with a plethora of dynamic load balancing strategies for multicomputer systems. The diversity of many strategies and their dependence on a number of parameters has made it difficult to compare their effectiveness on a unified basis. Not only does each strategy consider a different environment, but the simplified assumptions obscure the relative merits and demerits of each strategy. This paper presents a solution to compare different load balancing schemes on a unified basis. Our approach, which is an integration of simulation, statistical and analytical experiments, takes into account the fundamental system parameters that can …

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

BITs and PCs Newsletter

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

The Traveling Salesman Problem A Parallel Branch And Bound Solution, Tracy Orton, Lan Tran

Opportunities for Undergraduate Research Experience Program (OURE)

A book published in Germany in 1852 said of the successful traveling salesman: "The most important aspect is to cover as many locations as possible without visiting the same location twice." This quote is the earliest mention of the "Traveling Salesman Problem" (TSP). There are many algorithms to solve the TSP, the one we implemented was the Branch and Bound algorithm. The TSP graph G is completely connected by a set of edges E, with a non-negative cost C_ij associated with each edge. A tour of the graph is a cycle containing all vertices once and only once, starting …

Vehicle Routing Using The Sweep Algorithm In Parallel, Jana G. Beattie, Carol L. Spelman

Opportunities for Undergraduate Research Experience Program (OURE)

This paper presents a parallel version of the Sweep Algorithm, a heuristic solution to the smgle-termma] vehicle routing problem The Sweep Algorithm uses a duster-first route-second approach in finding a near-optimal set of routes. The clusters of delivery points are formed by using the terminal as the center and moving around it m a sweeping fashion After a duster is defined, the route is found with a traveling salesperson algorithm.

The parallel version begins the sweep at different angles and performs both forward and backward sweeps. Each node handles a sweep and returns information concerning total distance traveled to the …

Termination Via Conditional Reductions, Timothy B. Baird, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

We Generalize the Notion of Rewriting Modulo an Equational Theory to Include a Special Form of Conditional Reduction. We Are Able to Show that This Conditional Rewriting Relation Restores the Finite Termination Property Which is Often Lost When Rewriting in the Presence of Infinite Congruence Classes. in Particular, We Are Able to Handle the Class of Collapse Equational Theories Which Contain Associative, Commutative, and Identity Laws for One or More Operators.

Determining Maximum K-Width-Connectivity On Meshes, Susanne E. Hambrusch, Frank Dehne

Department of Computer Science Technical Reports

No abstract provided.

A Purdue University Course In The History Of Computing, Saul Rosen

Department of Computer Science Technical Reports

No abstract provided.

Transaction Models For Advanced Database Applications, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

Relax: A Software Platform For Pde Interface Relaxation Methods, Scott Mcfaddin, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Global Commitment In Multidatabase Systems, Ahmed K. Elmagarmid, Jin Jing, Won Kim

Department of Computer Science Technical Reports

No abstract provided.

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

BITs and PCs Newsletter

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