Digital Commons Network^™

Response Surface Methodology: An Analytical Method For Locating Migrated Contaminant Sources, Orlando J. Dona Jr.

Theses and Dissertations

The use and storage of hazardous chemicals at U.S. military facilities often adversely affect the groundwater when contaminants infiltrate the subsurface as a result of leaks and accidental spills. These contaminants, if not located and remediated in a relatively short time, may move and settle unpredictably, essentially creating a source some distance from the original leak or spill. An example of this phenomenon is found with migrating dense nonaqueous phase liquid (DNAPL) contaminants. Although various methods for estimating the present day locations of these migrated contaminants are in use, accurately pinpointing the source of contaminants remains a difficult problem in …

Minimizing The Number Of Optical Amplifiers Needed To Support A Multi-Wavelength Optical Lan/Man, Byrav Ramamurthy, Jason Iness, Biswanath Mukherjee

School of Computing: Conference and Workshop Papers

Optical networks based on passive star couplers and employing wavelength-division multiplexing (WDhf) have been proposed for deployment in local and metropolitan areas. Amplifiers are required in such networks to compensate for the power losses due to splitting and attenuation. However, an optical amplifier has constraints on the maximum gain and the maximum output power it can supply; thus optical amplifier placement becomes a challenging problem. The general problem of minimizing the total amplifier count, subject to the device constraints, is a mixed-integer non-linear problem. Previous studies have attacked the amplifier placement problem by adding the “artificial” constraint that all wavelengths, …

Physical Media Independence: System Support For Dynamically Available Network Interfaces, Jon Inouye, Jim Binkley, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Advances in hardware technology has fueled the proliferation of dynamically configurable network interface cards. This empowers mobile laptop users to select the most appropriate interface for their current environment. Unfortunately, the majority of system software remains "customized" for a particular network configuration, and assumes many network characteristics remain invariant over the runtime of the software. Physical Media Independence (PMI) is the concept of making assumptions about a particular device explicit, detecting events which invalidate these assumptions, and recovering once events are detected. This paper presents a model supporting PMI. Based on device availablilty, the model identifies implicit device-related assumptions made …

Randomised Shuffle And Applied Misinformation: An Enhanced Model For Contact-Based Smart-Card Serial Data Transfer, Michael Collins

Theses: Doctorates and Masters

Contact-based smart-cards, which comply to the International Standard IS0-7816, communicate with their associated read/write machines via a single bi-directional serial link. This link is easy to monitor with inexpensive equipment and resources, enabling captured data to be removed for later examination. In many contact-based smart-cards the logical abilities are provided by eight-bit microcontroller units (MCU) which are slow at performing effective cryptographic functions. Consequently, for expediency, much data may be transferred in plain-text across the vulnerable communications link, further easing an eavesdropper's task. Practitioners in military communications protect transmitted information by varying a link's carrier frequency in an apparently random …

Student Modeling In An Intelligent Tutoring System, Jeremy E. Thompson

Theses and Dissertations

This thesis explores a new approach to modeling the student in an intelligent tutoring system (ITS), by providing a student model which learns new solutions from the student. A prototype of the new approach to ITS is demonstrated in the Euclidean geometry domain. Complete C++, CLIPS, and Tcl/Tk code listings are included in the appendices for reference. Adaptable multiple software agents were targeted for implementation, based on current literature. However, the student model is found to be maintainable without multiple software agents, while still allowing for tracking several possible solution paths when monitoring student solutions. This capability contradicts previous research …

Speaker Recognition By Hidden Markov Models And Neural Networks, Erik J. Zeek

Theses and Dissertations

As humans, we develop the ability to identify people by their voice at an early age. Getting computers to perform the same task has proven to be an interesting problem. Speaker recognition involves two applications, speaker identification and speaker verification. Both applications are examined in this effort. Two methods are employed to perform speaker recognition. The first is an enhancement of hidden Markov models. Rather than alter some part of the model itself, a single-layer perceptron is added to perform neural post-processing. The second solution is the novel application of an enhanced Feature Space Trajectory Neural Network to speaker recognition. …

