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

Engineering Commons™

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

Series

PDF

Computer Engineering

1994

Institution
Keyword
Publication

Articles 1 - 30 of 56

Full-Text Articles in 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 …

Go to article

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

Go to article

Complex Index-Of-Refraction Measurements For Rp-1 Liquid Rocket Fuel, Dennis R. Alexander, Ramu Kaiwala, Robert D. Kubik, Scott A. Schaub Sep 1994

Complex Index-Of-Refraction Measurements For Rp-1 Liquid Rocket Fuel, Dennis R. Alexander, Ramu Kaiwala, Robert D. Kubik, Scott A. Schaub

Department of Electrical and Computer Engineering: Faculty Publications

Complex index-of-refraction values of RP-1 liquid rocket fuel are reported at laser wavelengths of 0.193 m (ArF excimer), 0.4765 m (argon ion), 0.488 im (argon ion), 0.5145 ji.m (argon ion), 0.532 m (Nd-YAG, frequency doubled), 0.6328 pm (He-Ne), 1 .064 im (Nd-YAG), and 10.5915 im (C02). The imaginary part of the index of refraction (k) is determined by traditional transmission methods. The real part (flr) at the specific laser lines is determined using reflectance measurements, critical-angle measurements, Mueller matrix elements, and Michelson interferometric measurements. Reflectance measurements are used to obtam n at a wavelength of 0.193 m. The critical-angle method …

Go to article

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

Go to article

Production And Decay Of D1 (2420)0 And D2* (2460)0, Avery, P.; Et Al., M. Thulasidas Jun 1994

Production And Decay Of D1 (2420)0 And D2* (2460)0, Avery, P.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

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.

Go to article

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

Go to article

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

Go to article

Doctoral Programs Computer Info Systems, Info Science, Info Sytems, Computer Science, Computing Technology In Education 1994, Nova Southeastern University Jan 1994

Doctoral Programs Computer Info Systems, Info Science, Info Sytems, Computer Science, Computing Technology In Education 1994, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

Go to article

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.

Go to article

Bachelor Of Science Degree In Computer Science, Nova Southeastern University Jan 1994

Bachelor Of Science Degree In Computer Science, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

Go to article

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 …

Go to article

Strategies For The Parallel Training Of Simple Recurrent Neural Networks, Peter J. Mccann, Barry L. Kalman Jan 1994

Strategies For The Parallel Training Of Simple Recurrent Neural Networks, Peter J. Mccann, Barry L. Kalman

All Computer Science and Engineering Research

Two concurrent implementations of the method of conjugate gradients for training Elman networks are discussed. The parallelism is obtained in the computation of the error gradient and the method is therefore applicable to any gradient descent training technique for this form of network. The experimental results were obtained on a Sun Sparc Center 2000 multiprocessor. The Sparc 2000 is a shared memory machine well suited to coarse-grained distributed computations, but the concurrency could be extended to other architectures as well.

Go to article

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 …

Go to article

Visual Presentation Of Software Specifications And Designs, Gruia-Catalin Roman, Delbert Hart, Charles Calkins Jan 1994

Visual Presentation Of Software Specifications And Designs, Gruia-Catalin Roman, Delbert Hart, Charles Calkins

All Computer Science and Engineering Research

Formal methods hold the promise for high dependability in the design of critical software. However, software engineers who employ formal methods need to communicate their design decisions to users, customers, managers, and collegues who may not be in a position to acquire a full understanding of the formal notation being used. Visualizations derived from formal specifications and designs must be able to convey the required information precisely and reliably without the use of formal notation. This paper discusses a design methodology which attempts to integrate a design methodology based upon specification and program refinement with a state-of-the-art approach to rapid …

Go to article

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 I/O automaton model, a …

Go to article

Near-Distance Software Engineering Education, F. O'Brien Jan 1994

Near-Distance Software Engineering Education, F. O'Brien

Faculty of Informatics - Papers (Archive)

The University of Wollongong has been seeking ways by which it can attract capable students from the southern side of the States capital city, Sydney, Australia. The paper describes the concept of limiting the required daily travel to the University through an amalgam of technologies, and changes to the core teaching syllabus. Progress through 1994, and plans for full introduction in 1995, is described.

Go to article

Visual Specification Of Interprocess And Intraprocess Communication, T. Paul Mccartney, Kenneth J. Goldman Jan 1994

Visual Specification Of Interprocess And Intraprocess Communication, T. Paul Mccartney, Kenneth J. Goldman

All Computer Science and Engineering Research

