Digital Commons Network^™

A Study Of Distributed Transaction Processing In Wide Area Network, Bharat Bhargava, Yongguang Zhang

Department of Computer Science Technical Reports

No abstract provided.

Writing, Supporting, And Evaluating Tripwire: A Publically Available Security Tool, Gene H. Kim, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

A Geometric Approach To Molecular Docking And Similarity, Chandrajit Bajaj, Fausto Bernardini, Kokichi Sugihara

Department of Computer Science Technical Reports

No abstract provided.

Thread Migration On Heterogeneous Systems Via Compile-Time Transformations, Janche Sang, Geoffrey W. Peters, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.

Recognition In Science And Engineering, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

The Parallel Envelope, M.G. Rossmann, M. A. Cornea-Hasegan, D. C. Marinsecu, Z. Zhang, Robert E. Lynch, J. Muckelbauer, R. Mckenna, S. Munshi, J-B. Dai

Department of Computer Science Technical Reports

No abstract provided.

Pdelab: An Object-Oriented Framework For Building Problem Solving Environments For Pde Based Applications, Sanjiva Weerawarana, Elias N. Houstis, John. R. Rice, Ann Christine Catlin, Cheryl L. Crabill, Chi Ching Chui

Department of Computer Science Technical Reports

No abstract provided.

Re-Evaluating Indexing Schemes For Nested Objects, Yin-He Jiang, Xiangning Liu, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

A Fortran Based Learning System Using Multilayer Back-Propagation Neural Network Techniques, Gregory L. Reinhart

Theses and Dissertations

An interactive computer system which allows the researcher to build an optimal neural network structure quickly, is developed and validated. This system assumes a single hidden layer perceptron structure and uses the back- propagation training technique. The software enables the researcher to quickly define a neural network structure, train the neural network, interrupt training at any point to analyze the status of the current network, re-start training at the interrupted point if desired, and analyze the final network using two- dimensional graphs, three-dimensional graphs, confusion matrices and saliency metrics. A technique for training, testing, and validating various network structures and …

A Format For Storing And Managing Multiple Level Of Detail Terrain For Simulated Environments, Keith L. Meissner

Theses and Dissertations

This study investigated a method of storing, managing and rendering terrain data, while addressing conflicting goals of. rendering speed, display detail and memory usage. A data structure is presented to store terrain data, with an object oriented system to manage the data stored in the structure. The structure stores terrain data in a compact form which is converted into rendering structures in real time. The structure uses levels of detail to maintain display detail. The structure is compared against an existing format for storing terrain data, MultiGen Flight. The system managing the structure is shown to decrease memory usage and …

Proof Of Correctness For Asocs Aa3 Networks, J. Cory Barker, Tony R. Martinez

Faculty Publications

This paper analyzes adaptive algorithm 3 (AA3) of adaptive self-organizing concurrent systems (ASOCS) and proves that AA3 correctly fulfills the rules presented. Several different models for ASOCS have been developed. AA3 uses a distributed mechanism for implementing rules so correctness is not obvious. An ASOCS is an adaptive network composed of many simple computing elements operating in parallel. An ASOCS operates in one of two modes: learning and processing. In learning mode, rules are presented to the ASOCS and incorporated in a self-organizing fashion. In processing mode, the ASOCS acts as a parallel hardware circuit that performs the function defined …

Automating Output Size And Reuse Metrics In A Repository-Based Computer-Aided Software Engineering (Case) Environment, R. D. Banker, Robert J. Kauffman, C. Wright, D. Zweig

Research Collection School Of Computing and Information Systems

Measurement of software development productivity is needed in order to control software costs, but it is discouragingly labor-intensive and expensive. Computer-aided software engineering (CASE) technologies-especially repository-based, integrated CASE-have the potential to support the automation of this measurement. We discuss the conceptual basis for the development of automated analyzers for function point and software reuse measurement for object-based CASE. Both analyzers take advantage of the existence of a representation of the application system that is stored within an object repository, and that contains the necessary information about the application system. We also discuss metrics for software reuse measurement, including reuse leverage, …

A Reduction Semantics For Array Expressions:The Psi Compiler, L. Mullin, S. Thibault

Computer Science Technical Reports

No abstract provided.

Formal Verification Of Distributed Deadlock Detection Algorithm Using A Time-Dependent Proof Technique, Pei-Yu Li, Bruce Mcmillin

Computer Science Technical Reports

A large number of published distributed deadlock detection/resolution algorithms are found to be incorrect because they have used informal approaches to prove the correctness of their algorithms. In this paper, we present a formal approach for the correctness proof and give an example of the proof. In this proposed approach, a formal model of distributed deadlock is presented with a local-time deadlock specification for correctness verification. With the formal model, we have an insight into the definition of deadlock in local views which is used to show the existence of a real deadlock. A rigorous proof to show the equivalence …

Conjugating Polynomials On Finite Rings, M. Insall, L. Mullin, R. Wilkerson

Computer Science Technical Reports

No abstract provided.

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

Using Tickets To Enforce The Serializability Of Multidatabase Transactions, Dimitrios Georgakopoulos, Marek Rusinkiewicz, Amit P. Sheth

Kno.e.sis Publications

To enforce global serializability in a multidatabase environment the multidatabase transaction manager must take into account the indirect (transitive) conflicts between multidatabase transactions caused by local transactions. Such conflicts are difficult to resolve because the behavior or even the existence of local transactions is not known to the multidatabase system. To overcome these difficulties, we propose to incorporate additional data manipulation operations in the subtransactions of each multidatabase transaction. We show that if these operations create direct conflicts between subtransactions at each participating local database system, indirect conflicts can be resolved even if the multidatabase system is not aware of …

