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.

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

Department of Computer Science Technical Reports

No abstract provided.

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 …

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.

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

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

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.

Consistency And Generalization In Incrementally Trained Connectionist Networks, Tony R. Martinez

Faculty Publications

This paper discusses aspects of consistency and generalization in connectionist networks which learn through incremental training by examples or rules. Differences between training set learning and incremental rule or example learning are presented. Generalization, the ability to output reasonable mappings when presented with novel input patterns, is discussed in light of the above learning methods. In particular, the contrast between humming distance generalization and generalizing by high order combinations of critical variables is overviewed. Examples of detailed rules for an incremental learning model are presented for both consistency and generalization constraints.

A Direct Access Method Using A Neural Network Model, John William Meyer, George Winston Zobrist

Computer Science Technical Reports

One of the concerns in computer science involves optimizing usage of machines to make them more efficient and cost effective. One item of particular concern is the use of secondary storage devices, devices that store data other than in the main memory of the computer to which it is attached. The times for searching for data on these devices consistently proves to be a contributing factor in inefficient computer usage.

One data access method that avoids searching when possible is the hashing method. A function is defined to return the record number of a record based on its key field. …

Input Data Pattern Encoding For Neural Net Algorithms, Hyeoncheol Kim, George Winston Zobrist

Computer Science Technical Reports

First, a brief overview of neural networks and their applications are described, including the BAM (Bidirectional Associative Memory) model.

A bucket-weight-matrix scheme is proposed, which is a data pattern encoding method that is necessary to transform a set of real-world numbers into neural network state numbers without losing the pattern property the set has. The scheme is designed as a neural net so that it can be combined with other data processing neural nets. The net itself can be used as a bucket-sorting net also. This shows that traditional data structure problems can be an area that neural networks may …

Monotone Logic Programming, Howard A. Blair, Allen Brown Jr., V. S. Subrahmanian

Electrical Engineering and Computer Science - Technical Reports

We propose a notion of an abstract logic. Based on this notion, we define abstract logic programs to be sets of sentences of an abstract logic. When these abstract logics possess certain logical properties (some properties considered are compactness, finitariness, and monotone consequence relations) we show how to develop a fixed-point, model-state-theoretic and proof theoretic semantics for such programs. The work of Melvin Fitting on developing a generalized semantics for multivalued logic programming is extended here to arbitrary abstract logics. We present examples to show how our semantics is robust enough to be applicable to various non-classical logics like temporal …

Korean Character Recognition Using Neural Networks, Jinhwan Koh, G. S. Moon, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

We present a neural-network approach for recognizing printed Korean characters. Our approach is based on a variant of the back-propagation algorithm. The results indicate that by transforming the character data into Hough space, we can achieve excellent recognition.

A Lexical Extension Of Montague Semantics, William C. Purdy

Electrical Engineering and Computer Science - Technical Reports

This paper presents a model theory of lexical semantics that is compatible with theories in the Montagovian tradition. Lexical expressions are modeled as subsets or “subspaces” in a “semantic spaces”. A unique representation is defined for subspaces of the semantic space. This unique representation is called the "normal form" of the lexical denotation. A Boolean algebra of normal forms is developed, in which lexical entailment is Boolean inclusion. The presentation in the body of the paper is informal, making use of examples to illustrate the theory and to indicate the range of applicability. Formal definitions and proofs in support of …

Simplifications To "A New Approach To The Covering Radius...”, H. F. Mattson Jr

Electrical Engineering and Computer Science - Technical Reports

We simplify the proofs of four results in [3], restating two of them for greater clarity. The main purpose of this note is to give a brief transparent proof of Theorem 7 of [3], the main upper bound of that paper. The secondary purpose is to give a more direct statement and proof of the integer programming determination of covering radius of [3]. Theorem 7 of [3] follows from a simple result in [2], which we state with the notation (for the linear code A).

Arrays And The Lambda Calculus, Klaus Berkling

Electrical Engineering and Computer Science - Technical Reports

Why do functional languages have more difficulties with arrays than procedural languages? The problems arising in the designing of functional languages with arrays and in their implementations are manifold. They can be classified according to 1) first principles, 2) semantics, 3) pragmatics, and 4) performance. This paper attempts to give an outline of the issues in this area, and their relation to the lambda calculus. The lambda calculus is a formal system and as such seemingly remote from practical applications. However, specific representations and implementations of that system may be utilized to realize arrays such that progress is made towards …

Optical Switching And Routing Architectures For Fiber-Optic Computer Communication Networks, Alok Choudhary, Salim Hariri, Wang Song, Partha Banerjee, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

Optical technology has become a significant part of communication networks. We propose an Optical Interface Message Processor (OPTIMP) that exploits high-bandwidth, parallelism, multi-dimensional capability, and high storage density offered by optics. The most time consuming operations such as switching and routing in communication networks are performed in optical domain in the proposed system. Our design does not suffer from the optical/electrical conversion bottlenecks and can perform switching and routing in the range of Gigabits/s. The proposed design can have significant impact in high-speed communication networks as well as high-speed interconnection networks for parallel computers. The source-destination (S-D) information from a …

Interactive Morphometrics From Three-Dimensional Surface Images, William A. Barrett, Shawn C. Becker

Faculty Publications

Techniques have been developed for extracting three-dimensional (3D) measurements directly and interactively from 3D representations of surface anatomy. In order to obtain 3D measurements the anatomical surface is interrogated directly through the use of morphometric tools. Morphometric tools include points, 3D graphical "probes", and logical sectioning functions which interact with the surface through depth buffer compositing operations. Tools are interactively positioned on or through the surface to measure surface dimensions and partial volumes, or to define intersecting functions which allow surface anatomy to be visualized in the context of surrounding anatomy. Visualization is also enhanced because tools reveal much pertaining …

Building Solid Models From Polygonal Data, George Vanecek

Department of Computer Science Technical Reports

No abstract provided.

The Structure Of Parallel Sparse Matrix Algorithms For Solving Partial Differential Equations On Hypercubes, Mo Mu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A New Design For Distributed Systems: The Remote Memory Model, Douglas E. Comer, James Griffioen

Department of Computer Science Technical Reports

No abstract provided.

Information Systems And The Erosion Of Personal Privacy, Scott D. Sterner

Department of Computer Science Technical Reports

No abstract provided.