Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 61831 - 61860 of 63515

Full-Text Articles in Entire DC Network

The Mapping Of A Colored Petri Net Model To An Ops5 Rule-Based Production System, Sally S. Lockwitz Apr 1990

The Mapping Of A Colored Petri Net Model To An Ops5 Rule-Based Production System, Sally S. Lockwitz

Masters Theses

This paper defines a method by which the colored petri net model of a concurrent system may be mapped to an equivalent rule-based production system. The mapping method defined is an intuitive process which results in a production system that clearly represents the petri net model.

In order to demonstrate the effectiveness and correctness of this method, the colored petri net representation of a part of a flexible manufacturing system of the Renault Car Company is mapped to an equivalent Sierra OPS5 rule-based production system.

An overview of petri nets and rule-based production systems is presented, along with a brief …


The Fat-Pyramid: A Robust Network For Parallel Computation, Ronald I. Greenberg Apr 1990

The Fat-Pyramid: A Robust Network For Parallel Computation, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

This paper shows that a fat-pyramid of area Theta(A) built from processors of size lg A requires only O(lg^2 A) slowdown in bit-times to simulate any network of area A under very general conditions. Specifically, there is no restriction on processor size (amount of attached memory) or number of processors in the competing network, nor is the assumption of unit wire delay required. This paper also derives upper bounds on the slowdown required by a fat-pyramid to simulate a network of larger area in the case of unit wire delay.


Diagnostics Software For Concurrent Processing Computer Systems, Robert L. Jones Iii Apr 1990

Diagnostics Software For Concurrent Processing Computer Systems, Robert L. Jones Iii

Electrical & Computer Engineering Theses & Dissertations

Diagnostics software for analyzing ATAMM based concurrent processing systems is presented in this thesis. ATAMM (Algorithm to Architecture Mapping Model) is a new model developed by researchers at Old Dominion University and the NASA-Langley Research Center. ATAMM is capable of modeling the execution of large grain algorithms on distributed data flow architectures. Investigating a real or simulated ATAMM based system requires the aid of software tools. The software tool presented in this thesis can evaluate the behavior and performance of an ATAMM based system. The tool graphically portrays algorithm activities and processor activities. The tool's measurement capabilities indicate computing speed, …


Maintaining Transaction Consistency In Hddbss Using Quasi Serializable Executions, Weimin Du, Ahmed K. Elmagarmid Mar 1990

Maintaining Transaction Consistency In Hddbss Using Quasi Serializable Executions, Weimin Du, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.


Maintaining Quasi Serializability In Hddbss, Weimin Du, Ahmed K. Elmagarmid, Won Kim Mar 1990

Maintaining Quasi Serializability In Hddbss, Weimin Du, Ahmed K. Elmagarmid, Won Kim

Department of Computer Science Technical Reports

No abstract provided.


Preserving Data Integrity In Hddbss Using Quasi Serializable Executions, Ahmed K. Elmagarmid, Weimin Du Mar 1990

Preserving Data Integrity In Hddbss Using Quasi Serializable Executions, Ahmed K. Elmagarmid, Weimin Du

Department of Computer Science Technical Reports

No abstract provided.


A Bound Of Data Availability When Networks Partition, Michael Goldweber, Donald B. Johnson Mar 1990

A Bound Of Data Availability When Networks Partition, Michael Goldweber, Donald B. Johnson

Computer Science Technical Reports

Many consistency or replication control schemes that increase data availability in distributed systems exist, and the search for improvements continues, though there have been no good nontrivial upper bound demonstrating how much improvement is possible. We present a new upper bound for data availability under replication for general networks. In addition we also describe a new technique that yields near optimal levels of data availability with respect to this bound.


Critical Issues In Multidatabase Systems, Ahmed K. Elmagarmid, Marek Rusinkiewicz Mar 1990

Critical Issues In Multidatabase Systems, Ahmed K. Elmagarmid, Marek Rusinkiewicz

