Digital Commons Network^™

Weapon System Integration For The Afit Virtual Cockpit, William E. Gerhard Jr.

Theses and Dissertations

The Air Force Institute of Technology is continuing research in the Virtual Cockpit. The Virtual Cockpit makes use of high performance graphics workstations, Virtual Environment technology, and Distributed Interactive Simulation network protocols to create a flight simulator based on the capabilities of the McDonnell Douglas F-15E Strike Eagle. The work presented in this thesis focuses on the design and implementation issues for integrating a weapons delivery capability. Weapons simulated include: RADAR and IR guided air- to-air missiles, gravity and precision guided bombs, and a 20mm cannon. Virtual Environment displays used include: color NTSC and monochrome high resolution helmet mounted displays …

When Will A Genetic Algorithm Outperform Hill-Climbing?, Melanie Mitchell, John H. Holland

Computer Science Faculty Publications and Presentations

In this paper we review some previously published experimental results in which a simple hillclimbing algorithm-Random Mutation Hill-Climbing (RMHC)-significantly outperforms a genetic algorithm on a simple "Royal Road" function. vVe present an analysis of RMHC followed by an analysis of an "idealized" genetic algorithm (IGA) that is in turn significantly faster than RMHC. We isolate the features of the IGA that allow for this speedup, and discuss how these features can be incorporated into a real GA and a fitness landscape, making the GA better approximate the IGA. We use these features to design a modified version of the previously …

Revisiting The Edge Of Chaos: Evolving Cellular Automata To Perform Computations, Melanie Mitchell, Peter T. Hraber, James P. Crutchfield

Computer Science Faculty Publications and Presentations

No abstract provided.

X.500 Directory Service Support For Electronic Mail, Mihai G. Sirbu

Masters Theses

"One of the difficult problems on the Internet is finding the electronic mail addresses of users. In practice, there are some indirect ways of finding these addresses such as the finger program in UNIX, but almost all of these methods require the user to know the exact host name of the destination. What is most desirable is an automated mechanism which provides the e-mail addresses of users if some minimal information about the destination site is known.

This thesis describes the design of such a directory service support system, based on the X.500 Series of CCITT Recommendation, for the elm …

Genetic Algorithms With 3-Parent Crossover, L. Vincent Edmondson

Doctoral Dissertations

"A new genetic algorithm which uses a 3-parent uniform crossover operator is developed and analyzed. Uniform crossover operators are shown to be based on the premise that all bit-level genetic information should be passed from parents to children. The 3-parent uniform crossover operator is shown to adhere to this premise. The 3-parent uniform crossover operator is shown to be better than the 2-parent uniform crossover operator on the De Jong test functions.

Two new genetic algorithms which use 3-parent traditional crossover operators are developed and analyzed. The first uses a strategy of randomly selecting 3 of the 6 children resulting …

Practical Prefetching Techniques For Multiprocessor File Systems, David Kotz, Carla Schlatter Ellis

Dartmouth Scholarship

Improvements in the processing speed of multiprocessors are outpacing improvements in the speed of disk hardware. Parallel disk I/O subsystems have been proposed as one way to close the gap between processor and disk speeds. In a previous paper we showed that prefetching and caching have the potential to deliver the performance benefits of parallel file systems to parallel applications. In this paper we describe experiments with practical prefetching policies that base decisions only on on-line reference history, and that can be implemented efficiently. We also test the ability of these policies across a range of architectural parameters.

An Application-Oriented Approach To Distributed Error-Detecting Branch & Bound, Aggie Y. Sun, Hanan Lutfiyya, Bruce Mcmillin

Computer Science Technical Reports

An important aspect which is often overlooked in software _design of distributed environments is that of fault tolerance. Many methodologies in the past have attempted to provide fault tolerance efficiently, but have never been successful at eliminating explicit time and space redundancy. One approach is the Application-Oriented Fault Tolerance Paradigm, which provides fault tolerance by examining the behavior and properties of the application and deriving executable assertions for the detection of faults. Previous work has demonstrated the feasibility of the application-oriented fault tolerance paradigm for various applications. However, the executable assertions were guided by the natural constraints of the problem. …

Performance Of Iterative Methods For Distributed Memory Processors, Dan C. Marintescu, John R. Rice, E. Vavallis

Department of Computer Science Technical Reports

No abstract provided.

Improved Global Routing Using ⋋-Geometry, Surendra Burman

Masters Theses

No abstract provided.

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 …

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

Masters Theses

No abstract provided.

Efficient Derivation And Approximations Of Cepstral Coefficients For Speech Coding, Kimberly A. Limcangco

Theses and Dissertations

A new formulation is presented for the calculation of cepstral coefficients directly from measured sine wave amplitudes and frequencies of speech waveforms. Approximations to these cepstral coefficients are shown to be suitable for operation in a real-time speech coding environment. These results were encoded in the C programming language and then evaluated through experiments that were conducted on the McAulay-Quatieri Sinusoidal Transform Coder (STC).

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 …

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

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

Department of Computer Science Technical Reports

No abstract provided.

Distributed Design Of Hip Protheses With Bhautik, Chandrajit L. Bajaj, Daniel R. Schikore

Department of Computer Science Technical Reports

No abstract provided.

