Digital Commons Network^™

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.

Method For The Automatic Level Adjustment In A Local Area Network, In Particular For A Multiprocessor Arrangement With A Bus System Of Optical Fibres, For The Purpose Of Collision Detection, Hans Thinschmidt, Franz J. Kurfess

Computer Science and Software Engineering

European Patent. Written in German.

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 …

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 …

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.

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.

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 …

An Evolutionary Approach To Load Balancing Parallel Computations, N. Mansouri, Geoffrey C. Fox

Electrical Engineering and Computer Science - Technical Reports

We present a new approach to balancing the workload in a multicomputer when the problem is decomposed into subproblems mapped to the processors. It is based on a hybrid genetic algorithm. A number of design choices for genetic algorithms are combined in order to ameliorate the problem of premature convergence that is often encountered in the implementation of classical genetic algorithms. The algorithm is hybridized by including a hill climbing procedure which significantly improves the efficiency of the evolution. Moreover, it makes use of problem specific information to evade some computational costs and to reinforce favorable aspects of the genetic …

Prediction Criteria For Successful Weaning From Respiratory Support: Statistical And Connectionist Analyses, K. Ashutosh, Hyungkeun Lee, Chilukuri K. Mohan, Sanjay Ranka, Kishan Mehrotra, C. Alexander

Electrical Engineering and Computer Science - Technical Reports

Objective: To develop predictive criteria for successful weaning from mechanical assistance to ventilation based upon simple clinical tests using discriminant analyses and neural network systems. Design: Retrospective development of predictive criteria and subsequent prospective testing of the same. Setting: Medical intensive care unit of a 300-bed teaching veterans administration hospital. Patients: Twenty-five ventilator-dependent elderly patients with acute respiratory failure. Interventions: Routine measurements of negative inspiratory force (NIF), tidal values (VT), minute ventilation (VE), respiratory rate (RR), vital capacity (FVC), and maximum voluntary ventilation (MVV), followed by weaning trial. Success or failure in 21 efforts analyzed by linear and quadratic discriminant …

An Overview And Evaluation: Computer Software To Aid Students In Prewriting, Writing, And Revision, Mary Lou Shomaker

Opportunities for Undergraduate Research Experience Program (OURE)

The research on computer software to aid inexperienced writers was done from May, 1990 through August, 1990, and involved examining software that would help students improve their writing. The softwares also were evaluated according to their value for use in computer assisted writing classes. The project had three objectives: 1) to evaluate software designed to aid the writer in the pre-writing, writing, and revising stages; 2) to identify the components of this type of software; 3) to recommend software for the beginning academic writer.

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 …

An Efficient Semantic Query Optimization Algorithm, Hwee Hwa Pang, Hongjun Lu, Beng Chin Lu

Research Collection School Of Computing and Information Systems

An efficient semantic query optimization algorithm is proposed, in which all possible transformations are tentatively applied to the query. Instead of physically modifying the query, the transformation process classifies the predicates into imperative, optional or redundant. At the end of the transformation process, all the imperative predicates are retained while the redundant predicates are eliminated. Optional predicates are retrained or discarded based on the estimated cost/benefit of retaining them. The issue of the grouping of semantic constraints to reduce the overhead of retrieving constraints and checking whether each constraint is relevant to the current query is also addressed. Based on …

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.

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

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.

A Unified Framework For Three-Valued Semantical Treatments Of Logic Programming, Feng Yang

Electrical Engineering and Computer Science - Technical Reports

Based on Fiting's Φ operator a unified framework for three-valued semantics of logic programming is presented. The truth space used in the framework is the class of partial interpretations. Underlying the truth space is two partial orderings, knowledge ordering and truth ordering. It turns out that the truth space with the truth ordering is a complete lattice and the truth space with knowledge ordering is a semi-complete lattice. Φ is proved to be continuous over the complete lattice and monotonic over the semi-complete lattice. With the use of Φ operator two well-known three-valued semantics for logic programming, Fitting's three-valued semantics …

A Study Of Approximating The Moments Of The Job Completion Time In Pert Networks, Kishan Mehrotra, John Chai, Sharma Pillutla

Electrical Engineering and Computer Science - Technical Reports

The importance of proper management of projects has not gone unrecognized in industry and academia. Consequently tools like Critical Path Method (CPM) and Program Evaluation Review Technique (PERT) for project planning have been the focus of attention of both practitioners and researchers. Determination of the Time to Complete the Job (TCJ) in PERT networks is important for planning and bidding purposes. The complexity involved in accurately determining the TCJ has led to the development of many approximating procedures. Most of them ignore the dependence between paths in the network. We propose an approximation to determine the TCJ which explicitly recognizes …

Duality In Logic Programming, Feng Yang

Electrical Engineering and Computer Science - Technical Reports

Various approximations of classic negation have been proposed for logic programming. But the semantics for those approximations are not entirely clear. In this paper a proof-theoretic operator, we call it failure operator, denoted as FP, is associated with each logic program to characterize the meaning of various negations in logic programming. It is shown that the failure operator FP is a dual of the TP, immediate consequence operator developed by Van Emden and Kowalski and is downward continuous. It has the desirable properties entirely analogous to what TP has such as continuity, having a unique least fixpoint and a unique …

The N-Body Pipeline, Per Brinch Hansen

Electrical Engineering and Computer Science - Technical Reports

A general pipeline for all-pairs computations is adapted for direct force summation of n bodies which interact through gravitation only. To achieve approximate load balance the pipeline is folded several times across an array of processors. The performance of the pipeline is analyzed and measured on a Computing Surface.

Transfer Of 4gl Application From Ingres To Oracle, Adnan Altunisik

Theses and Dissertations

This paper documents the transfer of 4GL applications from INGRES to ORACLE. As a result of a fast and conceptual change in computer languages, 4GLs were developed and evolved. These are programming support tools whose goal is, basically, to make the programs more efficient by reducing the number of instructions. Both ORACLE and INGRES database systems use 4GLs to develop applications. Their 4GL environments and their facilities for application development are investigated and explained in depth in this effort. The TWX application, which was originally implemented in INGRES by using its 4GL, is designed and reimplemented in ORACLE. This is …

A Practical Hierarchial Model Of Parallel Computation: The Model, Todd Heywood, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

We introduce a model of parallel computation that retains the ideal properties of the PRAM by using it as a sub-model, while simultaneously being more reflective of realistic parallel architectures by accounting for and providing abstract control over communication and synchronization costs. The Hierarchical PRAM (H-PRAM) model controls conceptual complexity in the face of asynchrony in two ways. First, by providing the simplifying assumption of synchronization to the design of algorithms, but allowing the algorithms to work asynchronously with each other; and organizing this "control asynchrony" via an implicit hierarchy relation. Second, by allowing the restriction of "communication asynchrony" in …