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

Computer Engineering Commons

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

1991

Discipline
Institution
Keyword
Publication
Publication Type

Articles 1 - 30 of 42

Full-Text Articles in Computer Engineering

Resource Integration Using A Large Knowledge Base In Carnot, Christine Collet, Michael N. Huhns, Wei-Min Shen Dec 1991

Resource Integration Using A Large Knowledge Base In Carnot, Christine Collet, Michael N. Huhns, Wei-Min Shen

Faculty Publications

A method for integrating separately developed information resources that overcomes incompatibilities in syntax and semantics and permits the resources to be accessed and modified coherently is described. The method provides logical connectivity among the information resources via a semantic service layer that automates the maintenance of data integrity and provides an approximation of global data integration across systems. This layer is a fundamental part of the Carnot architecture, which provides tools for interoperability across global enterprises.


Modeling Electroplating Rinse Systems Using Equation-Solving Software, Andrew C. Hillier, Clifford W. Walton Oct 1991

Modeling Electroplating Rinse Systems Using Equation-Solving Software, Andrew C. Hillier, Clifford W. Walton

Andrew C. Hillier

Microcomputers are finding application in a vast array of academic and industrial settings, but are under-utilized in the electroplating industries. An often overlooked tool for computer simulation, for example, is equationsolving software. Such programs can predict the performance of a process system from basic mathematical relations without requiring the operator to have extensive knowledge of sophisticated programming and numerical solution techniques. A model of a multi-tank counter-current rinse system is described, then simulated with this software, and the results compared to actual plating facility rinse data, showing the excellent predictive qualities of this approach.


Dna Mapping Algorithms: Clone Sequencing, Judith H. Lewis, Will Gillett Oct 1991

Dna Mapping Algorithms: Clone Sequencing, Judith H. Lewis, Will Gillett

All Computer Science and Engineering Research

The DNA restriction mapping problem can be abstracted to the Shortest Common Matching String problem by viewing the restriction fragment lengths as symbols and the clones as bags. The Shortest Common Matching String problem can be decomposed into the Bag Sequencing problem and the Symbol Sequencing problem. All three of these problems have bene shown to be NP-hard. Rhee has proposed a family of greedy algorithms to compute polynomial time approximations to the Bag Sequencing problem, which produced surprisingly good performance results on abstracted data. In the test data generated by Rhee for pragmatic analysis, the symbols in bags represented ...


Center For Computer And Information Sciences Master Of Science In Computer Computer Science Fall Courses 1991, Nova Southeastern University Oct 1991

Center For Computer And Information Sciences Master Of Science In Computer Computer Science Fall Courses 1991, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.


Equivalent Capacity And Its Application To Bandwidth Allocation In High-Speed Networks, Roch A. Guérin, Hamid Ahmadi, Mahmoud Naghshineh Sep 1991

Equivalent Capacity And Its Application To Bandwidth Allocation In High-Speed Networks, Roch A. Guérin, Hamid Ahmadi, Mahmoud Naghshineh

Departmental Papers (ESE)

High-speed fast-packet-switched network architectures are capable of supporting a wide range of connections with different bandwidth requirements and traffic characteristics. While this environment provides increased flexibility in supporting various services, its dynamic nature poses difficult traffic control problems when trying to achieve efficient use of network resources. One such a problem is the issue of bandwidth management and allocation. Because of the statistical multiplexing of all connections at the physical layer and the variations of connections bit rate, it is important to characterize, for a given Grade-Of-Service (GOS), both the effective bandwidth requirement of a single connection and the aggregate ...


Rapid Display Of Radiographic Images, Jerome R. Cox Jr., Stephen M. Moore, Robert A. Whitman, G. James Blaine, R. Gilbert Jost, L. Magnus Karlsson, Thomas L. Monsees, Gregory L. Hansen, Timothy C. David Jul 1991

Rapid Display Of Radiographic Images, Jerome R. Cox Jr., Stephen M. Moore, Robert A. Whitman, G. James Blaine, R. Gilbert Jost, L. Magnus Karlsson, Thomas L. Monsees, Gregory L. Hansen, Timothy C. David

All Computer Science and Engineering Research

The requirements for the rapid display of radiographic images exceed the capabilities of widely available display, computer and communication technologies. Computed radiography captures data with a resolution of about four megapixels. Large format displays are available that can present over four megapixels. One megapixel displays are practical for use in combination with large format displays and in areas where the viewing task does not require primary diagnosis. This paper describes an electronic radiology system that approximates the highest quality systems, but through the use of several interesting techniques allows the possibility of its widespread installation throughout hospitals. The techniques uses ...


