ppxscal/embedding_network huggingface dataset:
QoS routing using alternate paths
Authors: Adrian Segall, Pravin Bhagwat, Arvind Krishna
Venue: Journal of High Speed Networks (1998)

A QoS routing protocol based on alternative path selection is described. Using a combination of source routing and shortest path routing, packets are routed along alternate paths when available resources along the shortest path cannot satisfy the QoS requirements of end to end flows. For path selection, the QoS routing protocol makes use of the information already available in the OSPF link information database. Packet forwarding uses existing mechanisms within the Internet protocols. Thus, support for QoS routing is provided without requiring major changes to the existing installed base of OSPF routers. Our proposal provides QoS routes for unicast as well as multicast connections. The major virtues of the solution are that of providing an evolutionary approach, whereby only a subset of the routers need to be enabled, and that the additional algorithms are computationally simple without requiring state maintenance at every router. Simulations of our proposed routing protocols on the UUnet backbone show that they perform well, almost optimal in terms of delivering the desired QoS for end to end flows.
Strategies for providing upper extremity amputees with tactile and hand position feedback &mdash; moving closer to the bionic arm
Authors: R. R. Riso
Venue: Technology and Health Care (1999)

A continuing challenge for prostheses developers is to replace the sensory function of the hand. This includes tactile sensitivity such as finger contact, grip force, object slippage, surface texture and temperature, as well as proprioceptive sense. One approach is sensory substitution whereby an intact sensory system such as vision, hearing or cutaneous sensation elsewhere on the body is used as an input channel for information related to the prosthesis. A second technique involves using electrical stimulation to deliver sensor derived information directly to the peripheral afferent nerves within the residual limb. Stimulation of the relevant afferent nerves can ultimately come closest to restoring the original sensory perceptions of the hand, and to this end, researchers have already demonstrated some degree of functionality of the transected sensory nerves in studies with amputee subjects. This paper provides an overview of different types of nerve interface components and the advantages and disadvantages of employing each of them in sensory feedback systems. Issues of sensory perception, neurophysiology and anatomy relevant to hand sensation and function are discussed with respect to the selection of the different types of nerve interfaces. The goal of this paper is to outline what can be accomplished for implementing sensation into artificial arms in the near term by applying what is present or presently attainable technology.
Newton's Law and Integrability of Nonholonomic Systems
Authors: A. M. Bloch, P. E. Crouch
Venue: SIAM Journal on Control and Optimization (1998)

In this paper we consider nonholonomic control systems on Riemannian manifolds. Such systems evolve on subbundles of tangent bundles, defined by the nonholonomic constraints. This paper promotes the view of such systems as the restriction to the nonholonomic subbundle of "Newton law"-type problems on the entire tangent bundle, defined by, in general, non-Riemannian connections. These connections should be related to specific geometric properties of the nonholonomic system. We introduce a particular class of connections and demonstrate the richness of the class through four examples---the rolling ball, the constrained particle, the rolling penny, and the generalized rolling ball. This class of connections is strongly related to questions of integrability of the original nonholonomic system. This, in turn, provides additional insight into the relation between nonholonomic control systems formulated as kinematic equations and those that are formulated as the full dynamic equations.
An Asymptotic Preserving Numerical Scheme for Kinetic Equations in the Low Mach Number Limit
Authors: Axel Klar
Venue: SIAM Journal on Numerical Analysis (1999)

A numerical scheme for the nonstationary Boltzmann equation in the incompressible Navier--Stokes limit is developed. The scheme is induced by the asymptotic analysis of the Navier--Stokes limit for the Boltzmann equation. It works uniformly for all ranges of mean free paths. In the limit the scheme reduces to the Chorin projection method for the incompressible Navier--Stokes equation. Numerical results for different physical situations are shown and the uniform convergence of the scheme is established numerically.
Information Visualization Within a Digital Video Library
Authors: Michael Christel, David Martin
Venue: Journal of Intelligent Information Systems (1998)

The Informedia Digital Video Library contains over a thousand hours of video, consuming over a terabyte of disk space. This paper summarizes the multimedia abstractions used to represent this video in prior systems and introduces the visualization techniques employed to browse and navigate multiple video documents at once.
Using profiling to reduce branch misprediction costs on a dynamically scheduled processor
Authors: Srinivas Mantripragada, Alexandru Nicolau
Venue: Proceedings of the 14th international conference on Supercomputing (2000)

