Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 17191 - 17220 of 17464

Full-Text Articles in Entire DC Network

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

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 …

Go to article

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

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

Go to article

Design And Development Of A High-Speed Winograd Fast Fourier Transform Processor Board, James F. Herron Dec 1992

Design And Development Of A High-Speed Winograd Fast Fourier Transform Processor Board, James F. Herron

Theses and Dissertations

Since 1985, the Air Force Institute of Technology has pursued a project to develop a 4080-point Discrete Fourier Transform processor using the Winograd Fourier Transform Algorithm (WFTA) and Good-Thomas Prime Factoring Algorithm (PFA). In the first attempt to build a working system, this research effort designed and constructed, in part, a modified single processor architecture in order to demonstrate the proof of concept of the WFTA system design. This prototype architecture is simpler in implementation but uses the same principles and procedures as those of the 4080-point WFTA design. The design developed in this thesis was validated using the Very …

Go to article

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

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 …

Go to article

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

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 …

Go to article

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

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 …

Go to article

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

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 …

Go to article

An Investigation Of Structural Locality In The Memory Referencing Behavior Of Computer Programs, Michael E. Bletzinger Dec 1992

An Investigation Of Structural Locality In The Memory Referencing Behavior Of Computer Programs, Michael E. Bletzinger

Theses and Dissertations

The nature of structural locality as defined by same stack distance access is investigated in this thesis. The question is whether structural locality can be characterized as an inherent type of behavior. The results revealed that structural locality is strongly influenced by a program's design and phase of execution. Entropy measurements revealed that the predictiveness of structural locality is also influenced by program design. A Markov model was refined to capture the characteristics of structural locality that were measured. Trace synthesis demonstrated some success in reproducing same stack distance run distributions when the model had enough states to encompass the …

Go to article

Computer Simulation Of A General Purpose Satellite Modem, William L. Montgomery Jr. Dec 1992

Computer Simulation Of A General Purpose Satellite Modem, William L. Montgomery Jr.

Theses and Dissertations

The purpose of this research was to model and simulate the performance of a digital phase shift keyed satellite modem. The probability of bit error (P sub b) at different levels of energy per bit to noise power ratio (E sub b/N sub o) was the performance measure. The channel was assumed to contribute only additive white Gaussian noise. A second order Costas loop performs demodulation in the modem and was the key part of the simulation. The Costas loop with second order Butterworth arm filters was tested by finding the response to a phase or frequency step. The Costas …

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 8, November 1992, College Of Engineering And Computer Science, Wright State University Nov 1992

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 8, November 1992, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Go to article

Computing Specificity, Ronald Loui, J. Norman, K. Stiefvater, A. Merrill, A. Costello, J. Olson Nov 1992

Computing Specificity, Ronald Loui, J. Norman, K. Stiefvater, A. Merrill, A. Costello, J. Olson

All Computer Science and Engineering Research

This note reports on an effort to implement a version of Poole's rule for specificity. Relatively, efficient implementation relies on correcting and improving a pruning lemma of Simari-Loui [92]. This in turn requires revision of Poole's specificity concept. The resulting system is a usable knowledge representation system with first-order-language and defeasible reasoning. Sample input and output are included in an appendix. It is a good candidate for multiple inheritance applications; it is useful for planning, but limited by the underlying search for plans.

Go to article

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

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 …

Go to article

Automatic Surface Mount Solder Joints Inspection, Zhu Liu Oct 1992

Automatic Surface Mount Solder Joints Inspection, Zhu Liu

Theses

This thesis reports the research results on automatic inspection of solder joints on printed circuit boards. The previous work on this subject has been advanced significantly in the following three aspects. With the support of AT&T Bell Lab, the most updated surface mount solder joints are inspected in this work instead of larger simulation solder joints or traditional through hole solder joints in the previous work. A small set of features is extracted for surface mount solder joints in both infrared and visual light inspection. A new image processing software named Khoros has been applied to improve the quality of …

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 7, October 1992, College Of Engineering And Computer Science, Wright State University Oct 1992

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 7, October 1992, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Go to article

Process And Policy: Resource-Bounded Non-Demonstrative Reasoning, Ronald P. Loui Oct 1992

Process And Policy: Resource-Bounded Non-Demonstrative Reasoning, Ronald P. Loui

All Computer Science and Engineering Research

