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

Computer Engineering Commons

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

1994

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 1 - 30 of 58

Full-Text Articles in Computer Engineering

Fault Tolerant Medical Network (Mednet), Hamid Ghassemi Nov 1994

Fault Tolerant Medical Network (Mednet), Hamid Ghassemi

FIU Electronic Theses and Dissertations

This investigation describes the development of a new fault tolerant Medical Network (MEDNET) model based on the existing Public Switch Telephone Network (PSTN), Integrated Services Digital Network (ISDN) and Intemetworking (Internet). This research includes the original design, development and testing of the required hardware and software interfaces to provide a complete Medical Network model. MEDNET ties the Doctor, the Patient, the Hospital, the Medical Lab, and the Pharmacy for near real time and fault tolerant exchange of medical information. The MEDNET model includes the following modules: 1 Central Database Server, 2. Remote Client Access, and 3. Communication Interface. This work ...


Automating Workflows For Service Provisioning: Integrating Ai And Database Technologies, Munindar P. Singh, Michael N. Huhns Oct 1994

Automating Workflows For Service Provisioning: Integrating Ai And Database Technologies, Munindar P. Singh, Michael N. Huhns

Faculty Publications

Workflows are the structured activities that take place in information systems in typical business environments. These activities frequently involve several database systems, user interfaces, and application programs. Traditional database systems do not support workflows to any reasonable extent: usually human beings must intervene to ensure their proper execution. We have developed an architecture based on AI technology that automatically manages workflows. This architecture, which executes on top of a distributed computing environment, has been applied to automating service provisioning workflows; an implementation that operates on one such workflow has been developed. This work advances the Carnot Project’s goal of ...


Reference Architecture For Machine Control Systems Integration: Interim Report, M Senehi, Thomas Kramer, John Michaloski, Richard Quintero, Steven Ray, William Rippey, Sarah Wallace Sep 1994

Reference Architecture For Machine Control Systems Integration: Interim Report, M Senehi, Thomas Kramer, John Michaloski, Richard Quintero, Steven Ray, William Rippey, Sarah Wallace

Steven R Ray

No abstract provided.


Objects To The Rescue! Or Httpd: The Next Generation Operating System, Andrew P. Black, Jonathan Walpole Sep 1994

Objects To The Rescue! Or Httpd: The Next Generation Operating System, Andrew P. Black, Jonathan Walpole

Computer Science Faculty Publications and Presentations

This position paper suggests that object-oriented operating systems may provide the means to meet the ever-growing demands of applications. As an example of a successful OOOS, we cite the http daemon. To support the contention that httpd is in fact an operating system, we observe that it implements uniform naming, persistent objects and an invocation meta-protocol, specifies and implements some useful objects, and provides a framework for extensibility.We also believe that the modularity that is characteristic of OO systems should provide a performance benefit rather than a penalty. Our ongoing work in the Synthetix project at OGI is exploring ...


System And Method For Non-Destructive Evaluation Of Surface Characteristics Of A Magnetic Material, David C. Jiles, Levent B. Sipahi May 1994

System And Method For Non-Destructive Evaluation Of Surface Characteristics Of A Magnetic Material, David C. Jiles, Levent B. Sipahi

Iowa State University Patents

A system and a related method for non-destructive evaluation of the surface characteristics of a magnetic material. The sample is excited by an alternating magnetic field. The field frequency, amplitude and offset are controlled according to a predetermined protocol. The Barkhausen response of the sample is detected for the various fields and offsets and is analyzed. The system produces information relating to the frequency content, the amplitude content, the average or RMS energy content, as well as count rate information, for each of the Barkhausen responses at each of the excitation levels applied during the protocol. That information provides a ...


Constraint Objects, Divesh Srivastava, Raghu Ramakrishnan, Peter Revesz May 1994

Constraint Objects, Divesh Srivastava, Raghu Ramakrishnan, Peter Revesz

CSE Conference and Workshop Papers

We describe the Constraint Object Data Model (CODM), which enhances an object-based data model with existential constraints to naturally represent partially specified information. We present the Constraint Object Query Language (COQL), a declarative, rule-based query language that can be used to infer relationships about and monotonically refine information represented in the CODM. COQL has a model-theoretic and an equivalent fixed-point semantics, based on the notions of constraint entailment and "proofs in all possible worlds." We also provide a novel polynomial-time algorithm for quantifier elimination for set-order constraints, a restricted class of set constraints that uses membership of subset-equal.