Modern dynamically scheduled processors use branch prediction hardware to speculatively fetch and execute most likely executed paths in a program. Complex branch predictors have been proposed which attempt to identify these paths accurately such that the hardware can benefit from out-of-order (OOO) execution. Recent studies have shown that inspite of such complex prediction schemes, there still exist many frequently executed branches which are difficult to predict. Predicated execution has been proposed as an alternative technique to eliminate some of these branches in various forms ranging from a restrictive support to a full-blown support. We call the restrictive form of predicated execution as guarded execution.In this paper, we propose a new algorithm which uses profiling and selectively performs if-conversion for architectures with guarded execution support. Branch profiling is used to gather the taken, non-taken and misprediction counts for every branch. This combined with block profiling is used to select paths which suffer from heavy mispredictions and are profitable to if-convert. Effects of three different selection criterias, namely size-based, predictability-based and profiled-based, on net cycle improvements, branch mispredictions and mis-speculated instructions are then studied. We also propose new mechanisms to convert unsafe instructions to safe form to enhance the applicability of the technique. Finally, we explain numerous adjustments that were made to the selection criterias to better reflect the OOO processor behavior.
On Performance Prediction of Parallel Computations with Precedent Constraints
Authors: De-Ron Liang, Satish K. Tripathi
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

Performance analysis of concurrent executions in parallel systems has been recognized as a challenging problem. The aim of this research is to study approximate but efficient solution techniques for this problem. We model the structure of a parallel machine and the structure of the jobs executing on such a system. We investigate rich classes of jobs, which can be expressed by series, parallel-and, parallel-or, and probabilistic-fork. We propose an efficient performance prediction method for these classes of jobs running on a parallel environment which is modeled by a standard queueing network model. The proposed prediction method is computationally efficient, it has polynomial complexity in both time and space. The time complexity is $O(C^{2}N^{2}K)$ and the space complexity is $O(C^{2}N^{2}K)$, where $C$ is the number of job classes in the system, the number of tasks in each job class is $O(N)$, and $K$ is the number of service centers in the queueing model. The accuracy of the approximate solution is validated via simulation.
Providing Network Information and Assistance Via the Web
Authors: Gilbert Held
Venue: International Journal of Network Management (1996)

In this article I will review and examine the use of different Web components you can use to establish a multimedia help facility.
Task response time optimization using cost-based operation motion
Authors: Bassam Tabbara, Abdallah Tabbara Alberto Sangiovanni-Vincentelli
Venue: Proceedings of the eighth international workshop on Hardware/software codesign (2000)

We present a technique for task response time improvement based on the concept of code motion from the software domain. Relaxed Operation Motion (ROM) is a simple yet powerful approach for performing safe and useful operation motion from heavily executed portions of a design task to less visited segments. We introduce here our algorithm, how it differs from other code motion approaches, and its application to the embedded systems domain. Results of our investigation indicate that cost-guided operation motion has the potential to improve task response time significantly.
Influence sets based on reverse nearest neighbor queries
Authors: Flip Korn, S. Muthukrishnan
Venue: ACM SIGMOD Record (2000)

Inherent in the operation of many decision support and continuous referral systems is the notion of the &ldquo;influence&rdquo; of a data point on the database. This notion arises in examples such as finding the set of customers affected by the opening of a new store outlet location, notifying the subset of subscribers to a digital library who will find a newly added document most relevant, etc. Standard approaches to determining the influence set of a data point involve range searching and nearest neighbor queries. In this paper, we formalize a novel notion of influence based on reverse neighbor queries and its variants. Since the nearest neighbor relation is not symmetric, the set of points that are closest to a query point (i.e., the nearest neighbors) differs from the set of points that have the query point as their nearest neighbor (called the reverse nearest neighbors). Influence sets based on reverse nearest neighbor (RNN) queries seem to capture the intuitive notion of influence from our motivating examples. We present a general approach for solving RNN queries and an efficient R-tree based method for large data sets, based on this approach. Although the RNN query appears to be natural, it has not been studied previously. RNN queries are of independent interest, and as such should be part of the suite of available queries for processing spatial and multimedia data. In our experiments with real geographical data, the proposed method appears to scale logarithmically, whereas straightforward sequential scan scales linearly. Our experimental study also shows that approaches based on range searching or nearest neighbors are ineffective at finding influence sets of our interest.
A tool for designing Java programs with UML
Authors: Anna Armentrout
Venue: ACM SIGCSE Bulletin (1999)

This project intends to develop a simple UML (Unified Modeling Language) tool in Java to be used by students learning object-oriented design and Java programming. Each student will be able to design a Java program by filling in forms (use cases, CRC cards) and making diagrams (use case diagrams, class diagrams and sequence diagrams) in a number of views. When the student enters information for any one of the views the tool will update the equivalent information for the other views. The tool will generate Java skeleton code from information supplied by the student.
A Distributed Object-Oriented Language for Heterogeneous Computer Networks
Authors: Agostino Poggi, Giuliano Armano
Venue: The Journal of Supercomputing (1999)

