Digital Commons Network^™

A Machine Entity For A Coordinate Measurement Machine : The Generic Workcell Project, Richard C. Meyer

Theses

The Center for Manufacturing Systems (CMS) department at New Jersey Institute of Technology and Siemens Corporate Research located in Princeton have agreed to jointly implement a research project in generic workcell control architectures. This paper discusses the module, called a Machine Entity, developed by the author that interfaces the Brown & Sharpe Coordinate Measurement Machine located on the CMS factory floor with the cell control software. The module has been designed in such a manner to simplify the development of future Machine Entities, thereby reducing the time required to integrate the CMS factory floor.

Dynamic Machine Scheduling, Expansion, And Control Of A Generic Workcell, Peter A. Murray

Theses

Factory automation has come a long way since the invention of the automatic flour mill. A workcell is a group of machines (robots) working together to produce a product. In the past workcells have been hard wired using methods such as Programmable Logic Controllers (PLCs). To change a part of this system would require reprogramming the entire system.

The Generic Work Cell (GWC) is a dynamic architecture which allows a workcell to be modified on the fly. The architecture enables the generation of new cells with minimal effort, and the modification of the system without reprogramming the entire system. The …

Enforceable Interdatabase Constraints In Combining Multiple Autonomous Databases, Aidong Zhang, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

Parallel Algorithms For Gray-Scale Digitized Picture Component Labeling On A Mesh-Connected Computer, Susanne E. Hambrusch, Xin He, Russ Miller

Department of Computer Science Technical Reports

No abstract provided.

Fault-Tolerant Concurrent Branch And Bound Algorithm Derived From Program Verification, Hanan Lutfiyya, Aggie Sun, Bruce M. Mcmillin

Computer Science Technical Reports

The process of showing that a program satisfies some particular properties with respect to its specification is called program verification. Axiomatic semantics is a verification method that makes assertions describing properties about the states of the program. There exists a transformation from the assertions of the verification proof of a program to executable assertions. These executable assertions may be embedded in the program to create a fault-tolerant program. While this approach has been applied to the sequential programming environment, the distributed programming environment presents special challenges. This paper focuses on applying concurrent programming axiomatic proof systems to generate executable assertions …

Parameterization In Finite Precision, Chanderjit L. Bajaj, Andrew V. Royappa

Department of Computer Science Technical Reports

No abstract provided.

A Divide And Conquer Ring Embedding Scheme On Hypercubes With Efficient Recovery Ability, Junlin Liu, Bruce M. Mcmillin

Computer Science Technical Reports

The hypercube architecture has been considered a useful host to simulate many networks. However, when processors on hypercubes become faulty, the simulated topologies may no longer be valid and, thus, the system needs to invoke some reconfiguration algorithm to recover the topology. The efficiency of this reconfiguration depends heavily on the initial embedding method. This paper proposes a general scheme based on the idea of divide and conquer that efficiently embeds even length rings on hypercubes with small expansion and recovery cost. It is shown that the average expansion for the proposed scheme is 1.58, and the average number of …

Fundamental Solutions Of 9-Point Discrete Laplacians; Derivation And Tables, Robert E. Lynch

Department of Computer Science Technical Reports

No abstract provided.

Implicit Curves And Surfaces In Cagd, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

On Projections In Geometric Design, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

Exploring The Symbolic/Subsymbolic Continuum: A Case Study Of Raam, Doug Blank, Lisa Meeden, James Marshall

Computer Science Faculty Research and Scholarship

No abstract provided.

The Expressiveness Of Locally Stratified Programs, Howard A. Blair, Wiktor Marek, John S. Schlipf

Electrical Engineering and Computer Science - Technical Reports

This paper completes an investigation of the logical expressibility of finite, locally stratified, general logic programs. We show that every hyperarithmetic set can be computed by a suitably chosen locally stratified logic program (as a set of values of a predicate over its perfect model). This is an optimal result, since the perfect model of a locally stratified program is itself an implicitly definable hyperarithmetic set (under a recursive coding of the Herbrand base); hence to obtain all hyperarithmetic sets requires something new, in this case selecting one predicate from the model. We find that the expressive power of programs …

A Large Scale Comparison Of Option Pricing Models With Historical Market Data, Kim Mills, Michael Vinson, Gang Cheng

Northeast Parallel Architecture Center