Converting Binary Thresholds Networks Into Equivalent Symmetric Networks, Gadi Pinkas Jul 1991

Converting Binary Thresholds Networks Into Equivalent Symmetric Networks, Gadi Pinkas

All Computer Science and Engineering Research

We give algorithms to convert any network of binary threshold units (that does not oscillate) into an equivalent network with symmetric weight matrix (like Hopfield networks [Hopfield 82] or Boltzmann machines [Hinton, Sejnowski 88]). The motivation for the transformation is dual: a) to demonstrate the expressive power of symmetric networks; i.e. binary threshold networks (that do not oscillate) are subsumed in the energy minimization paradigm; 2) to use network modules (developed for the spreading activation paradigm for example), within the energy minimization paradigm. Thus optimization [Tank, Hopfield 88] and approximation of hard problems can be combined with efficient modules ...


An Access Protection Solution For Heavy Load Unfairness In Dqdb, Lakshmana N. Kumar, Andreas D. Bovopoulos Jul 1991

An Access Protection Solution For Heavy Load Unfairness In Dqdb, Lakshmana N. Kumar, Andreas D. Bovopoulos

All Computer Science and Engineering Research

This paper discusses the unfairness issue arising in a 802.6 DQDB network at high loads-- when the traffic demand to a bus exceeds the capacity of that bus.

As per the 802.6 protocol, at heavy loads, the end nodes along a bus experience longer delays than the other nodes. The origin and remedy of this heavy load unfairness is discussed. An access control scheme is proposed as a solution. The comparison of the proposed scheme with 802.6 protocol is presented. The simulation results and performance characteristics are discussed under several types of loads.

With symmetric load conditions ...


The Spectrum Simulation System: A Formal Approach To Distributed Algorithm Development Tools, Kenneth J. Goldman Jul 1991

The Spectrum Simulation System: A Formal Approach To Distributed Algorithm Development Tools, Kenneth J. Goldman

All Computer Science and Engineering Research

We present the Spectrum Simulation System, a new research tool for the design and study of distributed algorithms. Based on the formal Input/Output Automation model of Lynch and Tuttle, Spectrum allows one to express distributed algorithms as collections of I/O automata and simulate them directly in terms of the semantics of that model. This permits integration of algorithm specification, design, debugging, analysis, and proof of correctness within a single formal framework that is natural for describing distributed algorithms. Spectrum provides a language for expressing algorithms as I/O automata, a simulator for generating algorithm executions, and a graphics ...


Composition, Superposition, And Encapsulation In The Formal Specification Of Distributed Systems, Kenneth J. Goldman Jul 1991

Composition, Superposition, And Encapsulation In The Formal Specification Of Distributed Systems, Kenneth J. Goldman

All Computer Science and Engineering Research

Composition, superposition, and encapsulation are important techniques that work well together for designing large distributed software systems. Composition is a symmetric operator that allows system components to communicate with each other across module boundaries. Superposition is an asymmetric relationship that allows one system component to observe the state of another. Encapsulation is the ability to define the reason about the behavior of a module in terms of a well-defined boundary between that module and its environment, while hiding the internal operations of that module.

In this paper, the I/O automation model of Lynch and Tuttle is extended to permit ...


Center For Computer And Information Sciences Master Of Science In Computer Science Summer Courses 1991, Nova Southeastern University Jul 1991

Center For Computer And Information Sciences Master Of Science In Computer Science Summer Courses 1991, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.


Center For Computer And Information Sciences Master Of Science In Computer Information Systems Summer Courses 1991, Nova Southeastern University Jul 1991

Center For Computer And Information Sciences Master Of Science In Computer Information Systems Summer Courses 1991, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.


The Difficulty Of Random Attribute Noise, Sally A. Goldman, Robert H. Sloan Jun 1991

The Difficulty Of Random Attribute Noise, Sally A. Goldman, Robert H. Sloan

All Computer Science and Engineering Research

This paper studies the robustness of pac learning algorithms when the instance 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 the truth lies somewhere between the two alternatives. For uniform attribute noise, in which each attribute is flipped independently at random with the same probability, we present an algorithm that pac ...


Dna Mapping Algorithms: Abstract Data Types - Concepts And Implementation, Will Gillett, Liz Hanks Jun 1991

