Digital Commons Network^™

Management Of Simnet And Dis Entities In Synthetic Environments, Steven M. Sheasby

Theses and Dissertations

This thesis describes the techniques used to create an object manager utilized by an application program during a distributed interactive simulation. This work is currently utilized by a number of AFIT synthetic environment applications for use during a SIMNET exercise. An extensive review of distributed interactive simulations is presented. A discussion of the current distributed simulation protocol, SIMNET, is presented along with the future protocol standard, DIS. Finally, a brief discussion on dead reckoning and its importance during an exercise is presented. An analysis of the SIMNET and DIS protocols provided the basis for the creation of a series of …

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.

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 …

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 …

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 …

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 …

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.

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 …

Automated Logistics Information Systems: A Case Study, James E. Hogue

Theses and Dissertations

A change within the Air Force has shifted management responsibilities within the logistics community. Formerly diverse functions have come under the purview of a single manager-the Logistics Group Commander-who has inherited information systems that may riot be able to provide consolidated information for informed and accurate decision making. The purpose of this thesis was to describe the current and potential ability for three logistics information management systems to share data: Standard Base Supply System, Consolidated Aircraft Management System, and On-Line Vehicle Information Management System. A systems model was synthesized from the literature review to determine what components of a system …

Integrated Diagnostic Expert System Model (Idesm): A Model For The Conversion Of Fault Isolation Procedures Into An Integrated Diagnostic Expert System, Robert J. Lacey, Glen D. Steemson

Theses and Dissertations

The purpose of this research was to develop a model to convert existing hardcopy maintenance manual fault isolation procedures into electronic format and to partially automate the fault isolation process. A comprehensive model was developed which comprised four major components: user interface, expert system submodel, hypermedia submodel, and a submodel integration shell. Using this model, the F 15E nose landing gear fault isolation procedures were transformed into a rule based expert system. An existing hypermedia information base was expanded and subsequently integrated with the expert system to form the prototype application. The prototype was evaluated by engineering and maintenance personnel …

An Improved Characterization Of 1-Step Recoverable Embeddings: Rings In Hypercubes, Junlin Liu, Thomas J. Sager, Bruce M. Mcmillin

Computer Science Technical Reports

An embedding is said to be 1-step recoverable if any single fault in the embedding can be recovered in one reconfiguration step. In this paper we present a heuristic approach to construct such 1-step recoverable embeddings. We show that to embed a k (even) length ring in ad-cube, where 6 < = k < = 3/4 2d and d < = 3, our scheme will guarantee finding a 1-step recoverable embedding, provided such an embedding exists. Compared to other previously proposed schemes, our scheme achieves much better results. A sufficient condition for the non-existence of 1-step recoverable embeddings for embedding rings of length > 3/4 2d in d-cubes is also given.

On The Exact P-Cyclic Ssor Convergence Domains, Apostolos Hadjidimos, D. Noutsos, M. Tzoumas

Department of Computer Science Technical Reports

No abstract provided.

Si: A Lightweight-Process Interaction Simulation System, Janche Sang, Ke-Hsiung Chung, Vernon Rego

Department of Computer Science Technical Reports

No abstract provided.

Efficient Algorithms For Joint Density Approximations Of Discrete Independent Random Variables, Janche Sang, Vernon Rago, John Spragius

Department of Computer Science Technical Reports

No abstract provided.

Compiling Ace For Distributed-Memory Machines, Jun Song

Dissertations and Theses

Distributed-memory machines offer a very high level of performance, flexibility and scalability. But the memory organization of this kind of machine determines that processes on different processors must communicate explicitly by sending and receiving messages. As a result, the programmer faces the enormously difficult task of detailed planning of algorithm-irrelevant, low-level communication issues. This level of programming resembles writing assembly programs for a sequential machine.

ACE is a message-passing language with abstract communication statements. It was defined by Dr. Jingke Li at Portland State University. The communication in ACE is still explicit, but it is abstracted to a higher level. …

The Programmers' Playground: I/O Abstraction For Heterogeneous Distributed Systems, Kenneth J. Goldman, Michael D. Anderson

All Computer Science and Engineering Research

A new high-level approach to interprocess communication in heterogeneous distributed systems in introduced, This approach, called I/O Abstraction, allows one to write each functional component of a distributed system as an encapsulated program that acts upon a set of local data structures, some of which may be published for external use. The functional components are separately configured by establishing logical connections among the published data structures. In order to illustrate this approach, we describe the The Programmers' Playground, a high-level language "veneer" and protocol designed to support I/O abstraction in heterogeneous computing environment. Support for communication among programs written in …

Character Recognition Using String Matching, Xiaozhi Ye

Theses

To handle noisy and distorted pattern is the use of similarity or distance measures. A similarity or distance measure can be defined between a representation of an unknown pattern and a representation of a prototype pattern. Recognition of the unknown pattern can be carried out on the basis of the maximum-similarity or minimum distance criterion (Bunke 1990) This approach is proposed to recognize the noisy or distorted character image. In this work, a directly string representation of the pattern ( prototype as well as unknown input) using the histogram method, a decision procedure for classification is the well known Levenshtein …

Domain Analysis Within The Gensif Framework, Heiko Thimm

Theses

