Physical Sciences and Mathematics Commons^™

Proxima, A Polyhedral Interrogation Support In C++, Gang Sun, Peter Van Vleet, George Vanĕček

Department of Computer Science Technical Reports

No abstract provided.

On Elastic Nets And Correspondence In Motion With Homogeneous Deformation, Anupam Joshi, Chia-Hoang Lee

Department of Computer Science Technical Reports

No abstract provided.

Si: A Lightweight-Process Interaction Simulation System, Janche Sang, Ke-Hsiung Chung, Vernon Rego

Department of Computer Science Technical Reports

No abstract provided.

Efficient Algorithms For Joint Density Approximations Of Discrete Independent Random Variables, Janche Sang, Vernon Rago, John Spragius

Department of Computer Science Technical Reports

No abstract provided.

Compiling Ace For Distributed-Memory Machines, Jun Song

Dissertations and Theses

Distributed-memory machines offer a very high level of performance, flexibility and scalability. But the memory organization of this kind of machine determines that processes on different processors must communicate explicitly by sending and receiving messages. As a result, the programmer faces the enormously difficult task of detailed planning of algorithm-irrelevant, low-level communication issues. This level of programming resembles writing assembly programs for a sequential machine.

ACE is a message-passing language with abstract communication statements. It was defined by Dr. Jingke Li at Portland State University. The communication in ACE is still explicit, but it is abstracted to a higher level. …

Low Degree Approximation Of Surfaces For Revolved Objects, Changrajit L. Bajaj, Insung Ihm

Department of Computer Science Technical Reports

No abstract provided.

Optimal Parametric Search Algorithms In Trees I: Tree Partitioning, Greg N. Frederickson

Department of Computer Science Technical Reports

No abstract provided.

On-Line Serial And Parallel String Searching, Alberto Apostolico

Department of Computer Science Technical Reports

No abstract provided.

Preconditioning For Domain Decomposition Through Function Approximation, Mo Mu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Evaluation And Approximate Evaluation Of The Multivariate Bernstein-Bezier Form On A Regularly Partitioned Simplex, Jörg Peters

Department of Computer Science Technical Reports

No abstract provided.

The Programmers' Playground: I/O Abstraction For Heterogeneous Distributed Systems, Kenneth J. Goldman, Michael D. Anderson

All Computer Science and Engineering Research

A new high-level approach to interprocess communication in heterogeneous distributed systems in introduced, This approach, called I/O Abstraction, allows one to write each functional component of a distributed system as an encapsulated program that acts upon a set of local data structures, some of which may be published for external use. The functional components are separately configured by establishing logical connections among the published data structures. In order to illustrate this approach, we describe the The Programmers' Playground, a high-level language "veneer" and protocol designed to support I/O abstraction in heterogeneous computing environment. Support for communication among programs written in …

Computing Specificity, Ronald Loui, J. Norman, K. Stiefvater, A. Merrill, A. Costello, J. Olson

All Computer Science and Engineering Research

This note reports on an effort to implement a version of Poole's rule for specificity. Relatively, efficient implementation relies on correcting and improving a pruning lemma of Simari-Loui [92]. This in turn requires revision of Poole's specificity concept. The resulting system is a usable knowledge representation system with first-order-language and defeasible reasoning. Sample input and output are included in an appendix. It is a good candidate for multiple inheritance applications; it is useful for planning, but limited by the underlying search for plans.

Lecture Notes For Nscp-Funded Short Course - Remote Sensing Training For Resource Officers And Farmers, Western Australian Department Of Agriculture

Soil conservation survey collection

The aim of this course is to provide an introduction to remote sensing, and knowledge and practice in image processing techniques for the extraction of information from remotely sensed data. Aerial photography is the original form of earth remote sensing, and is still a widely used and important data source for many purposes. This course is directed principally at the analysis of digital image data recorded by satellite or airborne platforms. Remote sensing is considered to be the methodology of collecting and interpreting target information over a broad range of the electromagnetic spectrum.

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

Performance Analysis Of Queueing Systems With Synchronous Server, Wonmu Hur

Theses

The performance measures are derived for a queueing system which is characterized by its synchronous server operations. This property is the one which normal queueing systems lack. A system of this nature contains a single common server to which multiple number of buffers are connected in parallel, where the server operates only when all system buffers are occupied.

In this thesis, the analysis is carried out focusing on the simplest system involving only two buffers. Throughout the analysis, a symmetricity of the system is assumed (i.e., system is symmetrical in terms of arriving customer statistics.). Also assumed are the Poisson …

Porting Cosmos Expert System From Unix To Dos, Ching-Jeng Chiu

Theses

COSMOS is an object-oriented Knowledge Based System building Tools (KBSTs) to solve problem in engineering industry. COSMOS stands for C++ Object-oriented System Made for expert System development.

In order to provide more people those who don't have a Sun workstation to use this expert system, our task is porting COSMOS form UNIX to DOS.

Because the differents of workstation environment, the user interface and structure of original COSMOS no longer can be used, therefore we made some necessary change before we porting it to IBM Personal Computer.