Comet: A Synthetic Benchmark For Message-Passing Architectures, Nalini Ganapati, Steve Otto, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Rapid advances in hardware technology have led to wide diversity in parallel computer architectures. This diversity makes it difficult to evaluate or compare the performance of different parallel computers. Existing benchmarks tend either to be too architecture-specific, or too high-level. Both problems can result in benchmarks that not only provide insufficient information on the performance characteristics of the computer being tested, but are also difficult to port. New benchmarking approaches are needed for new architectural classes, particularly distributed-memory, message-passing computers. This paper focuses on benchmarking distributed-memory message-passing computers. A synthetic benchmark called CoMet (COmmunication METrics), is presented. CoMet is based …

An Algorithmic Palette Tool, Gary R. Greenfield

Department of Math & Statistics Technical Report Series

Our algorithmic tool follows the model of RGB percentage curves, but now the control of these curves is though algorithms that indirectly, and more abstractly, create, evolve, and modify such curves. To fully explain our methods we must first introduce the topic "mutating expressions." This is done in Section Two. In Section Three we document the user-interface problems we dealt with, and finally in Section Four discuss conclusions and suggest ideas for future exploration. Before commencing with the technical details however, we wish to emphasize the nature of the "colorization" problem that led to the conception and development of our …

Towards Feature Attachment, Xiangping Chen, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

Cooperating Brokers To Support Cooperative Work, Vinod Anupam, Chandrajit Bajaj, Peinan Zhang

Department of Computer Science Technical Reports

No abstract provided.

Experiences With Tripwire: Using Integrity Checkers For Intrusion Detection, Gene H. Kim, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Generic Naming In Generative, Constraint- Based Design, Vallis Capoyleas, Xiangping Chen, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

An Application Of Pattern Matching In Intrusion Detection, Sandeep Kumar, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Concurrent Use Of Two Programming Tools For Heterogeneous Supercomputers, Javier G. Vasquez

Theses

In this thesis, a demostration of the heterogeneous use of two programming paradigms for heterogeneous computing called Cluster-M and HAsC is presented. Both paradigms can efficiently support heterogeneous networks by preserving a level of abstraction which does not include any architecture mapping details. Furthermore, they are both machine independent and hence are scalable. Unlike, almost all existing heterogeneous orchestration tools which are MIMD based, HAsC is based on the fundamental concepts of SIMD associative computing. HAsC models a heterogeneous network as a coarse grained associative computer and is designed to optimize the execution of problems with large ratios of computations …

Graphical Oodb Modeling For Medical Information Standards (Gommis), Nagesh K. Puppala

Theses

Our task is to create a graphical representation of the European Prestandard for Medical Informatics on Message Exchange of Laboratory Information. This document, made available to us through Columbia Presbyterian, describes a standardized format for messages to be exchanged between a healthcare provider and a medical laboratory. The prestandard represents important information in a very disconnected way.

We have used OODINI system and language to develop our GOMMIS system. OODINI is a graphical editor for object-oriented database schemas that was developed at NJIT during the past three years. OODINI features a poweful set of icons that cover most concepts of …

Implementation Of An Automatic Mapping Tool For Massively Parallel Computing, Ajitha Gadangi

Theses

In this thesis, an implementation of a generic technique for fine grain mapping of portable parallel algorithms onto multiprocessor architectures is presented. The implemented mapping algorithm is a component of Cluster-M. Cluster-M is a novel parallel programming tool which facilitates the design and mapping of portable softwares onto various parallel systems. The other components of Cluster-M are the Specifications and the Representations. Using the Specifications, machine independent parallel algorithms are presented in a "clustered" fashion specifying the concurrent computations and communications at every step of the overall execution. The Representations, on the other hand, are a form of clustering the …

Authentication For Mobile Computing, Andreas Keppler

Theses

Host mobility is becoming an increasingly important feature with the recent arrival of laptop and palmtop computers, the development of wireless network interfaces and the implementation of global networks. Unfortunately, this mobile environment is also much more vulnerable to penetration by intruders. A possible means of protection can be authentication. This guarantees the identity of a communication peer.

This thesis studies the constraints imposed on the mobile environment with respect to authentication. It compares the two prevailing authentication mechanisms, Kerberos and SPX, and tries to make suggestions of how a mechanism can be adapted to the mobile environment.

Design And Implementation Of Ipis : An X-Window Based Image Processing Interactive System, Eduardo Morales

Theses

Most of image processing systems are based on command line functions or can only display one image at a time. This is a serious inconvenience for those who need an interactive system session or want to compare two images processed by different techniques at the same time.

The system was designed with these problems in mind. It is able to display the processed image right after an operation and to display several images simultaneously, making it simple to compare techniques. The system was also created with the purpose to be used in an academic environment. Its structured design makes it …

Graphical Oodb Modeling For Medical Information Standards (Gommis), Jiping Liu

Theses

The graphical representation of database schemata has been a useful tool for the designer and users of database systems. Such a tool for OODB schemata should incorporate a wide variety of symbols which cover most concepts of existing Object-Oriented Database (OODB), so it is sufficient to support a diverse group of object-oriented data models.

In this paper we created a. graphical representation, using the OOdini system and language, of the European Prestandard for Medical Informatics on Message Exchange of Laboratory Information. This European Prestandard describes a standardized format for messages to be exchanged between a. health care provider and a …