Digital Commons Network^™

Statistics On Logic Simulation, K. F. Wong, Mark A. Franklin, Roger D. Chamberlain, B. L. Shing

All Computer Science and Engineering Research

The high costs associated with logic simulation of large VLSI based systems have led to the need for new computer architectures tailored to the simulation task. Such architecture have the potential for significant speedups over standard software based logic simulators. Several commercial simulation engines have been produced to satisfy need in this area. To properly explore the space of alternative simulation architectures, data is required on the simulation process itself. This paper presents a framework for such data gathering activity by first examining possible sources of speedup in the logic simulation task, examining the sort of data needed in the …

Overloading Of Names In Distributed Systems, Douglas E. Comer, Ralph E. Droms

Department of Computer Science Technical Reports

No abstract provided.

A Communication Sub-System For Mvs/Xa, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

An Analysis Of A Contention Resolution Algorithm --- Another Approach, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Bounds For Queue Lengths In A Contention Packet Broadcast System, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Solution Of A Linear Recurrence Equation Arising In Analysis Of Some Algorithms, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Retrospective Data Filter, Richard J. Prengaman, Robert E. Thurber, Joe Phipps, Ronald I. Greenberg, Wai L. Hom, James F. Jaworski, Guy W. Riffle

Computer Science: Faculty Publications and Other Works

In a target detection communication system, apparatus and method for determining the presence of probable targets based on contacts (which can indicate the presence of a target, noise, chatter, or objects not of interest) detected within a predefined position sector or sectors over a specified number of scans. The position of each detected contact, as a contact of interest, is compared with the positions of contacts detected at previous times or scans. Velocity profiles indicate which previous contacts support the likelihood that the contact of interest represents a target having a velocity within a defined band. The likelihood, which can …

Structure And Motion Of A Rigid Object Having Unknown Constant Motion, Chia-Hoang Lee, Azriel Rosenfeld

Department of Computer Science Technical Reports

No abstract provided.

The Myriad Virtues Of Subword Trees, Alberto Apostolico

Department of Computer Science Technical Reports

No abstract provided.

Data Structures And Algorithms For The String Statistics Problem, A. Apostolico, F. P. Preparata

Department of Computer Science Technical Reports

No abstract provided.

Structural Properties Of The String Statistics Problem, A. Apostolico, F. P. Preparata

Department of Computer Science Technical Reports

No abstract provided.

Robust Transmission Of Unbounded Strings Using Fibonacci Representations, Alberto Apostolico, Aviezri S. Fraenkel

Department of Computer Science Technical Reports

No abstract provided.

A Fast Linear Space Algorithm For Computing Longest Common Subsequences, A. Apostolio, C. Guerra

Department of Computer Science Technical Reports

No abstract provided.

Remark On Hsu-Du New Algorithm For The Lcs Problem, A. Apostolico

Department of Computer Science Technical Reports

No abstract provided.

Improving The Worst Case Performance Of The Hunt-Szymanski Strategy For The Longest Common Subsequence Of Two Strings, Alberto Apostolico

Department of Computer Science Technical Reports

No abstract provided.

The Longest Common Subsequence Problem Revisited, A. Apostolico, C. Guerra

Department of Computer Science Technical Reports

No abstract provided.

The Boyer-Moore-Galil String Searching Strategies Revisited, Alberto Apostolicao, Raffaele Giancarlo

Department of Computer Science Technical Reports

No abstract provided.

Fast Parallel Algorithms For Voronoi Diagrams, Micahel T. Goodrich, Colm O'Dunlaing, Chee Yap

Department of Computer Science Technical Reports

No abstract provided.

Design Of Multivariable Feedback Control Systems Via Spectral Assignment, Mohsen Marefat

Electrical & Computer Engineering Theses & Dissertations

During the past 15 year s significant advances have been made towards developing viable synthesis- techniques for multivariable feedback control systems. The entire aggregate of this theoretical work has been reviewed and consolidated. Diverse notations have been standardized into a single system. A two-step design philosophy for spectral assignment has been developed which first meets stability and time response requirements by assigning eigenvalues and eigenvector s and then provides for attainment of secondary objectives without significant deviation from the initial assignment. Finally, a computer-aided design package has been created to streamline the process of mathematical calculation and to allow users …

High Performance Switching Circuits For Vlsi, Ali Reza Feizi

Electrical & Computer Engineering Theses & Dissertations

Interconnection topology and device performance are of major concern in the design of LSI/VLSI systems, Pass networks are very suitable in this regard because of low power consumption, high density, and simple interconnection topology. A special type of pass networks called Binary Tree Structured (BTS) pass networks uses almost minimum number of transistors for the design of switching circuits. An algorithmic procedure is developed here for BTS pass networks which is very efficient in terms of both execution time and memory space. Based on these networks, the necessary and sufficient conditions are derived for the design of multiple-output pass networks. …

Adaptive Tensor Product Grids For Singular Problems, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Efficient Algorithms For Common Transversals, Mikhail J. Atallah, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Randomized Routing On Fat-Trees, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

Fat-trees are a class of routing networks for hardware-efficient parallel computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the load factor of a set of messages to be routed, which is a lower bound on the time required to deliver the messages. We show that if a set of messages has load factor lambda on a fat-tree with n processors, the number of delivery cycles (routing attempts) that the algorithm requires is O(lambda+lgnlglgn) with probability 1-O(1/ …

Information Retrieval In The Office For Effective Communication, Herbert Josef Schwoerer

Theses

The office worker of tomorrow, who is very likely to be an 'information-worker', will be heavily involved with communication of any kind. Effective communication, however, can only be guaranteed if the user is in control of information overload.

OIRS, the Office Information Retrieval System, designed and developed as a Master Thesis, is an approach to support the office worker in storing, maintaining, and retrieving textual information. By providing the user with a tool to impose a self-defined and self-maintained structure upon information or references to it, information overload, which is caused by lack of information about information, can be decreased. …

The Aspect Ratio Significant For Finite Element Problems, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Order Statistics And Other Complex Data Operations On Tree-Structured Dictionary Machines, Michael T. Goodrich, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.

Method And Apparatus For Performing Hashing Operations Using Galois Field Multiplication, John L. Carter, George Markowsky, Mark N. Wegman

Computer Science Faculty Research & Creative Works

The invention comprises a method and apparatus for performing a hashing operation on an N bit number under control of a prespecified N bit hashing constant which comprises performing N/K finite field partial multiplications of the object to be hashed by the hashing constant, utilizing K logic and combinatorial circuits all of which operate in parallel to completely evaluate the number in N/K operations.

Another feature of the present invention is that the hashing constant loaded into the system may be changed at will with a resultant changing of the hashing characteristics to suit a particular class of objects to …

Using Supercomputers Today And Tomorrow, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

An Efficient Parallel Solution For Euclidean Shortest Paths In Three Dimensions, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.

A Practical Application To Data Consistency Validation Using Finite State Automata, Michael Lee Richardson

Masters Theses

The data which are input to a complex information system must often be verified for both syntactic and semantic consistency. The syntactic consistency can be enforced in a straightforward manner during the data entry process. The semantic inconsistencies can be more difficult to discover. A general approach, using finite state automata, is demonstrated here as applied to enforce consistency on client questionnaire responses in a large information system. This approach is developed using those software engineering standards are outlined and justified in this research. A discussion of semantic inconsistencies which require more sophisticated techniques is included.