A set of stock option pricing models are implemented on the Connection Machine-2 and the DECmpp-12000 to compare model prices and historical market data. Improved models, which incorporate stochastic volatility with American call generally have smaller pricing errors than simpler models which are based on constant volatility and European call. In a refinement of the comparison between model and market prices, a figure of merit based on the bid/ask spread in the market, and the use of optimization techniques for model parameter estimation, are evaluated. Optimization appears to hold great promise for improving the accuracy of existing pricing models, especially …

Software Issues And Performance Of A Parallel Model For Stock Option Pricing, Kim Mills, Gang Cheng, Michael Vinson, Sanjay Ranka

Northeast Parallel Architecture Center

The finance industry is beginning to adopt parallel computing for numerical computation, and will soon be in a position to use parallel supercomputers. This paper examines software issues and performance of a stock option pricing model running on the Connection Machine-2 and DECmpp-12000. Pricing models incorporating stochastic volatility with American call (early exercise) are computationally intensive and require substantial communication. Three parallel versions of a stock option pricing model were developed which varied in data distribution, load balancing, and communication. The performance of this set of increasingly refined models ranged over no improvement, 10 times, and 100 times faster than …

Fractal (Reconstructive Analogue) Memory, David J. Stucki, Jordan B. Pollack

Mathematics Faculty Scholarship

This paper proposes a new approach to mental imagery that has the potential for resolving an old debate. We show that the methods by which fractals emerge from dynamical systems provide a natural computational framework for the relationship between the “deep” representations of long-term visual memory and the “surface” representations of the visual array, a distinction which was proposed by (Kosslyn, 1980). The concept of an iterated function system (IFS) as a highly compressed representation for a complex topological set of points in a metric space (Barnsley, 1988) is embedded in a connectionist model for mental imagery tasks. Two advantages …

Parti Primitives For Unstructured And Block Structured Problems, Alan Sussman, Joel Saltz, Raja Das, S. Gupta, Dimitri Mavriplis, Ravi Ponnusamy

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

This paper describes a set of primitives (PARTI) developed to efficiently execute unstructured and block structured problems on distributed memory parallel machines. We present experimental data from a 3-D unstructured Euler solver run on the Intel Touchstone Delta to demonstrate the usefulness of our methods.

Benchmarking The Cm-5 For Image Processing Applications, Ravi V. Shankar, Ravi Ponnusamy, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

This paper presents benchmarking results for image processing algorithms on the Connection Machine model CM-5 and compares them with the results from the CM-2 and the Sun-4. Image processing algorithms with varying communication and computational requirements were implemented, tested and timed. The performance and the scalabilty of the CM-5 were analyzed and compared with that of the CM-2.

Software Support For Irregular And Loosely Synchronous Problems, Alok Choudhary, Geoffrey C. Fox, Sanjay Ranka, Seema Hiranandani

Electrical Engineering and Computer Science - All Scholarship

A large class of scientific and engineering applications may be classified as irregular and loosely synchronous from the perspective of parallel processing. We present a partial classification of such problems. This classification has motivated us to enhance Fortran D to provide language support for irregular, loosely synchronous problems. We present techniques for parallelization of such problems in the context of Fortran D.

