Digital Commons Network^™

The Effect Of A Database Feedback System On User Performance, H. Chan, K. Wei, Keng Siau

Research Collection School Of Computing and Information Systems

There are two main approaches to improving the effectiveness of database interfaces. One is to raise the level of abstraction for the content of the user-database interaction. The relational model belonging to the logical level has replaced the hierarchical and network models that belong to the lower physical level. It is likely that the relational model will eventually be replaced by models belonging to the even higher conceptual level, such as entity relationship models and object-oriented models. The second approach is to enhance the actual interaction process. This can be done by providing better feedback to the user. Feedback can …

From Formal Security Specifications To Executable Assertions - A Distributed Systems Preliminary Study, C. Serban, B. Mcmillin

Computer Science Technical Reports

A security policy for a distributed system can be checked for compliance at run-time, as the system executes, using assertions embedded in software. This paper presents the concept of run-time security assurance, according to a given security policy for a given distributed system, along with mechanisms for its usage. A model problem illustrates the implementation of executable security assertions and their run-time validation on histories (traces) of events.

Cognitive Cooperation Through Visual Interaction, Erika Rogers

Computer Science and Software Engineering

The purpose of the paper is to describe a cooperative system which was designed to provide intelligent assistance in the domain of diagnostic radiology. The approach taken includes the collection and analysis of human performance data, cognitive modelling of the interaction between perception and problem solving. incorporation of this knowledge into a blackboard-based architecture. implementation of a prototype system and testing and evaluation of the prototype. These stages are described, and then discussed in the context of issues particularly relevant to the study of human-machine cooperation.

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

BITs and PCs Newsletter

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

Search For Supersymmetric Particles With R-Parity Violation In Z Decays, D. Buskulic, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

Searches for supersymmetric particles produced in e+e− interactions at the Z peak have been performed under the assumptions that R-parity is not conserved, that the dominant R-parity violating coupling involves only leptonic fields, and that the lifetime of the lightest supersymmetric particle can be neglected. In a data sample collected by the ALEPH detector at LEP up to 1993, and corresponding to almost two million hadronic Z decays, no signal was observed. As a result, supersymmetric particle masses and couplings are at least as well constrained as under the usual assumption of R-parity conservation.

Evolving Globally Synchronized Cellular Automata, Rajarshi Das, James P. Crutchfield, Melanie Mitchell, James M. Hanson

Computer Science Faculty Publications and Presentations

How does an evolutionary process interact with a decentralized, distributed system in order to produce globally coordinated behavior? Using a genetic algorithm (GA) to evolve cellular automata (CAs), we show that the evolution of spontaneous synchronization, one type of emergent coordination, takes advantage of the underlying medium's potential to form embedded particles. The particles, typically phase defects between synchronous regions, are designed by the evolutionary process to resolve frustrations in the global phase. We describe in detail one typical solution discovered by the GA, delineating the discovered synchronization algorithm in terms of embedded particles and their interactions. We also use …

Mpvm: A Migration Transparent Version Of Pvm, Jeremy Casas, Dan Clark, Ravi Konuru, Steve Otto, Robert Prouty, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Parallel Virtual Machine (PVM) is a widely-used software system that allows a heterogeneous set of parallel and serial UNIX-based computers to be programmed as a single message-passing parallel machine, In this paper, an extension to PVM to support dynamic process migration is presented. Support for migration is important in general-purpose workstation environments since it allows parallel computations to co-exist with other applications, using idle-cycles as they become available and off-loading from workstations when they are no longer free. A description and evaluation of the design and implementation of the prototype Migratable PVM system is presented together with some performance results.

Tact Volume 4 Issue 1, Touro College Department Of Academic Computing

Yearbooks and Newsletters

"Touro Academic Computing Technologies: The Newsletter of Academic Computing at Touro College"

Low-Level Interfaces For High-Level Parallel I/O, Nils Nieuwejaar, David Kotz

Dartmouth Scholarship

