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

Digital Commons Network™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 26971 - 27000 of 27652

Full-Text Articles in Entire DC Network

Human-Machine Interface For Tactical Air Traffic Control Communications, Alan Mastin Jan 1990

Human-Machine Interface For Tactical Air Traffic Control Communications, Alan Mastin

UNF Graduate Theses and Dissertations

This thesis proposes the design for a prototype device that would be used by Air Traffic Controllers in the radar environment to input tactical Air Traffic Control (ATC) instructions to be sent to aircraft via the Mode S digital data link network. The purpose of the device is to reduce the time required to issue instructions and to eliminate misunderstandings that occur when instructions are issued over voice transmission frequencies. The purpose of this thesis was to develop the device in the most ergonomically suited manner based on the air traffic controller's communications requirements. Digital communications systems include both airborne …


Design Of A Dynamically Reconfigurable, Integrated, Parallel Vision System, Ashok K. Samal Jan 1990

Design Of A Dynamically Reconfigurable, Integrated, Parallel Vision System, Ashok K. Samal

School of Computing: Conference and Workshop Papers

Multiprocessors can be used to speed up the process of object recognition. Building a parallel vision system is a two step process: (a) design and implement parallel algorithms for individual operations, and (b) integrate them into a coherent system. So far the emphasis has been on the first step. The second step has not received enough attention. A framework for building a parallel vision system is presented here. The necessary and desirable features of such a system have been identified. An initial design which incorporates these features is also given.


High-Level Microprogramming: An Optimising C Compiler For A Processing Element Of A Cad Accelerator, Paul Kenyon, Prathima Agrawal, Sharad C. Seth Jan 1990

High-Level Microprogramming: An Optimising C Compiler For A Processing Element Of A Cad Accelerator, Paul Kenyon, Prathima Agrawal, Sharad C. Seth

School of Computing: Faculty Publications

The development of a high-level language compiler for a micro-programmable processing element (PE) in the MARS multicomputer is described. MARS, an MIMD message passing machine, was designed to speed up VLSI CAD and similar other non-numerical applications. The need for sup port of a high-level language at the PE level of a multicomputer is considered, and the choice of C as an appropriate programming language is justified. Special features found in VLSI processors are examined along with compiler support for them.

Conventional re-targetable compiler techniques are shown to be inadequate for the highly concurrent micro-programmable PE. These techniques must be …


Digital Image Processing Using Mathematical Morphology, Andrew Mehnert Jan 1990

Digital Image Processing Using Mathematical Morphology, Andrew Mehnert

Theses : Honours

This dissertation is a natural extension of my undergraduate research project entitled, "Digital Image Processing”. Whilst my undergraduate project dealt with a number of classical digital image filtering techniques such as spatial convolution and frequency domain filtering via the Fourier transform, this dissertation focuses on an alternative approach employing Mathematical Morphology. In contrast to classical filtering techniques, which often geometrically distort the original image, morphological operations, used sensibly, essentially preserve shape and geometry. Mathematical morphology therefore lends itself to image processing applications requiring the identification of objects and object features within an image. Herein basic morphological operations are developed, firstly …


Trellis-Coded Multidimensional Phase Modulation, S. S. Pietrobon, Robert H. Deng Jan 1990

Trellis-Coded Multidimensional Phase Modulation, S. S. Pietrobon, Robert H. Deng

Research Collection School Of Computing and Information Systems

A 2L-dimensional multiple phase-shift keyed (L×MPSK) signal set is obtained by forming the Cartesian product of L two-dimensional MPSK signal sets. A systematic approach to partitioning L×MPSK signal sets that is based on block coding is used. An encoder system approach is developed. It incorporates the design of a differential precoder, a systematic convolutional encoder, and a signal set mapper. Trellis-coded L×4PSK, L×8PSK, and L×16PSK modulation schemes are found for 1⩽L⩽4 and a variety of code rates and decoder complexities, many of which are fully transparent to discrete phase rotations of the signal set. The new codes achieve asymptotic coding …


Development Of An Expert System To Convert Knowledge-Based Geological Engineering Systems Into Fortran, Jill J. Cress, Ralph W. Wilkerson Dec 1989

Development Of An Expert System To Convert Knowledge-Based Geological Engineering Systems Into Fortran, Jill J. Cress, Ralph W. Wilkerson

Computer Science Technical Reports