This paper presents an object-oriented distributed language, called CUBL++, that is a powerful tool for developing distributed applications on heterogeneous computer networks. CUBL++ is based on objects, called c&lowbar;units, that communicate through synchronous and asynchronous message passing. A c&lowbar;unit is an active object composed of data (state) and procedures as traditional (passive) objects, together with the capability of queueing incoming messages, when needed. C&lowbar;units allow a programmer to implement an application on a heterogeneous architecture, as they communicate with each other without taking into account the physical characteristics of the actual node where they are located. We have experimented CUBL++ on a network where UNIX workstations, WindowsNT personal computers and transputers cooperate in order to perform a given task. In particular, this paper gives a brief description of a distributed system for image processing that has been implemented by using CUBL++.
Integration of text retrieval technology into formatted (conventional) information systems
Authors: Offer Drori
Venue: ACM SIGSOFT Software Engineering Notes (1999)

Conventional information systems are characterized by data management, which is formatted according to the characterization, prepared by a systems analyst, in conjunction with the user of the new system. The operating principles of these systems enable efficient data management and the resolution of a broad range of problems. At times, systems of this nature do not meet the complex needs of an organization, such as the management of data that is difficult to characterize precisely, or the management of occasional activities that do not justify a separate system, etc.Text retrieval technology provides management of "open" data, as well as a wide range of other data management forms. This paper presents the advantages of integrating text retrieval technology into formatted information systems in order to solve the above problems.
Surface light fields for 3D photography
Authors: Daniel N. Wood, Daniel I. Azuma, Ken Aldinger, Brian Curless, Tom Duchamp, David H. Salesin, Werner Stuetzle
Venue: Proceedings of the 27th annual conference on Computer graphics and interactive techniques (2000)

A surface light field is a function that assigns a color to each ray originating on a surface. Surface light fields are well suited to constructing virtual images of shiny objects under complex lighting conditions. This paper presents a framework for construction, compression, interactive rendering, and rudimentary editing of surface light fields of real objects. Generalization of vector quantization and principal component analysis are used to construct a compressed representation of an object's surface light field from photographs and range scans. A new rendering algorithm achieves interactive rendering of images from the compressed representation, incorporating view-dependent geometric level-of-detail control. The surface light field representation can also be directly edited to yield plausible surface light fields for small changes in surface geometry and reflectance properties.
A 220-MSample/s CMOS Sample-and-Hold Circuit Using Double-Sampling
Authors: Mikko Waltari, Kari Halonen
Venue: Analog Integrated Circuits and Signal Processing (1999)

A fully differential sample-and-hold (S/H) circuit using double-sampling is presented. Compared to a conventional S/H configuration with a similar opamp the double-sampling gives a factor of two increase in the sampling rate while maintaining comparable power consumption. The circuit is designed in a 0.5 &mu;m CMOS technology. The measurements show 10-bit operation up to the Nyquist frequency at the sampling rate of 220 MS/s with 25 mW &commat; 3 V power dissipation.
Garbage collection of timestamped data in Stampede
Authors: Rishiyur S. Nikhil, Umakishore Ramachandran
Venue: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (2000)

Stampede is a parallel programming system to facilitate the programming of interactive multimedia applications on clusters of SMPs. In a Stampede application, a variable number of threads can communicate data items to each other via channels, which are distributed, synchronized data structures containing timestamped data such as images from a video camera. Channels are not queue-like: threads may produce and consume items out of timestamp order; they may produce and consume items sparsely (skipping timestamps), and multiple threads (including newly created threads) may consume an item in a channel. These flexibilities are required due to the complex dynamic parallel structure of applications, to support increased parallelism, and because of real-time requirements. Under these circumstances, a key issue is the &ldquo;garbage collection condition&rdquo;: When can an item in a channel be garbage collected? In this paper we specify precisely Stampede's semantics concerning timestamps, and we describe two associated garbage collection conditions a weak condition, and a more expensive but stronger condition. We then describe a distributed, concurrent algorithm that implements these two GC conditions. We present performance numbers that show little or no application-level performance penalty to using this algorithm for aiding automatic garbage collection in a cluster. We conclude with some remarks about the implementation in the Stampede system.
Tool support for cooperative object-oriented design: gesture based modelling on an electronic whiteboard
Authors: Christian Heide Damm, Klaus Marius Hansen, Michael Thomsen
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

Modeling is important in object-oriented software development. Although a number of Computer Aided Software Engineering (CASE) tools are available, and even though some are technically advanced, few developers use them. This paper describes our attempt to examine the requirements needed to provide tool support for the development process, and describes and evaluates a tool, Knight, which has been developed based on these requirements. The tool is based on a direct, whiteboard-like interaction achieved using gesture input on a large electronic whiteboard. So far the evaluations have been successful and the tool shows the potential of greatly enhancing current support for object-oriented modeling.
Exponential Integrators for Large Systems of Differential Equations
Authors: Marlis Hochbruck, Christian Lubich, Hubert Selhofer
Venue: SIAM Journal on Scientific Computing (1998)

