Digital Commons Network^™

A Declarative View Of Inheritance In Logic Programming, M. Bugliesi

Department of Computer Science Technical Reports

No abstract provided.

Unstructured Scheduling In Parallel Pde Sparse Solvers On Distributed Memory Machines, Mo Mu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Constructively Typed Timed Automata, J. F. Peters Iii

Electrical Engineering and Computer Science - Technical Reports

A new class of communicating automata called typed Timed lnput/Output Automata (tTAi/os) is introduced. A tTAi/o is a predicate automaton used for specifying and reasoning about real-time systems. The typing discipline suggested for predicate automata is in the tradition of Martin-Löf's constructive type theory. A type A is a proposition, which is defined when a prescription for constructing a proof of A is given. A fragment of Girard's linear logic is used in classifying state types. An illustration of the use of tTAi/os in specifying a light-controller is presented. An abstract program is extracted during a proof of an automaton …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 7, Number 8, November 1991, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Quadratic Spline Collocation Methods For Elliptic Partial Differential Equations, Christina C. Christara

Department of Computer Science Technical Reports

No abstract provided.

An Experimental Sequence Examining The Effect Of Task Type, Memory Condition, And Display Presentation Type On Performance Time And Error Rate, Using Columnar Table Versus Vertical Bar Graph Versus Line Graph, Suparna Das

Theses

A total of 126 subjects at various levels of school and a health related manufacturing firm participated in three experiments that compared Tables, Line graphs and Bar graphs forms of data presentation. The experiments were performed each consisting of a training task followed by answering some questions based on the presented material. The experimental series were presented to six groups. Group 1, 3, 5 viewed Line graphs, Tables or Bar graphs respectively while answering the questions while the other three groups answered questions based on memory of either Line graphs, Table or Bar graph presentation.

The independent variables were:

1. Memory …

A Common Application Model For Interfacing With Advanced Program To Program Communication/Vm, Joseph Viviano Jr.

Theses

The Merrill Lynch data processing environment is composed of a conglomeration of applications which reside on various platforms. LAN and minicomputer based applications coexist with those making their home in the mainframe arena. Unfortunately, coexistence does not imply cooperation, data uniformity, data centralization or coordinated application development. Within the Merrill Lynch mainframe arena alone there are two operating systems which reside across several computing complexes, MVS (Multiple Virtual Storage) and VM (Virtual Machine). Critical business applications and data are unique to each of these environments. The problem lies in the need for cooperative processing and sharing of distributed data among …

Computer Vision, Descriptive Geometry, And Classical Mechanics, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

Formal Generation Of Executable Assertions For A Fault-Tolerant Parallel Matrix Relaxation, Hanan Lutfiyya, Bruce M. Mcmillin

Computer Science Technical Reports

No abstract provided.

Visual Interaction: A Link Between Perception And Problem Solving, Erika Rogers, Ronald C. Arkin

Computer Science and Software Engineering

The approach taken in this research is to develop a cognitive model of how a human observer extracts information from a visual display and then uses this perceptual information in a decision-making task. Knowledge about this relationship provides information about the occurrence of perceptual events in the course of problem-solving activities, and suggests that perceptual assistance in the form of image enhancements is a useful supplement to the user’s own abilities. This knowledge is then to be embedded in an intelligent computerized assistant which is designed to facilitate and stimulate the human problem-solving process.

How To Compute Offsets Without Self-Intersection, Ching-Shoei Chiang, Christoph M. Hoffmann, Robert E. Lynch

Department of Computer Science Technical Reports

No abstract provided.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 7, Number 7, October 1991, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Distributed Memory Compiler Methods For Irregular Problems -- Data Copy Reuse And Runtime Partitioning, Raja Das, Ravi Ponnusamy, Joel Saltz, Dimitri Mavriplis

Electrical Engineering and Computer Science - Technical Reports

This paper outlines two methods which we believe will play an important role in any distributed memory compiler able to handle sparse and unstructured problems. We describe how to link runtime partitioners to distributed memory compilers. In our scheme, programmers can implicitly specify how data and loop iterations are to be distributed between processors. This insulates users from having to deal explicitly with potentially complex algorithms that carry out work and data partitioning. We also describe a viable mechanism for tracking and reusing copies of off-processor data. In many programs, several loops access the same off-processor memory locations. As long …