A knowledge-based geographic information system (KBGIS) for geological engineering map (GEM) production was developed in GoldWorks, an expert system development shell. GoldWorks allows the geological engineer to develop a rule base for a GEM application. Implementation of the resultant rule base produced a valid GEM, but took too much time. This proved that knowledge-based GEM production was possible but in GoldWorks implementation failed as a practical production system. To solve this problem, a Conversion Expert System was developed which accepted, as input, a KBGIS and produced, as output, the equivalent Fortran code. This allowed the engineer to utilize GoldWorks for …


A Methodology For Developing Correct Rule-Based Programs For Parallel Implementation, Rosanne Fulcomer Gamble Dec 1989

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 …


A Computer Virus Primer, Eugene H. Spafford, Kathleen A. Heaphy, David J. Ferbrache Nov 1989

A Computer Virus Primer, Eugene H. Spafford, Kathleen A. Heaphy, David J. Ferbrache

Department of Computer Science Technical Reports

No abstract provided.


The Internet Worm Incident, Eugene H. Spafford Nov 1989

The Internet Worm Incident, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.


Efficient Geometric Algorithms In The Erew-Pram, Danny Z. Chen Nov 1989

Efficient Geometric Algorithms In The Erew-Pram, Danny Z. Chen

Department of Computer Science Technical Reports

No abstract provided.


An Extended Transaction Model For Multidatabase Systems, Yungho Leu, Ahmed K. Elmagarmid, Marek Rusinkiewicz Nov 1989

An Extended Transaction Model For Multidatabase Systems, Yungho Leu, Ahmed K. Elmagarmid, Marek Rusinkiewicz

Department of Computer Science Technical Reports

No abstract provided.


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

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.


On The Height Of Digital Trees And Related Problems, Wojciech Szpankowski Nov 1989

On The Height Of Digital Trees And Related Problems, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Transaction Accessibility And Integrity Issues In Heterogeneous Distributed Database Systems, Weimin Du, Ahmed K. Elmagarmid, Marek Rusinkiewicz Oct 1989

Transaction Accessibility And Integrity Issues In Heterogeneous Distributed Database Systems, Weimin Du, Ahmed K. Elmagarmid, Marek Rusinkiewicz

Department of Computer Science Technical Reports

No abstract provided.


Obtaining Boundaries With Respect: A Simple Approach To Performing Set Operations On Polyhedra, George Vanecek Oct 1989

Obtaining Boundaries With Respect: A Simple Approach To Performing Set Operations On Polyhedra, George Vanecek

Department of Computer Science Technical Reports

No abstract provided.


A Hierarchical Approach To Concurrency Control For Multidatabases, Ahmed K. Elmagarmid, Yunhho Leu Oct 1989

A Hierarchical Approach To Concurrency Control For Multidatabases, Ahmed K. Elmagarmid, Yunhho Leu

Department of Computer Science Technical Reports

No abstract provided.


Polygon Nesting And Robustness, Chanderjit Bajaj, Tamai Dey Oct 1989

Polygon Nesting And Robustness, Chanderjit Bajaj, Tamai Dey

Department of Computer Science Technical Reports

No abstract provided.


Proof Of A Mutual Exclusion Algorithm-- A `Class'ic Example, Micha Hofri Oct 1989

Proof Of A Mutual Exclusion Algorithm-- A `Class'ic Example, Micha Hofri

Department of Computer Science Technical Reports

No abstract provided.


Efficient Heap Implementation With A Fixed-Size Linear Systolic Array, Jyh-Jong Tsay Oct 1989

Efficient Heap Implementation With A Fixed-Size Linear Systolic Array, Jyh-Jong Tsay

Department of Computer Science Technical Reports

No abstract provided.


Optical Machine Recognition Of Lower-Case Greek Characters Of Any Size, Ivan X. D. D'Cunha Oct 1989

Optical Machine Recognition Of Lower-Case Greek Characters Of Any Size, Ivan X. D. D'Cunha

Electrical & Computer Engineering Theses & Dissertations

An algorithm utilizing a syntactic approach and a criterion based on normalized moments is defined for the reliable, automatic, machine recognition of handwritten and printed Greek characters of any size and font. In this approach a binary image of the character in question is obtained initially; its skeleton is then produced by utilizing a standard thinning algorithm. The classification process then incorporates the topological features of the characters such as existence of closed curves, number of intersections, number and location of free ends, axial symmetry, and the criteria derived from normalized moments to uniquely identify each pattern. Experiments conducted demonstrated …


High Rate Concatenated Coding Systems Using Multidimensional Bandwidth Efficient Inner Codes, Robert H. Deng, Daniel J. Jr. Costello Oct 1989

High Rate Concatenated Coding Systems Using Multidimensional Bandwidth Efficient Inner Codes, Robert H. Deng, Daniel J. Jr. Costello