An Incremental Language Conversion Method To Convert C++ Into Ada95, Ding-Yuan Sheu

Theses and Dissertations

This thesis develops a methodology to incrementally convert a legacy object oriented C++ application into Ada95. Using the experience of converting a graphic application, called Remote Debriefing Tool (RDT), in the Graphics Lab of the Air Force Institute of Technology (AFIT), this effort defined a process to convert a C++ application into Ada95. The methodology consists of five phases: (1) reorganizing the software application, (2) breaking mutual dependencies, (3) creating package specifications to interface the existing C++ classes, (4) converting C++ code into Ada programs, and (5) embellishing. This methodology used the GNAT's C++ low level interface capabilities to support …

Elicitation Of Formal Software Specifications From An Object-Oriented Domain Model, Timothy Karagias

Theses and Dissertations

The ability to provide automated support for the generation of formal software specifications would lead to decreased software development time. By eliciting the needed information from a software developer and harvesting the proper parts of a domain model, a software specifications document could be created. This research establishes the feasibility of producing customized software specifications based on an object-oriented domain model. The research was conducted in three phases. The first phase was to define the requirements for the Elicitor Harvester. Those requirements were balanced between the capabilities of the existing Knowledge Based Software Engineering (KBSE) software used at AFIT and …

A Test-Case Based Approach To Bayesian Knowledge Base Incompleteness Detection And Correction, Louise J. Lyle

Theses and Dissertations

This work develops tools and techniques to identify particular Bayesian Knowledge Base (BKB) incompletenesses, and to modify the existing knowledge-base (KB) structure to correct these problems. The methodology performs manually or automatically, informing the user of either problems causing the incompleteness, or of details resulting from the automatic knowledge-base correction. The proposed methodology is designed for integration with BVAL, to augment BVAL's validation techniques.

Utilizing Bayesian Techniques For User Interface Intelligence, Robert A. Harrington

Theses and Dissertations

The purpose of this research is to study the injection of an intelligent agent into modern user interface technology. This agent is intended to manage the complex interactions between the software system and the user, thus making the complexities transparent to the user. The background study will show that while interesting and promising research exists in the domain of intelligent interface agents, very little research has been published that indicates true success in representing the uncertainty involved in predicting user intent. The interface agent architecture presented in this thesis will offer one solution for solving the problem using a newly …

Searching For Ephemeral Subsequences In Strings, Alberto Apostolico, Mikhail J. Attalah

Department of Computer Science Technical Reports

No abstract provided.

Low-Threat Security Patches And Tools, Mohd A. Bashar, Ganesh Krishnan, Markus G. Kuhn, Eugene H. Spafford, Samuel S. Wagstaff Jr

Department of Computer Science Technical Reports

No abstract provided.

Misplaced Trust: Kerberos 4 Session Keys, Bryn Dole, Steve Lodin, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Safe Structural Conformance For Java, Konstantin Laufer, Gerald Baumgartner, Vincent F. Russo

Department of Computer Science Technical Reports

No abstract provided.

On The Approximate Pattern Occurrences In A Text, Mireille Régnier, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

The Purdue Pse Kernel: Towards A Kernel For Building Pses, Sanjiva Weerawarana, Elias N. Houstis, John R. Rice, Ann C. Catlin, Margaret G. Gaitatzes, Shahani Markus, Tzveten T. Drashansky

Department of Computer Science Technical Reports

No abstract provided.

Secure Outsourcing Of Some Computations, Mikhail J. Atallah, Konstantinos N. Pantazopoulos, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Knowledge Discovery In Computational Science: A Case Study In Algorithm Selection, N. Ramakrishnan, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Efficient Parallel Algorithms On Reconfigurable Mesh Architectures, His-Chieh Lee, Fikret Ercal