Dna Mapping Algorithms: Abstract Data Types - Concepts And Implementation, Will Gillett, Liz Hanks

All Computer Science and Engineering Research

The conceptual aspects of and the implementation details of a set of self-identifying abstract data types (ADT) are described. Each of the ADTs constitutes a specific class of object, upon which a set of well-defined access functions is available. The intent of these ADTs is to supply a paradigm in which a class of object is available for manipulation, but in which the underlying implementation is hidden from the application programmer.

Specific ADTs are the described in some detail. The tagged architecture used to achieve the self-identifying property of the ADTs is presented, and a set of required system-backbone access ...


Computational Learning Theory Lecture Notes For Cs 582 Spring Semester, 1991, Sally A. Goldman Jun 1991

Computational Learning Theory Lecture Notes For Cs 582 Spring Semester, 1991, Sally A. Goldman

All Computer Science and Engineering Research

This manuscript is a compilation of lecture notes from the graduate level course CS 582, "Computational Learning Theory," I taught at Washington University in the spring of 1991. Students taking the course were assumed to have background in the design and analysis of algorithms as well as good mathematical background. Given that there is no text available on this subject, the course material was drawn from recent research papers. I selected the first twelve topics and the remainder were selected by the students from a list of provided topics. This list of topics is given at the end of these ...


Applying Formal Verification Methods To Pure Rule-Based Programs, Rose F. Gamble, Gruia-Catalin Roman, William E. Ball, H. Conrad Cunningham May 1991

Applying Formal Verification Methods To Pure Rule-Based Programs, Rose F. Gamble, Gruia-Catalin Roman, William E. Ball, H. Conrad Cunningham

All Computer Science and Engineering Research

Reliability, defined as the guarantee that a program satisfies its specifications, is an important aspect of many applications for which rule-based expert systems are suited. Verification refer to the process used to determine the reliability of the rule-based program. Because past approaches to verification are informal, guarantees of reliability cannot fully be made without severely restricting the system. On the other hand, by constructing formal specifications for a program and showing the program satisfies those specifications, guarantees of reliability can be made.

This paper presents an assertional approach to the verification of rule-based programs. The proof logical needed for verification ...


Center For Computer And Information Sciences Master Of Science In Computer Science Spring 1991, Nova Southeastern University Apr 1991

Center For Computer And Information Sciences Master Of Science In Computer Science Spring 1991, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.


An Improved Method For Online Calculation And Compensation Of The Static Deflection At A Robot End-Effector, Paul P. Lin, Hsiang-Dih Chiang, Xiu Xun Cui Apr 1991

An Improved Method For Online Calculation And Compensation Of The Static Deflection At A Robot End-Effector, Paul P. Lin, Hsiang-Dih Chiang, Xiu Xun Cui

Mechanical Engineering Faculty Publications

Traditionally, robotic deflection analysis for a low-weight robot has been performed based on an assumption that each link is treated as a cantilever beam, which leads to no angular deflection at a joint. In practice, a robotic intermediate joint is linearly and angulary deflected when a load is applied at the end-effector. It is found in this study that the additional link deflection resulting from the angular deflection of a robotic revolute joint substantially contributes to the end-effector's total deflection. This article presents an improved method via a combination of classical beam theory, energy methods and the concepts of ...


Dna Mapping Algorithms: Topological Mapping, Kenneth Moorman, Paul Poulosky, Will Gillett Mar 1991

Dna Mapping Algorithms: Topological Mapping, Kenneth Moorman, Paul Poulosky, Will Gillett

All Computer Science and Engineering Research

There are several basic approaches that can be used in attempting to produce high-resolution DNA restriction maps. A standard approach is the match/merge approach in which first the topology of the map units being mapped together is suppressed and lists of potential matches between fragments are generated, and second the topology is introduced to eliminate matchlists which are inconsistent with the topology. This technical report documents a different approach to DNA mapping, known as topological mapping.

In topological mapping the precedence of the two criteria are reversed, i.e., the topology of the two map units is used as ...


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

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


Performance Evaluation Of A Traffic Control Mechanism For Atm Networks, Andreas D. Bovopoulos Feb 1991

Performance Evaluation Of A Traffic Control Mechanism For Atm Networks, Andreas D. Bovopoulos

All Computer Science and Engineering Research

Future ATM networks will be required to support a plethora of services, transaction types and cell sequence behaviors with performance guarantees. Before this goal can be realized, however, some basically problems related to bandwidth allocation and traffic control in the ATM layer must be resolve. Such problems will in all likelihood defy solution as long as they studied in isolation without a unifying traffic characterization and traffic control framework.

