Physical Sciences and Mathematics Commons^™

Self-Alignments In Words And Their Applications, Alberto Apostolico, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Architecture And Operation Invocation In The Clouds Kernel, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Towards Implementing Robust Geometric Computations, Christoph M. Hoffmann, John E. Hopcroft, Michael S. Karasick

Department of Computer Science Technical Reports

No abstract provided.

A Robust Distributed Termination Detection Algorithm, Niraj K. Sharma, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

Some Efficient Computational Algorithms Related To Phase Models, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.

A System For Experimentation In Replicated Copy Control, Bharat Bhargava, Paul Noll, Andrew Royappa, Donna Sabo

Department of Computer Science Technical Reports

No abstract provided.

Multilist And Inverted File System Performance Measurements, Ashok Chandramouli, George Winston Zobrist

Computer Science Technical Reports

This study evaluates the multilist and inverted file systems. It describes the structure of the two file system and then proceeds to investigate the performance. The performance is based on quantitative estimates of space requirements for file system, time to retrieve records, time to insert a record, time to delete a record, time to update a record and time to exhaustively read and reorganize the file system. The study then investigates specific situations in which one file system seems to perform better than the other.

Performance Parameter Measurements Of Generic Files, Sankarraman Subramanian, George Winston Zobrist

Computer Science Technical Reports

This study discusses the performance parameter measurements of generic files, the pile file, the sequential file, the indexed-sequential file, the indexed file and the direct file. The file performance measurements are compiled in a software package. The study then describes the use of such software package as a simulation tool in a file design environment.

Heuristic Coloring Algorithm For The Composite Graph Coloring Problem, Johnnie C. Roberts, Billy E. Gillett

Computer Science Technical Reports

A composite graph is a finite undirected graph in which a positive integer known as a chromaticity is associated with each vertex of the graph. The composite graph coloring problem (CGCP) is the problem of finding the chromatic number of a composite graph, i.e., the minimum number of colors (positive integers) required to assign a sequence of consecutive colors to each vertex of the graph in a manner such that adjacent vertices are not assigned sequences with colors in common and the sequence assigned to a vertex has the number of colors indicated by the chromaticity of the vertex. The …

Shape Recognition By Curvature Changing Points And Fourier Transform, Jianzhong Li

Masters Theses

Computer vision is a relatively new and fast-growing field. Shape representation and recognition is a very important but difficult branch in this field.

One method of using curvature changing points and Fourier transform to recognize the shape is described in this thesis. Also an important feature in computer vision, multiscaling, is achieved by this method.

Parallel Symmetry-Breaking In Sparse Graphs, Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon

Department of Computer Science Technical Reports

No abstract provided.

A Microprocessor-Based Multivariable Interactive Control System, Sayed Mehdi Khayam-Nekouei

Electronic Theses & Dissertations

This study outlines the various types of control systems and reviews the necessary mathematical techniques to solve the problem of multivariable interactive control. The characteristics as well as the state representation for control processes involving either p or v type canonical structures are discussed. Next, the characteristics of multivariable interactive discrete control systems are discussed in detail. The advantages of flexibility and speed of microprocessors are used as powerful tools to implement a microprocessor-based system can be employed to control discrete processes. To demonstrate a practical application of a microprocessor-based system in a multivariable interactive discrete process, the algorithm and …

The Western Michigan University Programming Contest Proctor System, Joel Marshall Fletcher

Masters Theses

A software package for administering programming contests has been developed for DECsystem-10 timesharing computers. This package provides a neutral editing environment for contestants, a method for submitting problems for execution, and an automatic judging facility for evaluating contestants' solutions and tabulating scores. The proctor system has been used in numerous competitions, including a regional contest sponsored by the Association for Computing Machinery.

A Graphic Implementation Of Blocks World As An Example Of Artificial Intelligence, Shigenori Ochiai

Masters Theses

The objective of this study is to implement blocks world as a classic example of artificial intelligence both visually and realistically.

The visual representation is implemented by using a graphic system in a microcomputer. Real world constraints are implemented as rules concerning centers of gravity.

These goals are significant in realizing principles of artificial intelligence. Visual data help a human being to quickly understand the state of a system. Also, bringing a situation closer to the real world is a step toward to the final goal of artificial intelligence.

An Application Of Stochastic Learning Automata To Queueing Disciplines, Tearesa Lynn Wegscheid

Masters Theses

There has been extensive research in the area of Stochastic Learning in both Psychology and Computer Science. This thesis examines the literature of Stochastic Learning automata with respect to operation control. It traces the development of an optimal reinforcement scheme, and examines the applications of Stochastic Learning automata in routing. The paper simulates M/M/3 and M/M/5 queueing systems similar to the system described by Glorioso and Osorio. The simulation implements L_r-p, L_i-p, and L_r-i learning models and compares their performance to Teller Window and Jockeying. A blocking factor is developed to provide more information for …