As the I/O needs of parallel scientific applications increase, file systems for multiprocessors are being designed to provide applications with parallel access to multiple disks. Many parallel file systems present applications with a conventional Unix-like interface that allows the application to access multiple disks transparently. By tracing all the activity of a parallel file system in a production, scientific computing environment, we show that many applications exhibit highly regular, but non-consecutive I/O access patterns. Since the conventional interface does not provide an efficient method of describing these patterns, we present three extensions to the interface that support \em strided, \em …

Exploring The Use Of I/O Nodes For Computation In A Mimd Multiprocessor, David Kotz, Ting Cai

Dartmouth Scholarship

As parallel systems move into the production scientific-computing world, the emphasis will be on cost-effective solutions that provide high throughput for a mix of applications. Cost-effective solutions demand that a system make effective use of all of its resources. Many MIMD multiprocessors today, however, distinguish between “compute” and “I/O” nodes, the latter having attached disks and being dedicated to running the file-system server. This static division of responsibilities simplifies system management but does not necessarily lead to the best performance in workloads that need a different balance of computation and I/O. \par Of course, computational processes sharing a node with …

Planar Over The Cell Routing, Srinivasa R. Danda

Masters Theses

Planar over the cell routing in standard cell layouts is an important problem and it has been studied quite extensively. In two layer standard cell design methodology, Ml layer is typically used for connections internal to the cell, and the M2 layer is available for routing over-the-cell. In this thesis, we consider the Two Row Maximum Planar Subset (TRMPS) problem in Over-The-Cell routing. The TRMPS problem requires selection of the maximum planar subset of nets, which can be routed between two rows of terminals in a cell row. This problem was first encountered by Cong, Liu, and Preas [3]. They …

Arbitrary Topology Shape Reconstruction From Planar Cross Sections, Chandrajit L. Bajaj, Edward J. Coyle, Kwun-Nan Lin

Department of Computer Science Technical Reports

No abstract provided.

Neuro-Fuzzy Systems For Intelligent Scientific Computation, Narendran Ramakrishnan, Anupam Joshi, Sanjiva Weerawarana, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Sciagents--An Agent Based Environment For Distributed, Cooperative Scientific Computing, Tzvetan T. Drashansky, Anupam Joshi, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Adaptive Reconstruction Of Surfaces And Scalar Fields From Dense Scattered Trivariate Data, Chandrajit L. Bajaj, Fasuto Bernardini, Guoliang Xu

Department of Computer Science Technical Reports

No abstract provided.

Error-Bounded Reduction Of Triangle Meshes With Multivariate Data, Chandrajit L. Bajaj, Daniel R. Schikore

Department of Computer Science Technical Reports

No abstract provided.

Decompositions Of The Identity And The Construction Of Smooth Surfaces, Jörg Peters

Department of Computer Science Technical Reports

No abstract provided.

Rational Parametrizations Of Real Cubic Surfaces, Chandrajit L. Bajaj, Robert J. Holt, Arun N. Netravali

Department of Computer Science Technical Reports

No abstract provided.

A Unified Approach To Multilayer Routing, Sreekrishna Madhwapathy

Masters Theses

Several Over-the-Cell (OTC) routing algorithms have been proposed for two and three layer processes. All the existing OTC routers assume that the terminals are laid out in a specific predetermined fashion. These restrictions on the terminals complicate the task of cell design and increase the width of the cells.

In this thesis, we report two results. First, we present a new layout methodology, for obtaining minimum width cells, with arbitrarily located terminals. Next, we develop a multilayer routing approach, which is independent of the cell model used in the layout design. Freed from fixed terminal placement restrictions, cell designers can …

Knowledge Acquisition And Structuring By Multiple Experts In A Group Support Systems Environment, Bernard Lee Lewis

Engineering Management & Systems Engineering Theses & Dissertations

This study addresses the impact of Group Decision Support Systems (GDSS) on expert system development by multiple Domain Experts. Current approaches to building expert systems rely heavily on knowledge acquisition and prototyping by a Knowledge Engineer working directly with the Domain Expert. Although the complexity of knowledge domains and new organizational approaches demand the involvement of multiple experts, standard procedures limit the ability of the Knowledge Engineer to work with more than one expert at a time.