A User-Level Process Package For Concurrent Computing, Ravi Konuru, Steve Otto, Jonathan Walpole, Robert Prouty, Jeremy Casas May 1994

A User-Level Process Package For Concurrent Computing, Ravi Konuru, Steve Otto, Jonathan Walpole, Robert Prouty, Jeremy Casas

Computer Science Faculty Publications and Presentations

A lightweight user-level process(ULP) package for parallel computing is described. Each ULP has its own register context, stack, data and heap space and communication with other ULPs is performed using locally synchronous, location transparent, message passing primitives. The aim of the package is to provide support for lightweight over-decomposition, optimized local communication and transparent dynamic migration. The package supports a subset of the Parallel Virtual Machine(PVM) interface[Sun90).


Rank Conditioned Rank Selection Filters For Signal Restoration, Russell C. Hardie, Kenneth E. Barner Mar 1994

Rank Conditioned Rank Selection Filters For Signal Restoration, Russell C. Hardie, Kenneth E. Barner

Electrical and Computer Engineering Faculty Publications

A class of nonlinear filters called rank conditioned rank selection (RCRS) filters is developed and analyzed in this paper. The RCRS filters are developed within the general framework of rank selection(RS) filters, which are filters constrained to output an order statistic from the observation set. Many previously proposed rank order based filters can be formulated as RS filters. The only difference between such filters is in the information used in deciding which order statistic to output. The information used by RCRS filters is the ranks of selected input samples, hence the name rank conditioned rank selection filters. The number ...


Two Approaches In Scanner Printer Calibration: Colorimetric Space-Based Vs. Closed-Loop, V. Ostromoukhov, R.D. Hersh, C. Péraire, P. Emmel, I. Amidror Jan 1994

Two Approaches In Scanner Printer Calibration: Colorimetric Space-Based Vs. Closed-Loop, V. Ostromoukhov, R.D. Hersh, C. Péraire, P. Emmel, I. Amidror

Cécile Péraire

No abstract provided.


An Exploratory Study Of Hypermedia Support For Problem Decomposition, Robert P. Minch, Gary I. Green Jan 1994

An Exploratory Study Of Hypermedia Support For Problem Decomposition, Robert P. Minch, Gary I. Green

IT and Supply Chain Management Faculty Publications and Presentations

Empirical hypermedia research has concentrated on usability rather than utility, and the research on utility has focused on information access as opposed to problem solving and decision making in organizations. This study, based on problem reduction theory, uses a hypermedia prototype system to support decision processes for solving a financial analysis problem. An exploratory laboratory experiment was conducted to study the feasibility of the prototype for hypermedia support of decision making. The process tracing techniques used suggest that a cognitive map of a decision maker's thought process may be constructed. Results offer a great deal of promise in the ...


Ms Computer Science, Ms Computer Information Systems, Ms Computer Technology In Education, Ms Management Info System, Nova Southeastern University Jan 1994

Ms Computer Science, Ms Computer Information Systems, Ms Computer Technology In Education, Ms Management Info System, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.


Performance Comparison Of Asynchronous Adders, Mark A. Franklin, Tienyo Pan Jan 1994

Performance Comparison Of Asynchronous Adders, Mark A. Franklin, Tienyo Pan

All Computer Science and Engineering Research

In asynchronous systems, average function delays principally govern overall throughput. This paper compares the performance of six adder designs with respect to their average delays. Our results show that asynchronous addres (32 or 64-bits) with a hybrid structure (e.g., carry-select addres) run 20-40% faster than simple ripple-carry addres. Hybrid adders also outperform high-cost, strictly synchronous conditional-sum adders.


Design Of A Large Scale Multimedia Server, Milind M. Buddhikot, Guru Parulkar, Jerome R. Cox Jr. Jan 1994

Design Of A Large Scale Multimedia Server, Milind M. Buddhikot, Guru Parulkar, Jerome R. Cox Jr.

All Computer Science and Engineering Research