Computer Science Technical Reports

This dissertation describes a number of novel parallel algorithms for solving maze-routing problems and string matching problems on a proposed reconfigurable mesh architecture.

Section I reviews the field of reconfigurable parallel computing. This includes an introduction to a number of reconfigurable architectures proposed in the literature and a list of references to the current literature on algorithms in the field of reconfigurable computing.

Section II presents a number of time-efficient algorithms to solve the mazerouting problem. Maze-routing algorithms are used in VLSI routing and robot path planning. In that section, definitions for absolute shortest path (ASP), shortest duplex-path (SDP), shortest …

Analysis Of Linkage-Friendly Genetic Algorithms, Laurence D. Merkle

Theses and Dissertations

Evolutionary algorithms (EAs) are stochastic population-based algorithms inspired by the natural processes of selection, mutation, and recombination. EAs are often employed as optimum seeking techniques. A formal framework for EAs is proposed, in which evolutionary operators are viewed as mappings from parameter spaces to spaces of random functions. Formal definitions within this framework capture the distinguishing characteristics of the classes of recombination, mutation, and selection operators. EAs which use strictly invariant selection operators and order invariant representation schemes comprise the class of linkage-friendly genetic algorithms (lfGAs). Fast messy genetic algorithms (fmGAs) are lfGAs which use binary tournament selection (BTS) with …

Algebraic Algorithm Design And Local Search, Robert P. Graham Jr.

Theses and Dissertations

Formal, mathematically-based techniques promise to play an expanding role in the development and maintenance of the software on which our technological society depends. Algebraic techniques have been applied successfully to algorithm synthesis by the use of algorithm theories and design tactics, an approach pioneered in the Kestrel Interactive Development System (KIDS). An algorithm theory formally characterizes the essential components of a family of algorithms. A design tactic is a specialized procedure for recognizing in a problem specification the structures identified in an algorithm theory and then synthesizing a program. Design tactics are hard to write, however, and much of the …

Pulse Coupled Neural Networks For The Segmentation Of Magnetic Resonance Brain Images, Shane L. Abrahamson

Theses and Dissertations

This research develops an automated method for segmenting Magnetic Resonance (MR) brain images based on Pulse Coupled Neural Networks (PCNN). MR brain image segmentation has proven difficult, primarily due to scanning artifacts such as interscan and intrascan intensity inhomogeneities. The method developed and presented here uses a PCNN to both filter and segment MR brain images. The technique begins by preprocessing images with a PCNN filter to reduce scanning artifacts. Images are then contrast enhanced via histogram equalization. Finally, a PCNN is used to segment the images to arrive at the final result. Modifications to the original PCNN model are …

A Domain Independent Framework For Developing Knowledge Based Computer Generated Forces, James L. Benslay Jr.

Theses and Dissertations

Computer Generated Forces (CGFs) are important players in Distributed Interactive Simulation (DIS) exercises. A problem with CGFs is that they do not exhibit sufficient human behaviors to make their use effective. The SOAR approach has yielded a human cognitive model that can be applied to CGFs, but this is extremely complex. The product of the research reported in this thesis is a much less complex behavioral framework for a CGF that is easy to validate, revise, and maintain. To support this, an existing, domain independent CGF architecture is discussed and applied to an experimental CGF. Techniques for modeling the knowledge …

Refined Genetic Algorithms For Polypeptide Structure Prediction, Charles E. Kaiser Jr.

Theses and Dissertations

Accurate and reliable prediction of macromolecular structures has eluded researchers for nearly 40 years. Prediction via energy minimization assumes the native conformation has the globally minimal energy potential. An exhaustive search is impossible since for molecules of normal size, the size of the search space exceeds the size of the universe. Domain knowledge sources, such as the Brookhaven PDB can be mined for constraints to limit the search space. Genetic algorithms (GAs) are stochastic, population based, search algorithms of polynomial (P) time complexity that can produce semi-optimal solutions for problems of nondeterministic polynomial (NP) time complexity such as PSP. Three …

