Physical Sciences and Mathematics Commons^™

Information Engineering Facility (Ief) Computer Aided Software Engineering (Case) For Church Management System, Cynthia T. Dubose

Electronic Dissertations and Theses

No abstract provided.

Simulations Between Programs As Cellular Automata, Howard A. Blair, Fred Dushin, Polar Humenn

Electrical Engineering and Computer Science - Technical Reports

We present cellular automata on appropriate digraphs and show that any covered normal logic program is a cellular automaton. Seeing programs as cellular automata shifts attention from classes of Herbrand models to orbits of Herbrand interpretations. Orbits capture both the declarative, model-theoretic meaning of programs as well as their inferential behavior. Logically and intentionally different programs can produce orbits that simulate each other. Simple examples of such behavior are compellingly exhibited with space-time diagrams of the programs as cellular automata. Construing a program as a cellular automaton leads to a general method for simulating any covered program with a Horn …

Designing Dependencies, Howard A. Blair

Electrical Engineering and Computer Science - Technical Reports

Given a binary recursively enumerable relation R, one or more logic programs over a language L can be constructed and interconnected to produce a dependency relation D on selected predicates within the Herbrand base BL of L isomorphic to R. D can be, optionally, a positive, negative or mixed dependency relation. The construction is applied to representing any effective game of the type introduced by Gurevich and Harrington, which they used to prove Rabin's decision method for S2S, as the dependency relation of a logic program. We allow games over an infinite alphabet of possible moves. We use this representation …

Secure Trapdoor Hash Functions Based On Public-Key Cryptosystems, Gary R. Greenfield, Sarah Agnes Spence

Department of Math & Statistics Technical Report Series

In this paper we systematically consider examples representative of the various families of public-key cryptosystems to see if it would be possible to incorporate them into trapdoor hash functions, and we attempt to evaluate the resulting strengths and weaknesses of the functions we are able to construct. We are motivated by the following question:

Question 1.2 How likely is it that the discoverer of a heretofore unknown public-key cryptosystem could subvert it for use in a plausible secure trapdoor hash algorithm?

In subsequent sections, our investigations will lead to a variety of constructions and bring to light the non-adaptability of …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 11, Number 10, December 1995, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A twelve page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Bit-Sequences: A New Cache Invalidation Method In Mobile Environments, Jin Jing, Ahmed K. Elmagarmid, Abdelsalam Helal, Rafael Alonso

Department of Computer Science Technical Reports

No abstract provided.

Inverse Pattern Matching, Amihood Amir, Alberto Apostolico, Moshe Lewenstein

Department of Computer Science Technical Reports

No abstract provided.

Migrant Threads On Process Farms: Parallel Programming With Ariadne*, Edward Mascarenhas, Vernon Rego

Department of Computer Science Technical Reports

No abstract provided.

Lightweight Write Detection And Checkpointing For Fine-Grained Persistence, Antony L. Hosking, J. Eliot B. Moss

Department of Computer Science Technical Reports

No abstract provided.

The New Jersey Machine-Code Toolkit, Norman Ramsey, Mary F. Fernáyesndez

Department of Computer Science Technical Reports

No abstract provided.

Sliced Configuration Spaces For Curved Planar Bodies, Elisha Sacks, Chandrajit Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Kenematic Tolerance Analysis, Leo Joskowicz, Elisha Sacks, Vijay Srinivasan

Department of Computer Science Technical Reports

No abstract provided.

Partitioned Data Management In Mobile Environments, Ahmed K. Elmagarmid, Jin Jing, Abdelsalam Helal, Rafael Alonso

Department of Computer Science Technical Reports

No abstract provided.

Pattern Matching Image Compression: Algorithmic And Empirical Results, Mikhail J. Atallah, Yann Génin, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Packet Routing In Networks With Long Wires, Ronald I. Greenberg, Hyeong-Cheol 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 Npackets in O((C lg^ϵ(Nd) + D lg(Nd))/lg lg(Nd)) time, where C is the maximum congestion and D is the length of the longest path, both taking wire delays into …

Dynamics Of Binary Liquids In Pores, J.C. Lee

Faculty Publications

A computer simulation is performed to study the dynamics of binary liquids in the pores of Vycor glasses. The pores are modeled with glass walls that form randomly interconnected tunnels. When the relaxation is probed with a particular wavelength, the time autocorrelation function depends on whether or not there is a significant periodic or quasiperiodic structure in the distribution of the walls with that wavelength. If there is not, the relaxation may be fitted as the sum of an exponential term and a nonexponential activated term. If there is, the relaxation shows a long-lasting tail that can be fitted by …

