Digital Commons Network^™

Comparison Of Artificial Neural Networks With A Conventional Heuristic Technique For Optimization Problems, Jeffrey S. Gruner

Theses and Dissertations

This research investigates the utility of the Hopfield and Kohonen artificial neural networks to the traveling salesman optimization problem. A third, non-neural-network technique (the Christofides Algorithm - a competitive, bounded-solution operations research technique) is also investigated for comparison to the artificial neural network solutions. An eight and forty-two city distribution are chosen for comparison of the solutions.

Recurrent Neural Networks For Radar Target Identification, Eric T. Kouba

Theses and Dissertations

A real-time recurrent learning algorithm was applied to a five class radar target identification problem. The wideband radar was assumed to measure both kinematic (tracking information expressed as estimated aspect angles) and high range resolution data from a single, isolated aircraft. The aspect angles (azimuth and elevation) of the aircraft relative to the radar were assumed to be constantly chancing. This created temporal sequences of high range resolution radar signatures that changed as the aspect angles changed. These sequences were used as input features to a recurrent neural network for three radar target identification test cases. The first test case …

Software Support Measurement And Estimating For Oracle Database Applications Using Mark Ii Function Points, Steven D. Radnov

Theses and Dissertations

This study investigated the results of measuring software support of Oracle database applications and estimating the effort and schedule required to provide support. Software measurement was accomplished with a variant of the function points metric, called Mark II function points, which is comprised of three weighted parameters, inputs, entities, and outputs. A technique for mapping Mark II function points to Oracle DBMS components was developed, and the size of the software support for each project, per team, was measured by tabulating and weighting the number of inputs, entities, and outputs that are added, changed, and/or deleted. Software support effort was …

An Assessment Of Software Safety As Applied To The Department Of Defense Software Development Process, Peter W. Colan, Robert W. Prouhet

Theses and Dissertations

This research analyzed the relationships between the DOD software development process, system safety requirements, and current structured software safety analysis techniques. The current state of software safety was assessed within the aerospace industry and DOD, and a training program for DOD System Safety Managers was developed. A telephone survey was conducted to gather information on current software safety analysis techniques and methodologies. Personal interviews were conducted with Aeronautical System Center System Safety Managers to gather data on job perception and perceived training needs. The results of the study indicate that the DOD guidance and policy documents needed to implement and …

Formalizing, Validating, And Verifying Real-Time System Requirements With Reacto And Vhdl, Frank C. Young

Theses and Dissertations

We develop a methodology for formalizing, verifying, and validating the requirements specification of real-time systems based on a graphical and formal hierarchical Finite State Machine (FSM) language Reacto. We define a means to quantify time and express real-time constraints in Reacto and a transformation from Reacto to the Very High Speed Integrated Circuit (VHSIC) hardware Description Language (VHDL). Reacto's high level abstractions, graphical nature, and theorem prover produce efficient, accurate, and easily understood specifications. We use VHDL's event driven simulation capability, concurrency, and temporal operators to thoroughly examine temporal dependencies between the state machine transitions, and to increase simulation power …

Etann Hardware Implementation For Radar Emitter Identification, James B. Calvin Jr.

Theses and Dissertations

This study investigated classification of 30 radar emitters with 16 signal features using Intel's 80170NX chip, the Electronically Trainable Analog Neural Network (ETANN). Software tools were developed to characterize the ETANN sigmoidal transfer function for use in a custom simulator, known as Neural Graphics. Neural Graphics operates on a Silicon Graphics workstation. The Intel Neural Network Training System simulators were used in early experiments, but were found to be inefficient in training on data used in this research. Using a modified Neural Graphics simulator, single chip and multi-chip experiments were performed to provide benchmark results prior to performing chip-in-loop training. …

Face Recognition With Neural Networks, Dennis L. Krepp

Theses and Dissertations

This study investigated neural networks for face verification and classification. The research concentrated on developing a neural network based feature extractor and/or classifier to perform authorized user verification in a realistic work environment. Recognition accuracy, system assumptions, training time, and execution time were analyzed to determine the feasibility of a neural network approach. Data was collected using a camcorder and two segmentation schemes: manual segmentation and motion-based, automatic segmentation. Data consisted of over 2000. 32x32 pixel, 8 bit gray scale images of 52 subjects; each subject had two to ten days worth of images collected. Several training and test sets …