The GenSIF framework which is targeted towards very large, distributed, and complex software systems recently has been proposed to accomplish a form of systems engineering and systems development in which the issue of systems integration is considered from the beginning on.

One of the components of GenSIF is domain analysis. Domain analysis leads to the design of a domain model. The specific needs GenSIF has in that area were investigated with an emphasis on domain modeling. Main points addressed in that investigation were the issue regarding the relevant information for the domain modeling process and the required type of domain …

Fault-Tolerant Distributed Deadlock Detection / Resolution, Pei-Yu Liu, Bruce M. Mcmillin

Computer Science Technical Reports

The problem of deadlock detection in a distributed system has been extensively studied in the past few years. Many algorithms on distributed deadlock detection have been proposed under the assumption that the processors and communication in the system are fault-free. However, in an unreliable distributed system, faulty processors may prevent a deadlock detection algorithm from properly detecting deadlocks. Few of the algorithms proposed in the literature address the issue of handling process failures in a distributed system. This paper proposes a fault-tolerant distributed deadlock detection algorithm which integrates a priority-based probe algorithm with a PMC-based diagnosis model. This algorithm detects …

Programming Ellpack Examples In Pdeqsol, Yukio Umetani

Department of Computer Science Technical Reports

No abstract provided.

Boolean Set Operations On A Mimd Distributed Memory Machine, Chandrajit L. Bajaj, Tamal K. Dey

Department of Computer Science Technical Reports

No abstract provided.

Modeling Contacts In A Physically Based Simulation, William J. Bouma, George Vanĕček

Department of Computer Science Technical Reports

No abstract provided.

A General Theory Of Optimal P-Cyclic Sor, Apostolos Hadjidimos, Robert J. Plemmons

Department of Computer Science Technical Reports

No abstract provided.

An Analysis Of Data Management Schemes For Distributed Memory Mimd Systems, M. C. Cornea-Hasegan, Dan C. Marinsecu, Zhongyun Zhang

Department of Computer Science Technical Reports

No abstract provided.

Abduction In Annotated Logic Programming, Krishnaprasad Thirunarayan

Kno.e.sis Publications

The author investigates techniques to make the logic programming paradigm more expressive for knowledge representation, while simultaneously retaining the computational advantages of efficiency and simplicity. He extends the annotated language of K. Thirunarayan and K. Kifer (1989) in various directions to obtain an enriched representation language. In particular, rule bodies are permitted to be a conjunction of literals, and the rules to be recursive. A class of annotated logic programs called the stratified programs is identified which can be given a unique supported minimal Herbrand model as their meaning. Abductive reasoning is integrated into this annotated logic framework. The notion …

Adaptive Boundary Detection Using “Live-Wire” Two-Dimensional Dynamic Programming, William A. Barrett, Bryan S. Morse, Eric N. Mortensen, Jayaram Udupa

Faculty Publications

An adaptive boundary detection algorithm that uses two-dimensional dynamic programming is presented. The algorithm is less constrained than previous one-dimensional dynamic programming algorithms and allows the user to interactively determine the mathematically optimal boundary between a user-selected seed point and any other dynamically selected "free” point in the image. Interactive movement of the free point by the cursor causes the boundary to behave like a “live wire” as it adapts to the new minimum cost path between the seed point and the currently selected free point. The algorithm can also be adapted or customized to learn boundary-defining features for a …

Packet Routing In Networks With Long Wires, Ronald I. Greenberg, H.-C. Oh

Computer Science: Faculty Publications and Other Works

In this paper, we examine the packet routing problem for networks with wires of differing length. We consider this problem in a network independent context, in which routing time is expressed in terms of “congestion” and “dilation” measures for a set of packet paths. We give, for any constant ε > 0, a randomized on-line algorithm for routing any set of N packets in O((Clg^ε(Nd)+Dlg(Nd))/lglg(Nd)) time, where C is the maximum congestion and D is the length of the longest path, both taking wire delays into account, and d is the longest path in terms of number of wires. We also …

A Performance Comparison Of Simulation Calendar Algorithms: An Empirical Approach, Kehsiung Chung, Janche Sang, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.

The Management Of Replicated Data, Hsueh-Chi Shih, C. Y. Ho, S. Alptekin

Computer Science Technical Reports

Data replication, which has the benefits of improving system availability and read performance, proved to be indispensable to many database applications. In a replicated database, the one-copy serializability of transaction executions can be ensured by employing a replica control mechanism on top of the traditional concurrency control mechanism. This work contains two replica control algorithms and a read-only transaction processing algorithm. Both replica control algorithms handle multiple site, communication and partitioning failures. The replica control algorithms achieve read operation efficiency by always translating a logical read operation into one local physical read operation and by taking advantage of the locality …

Formal Derivation Of An Error-Detecting Distributed Data Scheduler Using Changeling, Hanan Lutffiya, Bruce M. Mcmillin, Alan Su

Computer Science Technical Reports

Distributed database applications are a wide use of distributed systems. One of the major advantages of distributed database systems is the potential for achieving high availability in the presence of faults. Faults must be handled so that the system still operates or operates in a degraded mode. This paper focuses on being able to detect component errors which can lead to system failures in the scheduling part of the lock manager portion of the distributed database system by using embedded executable assertions. Changeling provides a systematic approach, based on the mathematical model of program verification, to deriving executable assertions that …