Design And Analysis Of Parallel Hierarchical Battlefield Simulation, Conrad P. Masshardt

Theses and Dissertations

The purpose of this research is to determine if hierarchically partitioning a discrete event battlefield simulation reduces runtime and, if reduction exists, to characterize the run time reduction given any particular partition configuration. A hierarchical discrete event simulation of a main battle tank was constructed. Implementations were built for both a single processor and a multiprocessing machine. The implementations used the Message Passing Interface to increase portability to other parallel and distributed configurations. Three test cases were generated and run on three parallel and distributed environments, a network of Sun SparcStation 20's, a Silicon Graphics Power Challenge, and a Paragon …

Probabilistic Knowledge Base Validation, Howard T. Gleason

Theses and Dissertations

Our work develops a new methodology and tool for the validation of probabilistic knowledge bases throughout their lifecycle. The methodology minimizes user interaction by automatically modifying incorrect knowledge; only the occurrence of incomplete knowledge involves interaction. These gains are realized by combining and modifying techniques borrowed from rule-based and artificial neural network validation strategies. The presented methodology is demonstrated through BVAL, which is designed for a new knowledge representation, the Bayesian Knowledge Base. This knowledge representation accommodates incomplete knowledge while remaining firmly grounded in probability theory.

Temporal Influence On Awareness, Don E. Hill

Theses and Dissertations

Grossberg's Motion Oriented Contrast Filter (MOC) was extensively analyzed (7). The output from the filter's "global motion" neuronal layer was compared to a noncausal post-processing filter developed by AFIT. Both filters were shown to incorporate a weighted, noncausal temporal range of input data in processed output. The global motion framework was then implemented using a physiologically motivated pulsed neural model - the Pulse Coupled Neural Network (PCNN). By incorporating both spatial and temporal data, the PCNN was shown to exhibit a common visual illusion, apparent motion. The existence of a physiological temporal processing range was further investigated through implementation of …

Reducing Lag In Virtual Displays Using Multiple Model Adaptive Estimation, David W. Kyger

Theses and Dissertations

Multiple Model Adaptive Estimation is an effective method for reducing lag in virtual environment displays. Lag in displays (the time from head motion to the appearance of the proper image on the display) is a significant detriment to realism in virtual environments. Increasing the speed of the computers which control the virtual display is not a final answer. No matter how fast the processors work, there will always be demands to do more. Predicting angular head positions (look-angles) can reduce the lag by allowing the computer to calculate the appropriate scene before it is needed on the display. Single predictors …

Simulation Modeling Within Workflow Technology, John A. Miller, Amit P. Sheth, Krzysztof J. Kochut, Xuzhong Wang, Arun Murugan

Kno.e.sis Publications

This paper presents an approach for integrating simulation modeling and analysis capabilities within the workflow management system (WFMS) being developed in the Large Scale Distributed Information Systems (LSDIS) Lab at the University of Georgia. Simulation modeling can be used for studying the efficiency of workflow designs as well as studying the general performance and reliability of WFMSs. We also discuss the importance of using sophisticated monitoring and animation capabilities, and the use of workflow management technology to advance simulation technology itself. Finally, we demonstrate a sample simulation where tasks and task managers are simulated.

Transforming Algebraically-Based Object Models Into A Canonical Form For Design Refinement, Charles G. Beem

Theses and Dissertations

The understandability of object-oriented design techniques and the rigor of formal methods have improved the state of software development; however, both ideas have limitations. Object-oriented techniques, which are semi-formal, can still result in incorrect designs, while formal methods are complex and require an extensive mathematical background. The two approaches can be coupled, however, to produce designs that are both understandable and verifiable, and to produce executable code. This research proposes an approach where object-oriented models are first represented algebraically in a formal specification language such as LARCH and then transformed into a canonical form suitable for design refinement. In the …

Semantic Interpretation Of An Artificial Neural Network, Stanley D. Kinderknecht

Theses and Dissertations