Exact Dominance Without Search In Decision Trees, Nilesh L. Jain, Ronald P. Loui

All Computer Science and Engineering Research

In order to improve understanding of how planning and decision analysis relate, we propose a hybrid model containing concepts from both. This model is comparable to [Hartman90], with slightly more detail. Dominance is simple concept in decision theory. In a restricted version of our model, we give conditions under which dominance can be detected without search: that is, it can be used as a pruning strategy to avoid growing large trees. This investigation follows the lead of [Wellman87]. The conditions seem hard to meet, but may nevertheless be useful in forward-chaining situations without focus, such as [Breese87]. It may be …

A Vhdl Interpreter For Model-Based Diagnoses, David R. Griffin

Theses and Dissertations

Model-based reasoning permits diagnostic applications to be written without waiting for someone to become an 'expert' of the system. For model-based diagnostics, there must be a model to reason from. This thesis explores using a VHDL description of the system as that model. A system based around a VHDL interpreter was written specifically for a model-based diagnostic algorithm. Currently, the diagnostic system uses an algorithm by Dries. This algorithm was derived from Scarl's Full Consistency Algorithm. The system was designed to be modular so that different diagnostic techniques could be implemented. It is divided into three parts: a VHDL parser, …

A User Interface To A True 3-D Display Device, Bruce A. Hobbs

Theses and Dissertations

This thesis describes an interactive interface to a true three dimensional, real-dm dynamic graphic display, the TI Omniview™. The system generates true 3-D images of volumetric data and objects. The TI Omniview is a cylindrical volumetric laser display that uses a rotating double-helix translucent disk to fill the display cylinder. Voxels are illuminated on the 2-D surface. The rotational speed of the disk allows the viewer to fuse the 2-D images into a true 3-D image. The interface provides the user with a quick and flexible means of manipulating the image generated, the sub-volume displayed, and the resulting 3-D image. …

Generalization And Parallelization Of Messy Genetic Algorithms And Communication In Parallel Genetic Algorithms, Laurence D. Merkle

Theses and Dissertations

Genetic algorithms (GA) are highly parallelizable, robust semi- optimization algorithms of polynomial complexity. The most commonly implemented GAs are 'simple' GAs (SGAs). Reproduction, crossover, and mutation operate on solution populations. Deceptive and GA-hard problems are provably difficult for simple GAs. Messy GAs (MGA) are designed to overcome these limitations. The MGA is generalized to solve permutation type optimization problems. Its performance is compared to another MGA's, an SGA's, and a permutation SGA's. Against a fully deceptive problem the generalized MGA (GMGA) consistently performs better than the simple GA. Against an NP-complete permutation problem, the GMGA performs better than the other …

Examining A Layered Approach To Function And Design Representation For Reusable Software Components, Paul D. Siebels

Theses and Dissertations

This effort examined ways to improve the effectiveness of reusable software libraries. The main area of investigation was in improving the user interface by finding better ways to present the software components to potential re-users. The first aspect which was considered was finding an effective representation for reusable software components. A set of criteria was developed for evaluating the effectiveness of software representations. The criteria consisted of generality, expressiveness, understandability, consistency, and resolution. The second aspect which was considered was how to present the software component information to the user to facilitate finding the appropriate component for reuse. A representation …

A Model For Determining Task Set Schedulability In The Presence Of System Effects, Rusty O. Baldwin

Theses and Dissertations

This research developed a parameterized model that accounts for system overhead and determines when an Ada runtime environment can no longer successfully execute a given Ada task set and still meet all deadlines. The Ada Compiler Evaluation Capability benchmark was used to characterize an actual runtime environment. Using that data, a generic model of a preemptive, rate monotonic priority based runtime system was developed which accounts for overhead due to clock updates, context switching, task suspension, and synchronization. Validation was based on the Hartstone benchmark. First, the benchmark was executed using, the actual runtime environment. Then, those results were compared …

Spatial Partitioning Of A Battlefield Parallel Discrete-Event Simulation, Kenneth C. Bergman

Theses and Dissertations

This thesis describes a method for spatially partitioning a battlefield into units known as sectors to achieve speedup two ways: through the reduction of each battlefield object's next event search space, and lowering the amount of message-passing required. Each sector is responsible for tracking and controlling access to all objects within its boundaries. A distributed proximity detection algorithm employing boundary-crossing events is used to control player movement between sectors. Each object's state information is replicated in all sectors it has sensor capability for the minimum time required; -this ensures that each object's next event is properly determined based upon interactions …