We present a visual specification language for constructing distributed applications and their direct manipulation graphical user interfaces. Each distributed application consists of a collection of independent modules and a configuration of logical connections that define communication among the data interfaces of the modules. Our specification language uses a single visual mechanism that allows end-users to define interprocess communication among distributed modules and to define intraprocess communication among objects within a module. This seamless specification provides a general encapsulation/abstraction mechanism and is designed to support dynamic change to the communication structure. User interfaces are completely decoupled from the module(s) they control.

Go to article

Congestion Control In Atm Networks, Apostolos Dailianas, Andreas Bovopoulos Jan 1994

Congestion Control In Atm Networks, Apostolos Dailianas, Andreas Bovopoulos

All Computer Science and Engineering Research

No abstract provided.

Go to article

Rationales And Argument Moves, R. P. Loui, Jeff Norman Jan 1994

Rationales And Argument Moves, R. P. Loui, Jeff Norman

All Computer Science and Engineering Research

No abstract provided.

Go to article

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 number of halfspaces …

Go to article

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 …

Go to article

Production Quality Video Over Broadband Networks: A Description Of The System And Two Interactive Applications, William D. Richard, Jerome R. Cox Jr., A. Maynard Engebretson, Jason Fritts And Brian L. Gottlieb And Craig Horn Jan 1994

Production Quality Video Over Broadband Networks: A Description Of The System And Two Interactive Applications, William D. Richard, Jerome R. Cox Jr., A. Maynard Engebretson, Jason Fritts And Brian L. Gottlieb And Craig Horn

All Computer Science and Engineering Research

The Washington University MultiMedia eXplorer (MMX) is a complete, host-independent multimedia system capable of transmitting and receiving JPEG-compressed video, CD-quality audio, and high-resolution radiographic images over the Washington University broadband ATM network. If the host is equipped with an ATM interface card, normal network traffic can be supported via an ATM extension port on the MMX. The major components of the MMX are an ATMizer and three multimedia channels. The ATMizer implements the host interface, the interface to the ATM network, and hte interface to the three multimdeia channels. This paper describes the architecture of the MMX, the software used …

Go to article

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.

Go to article

Self-Stabilization By Counter Flushing, George Varghese Jan 1994

Self-Stabilization By Counter Flushing, George Varghese

All Computer Science and Engineering Research

A useful way to design simple and robust protocols is to make them self-stabilitizing. We describe a simple technique for self-stabilization called counter flushign which is applicable to a number of distributed algorithms. A randomized version of counter flushing is shown to have extremely small expected stabilization time. We show how our technique helps to crisply understand and improve some previous distributed algorithms. Then we apply it to a variety of total algorithms for deadlock detection, propagation of information with feedback, resets and snapshots. Our stabilizing snapshot protocol has much better complexity than the previous stabilizing non-blocking snapshot protocol. Hence …

Go to article

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 dp (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 × dp(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 χ Є P in time O(n log n). In the approximate tree, …

Go to article

An Evaluation Of The Pavane Visualization System, Kenneth C. Cox, Gruia-Catalin Roman Jan 1994

An Evaluation Of The Pavane Visualization System, Kenneth C. Cox, Gruia-Catalin Roman

All Computer Science and Engineering Research

The Pavane program visualization system is an implementation of the declarative paradigm of visualization. After a brief report on the status of the Pavane implementation, we present the results of an evaluation of the usability of Pavane. This evaluation is based on the use of Pavane by its developers to construct program visualizations, on its use in a classroom setting as a tool for examining executing programs, and on its application to some simple scientific visualizations.

Go to article

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

Go to article

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.

Go to article

Immittance Spectroscopy Of Smart Components And Novel Devices, Mohammad Anwarul Alim, Sanjida Khanam, Martin A. Seitz Jan 1994

Immittance Spectroscopy Of Smart Components And Novel Devices, Mohammad Anwarul Alim, Sanjida Khanam, Martin A. Seitz

Electrical and Computer Engineering Faculty Research and Publications

AC small-signal immittance spectroscopy is employed as a viable tool to demonstrate electrical characterization, performance improvement, and quality assurance issues of smart materials-based components and novel devices. The variation in the ac response, complemented via dc measurements within a range of tolerating temperature, delineates competing phenomena occurring in the microstructures of these engineering material systems. The results are presented in a generic manner with possible explanations on the mechanisms for two selected Debye-like (nearly ideal) and non-Debye (non-ideal) low-capacitance resistors. This spectroscopic approach allows systematic development of a representative equivalent circuit, considered to be the characteristic of the devices and …

Go to article

Next Last