We study the numerical integration of large stiff systems of differential equations by methods that use matrix--vector products with the exponential or a related function of the Jacobian. For large problems, these can be approximated by Krylov subspace methods, which typically converge faster than those for the solution of the linear systems arising in standard stiff integrators. The exponential methods also offer favorable properties in the integration of differential equations whose Jacobian has large imaginary eigenvalues. We derive methods up to order 4 which are exact for linear constant-coefficient equations. The implementation of the methods is discussed. Numerical experiments with reaction-diffusion problems and a time-dependent Schrödinger equation are included.
The Many-Player Advertising Game
Authors: José Manuel Campa, Mauro F. Guillén, Gila E. Fruchter
Venue: Management Science (1999)

This study extends the time-variant closed-loop strategy of Fruchter and Kalish (1997) to the n-player advertising game. We demonstrate that solving an n-player game using 2 players results in overadvertising.
Hazard-Free Self-Timed Design: Methodology and Application to Asynchronous Routing in an Heterogeneous Parallel Machine
Authors: Eric Senn, Bertrand Zavidovique
Venue: Journal of VLSI Signal Processing Systems (1999)

The goal of this research is to enable the actual building of parallel machines. The example chosen in this paper is a heterogeneous parallel machine with an intrinsic asynchronous behavior. An asynchronous router fully supports such a logical asynchronism. However, every parallel processor would exhibit asynchronism similar enough to warrant the study of a general methodology. The main part of the paper deals with an original method that ensures a hazard-free self-timed design assuming the worst conditions for robustness. Hazards are classified under three types. On top of logic hazards that resort to implementation, equation hazards are eliminated by an optimal covering. A new variable labelled state-trajectory is proposed: its integrity guarantees immunity to function hazards. The method was fruitfully applied to the VLSI CMOS implementation of the above-mentioned router. Peculiar fully customized cells were designed. Circuit-measured performances as well as some machine inner-communication performances are presented.
Constraint satisfaction and database theory: a tutorial
Authors: Moshe Y. Vardi
Venue: Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2000)

A large class of problems in AI and other areas of computer science can be viewed as constraint-satisfaction problems. This includes problems in machine vision, belief maintenance, scheduling, temporal reasoning, type reconstruction, graph theory, and satisfiability. In general, the constraint satisfaction-problem is NP-complete, so searching for tractable cases is an active research area. It turns out that constraint satisfaction has an intimate connection with database theory: constraint-satisfaction problems can be recast as database problems and database problems can be recast as constraint-satisfaction problems. In this tutorial, I will cover the fundamentals of constraints satisfaction and describe its intimate relationship with database theory from various perspectives.
Efficient generation of all regular non-dominated coteries
Authors: Kazuhisa Makino, Tiko Kameda
Venue: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (2000)

A coterie is a family of subsets such that every pair of subsets in it has at least one element in common but neither is a subset of the other. We introduce an operator &sgr;, which transforms a ND (non-dominated; see the Introduction for definition) coterie to another ND coterie. A &ldquo;regular&rdquo; coterie is a natural generalization of a &ldquo;vote-assignable&rdquo; coterie, which is used in some practical applications. We show that any regular ND coterie C can be transformed to any other regular ND coterie D by judiciously applying &sgr; operations to C at most |C| + |D| - 2 times. As another application of the &sgr; operation, we present an incrementally-polynomial-time algorithm for generating all regular ND coteries. We then introduce the concept of a &ldquo;g-regular&rdquo; function, as a generalization of availability. We show how to construct an optimum coterie C with respect to a g-regular function in O(n3|C|) time.
Developing a State Outcomes Monitoring System in Public Health Maternal and Child Health
Authors: Sharon Telleen
Venue: Journal of Medical Systems (1999)

State outcomes monitoring systems are increasingly important as state governments develop outcomes-based accountability in response to recent federal legislation. A state outcomes monitoring system developed for state and local maternal and child public health departments allows for outcomes research as well as administration and management.
Bringing object-relational technology to the mainstream
Authors: Vishu Krishnamurthy, Sandeepan Banerjee, Anil Nori
Venue: Proceedings of the 1999 ACM SIGMOD international conference on Management of data (1999)

Over the last few years, Oracle has evolved its flagship relational database system into an Object-Relational system by adding an extensible type system, object storage, an object cache, an extensible query and indexing framework, support for multimedia datatypes, a server-based scalable Java virtual machine, as well as enhancing its SQL DDL and DML language. These extensions were done with the practical goal of bringing objects to mainstream use.