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

Computer Sciences Commons™

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

Computer Engineering

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 12781 - 12810 of 13035

Full-Text Articles in Computer Sciences

Cell Tracking Using A Distributed Algorithm For 3d Image Segmentation, Vikas Awasthi, Keith W. Doolittle, Guru Parulkar, James G. Mcnally Jan 1994

Cell Tracking Using A Distributed Algorithm For 3d Image Segmentation, Vikas Awasthi, Keith W. Doolittle, Guru Parulkar, James G. Mcnally

All Computer Science and Engineering Research

We have developed and tested an automated method for simultaneous 3D tracking of numerous, flourescently-tagged cells. The procedure uses multiple thresholding to segment individual cells at a starting timepoint, and then iteratively applies a template-matching algorithm to locate a particular cell's position at subsequent time points. To speed up the method, we have developed a distributed implementation in which template matching is carried out in parallel on several different server machines. The distributed implementation showed a monotonic decrease in response time with increasing number of servers (up to 15 tested), demonstrating that the tracking algorithm is well suited to parallelization, …

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

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

Go to article

Catching Up With The Networks: Host I/O At Gigabit Rates, Zubin D. Dittia, Jerome R. Cox Jr., Guru M. Parulkar Jan 1994

Catching Up With The Networks: Host I/O At Gigabit Rates, Zubin D. Dittia, Jerome R. Cox Jr., Guru M. Parulkar

All Computer Science and Engineering Research

The last few years have seen network data rates skyrocket from a few Mbps to a Gbps or more. However, a lack of integration of the host-netowrk interface, the operating system, and network protocols has resulted in end-applications seeing only a small fraction of this total bandwidth being available for data transfer. The emergence of demanding applications in the realms of multimedia and virtual reality provides further impetus in the drive to overcome this problem. In this paper, we present the design of a high performance ATM host-network interface for workstations and servers that can support a bidirecitonal sustained data …

Go to article

Boxgraph: A Two-Dimensional Visual Computation Model, Takayuki Dan Kimura, Timothy B. Brown Jan 1994

Boxgraph: A Two-Dimensional Visual Computation Model, Takayuki Dan Kimura, Timothy B. Brown

All Computer Science and Engineering Research

Traditional computation models such as Turing machines, lambda-calculus, Markov's normal algorithms, are not suitable models for visual programming languages because they are all based on one-dimensional text strings and visual programming uses two-dimensional graphic diagrams. We propose a two-dimensional computation model, called Boxgraph, that requires no text. The syntax of the model consists of nested boxes connected by arrows, and the semantics consists of dataflow and the concept of consistency. The expressive power of the model is demonstrated by constructing representations of a binary full adder, the Fibonacci function, and the GCD function. The model, with a small extension to …

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

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 …

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

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.

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

Measurement Of Cabibbo-Suppressed Decays Of The Τ Lepton, Battle, M.; Et Al., M. Thulasidas Jan 1994

Measurement Of Cabibbo-Suppressed Decays Of The Τ Lepton, Battle, M.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

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

Go to article

Cmap, Ken Cox, John Dehart Jan 1994

Cmap, Ken Cox, John Dehart

All Computer Science and Engineering Research

This document specifies a Connection Management Access Protocol (CMAP) for call management in high-speed packet switched networks. We target CMAP to networks employing the Asynchronous Transfer Mode (ATM) communication standard. CMAP specifies the access procedues exercised by network clients to manipulate multipoint calls; it is thus a User-Network Interface (UNI) signalling protocol. We define a multipoint call as a group of multipoint connections. A multipoint connection is a communication channel between two or more clients or endpoints of the network, where all data sent by one client is received by all other clients who have elected to receive. A point-to-point …

Go to article

An Incremental Distributed Algorithm For Computing Biconnected Components, Bala Swaminathan, Kenneth J. Goldman Jan 1994

An Incremental Distributed Algorithm For Computing Biconnected Components, Bala Swaminathan, Kenneth J. Goldman

