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

Engineering Commons™

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

Computer Sciences

PDF

1994

Institution
Keyword
Publication
Publication Type

Articles 1 - 30 of 78

Full-Text Articles in Engineering

Multicriteria Mission Route Planning Using A Parallel A* Search, Michael S. Gudaitis Dec 1994

Multicriteria Mission Route Planning Using A Parallel A* Search, Michael S. Gudaitis

Theses and Dissertations

The Mission Route Planning (MRP) Problem falls into the general class of multicriteria path search problems. Multiple criteria are evaluated to select an optimal aircraft mission route through a hostile environment. Criteria for distance travelled and radar exposure are combined into a single cost function for route evaluation. Radar calculations are performed dynamically. The A* search algorithm is applied to the MRP problem, and a parallel implementation is developed and tested. A unique combination of distributed OPEN lists with a global CLOSED list strategy produced fast execution times on the Paragon. Test cases for scenarios with 15 radars took less …

Go to article

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

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 10, December 1994, 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

Next Generation Real-Time Systems: Investigating The Potential Of Partial-Solution Tasks, Robert E. J. Caley Dec 1994

Next Generation Real-Time Systems: Investigating The Potential Of Partial-Solution Tasks, Robert E. J. Caley

Theses and Dissertations

While the cyclic executive and fixed-priority scheduling strategies have been sufficient to handle traditional real- time requirements. they are insufficient for dealing with the complexities of next-generation real-time systems. New methods of intelligent control must be developed for guaranteeing on-time task completion for real-time systems that are faced with unpredictable and dynamically changing requirements. Implementing real-time processes as partial-solution tasks is one technique that may be beneficial. This type of task. when combined with intelligent control, has the potential for increasing pre-runtime schedulability, system maintainability. and runtime robustness. This research investigates the benefits of partial-solution tasks by experimentally measuring the …

Go to article

Survey And Implementation Of Commercial Manual Controllers For A Generic Telerobotics Architecture, Thomas E. Deeter Dec 1994

Survey And Implementation Of Commercial Manual Controllers For A Generic Telerobotics Architecture, Thomas E. Deeter

Theses and Dissertations

The purpose of this study is to determine an input device for the Air Force's generic telerobotics architecture for large aircraft maintenance and repair. One area of concern is the human to machine interface, more specifically, which manual controller should be used for the specified tasks in this architecture. We mailed a survey to 68 companies in order to compile a list of possible input devices that the telerobotics architecture could use. 32 companies responded which gave me enough data to generate a list that described the physical traits of the input devices. We then divided the required tasks into …

Go to article

Image Perception Wavelet Simulation And Enhancement For The Visually Impaired, Lemuel Ray Myers Jr. Dec 1994

Image Perception Wavelet Simulation And Enhancement For The Visually Impaired, Lemuel Ray Myers Jr.

Theses and Dissertations

This research delves into the area of image enhancement for the visually impaired. Binocular macular degeneration a visual impairment, affects many Americans; since this condition could not be corrected with conventional glasses the literature suggested using an enhancement system which used a pre-emphasis algorithm to enhance the input image for output to the observer. The work of Dr. Eli Peli, a pioneer in the field of image enhancement, is examine and reproduced. Since his work concentrated mainly on frequency analysis of images, the bulk of this research involves using discrete wavelet analysis to augment that work. A biorthogonal wavelet set …

Go to article

Artificially Intelligent Air Combat Simulation Agents, Daniel E. Gisselquist Dec 1994

Artificially Intelligent Air Combat Simulation Agents, Daniel E. Gisselquist

Theses and Dissertations

The Advanced Research Projects Agency (ARPA), in an effort to improve military simulations, has proposed a standard for Distributed Interactive Simulation (DIS). This network protocol will allow dissimilar applications to communicate simulation information. In the field of air combat, this will allow pilots in remote simulators to fly in a common simulation. The success of this standard is dependent on applications being able to work within that standard, as well as a large variety of Computer Generated Forces (CGFs) to complement interactive forces. CGFs are needed to help simulate the large combat scenarios that can only occur in wartime. By …

Go to article

The Photo-Realistic Afit Virtual Cockpit, Milton E. Diaz Dec 1994

The Photo-Realistic Afit Virtual Cockpit, Milton E. Diaz

Theses and Dissertations

