Digital Commons Network^™

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.

Introductory Dataperfect® Instruction, Frances Jenson Larsen

Theses and Dissertations

The project should be used in a beginning computer class. These units contain projects from simple to complex. The first instructional unit uses a database that comes with the DataPerfect® program. The students build and manipulate a small database. Reports are prepared, and finally the students design an original database. These instructional units are intended to be used in a high school classroom with the DataPerfect® computer program. DataPerfect® is a copyrighted program marketed by WordPerfect Corporation of Orem, Utah.

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

Department of Computer Science Technical Reports

No abstract provided.

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

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.

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.

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.

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.

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.

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 …

A Functional Language With Classes, Mike Veaven, Ryan Stanisfer, Dan Wetklow

Department of Computer Science Technical Reports

No abstract provided.

Queueing Models Of Secondary Storage Devices, Edward G. Coffman

Department of Computer Science Technical Reports

No abstract provided.

Algebraic Surface Design With Hermite Interpolation, Chandrajit L. Bajaj, Insung Ihm

Department of Computer Science Technical Reports

No abstract provided.

Using Annotated C++, Marshall P. Cline, Doug Lea

Electrical Engineering and Computer Science - All Scholarship

A++ (‘‘Annotated C++’’) is both a formalism and a proposed CASE tool for annotating C++ code with object-oriented specifications, assertions, and related semantic information. Annotations provide programmers with a useful means for approaching class design, exceptions, correctness, standardization, software reusability and related issues in software engineering with C++. This paper shows how A++ provides arbitrarily fine granularity to the C++ type system, how it automates and streamlines exception testing, how it can aid in standardization of software components, and how it can safely remove redundant exception tests.

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 …

Data Acquisition And Control Program For Chromatographic And Spectroscopic Studies, M. Keith Hudson, William G. Hood, Robert Henson

Journal of the Arkansas Academy of Science

An IBMPC compatible computer was interfaced to an Ithaco 3962 lock-in-amplifier. The computer controlled the functions of the lock-in-amplifier, acquired and stored data, and allowed for real time or off-line processing of data. Computer/amplifier connection was made via RS-232-C serial interface. Programmed in Microsoft Quick BASIC, the computer assumed the role of a dedicated chromatographic integrator. This reduced the overall instrumentation expense by eliminating a dedicated chromatographic integrator. The computer program supplied much greater flexibility in control and data interpretation. To show its utility, the program was applied to a study of the infrared emission from a flame upon the …

Grades - A Computer Based Score Management System For The Iigs, Charles Patrick Wahle

All Graduate Projects

This project involved the creation of an electronic gradebook designed to realistically meet the needs of classroom teachers. The computer source code was written in Pascal, a compiled language that allowed fast execution of any part of the program. The electronic gradebook called GradeS uses the graphic Desktop Intert'ace. It tracks up to 42 students per class, allowing up to 50 assignments per grading period. An unlimited number of classes can be stored on data disks. It produces four different types of whole class and individual student reports both on the screen and the printer. The project includes a report …

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

CCAC Theses and Dissertations

No abstract provided.

Linda Implementations Using Monitors And Message Passing, Alan L. Leveton

UNF Graduate Theses and Dissertations

Linda is a new parallel programming language that is built around an interprocess communication model called generative communication that differs from previous models in specifying that shared data be added in tuple form to an environment called tuple space, where a tuple exists independently until some process chooses to use it. Interesting properties arise from the model, including space and time uncoupling as well as structured naming. We delineate the essential Linda operations, then discuss the properties of generative communication. We are particularly concerned with implementing Linda on top of two traditional parallel programming paradigms - process communication through globally …