Digital Commons Network^™

Estimating Time Available For Sensor Fusion Exception Handling, Robin R. Murphy, Erika Rogers

Computer Science and Software Engineering

In previous work, we have developed a generate, test, and debug methodology for detecting, classifying, and responding to sensing failures in autonomous and semi-autonomous mobile robots. An important issue has arisen from these efforts: how much time is there available to classify the cause of the failure and determine an alternative sensing strategy before the robot mission must be terminated?

In this paper, we consider the impact of time for teleoperation applications where a remote robot attempts to autonomously maintain sensing in the presence of failures yet has the option to contact the local for further assistance. Time limits are …

Finding Real-Valued Single-Source Shortest Paths In O(N^3) Expected Time, Stavros G. Kolliopoulos, Clifford Stein

Computer Science Technical Reports

Given an $n$-vertex directed network $G$ with real costs on the edges and a designated source vertex $s$, we give a new algorithm to compute shortest paths from $s$. Our algorithm is a simple deterministic one with $O(n^2 \log n)$ expected running time over a large class of input distributions. The shortest path problem is an old and fundamental problem with a host of applications. Our algorithm is the first strongly-polynomial algorithm in over 35 years to improve upon some aspect of the running time of the celebrated Bellman-Ford algorithm for arbitrary networks, with any type of cost assignments.

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

Enwrich: A Compute-Processor Write Caching Scheme For Parallel File Systems, Apratim Purakayastha, Carla Schlatter Ellis, David Kotz

Dartmouth Scholarship

Many parallel scientific applications need high-performance I/O. Unfortunately, end-to-end parallel-I/O performance has not been able to keep up with substantial improvements in parallel-I/O hardware because of poor parallel file-system software. Many radical changes, both at the interface level and the implementation level, have recently been proposed. One such proposed interface is \em collective I/O, which allows parallel jobs to request transfer of large contiguous objects in a single request, thereby preserving useful semantic information that would otherwise be lost if the transfer were expressed as per-processor non-contiguous requests. Kotz has proposed \em disk-directed I/O as an efficient implementation technique for …

Expanding The Potential For Disk-Directed I/O, David Kotz

Dartmouth Scholarship

As parallel computers are increasingly used to run scientific applications with large data sets, and as processor speeds continue to increase, it becomes more important to provide fast, effective parallel file systems for data storage and for temporary files. In an earlier work we demonstrated that a technique we call disk-directed I/O has the potential to provide consistent high performance for large, collective, structured I/O requests. In this paper we expand on this potential by demonstrating the ability of a disk-directed I/O system to read irregular subsets of data from a file, and to filter and distribute incoming data according …

A Neuro-Fuzzy Approach To Agglomerative Clustering, Anupam Joshi, Narendran Ramakrishnan, John R. Rice, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

Relocating Machine Instructions By Currying, Norman Ramsey

Department of Computer Science Technical Reports

No abstract provided.

Effective Strategies For Multi-Media Message Transmission: Udp Cooling And Tcp, Xiangning Sean Liu, Lebin Cheng, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

An Evaluation Of Transmitting Compressed Images In A Wide Area Network, Melliyal Annamalai, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

Www//Pdepack A Web Based Problem Solving Environment For Partial Differential Equations, W. R. Dyksen, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Formal Methods: How, When, And Why They Are Used, Beth Arrowsmith, Bruce Mcmillin, Ralph Wilkerson

Computer Science Technical Reports

Formal methods, theoretically a wonderful concept for ensuring a program's correctness, are not widely used in practice. This dichotomy between what theory advocates and practice might be due to programmers' lack of experience with formal methods. To determine if this was the case, a module on Formal Methods was introduced into a graduate course on distributed systems. This module first introduced the students to the theory of formal methods and then required students to program a distributed problem in CCSP, a subset of CSP, using formal methods. The results were abysmal. Students avoided using formal methods. When they did use …

Atomic Broadcast In Heterogeneous Distributed Systems, Osman Zeineldine

Computer Science Theses & Dissertations

Communication services have long been recognized as possessing a dominant effect on both performance and robustness of distributed systems. Distributed applications rely on a multitude of protocols for the support of these services. Of crucial importance are multicast protocols. Reliable multicast protocols enhance the efficiency and robustness of distributed systems. Numerous reliable multicast protocols have been proposed, each differing in the set of assumptions adopted, especially for the communication network. These assumptions make each protocol suitable for a specific environment. The presence of different distributed applications that run on different LANs and single distributed applications that span different LANs mandate …

Text Independent Speaker Verification Using Binary-Pair Partitioned Neural Networks, Claude A. Norton Iii

Electrical & Computer Engineering Theses & Dissertations

A method is presented for the application of binary-pair partitioned neural networks to the task of speaker verification. This technique is based on a previously developed neural network classifier for speaker identification.

The main focus of this research was the development and testing of the algorithms necessary to extend the binary-pair partitioning approach from speaker identification to speaker verification. The method is based on the development of a user profile which is obtained from discriminative data provided by the binary-pair partitioned neural networks.

Experimental results are provided which demonstrate the viability of this approach, using the TIMIT speech corpus for …

A Provably Convergent Dynamic Training Method For Multi-Layer Perceptron Networks, Timothy L. Andersen, Tony R. Martinez

Faculty Publications

