Physical Sciences and Mathematics Commons^™

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

Department of Computer Science Technical Reports

No abstract provided.

The Shastra Distributed And Collaborative Geometric Design Environment, Vinod Anupam, Chanderjit L. Bajaj, Andrew V. Royappa

Department of 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.

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 …

Resolution Without Unification, William C. Purdy

Electrical Engineering and Computer Science - Technical Reports

Resolution as an inference procedure forms the basis of most automated theorem-proving and reasoning systems. The most costly constituent of the resolution procedure in its conventional form is unification. This paper describes PCS, a first-order language in which resolution-based inference can be conducted without unification. PCS resembles the language of elementary logic with the difference that singular predicates supplant individual constants and functions. The result is a uniformity in the treatment of individual constants, functions and predicates. An especially costly part of unification is the occur check. Since unification is unnecessary for resolution in PCS, the occur check is completely …

On The Question ‘Do We Need Identity?’, William C. Purdy

Electrical Engineering and Computer Science - Technical Reports

Sommers posed the question 'Do We Need Identity?' and answered in the negative. According to Sommers, the need for a special identity relation resulted from an arbitrary distinction between concept and object introduced by Frege and retained in modern predicate logic (MPL). This is reflected in the syntactic distinction between predicate and individual constant. Traditional formal logic (TFL) does not respect this distinction and, as a consequence, has no need for a special identity relation. But Sommers' position has not gained general acceptance. On the contrary, it has received considerable criticism. While it is conceded that TFL can express the …

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.

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

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 …

Approaches To High Speed Networks, Frank Charles Paterra

Computer Science Theses & Dissertations

This work investigates possible methods by which existing potentially available communication bandwidth can be used by communication intensive applications. Presently fiber optic media are available that can provide multiple gigabits of throughput. Unfortunately, because of the computation overhead required to insure that data are reliably transmitted this capacity has not been tapped.

A survey of work toward enabling the use of the potential bandwidth is presented. The parallel paradigm is identified as a strong candidate for providing significant increases in system usable bandwidth. Performing communication processing in parallel, however, presents the developer with several implementation options. These options are considered …

Dna Mapping Algorithms: Clone Sequencing, Judith H. Lewis, Will Gillett

All Computer Science and Engineering Research

The DNA restriction mapping problem can be abstracted to the Shortest Common Matching String problem by viewing the restriction fragment lengths as symbols and the clones as bags. The Shortest Common Matching String problem can be decomposed into the Bag Sequencing problem and the Symbol Sequencing problem. All three of these problems have bene shown to be NP-hard. Rhee has proposed a family of greedy algorithms to compute polynomial time approximations to the Bag Sequencing problem, which produced surprisingly good performance results on abstracted data. In the test data generated by Rhee for pragmatic analysis, the symbols in bags represented …

Stability Criteria For Yet Another Multidimensional Distributed System, Leonidas Georgiadis, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Cascading Space Efficient Variation Of The Lzw Algorithm And Arithmetic Coding, Shobha Raj

Theses

Two known compression algorithms appropriate for communication are LZW and the Arithmetic Coding method. Both are adaptive and require no extra communication from the encoder to the decoder. Here we have considered a space efficient variation of the LZW algorithm which achieves better compression.

We present a scheme to cascade the space efficient variation of the LZW algorithm with Arithmetic Coding into a space efficient data compression algorithm which achieves a higher compression ratio and is appropriate for communication.

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

Department of Computer Science Technical Reports

No abstract provided.

Ilona: An Advanced Cai Tutorial System For The Fundamentals Of Logic, Otto Mayer, Graham E. Oberem, Fillia Makedon

Computer Science Technical Reports

An advanced tutorial system for teaching the fundamentals of logic has been developed to run on UNIX work stations and commonly available micro-computers. An important part of this tutorial is the intelligent problem solving environment which allows students to practise wiriting logical sentences in mathematical notation. A natural language system for intelligent logic narrative analysis (ILONA) allows students to type in their own logical sentences in plain English and then have the computer check their working when they write these in mathematical form. ILONA is an intelligent tutoring system which allows students a great deal of initiative in problem solving …

Algorithm Quad2d: General Two-Dimensional Quadrature, James V. Lambers

Department of Computer Science Technical Reports

No abstract provided.

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.

Nonsupereulerian Graphs With Large Size, Paul A. Catlin, Zhi-Hong Chen

Scholarship and Professional Work - LAS

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 Comparison Of Load Balancing Algorithms For Parallel Computations, N. Mansouri, Geoffrey C. Fox

Electrical Engineering and Computer Science - Technical Reports

Three physical optimization methods are considered in this paper for load balancing parallel computations. These are simulated annealing, genetic algorithms, and neural networks. Some design choices and the inclusion of additional steps lead to new versions of the algorithms with different solution qualities and execution times. The performances of these versions are critically evaluated and compared for test cases with different topologies and sizes. Orthogonal recursive coordinate bisection is also included in the comparison as a typical simple deterministic method. Simulation results show that the algorithms have diverse properties. Hence, different algorithms can be applied to different problems and requirements. …

Parallel Genetic Algorithms With Application To Load Balancing For Parallel Computing, N. Mansouri, Geoffrey C. Fox

Electrical Engineering and Computer Science - Technical Reports

A new coarse grain parallel genetic algorithm (PGA) and a new implementation of a data-parallel GA are presented in this paper. They are based on models of natural evolution in which the population is formed of discontinuous or continuous subpopulations. In addition to simulating natural evolution, the intrinsic parallelism in the two PGA's minimizes the possibility of premature convergence that the implementation of classic GA's often encounters. Intrinsic parallelism also allows the evolution of fit genotypes in a smaller number of generations in the PGA's than in sequential GA's, leading to superlinear speed-ups. The PGA's have been implemented on a …

The Arboricity Of The Random Graph, Paul A. Catlin, Zhi-Hong Chen

Scholarship and Professional Work - LAS

No abstract provided.

Reuse And Productivity In Integrated Computer-Aided Software Engineering: An Empirical Study, Rajiv D. Banker, Robert J. Kauffman

Research Collection School Of Computing and Information Systems

Growing competition in the investment banking industry has given rise to increasing demand for high functionality software applications that can be developed in a short period of time. Yet delivering such applications creates a bottleneck in software development activities. This dilemma can be addressed when firms shift to development methods that emphasize software reusability. This article examines the productivity implications of object and repository-based integrated computer-aided software engineering (ICASE) software development in the context of a major investment bank's information systems strategy. The strategy emphasizes software reusability. Our empirical results, based on data from 20 projects that delivered software for …