This paper investigates the appropriateness of formal dialectics as a basis for non-monotonic and defeasible reasoning that takes computational limits seriously. Rules that can come into conflict should be regarded as policies, which are inputs to deliberative processes. Dialectical protocols are appropriate for such deliberations when resources are bounded and search is serial. AI, it is claimed here, is now perfectly positioned to correct many misconceptions about reasoning that have resulted from mathematical logic's enormous success in this century: among them (1) that all reasons are demonstrative, (2) that rational belief is constrained, not constructed, (3) that process and disputation …

Go to article

Interaction Of Profiled Light With Contrapropagating Acoustic Waves: Fourier Transform Approach, Partha P. Banerjee, Chen-Wen Tarn, Jaw-Jueh Liu Oct 1992

Interaction Of Profiled Light With Contrapropagating Acoustic Waves: Fourier Transform Approach, Partha P. Banerjee, Chen-Wen Tarn, Jaw-Jueh Liu

Electrical and Computer Engineering Faculty Publications

A straightforward Fourier-transform approach is employed to investigate acousto-optic interaction between an input optical beam with arbitrary profile and contrapropagating cw sound in the Bragg regime. The process can be analyzed in terms of the simultaneous scattering of light by the two sound waves in the interaction region. Analytic expressions for the equivalent transfer functions are obtained and the scattered light profiles are plotted.

Go to article

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

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 …

Go to article

Separating Structure From Function In The Specification And Design Of Distributed Systems, Kenneth J. Goldman Sep 1992

Separating Structure From Function In The Specification And Design Of Distributed Systems, Kenneth J. Goldman

All Computer Science and Engineering Research

A distributed system is viewed as a collection of functional components and a unifying structure that defines relationships among the components. In the paper, we advocate a particular approach to distributed system specification and design in which the structure of a distributed system is specified separately from the functional components. This permits one to reason about individual functional components in isolation, and encourages one to make explicit not only the input/output behavior of the functional components but also the logical placement of these components within the overall structure of the system. We describe a new software tool for the specification, …

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 6, September 1992, College Of Engineering And Computer Science, Wright State University Sep 1992

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 6, September 1992, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Go to article

Dna Mapping Algorithms: Strategies For Single Restriction Enzyme And Multiple Restriction Enzyme Mapping, Will Gillett Aug 1992

Dna Mapping Algorithms: Strategies For Single Restriction Enzyme And Multiple Restriction Enzyme Mapping, Will Gillett

All Computer Science and Engineering Research

An approach to high-resolution restriction-fragment DNA mapping, known as Multiple-Restriction-Enzyme mapping (MRE mapping), is present. This approach significantly reduces the uncertainty of clone placement by using clone ends to synchronize the position in of clones within different maps, each map being constructed from fragment-length data produced by digestion of each clone with a specific restriction enzyme. Maps containing both fragments-length data and clone-end data are maintained for each restriction enzyme, and synchronization between two such maps is achieved by requiring them to have "compatible" clone-end map projections. Basic definitions of different kinds of maps, such as restriction sites maps, restriction …

Go to article

Can Pac Learning Algorithms Tolerate Random Attribute Noise?, Sally A. Goldman, Robert H. Sloane Jul 1992

Can Pac Learning Algorithms Tolerate Random Attribute Noise?, Sally A. Goldman, Robert H. Sloane

All Computer Science and Engineering Research

This paper studies the robustness of pac learning algorithms when the instances space is {0,1}n, and the examples are corrupted by purely random noise affecting only the instances (and not the labels). In the past, conflicting results on this subject have been obtained -- the "best agreement" rule can only tolerate small amounts of noise, yet in some cases large amounts of noise can be tolerated. We show that the truth lies somewhere in between these two alternatives. For uniform attribute noise, in which each attribute is flipped independently at random with the same probability, we present an algorithm that …

Go to article

Discourse-Level Analysis Of Abstracts For Information Retrieval: A Probabilistic Approach, Robert N. Oddy Jul 1992

Discourse-Level Analysis Of Abstracts For Information Retrieval: A Probabilistic Approach, Robert N. Oddy

School of Information Studies - Faculty Scholarship

The objective of this research is to contribute to our knowledge of how people seek information, and how computer systems can be designed to help in this process. Most information retrieval research since the field emerged in the 1950's has reduced these questions to that of trying to determine how documents relevant to a user's query might be selected from a large collection of texts---a question that has proved remarkably difficult to answer. The present work takes the stance that this particular reduction increasingly limits progress towards the objective stated above. It is directed instead towards the development of a …

Go to article