Department of Computer Science Technical Reports

No abstract provided.


A Multidatabase Transaction Model For Interbase, Ahmed Elmagarmid, Y. Leu, W. Litwin, Marek Rusinkiewicz Mar 1990

A Multidatabase Transaction Model For Interbase, Ahmed Elmagarmid, Y. Leu, W. Litwin, Marek Rusinkiewicz

Department of Computer Science Technical Reports

No abstract provided.


Hybrid Value/Event Representation Of Replicated Objects, Bharat Bhargava, Shirley Browne Mar 1990

Hybrid Value/Event Representation Of Replicated Objects, Bharat Bhargava, Shirley Browne

Department of Computer Science Technical Reports

No abstract provided.


Modified Successive Overrelaxation (Msor) And Equivalent 2-Step Iterative Methods For Collocation Matrices, Apostolos Hadjidimos, Yiannis G. Saridakis Mar 1990

Modified Successive Overrelaxation (Msor) And Equivalent 2-Step Iterative Methods For Collocation Matrices, Apostolos Hadjidimos, Yiannis G. Saridakis

Department of Computer Science Technical Reports

No abstract provided.


A Fast O(K) Multicast Message Routing Algorithm, Thomas J. Sager, Bruce M. Mcmillin Mar 1990

A Fast O(K) Multicast Message Routing Algorithm, Thomas J. Sager, Bruce M. Mcmillin

Computer Science Technical Reports

In many multicomputer applications is it necessary for one node to send an identical message to many nodes. One to many communications are called multicasts. Although broadcasts (one to all) and unicasts (one to one) have been widely implemented, multicasts, in spite of their importance to efficient use of multicomputer systems, have not received much attention.

Minimal traffic multicasting is equivalent to the minimal Steiner tree problem and is known to be NP-complete. Therefore, a heuristic polynomial time approximation must be used; but, to take advantage of advances in second generation multicomputer hardware such as wormhole routing, a distributed multicast …


The Second International Conference On Expert Systems For Numerical Computing, John R. Rice, Robert Vichnevetsky, Elias N. Houstis Mar 1990

The Second International Conference On Expert Systems For Numerical Computing, John R. Rice, Robert Vichnevetsky, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.


Output-Sensitive Methods For Rectilinear Hidden Surface Removal, Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars Mar 1990

Output-Sensitive Methods For Rectilinear Hidden Surface Removal, Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars

Department of Computer Science Technical Reports

No abstract provided.


Visualization Of Surfaces In Four-Dimensional Space, Christoph M. Hoffmann, Jianhua Zhou Mar 1990

Visualization Of Surfaces In Four-Dimensional Space, Christoph M. Hoffmann, Jianhua Zhou

Department of Computer Science Technical Reports

No abstract provided.


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

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

BITs and PCs Newsletter

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


The Wic Advisor: A Case Study In Medical Expert System Development, Elizabeth J. Mattson, Matthew M. Thomas, Sharon A. Trenz, Steve B. Cousins Mar 1990

The Wic Advisor: A Case Study In Medical Expert System Development, Elizabeth J. Mattson, Matthew M. Thomas, Sharon A. Trenz, Steve B. Cousins

All Computer Science and Engineering Research

This project provides a good case study of expert system development with untrained experts over a short period of time. We describe the development of a working medical screening and diagnosis expert system for use at the Women, Infants and Children (WIC) clinics in Madison County, Illinois. The system was designed and implemented over the period of four months. A large number of knowledge acquisition techniques were employed, some of them customized in ways that greatly increased their effectiveness. This paper explores the development of THE WIC Advisor, from problem definition through expert system delivery. The knowledge acquisition methods used …


On The Optimum Relaxation Factor Associated With P-Cyclic Matrices, S. Galanis, A. Hadjidimos, D. Noutsos Feb 1990

