Electrical and Computer Engineering Commons^™

Finding A Maximum-Density Planar Subset Of A Set Of Nets In A Channel, Ronald I. Greenberg, Jau-Der Shih

Computer Science: Faculty Publications and Other Works

We present efficient algorithms to find a maximum-density planar subset of n 2-pin nets in a channel. The simplest approach is to make repeated usage of Supowit's dynamic programming algorithm for finding a maximum-size planar subset, which leads to O(n^3) time to find a maximum-density planar subset. But we also provide an algorithm whose running time is dependent on other problem parameters and is often more efficient. A simple bound on the running time of this algorithm is O(nlgn+n(t+1)w), where t is the number of two-sided nets, and w is the number of nets in the output. Though the worst-case …

Bounds On Constraint Weight Parameters Of Hopfield Networks For Stability Of Optimization Problem Solutions, Gursel Serpen

Electrical & Computer Engineering Theses & Dissertations

The purpose of the presented research is to study the convergence characteristics of Hopfield network dynamics. The relation between constraint weight parameter values and the stability of solutions of constraint satisfaction and optimization problems mapped to Hopfield networks is investigated. A theoretical development relating constraint weight parameter values to solution stability is presented. The dependency of solution stability on constraint weight parameter values is shown employing an abstract optimization problem. A theorem defining bounds on the constraint weight parameter magnitudes for solution stability of constraint satisfaction and optimization problems is proved. Simulation analysis on a set of optimization and constraint …

An Object-Oriented Database Implementation Of The Magic Vlsi Layout Design System, Timothy M. Jacobs

Theses and Dissertations

This thesis attempts to prove that the commercially available Object Store data management system provide the performance and functionality necessary to support a complex engineering design system. This is accomplished by modifying the Magic VLSI circuit layout design system to eliminate its current Unix file data management system and replace it with Object Store. The approach to this research effort includes a design recovery of the Magic system and identification of its ket data management functions. These functions are then modified to take advantage of the database management facilities of Object Store. Additional code is added to instrument performance measurement …

Robotic Tactile Sensors Fabricated From A Monolithic Silicon Integrated Circuit And A Piezoelectric Polyvinylidene Fluoride Thin Film, Craig S. Dyson

Theses and Dissertations

The purpose of this research effort was to design, fabricate, and test a tactile sensor system consisting of an external high impedance switch circuit, an external multiplexing circuit, and a tactile sensor IC. In order to accomplish this objective, a hardware design and selection process was implemented along with a logical test methodology. An external multiplexer circuit samples all of the array elements in 50 ms. The current prototype sensor has linearity spanning loads of 0.8 g to 135 g, a load resolution of 20 g, and a maximum bandwidth of 25 Hz. Using an elementary shape recognition algorithm the …

Face Recognition With The Karhunen-Loeve Transform, Pedro F. Suarez

Theses and Dissertations

The major goal of this research was to investigate machine recognition of faces. The approach taken to achieve this goal was to investigate the use of Karhunen-Loe've Transform (KLT) by implementing flexible and practical code. The KLT utilizes the eigenvectors of the covariance matrix as a basis set. Faces were projected onto the eigenvectors, called eigenfaces, and the resulting projection coefficients were used as features. Face recognition accuracies for the KLT coefficients were superior to Fourier based techniques. Additionally, this thesis demonstrated the image compression and reconstruction capabilities of the KLT. This theses also developed the use of the KLT …

An Investigation Of The Application Of Artificial Neural Networks To Adaptive Optics Imaging Systems, Andrew H. Suzuki

Theses and Dissertations

Recurrent and feedforward artificial neural networks are developed as wavefront reconstructors. The recurrent neural network studied is the Hopfield neural network and the feedforward neural network studied is the single layer perceptron artificial neural network. The recurrent artificial neural network input features are the wavefront sensor slope outputs and neighboring actuator feedback commands. The feedforward artificial neural network input features are just the wavefront sensor slope outputs. Both artificial neural networks use their inputs to calculate deformable mirror actuator commands. The effects of training are examined.

Composite Stock Cutting Through Simulated Annealing, Pipatpong Poshyanonda, Cihan H. Dagli

Computer Science Technical Reports

