Physical Sciences and Mathematics Commons^™

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

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.

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

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.

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.

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/ …

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. …

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 …

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.

An Optimal Parallel Algorithm For The All Nearest -- Neighbor Problem For A Convex Polygon, Michael T. Goodrich

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.

On Multidimensional Arrays Of Processors, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.

A Distributed Shortest Path Algorithm For A Planar Network, Greg N. Frederickson

Department of Computer Science Technical Reports

No abstract provided.

Generalized Unfoldings For Shortest Paths In Euclidean 3-Space, C. Bajaj, T. T. Moh

Department of Computer Science Technical Reports

No abstract provided.

Eliminating Proofs Of Interference-Freedom From Levin-Gries Csp Program Proofs, Thomas P. Murtagh

Department of Computer Science Technical Reports

No abstract provided.

Display Oriented Front End Interfaces, Balachander Krishnamurthy, Francie J. Newbery, Craig E. Wills

Department of Computer Science Technical Reports

No abstract provided.

A Monte Carlo Analysis Of The Mincycle Algorithm For Generating Minimal Perfect Hash Functions, Pao-Po Hou, Thomas J. Sager

Computer Science Technical Reports

In this paper, several minimal perfect hashing function generating methods are examined. One of them, the mincycle method by Sager is evaluated by the Monte Carlo method. The results are represented in graphs and tables.

A Parallel Branch And Bound Algorithm For Integer Linear Programming Models, Rochelle L. Boehning, Billy E. Gillett

Computer Science Technical Reports

A parallel branch and bound algorithm is developed for use with MIMD computers to study the efficiency of parallel processors on general integer linear programming problems. The Haldi and IBM test problems and a System Design model are used in the implementation of the algorithm. Initially the algorithm solves the Haldi and IBM test problems on a single processor computer which simulates a multiple processor computer. The algorithm is then implemented on the Denelcor HEP multiprocessor using two of the IBM problems to compare the results of the simulation to the results using an MIMD computer. Finally the algorithm is …

Predicting Success In High School Computer Programming, John C. Gevedon

Graduate Theses and Dissertations

There are great differences in performance among students taking high school programming courses, and instructors debate over what elements contribute to these differences. Some students develop logical thinking abilities and problem solving techniques, while others fail to develop skills beyond memorization of specific terms and procedures. It is not known whether these differences are causally related to the specific educational environment or student backgrounds. Without more information, the factors that actually contribute to the success of high school students in computer programming courses cannot be accurately determined. It was the purpose of this study then to isolate certain student characteristics …

Development Of An On-Line Computer System For Cyclic Voltammetry Studies, Tai-Lee Leo Huo

Chemistry & Biochemistry Theses & Dissertations

An Apple II Plus microcomputer was interfaced to a PAR 174A Polarographic Analyser, an HP 7O4OA X-Y recorder and a three-electrode system. This on-line computer system was applied to Cyclic Voltammetry (CV) studies. The interfacing involved both hardware and software development. Various hardware components were used to amplify and transmit the analog signal both going into the computer and coming from the computer. Software programs were written for staircase waveform generation, data acquisition, and plotting the voltammograms obtained.

A package was designed for CV experiments to be used by the students in the instrumental analysis laboratory. This package contains several …

Color Display Of Vowel Spectra As A Training Aid For The Deaf, Amir Jalali Jagharghi

Electrical & Computer Engineering Theses & Dissertations

The objective of this research was to develop a transformation for mapping speech parameters to color parameter. This transformation is done in real-time, and the resulting color parameter are continuously displayed on a color monitor. This visual speech display is to be used as a speech articulation training aid for the deaf. The conversion of speech acoustic signals into speech parameter was accomplished using special -purpose electronics. The real-time conversion of speech parameter to display parameter was controlled by an 8086/8088 microprocessor operating in an S-100 bus structure. The coefficients of the Karhunen-Loeve series expansion of speech power spectra were …

Analog Computer Simulation With Automatic Scaling By Digital Computer, Mark Anthony Motter

Electrical & Computer Engineering Theses & Dissertations

A computer-aided design approach for the simplification of analog computer simulation is presented. The simulation configuration consists of an EAI 2000 analog computer with serial communications link to a PDP — 11/24 digital computer. Under control of the PDP-11, the analog simulations are realized with appropriate time and magnitude scaling which adjusts the range of the simulation coefficients and prevents overloads of the analog components. The analog computer hardware configuration accommodates both stable plants up to eighth order and closed-loop systems up to tenth order. Cascade compensation is provided for the closed-loop systems.

The plant may be described by either …

The Algebraic Complexity Of Shortest Paths In Polyhedral Spaces, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.