On The Optimum Relaxation Factor Associated With P-Cyclic Matrices, S. Galanis, A. Hadjidimos, D. Noutsos

Department of Computer Science Technical Reports

No abstract provided.


An Efficient Parallel Algorithm For The Row Minima Of A Totally Monotone Matrix, Mikhail J. Atallah, S. Rao Kosaraju Feb 1990

An Efficient Parallel Algorithm For The Row Minima Of A Totally Monotone Matrix, Mikhail J. Atallah, S. Rao Kosaraju

Department of Computer Science Technical Reports

No abstract provided.


Load Balanced Tree Embeddings, Ajay K. Gupta, Susanne E. Hambrusch Feb 1990

Load Balanced Tree Embeddings, Ajay K. Gupta, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.


Supporting Queries In The O-Raid Object-Oriented Database System, James G. Mullen, Jagannathan Srinivasan, Prasun Dewan, Bharat Bhargava Feb 1990

Supporting Queries In The O-Raid Object-Oriented Database System, James G. Mullen, Jagannathan Srinivasan, Prasun Dewan, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.


A Geometric Investigation Of The Skeleton Of Csg Objects, Debashish Dutta, Christoph M. Hoffmann Feb 1990

A Geometric Investigation Of The Skeleton Of Csg Objects, Debashish Dutta, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.


A Limiting Distribution For The Depth In Patricia Tries, Bonita Rais, Philippe Jacquet, Wojciech Szpankowski Feb 1990

A Limiting Distribution For The Depth In Patricia Tries, Bonita Rais, Philippe Jacquet, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


P-Complete Geometric Problems, Mikhail J. Atallah, Paul Callahan, Michael T. Goodrich Feb 1990

P-Complete Geometric Problems, Mikhail J. Atallah, Paul Callahan, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.


Athena: A Knowledge Base System For //Ellpack, C. E. Houstis, Elias N. Houstis, M. Katzouraki, T. S. Papatheodorou, John R. Rice Feb 1990

Athena: A Knowledge Base System For //Ellpack, C. E. Houstis, Elias N. Houstis, M. Katzouraki, T. S. Papatheodorou, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


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

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, February 1990, 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.


//Ellpack: A Numerical Simulation Programming Environment For Parallel Mimd Machines, Elias N. Houstis, John R. Rice, N. P. Chrisochoides, H. C. Karathanasis, P. N. Papochiou, E. A. Vavalis, Ko Yang Wang Jan 1990

//Ellpack: A Numerical Simulation Programming Environment For Parallel Mimd Machines, Elias N. Houstis, John R. Rice, N. P. Chrisochoides, H. C. Karathanasis, P. N. Papochiou, E. A. Vavalis, Ko Yang Wang

Department of Computer Science Technical Reports

No abstract provided.


Towards Automatic Grid Generation Using Binary Space Partition Trees, George Vanecek Jan 1990

Towards Automatic Grid Generation Using Binary Space Partition Trees, George Vanecek

Department of Computer Science Technical Reports

No abstract provided.


Computational Complexity Of Geometric Symmetry Detection In Graphs, Joseph Manning Jan 1990

Computational Complexity Of Geometric Symmetry Detection In Graphs, Joseph Manning

Computer Science Technical Reports

Constructing a visually informative drawing of an abstract graph is a problem of considerable practical importance, and has recently been the focus of much investigation. Displaying symmetry has emerged as one of the foremost criteria for achieving good drawings. Linear-time algorithms are already known for the detection and display of symmetry in trees, outerplanar graphs, and embedded planar graphs. The central results of this paper show that for general graphs, however, detecting the presence of even a single axial or rotational symmetry is NP-complete. A number of related results are also established, including the #P-completeness of counting the axial or …


G1 Interpolation Using Piecewise Quadric And Cubic Surfaces, Chanderjit L. Bajaj Jan 1990

G1 Interpolation Using Piecewise Quadric And Cubic Surfaces, Chanderjit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.