This paper explores the use of Simulated Annealing as an optimization technique for the problem Composite Material Stock Cutting. The shapes are not constrained to be convex polygons or even regular shapes. However, due to the composite nature of the material, the orientation of the shapes on the stock is restricted. For placements of various shapes, we show how to determine a cost function, annealing parameters, and performance.

Composite Stock Cutting Through Simulated Annealing, Pipatpong Poshyanonda, Cihan H. Dagli

Computer Science Technical Reports

This paper explores the use of Simulated Annealing as an optimization technique for the problem Composite Material Stock Cutting. The shapes are not constrained to be convex polygons or even regular shapes. However, due to the composite nature of the material, the orientation of the shapes on the stock is restricted. For placements of various shapes, we show how to determine a cost function, annealing parameters, and performance.

A Robust Approach To Human-Computer Interface Design Using The Taguchi Method, Billie Mitchell Reed

Engineering Management & Systems Engineering Theses & Dissertations

The application of Dr. Genichi Taguchi's approach for design optimization, called Robust Design, to the design of human-computer interface software is investigated. The Taguchi Method is used to select a near optimum set of interface design alternatives to improve user acceptance of the resulting interface software product with minimum sensitivity to uncontrollable noise caused by human behavioral characteristics.

Design alternatives for interaction with personal micro-computers are identified. Several important and representative alternatives are chosen as design parameters for the Taguchi matrix experiment. A noise field with three human behavioral characteristics as noise factors were chosen as a representative noise array. …

Investigation Of Threaded Code, K. E. Graves, Paul D. Stigall

Computer Science Technical Reports

The design, structure and performance of threaded code are examined through the development of a threaded. code classification system and the modification of the threaded code technique used by a Forth programming language implementation. The classification system distinguishes threaded code designs by three elements: the interpreter, the code structure and the reference method to routines. Threaded code designs from the literature are described using the new classification scheme. The threaded code techniques of variable depth indirect threaded code and token indirect token threaded code are examined in a Forth programming language system on an INMOS IMS T222 transputer. Their design …

Investigation Of Threaded Code, K. E. Graves, Paul D. Stigall

Computer Science Technical Reports

The design, structure and performance of threaded code are examined through the development of a threaded. code classification system and the modification of the threaded code technique used by a Forth programming language implementation. The classification system distinguishes threaded code designs by three elements: the interpreter, the code structure and the reference method to routines. Threaded code designs from the literature are described using the new classification scheme. The threaded code techniques of variable depth indirect threaded code and token indirect token threaded code are examined in a Forth programming language system on an INMOS IMS T222 transputer. Their design …

An Evaluation Of An Ada Implementation Of The Rete Algorithm For Embedded Flight Processors, F. Jesse Fanning

Theses and Dissertations

The purpose of this thesis was to design and develop an expert system shell in Ada, and to evaluate the shell's execution and size performance to determine its suitability for real-time operation on the MIL-STD-1750A embedded flight processor. The expert system shell uses the CLIPS/Ada inference engine, a forward-chaining Ada implementation of Rete. The expert system shell design is presented along with an overview of the target environment--the MIL-STD-1750A VHSIC Avionic Modular Processor (VAMP) running under the Ada Avionics Real-Time Software (AARTS) Operating System. Theoretical and empirical complexity analyses of the inference engine are presented and discussed in view of …

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 …

Efficient Interconnection Schemes For Vlsi And Parallel Computation, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

This thesis is primarily concerned with two problems of interconnecting components in VLSI technologies. In the first case, the goal is to construct efficient interconnection networks for general-purpose parallel computers. The second problem is a more specialized problem in the design of VLSI chips, namely multilayer channel routing. In addition, a final part of this thesis provides lower bounds on the area required for VLSI implementations of finite-state machines. This thesis shows that networks based on Leiserson's fat-tree architecture are nearly as good as any network built in a comparable amount of physical space. It shows that these "universal" networks …

Performance Modeling And Enhancement For The Atamm Data Flow Architecture, Sukhamoy Som

Electrical & Computer Engineering Theses & Dissertations