The Air Force Institute of Technology (AFIT) has pursued research in virtual environments since 1988. This research expands the current capabilities of the AFIT Virtual Cockpit (VC) by increasing the realism of the cockpit environment and improving the pilot's command interface. Realism is improved creating console elements from texture maps and polygonal models; these elements include working dials, switches and circuit breakers. The pilot command interface is improved in part by adapting the AFIT Information Pod using a two-dimensional mouse input to the virtual three-dimensional environment. This immersive virtual environment is also improved by modifications to the Head Mounted Display …

Go to article

Development Of A Mammographic Image Processing Environment Using Matlab, John L. Kelley Dec 1994

Development Of A Mammographic Image Processing Environment Using Matlab, John L. Kelley

Theses and Dissertations

Breast cancer is a disease that accounts for a disturbingly large number of deaths in females each year. Its prevalence is a topic of concern to all of us since it can affect our families, friends, and coworkers. Although mammographic screening is the most effective method currently available for the early detection of breast cancer, it is far from being an infallible procedure. Mammographic reading is error prone, partly because of the complexity of the task and partly because of the variability in human performance. Computers offer high reproducibility, and when used as an adjunct by the radiologist, may improve …

Go to article

Embedology And Neural Estimation For Time Series Prediction, Robert E. Garza Dec 1994

Embedology And Neural Estimation For Time Series Prediction, Robert E. Garza

Theses and Dissertations

Time series prediction has widespread application, ranging from predicting the stock market to trying to predict future locations of scud missiles. Recent work by Sauer and Casdagli has developed into the embedology theorem, which sets forth the procedures for state space manipulation and reconstruction for time series prediction. This includes embedding the time series into a higher dimensional space in order to form an attractor, a structure defined by the embedded vectors. Embedology is combined with neural technologies in an effort to create a more accurate prediction algorithm. These algorithms consist of embedology, neural networks, Euclidean space nearest neighbors, and …

Go to article

The Fat-Pyramid And Universal Parallel Computation Independent Of Wire Delay, Ronald I. Greenberg Dec 1994

The Fat-Pyramid And Universal Parallel Computation Independent Of Wire Delay, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

This paper shows that a fat-pyramid of area Θ(A) requires only O(log A) slowdown to simulate any competing network of area A under very general conditions. The result holds regardless of the processor size (amount of attached memory) and number of processors in the competing networks as long as the limitation on total area is met. Furthermore, the result is valid regardless of the relationship between wire length and wire delay. We especially focus on elimination of the common simplifying assumption that unit time suffices to traverse a wire regardless of its length, since the assumption becomes more and more …

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 9, November 1994, College Of Engineering And Computer Science, Wright State University Nov 1994

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 9, November 1994, 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

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

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 8, October 1994, 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 10, Number 7, September 1994, College Of Engineering And Computer Science, Wright State University Sep 1994

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 7, September 1994, 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

Objects To The Rescue! Or Httpd: The Next Generation Operating System, Andrew P. Black, Jonathan Walpole Sep 1994

Objects To The Rescue! Or Httpd: The Next Generation Operating System, Andrew P. Black, Jonathan Walpole

Computer Science Faculty Publications and Presentations

This position paper suggests that object-oriented operating systems may provide the means to meet the ever-growing demands of applications. As an example of a successful OOOS, we cite the http daemon. To support the contention that httpd is in fact an operating system, we observe that it implements uniform naming, persistent objects and an invocation meta-protocol, specifies and implements some useful objects, and provides a framework for extensibility.We also believe that the modularity that is characteristic of OO systems should provide a performance benefit rather than a penalty. Our ongoing work in the Synthetix project at OGI is exploring the …

Go to article

Optimum Symbol-By-Symbol Detection Of Uncoded Digital Data Over The Gaussian Channel With Unknown Carrier Phase, Pooi Yuen Kam, Seng Siew Ng, Tock Soon Ng Aug 1994

Optimum Symbol-By-Symbol Detection Of Uncoded Digital Data Over The Gaussian Channel With Unknown Carrier Phase, Pooi Yuen Kam, Seng Siew Ng, Tock Soon Ng

Research Collection School Of Computing and Information Systems