An Enhanced User Interface For The Saber Wargame, Donald R. Moore

Theses and Dissertations

This thesis is part of an on-going effort by the Air Force Institute of Technology to develop a computer-based, theater-level wargame for the Air Force Wargaming Center at Maxwell AFB, AL. The wargame, Saber, is intended to augment the education the students receive at the Air War College and the Air Command and Staff College in the employment of air and ground power. This thesis documents the integrated design and implementation of the two components of the Saber user interface: the pre-processor and the post-processor. Although previous thesis students designed and implemented substantial portions of the user interface, a fully …

Ada Implementation Of An Object Data Repository, Stephen P. Perucca

Theses and Dissertations

The many benefits of object-oriented software development such as encapsulation and extendibility have inspired numerous models of the object- oriented paradigm. Rumbaugh's Object Modeling Technique (OMT) is an object- oriented model that uses three submodels. The object, dynamic, and functional submodels of the OMT describe the data, behavioral, and processing aspects of a system by using entity-relationship, state-transition, and data flow models. Cross-links relate how the three submodels tie together. Two metamodels (models of models) of the OMT are developed using the OMT methodology and notation. The essential data elements of the OMT are abstracted into a data metamodel, and …

A Synthetic Environment For Satellite Modeling And Satellite Orbital Motion, David L. Pond

Theses and Dissertations

Analysts tasked to study satellites moving in space must often rely on photographs to conduct their analysis. Often these photographs do not adequately represent how satellites move in space, their spatial relationships, or their interaction with other satellites. What analysts need is a three- dimensional synthetic environment that depicts satellites as they actually move and interact in space. This thesis addresses the early development of the Satellite Modeler (SM), a system that allows analysts to study, satellite motion and maneuvering of computer aided design (CAD) models of those satellites in a three-dimensional orbit. The system contains equipment that allows analysts …

A Synthetic Environment Flight Simulator: The Afit Virtual Cockpit, John C. Switzer

Theses and Dissertations

This thesis describes the design and implementation of a part of the Virtual Cockpit: a synthetic environment, distributed network flight simulator. The goal of the project was to prove the concept that this type of flight simulator could fill the gap between high-end, very expensive flight simulators and low-end game quality flight simulators. Discussed are: object-oriented design techniques, multi-processor utilization, the flight dynamics model, synthetic environment technology, the frame-rate vs. realism issue, and the interfaces to a realistic joystick and throttle.

X-Aaarf An X Windows Version Of The Afit Algorithm Animation Research Facility, Charles R. Wright Jr.

Theses and Dissertations

The AFIT Algorithm Animation Research Facility was developed by the Air Force Institute of Technology (AFIT) as a teaching aid for data structures and algorithm design of sequential processes. However, AAARF's unique design makes it particularly suitable for the animation of algorithms running on remote systems. In particular, an extensive set of parallel performance animations has been developed for the Intel iPSC/2 Hypercube for parallel program analysis and performance optimization. The AAARF system was originally developed using the Sun Microsystems' SunView(TM) windowing system. Recent advances in Graphical User Interface (GUI) technology combined with Sun's adoption of the X Window System …

Design Recovery For Software Library Population, Chester A. Wright Jr.

Theses and Dissertations

This thesis research investigated design recovery as a means of populating a reuse library. The targeted library was part of the Automatic Programming Technologies for Avionics Systems (APTAS). APTAS uses a knowledge base of forms, to present questions to a user, and rules, to select the forms to present and choose existing library modules to use in composing a new system. The approach applied the reengineering model developed by Eric Byrne to accomplish planning for the project, expanded the renovation phase of this model to cover the actual design recovery, and applied the expanded model to populating the library. Using …

An Object-Oriented Computer Aided Design Program For Traditional Control Systems Analysis, Wayne E. Bell

Theses and Dissertations

This thesis is a continuation of the ICECAP-PC research project conducted under Prof. Gary B. Lamont at the Air Force Institute of Technology. It is an ongoing development of a public domain Computer Aided Design package for Control Engineering and Digital Signal Processing students, faculty and practitioners with a special emphasis on education. This investigation begins with the software maintenance task of restructuring, debugging, and testing the functional version of ICECAP-PC 9.0. The continuous, traditional portions are then ported to a new object-oriented program structure which is the primary focus of this effort. New interactive graphics capabilities are then added …

