Digital Commons Network^™

A Statically-Typed Language With Classes, Mike Beaven, Ryan Stanisfer, Dan Wetklow

Department of Computer Science Technical Reports

No abstract provided.

The Cops Security Checker System, Daniel Farmer, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Maximum Size Of A Dynamic Data Structure: Hashing With Lazy Delection Revisited, David Aldous, Micha Hofri, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

A New Organization Of Sparse Gauss Elimination For Solving Pdes, Mo Mu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Load Redistribution On Hypercubes In The Presence Of Faults, Sanjay Ranka, Jhy-Chun Wang

Electrical Engineering and Computer Science - Technical Reports

In this paper, we present load redistribution algorithms for hypercubes in the presence of faults. Our algorithms complete in low-order polynomial of the number of faulty nodes and exhibit excellent experimental performance. These algorithms are topology independent and can be applied to a wide variety of networks.

A Logic For Natural Language, William C. Purdy

Electrical Engineering and Computer Science - Technical Reports

This paper describes a language called £N whose structure mirrors that of natural language. £N is characterized by absence of variables and individual constants. Singular predicates assume the role of both individual constants and free variables. The role of bound variables is played by predicate functors called "selection operators." Like natural languages, £N is implicitly many-sorted. £N does not have an identity relation. Its expressive power lies between the predicate calculus without identity and the predicate calculus with identity. The loss in expressiveness relative to the predicate calculus with identity however is not significant. Deduction in £N is intended to …

An Artificial Neural Approach To The Decomposition Problem, Chandrashekar L. Masti

Electrical & Computer Engineering Theses & Dissertations

The goal of this thesis is to develop an artificial neural approach toward addressing the intractability involved with the decomposition problem. The search for the lattice of substitution property (s. p.) partitions essential to decompositions is cast into the framework of constraint satisfaction. An artificial neural network is developed to provide solutions by performing optimization of a mathematically derived objective function over the problem space. The issue of transitivity is verified to belong to a class of problems beyond the scope of solvability for conventional quadratic-order constraint satisfaction neural networks. A theorem is stated and proved establishing that third-order correlations …

Visual Speech Training Aid For The Deaf, Subhashri Venkat

Electrical & Computer Engineering Theses & Dissertations

A computer-based vowel articulation training aid has been developed. A "continuous" acoustic-phonetic transformation is performed to map speech parameters to a lower dimensionality display space. There are two possible approaches to this transformation problem. The transformation could be either linear or a combination nonlinear/linear. The nonlinear transformation is performed using a multi-layered feedforward neural network with linear output layers. Speech parameters are extracted either from an analog filter bank arrangement (band energies) or by a digital signal processing procedure (Discrete Cosine Transform Coefficients). The speech parameters obtained from both methods correspond to the spectral envelope of the speech signals. The …

Encoding Phonetic Knowledge For Use In Hidden Markov Models Of Speech Recognition, Danming Qian

Electrical & Computer Engineering Theses & Dissertations