Group Decision Support Systems offer a networked computerized environment for group work activities, in which multiple experts may express their ideas concurrently and …

Generalization Metrics For Neural Modeling Applications In System Identification, Denise M. Reeves

Electrical & Computer Engineering Theses & Dissertations

In this thesis a procedure to design multilayer feedforward networks for system identification with good prediction properties is presented. Central to the design procedure is a means to characterize the prediction capabilities of various trained neural networks. Such knowledge will allow for the identification of the best network design. For system identification purposes, a "good" model is one that is good at predicting, In particular, a good model is one that produces small prediction errors when applied to a set of cross-validation data. We formulate and implement a criterion function designed to measure the size of a trained neural network's …

Open-Loop State-Space Model Identification From Closed-Loop Data, Lori Guy

Mechanical & Aerospace Engineering Theses & Dissertations

This thesis provides an investigation of a system identification algorithm which identifies an open-loop state-space model from a linear system that is operating under closed-loop conditions. In order to investigate the system identification algorithm some basic ideas of system identification theory are reviewed. Examples using simulated data are presented to characterize the effects of varying the parameters for open-loop and closed-loop system identification processes. Both noise· free and noise contaminated cases are simulated. Linear Quadratic Gaussian (LQG) control theory is reviewed and the motivation for using iterative LQG control feedback is discussed. The derivation of the proposed system identification algorithm …

Exceptions And Exception Handling In Computerized Information Processes, Diane M. Strong, Steven M. Miller

Research Collection School Of Computing and Information Systems

Exceptions, situations that cannot be correctly processed by computer systems, occur frequently in computer-based information processes. Five perspectives on exceptions provide insights into why exceptions occur and how they might be eliminated or more efficiently handled. We investigate these perspectives using an in-depth study of an operating information process that has frequent exceptions. Our results support the use of a total quality management (TQM) approach of eliminating exceptions for some exceptions, in particular, those caused by computer systems that are poor matches to organizational processes. However, some exceptions are explained better by a political system perspective of conflicting goals between …

An Upper Limit For The Τ Neutrino Mass From Τ → 5Π(Π0)Ντ Decays, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

From a sample of 152,000 τ decays collected by the ALEPH detector at LEP an upper limit of 24 MeV at 95% CL on the τ neutrino mass has been determined. The limit is obtained using a two dimensional likelihood fit of the visible energy and the invariant mass distribution of 25 τ → 5π(π0)ντ events.

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

Computer Science Technical Reports

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 Pseudo-Algorithmic Separation Of Lines From Pseudo-Lines, William Steiger, Ileana Streinu

Computer Science: Faculty Publications

No abstract provided.

1.4, Yolanda Jones

E-lert

No abstract provided.

Supereulerian Graphs And The Petersen Graph, Ii, Zhi-Hong Chen, Hong-Jian Lai

Scholarship and Professional Work - LAS

In this note, we verify two conjectures of Catlin in [J. Graph Theory 13 (1989) 465 - 483] for graphs with at most 11 vertices. These are used to prove the following theorem which improves prior results in [10] and [13]:

Let G be a 3-edge-connected simple graph with order n. If n is large and if for every edge 11.v E E(G), d(u) + d(v) 2 % - 2, then either G has a spanning eulerian subgraph or G can be contracted to the Petersen graph.

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

Teaching Accommodation Task Skills: From Human Demonstration To Robot Control Via Artificial Neural Networks, Paul V. Whalen

Theses and Dissertations

A simple edge-mating task, performed automatically by accommodation control, was used to study the feasibility of using data collected during a human demonstration to train an artificial neural network (ANN) to control a common robot manipulator to complete similar tasks. The 2-dimensional (planar) edge-mating task which aligns a peg normal to a fiat table served as the basis for the investigation. A simple multi-layered perceptron (MLP) ANN with a single hidden layer and linear output nodes was trained using the back-propagation algorithm with momentum. The inputs to the ANN were the planar components of the contact force between the peg …