Digital Commons Network^™

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 …

A Software Design Tool For Predictable Performance In Real-Time, Data Flow Architectures, Brij Mohan V. Mandala

Electrical & Computer Engineering Theses & Dissertations

A software design tool which aids in the performance evaluation and selection of operating points for an algorithm implemented in ATAMM defined data flow architectures is presented in this thesis. ATAMM (Algorithm To Architecture Mapping Model) is a new graph theoretic model developed by researchers at Old Dominion University and the NASA-Langley Research Center. ATAMM is capable of modeling the execution of large-grained algorithms on distributed data flow architectures. A software tool is required for predicting the performance, determining the resource requirements and for selecting suitable operating points for an ATAMM based system. The ATAMM Design Tool presented in this …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, September 1990, 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.

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

Visual Speech Training Aid For The Deaf, Subhashri Venkat

Electrical & Computer Engineering Theses & Dissertations

A computer-based vowel articulation training aid has been developed. A "continuous" acoustic-phonetic transformation is performed to map speech parameters to a lower dimensionality display space. There are two possible approaches to this transformation problem. The transformation could be either linear or a combination nonlinear/linear. The nonlinear transformation is performed using a multi-layered feedforward neural network with linear output layers. Speech parameters are extracted either from an analog filter bank arrangement (band energies) or by a digital signal processing procedure (Discrete Cosine Transform Coefficients). The speech parameters obtained from both methods correspond to the spectral envelope of the speech signals. The …

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, College Of Engineering And Computer Science, Wright State University

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

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

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.

Diagnostics Software For Concurrent Processing Computer Systems, Robert L. Jones Iii

Electrical & Computer Engineering Theses & Dissertations

Diagnostics software for analyzing ATAMM based concurrent processing systems is presented in this thesis. ATAMM (Algorithm to Architecture Mapping Model) is a new model developed by researchers at Old Dominion University and the NASA-Langley Research Center. ATAMM is capable of modeling the execution of large grain algorithms on distributed data flow architectures. Investigating a real or simulated ATAMM based system requires the aid of software tools. The software tool presented in this thesis can evaluate the behavior and performance of an ATAMM based system. The tool graphically portrays algorithm activities and processor activities. The tool's measurement capabilities indicate computing speed, …

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

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

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, 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, January 1990, 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.

Counterpropagation Neural Network Detection Of Visual Primitives, Cynthia Lynn Johnson

Retrospective Theses and Dissertations

Psychological testing has shown that there is an early preattentive stage in the human visual system. At this level, simple features and properties of objects known as visual primitives are detected spatially in parallel by groupings of cells in the visual cortex known as feature maps. In order to study this preattentive stage in a machine vision system, the biologically inspired, highly parallel architecture of the artificial neural network shows great promise. This paper describes how the unique architecture of the counterpropagation neural network was used to simulate the feature maps which detect visual primitives in the human visual system. …

Application Of Case-Based Reasoning Techniques To The Automation Of Single-Family Residential Property Appraisals, Raymond Laureano-Ortiz

Retrospective Theses and Dissertations

Case-based reasoning has emerged as an alternative to rule-based reasoning techniques for the design of expert systems. This paper concentrates on the issues involved in the application of the case-based reasoning techniques to a specific domain, property appraisal. Case-based reasoning has been recently favored because it seems to resemble more closely to the psychological process human follows when trying to apply their knowledge to the solution of problems: People adapt solutions of similar problems they handled in past experiences to address present situations.

Property appraisal or valuation is a domain characterized by having a single parameter in its solution, that …

Master Of Science In Computer Science, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

Computer Education Complete Masters Program, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

Bachelors In Computer Science Course Descriptions, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

Center For Computer And Information Sciences Application Package 1990, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

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) A …

Measurement Of The C+ Decay-Asymmetry Parameter, Avery, P.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

We report a measurement of polarization in the two-body decay c+, in nonresonant e+e- interactions from data taken with the CLEO detector. Using these data we have determined the parity-violating asymmetry decay parameter c to be -1.0-0.0+0.4. We see no evidence for significant c+ polarization.

Observation Of B-Meson Semileptonic Decays To Noncharmed Final States, Fulton, R.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Observation Of Iv(4=S) Decays Into Non-=Bba Final States Containing I Mesons, Alexander, J.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

We report on the observation of ; mesons from T(4S) decays which are too energetic to come from 8 mesons. These events provide evidence for non-88 decays of the T (4S). The measured rate is B(T(4S)+fX)=0.22•0.06•0.041 for ; momentum above 2 GeV/c.

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 Methodology For Developing Correct Rule-Based Programs For Parallel Implementation, Rosanne Fulcomer Gamble

All Computer Science and Engineering Research

Production systems, also called rule-based systems, are very useful in automating certain human expert tasks, but the current technology exhibits many problems. We believe that parallelism is difficult to exploit in production system programs for two reasons. First, the original serial programs are designed with a priori knowledge of an explicit global control mechanism which must be simulated for correct execution in parallel. The second reason for the difficulty is that no formal language exists in which to express these programs and no verification techniques are utilized to prove properties which guarantee correct execution in parallel. With these two obstacles …

The Display And Manipulation Of Temporal Information, Steve B. Cousins, Michael G. Kahn Washington University In St. Louis, Mark E. Frisse Washington University In St. Louis

All Computer Science and Engineering Research

Because medical data have complex temporal features, special techniques are required for storing, retrieving, and displaying clinical data from electronic databases. One significant problem caused by the temporal nature of medical data has been called the temporal granularity problem. The temporal granularity problem is said to occur when the set of facts relevant to a specific problem changes as the time scale changes. We argue that what is needed to deal with changes in the relevant time scale are temporal granularity heuristics. One heuristic that we have explored is that, for any level of problem abstraction, and for each type …

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

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.