A theory of optimum receiver design for symbol-by-symbol detection of an uncoded digital data sequence received over the Gaussian channel with unknown carrier phase is presented. Linear suppressed-carrier modulation is assumed. The work here aims at laying a conceptual foundation for optimum symbol-by-symbol detection, and rectifies existing approaches to the problem. The optimum receiver structure is obtained explicitly for an arbitrary carrier phase model, but its computational requirements are too heavy in general for any practical implementation. In one important special case, namely, the case in which the carrier phase can be treated as a constant over some K+1 symbol …

Go to article

Automated Manpower Rostering: Techniques And Experience, C. M. Khoong, Hoong Chuin Lau, L. W. Chew Jul 1994

Automated Manpower Rostering: Techniques And Experience, C. M. Khoong, Hoong Chuin Lau, L. W. Chew

Research Collection School Of Computing and Information Systems

We present ROMAN, a comprehensive, generic manpower rostering toolkit that successfully handles a wide spectrum of work policies found in service organizations. We review the use of various techniques and methodologies in the toolkit that contribute to its robustness and efficiency, and relate experience gained in addressing manpower rostering problems in industry.

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 6, June 1994, College Of Engineering And Computer Science, Wright State University Jun 1994

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 6, June 1994, 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

Identification Of Cutting Force In End Milling Operations Using Recurrent Neural Networks, Q. Xu, K. Krishnamurthy, Bruce M. Mcmillin, Wen Feng Lu Jun 1994

Identification Of Cutting Force In End Milling Operations Using Recurrent Neural Networks, Q. Xu, K. Krishnamurthy, Bruce M. Mcmillin, Wen Feng Lu

Mechanical and Aerospace Engineering Faculty Research & Creative Works

The problem of identifying the cutting force in end milling operations is considered in this study. Recurrent neural networks are used here and are trained using a recursive least squares training algorithm. Training results for data obtained from a SAJO 3-axis vertical milling machine for steady slot cuts are presented. The results show that a recurrent neural network can learn the functional relationship between the feed rate and steady-state average resultant cutting force very well. Furthermore, results for the Mackey-Glass time series prediction problem are presented to illustrate the faster learning capability of the neural network scheme presented here

Go to article

A Recursive Least Squares Training Algorithm For Multilayer Recurrent Neural Networks, Q. Xu, K. Krishnamurthy, Bruce M. Mcmillin, Wen Feng Lu Jun 1994

A Recursive Least Squares Training Algorithm For Multilayer Recurrent Neural Networks, Q. Xu, K. Krishnamurthy, Bruce M. Mcmillin, Wen Feng Lu

Mechanical and Aerospace Engineering Faculty Research & Creative Works

Recurrent neural networks have the potential to perform significantly better than the commonly used feedforward neural networks due to their dynamical nature. However, they have received less attention because training algorithms/architectures have not been well developed. In this study, a recursive least squares algorithm to train recurrent neural networks with an arbitrary number of hidden layers is developed. The training algorithm is developed as an extension of the standard recursive estimation problem. Simulated results obtained for identification of the dynamics of a nonlinear dynamical system show promising results.

Go to article

Production And Decay Of D1 (2420)0 And D2* (2460)0, Avery, P.; Et Al., M. Thulasidas Jun 1994

Production And Decay Of D1 (2420)0 And D2* (2460)0, Avery, P.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

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

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 5, May 1994, 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.

Go to article

Constraint Objects, Divesh Srivastava, Raghu Ramakrishnan, Peter Revesz May 1994

Constraint Objects, Divesh Srivastava, Raghu Ramakrishnan, Peter Revesz

CSE Conference and Workshop Papers

We describe the Constraint Object Data Model (CODM), which enhances an object-based data model with existential constraints to naturally represent partially specified information. We present the Constraint Object Query Language (COQL), a declarative, rule-based query language that can be used to infer relationships about and monotonically refine information represented in the CODM. COQL has a model-theoretic and an equivalent fixed-point semantics, based on the notions of constraint entailment and "proofs in all possible worlds." We also provide a novel polynomial-time algorithm for quantifier elimination for set-order constraints, a restricted class of set constraints that uses membership of subset-equal.

Go to article

Multirate Time-Frequency Distributions, John R. O'Hair May 1994

Multirate Time-Frequency Distributions, John R. O'Hair

Theses and Dissertations