Large scale multimedia storage servers will be an integral part of the emerging distributed multimedia computing infrastructure. However, given the modest rate of improvements in storage transfer rates, designing servers that meet the demands of multimedia applications is a challenging task that needs significant architectural innovation. Our research project, called Massively-parallel And Real-time Storage (MARS) architecture, is aimed at the design and prototype implementation of a large scale multimedia storage server. It uses some of the well-known techniques in parallel I/O, such as data striping and Redundant Arrays of Inexpensive Disks (RAID) and an innovative ATM based interconnect inside ...


Learning One-Dimensional Geometric Patterns Under One-Sided Random Misclassification Noise, Paul W. Goldberg, Sally A. Goldman Jan 1994

Learning One-Dimensional Geometric Patterns Under One-Sided Random Misclassification Noise, Paul W. Goldberg, Sally A. Goldman

All Computer Science and Engineering Research

Developing the ability to recognize a landmark from a visual image of a robot's current location is a fundamental problem in robotics. We consider the problem of PAC-learning the concept class of geometric patterns where the target geometric pattern is a configuration of k points on the real line. Each instance is a configuration of n points on the real line, where it is labeled according to whether or not it visually resembles the target pattern. To capture the notion of visual resemblance we use the Hausdorff metric. Informally, two geometric patterns P and Q resemble each othe runder ...


Efficient Fair Queueing Using Deficit Round Robin, George Varghese, M. Shreedhar Jan 1994

Efficient Fair Queueing Using Deficit Round Robin, George Varghese, M. Shreedhar

All Computer Science and Engineering Research

Fair queuing is a technique that allows each flow passing through a network device to have fair share of network resources. previous schemes for fair queuing that achieved nearly perfect fairness were expensive to implement: specifically, the work required to process a packet in these schemes was O(log(n)), where n is the number of active flows. This is expensive at high speeds. On the other hand, cheaper approximations of fair queuing that have been reported in the literature exhibit unfair behavior. In this paper, we describe a new approximation of fair queuing, that we call Deficit Round Robin ...


Exact Learning Of Discretized Geometric Concepts, Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldman, H. David Mathias Jan 1994

Exact Learning Of Discretized Geometric Concepts, Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldman, H. David Mathias

All Computer Science and Engineering Research

We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the unioin of m axis-parallel boxes in d-dimensional discretized Euclidean space where each coordinate can have n discrete values. This algorithm receives at most md counterexamples and uses time and membership queries polynomial in m and log(n) for any constant d. Furthermore, all equivalence queries can be formulated as the union of O(mdlog(m)) axis-parallel boxes. Next, we show how to extend our algorithm to efficiently learn, from only equivalence queries, any discretized geometric concept generated from any ...


Learning From A Consistently Ignorant Teacher, Michael Frazier, Sally Goldman, Nina Mishra, Leonard Pitt Jan 1994

Learning From A Consistently Ignorant Teacher, Michael Frazier, Sally Goldman, Nina Mishra, Leonard Pitt

All Computer Science and Engineering Research

One view of computational learning theory is that of a learner acquiring the knowledge of a teacher. We introduce a formal model of learning capturing the idea that teachers may have gaps in their knowledge. The goal of the learner is still to acquire the knowledge of the teacher, but now the learner must also identify the gaps. This is the notion of learning from a consistently ignorant teacher. We consider the impact of knowledge gaps on learning, for example, monoton DNF and d-dimensional boxes, and show that leraning is still possible. Negatively, we show that knowledge gaps make learning ...


An Application-Oriented Error Control Scheme For High Speed Networks, Fengmin Gong, Gurudatta Parulkar Jan 1994

An Application-Oriented Error Control Scheme For High Speed Networks, Fengmin Gong, Gurudatta Parulkar

All Computer Science and Engineering Research

Many new network applications demand interprocess communication (IPC) services that are not supported by existing transport protocol mechanisms. Large bandwidth-delay products of high-speed networks also render the existing control mechanisms such as flow and error control less efficient. In particular, new error control schemes that can provide variable degrees of error recovery according to the applications requirements are needed. This paper presents the design, evaluation, and implementation of an application-oriented error control scheme that is aimed at supporting efficient IPC in high-speed networking environments. Our results show that the proposed error control scheme allows effective control of trade-off between the ...