All Computer Science and Engineering Research

This paper describes a distributed algorithm for computing the biconnected components of a dynamically changing graph. Our algorithm has a worst case communication complexity of O(b + c) messages for an edge insertion and O(b' + c) messages for an edge removal, and a worst case time complexity of O(c) for both operations, where c is the maximum number of biconnected components in any of the connected components during the operation, b is the number of nodes in the biconnected component containing the new edge, and bprime is the number of nodes in the biconnected component in which the update …

Go to article

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(n log n) rotations. Furthermore, we also present an O(n log n) …

Go to article

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 …

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

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

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

Observation Of A New Charmed Strange Meson, Kubota, Y.; Et Al., M. Thulasidas Jan 1994

Observation Of A New Charmed Strange Meson, Kubota, Y.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

Precision Measurement Of The Ds*+-Ds+ Mass Difference, Brown, D.; Et Al., M. Thulasidas Jan 1994

Precision Measurement Of The Ds*+-Ds+ Mass Difference, Brown, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

We have measured the vector-pseudoscalar mass splitting M(D*+s)-M(D+s)=144.22±0.47±0.37 MeV significantly more precisely than the previous world average. We minimize the systematic errors by also measuring the vector-pseudoscalar mass difference M(D*0)-M(D0) using the radiative decay D*0→D0γ, obtaining [M(D*+s)-M(D+s)]-[M(D*0)-M(D0)] =2.09±0.47±0.37 MeV. This is then combined with our previous high-precision measurement of M(D*0)-M(D0), which used the decay D*0→D0π0. We also measure the mass difference M(D+s)-M(D+)=99.5±0.6±0.3 MeV, using the φπ+ decay modes of the D+s and D+ mesons.

Go to article

The World Wide Web And Technology Transfer At Nasa Langley Research Center, Michael L. Nelson, David J. Bianco Jan 1994

The World Wide Web And Technology Transfer At Nasa Langley Research Center, Michael L. Nelson, David J. Bianco

Computer Science Faculty Publications

NASA Langley Research Center (LaRC) began using the World Wide Web (WWW) in the summer of 1993, becoming the first NASA installation to provide a Center-wide home page. This coincided with a reorganization of LaRC to provide a more concentrated focus on technology transfer to both aerospace and non-aerospace industry. Use of the WWW and NCSA Mosaic not only provides automated information dissemination, but also allows for the implementation, evolution and integration of many technology transfer applications. This paper describes several of these innovative applications, including the on-line presentation of the entire Technology Opportunities Showcase (TOPS), an industrial partnering showcase …

Go to article

World Wide Web Implementation Of The Langley Technical Report Server, Michael L. Nelson, Gretchen L. Gottlich, David J. Bianco Jan 1994

World Wide Web Implementation Of The Langley Technical Report Server, Michael L. Nelson, Gretchen L. Gottlich, David J. Bianco

Computer Science Faculty Publications

On January 14, 1993, NASA Langley Research Center (LaRC) made approximately 130 formal, 'unclassified, unlimited' technical reports available via the anonymous FTP Langley Technical Report Server (LTRS). LaRC was the first organization to provide a significant number of aerospace technical reports for open electronic dissemination. LTRS has been successful in its first 18 months of operation, with over 11,000 reports distributed and has helped lay the foundation for electronic document distribution for NASA. The availability of World Wide Web (WWW) technology has revolutionized the Internet-based information community. This paper describes the transition of LTRS from a centralized FTP site to …

Go to article

Electronic Document Distribution: Design Of The Anonymous Ftp Langley Technical Report Server, Michael L. Nelson, Gretchen L. Gottlich Jan 1994

Electronic Document Distribution: Design Of The Anonymous Ftp Langley Technical Report Server, Michael L. Nelson, Gretchen L. Gottlich

Computer Science Faculty Publications

An experimental electronic dissemination project, the Langley Technical Report Server (LTRS), has been undertaken to determine the feasibility of delivering Langley technical reports directly to the desktops of researchers worldwide. During the first six months, over 4700 accesses occurred and over 2400 technical reports were distributed. This usage indicates the high level of interest that researchers have in performing literature searches and retrieving technical reports at their desktops. The initial system was developed with existing resources and technology. The reports are stored as files on an inexpensive UNIX workstation and are accessible over the Internet. This project will serve as …

Go to article

A Strategy For Electronic Dissemination Of Nasa Langley Technical Publications, Donna G. Roper, Mary K. Mccaskill, Scott D. Holland, Joanne L. Walsh, Michael L. Nelson, Susan L. Adkins, Manjula Y. Ambur, Bryan A. Campbell Jan 1994

A Strategy For Electronic Dissemination Of Nasa Langley Technical Publications, Donna G. Roper, Mary K. Mccaskill, Scott D. Holland, Joanne L. Walsh, Michael L. Nelson, Susan L. Adkins, Manjula Y. Ambur, Bryan A. Campbell

Computer Science Faculty Publications

To demonstrate NASA Langley Research Center's relevance and to transfer technology to external customers in a timely and efficient manner, Langley has formed a working group to study and recommend a course of action for the electronic dissemination of technical reports (EDTR). The working group identified electronic report requirements (e.g., accessibility, file format, search requirements) of customers in U.S. industry through numerous site visits and personal contacts. Internal surveys were also used to determine commonalities in document preparation methods. From these surveys, a set of requirements for an electronic dissemination system was developed. Two candidate systems were identified and evaluated …

Go to article

Script-Based Qos Specifications For Multimedia Presentations, Richard Staehli, Jonathan Walpole Dec 1993

Script-Based Qos Specifications For Multimedia Presentations, Richard Staehli, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Multimedia presentations can convey information not only by the sequence of events but by their timing. The correctness of such presentations thus depends on the timing of events as well as their sequence and content. This paper introduces a formal specification language for playback of real-time presentations. The main contribution of this language is a quality of service (QOS) specification that relaxes resolution and synchronization requirements for playback. Our definitions give a precise meaning to the correctness of a presentation. This specification language will form the basis for a QOS interface for reservation of operating system resources.

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 10, December 1993, College Of Engineering And Computer Science, Wright State University Dec 1993

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 10, December 1993, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Go to article

Using Discovery-Based Learning To Prove The Behavior Of An Autonomous Agent, David N. Mezera Dec 1993

Using Discovery-Based Learning To Prove The Behavior Of An Autonomous Agent, David N. Mezera

Theses and Dissertations

Computer-generated autonomous agents in simulation often behave predictably and unrealistically. These characteristics make them easy to spot and exploit by human participants in the simulation, when we would prefer the behavior of the agent to be indistinguishable from human behavior. An improvement in behavior might be possible by enlarging the library of responses, giving the agent a richer assortment of tactics to employ during a combat scenario. Machine learning offers an exciting alternative to constructing additional responses by hand by instead allowing the system to improve its own performance with experience. This thesis presents NOSTRUM, a discovery-based learning DBL system …

Go to article

A Method For Populating The Knowledge Base Of Aptas, A Domain-Oriented Application Composition System, Raleigh A. Sandy Iii Dec 1993

A Method For Populating The Knowledge Base Of Aptas, A Domain-Oriented Application Composition System, Raleigh A. Sandy Iii

Theses and Dissertations

A formal process is described for populating the knowledge base of the Automatic Programming Technologies for Avionics Software APTAS system. This process was developed using a general knowledge base population process that applies to many knowledge-based software engineering systems. This general process is also described. The formal process for APTAS was demonstrated by storing new information from the radar tracking domain into the knowledge base of APTAS. Several procedures some automatic and some manual were implemented to support the formal process.

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 9, November 1993, College Of Engineering And Computer Science, Wright State University Nov 1993

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 9, November 1993, 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.

Go to article

First Prev Next Last