Multirate systems, which find application in the design and analysis of filter banks, are demonstrated to also be useful as a computational paradigm. It is shown that any problem which can be expressed a set of vector-vector, matrix-vector or matrix-matrix operations can be recast using multirate. This means all of numerical linear algebra can be recast using multirate as the underlying computational paradigm. As a non-trivial example, the multirate computational paradigm is applied to the problem of Generalized Discrete Time- Frequency Distributions GDTFD to create a new family of fast algorithms. The first of this new class of distributions is …

Go to article

A User-Level Process Package For Concurrent Computing, Ravi Konuru, Steve Otto, Jonathan Walpole, Robert Prouty, Jeremy Casas May 1994

A User-Level Process Package For Concurrent Computing, Ravi Konuru, Steve Otto, Jonathan Walpole, Robert Prouty, Jeremy Casas

Computer Science Faculty Publications and Presentations

A lightweight user-level process(ULP) package for parallel computing is described. Each ULP has its own register context, stack, data and heap space and communication with other ULPs is performed using locally synchronous, location transparent, message passing primitives. The aim of the package is to provide support for lightweight over-decomposition, optimized local communication and transparent dynamic migration. The package supports a subset of the Parallel Virtual Machine(PVM) interface[Sun90).

Go to article

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

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 4, April 1994, 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

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

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 3, March 1994, 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.

Go to article

Application Of Sequential Quadratic Programming To Large-Scale Structural Design Problems, Mark A. Abramson Mar 1994

Application Of Sequential Quadratic Programming To Large-Scale Structural Design Problems, Mark A. Abramson

Theses and Dissertations

Large-scale structural optimization problems are often difficult to solve with reasonable efficiency and accuracy. Such problems are often characterized by constraint functions which are not explicitly defined. Constraint and gradient functions are usually expensive to evaluate. An optimization approach which uses the NLPQL sequential quadratic programming algorithm of Schittkowski, integrated with the Automated Structural Optimization System ASTROS is tested. The traditional solution approach involves the formulation and solution of an explicitly defined approximate problem during each iteration. This approach is replaced by a simpler approach in which the approximate problem is eliminated. In the simpler approach, each finite element analysis …

Go to article

The Effective Use Of Animation In Simulation Model Validation, Christopher L. Swider Mar 1994

The Effective Use Of Animation In Simulation Model Validation, Christopher L. Swider

Theses and Dissertations

This study examined two animation displays moving icons, bar graphs at two presentation speeds to determine how each of these factors affected the animations ability to communicate violations of model assumptions. Subjects viewed animation displays individually and in combination at each presentation speed. Eight problem scenarios were presented to evaluate each animations ability to communicate violations of different assumptions. Each animations communication ability was measured subjectively and objectively. Subjective measures in the form of pairwise comparisons were used to calculate normalized preference ratings for each animation. objective measures included problem identification accuracy and problem time. Subjective results indicated that moving …

Go to article

Assessing The Vulnerability Of Multi-Commodity Networks With Failing Components, Alan R. Robinson Mar 1994

Assessing The Vulnerability Of Multi-Commodity Networks With Failing Components, Alan R. Robinson

Theses and Dissertations

This research proposes an analytical approach for assessing flow disturbance, or compromise, based on limited sampling of arc flow information in multi-commodity, or multiple origin-destination O-D, networks with failing arcs. There were three objectives established for this research. The first objective was to bound the expected flow, given the arcs fail with certain probabilities, which was accomplished by reviewing current approaches for single-commodity networks and extending the results to the multi-commodity case. The second objective was to determine the best placement of flow monitors to obtain the most accurate estimates of O-D pair volumes. This was accomplished using a multi-criteria …

Go to article

A Fortran Based Learning System Using Multilayer Back-Propagation Neural Network Techniques, Gregory L. Reinhart Mar 1994

A Fortran Based Learning System Using Multilayer Back-Propagation Neural Network Techniques, Gregory L. Reinhart

Theses and Dissertations

An interactive computer system which allows the researcher to build an optimal neural network structure quickly, is developed and validated. This system assumes a single hidden layer perceptron structure and uses the back- propagation training technique. The software enables the researcher to quickly define a neural network structure, train the neural network, interrupt training at any point to analyze the status of the current network, re-start training at the interrupted point if desired, and analyze the final network using two- dimensional graphs, three-dimensional graphs, confusion matrices and saliency metrics. A technique for training, testing, and validating various network structures and …

Go to article

Next Last