Physical Sciences and Mathematics Commons^™

Flexibility And Performance Of Parallel File Systems, David Kotz, Nils Nieuwejaar

Dartmouth Scholarship

Many scientific applications for high-performance multiprocessors have tremendous I/O requirements. As a result, the I/O system is often the limiting factor of application performance. Several new parallel file systems have been developed in recent years, each promising better performance for some class of parallel applications. As we gain experience with parallel computing, and parallel file systems in particular, it becomes increasingly clear that a single solution does not suit all applications. For example, it appears to be impossible to find a single appropriate interface, caching policy, file structure, or disk management strategy. Furthermore, the proliferation of file-system interfaces and abstractions …

Fast Compression Of Transportable Tcl Scripts, Robert S. Gray

Computer Science Technical Reports

An information agent is charged with the task of searching a collection of electronic resources for information that is relevant to the user's current needs. These resources are often distributed across a network and can contain tremendous quantities of data. One of the paradigms that has been suggested for allowing efficient access to such resources is transportable agents -- the agent is sent to the machine that maintains the information resource; the agent executes on this remote machine and then returns its results to the local machine. We have implemented a transportable agent system that uses the Tool Command Language …

Graphics For Macromolecular Crystallography And Electron Microscopy, Ioana Maria Martin, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Bond- A Parallel Virtual Environment, Mihai G. Sirbu, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Web//Ellpack: A Networked Computing Service On The World Wide Web, Sanjiva Weerawarana, Elias N. Houstis, John R. Rice, Margaret G. Gaitatzes, Shahani Markus

Department of Computer Science Technical Reports

No abstract provided.

A Multiagent Environment For Mpses, Tzvetan T. Drashansky, Anupam Joshi, John R. Rice, Elias N. Houstis, Sanjiva Weerawarana

Department of Computer Science Technical Reports

No abstract provided.

A Performance Monitoring Environment And Its Use For The Study Of Paging And I/O Activity Of Parallel Programs, Kuei Yu Wang, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Exploiting Symmetry In Parallel Computations For Structural Biology, Ioana Maria Martin, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

A Secure Message Broadcasting System (Smbs), Mark Crosbie, Ivan Krsul, Steve Lodin, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Automatic Generation Of 3d Cad Models, Chandrajit L. Bajaj, Fausto Bernardini, Jindon Chen, Daniel R. Schikore

Department of Computer Science Technical Reports

No abstract provided.

On The Minimization Of The L(2)-Norms Of The Sor And Msor Operators, Apostolos Hadjidimos, Michael Neumann

Department of Computer Science Technical Reports

No abstract provided.

On Gang Scheduling And Demand Paging, Dan C. Marinescu, Kuei Yu Wang

Department of Computer Science Technical Reports

No abstract provided.

On Tailoring Thread Schedules In Protocol Design: Experimental Results, Juan Carlos Gomez, Vernon J. Rego, V. S. Sunderam

Department of Computer Science Technical Reports

No abstract provided.

Entity Identification In Database Integration, Ee Peng Lim, Jaideep Srivastava, Satya Prabhakar, James Richardson

Research Collection School Of Computing and Information Systems

The objective of entity identification is to determine the correspondence between objective instances from more than one database. This paper examines the problem at the instance level assuming that schema level heterogeneity has been resolved a priori. Soundness and completeness are defined as the desired properties of any entity-identification technique. To achieve soundness, a set of identity and distinctness rules have to be established for the entities in the integrated world. We then propose the use of extended key, which is the union of keys (and possibly other attributes) from the relations to be matched, and its corresponding identity rule …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 2, February 1996, 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.

A Precise Measurement Of The Average B Hadron Lifetime, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

An improved measurement of the average b hadron lifetime is performed using a sample of 1.5 million hadronic Z decays, collected during the 1991–1993 runs of ALEPH, with the silicon vertex detector fully operational. This uses the three-dimensional impact parameter distribution of lepton tracks coming from semileptonic b decays and yields an average b hadron lifetime of 1.533 ± 0.013 ± 0.022 ps.

Identifying And Exploiting Concurrency In Object-Based Real-Time Systems, Guohui Yu

Dissertations

The use of object-based mechanisms, i.e., abstract data types (ADTs), for constructing software systems can help to decrease development costs, increase understandability and increase maintainability. However, execution efficiency may be sacrificed due to the large number of procedure calls, and due to contention for shared ADTs in concurrent systems. Such inefficiencies are a concern in real-time applications that have stringent timing requirements. To address these issues, the potentially inefficient procedure calls are turned into a source of concurrency via asynchronous procedure calls (ARPCs), and contention for shared ADTS is reduced via ADT cloning. A framework for concurrency analysis in object-based …

Compiling Evaluable Functions In The GöDel Programming Language, David Shapiro

Dissertations and Theses

We present an extension of the Gödel logic programming language code generator which compiles user-defined functions. These functions may be used as arguments in predicate or goal clauses. They are defined in extended Gödel as rewrite rules. A translation scheme is introduced to convert function definitions into predicate clauses for compilation. This translation scheme and the compilation of functional arguments both employ leftmost-innermost narrowing. As function declarations are indistinguishable from constructor declarations, a function detection method is implemented.

The ultimate goal of this research is the implementation of extended Gödel using needed narrowing. The work presented here is …

A Performance Comparison Of Tcp/Ip And Mpi On Fddi, Fast Ethernet, And Ethernet, Saurab Nog, David Kotz