Recent advances in machine learning theory have opened the door for applications to many difficult problem domains. One area that has achieved great success for stock market analysis/prediction is artificial neural networks. However, knowledge embedded in the neural network is not easily translated into symbolic form. Recent research, exploring the viability of merging artificial neural networks with traditional rule-based expert systems, has achieved limited success. In particular, extracting production (IF.. THEN) rules from a trained neural net based on connection weights provides a valid set of rules only when neuron outputs are close to 0 or 1 (e.g. the output …

Deriving Optimal Solutions From Incomplete Knowledge Bases, Shawn A. Northrop

Theses and Dissertations

Many real world domains cannot be represented using Bayesian Networks due to the need for complete probability tables and acyclic knowledge. However, Bayesian Knowledge Bases (BKBs) are a viable method for representing these incomplete domains, but very little research has been performed on inferencing with them. This paper presents three inference engines for extracting optimal solutions from three distinct BKB subclasses: singly- connected, multiply-connected with mutually exclusive cycles, and cyclic. The singly-connected inference engine has a worst case polynomial run time. Performance improvement techniques for increasing inference engine speed are discussed, in addition to a new tool for measuring incompleteness …

Objectism 3.0: A Software Architecture For The Development Of Portable Visual Simulation Applications, Shawn M. Hannan

Theses and Dissertations

A visual simulation software architecture is a reusable design for visual simulation applications. This thesis effort was the third stage in an ongoing refinement of such an architecture, named ObjectSim. The primary goals of this stage were to improve the architecture by eliminating its dependence on two platform-specific graphics libraries (named GL and Performer, from Silicon Graphics, Inc.), and to examine the potential for expanding the architecture to accommodate distributed simulations. The effort resulted in a new version of the architecture which allows the development of visual simulation applications which take full advantage of the aforementioned libraries without calling those …

The Application Of Hybridized Genetic Algorithms To The Protein Folding Problem, Robert L. Gaulke

Theses and Dissertations

The protein folding problem consists of attempting to determine the native conformation of a protein given its primary structure. This study examines various methods of hybridizing a genetic algorithm implementation in order to minimize an energy function and predict the conformation (structure) of Met-enkephalin. Genetic Algorithms are semi-optimal algorithms designed to explore and exploit a search space. The genetic algorithm uses selection, recombination, and mutation operators on populations of strings which represent possible solutions to the given problem. One step in solving the protein folding problem is the design of efficient energy minimization techniques. A conjugate gradient minimization technique is …

An Object-Oriented, Formal Methods Approach To Organizational Process Modeling, Vincent S. Hibdon

Theses and Dissertations

This document presents a methodology for developing an organizational process model which is based on the principles of object oriented design and formal software engineering methods. The methodology begins with the development of an object oriented Rumbaugh model (27). The Rumbaugh model is then formally specified in Z (Zed) schemas. Finally, the Z specifications are translated into an executable model in the Software Refinery Environment(TM). This model is described based on the AF wing domain and developed in this domain. The proposed methodology is then shown to produce a very general model which is extendable across almost any domain. The …

Design And Evaluation Of Standard Telerobotic Control Software, Kevin P. Anchor

Theses and Dissertations

This thesis represents the first implementation of a proposed Air Force standard telerobotic control architecture. This architecture was developed by the NASA Jet Propulsion Laboratory and the National Institute of Standards and Technology under contract to the Air Force Materiel Command Robotics and Automation Center of Excellence (RACE) as the Unified Telerobotics Architecture Project (UTAP). The AFIT Robotics and Automation Applications Group (RAAG) Lab B facility computational structure was redesigned to be compliant with the UTAP architecture. This thesis shows that the UTAP specification to be implementable. However, if the underlying operating system does not support generic message passing, an …

Neural Network Analysis Of Chemical Compounds In Nonrebreathing Fisher-344 Rat Breath, Robert E. Sackett Jr.

Theses and Dissertations

This research applies statistical and artificial neural network analysis to data obtained from measurement of organic compounds in the breath of a Fisher-344 rat. The Research Triangle Institute (RTI) developed a breath collection system for use with rats in order to collect and determine volatile organic compounds (VOCs) exhaled. The RTI study tested the hypothesis that VOCs, including endogenous compounds, in breath can serve as markers to exposure to various chemical compounds such as drugs, pesticides, or carcinogens normally foreign to living organisms. From a comparative analysis of chromatograms, it was concluded that the administration of carbon tetrachloride dramatically altered …

Dynamic Transfer Of Control Between Manned And Unmanned Simulation Actors, Neal W. Schneider

Theses and Dissertations

This thesis continues the ongoing research at the Air Force Institute of Technology's Virtual Environments Laboratory in the area of distributed simulation. As the relevance and interest of interactive simulation as a training medium continues to grow, there is a pressing need to provide more realistic and numerous intelligent autonomous agents for simulations. As those autonomous agents mature and become more realistic, the need exists to be able to handle individual agents by taking control of them and operating them as manned agents at certain points within the simulation. The author started with a protocol proposed in a working draft …