Physical Sciences and Mathematics Commons^™

Unix And Security: The Influences Of History, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Three Letters On Computer Security And Society, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

A Study In Systems Integration Architecture, Sashidhar M. Prasad

Theses

This Thesis studies the two architectures OSCA and ANSA which support the ODPSE principle in the first two parts. In the third part the framework for integrating these two architectures is described. The idea of integration architectures in relation to open architectures is studied using the enabling technologies.

User Authentication And Related Topics: An Annotated Bibliography, Eugene H. Spafford, Stephen A. Weeber

Department of Computer Science Technical Reports

No abstract provided.

A Note On Many-One And 1-Truth-Table Complete Languages, Steven Homer, Stuart A. Kurtz, James S. Royer

Electrical Engineering and Computer Science - Technical Reports

The polynomial time 1-tt complete sets for EXP and RE are polynomial time many-one complete.

The Combinatorics Of Algebraic Splines, Chanderjit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Optimal Algorithms For Multipacket Routing Problems On Rings, Fillia Makedon, Antonios Symvonis

Computer Science Technical Reports

We study multipacket routing problems. We divide the multipacket routing problem into two classes, namely, distance limited and bisection limited routing problems. Then, we concentrate on rings of processors. We prove a new lower bound of 2n/ 3 routing steps for the case of distance limited routing problems. We also give an algorithm that tightens this lower bound. For bisection limited problems the lower bound is kn/ 4,k >2, where k is the number of packets per processor. The trivial algorithm needs in the worst case k | n /2| steps to terminate. An algorithm that completes the routing in …

Visualization Of Four Dimensional Space And Its Applications (Ph.D. Thesis), Jianhua Zhou

Department of Computer Science Technical Reports

No abstract provided.

An Efficient Neural Algorithm For The Multiclass Problem, Rangachari Anand, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

One connectionist approach to the classification problem, which has gained popularity in recent years, is the use of backpropagation-trained feed-forward neural networks. In practice, however, we find that the rate of convergence of net output error is especially low when training networks for multi-class problems. In this paper, we show that while backpropagation will reduce the Euclidean distance between the actual and desired output vectors, the difference between some of the components of these vectors will actually increase in the first iteration. Furthermore, the magnitudes of subsequent weight changes in each iteration are very small, so that many iterations are …

Efficient Maximum-Likelihood Soft-Decision Decoding Of Linear Block Codes Using Algorithm A, Yunghsiang S. Han, Carlos R.P. Hartmann, Chih-Chieh Chen

Electrical Engineering and Computer Science - Technical Reports

In this report we present a novel and efficient maximum-likelihood soft-decision decoding algorithm for linear block codes. The approach used here is to convert the decoding problem into a search problem through a graph which is a trellis for an equivalent code of the transmitted code. Algorithm A*, which uses a priority-first search strategy, is employed to search through this graph. This search is guided by an evaluation function f defined to take advantage of the information provided by the received vector and the inherent properties of the transmitted code. This function f is used to drastically reduce the search …

Parallel Divide And Conquer, Per Brinch Hansen

Electrical Engineering and Computer Science - Technical Reports

We develop a generic divide and conquer algorithm for a parallel tree machine. From the generic algorithm we derive balanced, parallel versions of quicksort and the fast Fourier transform by substitution of data types, variables and statements. The performance of these algorithms is analyzed and measured on a Computing Surface configured as a tree machine with distributed memory.

Do Hypercubes Sort Faster Than Tree Machines?, Per Brinch Hansen

Electrical Engineering and Computer Science - Technical Reports

We develop a balanced, parallel quicksort algorithm for a hypercube and compare it with a similar algorithm for a binary tree machine. The performance of the hypercube algorithm is measured on a Computing Surface.

The Fast Fourier Transform, Per Brinch Hansen

Electrical Engineering and Computer Science - Technical Reports

This tutorial discusses the fast Fourier transform, which has numerous applications in signal and image processing. The FFT computes the frequency components of a signal that has been sampled at n points in O( n log n) time. We explain the FFT and illustrate it by examples and Pascal algorithms. We assume that you are familiar with elementary calculus.

Practical Prefetching Techniques For Parallel File Systems, David Kotz, Carla Schlatter Ellis

Dartmouth Scholarship

Parallel disk subsystems have been proposed as one way to close the gap between processor and disk speeds. In a previous paper we showed that prefetching and caching have the potential to deliver the performance benefits of parallel file systems to parallel applications. In this paper we describe experiments with practical prefetching policies, and show that prefetching can be implemented efficiently even for the more complex parallel file access patterns. We test these policies across a range of architectural parameters.

Caching And Writeback Policies In Parallel File Systems, David Kotz, Carla Schlatter Ellis

Dartmouth Scholarship

Improvements in the processing speed of multiprocessors are outpacing improvements in the speed of disk hardware. Parallel disk I/O subsystems have been proposed as one way to close the gap between processor and disk speeds. Such parallel disk systems require parallel file system software to avoid performance-limiting bottlenecks. We discuss cache management techniques that can be used in a parallel file system implementation. We examine several writeback policies, and give results of experiments that test their performance.