In stead of X Window system®, we implemented ObjectWindows® runs on Microsoft WindowsTM. …

Domain Analysis Within The Gensif Framework, Heiko Thimm

Theses

The GenSIF framework which is targeted towards very large, distributed, and complex software systems recently has been proposed to accomplish a form of systems engineering and systems development in which the issue of systems integration is considered from the beginning on.

One of the components of GenSIF is domain analysis. Domain analysis leads to the design of a domain model. The specific needs GenSIF has in that area were investigated with an emphasis on domain modeling. Main points addressed in that investigation were the issue regarding the relevant information for the domain modeling process and the required type of domain …

Character Recognition Using String Matching, Xiaozhi Ye

Theses

To handle noisy and distorted pattern is the use of similarity or distance measures. A similarity or distance measure can be defined between a representation of an unknown pattern and a representation of a prototype pattern. Recognition of the unknown pattern can be carried out on the basis of the maximum-similarity or minimum distance criterion (Bunke 1990) This approach is proposed to recognize the noisy or distorted character image. In this work, a directly string representation of the pattern ( prototype as well as unknown input) using the histogram method, a decision procedure for classification is the well known Levenshtein …

Design And Implementation Of Two Text Recognition Algorithms, Madhumathi Yendamuri

Theses

This report presents two algorithms for text recognition. One is a neural-based orthogonal vector with pseudo-inverse approach for pattern recognition. A method to generate N orthogonal vectors for an N-neuron network is also presented. This approach converges the input to the corresponding orthogonal vector representing the prototype vector. This approach can restore an image to the original image and thus has error recovery capacility. Also, the concept of sub-networking is applied to this approach to enhance the memory capacity of the neural network. This concept drastically increases the memory capacity of the network and also causes a reduction of the …

Building Segment Trees In Parallel, Peter Su, Scot Drysdale

Computer Science Technical Reports

The segment tree is a simple and important data structure in computational geometry [7,11]. We present an experimental study of parallel algorithms for building segment trees. We analyze the algorithms in the context of both the PRAM (Parallel Random Access Machine) and hypercube architectures. In addition, we present performance data for implementations developed on the Connection Machine. We compare two different parallel alforitms, and we also compare our parallel algorithms to a good sequential algorithm for doing the same job. In this way, we evaluate the overall efficiency of our parallel methods. Our performance results illustrates the problems involved in …

Using Minimal And Maximal Fault Tolerance For The Assessment Of Fault-Tolerant Algorithms, Martina Schollmeyer, Bruce M. Mcmillin

Computer Science Technical Reports

No abstract provided.

Programming Ellpack Examples In Pdeqsol, Yukio Umetani

Department of Computer Science Technical Reports

No abstract provided.

Geometric Search And Replace In Solid Model Editing, Chandrajit L. Bajaj, Kokichi Sugihara

Department of Computer Science Technical Reports

No abstract provided.

Boolean Set Operations On A Mimd Distributed Memory Machine, Chandrajit L. Bajaj, Tamal K. Dey

Department of Computer Science Technical Reports

No abstract provided.

Modeling Contacts In A Physically Based Simulation, William J. Bouma, George Vanĕček

Department of Computer Science Technical Reports

No abstract provided.

A General Theory Of Optimal P-Cyclic Sor, Apostolos Hadjidimos, Robert J. Plemmons

Department of Computer Science Technical Reports

No abstract provided.

An Analysis Of Data Management Schemes For Distributed Memory Mimd Systems, M. C. Cornea-Hasegan, Dan C. Marinsecu, Zhongyun Zhang

Department of Computer Science Technical Reports

No abstract provided.

Relaxing Synchronization In Distributed Simulated Annealing, Chul-Eui Hong, Bruce M. Mcmillin

Computer Science Technical Reports

Simulated annealing is an attractive, but expensive, heuristic for approximating the solution to combinatorial optimization problems. Since simulated annealing is a general purpose method, it can be applied to the broad range of NP-complete problems such as the traveling salesman problem, graph theory, and cell placement with a careful control of the cooling schedule.

Attempts to parallelize simulated annealing, particularly on distributed memory multicomputers, are hampered by the algorithm’s requirement of a globally consistent system state. In a multicomputer, maintaining the global state S involves explicit message traffic and is a critical performance bottleneck. One way to mitigate this bottleneck …

A Process-Learning Pid Controller Algorithm Utilizing An On-Line Iterative Improvement Technique, Ryan Rosandich, Ralph W. Wilkerson

Computer Science Technical Reports

Three iterative improvement algorithms are presented for the determination of process controller gains. An offline algorithm is developed and tested as a basis for comparison, and a simple on-line algorithm is developed as an incremental step toward the final algorithm, proportional on-line iterative improvement. The algorithms are based on an Artificial Neural Network learning method, and this method is compared with other control optimization techniques. The performance of each of the algorithms was experimentally evaluated in numerous realistically simulated process control situations consisting of flow, level, and temperature control loops with various values of dead-time and process noise. The experimental …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 7, October 1992, 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.