Computer Sciences Commons^™

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.

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 …

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 …

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

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 …

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.

The Development Of An Expert System For Hazardous Cargo Compatibility, Douglas A. Furst, Ronald E. Smith

Theses and Dissertations

This research demonstrates the application of expert system technology to automate the aircraft load selection process performed when transporting hazardous cargo. The resulting computer program is an expert system named HAZARD. This system incorporates the regulations governing hazardous cargo compatibility with the heuristics used by experts in loadplanning operations. The impetus to develop such a system is the January 1993 conversion of regulation guidelines for hazardous cargo classification and management in Air Force Regulation 71-4, to a universal international standard. The Cargo Operations Division of Headquarters Air Mobility Command at Scott AFB, was concerned that this change in procedures and …

Comparative Evaluation Of A Monocular Head Mounted Display Device Versus A Flat Screen Display Device In Presenting Aircraft Maintenance Technical Data, Jeffrey A. Friend, Randy S. Grinstead

Theses and Dissertations

As military developers provide increasingly complex weapon system, it becomes more difficult for maintenance technicians to perform their jobs. One aspect of the technicians' world is the need to access technical information in the performance of their duties. This study investigated two electronic display systems to evaluate which enhanced technician performance more. A Head Mounted Display (HMD) device and a portable hand-held flat-screen computer were evaluated in the performance of two flightline maintenance activities. Although both display systems were fully portable and self contained, only the HMD system allowed continuous access to technical information during task performance. In most cases, …

Comparison Of Four-Cursor Buttons Vs Joystick To Access Computerized Technical Information From An Integrated Maintenance Information System, Gerald E. Streff, Robert H. Gundel

Theses and Dissertations

The purpose of this thesis was to evaluate the use of four-cursor buttons versus a joystick device to present technical order information on a portable maintenance aid computer for aircraft technicians in a maintenance environment. Studies to date have verified the superiority of computer-presented technical orders when compared to current paper-based systems; this research investigated the effectiveness of these computer-based systems when technicians used a joystick or four-cursor button to display desired technical information. A comparison was made as to technician performance using a portable maintenance aid at the 4950th Test Wing, WPAFB OH. A total of thirty-two maintenance technicians …

Design Of An Artificial Neural Network Based Tactile Sensor For The Utah/Mit Dexterous Hand, Jeffery D. Nering

Theses and Dissertations

The Neural Tactile Sensor (NTS) is a high resolution, easily manufactured tactile sensor consisting of electrodes, a thin resistive 'skin', and pattern recognition circuitry that is capable of resolving dynamic and static contact location, force, and slip throughout the continuum of the sensor's active region. The sensor operates by means of a resistive 'skin' harboring the electric field generated when a current is injected into it, and a plurality of electrodes for taking measurements of said electric field. When current flows through the resistive medium from the location of tactile contact, an electric field within the resistive medium is established, …

Autonomous Face Segmentation, Kevin P. Gay

Theses and Dissertations

The purpose of this study was to implement an autonomous face segmentor as the front end to a face recognition system on a Sun SPARCStation2. Face recognition performance criteria, specifically, the capabilities to isolate and resize faces in an image to a consistent scale, were analyzed to determine current practical limitations. Face images were acquired using a S-VHS camcorder. Segmentation was accomplished using motion detection and predefined rules. Tests were run to determine the suitable of the autonomous segmentor as the front-end to a face recognition system. The segmentation system developed consistently located faces and rescaled those faces to a …

Minimum Separation For Single-Layer Channel Routing, Ronald I. Greenberg, F. Miller Maley

Computer Science: Faculty Publications and Other Works

We present a linear-time algorithm for determining the minimum height of a single-layer routing channel. The algorithm handles single-sided connections and multiterminal nets. It yields a simple routability test for single-layer switchboxes, correcting an error in the literature.

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 …

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 …

Neural Modeling And Control Of A Distillation Column, James Edward Steck, K. Krishnamurthy, Bruce M. Mcmillin, Gary G. Leininger

Mechanical and Aerospace Engineering Faculty Research & Creative Works

Control of a nine-stage three-component distillation column is considered. The control objective is achieved using a neural estimator and a neural controller. The neural estimator is trained to represent the chemical process accurately, and the neural controller is trained to give an input to the chemical process which will yield the desired output. Training of both the neural networks is accomplished using a recursive least squares training algorithm implemented on an Intel iPSC/2 multicomputer (hypercube). Simulated results are presented for a numerical example.

Text-Independent Automatic Speaker Identification Using Partitioned Neural Networks, Laszlo Rudasi