Sidescan Sonar Image Enchancement Using A Decomposition Based On Orthogonal Functions. Applications With Chebyshev Polynomials, Pierre Cervenka, Christian De Moustier

Center for Coastal and Ocean Mapping

A method is presented to remove from sidescan sonar images of the seafloor, artifacts that are clearly unrelated to the backscattering properties of the seafloor. A spectral analysis performed on a ping by ping basis proved to be well suited to the problem. The technique relies on a decomposition using Chebyshev polynomials. This stochastic method does not require a priori knowledge of deterministic parameters. It deals with the low spatial frequency components of the image whose wavelengths are not very small compared to the swath width. Applications to sidescan sonar images obtained with the SeaMARC LI system are presented.

A Practical Hierarchical Model Of Parallel Computation Ll: Binary Tree And Fft Algorithms, Todd Heywood, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

A companion paper has introduced the Hierarchical PRAM (H-PRAM) model of parallel computation, which achieves a good balance between simplicity of usage and reflectivity of realistic parallel computers. In this paper, we demonstrate the usage of the model by designing and analyzing various algorithms for computing the complete binary tree, and the FFT/butterfly graph. By concentrating on two problems, we are able to demonstrate the results of different combinations of organizational strategies and different types of sub-models of the H-PRAM. The philosophy in algorithm design is to maximize the number of processors P that are efficiently usable with respect to …

Domain Limitations And Interface Requirements For Expert Developed Knowledge Based Systems, Bernard Lee Lewis

Engineering Management & Systems Engineering Theses & Dissertations

The expanded use of graphical, case-based and object oriented techniques in expert systems creation has made it more practical for domain experts to develop their own applications. This thesis focuses on the elements necessary in an expert/developer interface and looks at various forms and techniques that exemplify such an approach. The spreadsheet metaphor is used for an interface or managed set of interfaces that a domain expert can use in building his own expert system or prototype. criteria are established for such interfaces and recent commercial offerings that make expert-created knowledge-bases more practical are reviewed for techniques that qualify. Approaches …

Constrained-Latency Storage Access: A Survey Of Application Requirements And Storage System Design Approaches, Richard Staehli, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Applications with Constrained Latency Storage Access (CLSA) are those that have large storage needs and hard constraints on the amount of latency they can tolerate. Such applications present a problem when the storage technology that is cost effective and large enough cannot meet their latency constraints for demand fetching. Examples are found in the developing field of multimedia computing and, to a lesser extent, in real-time database literature. This paper examines the nature of timing constraints at the application-storage interface and defines a classification for both the synchronization constraints of the application and the latency characteristics of the storage system. …

Computer Simulation Techniques To Assess Bias And Precision In The Roving Creel Survey Estimator, David L. Wade

Biological Sciences Theses & Dissertations

Fisheries scientists use roving creel survey methods to estimate total catch and total effort of recreational fisheries. Bias in the roving creel estimators had been known to the scientific community, but it had not been quantified. I developed a roving-creel-survey computer simulation model to investigate the bias and precision of roving creel estimators, and estimated parameters for the model based on field observations from the blue crab (Callinectes sapidus) fishery of the Chesapeake Bay. The computer model was used to identify bias in roving-creel effort and catch estimators and to demonstrate survey methods that will reduce this bias. …

Shortest Path Computations In S-Graphs, Greg N. Frederickson, Susanne E. Hambrusch, Hung-Yi Tu

Department of Computer Science Technical Reports

No abstract provided.

Composite Stock Cutting Through Simulated Annealing, Pipatpong Poshyanonda, Cihan H. Dagli

Computer Science Technical Reports

This paper explores the use of Simulated Annealing as an optimization technique for the problem Composite Material Stock Cutting. The shapes are not constrained to be convex polygons or even regular shapes. However, due to the composite nature of the material, the orientation of the shapes on the stock is restricted. For placements of various shapes, we show how to determine a cost function, annealing parameters, and performance.

