Digital Commons Network^™

Efficient Algorithms For Hybrid Data/Voice Transmissions, Andrzej Kusiuk, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Output-Sensitive Hidden Surface Elimination For Rectangles, Mikhail J. Atallah, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.

Semi-Automatic Process Decomposition For Non-Shared Memory Machines, Charles Koelbel, Piyush Mehrotra

Department of Computer Science Technical Reports

No abstract provided.

A Formalism For Describing Data Distribution, Charles Koelbel

Department of Computer Science Technical Reports

No abstract provided.

Analysis Of A Two Level Asynchronous Algorithm For Pdes, John R. Rice, Dan C. Marineseu

Department of Computer Science Technical Reports

No abstract provided.

Composite Graph Coloring Algorithms And Applications, Stephen Hong Seng Yek, Billy E. Gillett

Computer Science Technical Reports

A vertex-composite graph is a graph that can have unequal chromaticities on its vertices. Vertex-composite graph coloring or composite graph coloring involves coloring each vertex of a composite graph with consecutive colors according to the vertex's chromaticity with no two vertices adjacent to one another having the same color(s).

New heuristic algorithms including the use of the saturation degree method have been developed in this research. All eleven heuristic algorithms including Clementson and Elphick algorithms were then tested using random composite graphs with five different chromaticity distributions. The best algorithm which uses the least average colors from the experiment is …

A User Guide To The Algorithm Mapper: A System For Modeling And Evaluating Parallel Applications/Architecture Pairs, C. E. Houstis, Elias N. Houstis, John R. Rice, S. M. Samartizis, D.L. Alexandrakis

Department of Computer Science Technical Reports

No abstract provided.

Experimenal Evaluation Of Concurrent Checkpointing And Rollback-Recovery Algorithms, Bharat Bhargava, Pei-Jyun Leu, Shy-Renn Lian

Department of Computer Science Technical Reports

No abstract provided.

Computer Use In The Warren County Riii School District: A Proposal For The Implementation Of A Computer Lab Program In The Elementary School, Debbie Reese

Theses

A problem faced by many schools in the 1980s is how to approach computer ir1struction in the elementary grades. Schools have moved into a new technological realm with the advent of the modern microcomputer. The focus of this project was to investigate current trends in computer education in the elementary grades in respect to computer placement within the schools and content of computer education programs. The paper addresses, specifically, the lack of a computer program in the Warren County RIII School District and the rationale for developing a computer lab in the elementary school. An interim plan is also proposed, …

Flows: Performance Guarantees In Best Effort Delivery Systems, Douglas E. Comer, Rajendra Yavatkar

Department of Computer Science Technical Reports

No abstract provided.

Dc-Free Coset Codes, Robert H. Deng, M. A. Herro

Research Collection School Of Computing and Information Systems

An upper bound on the bit-error probability (BEP) of a linear cyclic code over GF(2l) with hard-decision (HD) maximum-likelihood (ML) decoding on memoryless symmetric channels is derived. Performance results are presented for Reed-Solomon codes on GF(32), GF(64), and GF(128). Also, a union upper bound on the BEP of a linear cyclic code with either hard- or soft-decision ML decoding is developed, as well as the corresponding bounds for the extended code of a linear cyclic code. Using these bounds, which are tight at low bit error rate, the performance advantage of soft-decision (SD) ML and HD ML over bounded-distance (BD) …

Atamm Multicomputer System Design, William Robert Tymchyshyn

Electrical & Computer Engineering Theses & Dissertations

The Algorithm To Architecture Mapping Model, or ATAMM, is a graph theoretic design methodology that has been created to resolve design and performance issues involved with concurrent processing. Petri-net marked graphs are used to represent the computational environment.

This thesis describes the development of a multicomputer system which will operate within the bounds specified by the ATAMM model. The system is first designed and implemented using the framework of standard multicomputer design theory. A validation is then performed by the comparison of the system's computational performance to results predicted by ATAMM. This validation is shown to be successful for three …

A Generic Algorithm For Transaction Processing During Network Partitioning, Bharat Bhargava, Shirley Browne

Department of Computer Science Technical Reports

No abstract provided.

Engineering The Object-Relation Database Model In O-Raid, Bharat Bhargava, Prasun Dewan, Stephen Leung

Department of Computer Science Technical Reports

No abstract provided.

Seth: A Quorum-Based Replicated Database System For Experimentation With Failures, Bharat Bhargava, Abdelsalam Helal, Jagannathan Srinivasan

Department of Computer Science Technical Reports

No abstract provided.

Three Experiments In Reliable Transaction Processing In Raid, Bharat Bhargava, Fady Lamaa, Pei-Jyun Leu, John Riedl

Department of Computer Science Technical Reports

No abstract provided.

Estimating Lower Bounds On Buffer Sizes For A Packet Switch, Douglas E. Comer, Rajendra Yavatkar

Department of Computer Science Technical Reports

No abstract provided.

Dynamics Of Knowledge Processing In Parallel Systems, Abhijit Chaundhury, Dan C. Marinescu, Andrew Whinston

Department of Computer Science Technical Reports

No abstract provided.

Machine Learning: A Critique Of Research Efforts And Suggested Research Strategy, William S. Davis, David B. Murrell

Department of Computer Science Technical Reports

No abstract provided.

Robust Replication Control Using Primary Copy Method, Niraj K. Sharma

Department of Computer Science Technical Reports

No abstract provided.

The Problem Of Accuracy And Robustness In Geometric Computation, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

Locating Distributed Information, Craig E. Wills

Department of Computer Science Technical Reports

No abstract provided.

Service Execution In A Distributed Environment (Thesis), Craig E. Wills

Department of Computer Science Technical Reports

No abstract provided.

Computer Control Of A Pbx Washout Plant, Scott Cameron Sharp, Chung You Ho

Computer Science Technical Reports

A fully automated, computer controlled plant has been designed specifically for safe removal of plastic bonded explosives (PBX) from obsolete military munitions. This PBX washout plant consists of a two stage delivery system and robotically operated high pressure waterjet lance. The assigned task was to develop control packages for each component.

The first stage of the delivery system is a battery operated overhead trolley. Its control package consist of a dedicated computer, DC motor and custom positioning subprograms. The dedicated computer communicates through an infrared link to the operator's computer. This link was developed due to requirements of a hazardous …

Supporting Objects In A Conventional Operating System, Prasun Dewan

Department of Computer Science Technical Reports

No abstract provided.

An Approach To Support Automatic Generation Of User Interfaces, Prasun Dewan, Marvin Solomon

Department of Computer Science Technical Reports

No abstract provided.

On The Analysis Of Request-Response Communication In A Token Passing Ring, Dan Cristian Marinescu

Department of Computer Science Technical Reports

No abstract provided.

An Optimal Parallel Algorithm For The Visibility Of A Simple Polygon From A Point, Mikhail J. Atallah, Danny Z. Chen, Hubert Wagner

Department of Computer Science Technical Reports

No abstract provided.

Micro Database Management System Language, Karen Yingling Tam, George Winston Zobrist

Computer Science Technical Reports

There are two approaches to solve computational problems in a microcomputer environment:

1. Non-database approach: uses a high level programming language with non-database files as input and/or output files.
2. Database approach: uses the programming language embedded in the micro Data Base Management System(DBMS), with the database defined by the integrated database definition language as input and/or output files.

Adopting the appropriate approach in any single application may save cost and time. This paper compares the two different approaches while solving the same Control Section (CSECT) Interaction Hierarchy problem and suggests which to use when.

Implementation Of Raid, Bharat Bhargava, John Riedl

Department of Computer Science Technical Reports

No abstract provided.