Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- College of Engineering and Computer Science (10)
- Computer Science (10)
- Engineering (10)
- Newsletters (10)
- Science news (10)
-
- Technical writing (10)
- Adaptive computing systems (2)
- Computer network architectures (2)
- Electronic data processing -- Distributed processing (2)
- Multimedia systems (2)
- Streaming technology (Telecommunications) (2)
- Artificial Intelligence and Cognitive Theory (1)
- Associative memory (1)
- Computer networks (1)
- Computer networks -- Quality control (1)
- Computer vision (1)
- DCOM (Computer architecture) (1)
- Data complexity (1)
- Database design (1)
- Datalog (1)
- Gap-order (1)
- Heteroassociative recall (1)
- Image processing--Digital techniques (1)
- Integer order (1)
- Integrated services digital networks -- Quality control (1)
- Microcirculation--Research (1)
- Multicast (1)
- Multimedia systems - Design (1)
- Multimedia systems -- Software (1)
- Neural network architecture (1)
- Publication
- Publication Type
Articles 31 - 57 of 57
Full-Text Articles in Computer Engineering
Can Declared Strategy Voting Be An Effective Instrument For Group Decision-Making?, Lorrie Faith Cranor
Can Declared Strategy Voting Be An Effective Instrument For Group Decision-Making?, Lorrie Faith Cranor
All Computer Science and Engineering Research
The goal of this research is to determine whether declared strategy voting can be an effective tool for group decision-making. Declared strategy voting is a novel group decision-making procedure in which preference is specified using voting strategies - first-order mathematical functions that specify a choice in terms of zero or more parameters. This research will focus on refining the declared strategy voting concept, developing an accessible implementation of declared strategy voting that can be used for mock elections, assessing the potential impacts of declared strategy voting, and evaluating the effectiveness of declared strategy voting for group decision-making. This proposal describes …
An Oo Encapsulation Of Lightweight Os Concurrency Mechanisms In The Ace Toolkit, Douglas C. Schmidt
An Oo Encapsulation Of Lightweight Os Concurrency Mechanisms In The Ace Toolkit, Douglas C. Schmidt
All Computer Science and Engineering Research
This paper describes the design of the ACE object-oriented thread encapsulation class library. The architecture of this class library is presented from an end-user and internal design perspective and several key design issues are discussed. Readers should gain an understanding of the overall design approach as well as the tradeoffs between various software quality factors such as performance, portability, and extensibility.
Error Control For Continuous Media And Multipoint Applications, Christos Papadopoulos, Guru Parulkar
Error Control For Continuous Media And Multipoint Applications, Christos Papadopoulos, Guru Parulkar
All Computer Science and Engineering Research
High-bandwidth multimedia applications pose new challenges to error control. These include the support of error control for Continuous Media (CM) streams and the scalable support of error control in multipoint applications where the number of participants is large. Current error control mechanisms provide no support for the above applications. In this report we present new error control mechanisms that provide the required support. Continuous media applications have strict timing requirements which greatly affect recovery. To support continuous media applications we have designed and implemented a point-to-point error control mechanism which features the following: (1) selective repeat retransmission, (2) conditional retransmission, …
Hart's Critics On Defeasible Concepts And Ascriptivism, Ronald P. Loui
Hart's Critics On Defeasible Concepts And Ascriptivism, Ronald P. Loui
All Computer Science and Engineering Research
Hart's "Ascription of Responsibility and Rights" is where we find perhaps the first clear pronouncement of defeasibility and the technical introduction of the term. The paper has been criticised, disavowed, and never quite fully redeemed. Its lurid history is now being used as an excuse for dismissing the importance of defeasibility. Quite to the contrary, Hart's introduction of defeasibility has uniformly been regarded as the most agreeable part of the paper. The critics' wish that defeasibility could be better expounded along the lines of a Wittgensteinian game-theoretic semantics has largely been fulfilled. Even the most contentious part of the paper, …
Synchronized Data Objects, Marin Bezic
Synchronized Data Objects, Marin Bezic
All Computer Science and Engineering Research
Synchronized Data Objects (SDOs) are presented as a method of encapsulating, in the datatype definition, synchronization protocols that are used to control information exchange. SDOs are presented in the context of I/O abstraction, a programming model that seeks to separate communication from computation in order to support dynamic end-user configuration of distrivuted applications. SDOs can be used to implement a variety of synchronization paradigms, including remote invalidation, demand-driven data streams, remote procedure call, and promises. An implementation of SDOs is described in the context of The Programmers' Playground, a distributed application development environment that supports the I/O abstraction programming model. …
Design Of A Tool For Rapid Prototyping Of Communication Protocols, Aniruddha Gokhale, Ron Cytron, George Varghese
Design Of A Tool For Rapid Prototyping Of Communication Protocols, Aniruddha Gokhale, Ron Cytron, George Varghese
All Computer Science and Engineering Research
We present a new tool for automatically generating prototypes of communication protocols on a wide variety of platforms. Our goal is to reduce design time, enhance portability, and accommodate optimizations automatically. Users of the tool are required to provide an abstract implementation of the protocol in C++ without worrying about the underlying operating system specific system calls. Instead, the user employs high-level interface functions provided by the tool to interact with the underlying operating system. Users also need not worry about complex packet formats that involve fields of various bit and byte lengths. Instead, they use simple C/C++ struct declarations …
Aras: Asynchronous Risc Architecture Simulator, Chia-Hsing Chien, Mark A. Franklin, Tienyo Pan, Prithvi Prabhu
Aras: Asynchronous Risc Architecture Simulator, Chia-Hsing Chien, Mark A. Franklin, Tienyo Pan, Prithvi Prabhu
All Computer Science and Engineering Research
In this paper, an asynchronous pipeline instruction simulator, ARAS is presented. With this simulator, one can design selected instruction pipelines and check their performance. Performance measurements of the pipeline configuration are obtained by simulating the execution of benchmark programs on the machine architectures developed. Depending on the simulation results obtained by using ARAS, the pipeline configuration can be altered to improve its performance. Thus, one can explore the design space of aynchronous pipeline architectures.
Pac Learing Of One-Dimensional Patterns, Paul W. Goldberg, Sally A. Goldman, Stephen D. Scott
Pac Learing Of One-Dimensional Patterns, Paul W. Goldberg, Sally A. Goldman, Stephen D. Scott
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 …
Distributed Debugging With I/O Abstraction, Andrew S. Koransky
Distributed Debugging With I/O Abstraction, Andrew S. Koransky
All Computer Science and Engineering Research
This thesis presents a simple, yet powerful, set of mechanisms for testing and debugging distributed applications consisting of modules that communicate through well-defined data interfaces. The tools allow default or programmer-defined functions to be attached to various communication events so that particular data values at interesting points in the program are made available for testing and debugging. The debugging status of each component of the communication interface can be controlled separately so that various debugging information can be turned on and off during program execution. By attaching breakpoints to programmer-defined fucntions in a standard debugger, fine-grained examination of each module …
Formal Specification Of A Dynamically Configurable Distributed System, Ram Sethuraman, Kenneth J. Goldman
Formal Specification Of A Dynamically Configurable Distributed System, Ram Sethuraman, Kenneth J. Goldman
All Computer Science and Engineering Research
The Programmers' Playground is a programming environment that supports end-user construction of distributed multimedia applications. The system implements a new programming model that is based, in part, upon ideas from the formal I/O automaton model of Lynch and Tuttle. Important features of The Programmers' Playground are a separation of communication and computation and graphical support for dynamic reconfiguration. This paper provides a formal specification of the Playground programming model and runtime system in terms of the I/O automaton model on which it is based. Exploiting the compositionality properties of the I/O automaton model, the formal specification is describd as a …
Redesigning The Bsd Callout And Timer Facilities, Adam M. Costello, George Varghese
Redesigning The Bsd Callout And Timer Facilities, Adam M. Costello, George Varghese
All Computer Science and Engineering Research
We describe a new implementation of the BSD callout and timer facilities. Current BSD kernels take time proportional to the number of outstanding timers to set or cancel timers. Our implementation takes constant time to start, stop, and maintain timers; this leads to a highly scalable design that can support thousands of outstanding timers without much overhead. Unlike the existing implementation, our routines are guaranteed to lock out interrupts only for a small, bounded amount of time. We also extend the setitimer() interface to allow a process to have multiple outstanding timers, thereby reducing the need for users to maintain …
User Interface Applications Of A Multi-Way Constraint Solver, T. Paul Mccartney
User Interface Applications Of A Multi-Way Constraint Solver, T. Paul Mccartney
All Computer Science and Engineering Research
Constraints are widely recognized as a useful tool for user interface constructino. Through constraints, relationships among user interface components can be defined declaratively, leaving the task of relationship management to a constraint solver. Multi-way constraint solvers supporting constraint hierarchies provide a means to specify preferential constraint relationships with a dynamically changing computation flow, making them especially well suited to interactive user interfaces. However, previous such constraint solvers lack the ability to enforce inequalities or to effectively handle cyclic constraint relationships. These deficiencies limit the problems that could be solved using a constraint-based approach. This paper presents a new algorithm called …
Reasoning About Program Interactions In The Presence Of Mobility, Gruia-Catalin Roman, Peter J. Mccann
Reasoning About Program Interactions In The Presence Of Mobility, Gruia-Catalin Roman, Peter J. Mccann
All Computer Science and Engineering Research
Mobile computing is emerging as an important new paradigm which has the potential to reshape our thinking about distributed computation. Mobility has far-reaching implications on what designers and users can assume about communication patterns, resource availability, and applciation behaviors as components move from one location to another while joining or leaving groups of other components in their vicinity. New distributed algorithms are likely to be required as the nature of applications shifts with the emergence of this new kind of computing environment. Formal methods have an important role to play in the midst of these developments both in terms of …
A General Matrix Iterative Model For Dynamic Load Balancing, Mark A. Franklin, Vasudha Govindan
A General Matrix Iterative Model For Dynamic Load Balancing, Mark A. Franklin, Vasudha Govindan
All Computer Science and Engineering Research
Effective load balancing algorithms are crucial in fully realizing the performance potential of parallel computer systems. This paper proposes a general matrix iterative model to represent a range of dynamic load balancing algorithms. The model and associated performance measures are used to evaluate and compare vairous load balancing algorithms and derive optimal algorithms and associated parameters for a given application and multiprocessor system. The model is parameterized to represent three load balancing algorithms - the random strategy, diffusion and complete redistribution algorithms. The model is validated by comparing the results with measured performance on a realistic workload. The parallel N-body …
A Survey Of Network Signaling, Dakang Wu
A Survey Of Network Signaling, Dakang Wu
All Computer Science and Engineering Research
Abstract Network signaling is the process of transferring control information among components of a communication network to establish, maintain, and release connections, and to pass the network management information. The rapid evolution in the field of telecommunications has led to the rapid evolution of network signaling. In this paper, we review the evolution of network signaling. We emphasize the concepts and protocols used in modern fast packet switching networks especially in emerging ATM networks.
Distributed Radiological Multimedia Conferencing, Naeem Bari
Distributed Radiological Multimedia Conferencing, Naeem Bari
All Computer Science and Engineering Research
Distributed Radiological Multimedia Conference (DRMC) is a collaborative imaging/multimedia conferencing tool which allows geographically separated physicians to confer over a shared projection radiograph. DRMC utilizes the advantages of high bandwidth and scalability offered by the new Asynchronous Transfer Mode (ATM) network technology. This application is customized for the high quality of displayed images and rapid response to user requests. It allows conferees to: share a common radiograph; each possess an independently controlled globally visible cursor; be able to point to and outline areas on the image to bring it to the other conferees' attention; and see and hear each other …
Load Balance Properties Of Distributed Data Layouts For Clustered Mod Servers, Milind M. Buddhikot, Guru Parulkar
Load Balance Properties Of Distributed Data Layouts For Clustered Mod Servers, Milind M. Buddhikot, Guru Parulkar
All Computer Science and Engineering Research
Large scale storage servers that provide location transparent, interactive access to hundreds or thousands of concurrent, independent clients will be important components of hte furture information super-highway infrastructure. Two key requirements of such servers are as follows: support high parallelism and concurrency in data access to allow large number of access to the same or different data. Second, support independent interactive playout control operations such as fast-forward, rewind, slow-play, pause, resume, random access etc. with minimal latency. This paper assumes a distributed storage server architecture consisting of several high performance storage nodes interconnected by a high speed desk area network …
Reliable Fifo Load Balancing Over Multiple Fifo Channels, Hari Adieseshu, Gurudatta M. Parulkar, George Varghese
Reliable Fifo Load Balancing Over Multiple Fifo Channels, Hari Adieseshu, Gurudatta M. Parulkar, George Varghese
All Computer Science and Engineering Research
Link striping algorithms are often used to overcome transmission bottlenecks in computer networks. However, traidtional striping algorithms suffer from two major disadvantages. They provide inadequate load sharing in the presence of variable length packets, and may result in non-FIFO delivery of data. We describe a new family of link striping algorithms that solve both problems. Our scheme applies to packets at any layer (physical, data, link, network, and transport) that work over multiple FIFO channels. We deal with variable sized packets by showing how a class of fair queueing algorithms can be converted into load sharing algorithms. Our transformation results …
An Interactive Model Of Teaching, H. David Mathias
An Interactive Model Of Teaching, H. David Mathias
All Computer Science and Engineering Research
Previous teaching models in the learning theory community have been batch models. That is, in these models the teacher has generated a single set of helpful examples to present to the learner. In this paper we present an interactive model in which the learner has the ability to ask queries as in the query learning model of Angluin [1]. We show that this model is at least as powerful as previous teaching models. We also show that anything learnable with queries, even by a randomized learner, is teachable in our model. In all previous teaching models, all classes shown to …
Self-Stabilization By Window Washing, Adam M. Costello, George Varghese
Self-Stabilization By Window Washing, Adam M. Costello, 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 new general technique for self-stabilization called window washing. We apply this technique to generalized sliding window protocols that work on a number of topologies. This results in simple, efficient, and self-stabilizing protocols. As far as we know, both window washing and generalized sliding window protocols are new ideas. Our protocols can be used for data links, reliable broadcast, and flow control.
Assertional Reasoning About Pairwise Transient Interactions In Mobile Computing, Gruia-Catalin Roman, Peter J. Mccann, Jerome Plun
Assertional Reasoning About Pairwise Transient Interactions In Mobile Computing, Gruia-Catalin Roman, Peter J. Mccann, Jerome Plun
All Computer Science and Engineering Research
Mobile computing represents a major point of departure from the traditional distributed computing paradigm. The potentially very large number of independent computing units, a decoupled computing style, frequent disconnections, continuous position changes, and the location-dependent nature of the behavior and communication patterns of the individual components present designers with unprecedented challenges in the areas of modularity and dependability. This paper describes two ideas regarding a modular approach to specifying and reasoning about mobile computing. The novelty of our approach rests with the notion of allowing transient interactions among programs which mobe in space. In this paper we restrict our concert …
Time Variability While Training A Parallel Neural Net Network, Tina L. Seawell, Barry L. Kalman
Time Variability While Training A Parallel Neural Net Network, Tina L. Seawell, Barry L. Kalman
All Computer Science and Engineering Research
The algorithmic analysis, data collection, and statistical analysis required to isolate the cause of time variability observed while an Elman style recurrent neural network is trained in parallel on a twenty processor SPARCcenter 2000 is described in detail. Correlations of system metrics indicate the operating system scheduler or an interaction of kernel processes is the most probable explanation for the variability.
Euphoria: End-User Construction Of Direct Manipulation User Interfaces For Distributed Applications, T. Paul Mccartney, Kenneth J. Goldman, David E. Saff
Euphoria: End-User Construction Of Direct Manipulation User Interfaces For Distributed Applications, T. Paul Mccartney, Kenneth J. Goldman, David E. Saff
All Computer Science and Engineering Research
The Programmers' Playground is a software library and run-time system for creating distributed multimedia applications from collections of reusable software moduels. This paper presents the design and implementation of EUPHORIA, Playground's user interface management system. Implemented as a Playground module, EUPHORIA allows end-users to create direct manipulation graphical user interfaces (GUIs) exclusively through the use of a graphics editor. No programming is required. At run-time, attributes of the GUI state can be exposed and connected to external Playground modules, allowing the user to vosualize and directly manipulate state information in remote Playground modules. Features of EUPHORIA include real-time direct manipulation …
Scheduling Of Parallel Jobs On Dynamic, Heterogenous Networks, Dan Clark, Jeremy Casas, Steve Otto, Robert Prouty, Jonathan Walpole
Scheduling Of Parallel Jobs On Dynamic, Heterogenous Networks, Dan Clark, Jeremy Casas, Steve Otto, Robert Prouty, Jonathan Walpole
Computer Science Faculty Publications and Presentations
In using a shared network of workstations for parallel processing, it is not only important to consider heterogeneity and differences in processing power between the workstations but also the dynamics of the system as a whole. In such a computing environment where the use of resources vary as other applications consume and release resources, intelligent scheduling of the parallel jobs onto the available resources is essential to maximize resource utilization. Despite this realization, however, there are few systems available that provide an infrastructure for the easy development and testing of these intelligent schedulers. In this paper, an infrastructure is presented …
Optimizing Object Invocation Using Optimistic Incremental Specialization, Jon Inouye, Andrew P. Black, Charles Consel, Calton Pu, Jonathan Walpole
Optimizing Object Invocation Using Optimistic Incremental Specialization, Jon Inouye, Andrew P. Black, Charles Consel, Calton Pu, Jonathan Walpole
Computer Science Faculty Publications and Presentations
To make object invocation efficient, it is important to minimize overhead. In general, overhead is incurred in order to maintain transparency; with the advent of mobile computer systems, persistence, increasing security and privacy concerns, transparency becomes more expensive and overhead is increasing. Invocation mechanisms maintain transparency by finding objects, choosing communication media, performing data translation into common formats (e.g., XDR), marshalling arguments, encrypting confidential data, etc. Performing all of these operations on every invocation would lead to unacceptable performance, so designers often avoid operations by specializing object invocation for more restricted environments. For example, the Emerald compiler performs several optimizations …
Production Of Excited Beauty States In Z Decays, D. Buskulic, Manoj Thulasidas
Production Of Excited Beauty States In Z Decays, D. Buskulic, Manoj Thulasidas
Research Collection School Of Computing and Information Systems
A data sample of about 3.0 million hadronic Z decays collected by the ALEPH experiment at LEP in the years 1991 through 1994, is used to make an inclusive selection of B hadron events.
Adaptive Resonance Associative Map, Ah-Hwee Tan
Adaptive Resonance Associative Map, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
This article introduces a neural architecture termed Adaptive Resonance Associative Map (ARAM) that extends unsupervised Adaptive Resonance Theory (ART) systems for rapid, yet stable, heteroassociative learning. ARAM can be visualized as two overlapping ART networks sharing a single category field. Although ARAM is simpler in architecture than another class of supervised ART models known as ARTMAP, it produces classification performance equivalent to that of ARTMAP. As ARAM network structure and operations are symmetrical, associative recall can be performed in both directions. With maximal vigilance settings, ARAM encodes pattern pairs explicitly as cognitive chunks and thus guarantees perfect storage and recall …