Molecular Articulation In Response To Interactive Atomic Forces In Docker, Todd R. Kellett

Theses and Dissertations

Molecular docking aids in the design of materials supporting the current and future needs of the warfighter by simulating the real-world results of combining molecules. Specifically, it supports research and development in novel non-linear optical materials for laser-hardening and other advanced optical applications. Potential uses for these materials range from personnel and optical system laser protection to holographic information displays. DOCKER, our baseline docking system, minimizes the computational overhead of the simulation by modeling the molecules as rigid objects. This simplification can cause DOCKER's solutions to disagree with the real-world results, because molecules flex as they react to one another …

Implementation Of An Ada95 Crosscompiler For The Real-Time Executive For Military Systems (Rtems), Kendall M. Lemley Jr.

Theses and Dissertations

This thesis represents a continuation of the assessment of the Unified Telerobotics Architecture Project (UTAP), a proposed Air Force standard. This architecture was developed by the NASA Jet Propulsion Laboratory and the National Institute of Standards under contract to the Air Force Materiel Command Robotics and Automation Center of Excellence at Kelly AFB, Texas. Due to operating system constraints, the only UTAP implementation to date has required a separate software interface layer, adding complexity and overhead to the overall system, while reducing portability. This thesis proposes a long term effort to design and implement UTAP-compliant application software devoid of this …

A Specific Network Link And Path Likelihood Prediction Tool, Gary K. Moy

Theses and Dissertations

Communications have always been a crucial part of any military operation. As the pace of warfare and the technological complexity of weaponry have increased, so has the need for rapid information to assess battlefield conditions. Message passing across a network of communication nodes allowed commanders to communicate with their forces. It is clear that an accurate prediction of communication usage through a network will provide commanders with useful intelligence of friendly and unfriendly activities. Providing a specific network link and path likelihood prediction tool gives strategic military commanders additional intelligence information and enables them to manage their limited resources more …

An Approach To Evaluate Software Effectiveness, Timothy J. Schalick

Theses and Dissertations

The Air Force Operational Test and Evaluation Center (AFOTEC) is tasked with the evaluation of operational effectiveness of new systems for the Air Force. Currently, the software analysis team within AFOTEC has no methodology to directly address the effectiveness of the software portion of these new systems. This research develops a working definition for software effectiveness, then outlines an approach to evaluate software effectiveness-- the Software Effectiveness Traceability Approach (SETA). Effectiveness is defined as the degree to which the software requirements are satisfied and is therefore application-independent. With SETA, requirements satisfaction is measured by the "degree of traceability" throughout the …

Survivability Analysis Of The Iridium Low Earth Orbit Satellite Network, Douglas K. Stenger

Theses and Dissertations

This thesis evaluates the survivability of the proposed Iridium Low Earth Orbit (LEO) Satellite Network. In addition to the complete Iridium constellation, three degraded Iridium constellations are analyzed. This analysis occurs via the use of simulation models, which are developed to use three dynamic routing algorithms over three loading levels. The Iridium network models use a common set of operating assumptions and system environments. The constellation survivability was determined by comparing packet rejection rates, hop' counts, and average end to end delay performance between the various network scenarios. It was concluded that, based on the established scenarios, the proposed Iridium …

Collaborative Workspaces Within Distributed Virtual Environments, William D. Wells

Theses and Dissertations

In warfare, be it a training simulation or actual combat, a commander's time is one of the most valuable and fleeting resources of a military unit. Thus, it is natural for a unit to have a plethora of personnel to analyze and filter information to the decision-maker. This dynamic exchange of ideas between analyst and commander is currently not available within the distributed interactive simulation (DIS) community. This lack of exchange limits the usefulness of the DIS experience to the commander and his troops. This thesis addresses the commander's isolation problem through the integration of a collaborative workspace within AFIT's …