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

Computer Engineering Commons

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

Articles 1 - 18 of 18

Full-Text Articles in Computer Engineering

A Multi-Scale Approach For Recognizing Complex Annotations In Engineering Documents., Andrew Francis Laine, William Ball, Arun Kumar Dec 1990

A Multi-Scale Approach For Recognizing Complex Annotations In Engineering Documents., Andrew Francis Laine, William Ball, Arun Kumar

All Computer Science and Engineering Research

This paper describes a novel method of character recognition targeted for extracting complex annotations found in engineering documents. The results of this work will make it possible to capture the information contained in documents used to support facilities management and manufacturing. The recognition problem is made difficult in part because characters and text may be expressed in arbitrary fonts and orientations. Our approach includes a novel incremental strategy based on the multi-scale representation of wavelet decompositions. Our approach is motivated by biological mechanisms of the human visual systems. Using wavelets as a set of basis functions, we may decompose an ...


Segment Streaming For Efficient Pipelined Televisualization, Fengmin Gong Nov 1990

Segment Streaming For Efficient Pipelined Televisualization, Fengmin Gong

All Computer Science and Engineering Research

The importance of scientific visualization for both science and engineering endeavors has been well recognized. Televisualization becomes necessary because of the physical distribution of data, computation resources, and users involved in the visualization process. However, televisualization poses a number of challenges to the designers of communication protocols. A pipelined televisualization (PTV) model is proposed for efficient implementation of a class of visualization applications. Central to the proposed research is the development of a segment of streaming IPC (interprocess communication) mechanism in support of efficient pipelining across very high speed internetworks. This requires exploration of special issues arising from extending a ...


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, November 1990, Wright State University College Of Engineering And Computer Science Nov 1990

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, November 1990, Wright State University College Of Engineering And Computer Science

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.


Highly Concurrent Logically Synchronous Multicast, Kenneth J. Goldman Oct 1990

Highly Concurrent Logically Synchronous Multicast, Kenneth J. Goldman

All Computer Science and Engineering Research

We define the logically synchronous multicast problem, which imposes a natural and useful structure on message delivery order in an asynchronous system. In this problem, a computation proceeds by a sequence of multicasts, in which a process sends a message to some arbitrary subset of the processes, including itself. A logically synchronously multicast protocol must make it appear to every process as if each multicast occurs simultaneously at all participants of that multicast (sender plus receivers). Furthermore, if a process continually wishes to sends a message, it must eventually be permitted to do so. We present a highly concurrent solution ...


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, September 1990, Wright State University College Of Engineering And Computer Science Sep 1990

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, September 1990, Wright State University College Of Engineering And Computer Science

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.


Studies In The Hybrid Deterministic Parsing, Stan C. Kwasny, Anne M. Johnstone, Barry L. Kalman Sep 1990

Studies In The Hybrid Deterministic Parsing, Stan C. Kwasny, Anne M. Johnstone, Barry L. Kalman

All Computer Science and Engineering Research

This report details research plans to extend work on hybrid deterministic parsing. The approach is hybrid in its combination of symbolic and sub-symbolic (connectionist) approaches. The research is investigating (1) new and more robust architectures for deterministic parsing which are hybrid mixtures of symbolic and sub-symbolic components, (2) combinations of syntax with lexical access and other components of natural language processing in order to determine how the distributed patterns of connectionism may enable better interfaces among these components, and (3) properties of the rules in the rule-based deterministic processing of natural language that make them most suitable for sub-symbolic training ...


Super Linear Learning In Back Propagation Neural Nets, Barry L. Kalman Jun 1990

Super Linear Learning In Back Propagation Neural Nets, Barry L. Kalman

All Computer Science and Engineering Research

The important feature of this work is the combination of minimizing a function with desirable properties, using the conjugate gradient method (cgm). The method has resulted in significant improvements for both easy and difficult training tasks. Two major problems slow the rate at which large back propagation neural networks (bpnns) can be taught. First is the linear convergence of gradient descent used by modified steepest descent method (msdm). Second is the abundance of saddle points which occur because of the minimization of the sum of squared errors. This work offers a solution to both difficulties. The cgm which is super ...


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, May 1990, Wright State University College Of Engineering And Computer Science May 1990

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, May 1990, Wright State University College Of Engineering And Computer Science

BITs and PCs Newsletter

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


Btc Test Methodology, Gaurav Garg May 1990

Btc Test Methodology, Gaurav Garg

All Computer Science and Engineering Research