Hidden Markov models (HMM's) have achieved considerable success for isolated-word speaker-independent automatic speech recognition. However, the performance of an HMM algorithm is limited by its inability to discriminate between similar sounding words. The problem arises because all differences between speech patterns are treated as equally important. Thus the algorithm is particularly susceptible to confusions caused by phonetically-irrelevant differences. This thesis presents two types of preprocessing schemes as candidates for improving HMM performance. The aim is to maximize the differences between phonologically-distinct speech sounds while minimizing the effect of variations in phonologically-equivalent speech sounds. The preprocessors presented are a discrete cosine …

Techniques For Cubic Algebraic Surfaces I, Thomas W. Sederberg

Faculty Publications

The tutorial presents some tools for free-form modeling with algebraic surfaces, that is, surfaces that can be defined using an implicit polynomial equation f(x, y, z )=0. Cubic algebraic surfaces (defined by an implicit equation of degree 3) are emphasized. While much of this material applies only to cubic surfaces, some applies to algebraic surfaces of any degree. This area of the tutorial introduces terminology, presents different methods for defining and modeling with cubic surfaces, and examines the power basis representation of algebraic surfaces. Methods of forcing an algebraic surface to interpolate a set of points or a space curve …

Using Celllular Graph Embeddings In Solving All Pairs Shortest Paths Problems, Greg N. Frederickson

Department of Computer Science Technical Reports

No abstract provided.

Convex Decomposition Of Polyhedra And Robustness, Chanderjit Bajaj, Tamal K. Dey

Department of Computer Science Technical Reports

No abstract provided.

Digital Search Trees Again Revisited: The Internal Path Length Perspective, Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

A Simpler Proof Of Ph C Bp[Өp], Kenneth W. Regan, James S. Royer

Electrical Engineering and Computer Science - Technical Reports

We simplify the proof by S. Toda [Tod89] that the polynomial hierarchy PH is contained in BP[ӨP]. Our methods bypass the technical quantifier interchange lemmas in the original proof, and clarify the counting principles on which the result depends. We also show that relative to a random oracle R, PHR is strictly contained in ӨPR.

Typed Token Approach For Database Processing During Network Partitioning, Bharat Bhargava, Shy-Renn Lian

Department of Computer Science Technical Reports

No abstract provided.

The Shilp Solid Modeling And Display Toolkit A User's Manual, Vinod Anupam, Chanderjit Bajaj, Steven Klinkner

Department of Computer Science Technical Reports

No abstract provided.

A Data Structure For Analyzing Collisions Of Moving Objects, George Vanecek

Department of Computer Science Technical Reports

No abstract provided.

Computer Viruses--A Form Of Artificial Life?, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Taxonomic Reasoning And Lexical Semantics, William C. Purdy

Electrical Engineering and Computer Science - Technical Reports

Taxonomic reasoning is used in many applications, including many-sorted logic, knowledge bases, document retrieval, and natural language processing. These various applications have been dealt with independently. Because they have so much in common, a general approach to taxonomic reasoning would seem to be justified. This paper presents a theory of lexical semantics as an example of such a general approach. The theory defines a representation and an algebra for that representation. The operations of the algebra are inherently parallel, making them well matched to the capabilities of modern computer systems.

Sql/Ds, Ingres And Indexes: A Comparative Study Of The Use Of Indexes In Two Database Systems, Karen L. Bourn

Masters Theses

Many people in data processing desire to know more about the performance of relational databases. Little information about performance exists in the product or public literature. The purpose of this study is to compare one aspect of the performance of relational databases. The aspect explored is the indexing of tables in a relational database. This paper compares the use of indexing in two relational databases, SQL/DS (Ver. 2, Rel. 1) and INGRES (Rel. 5.0/0.6). Queries were created and executed on tables in both databases, first without an index and then with several different indexes.

The findings in this study show …

Development Of A Neural Net Model For The Assignment Problem, Philip Paul Moss

Masters Theses

This thesis traces the development of a neural net model which will solve the assignment problem. In addition, the neural net model was compared for optimal performance with four other algorithms: two greedy methods and two well-known solutions, Vogel's Approximation Method (VAM) and the Hungarian method. Assignments were made to randomly generated problems using each method and the results were compared.

The findings from this testing indicated that: (a) the assignments selected by the neural net model were closer to optimal than the two greedy methods and VAM, and (b) the assignments selected by the neural net were not optimal. …

Taxonomies Of Model-Theoretically Defined Topological Properties, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

A topological classification scheme consists of two ingredients: (1) an abstract class K of topological spaces; and (2) a "taxonomy", i.e. a list of first order sentences, together with a way of assigning an abstract class of spaces to each sentence of the list so that logically equivalent sentences are assigned the same class.K, is then endowed with an equivalence relation, two spaces belonging to the same equivalence class if and only if they lie in the same classes prescribed by the taxonomy. A space X in K is characterized within the classification scheme if whenever Y _{E …}

Modcad: A Graphic Predetermined Time Standards Software For The Ibm P.C., Raad A. Dawood

Masters Theses

MODCAD is a software program designed to give MODAPTS (MODular Arrangement of Predetermined Time Standards) the capability to generate workplace layouts that can be used in conjunction with the time study analysis. Software packages have been developed for MODAPTS such as MODAPTS Plus and Task Master that allow the user to input the predetermined codes of MODAPTS.

AutoCAD (a computer aided design software) is used to combine MODAPTS codes and workplace layout drawings in a single environment by customizing the standard AutoCAD menus and icons to include the MODAPTS codes and routines. AutoLisp (AutoCAD resident language) is used to write …

Super Linear Learning In Back Propagation Neural Nets, Barry L. Kalman

All Computer Science and Engineering Research

The important feature of this work is the combination of minimizing a function with desirable properties, using the conjugate gradient method (cgm). The method has resulted in significant improvements for both easy and difficult training tasks. Two major problems slow the rate at which large back propagation neural networks (bpnns) can be taught. First is the linear convergence of gradient descent used by modified steepest descent method (msdm). Second is the abundance of saddle points which occur because of the minimization of the sum of squared errors. This work offers a solution to both difficulties. The cgm which is super …

Parallel Implementation Of A Recursive Least Squares Neural Network Training Method On The Intel Ipsc/2, James Edward Steck, Bruce M. Mcmillin, K. Krishnamurthy, M. Reza Ashouri, Gary G. Leininger

Computer Science Faculty Research & Creative Works

An algorithm based on the Marquardt-Levenberg least-square optimization method has been shown by S. Kollias and D. Anastassiou (IEEE Trans. on Circuits Syst. vol.36, no.8, p.1092-101, Aug. 1989) to be a much more efficient training method than gradient descent, when applied to some small feedforward neural networks. Yet, for many applications, the increase in computational complexity of the method outweighs any gain in learning rate obtained over current training methods. However, the least-squares method can be more efficiently implemented on parallel architectures than standard methods. This is demonstrated by comparing computation times and learning rates for the least-squares method implemented …

Cascading Of Arithematic Coding Method With The Lzw Algorithm, Venkat R. Maram, Nageshwar R. Kadakuntla

Theses

Two known compression algorithms appropriate for communication are the LZW algorithm and the Arithmetic Coding method. Both algorithms are adaptive and require no extra communication from the encoder to the decoder. We present a scheme to cascade these algorithms into an adaptive algorithm which achieves higher compression ratio and is appropriate for communication.

A Lower Bound On Embedding Large Hypercubes Into Small Hypercubes, Ajay K. Gupta, Alfred J. Boals, Naveed A. Sherwani, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

Visual Protocol Collection For The Enhancement Of The Radiological Diagnostic Process, Erika Rogers, Ronald C. Arkin, M. Baron, N. Ezquerra, E. Garcia

Computer Science and Software Engineering

This paper describes the Observation Phase of a research project that is designed to explore the nature of visual radiological diagnosis. It is concerned with the collection and analysis of visual protocol data in an effort to determine the salient image features that may impact on the different stages of the diagnostic process, both perceptual and cognitive. These features, once identified, will lead to the formulation of image enhancement hypotheses and the development of knowledge-based visualization techniques to assist the radiological diagnostic process.

Towards Stability Criteria For Multidimensional Distributed Systems: Buffered Aloha Case, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Communication And Control In Spmd Parallel Numerical Computations, Dan C. Marinescu, John R. Rice, E. A. Vavalis

Department of Computer Science Technical Reports

No abstract provided.