Analysis Of Multifrequency Dispersive Optical Bistability And Switching In Nonlinear Ring Cavities With Large Medium-Response Times, Pawel Pliszka, Partha P. Banerjee Jul 1992

Analysis Of Multifrequency Dispersive Optical Bistability And Switching In Nonlinear Ring Cavities With Large Medium-Response Times, Pawel Pliszka, Partha P. Banerjee

Electrical and Computer Engineering Faculty Publications

Using a simple model of a ring cavity comprising a cubically nonlinear medium, we analyze dispersive optical bistability in the presence of more than one spectral component. We show the phenomenon of so-called competition for resonance. In addition to presenting cavity characteristics for the cases of two and three different frequencies, we also discuss the general method for finding steady-state solutions and checking their stability. A simple and efficient algorithm, based on a relaxation method, is devised to find steady-state solutions satisfying appropriate boundary conditions. The relaxation dynamics is physically related to a finite response time of the medium.

Go to article

The 3-Tier Structured Access Protocol To Control Unfairness In Dqdb Mans, Lakshmana N. Kumar, Andreas D. Bovopoulos Jun 1992

The 3-Tier Structured Access Protocol To Control Unfairness In Dqdb Mans, Lakshmana N. Kumar, Andreas D. Bovopoulos

All Computer Science and Engineering Research

This paper addresses the unfairness problem appearing in 802.6-based DQDB MANs. Traffic load demand is characterized as low (below 0.4 of the channel capacity), normal (from 0.4 to 0.9 of the channel capacity) or heavy (greater than 0.9 of the channel capacity). At low loads the 802.6 protocol is acceptably fair. At normal loads, however, the protocol performance is markedly unfair. The unfairness is related to the latency in transporting a request. At heavy loads the unfairness is both latency-related and flooding-related. In this paper, both types of unfairness are carefully analyzed. As a control measure, a 3-Tier Structured Access …

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 5, May 1992, College Of Engineering And Computer Science, Wright State University May 1992

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 5, May 1992, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 4, April 1992, College Of Engineering And Computer Science, Wright State University Apr 1992

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 4, April 1992, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 3, March 1992, College Of Engineering And Computer Science, Wright State University Mar 1992

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 3, March 1992, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Go to article

Boolean Reasoning And Informed Search In The Minimization Of Logic Circuits, James J. Kainec Mar 1992

Boolean Reasoning And Informed Search In The Minimization Of Logic Circuits, James J. Kainec

Theses and Dissertations

The minimization of logic circuits has been an important area of research for more than a half century. The approaches taken in this field, however, have for the most part been ad hoc. Boolean techniques have been employed to manipulate formulas, but not to perform symbolic reasoning. Boolean equations are employed principally as icons; they are never solved. The first objective of this dissertation is to apply Boolean reasoning systematically and uniformly to the minimization problem. Boolean reasoning entails the reduction of systems of Boolean equations to a single equation; the single equation is an abstraction, independent of the form …

Go to article

Implementation And Analysis Of Np-Complete Algorithms On A Distributed Memory Computer, Joel S. Garmon Mar 1992

Implementation And Analysis Of Np-Complete Algorithms On A Distributed Memory Computer, Joel S. Garmon

Theses and Dissertations

The purpose of this research is to explore methods used to parallelize NP-complete problems and the degree of improvement that can be realized using different methods of load balancing. A serial and four parallel A* branch and bound algorithms were implemented and executed on an Intel iPSC/2 hypercube computer. One parallel algorithm used a global, or centralized, list to store unfinished work and the other three parallel algorithms used a distributed list to store unfinished work locally on each processor. the three distributed list algorithms are: without load balancing, with load balancing, and with load balancing and work distribution. The …

Go to article

Model-Based Target Recognition Using Laser Radar Imagery, Robert Y. Li Feb 1992

Model-Based Target Recognition Using Laser Radar Imagery, Robert Y. Li

Department of Electrical and Computer Engineering: Faculty Publications

Autonomous target recognition can be assisted by using CO2 laser radar data. Of these data, range data provide 3-D geometric information and Doppler data boundaries of moving targets. A powerful 3-D feature extraction algorithm based on the Hough transform is used to obtain the orientations and dimensions of the target. This information is then utilized by an inference procedure that recognizes targets based on the available evidence from the sensory data. The experimental results using actual laser radar imagery are successful and the procedure can be used for the future development of a model-based system for target recognition.

Go to article

First Prev Next Last