A Generic Template Extractor (Gentex) In C For Vlsi Design Verification, Kenneth J. Mcclellan Jr.

Theses and Dissertations

The problem of VLSI design verification through circuit extraction was analyzed. The problems of creating a simple template format, the permutability of pins, maintaining connectivity, and performance were focused on. A generic template extractor (GENTEX) was developed in the C programming language for use as a testbed to find solutions to these problems. Six different extraction algorithms were tested with GENTEX and compared based on performance. EDIF translation programs were used to interface with GENTEX on both the input and output sides. One translation program converted an EDIF representation of a schematic into the template format used by GENTEX. The …

Detection Of Spoofing, Jamming, Or Failure Of A Global Positioning System (Gps), Juan R. Vasquez

Theses and Dissertations

The Air Force has equipped its aircraft with avionic systems such as Global Positioning System (GPS) and Inertial Guidance Systems (INS) capable of providing accurate navigation solutions. The aircrews flying these aircraft require a system that can either survive the hostile environments encountered in combat or notify the aircrew that their performance has been significantly degraded. This research focuses on failure detection and isolation techniques using an extended Kalman filter and generalized likelihood ratios using matched filters. Analysis is conducted using a Kalman filter development package known as the Multimode Simulation for Optimal Filter Evaluation (MSOFE). Both a large order …

An Efficient Over-The-Cell Routing Algorithm For High Performance Circuits, Sivakumar Natarajan

Masters Theses

In this thesis, we present a three-layer and a two-layer over-the-cell (OTC) channel routing algorithm (WILMA3 and WILMA2 respectively) for high speed circuits. This router not only minimizes the channel height by using over-the-cell areas but also achieves the net’s timing requirements.

We have implemented our routers in C on SUN Sparc 1+ workstation and tested it on MCNC benchmarks Primary I and II. Experimental results show that WILMA3 can achieve results which are 72% better (on the average) than the conventional two layer channel router, 61% better than two layer over-the-cell router and 51% better than three layer greedy …

Eztex: A Graphical User Interface System For Latex, Ravi K. Kosaraju

Masters Theses

No abstract provided.

A Computer Simulation Of The Rotary Vacuum Filter Brown Stock Washing System Using Distribution Sampling, Edison G. Yiu

Masters Theses

A probabilistic model was utilized to simulate the brown stock washing system's error due to process variability and measurement noise. Mass balances of the washing system were performed using distribution sampling. This model relies on a nonlinear relationship between displacement and dilution, which permitted the generation of displacement ratio based upon wash liquor ratio. Experimental trials were performed on a pilotscale rotary vacuum single-stage washer. Nonlinear first-order relationship appears to characterize a pilotscale washer adequately. Differences were observed between the means and standard deviations of the measured results compared to the simulation output. Future work is needed to identify the …

Pargal: A Package For Parallel Graph Algorithms, Winston Anand-Kumar

Masters Theses

In this thesis, we have considered three graph problems namely, spanning forest problem, connected component problem and minimum cost spanning forest problem. Standard methods to solve these problems using sequential algorithms by various authors are presented for each problem. Efficient parallel algorithms for these problems have also been presented by various authors; however, most of these solutions demands a need for large number of processors, which immediately increases the cost of the hardware and in most of the cases it seems not very practical.

We present efficient solutions for the three problems on a hypercube parallel computer using p processors. …

On The Difficulty Of Manhattan Channel Routing, Ronald I. Greenberg, Joseph Jaja, Sridhar Krishnamurthy

Computer Science: Faculty Publications and Other Works

We show that channel routing in the Manhattan model remains difficult even when all nets are single-sided. Given a set of n single-sided nets, we consider the problem of determining the minimum number of tracks required to obtain a dogleg-free routing. In addition to showing that the decision version of the problem isNP-complete, we show that there are problems requiring at least d+Omega(sqrt(n)) tracks, where d is the density. This existential lower bound does not follow from any of the known lower bounds in the literature.

On Domains Of Superior Convergence Of The Ssor Method Over The Sor Method For P- Cyclic H-Matrices, Apostolos Hadjidimos, Michael Neumann

Department of Computer Science Technical Reports

No abstract provided.

The Gati Client/Server Animation Toolkit, Changrajit L. Bajaj, Steve Cutchin

Department of Computer Science Technical Reports

No abstract provided.