Specifying Interdatabase Dependencies In A Multidatabase Environment, Marek Rusinkiewicz, Amit P. Sheth, George Karabatis

Kno.e.sis Publications

The problem of interdatabase dependencies and the effect they have on applications updating interdependent data are addressed. A model that allows specifications of constraints among multiple databases in a declarative fashion is proposed. The separation of the constraints from the application programs facilitates the maintenance of data constraints and allows flexibility in their implementation. It allows investigation of various mechanisms for enforcing the constraints, independently of the application programs. By grouping the constraints together, it is possible to check their completeness and discover possible contradictions among them. The concepts of polytransactions, which use interdatabase dependencies to generate a series of …

A Case Study In Software Reuse: The Rntds Architecture, Barry J. Stevens

Computer Science Theses & Dissertations

It has been asserted that the most significant gains in software productivity will come from increased levels of software reuse. Some economic models for predicting savings through software reuse exist, but none are based on actual project experience. This paper surveys those models and presents the results of a case study, the Restructured Naval Tactical Data Systems (RNTDS) architecture, in the light of those models. According to the models, software reuse via the RNTDS architecture has enabled the production of fourteen major computer programs at five to twenty-one percent of the cost to create them without software reuse. Organizational characteristics …

Design And Analysis Of Asynchronous Adders, Khalid Khanfar

Masters Theses

The aim of this study is to come up with a fast adder suitable for use in self-timed subsystems. 7 adders were evaluated.

The findings from this study indicated that a Conditional Sum Adder (CSA) is the best candidate for high speed addition. One of the two resulting adders was given the name High Speed Conditional Sum Adder (HSCSA) .

Knowledge-Based Systems Approach For Offshore Safety Training, B. S. Lee, Venky Shankararaman

Research Collection School Of Computing and Information Systems

A number of training methods has been used within the offshore industry to impart safety knowledge and safe operating skills. In this paper a Knowledge-Based Safety Training architecture is proposed. The architecture uses both expert system and hypertext methods and is also applicable to plants other than offshore platforms. Special attention is given to the types of knowledge dealt with in safety training and how to represent this knowledge and teach it using various teaching strategies.

Optimal Parallel Algorithms For Periods, Palindromes And Squares (Preliminary Version), Alberto Apostolico, Dany Breslauer, Zvi Galil

Department of Computer Science Technical Reports

No abstract provided.

A Distributed Object-Oriented Discrete Event-Driven Simulation Environment-Dodese, Min Chen

FIU Electronic Theses and Dissertations

A new distributed object-oriented discrete event-driven simulation environment, DODESE, is developed to provide a common framework for simulation model design and implementation. The DODESE can be used to define a simulation including all the simulation objects participating in the simulation while the execution of the simulation can be interactively monitored on DODESE. The DODESE system has combined the strengths of both object-oriented paradigms and data base technology to make computer simulation more powerful and has achieved the goals of object-orientation, distribution, reusability, maintainability and extensibility. The system runs on two Sun workstations concurrently connected by an Ethernet. One of the …

Gcache: A Generalized Caching Mechanism, Douglas E. Comer, Shawn Ostermann

Department of Computer Science Technical Reports

No abstract provided.

Representation Requirements For Supporting Knowledge-Based Construction Of Decision-Models In Medicine, Tze-Yun Leong

Research Collection School Of Computing and Information Systems

This paper analyzes the medical knowledge required for formulating decision models in the domain of pulmonary infectious diseases (PIDs) with acquired immunodeficiency syndrome (AIDS). Aiming to support dynamic decision-modeling, the knowledge characterization focuses on the ontology of the clinical decision problem. Relevant inference patterns and knowledge types are identified.

Effects Of Replication On The Duration Of Failure In Distributed Databases, Donald B. Johnson, Larry Raab

Computer Science Technical Reports

Replicating data objects has been suggested as a means of increasing the performance of a distributed database system in a network subject to link and site failures. Since a network may partition as a consequence of such failures, a data object may become unavailable from a given site for some period of time. In this paper we study duration failure, which we define as the length of time, once the object becomes unavailable from a particular site, that the object remains unavailable. We show that, for networks composed of highly-reliable components, replication does not substantially reduce the duration of failure. …

Availability Issues In Data Replication In Distributed Database, Donald B. Johnson, Larry Raab

Computer Science Technical Reports

Replication of data at more than one site in a distributed database has been reported to increase the availability in data in systems where sites and links are subject to failure. We have shown in results summarized in this paper that in many interesting cases the advantage is slight. A well-placed single copy is available to transactions almost as much of the time as is correct replicated data no matter how ingeniously it is managed. We explain these findings in terms of the behavior of the partitions that form in networks where components fail. We also show that known and …

An Organization Of Sparse Gauss Elimination For Solving Pdes On Distributed Memory Machines, Mo Mu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

How To Count Quickly And Accurately: A Unified Analysis Of Probabilistic Counting And Other Related Problems, Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

A Declarative View Of Inheritance In Logic Programming, M. Bugliesi

Department of Computer Science Technical Reports

No abstract provided.

Unstructured Scheduling In Parallel Pde Sparse Solvers On Distributed Memory Machines, Mo Mu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

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