Digital Commons Network^™

The Structure Of Parallel Sparse Matrix Algorithms For Solving Partial Differential Equations On Hypercubes, Mo Mu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A New Design For Distributed Systems: The Remote Memory Model, Douglas E. Comer, James Griffioen

Department of Computer Science Technical Reports

No abstract provided.

Information Systems And The Erosion Of Personal Privacy, Scott D. Sterner

Department of Computer Science Technical Reports

No abstract provided.

Adaptability Experiments In The Raid Distributed Database System, Bharat Bhargava, Karl Friesen, Abdelsalam Helal, John Riedl

Department of Computer Science Technical Reports

No abstract provided.

A Proof For A Quickhull Algorithm, Jonathan Scott Greenfield,

Electrical Engineering and Computer Science - Technical Reports

The planar convex hull problem is fundamental to computational geometry and has many applications, including pattern recognition and image processing. QuickHull is a simple planar convex hull algorithm analogous to Hoare’s QuickSort [1]. This paper presents a pedagogical description and analysis of a QuickHull algorithm, along with a formal proof of correctness.

Michigan Apple Pest Identifier And Manager Expert System, James R. Schalk

Masters Theses

The Michigan Apple Pest Identifier and Management System (MAPI) is a knowledge- based consultation software system. MAPI was designed to provide the user with the ability to identify insects which may harm the apples of Michigan orchards and to project occurrences of maximum adult emergence. A discussion of standard entomological and expert system concepts and the application of these concepts to the processing of information by the Michigan Apple Pest Identifier and Management System is presented. Future possible expansions of the system are suggested.

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

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

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 Quasi Serializability In Hddbss, Weimin Du, Ahmed K. Elmagarmid, Won Kim

Department of Computer Science Technical Reports

No abstract provided.

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

Department of Computer Science Technical Reports

No abstract provided.

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

Department of Computer Science Technical Reports

No abstract provided.

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

Department of Computer Science Technical Reports

No abstract provided.

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

Department of Computer Science Technical Reports

No abstract provided.

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

Department of Computer Science Technical Reports

No abstract provided.

//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

Department of Computer Science Technical Reports

No abstract provided.

An Abstract Data Model For The Idef0 Graphical Analysis Language, Gerald R. Morris, Thomas C. Hartrum, Mark A. Roth

AFIT Documents

IDEF₀ is the United States Air Force's ICAM (Integrated Computer Aided Manufacturing) Definition Method Zero graphical analysis language, a subset of Ross' Structured Analysis (SA) language. The language is also an excellent methodology for performing a requirements-phase analysis for any software development project. We present an abstract data model for IDEF₀ using entity-relationship diagrams. This model helps to mitigate some of the ambiguities inherent in IDEF₀. The model is divided into two parts representing the analysis data (the essential data model) and the graphical data (the drawing data model). This dual modeling approach allows for the …

Mapping Finite Element Graphs On Hypercubes, Yeh-Ching Chung, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

In parallel computing, it is important to map a parallel program onto a parallel computer such that the total execution time of a parallel program is minimized. In general, a parallel program and a parallel computer can be represented by a task graph (TG) and a processor graph (PG), respectively. For a TG, nodes represent tasks of a parallel program and edges denote the data communication needed between tasks. The weights associated with nodes and edges represent the computational load and communication cost, respectively. For a PG, nodes and edges denote processors and communication channels, respectively. By using the graph …

An Architecture For Distributed Multimedia Database Systems, P. B. Berra, C.Y.R. Chen, A. Ghafoor, C. C. Lin

Electrical Engineering and Computer Science - All Scholarship

In the past few years considerable demand for user oriented multimedia information systems has developed. These systems must provide a rich set of functionality so that new, complex, and interesting applications can be addressed. This places considerable importance on the management of diverse data types including text, images, audio and video. These requirements generate the need for a new generation of distributed heterogeneous multimedia database systems. In this paper we identify a set of functional requirements for a multimedia server considering database management, object synchronization and integration, and multimedia query processing. A generalization of the requirements to a distributed system …

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

BITs and PCs Newsletter

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

An Underwater Science And Resource Database Management System And Proposed Applications To Marine Geographic Information Systems, Ivar Babb

Marine Affairs Theses and Major Papers

The National Undersea Research Program (NURP) is a federally-funded program that provides scientists with modern in situ technology that allows them to conduct research that goes beyond the constraints of traditional oceanographic methodology. NURP is comprised of five regional centers that administer underwater science, and through the principal investigators that are supported generate a vast quantity of diverse data. This data and information bank consists of the following: raw environmental data, logistical data, locational data, information about the scientists, video and still photograph documentation, and publication information. This paper describes the theory behind the implementation of a Database Management System …

Ua66/3/3 Journal Of The A. C. M., Wku Association For Computing Machinery

Student Organizations

Journal created by and about the WKU Association for Computing Machinery a student organization sponsored by WKU Computer Science.

Benchmarking Parallel Machines Via A Software Architecture, Srikanth Kambhatla, Jon Inouye, Jonathan Walpole

Computer Science Faculty Publications and Presentations

The diversity in parallel architectures and the programming styles induced thereof, make benchmarking of parallel machines a hard problem. Current benchmarking techniques are limited in applicability due to the issues of portability. We present a different approach to benchmarking parallel machines, which would make the resulting benchmarks portable, easy to use and widely applicable. The approach involves the use of a software architecture to mask the diversities of the underlying architectures. The benchmarks are based on the Linda Tuple Space, and is called BeLinda. In this report, we motivate the use of a software architecture, give a specification of the …

Dawgs - A Distributed Compute Server Utilizing Idle Workstations, Henry Clark, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

A collection of powerful workstations interconnected by a local area network can be utilized as compute servers when left idle by their owners. DAWGS allows users to submit jobs for execution on an idle workstation somewhere on a local area network. DAWGS uses a distributed scheduler and a bidding scheme to determine on which machine to run a process. DAWGS can properly redirect all the I/O of a remotely executing process and can checkpoint and then subsequently restart the process, even if the restart is on a different machine than the checkpoint. Our method is different from other work in …

Data Security: The Securing Of Computer Installations And Data Sets, Willy B. Kuehnle

Theses

No abstract provided.

A Dsm-Iii-R Study Of Computer Addiction Among Iowa Computer Users, Randy Young

CCAC Theses and Dissertations

No abstract provided.