Fault-Tolerant Parallel Matrix Multiplication With One Iteration Fault Detection Latency, Chul-Eui Hong, Bruce M. Mcmillin

Computer Science Technical Reports

The checksum technique is a low cost method to detect errors in matrix operations performed by processor arrays. The fault detection of this method is done only at problem termination, so this method is not an effective fault tolerance technique for large scale matrix multiplication.

This paper presents a new algorithm, the ID algorithm, which minimizes the fault-detection latency, In the ID algorithm, a fault is detected as soon a5 the fault occurs instead of at problem termination. For 112 processors, the fault-latency time of the ID algorithm is l/11 of that of checksum algorithm with a run-time penalty of …

Fault-Tolerant Parallel Matrix Multiplication With One Iteration Fault Detection Latency, Chul-Eui Hong, Bruce M. Mcmillin

Computer Science Technical Reports

The checksum technique is a low cost method to detect errors in matrix operations performed by processor arrays. The fault detection of this method is done only at problem termination, so this method is not an effective fault tolerance technique for large scale matrix multiplication.

This paper presents a new algorithm, the ID algorithm, which minimizes the fault-detection latency, In the ID algorithm, a fault is detected as soon a5 the fault occurs instead of at problem termination. For 112 processors, the fault-latency time of the ID algorithm is l/11 of that of checksum algorithm with a run-time penalty of …

Composite Stock Cutting Through Simulated Annealing, Pipatpong Poshyanonda, Cihan H. Dagli

Computer Science Technical Reports

This paper explores the use of Simulated Annealing as an optimization technique for the problem Composite Material Stock Cutting. The shapes are not constrained to be convex polygons or even regular shapes. However, due to the composite nature of the material, the orientation of the shapes on the stock is restricted. For placements of various shapes, we show how to determine a cost function, annealing parameters, and performance.

Collaborating Pde Solvers, H. S. Mcfaddin, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Numerical Quadrature For General Two-Dimensional Domains, James V. Lambers, 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, Volume 7, Number 6, September 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.

Binary Perfect Weighted Coverings (Pwc) I. The Linear Case, G. D. Cohen, S. N. Litsyn, H. F. Mattson Jr

Electrical Engineering and Computer Science - Technical Reports

This paper deals with an extension of perfect codes to fractional (or weighted) coverings. We shall derive a Lloyd theorem --- a strong necessary condition of existence---and start a classification of these perfect coverings according to their diameter. We illustrate by pointing to list decoding.

On Perfect Weighted Coverings With Small Radius, G. D. Cohen, S. N. Litsyn, H. F. Mattson Jr

Electrical Engineering and Computer Science - Technical Reports

We extend the results of our previous paper [8] to the nonlinear case: The Lloyd polynomial of the covering has at least R distinct roots among 1, ... , n, where R is the covering radius. We investigate PWC with diameter 1, finding a partial characterization. We complete an investigation begun in [8] on linear PMC with distance 1 and diameter 2.

A Self-Organizing Binary Decision Tree For Incrementally Defined Rule-Based Systems, Douglas M. Campbell, Tony R. Martinez

Faculty Publications

This paper presents an adaptive self-organizing concurrent system (ASOCS) model for massively parallel processing of incrementally defined rule systems in such areas as adaptive logic, robotics, logical inference, and dynamic control. An ASOCS is an adaptive network composed of many simple computing elements operating asynchronously and in parallel. This paper focuses on adaptive algorithm 3 (AA3) and details its architecture and learning algorithm. It has advantages over previous ASOCS models in simplicity, implementability, and cost. An ASOCS can operate in either a data processing mode or a learning mode. During the data processing mode, an ASOCS acts as a parallel …

A Topological Model For Parallel Algorithm Design, Jeffrey A. Simmers

Theses and Dissertations

This research demonstrates that formal, mathematical analysis in theoretical computer science can be recast in terms of the topology of complete metric spaces, and also presents a methodical technique for developing formal specifications. This effort shows that the topology of complete metric spaces provides a tool that can be used to both recreate major results about computational models and also to develop new results about these models. Using the two computational models CSP and UNITY, this effort shows that the required mathematics needed to support this alternative to the traditional analysis of computational models can be readily supported by a …