Digital Commons Network^™

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.

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 …

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.

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.

Learning, Teaching, Optimization And Approximation, John R. Rice

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.

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

Department of Computer Science Technical Reports

No abstract provided.

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 …

The Architecture Of Braid: A System For Bridging Al/Db Systems, Amit P. Sheth, Anthony B. O'Hare

Kno.e.sis Publications

We describe the design of BrAID (a Bridge between Artificial Intelligence and Database Management Systems), an experimental system for the efficient integration of logic based Artificial Intelligence (Al) and database (DB) technologies. Features provided by BrAID include (a) access to conventional DBMSs, (b) support for multiple inferencing strategies, (c) a powerful caching subsystem that manages views and employs subsumption to facilitate the reuse of previously cached data, (d) lazy or eager evaluation of queries submitted by the AI system, and (e) the generation of advice by the AI system to aid in cache management and query execution planning. To discuss …

Using Software To Demonstrate Kinematics Of Gear Sets, John F. Hall

Opportunities for Undergraduate Research Experience Program (OURE)

The research was done in the area of developing software which could be used to demonstrate the motion of gears. To demonstrate this motion involved learning about programming using graphics. Engineering skills were used in the programming in various ways. One way was in developing and implementing the equations and theory. The more critical engineering aspect of this project is in determining what is effective in demonstrating the kinematic principles associated with gear sets.

The programs will be a helpful aid in showing students what is happening with the motion of gear sets. Not only will instructors be allowed to …

A Computer Graphics Program For Displaying Water Molecules On A Dn3500 Apollo Workstation, Michael A. Stuller

Opportunities for Undergraduate Research Experience Program (OURE)

A computer graphics program is developed for displaying water molecule configurations on the screen of a DN3500 Apollo workstation. The motivation was to generate a fast display of output from molecular dynamics or Monte Carlo computer simulations. Input to the program consists of a listing of the Cartesian coordinates of the atomic constituents of the molecules. Options in the program include: 1) number of molecules; 2) plot size; 3) atomic radii; 4) superposition of substrate atomic positions; 5) viewing angle; and 6) color-coded and/or numbered atoms. The program is written in Fortran.

Ua66/3/2 Computer Science Alumni Newsletter, Vol. 6, Wku Computer Science

WKU Administration Documents

Newsletter created by WKU Computer Science for alumni of the program.

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.

On Serializability Of Multidatabase Transactions Through Forced Local Conflict, Dimitrios Georgakopoulos, Marek Rusinkiewicz, Amit P. Sheth

Kno.e.sis Publications

The main difficulty in enforcing global serializability in a multidatabase environment lies in resolving indirect transitive conflicts between multidatabase transactions. Indirect conflicts introduced by local transactions are difficult to resolve because the behavior or even the existence of local transactions is not known to the multidatabase system. To overcome these problems, we propose to incorporate additional data manipulation operations in the subtransactions of each multidatabase transaction. We show that if these operations create direct conflicts between subtransactions at each participating local database system, indirect conflicts can be resolved even if the multidatabase system is not aware of their existence. Based …

Kinematic Synthesis Of Deployable-Foldable Truss Structures Using Graph Theory, Dirk B. Warnaar

Mechanical & Aerospace Engineering Theses & Dissertations

A graph theoretic approach is applied to the conceptual design of deployable truss structures. The characteristics that relate to the inter-connectivity of the elements of a deployable truss structure can be captured in a schematic representation, called a graph. A procedure is presented that enables the exhaustive generation of these graphs for structures of any given number of nodes and links and which are foldable onto a plane or onto a line.

A special type of truss structures, called truss modules, is presented. Graphs of this class of structures form a subset of the graphs of truss structures. Two procedures …

Computer Visualization Of Irrotational Flow Over Bluff And Streamlined Bodies, Nora Okong' O

Opportunities for Undergraduate Research Experience Program (OURE)

Computer programs were developed to visualize irrotational flow over bluff bodies (circular cylinders and half-bodies) and streamlined bodies (elliptical cylinders and airfoils). The method of superposition of flows was used, with stream functions or complex velocity potentials for fundamental flows being added to obtain the flows over the bodies. For the flow over the circular cylinders, half-bodies and elliptical cylinders, the stream function was calculated directly. The flow over the airfoil was obtained by Joukowski mapping of the imaginary part of the complex velocity potential for flow over a circular cylinder.

The programs developed will be valuable learning tools for …

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 …

Simulator For Concurrent Processing Data Flow Architectures, Mahyar R. Malekpour

Electrical & Computer Engineering Theses & Dissertations

A software simulator capable of simulating execution of an algorithm graph on a given system under the Algorithm To Architecture Mapping Model (ATAMM) rules is presented in this thesis. ATAMM is capable of modeling the execution of large-grained algorithms on distributed data flow architectures. Investigating the behavior and determining the performance of an ATAMM based system requires the aid of software tools. The ATAMM Simulator presented in this thesis is capable of determining the behavior, performance, and reliability of a system without having to build a hardware prototype. Case studies are performed on four algorithms to demonstrate the capabilities of …

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

Department of Computer Science Technical Reports

No abstract provided.

A Parallel Algorithm For Computing Invariants Of Petri Net Models, Dan C. Marinescu, Mike Beaven, Ryan Stansifer

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.

Interoperability In Multidatabase Systems, Omran A. Bukhres, Ahmed K. Elmagarmid

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.

On Alternate Solid Representations And Their Uses, Christoph M. Hoffmann, George Vanĕček

Department of Computer Science Technical Reports

No abstract provided.

Maintaining Consistency Of Interdependent Data In Multidatabase Systems, Amit P. Sheth, Yungho Leu, Ahmed K. Elmagarmid

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.