Connection Management In Reconfigurable Distributed Systems, Bala Swaminathan Jan 1994

Connection Management In Reconfigurable Distributed Systems, Bala Swaminathan

All Computer Science and Engineering Research

The Programmer's Playground takes a new approach to simplifying and supporting the construction of distributed applications. The approach, called I/O abstraction, separates the description of a system's communication structure from the descriptions of its computational components so that software modules written in existing programming languages cna be integrated flexibly and dynamically by both programmers and end-users. This separation is achieved by estabishing logical connectinos among the data interfaces of independent software modules. The logical connections provide a uniform high-level view of communication for both discrete and continuous data. The I/O abstraction approach inherits ideas from the ...


High Resolution, High Speed, And Low Cost Digitial Radiography And Computed Tomography System, R. Kasiviswanathan Jan 1994

High Resolution, High Speed, And Low Cost Digitial Radiography And Computed Tomography System, R. Kasiviswanathan

Retrospective Theses and Dissertations

Non-destructive evaluation is a branch of science that is concerned with all the aspects of uniformity, quality and serviceability of materials and structures. By definition, nondestructive evaluations are the means by which materials and structures may be inspected without disruption or impairment of their serviceability. Using NDE, internal properties of hidden flaws are revealed or inferred by appropriate techniques. Another important application of NDE is in process control monitoring where NDE techniques are used in the development of new materials and their evaluation. NDE is becoming an increasingly vital factor in the effective conduct of research, development, design and manufacturing ...


Learning And Teaching Of Boolean And Geometric Classes, H. David Mathias Jan 1994

Learning And Teaching Of Boolean And Geometric Classes, H. David Mathias

All Computer Science and Engineering Research

We consider the concept classes of DNF formulas and unions of discretized, axis-parallel d-dimensional boxes in discretized d-dimensional space with respect to several different learning models. In the model of learning with queries we present an algorithm to learn unions of boxes. We introduce a model of teaching that prevents illicit communication between the teacher and the leaner but that captures the intuitive aspect of teaching: a learner should perform at least as well with a cooperative teacher as with an adversarial teacher. We propose the study of teaching of DNF formulas and unions of boxes in this model. We ...


Proposal For Research Distribution Of Gigabit Network Technology, Jonathan Turner Jan 1994

Proposal For Research Distribution Of Gigabit Network Technology, Jonathan Turner

All Computer Science and Engineering Research

In 1993, APRA funded a major program at Washingotn University to create gigabit networking technology and create a gigabit testbed based on this technology. This program is now nearing the end of its first year and is making excellent proress towards its research and technical objectives. This note a proposes a program that would lead to the export of this technology to research groups in networking and gigabit applications with an interest in using it to further their own research activities.


Distributed Multimedia Systems Research Prospectus, Jonathan Turner Jan 1994

Distributed Multimedia Systems Research Prospectus, Jonathan Turner

All Computer Science and Engineering Research

Distributed multimedia computing and communiation systems combine computer systems, networks and distributed software to facilitate applications that enable and enhance collaborative work, direct interpersonal communication, remote access to information and real-time presentation of information from a variety of sources. Over the next decade, we expect such systems to become central to the infrastructure of our increasingly information-driven society. This prospectus describes a program of research being pursued within the Computer and Communications Research Center of Washington University and the Departments of Computer Science and Electrical Engineering. This program seeks to promote the creation of effective distributed multimedia systems and develop ...


High-Performance Training Of Feedforward & Simple Recurrent Networks, Barry L. Kalman, Stan C. Kwasny Jan 1994

High-Performance Training Of Feedforward & Simple Recurrent Networks, Barry L. Kalman, Stan C. Kwasny

All Computer Science and Engineering Research

TRAINREC is a system for training feedforward and recurrent neural networks that incorporates several ideas. It uses the conjugate-gradient method which is demonstrably more efficient than traditional backward error propagation. We assume epoch-based training and derive a new error function having several desirable properties absent from the traditional sum-of-squared-error function. We argue for skip (shortcut) connections where appropriate and the preference for a sigmoidal yielding values over the [-1,1] interval. The input feature space is often over-analyzed, but by using singular value decomposition, input patterns can be conditioned for better learning often with a reduced number of input units ...