This paper presents a new method for training multi-layer perceptron networks called DMP1 (Dynamic Multilayer Perceptron 1). The method is based upon a divide and conquer approach which builds networks in the form of binary trees, dynamically allocating nodes and layers as needed. The individual nodes of the network are trained using a genetic algorithm. The method is capable of handling real-valued inputs and a proof is given concerning its convergence properties of the basic model. Simulation results show that DMP1 performs favorably in comparison with other learning algorithms.

Interfaces For Disk-Directed I/O, David Kotz

Computer Science Technical Reports

In other papers I propose the idea of disk-directed I/O for multiprocessor file systems. Those papers focus on the performance advantages and capabilities of disk-directed I/O, but say little about the application-programmer's interface or about the interface between the compute processors and I/O processors. In this short note I discuss the requirements for these interfaces, and look at many existing interfaces for parallel file systems. I conclude that many of the existing interfaces could be adapted for use in a disk-directed I/O system.

Structured Permuting In Place On Parallel Disk Systems, Leonard F. Wisniewski

Computer Science Technical Reports

The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read the records of a data set from a source portion of data storage, permute them in memory, and write them to a separate target portion of the same size. It can be quite expensive, however, to provide disk storage that is twice the size of very large data sets. Permuting in place reduces the expense by using only a small amount of extra disk storage beyond the size of the …

Safe Stratified Datalog With Integer Order Programs, Peter Revesz

School of Computing: Conference and Workshop Papers

Guaranteeing termination of programs on all valid inputs is important for database applications. Termination cannot be guaranteed in Stratified Datalog with integer (gap)-order programs on generalized databases because they express any Turing-computable function. This paper introduces a restriction of those programs that can express only computable queries. The restricted language has a high expressive power and a non-elementary data complexity.

Implementation Of A Campuswide Distributed Mass Storage Service: The Dream Versus Reality, Betty Jo Armstead, Stephen Prahst

Armstead Publications and Presentations

In 1990, a technical team at NASA Lewis Research Center, Cleveland, Ohio, began defining a Mass Storage Service to provide long-term archival storage, short-term storage for very large files, distributed Network File System access, and backup services for critical data that resides on workstations and personal computers. Because of software availability and budgets, the total service was phased in over 3 years. During the process of building the service from the commercial technologies available, our Mass Storage Team refined the original vision and learned from the problems and mistakes that occurred. We also enhanced some technologies to better meet the …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 11, Number 7, September 1995, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Measurement Of The Effective B Quark Fragmentation Function At The Z Resonance, Buskulic, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

Using a sample of about 1.46 million hadronic Z decays collected between 1991 and 1993 with the ALEPH detector at LEP, the energy distribution of the B0 and B± mesons produced at the Z resonance is measured by reconstructing semileptonic decays B → ℓνℓD(X) or B→ ℓνℓD∗+(X). The charmed mesons are reconstructed through the decay modes D0 → K−π+, D0 → K−π+π−π+, D+ → K−π+π+ and D∗+→ D0π+. The neutrino energy is estimated from the missing energy in the lepton hemisphere. Accounting for B∗ and B∗∗ production, the shape of the scaled energy distribution xE(b) for mesons containing a b …

Measurement Of Αs From Scaling Violations In Fragmentation Functions In E+E- Annihilation, D. Buskulic, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

A study of scaling violations in fragmentation functions performed by the ALEPH collaboration at LEP is presented.

An Architecture For A Camputs-Scale Wireless Mobile Internet, Douglas E. Comer, John C. Lin, Vincent F. Russo

Department of Computer Science Technical Reports

No abstract provided.

Splines And Geometric Modeling, Chandrajit L. Bajaj, Susan Evans

Department of Computer Science Technical Reports

No abstract provided.

Regular Algebraic Curve Segments (Ii) - Interpolation And Approximation, Guoliang Xu, Changrajit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.

S-To-P Broadcasting On Coarse-Grained Machines, Susanne E. Hambrusch, Ashfaq A. Khokhar, Yi Liu

Department of Computer Science Technical Reports

No abstract provided.

Regular Algebraic Curve Segments (I)- Definitions And Characteristics, Guoliang Xu, Changrajit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Distributed And Collaborative Synthetic Environments, Chandrajit L. Bajaj, Fausto Bernardini

Department of Computer Science Technical Reports

No abstract provided.

Proceedings Of The Mspls Spring '95 Workshop, Gerald Baumgartner, Vincent R. Russo

Department of Computer Science Technical Reports

No abstract provided.

Vrware Beware: Vr At Siggraph, P.D. Quick

SWITCH

The article uses the author’s experiences from the event of Siggraph ‘95 to comment on upcoming products using virtual or augmented reality. The article includes further discussion on the products’ effects on the psychology and physiology of consumers. Some examples include the “i-Glasses” from Virtual I/O, the “Smart Model” from Multigen, as well as the nanomanipulator created by University of North Carolina Chapel Hill Department of Computer Science, and the Phobia Project developed by the Georgia Tech Graphics Visualization and Usability Center. The article also covers not only the products of this event, but also the courses, panels, papers, and …

Vr Products, P.D. Quick

SWITCH

The article is an analysis of the author’s experience testing several virtual reality items at Siggraph, an annual convention displaying computer machinery and interactive technology products. The author explains each device and how they work, the company behind the invention, as well as how it can help with future technological advancements. Several products are explained in more depth; the i-Glasses by Virtual I/O, Red Planet by Virtual World Entertainment Inc., Venturer S-2 by Thomson Entertainment Systems, and several more. Each item explores virtual reality in differing ways such as interactive video games, more user-friendly 3D modeling, and virtual movie theater …