Research Collection School Of Computing and Information Systems

A concatenated coding system using two-dimensional trellis-coded MPSK inner codes and Reed-Solomon outer codes for application in high-speed satellite communication systems was proposed previously by the authors (ibid., vol.37, no.5, p.420-7, May 1989). The authors extend their results to systems using symbol-oriented, multidimensional, trellis-coded MPSK inner codes. The concatenated coding systems are divided into two classes according to their achievable effective information rates. The first class uses multidimensional trellis-coded 8-PSK inner codes and achieves effective information rates around 1 b/dimension (spectral efficiency 2 b/s/Hz). The second class employs multidimensional trellis-coded 16-PSK inner codes and provides effective information rates around 1.5 …


Design Considerations For Distributed Scientific Software Systems, Paul E. Buis Sep 1989

Design Considerations For Distributed Scientific Software Systems, Paul E. Buis

Department of Computer Science Technical Reports

No abstract provided.


The Set Union Problem With Unlimited Backtracking, Alberto Apostolico, Guiseppe F. Italiano, Giorgio Gambosi, Maurizic Talamo Sep 1989

The Set Union Problem With Unlimited Backtracking, Alberto Apostolico, Guiseppe F. Italiano, Giorgio Gambosi, Maurizic Talamo

Department of Computer Science Technical Reports

No abstract provided.


Virtual Memory For Diskless Desktop Workstations, Douglas E. Comer, James Griffioen Sep 1989

Virtual Memory For Diskless Desktop Workstations, Douglas E. Comer, James Griffioen

Department of Computer Science Technical Reports

No abstract provided.


Curvature Adjusted Parameterization Of Curves, Richard R. Patterson, Chanderjit Bajaj Sep 1989

Curvature Adjusted Parameterization Of Curves, Richard R. Patterson, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.


A Mathematical Treatment Of Defeasible Reasoning And Its Implementation, Guillermo R. Simari, R. P. Loui Sep 1989

A Mathematical Treatment Of Defeasible Reasoning And Its Implementation, Guillermo R. Simari, R. P. Loui

All Computer Science and Engineering Research

We present a mathematical approach to defeasible reasoning. This approach is based on the notion of specificity introduced by Poole and the theory of warrant presented by Pollock. We combine the ideas of the two. This main contribution of this paper is a precise well-defined system which exhibits correct behavior when applied to the benchmark examples in the literature. We prove that an order relation can be introduced among equivalence classes under the equi-specificity relation. We also prove a theorem that ensures the termination of the process of finding the justified facts. Two more lemmas define a reduced search space …


An Optimal Parallel Algorithm For The Minimum Circle-Cover Problem, Mikhail J. Atallah, Danny Z. Chen Sep 1989

An Optimal Parallel Algorithm For The Minimum Circle-Cover Problem, Mikhail J. Atallah, Danny Z. Chen

Department of Computer Science Technical Reports

No abstract provided.


Efficient Interconnection Schemes For Vlsi And Parallel Computation, Ronald I. Greenberg Sep 1989

Efficient Interconnection Schemes For Vlsi And Parallel Computation, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

This thesis is primarily concerned with two problems of interconnecting components in VLSI technologies. In the first case, the goal is to construct efficient interconnection networks for general-purpose parallel computers. The second problem is a more specialized problem in the design of VLSI chips, namely multilayer channel routing. In addition, a final part of this thesis provides lower bounds on the area required for VLSI implementations of finite-state machines. This thesis shows that networks based on Leiserson's fat-tree architecture are nearly as good as any network built in a comparable amount of physical space. It shows that these "universal" networks …


Optimal Canonization Of All Substrings Of A String, A. Apostolico, M. Crochemore Aug 1989

Optimal Canonization Of All Substrings Of A String, A. Apostolico, M. Crochemore

Department of Computer Science Technical Reports

No abstract provided.


Two-Dimensional Pattern Matching With K Mismatches, Sanjay Ranka, Todd Heywood Aug 1989

Two-Dimensional Pattern Matching With K Mismatches, Sanjay Ranka, Todd Heywood

Electrical Engineering and Computer Science - Technical Reports

We give an algorithm which finds all occurrences of an m1 x m2 pattern array embedded as subarrays in an n1 x n2 array of text, where at most k mismatches are allowed per occurrence. The algorithm runs in time O((k+a)(blogb+ n1n2)), where a = min(m1m2) and b=max(m1m2). This improves upon the previously best known algorithm, and is asymptotically optimal for k ≈ a.