Spede: A Simple Programming Environment For Distributed Execution (Users' Manual), James Gochee

Dartmouth College Undergraduate Theses

Traditional single processor computers are quickly reaching their full computational potentials. The quest for faster and faster chips have brought technology to the point where the laws of physics are hampering future gains. Significant gains in speed must therefore come from using multiple processors instead of a single processor. This technology usually represents itself in the form of a parallel computer, such as the Connection Machine Model 5. Recently however, much interest has been focused on software that organizes single processor computers to behave like a parallel computer. This is desirable for sites which have large installations of workstations, since …

Spede: Simple Programming Environment For Distributed Execution, James Gochee

Dartmouth College Undergraduate Theses

One of the main goals for people who use computer systems, particularly computational scientists, is speed. In the quest for ways to make applications run faster, engineers have developed parallel computers, which use more than one CPU to solve a task. However, many institutions already posses significant computational power in networks of workstations. Through software, it is possible to glue together clusters of machines to simulate a parallel environment. SPEDE is one such system, designed to place the potential of local machines at the fingertips of the programmer. Through a simple interface, users design computational objects that can be linked …

Methods For Calculating Solar Position And Day Length Including Computer Programs And Subroutines, M L. Roderick

Resource management technical reports

The theory of calculating solar position is described. Using this theory, a number of computing routines are prepared in the C programming language. These routines are suitable for users who program in C, and have an ANSI compatible C compiler. These routines are fully documented, with both the underlying theory, and code particulars, and may be used as a stand alone reference. The source code has also been published in appendix B of the report.

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

A Prototype Document Image Analysis System For Technical Journals, George Nagy, Sharad C. Seth, Mahesh Viswanathan

School of Computing: Faculty Publications

Intelligent document segmentation can bring electronic browsing within the reach of most users. The authors show how this is achieved through document processing, analysis, and parsing the graphic sentence.

Lessons From Massively Parallel Applications On Message Passing Computers, Geoffrey C. Fox

Northeast Parallel Architecture Center

We review a decade's work on message passing MIMD parallel computers in the areas of hardware, software and applications. We conclude that distributed memory parallel computing works, and describe the implications of this for future portable software systems.

Static And Runtime Algorithms For All-To-Many Personalized Communication On Permutation Networks, Sanjay Ranka, Jhy-Chun Wang, Geoffrey C. Fox

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

With the advent of new routing methods, the distance to which a message is sent is becoming relatively less and less important. Thus, assuming no link contention, permutation seems to be an efficient collective communication primitive. In this paper we present several algorithms for decomposing all-to-many personalized communication into a set of disjoint partial permutations. We discuss several algorithms and study their effectiveness from the view of static scheduling as well as runtime scheduling. An approximate analysis shows that with n processors and assuming that every processor sends and receives d messages to random destinations, our algorithm can perform the …

On Hamiltonian Line Graphs, Zhi-Hong Chen

Scholarship and Professional Work - LAS

No abstract provided.

Executing Multidatabase Transactions, Mansoor Ansari, Marek Rusinkiewicz, Linda Ness, Amit P. Sheth

Kno.e.sis Publications

In a multidatabase environment, the traditional transaction model has been found to be too restrictive. Therefore, several extended transaction models have been proposed in which some of the requirements of transaction, such as isolation or atomicity, are optional. The authors describe one of such extensions, the flexible transaction model and discuss the scheduling of transactions involving multiple autonomous database systems managed by heterogeneous DBMS.

The scheduling algorithm for flexible transactions is implemented using L.0, a logically parallel language which provides a framework for concisely specifying the multidatabase transactions and for scheduling them. The key aspects of a flexible transaction specification, …

Energy-Related Feature Abstraction For Handwritten Digit Recognition, Thomas H. Fuller Jr.

All Computer Science and Engineering Research

Most handwritten character recognizers use either graphical (static) or first-order dynamic data. Our research speculates that the mental signal to write a digit might be partially encoded as an energy profile. We used artificial neural networks (ANN) to analyze energy-related features (first and second time derivatives) of handwritten digits of 20 subjects and later 40 subjects. An experimenal environment was developed on a NeXTstation with a real-time link to a pen-based GO computer. Although such an experiment cannot confirm an energy profile encoded in the writer, it did indicate the usefulness of energy-related features by recognizing 94.5% of the 600 …

A Universal Method Of Scientific Inquiry, Daniel N. Osherson, Michael Stob, Scott Weinstein

University Faculty Publications and Creative Works

A paradigm of scientific discovery is defined within a first-order logical framework. Within this paradigm, the concept of “successful scientific inquiry” is formalized and investigated. Among other results, it is shown that a simple method of scientific inquiry is universal in the sense that it leads to success on every problem for which success is in principle possible.

On The De Bruijn Torus Problem, Glenn Hurlbert, Garth Isaak

Computer Science Technical Reports

A (kn;n)k-de Bruijn Cycle is a cyclic k-ary sequence with the property that every k-ary n-tuple appears exactly once contiguously on the cycle. A (kr, ks; m, n)k-de Bruijn Torus is a k-ary krXks toroidal array with the property that every k-ary m x n matrix appears exactly once contiguously on the torus. As is the case with de Bruijn cycles, the 2-dimensional version has many interesting applications, from coding and communications to pseudo-random arrays, spectral imaging, and robot self-location. J.C. Cock proved the existence of such tori for all m, n, and k, and Chung, Diaconis, and Graham asked …