Electrical & Computer Engineering Theses & Dissertations

This dissertation introduces a binary partitioned approach to statistical pattern classification which is applied to talker identification using neural networks. In recent years artificial neural networks have been shown to work exceptionally well for small but difficult pattern classification tasks. However, their application to large tasks (i.e., having more than ten to 20 categories) is limited by a dramatic increase in required training time. The time required to train a single network to perform N-way classification is nearly proportional to the exponential of N. In contrast, the binary partitioned approach requires training times on the order of N². …

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 …

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.

Deterministic Approximations To Co-Production Problems With Service Constraints And Random Yields, Gabriel R. Bitran, Thin Yin Leong

Research Collection School Of Computing and Information Systems

Production planning problems where multiple item categories are produced simultaneously are examined. The items have random yields and are used to satisfy the demands of many products. These products have specification requirements that overlap. An item originally targeted to satisfy the demand of one product may be used to satisfy the demand of other products when it conforms to their specifications. Customers' demand must be satisfied from inventory. The problem is formulated with service constraints and a near-optimal solution is provided to the problem with a fixed planning horizon. Simple heuristics are proposed for the problem solved with a rolling …

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.

On Planar Routing Of Multi-Terminal Nets In Vlsi Physical Design, Jahangir A. Hashmi

Masters Theses

In this thesis, we study two problems related to the physical design of VLSI circuits. One problem is related to the VLSI global routing and the other is related to the detailed routing in a bounded region.

We consider the routing of multiple multi-terminal nets on a single layer. We suggest a new approach for this problem. Our approach is based on simultaneously finding a forest of k non-intersecting spanning trees. We present an O(n^3) algorithm for finding two spanning trees corresponding to two nets on a single layer.

We also study the problem of finding a minimum Steiner tree …

Formant Estimation From Dctc's Using A Feedforward Neural Network, Shubhangi U. Kelkar

Electrical & Computer Engineering Theses & Dissertations

Formants are the natural frequencies of the human vocal tract. Existing methods for estimating formants from speech signals are computationally complex and subject to errors for certain type of speech sounds. This thesis describes a method for estimating vowel formant frequencies from Discrete Cosine Transform Coefficients (DCTC's), a form of cepstral coefficients, using a feedforward neural network with back-propagation training. Experimental results are based on a large multispeaker data base. The results are obtained for both a linear transformation and a feedforward neural network with a nonlinear hidden layer. In general, the neural network transformation is superior to the linear …

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 …

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.

Hardware-Verification Through Logic Extraction, Michael A. Dukes

Theses and Dissertations

A Prolog-based system is described which employs logic-extraction to perform hardware-verification. The extraction rules are built automatically from hierarchical structural VHDL models, enabling the equivalence of a structural VHDL description and a layout specification to be verified. Pin-to-pin critical- path analysis is performed within the logic-extraction process; many noncritical paths are pruned early, making pin-to-pin critical path analysis of large circuits feasible. It is demonstrated that a design methodology based on logic extraction, VHDL, and a layout tool can provide a fabricated functionally- correct IC design without circuit-level or switch-level simulation. This methodology is shown to be practical for VLSI …

Causal Univariate Spatial-Temporal Autoregressive Moving Averages (Starma) Modelling Of Target Information To Generate Tasking Of A World-Wide Sensor System, Kelly A. Greene

Theses and Dissertations

The Department of Defense employs a resource limited world-wide sensor system to detect certain events of interest. The purpose of this research was to establish a methodology using a univariate causal STARMA model for forecasting the relative probability of an event occurring in a geographical location during a time block of the day. These relative probabilities are used as input for a tasking model that assigns the scarce sensor resources so as to optimize the detection of these events. The STARMA model is appropriate for forecasting the relative probabilities because a definite temporal relationship and a definite spatial relationship exists …

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 …

Finding A Maximum-Density Planar Subset Of A Set Of Nets In A Channel, Ronald I. Greenberg, Jau-Der Shih

Computer Science: Faculty Publications and Other Works

We present efficient algorithms to find a maximum-density planar subset of n 2-pin nets in a channel. The simplest approach is to make repeated usage of Supowit's dynamic programming algorithm for finding a maximum-size planar subset, which leads to O(n^3) time to find a maximum-density planar subset. But we also provide an algorithm whose running time is dependent on other problem parameters and is often more efficient. A simple bound on the running time of this algorithm is O(nlgn+n(t+1)w), where t is the number of two-sided nets, and w is the number of nets in the output. Though the worst-case …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 2, February 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.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 1, January 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.