This paper describes the testing methodology for the Broadcast Translation Circuit. It covers logic simulation, timing simulation, and a single push-button test for the device. The document is intended to be a supplement to documents WUCS-89-52 and WUCS-90-19, which outline the design of the BTC in full details. The intent of a push-button test is to have a single test that causes the device to process every type of packets that it could receive. This would include various combination of RC and OP fields, a test that examines every table entry thoroughly, as well as a test of the parity ...


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, April 1990, Wright State University College Of Engineering And Computer Science Apr 1990

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, April 1990, Wright State University College Of Engineering And Computer Science

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 Fat-Pyramid: A Robust Network For Parallel Computation, Ronald I. Greenberg Apr 1990

The Fat-Pyramid: A Robust Network For Parallel Computation, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

This paper shows that a fat-pyramid of area Theta(A) built from processors of size lg A requires only O(lg^2 A) slowdown in bit-times to simulate any network of area A under very general conditions. Specifically, there is no restriction on processor size (amount of attached memory) or number of processors in the competing network, nor is the assumption of unit wire delay required. This paper also derives upper bounds on the slowdown required by a fat-pyramid to simulate a network of larger area in the case of unit wire delay.


The Equivalence Of Connectionist Energy Minimization And Propositional Calculus Satisfiability, Gadi Pinkas Apr 1990

The Equivalence Of Connectionist Energy Minimization And Propositional Calculus Satisfiability, Gadi Pinkas

All Computer Science and Engineering Research

Quadratic energy minimization is the essence of certain connectionist models. We define high order connectionist models to support the minimization of high order energy functions and we prove that high order energy functions are equivalent to quadratic ones. We show that the standard quadratic models can minimize high order functions using additional hidden units and we demonstrate trade-offs of size (number of hidden units), order of the model, and fan-out. We prove an equivalence between the problem of satisfiability in propositional calculus and the problem of minimization of energy functions. An energy function describes a Well Formed Formula (WFF) if ...


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, March 1990, Wright State University College Of Engineering And Computer Science Mar 1990

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, March 1990, Wright State University College Of Engineering And Computer Science

BITs and PCs Newsletter

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


The Wic Advisor: A Case Study In Medical Expert System Development, Elizabeth J. Mattson, Matthew M. Thomas, Sharon A. Trenz, Steve B. Cousins Mar 1990

The Wic Advisor: A Case Study In Medical Expert System Development, Elizabeth J. Mattson, Matthew M. Thomas, Sharon A. Trenz, Steve B. Cousins

All Computer Science and Engineering Research

This project provides a good case study of expert system development with untrained experts over a short period of time. We describe the development of a working medical screening and diagnosis expert system for use at the Women, Infants and Children (WIC) clinics in Madison County, Illinois. The system was designed and implemented over the period of four months. A large number of knowledge acquisition techniques were employed, some of them customized in ways that greatly increased their effectiveness. This paper explores the development of THE WIC Advisor, from problem definition through expert system delivery. The knowledge acquisition methods used ...


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, February 1990, Wright State University College Of Engineering And Computer Science Feb 1990

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, February 1990, Wright State University College Of Engineering And Computer Science

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.


Pipelining Data Compression Algorithms, R. L. Bailey, R. Mukkamala Jan 1990

Pipelining Data Compression Algorithms, R. L. Bailey, R. Mukkamala

Computer Science Faculty Publications

Many different data compression techniques currently exist. Each has its own advantages and disadvantages. Combining (pipelining) multiple data compression techniques could achieve better compression rates than is possible with either technique individually. This paper proposes a pipelining technique and investigates the characteristics of two example pipelining algorithms. Their performance is compared with other well-known compression techniques.


A Simulation Testbed For Image Compression Algorithms, Andrew Francis Laine Jan 1990

A Simulation Testbed For Image Compression Algorithms, Andrew Francis Laine

All Computer Science and Engineering Research

This paper presents an overview of the design and development of a real-time (30 frames/sec) simulation testbed for evaluating and comparing image compression algorithms. The system was motivated by the need to visualize the performance of a novel compression algorithm when operating on moving pictures originating from "live" video sources. The simulation utilities are designed to exploit the parallelism of a Pixar Image Computer and high-throughput of a parallel disk assembly. The design of two key utilities are discussed: (1) A program to format precomputed four channel (RGBA) 256 X 256 color frames onto a parallel disk assembly. (2 ...


Parallel Machines: Parallel Machine Languages, Robert Iannucci Dec 1989

Parallel Machines: Parallel Machine Languages, Robert Iannucci

Robert A Iannucci

No abstract provided.