Algorithm To Architecture Mapping Model (ATAMM) is a new marked graph model from which the rules for data and control flow in a homogeneous, multicomputer, data flow architecture may be defined. This research is concerned with performance modeling and performance enhancement for periodic execution of large-grain, decision-free algorithms in such an ATAMM defined architecture. Performance measures and bounds are established. Algorithm transformation techniques are identified for performance enhancement and reduction of computing element requirements. Operating strategies are developed for optimum time performance and for sub-optimum time performance under limited availability of computing elements. An ATAMM simulator is used to test …

Efficient Multi-Layer Channel Routing, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

No abstract provided.

Randomized Routing On Fat-Trees, Ronald I. Greenberg, Charles E. Leiserson

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 + lg n lg lg n) with probability 1-O(1/n). The best previous …

Lower Bounds On The Area Of Finite-State Machines, M. J. Foster, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

There are certain straightforward algorithms for laying out finite-state machines. This paper shows that these algorithm are optimal in the worst case for machines with fixed alphabets. That is, for any s and k, there is a deterministic finite-state machine with s states and k symbols such that any layout algorithm requires Ω(ks log s) area to lay out its realization. Similarly, any layout algorithm requires Ω(ks^2) area in the worst case for nondeterministic finite-state machines with s states and k symbols.

Mulch: A Multi-Layer Channel Router Using One, Two, And Three Layer Partitions, Ronald I. Greenberg, Alex T. Ishii, Alberto L. Sangiovanni-Vincentelli

Computer Science: Faculty Publications and Other Works

Chameleon, a channel router for three layers of interconnect, has been implemented to accept specification of an arbitrary number of layers. Chameleon is based on a strategy of decomposing the multilayer problem into two- and three-layer problems in which one of the layers is reserved primarily for vertical wire runs and the other layer(s) for horizontal runs. In some situations, however, it is advantageous to consider also layers that allow the routing of entire nets, using both horizontal and vertical wires. MulCh is a multilayer channel router that extends the algorithms of Chameleon in this direction. MulCh can route channels …

Implementing Ray Tracing Algorithm In Parallel Environment, Tjah Jadi

Dissertations and Theses

Ray tracing is a very popular rendering algorithm in the field of computer graphics because it can generate highly-realistic images from three-dimensional models. Unfortunately, the computational cost is very expensive. To speed up the rendering process we present both static and dynamic scheduling (balancing) strategies for a multiprocessor system. Hence, the load balancing among the processors is the most important problem in parallel processing. The implementation of the algorithm is based on a modified octree structure.

Model Of Hot-Film Sensor With Substrate Effects, David Mcalpine Judge

Electrical & Computer Engineering Theses & Dissertations

A detailed mathematical model is constructed to investigate the frequency response of a hot-film anemometer system. Since several diverse factors affect the frequency response, the analysis is broken down into three main parts. Each part is a detailed mathematical model. The first model consists of the ordinary differential equations which govern the electronics of the feedback system and heat transfer of the sensor. An important simplification in this model is that the rate of heat conduction from the sensor to its substrate is constant.

In the second model the unsteady state heat transfer properties of the substrate are examined by …

Wind Streamline Ambiguity Removal Of Microwave Scatterometer Data, Hans W. Zaepfel

Electrical & Computer Engineering Theses & Dissertations

There is a class of satellite microwave scatterometers that return oceanographic information which includes wind vectors with directional ambiguity. The first part of the ambiguity removal process is to reduce the data to a directional ambiguity of 180°. This thesis shows that wind direction change contains the information required for streamline ambiguity removal and that syntactic pattern recognition techniques can be used to locate the areas of wind direction change. Spreading the information along the areas of wind direction change results in the removal of the streamline ambiguity. The algorithm is implemented and the results are presented showing that it …

An Exact Analysis For Efficient Computation Of Random-Pattern Testability In Combinational Circuits, Sharad C. Seth, Bhargab B. Bhattacharya, Vishwani Agrawal

School of Computing: Conference and Workshop Papers

Experimental evidence shows that low testability in a typical circuit is much more likely due to poor observability than poor controllability. Thus, from theoretical and practical standpoints, it is important to develop an accurate model for observability computation. One such model, in terms of supergates, is proposed in the first part of this paper thus complimenting our earlier work. It is now possible to obtain exact random-pattern testability for each line in a circuit.

The second part of the paper analyzes the supegate structure of a circuit from a graph theoretic viewpoint. Finding a supergate is related to determining the …

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 …

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 …

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

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 …