Efficient Parallel Algorithms For String Editing And Related Problems, Alberto Apostolico, Mikhail J. Atallah, Lawrence L. Larmore, Scott Mcfaddin

Department of Computer Science Technical Reports

No abstract provided.

Robust Set Operations On Polyhedral Solids, Christoph M. Hoffmann, John E. Hopcroft, Michael S. Karasick

Department of Computer Science Technical Reports

No abstract provided.

Shadow Editing: A Distributed Service For Supercomputer Access, Douglas E. Comer, Jim Griffioen, Rajendra Yavatkar

Department of Computer Science Technical Reports

No abstract provided.

An Evaluation Of The Effectiveness Of Adaptive Histogram Equalization For Contrast Enhancement, John B. Zimmerman, Stephen M. Pizer, Edward V. Staab, J. Randolph Perry, William Mccartney, Bradley C. Brenton

All Computer Science and Engineering Research

Adaptive Histogram Equalization (AHE), a method of contrast enhancement which is sensitive to local spatial information in an image, has been proposed as a solution to the problem of the inability of ordinary display devices to depict the full dynamic intensity range in some medical images. This method is automatic, reproducible, and simultaneously displays most of the information contained in the grey-scale contrast of the image. However, it has not been known whether the use of AHE causes the loss of diagnostic information relative to the commonly-used method intensity windowing. In the current work, AHE and intensity windowing are compared …

Decoding Of Dbec-Tbed Reed-Solomon Codes, Robert H. Deng, Daniel J. Jr. Costello

Research Collection School Of Computing and Information Systems

A problem in designing semiconductor memories is to provide some measure of error control without requiring excessive coding overhead or decoding time. In LSI and VLSI technology, memories are often organized on a multiple bit (or byte) per chip basis. For example, some 256K bit DRAM's are organized in 32K ?? 8 bit-bytes. Byte-oriented codes such as Reed-Solomon (RS) codes can provide efficient low overhead error control for such memories. However, the standard iterative algorithm for decoding RS codes is too slow for these applications. In this correspondence we present a special decoding technique for double-byte-error-correcting (DBEC), triple-byte-error-detecting (TBED) RS …

Do We Really Need To Balance Patricia Tries?, Peter Kirschenhofer, Helmut Prodifger, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Ultimate Stability Conditions For Some Multidimensional Distributed Systems, Wojciech Szpankowski, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.

Evaluation Of Concurrent Pools, David Kotz, Carla Ellis

Dartmouth Scholarship

In a parallel environment, requests for allocation and deallocation of resources or assignment of tasks should be served in a fashion that helps to balance the load and minimize the total parallel runtime. It is important to perform this allocation in a manner that preserves locality and by avoiding remote references (and hence interference with other processes). Concurrent pools, as described by Manber, provide an appropriate data structure for addressing these goals. This paper eveluates the effectiveness of the pool structure under a variety of stressful workloads. It was found that the simpler algorithm than that described by Manber may …

Load And Communications Balancing On Multiprocessor Logic Simulation Engines, Ken Wong, Mark A. Franklin

All Computer Science and Engineering Research

The problem considered in this paper is to find an assignment of logic components to processors which will achieve logic simulation speed-ups approaching the ideal for large processor populations. This problem becomes particularly important when a significant portion of the speed-up expected from logic simulation engines is attributed to load sharing (as opposed to obtaining speed-up by employing specialized hardware to carry out specific tasks associated with the simulation process such as event queue manipulation or function evaluation). Our research considers this problem for a particular multiprocessor simulation architecture for which a performance model has bene developed. The model is …

On-Line Sea Beam Acoustic Imaging, Christian De Moustier, F V. Pavlicek

Center for Coastal and Ocean Mapping

This paper describes a system designed and built at the Marine Physical Laboratory of the Scripps Institution of Oceanography to produce acoustic images of the seafloor on-line with a Sea Beammultibeam echo-sounder. This system uses a stand alone interface between the Sea Beam system and a grey-scale line-scan recorder. The interface is built around a Motorola 68000 microprocessor and has digitizing capabilities. It digitizes the detected echo signals from each of the 16 preformed beams inside the Sea Beam echo processor as well as the roll information given by the ship's vertical reference. Theacoustic data are then roll compensated and …

Parallel Construction Of A Suffix Tree With Applications, A. Apostolico, C. Iliopoulos, G. M. Landau, B. Schieber, U. Vishkin

Department of Computer Science Technical Reports

No abstract provided.

Mathematical Aspects Of Scientific Software, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A Dynamic Majority Determination Algorithm For Reconfiguration Of Network Partitions, Bharat Bhargava, Peter Lei Ng

Department of Computer Science Technical Reports

No abstract provided.

Ultimate Characterizations Of The Burst Response Of An Interval Searching Algorithm, Philippe Jacquet, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Shells In An Interactive System, Balachander Krishnamurthy

Department of Computer Science Technical Reports

No abstract provided.