Digital Commons Network^™

Xellpack: An Interactive Problem Solving Environment For Elliptic Partial Differential Equations, Jophn P. Bonomo, Wayne R. Dyksen

Department of Computer Science Technical Reports

No abstract provided.

Hermite Interpolation Of Rational Space Curves Using Real Algebraic Surfaces, Chanderjit Bajaj, Insung Ihm

Department of Computer Science Technical Reports

No abstract provided.

A Dimensionality Paradigm For Surface Interrogations, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

Effects Of Autonomy On Maintaining Global Serializability In Heterogeneous Database Systems, W. Du, Ahmed K. Elmagarmid, Y. Leu, S. F. Ostermann

Department of Computer Science Technical Reports

No abstract provided.

Quasi Serializability: A Correctness Criterion For Interbase, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

Distributed Operation Language For Specification And Processing Of Multidatabase Applications, Marek Rusinkiewicz, Kanchei Loa, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

Convex Decompositions Of Simple Polyhedra, Chanderjit Bajaj, Tamal K. Dey

Department of Computer Science Technical Reports

No abstract provided.

Non-Algorithmic Load Imbalance Effects For Domain Decomposition Methods On A Hypercube, Dan C. Marinescu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A Parallel Implementation Of Stickel's Ac Unification Algorithm In A Message-Passing Environment, David John Kleikamp, Ralph W. Wilkerson

Computer Science Technical Reports

Unification algorithms are an essential component of automated reasoning and term rewriting systems. Unification finds a set of substitutions or unifiers that, when applied to variables in two or more terms, make those terms identical or equivalent. Most systems use Robinson's unification algorithm or some variant of it. However, terms containing functions exhibiting properties such as associativity and commutativity may be made equivalent without appearing identical. Systems employing Robinson's unification algorithm must use some mechanism separate from the unification algorithm to reason with such functions. Often this is done by incorporating the properties into a rule base and generating equivalent …

A System For The Diagnosis Of Faults Using A First Principles Approach, Barbara A. Smith, Ralph W. Wilkerson

Computer Science Technical Reports

One of the primary areas of application of Artificial Intelligence is diagnosis. Diagnosis from first principles is a diagnostic technique which uses knowledge of the designed structure and function of a device to determine the possible causes of the malfunction.

This work builds on the foundation of a theory of diagnosis by implementing and extending the theory. A correction to the algorithm which defines the theory is presented. The theory is extended for multiple sets of observations of the system and measurement data.

A fundamental problem in diagnosis is selecting the measurement which will be of the most benefit in …

Programmer And End User Communication In Computer System Development, Theresa J. Hart

Masters Theses

Many computer professionals agree that good communication between computer programmers or analysts and the people for whom a system is being created is essential for system success. This study researches possible reasons behind the communication problems that exist between programmers and end users and suggests ways to narrow the communication gap.

Many theories, including the theories of hemispheric brain dominance, thinking styles, and motivational factors may help explain the differences in communication styles between programmers and users. To further explore the communication problem, an exploratory survey was given to programmers and users to evaluate their perception of the communication that …

Multilevel Asynchronous Iteration For Pdes, Dan C. Marinescu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

The Development Of A Personalized Computer Assisted School Psychology (Casp) System, Patricia Lou Steinert

Dissertations

The purpose of this project was to develop a model computer system to assist school psychologists in managing and manipulating data accumulated in the course of accomplishing their professional responsibilities. School psychologists have traditionally generated large amounts of data, but rarely have they looked across these data to obtain information and/or feedback about their own functioning relative to their professional role. The system described is intended as a model from which an individual psychologist might construct a system to meet individual needs. Data across students were accumulated in four broad areas: (1) personal effectiveness/accountability, (2) diagnosis, (3) local test norms, …

Parallel (//) Ellpack: An Expert System For Parallel Processing Of Partial Differential Equations, Elias N. Houstis, John R. Rice, T. S. Papatheodorou

Department of Computer Science Technical Reports

No abstract provided.

A White Paper On High-Speed Network Architecture, Douglas E. Comer, John M. Steele, Raj Yavatkar

Department of Computer Science Technical Reports

No abstract provided.

The Young-Eidson Algorithm: Applications And Extensions, A. Hadjidimos, D. Noutsos

Department of Computer Science Technical Reports

No abstract provided.

Imacs Conference On Expert Systems For Numerical Computing, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

On The Applications Of Multi-Equational Resultants, Chanderjit Bajaj, Thomas Garrity, Joe Warren

Department of Computer Science Technical Reports

No abstract provided.

On The Sorting Of Points Along An Algebraic Curve, John K. Johnstone, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Geometric Modeling With Algebraic Surfaces, Chanderjit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.

The Internet Worm Program: An Analysis, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Approximation Methods For Algebraic Curves And Surfaces, Chandrajit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Embedding Complete Binary Trees Into Butterfly Networks, Ajay K. Gupta, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

On Computing Longest Common Subsequences In Linear Space, A. Apostolico, S. Browne, C. Guerra

Department of Computer Science Technical Reports

No abstract provided.

On The Geometry Of Dupin Cyclides, V. Chandru, D. Dutta, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

The Ipe-Pc Integrated Programming Environment, Nurcan Coskun, Thomas J. Sager

Computer Science Technical Reports

An Integrated Programming Environment, IPE-PC, that supports pseudo-code development has been designed and implemented. This environment is based on a Pascal-like language which is designed according to the requirements of a language-based environment. The nucleus of IPE-PC is a language-based editor which represents programs as graphs internally. The same representation is used in every mode of the environment (i.e., editing, compilation, execution, debugging and translation). The system provides facilities to take advantage of both top-down and bottom-up programming. Stepwise refinement has been supported by providing comment structures that can be transformed into procedures. Bottom-up programming is supported because it is …

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

Transformation Based Endorsement Systems, Thomas Sudkamp

Computer Science and Engineering Faculty Publications

Evidential reasoning techniques classically represent support for a hypothesis by a numeric value or an evidential interval. The combination of support is performed by an arithmetic rule which often requires restrictions to be placed on the set of possibilities. These assumptions usually require the hypotheses to be exhausitive and mutually exclusive. Endorsement based classification systems represent support for the alternatives symbolically rather than numerically. A framework for constructing endorsement systems is presented in which transformations are defined to generate and update the knowledge base. The interaction of the knowledge base and transformations produces a non-monotonic reasoning system. Two endorsement based …

Parallel Split-Level Relaxation, Thomas C. Henderson, Ashok K. Samal

School of Computing: Conference and Workshop Papers

The goal of the scene labeling problem is to identify a set of regions in a given image. There are several approaches to solve this problem, including backtracking, graph matching, etc. A new method called split-level relaxation based on discrete relaxation was proposed in. It takes care of multiple semantic constraints, by considering each of them independently. The problem is NP-complete, so it takes a long time to solve this problem. With the advent of multiprocessors, it is now imperative to see if the problem can be solved faster in the average case.

We give a framework for solving the …

Prefetching In File Systems For Mimd Multiprocessors, Carla Schlatter Ellis, David Kotz

Dartmouth Scholarship

The problem of providing file I/O to parallel programs has been largely neglected in the development of multiprocessor systems. There are two essential elements of any file system design intended for a highly parallel environment: parallel I/O and effective caching schemes. This paper concentrates on the second aspect of file system design and specifically, on the question of whether prefetching blocks of the file into the block cache can effectively reduce overall execution time of a parallel computation. MIMD multiprocessor architectures have a profound impact on the nature of the workloads they support. In particular, it is the collective behavior …