Speculative Computation: Overcoming Communication Delays In Parallel Algorithms, Vasudha Govindan, Mark A. Franklin Jan 1994

Speculative Computation: Overcoming Communication Delays In Parallel Algorithms, Vasudha Govindan, Mark A. Franklin

All Computer Science and Engineering Research

Communication latencies and delays are a major source of performance degradation in parallel computing systems. It is importnat to "mask" these communication delays by overlapping them with useful computation in order to obtain good parallel performance. This paper proposes speculative computation as a technique to mask communication latencies. Speculative computation is discussed in the context of synchronous iterative algorithms. Processors speculate the contents of messages that are not hyet received and perform computation based on the speculated values. When the messages are received, they are compared with the speculated values and, if the error is unacceptable, the resulitng computation is ...


Morphing Binary Trees, John Hershberger, Subhash Suri Jan 1994

Morphing Binary Trees, John Hershberger, Subhash Suri

All Computer Science and Engineering Research

We investigate the problem of transforming one binary tree into another by rotatoins, subject to certain weight ocnstraints on the nodes of the trees. These constraints arise in the problem of "morphing" one simple polygon to another simple polygon by continuous deformatinos (translations and scalings) that preserve the turn angles and the simplicity of the polygon; the two polygons must have the same sequence of turn angles. Our main theorem is that two arbitrary n-leaf binary trees satisfying our weight constraint can be morphed into each other with O(nlogn) rotations. Furthermore, we also present an O(nlogn) time algorithm ...


Practical Methods For Approximating Shortest Paths On A Convex Polytope In R3, John Hershberger, Subhash Suri Jan 1994

Practical Methods For Approximating Shortest Paths On A Convex Polytope In R3, John Hershberger, Subhash Suri

All Computer Science and Engineering Research

We propose a n extremely simple approximation scheme for computing shortest paths on the surface of a convex polytope in three dimensions. Given a convex polytope P with n vertices and two points p,q on its surface, let d{subscript p}(p,q) denote the shortest path distance between p and q on the surface of P. Our algorithm produces a path of length at most 2*d{subscript p}(p,q) in time O(n). Extending this results, we can also compute ana pproximation of the shortest path tree rooted at an arbitrary point x {lying in} P ...


Pipelined And Superscalar Architectures In Clocked And Asynchronous Environments, Mark A. Franklin, Tienyo Pan Jan 1994

Pipelined And Superscalar Architectures In Clocked And Asynchronous Environments, Mark A. Franklin, Tienyo Pan

All Computer Science and Engineering Research

In this paper, a set of simple, general, yet practical performance models for RISC architectures are developed. These models apply to a wide range of systems that include both pipelined and superscalar systems operating in either clocked or asynchronous environments. The models permit quantitative evaluation of various design choices (e.g., the number of pipelines in the system, the pipeline depth, and the choice between clocked and asynchronous methodologies) as functions of technology parameters, environmental operating parameters, and pipeline function characteristics. Design curves are presented indicating optimal pipeline depth and number of pipelines to employ under various conditions.


Distributed Data Layout, Scheduling And Playout Control In A Large Scale Multimedia Storage Server, Milind M. Buddhikot, Guru Parulkar Jan 1994

Distributed Data Layout, Scheduling And Playout Control In A Large Scale Multimedia Storage Server, Milind M. Buddhikot, Guru Parulkar

All Computer Science and Engineering Research

No abstract provided.


Universal Continuous Media I/O: Design And Implementation, Charles D. Cranor, Gurudatta M. Parulkar Jan 1994

Universal Continuous Media I/O: Design And Implementation, Charles D. Cranor, Gurudatta M. Parulkar

All Computer Science and Engineering Research

The problem this paper addresses is how to modify an existing operating system's I/O subsystem to support new high-speed networks and high-bandwidth multimedia applications that will play an important role in future computing environments. The proposed I/O subsystem is called universal continuous media I/O (UCM I/O). This paper will cover the preliminary design of UCM I/O, some of the trade-offs and issues that need to be addressed in order to implement UCM I/O, and a summary of work in progress.