This work presented in this paper is part of an ongoing effort directed at the development of an integrated traffic characterization and control infrastructure for ATM networks. In this paper a ...


Saam: The Strategic Asset Allocation Model, Judy Lewis, Todd Gamble, John Tai Feb 1991

Saam: The Strategic Asset Allocation Model, Judy Lewis, Todd Gamble, John Tai

All Computer Science and Engineering Research

Asset Allocation has become a dominant factor for investment strategies in recent years. It has found that by holding a strategically diversified portfolio, a high total return on investments can be maintained while, at the same time, reducing portfolio volatility. With recent federal regulations mandating pension investment responsibilities, appropriate asset allocation has become more important than ever.

SAAM is a software package specifically designed to be used as a tool to aid the investment professional in determining pension portfolio allocations. SAAM uses the expect system shell CLIPS, has a user-friendly interface, displays output graphically, and runs within the confines of ...


Performance Analysis Of The Ethernet Under Conditions Of Bursty Traffic, Tony Y. Mazraani, Gurudatta M. Parulkar Feb 1991

Performance Analysis Of The Ethernet Under Conditions Of Bursty Traffic, Tony Y. Mazraani, Gurudatta M. Parulkar

All Computer Science and Engineering Research

In this paper we present a simulation study of the Ethernet performance under conditions of bursty traffic. This study is motivated by two observations: Ethernet will continue to be a widely used Local Area Network (LAN), especially as an access LAN for future high speed internet (or Broadband ISDN); and future high speed applications can best be modeled as bursty sources. Bursty traffic in this study is specified using three parameters: peak bandwidth, average bandwidth, and burst factor. The simulation study shows that the inherent behavior of the Ethernet does not change with bursty traffic. That is, as long as ...


Center For Computer And Information Sciences 1991, Nova Southeastern University Jan 1991

Center For Computer And Information Sciences 1991, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.


Master Of Science, Computer Science 1991, Nova Southeastern University Jan 1991

Master Of Science, Computer Science 1991, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.


Center For Computer And Information Sciences Master Of Science In Computer Information Systems Fall Courses 1991, Nova Southeastern University Jan 1991

Center For Computer And Information Sciences Master Of Science In Computer Information Systems Fall Courses 1991, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.


Simple Synchronous Detector For Spectroscopic Studies, Mokhtar Mofidi, M. Keith Hudson, Reagan Cole, James D. Wilson Jan 1991

Simple Synchronous Detector For Spectroscopic Studies, Mokhtar Mofidi, M. Keith Hudson, Reagan Cole, James D. Wilson

Journal of the Arkansas Academy of Science

Lock-in-amplifiers are used in many applications for signal processing and offer the ability to discriminate high levels of noise. While these instruments are very powerful and offer many features, they are not portable and are expensive. An economical and easy to use alternative circuit is presented which incorporates pre-amplification, reference, and synchronous detection on one circuit board. The design can be used in laboratory or process control situations where its small size and low cost are advantageous. The circuit was successfully applied to moderate and high level signals as seen in flame infrared emission detection and in a portable radiometer ...


Pthomas: An Adaptive Information Retrieval System On The Connection Machine., Robert Oddy, Bhaskaran Balakrishnan Jan 1991

Pthomas: An Adaptive Information Retrieval System On The Connection Machine., Robert Oddy, Bhaskaran Balakrishnan

School of Information Studies - Faculty Scholarship

This paper reports the state of development of PThomas, a network based document retrieval system implemented on a massively parallel fine-grained computer, the Connection Machine. The program is written in C*, an enhancement of the C programming language which exploits the parallelism of the Connection Machine. The system is based on Oddy’s original Thomas program, which was highly parallel in concept, and makes use of the Connection Machine’s single instruction multiple data (SIMD) processing capabilities. After an introduction to systems like Thomas, and their relationship to spreading activation and neural network models, the current state of PThomas is ...


Center For Computer And Information Sciences Master Of Science In Computer Information Systems Spring Courses 1991, Nova Southeastern University Jan 1991

Center For Computer And Information Sciences Master Of Science In Computer Information Systems Spring Courses 1991, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.


Design Of An Isdn Central Office, U-Interface, Timothy N. Toillion Jan 1991

Design Of An Isdn Central Office, U-Interface, Timothy N. Toillion

Retrospective Theses and Dissertations

No abstract provided.