Computer Science Technical Reports

Communication is a very important factor affecting distributed applications. Getting a close handle on network performance (both bandwidth and latency) is thus crucial to understanding overall application performance. We benchmarked some of the metrics of network performance using two sets of experiments, namely roundtrip and datahose. The tests were designed to measure a combination of network latency, bandwidth, and contention. We repeated the tests for two protocols (TCP/IP and MPI) and three networks (100 Mbit FDDI (Fiber Distributed Data Interface), 100 Mbit Fast Ethernet, and 10 Mbit Ethernet). The performance results provided interesting insights into the behaviour of these networks …

Transportable Information Agents, Robert Gray, Daniela Rus, David Kotz

Computer Science Technical Reports

We have designed and implemented autonomous software agents. Autonomous software agents navigate independently through a heterogeneous network. They are capable of sensing the network configuration, monitoring software conditions, and interacting with other agents. Autonomous agents are implemented as transportable programs, e.g., programs that are capable of suspending execution, moving to a different machine, and starting from where they left off. We illustrate the intelligent behavior of autonomous agents in the context of distributed information-gathering tasks.

Cooperative Assistance For Remote Robot Supervision, Robin R. Murphy, Erika Rogers

Computer Science and Software Engineering

This paper describes current work on a cooperative tele-assistance system for semi-autonomous control of mobile robots. This system combines a robot architecture for limited autonomous perceptual and motor control with a knowledge-based operator assistant which provides strategic selection and enhancement of relevant data. It extends recent developments in artificial intelligence in modeling the role of visual interactions in problem solving for application to an interface permitting the human and remote to cooperate in cognitively demanding tasks such as recovering from execution failures, mission planning, and learning. The design of the system is presented, together with a number of exception-handling scenarios …

A Study Of Visual Reasoning In Medical Diagnosis, Erika Rogers

Computer Science and Software Engineering

The purpose of this paper is to describe experimental work conducted in the area of diagnostic radiology,with an emphasis on how perception and problem solving interact in this type of task. This work was part of a larger project whose goals included the development of an information-processing model of visual interaction,and the subsequent design of an intelligent cooperative assistant for this domain.

Verbal protocol data was collected from eight radiologists (six residents and two experts) while they examined seven different computer-displayed chest x-rays. A brief overview of the methodology and analysis techniques is presented, together with specific results from one …

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

An Examination Of Virtual Reality Modeling Language And Its Implications For The Future Of The World Wide Web, Mitch L. Hamelau

Honors Theses, 1963-2015

This project examines the current and future capabilities of Virtual Reality Modeling Language (VRML). VRML is first looked at in terms of its own current capabilities and limitations and then in terms of the impact that it will have on the World Wide Web. Some examples of future changes to the World Wide Web that may come about due to VRML are examined. Then a specific application is used as an example of the advantages VRML provides for developers who use the World Wide Web.

Researching The Growing Technology Of Virtual Reality, David Weinandt

Honors Theses, 1963-2015

Virtual reality is a fast growing technology within the computer science field. The current technologies using virtual reality are invading our everyday lives such as the medical applications of ultrasound and catscans. This technology is changing how we view data, as well as how common user applications are being constructed. The primary focus of the thesis is on the computer code necessary to compute the tracking of users. How the environment is generated, how users and objects are viewed by the computer, and how tracking codestructured on a basic level are some of the questions I cover in my thesis. …

Using Genetic Algorithms To Solve The Geometric Traveling Salesperson Problem, Michael Criswell

Honors Theses, 1963-2015

Genetic Algorithms use life as their model to solve difficult problems in computer science. They use a collection of possible solutions to find an optimal solution in extremely large search spaces. They follow biological processes such as crossover and mutation and implement Darwinian natural selection to use the better solutions to create more possible solutions until an optimal solution has been found. The Traveling Salesperson Problem lies within a class of problems called NP. These problems are not solvable in a reasonable amount of time using classical methods. Genetic Algorithms are an alternative method for attempting to solve such problems. …

Improving Circuit Testability By Clock Control, Kent L. Einspahr, Sharad C. Seth, Vishwani D. Agrawal

CSE Conference and Workshop Papers

The testability of a sequential circuit can be improved by controlling the clocks of individual storage elements during testing. We propose several clock control strategies derived from an analysis of the circuit, its S-graph structure, and its function. Through examples we show how the number of clocks affects the circuit’s testability. It is shown that if certain flip-flops (FFs) are scanned (or otherwise initialized), the remaining FFs can be controlled and initialized to any arbitrary state using the clock control. We derive a controllability graph and use it to assign clocks to FFs and to schedule the clocks to set …

Wild Software Meta-Systems, Kent D. Palmer

Kent D. Palmer

Essays in Software Engineering and Philosophy

INTRODUCTION

1. Software Engineering Design Methodologies and General Systems Theory

SOFTWARE ENGINEERING FOUNDATIONS A Paradigm for Understanding Software Design Methods

2. Software Ontology 3. Software Systems Meta-methodology 4. Integral Software Engineering Methodology

PROCESS ENGINEERING

5. The Future of Software Process

Some Syntactic, Semantic And Prosodic Characteristics In British English Conversation, Philadelphia University

Philadelphia University, Jordan

No abstract provided.

Hypertext Theory And Narrative, Eoin Kilfeather

Articles

No abstract provided.