A Case Tool For Conceptual Database Design, Keng Siau, Kok Phuang Tan, Hock Chuan Chan

Research Collection School Of Computing and Information Systems

The paper describes a Computer Aided Software Engineering (CASE) tool to support conceptual database modelling. One popular approach for conceptual database modelling is use of the Entity-Relationship (ER) model. The paper proposes the use of an Enhanced Entity-Relationship (EER) model for conceptual database modelling. This Enhanced Entity-Relationship model extends the Entity-Relationship model by incorporating the generalization/specialization, aggregation and categorization abstractions. The CASE tool, which is based on the Enhanced Entity-Relationship model, is known as the Enhanced Entity-Relationship Diagrammer (EERD). In addition, the CASE tool supports direct visual query and update based on the EERM.

An Object Based Approach Towards The Automation Of Office Procedures Using Intelligent Messages, Robert L. Palumbo

Student Work

Office support systems are used to automate routine office tasks. Since office tasks often require the cooperation of several office workers who may be physically dispersed, it is important to develop advanced communication systems that better facilitate collaborative and cooperative office work among office workers.

In this thesis, we propose an approach to the construction of advanced communication systems in which messages are represented as objects that are “intelligent” and “active” and can therefore perform certain activities (such as interacting with various entities to collect data) and decisions (such as dynamically deciding which user to go to next) on their …

Solution To A Multicriteria Aircraft Routing Problem Utilizing Parallel Search Techniques, James J. Grimm Iii

Theses and Dissertations

Pilots select routes based on factors such as threats, fuel, time on target, distance, and refueling points. This is a time consuming task. This thesis presents the software engineering synthesis of a software tool, based on a parallelized A* search algorithm, to select routes. For simplicity only threats and distance are used. A centralized open list is used with one processor managing the list while the other processors perform the node expansions. This decomposition result in a dynamically load balanced system. A number of parameters are changed to study their impact on the execution time. The use of a branch …

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 …

Object-Oriented Analysis, Design, And Implementation Of The Saber Wargame, David S. Douglass

Theses and Dissertations

Saber is a two-sided, air and land war game that simulates decisions made of commanders at the theater-level. It is being developed by the Air Force Institute of Technology for the Air Force Wargaming center at Maxwell AFB, Alabama. Saber models conventional, chemical, and nuclear warfare between aggregated air and land forces. It also portrays the effects of logistics, satellites, weather, terrain, and intelligence which add to the realism of the Saber war game. The Saber war game has three main components, the preprocessor. which is responsible for scenario development and pregame activities, the simulation. the guts of the war …

An Investigation Of Discovery-Based Learning In The Route Planning Domain, Freeman A. Kilpatrick Jr.

Theses and Dissertations

This thesis presents MAVERICK, a Discovery-Based learning (DBL) system designed to learn maneuvers in the route planning domain. DBL was originally designed to learn in domains for which little domain knowledge exists. This thesis proposes using it in domains for which knowledge exists, but the acquisition of this knowledge is difficult or time-consuming because of the knowledge acquisition bottleneck. The operation of the DBL process in MAVERICK was investigated to determine the potential utility of such a system to a real- world Air Force problem in the domain of aircraft route planning. MAVERICK worked well in its limited domain, and …

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 …

An Intelligent Real-Time System Architecture Implemented In Ada, Michael A. Whelan

Theses and Dissertations

Conventional real-time systems are fully deterministic allowing for off-line, optimal, task scheduling under all circumstances. Real-time intelligent systems add non-deterministic task execution times and non- deterministic task sets for scheduling purposes. Non-deterministic task sets force intelligent real-time systems to trade-off execution time with solution quality during run-time and perform dynamic task scheduling. Four basic design considerations addressing those tradeoffs have been identified: control reasoning, focus of attention, parallelism, and algorithm efficacy. Non-real- time intelligent systems contain an environment sensor, a model of the environment, a reasoning process, and a large collection of procedural processes. Real-time intelligent systems add to these …

Creating And Manipulating Formalized Software Architectures To Support A Domain-Oriented Application Composition System, Cynthia G. Anderson

Theses and Dissertations

This research investigated technology which enables sophisticated users to specify, generate, and maintain application software in domain-oriented terms. To realize this new technology, a development environment, called Architect, was designed and implemented. Using canonical formal specifications of domain objects, Architect rapidly composes these specifications into a software application and executes a prototype of that application as a means to demonstrate its correctness before any programming language specific code is generated. Architect depends upon the existence of a formal object base (or domain model) which was investigated by another student in related research. The research described in this thesis relied on …

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 …

Formalization And Transformation Of Informal Analysis Models Into Executive Refine™ Specifications, Mary M. Boom, Bradley D. Mallare

Theses and Dissertations

This research developed and implemented an automated technique for translating informal specifications into formal, executable specifications. A unified Abstract Model (UAM) was developed to combine the information contained in Entity Relationship, State Transition, and Data Flow Models into a concise, object-based representation. The UAM forms the basis for defining a formal language, the Object Modeling Language (OML), used to capture the information contained in the UAM. By using OML, we were able to develop an automated translation process to convert informal specifications into executable, formal specifications. The Software Refinery Development Environment enabled us to easily develop a parser that translates …

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 …