ppxscal/embedding_network huggingface dataset:
Intelligent gaze-added interfaces
Authors: Dario D. Salvucci, John R. Anderson
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

We discuss a novel type of interface, the intelligent gaze-added interface, and describe the design and evaluation of a sample gaze-added operating-system interface. Gaze-added interfaces, like current gaze-based systems, allow users to execute commands using their eyes. However, while most gaze-based systems replace the functionality of other inputs with that of gaze, gaze-added interfaces simply add gaze functionality that the user can employ if and when desired. Intelligent gaze-added interfaces utilize a probabilistic algorithm and user model to interpret gaze focus and alleviate typical problems with eye-taking data. We extended a standard WIMP operating-system interface into a new interface, IGO, that incorporates intelligent gaze-added input. In a user study, we found that users quickly adapted to the new interface and utilized gaze effectively both alone and with other inputs.
Synthesis of asynchronous control circuits with automatically generated relative timing assumptions
Authors: Jordi Cortadella, Michael Kishinevsky, Steven M. Burns, Ken Stevens
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

This paper describes a method of synthesis of asynchronous circuits with relative timing. Asynchronous communication between gates and modules typically utilizes handshakes to ensure functionality. Relative timing assumptions in the form &ldquo;event a occurs before event b&rdquo; can be used to remove redundant handshakes and associated logic. This paper presents a method for automatic generation of relative timing assumptions from the untimed specification. These assumptions can be used for area and delay optimization of the circuit. A set of relative timing constraints sufficient for the correct operation of the circuit is back-annotated to the designer. Experimental results for control circuits of a prototype iA32 instruction length decoding and steering unit called RAPPID (&ldquo;Revolving Asynchronous Pentium&reg; Processor Instruction Decoder&rdquo;) shows significant improvements in area and delay over speed-independent circuits.
On the Solution of Convection-Diffusion Boundary Value Problems Using Equidistributed Grids
Authors: C. J. Budd, G. P. Koomullil, A. M. Stuart
Venue: SIAM Journal on Scientific Computing (1998)

The effect of using grid adaptation on the numerical solution of model convection-diffusion equations with a conservation form is studied. The grid adaptation technique studied is based on moving a fixed number of mesh points to equidistribute a generalization of the arc-length of the solution. In particular, a parameter-dependent monitor function is introduced which incorporates fixed meshes, approximate arc-length equidistribution, and equidistribution of the absolute value of the solution, in a single framework. Thus the resulting numerical method is a coupled nonlinear system of equations for the mesh spacings and the nodal values. A class of singularly perturbed problems, including Burgers's equation in the limit of small viscosity, is studied. Singular perturbation and bifurcation techniques are used to analyze the solution of the discretized equations, and numerical results are compared with the results from the analysis. Computation of the bifurcation diagram of the system is performed numerically using a continuation method and the results are used to illustrate the theory. It is shown that equidistribution does not remove spurious solutions present on a fixed mesh and that, furthermore, the spurious solutions can be stable for an appropriate moving mesh method.
A non-overlapping domain decomposition method for the advection-diffusion problem
Authors: G. Lube, L. Müller, F. C. Otto
Venue: Computing (2000)

The application of a non-overlapping domain decomposition method to the solution of a stabilized finite element method for elliptic boundary value problems is considered. We derive an a-posteriori error estimate which bounds the error on the subdomains by the interface error of the subdomain solutions. As a by-product, some foundation is given to the design of the interface transmission condition. Numerical results support the theoretical results. Furthermore, we adapt a recent result on a-posteriori estimates for singular perturbation problems in order to obtain an a-posteriori estimate for the discrete subdomain solutions. &mdash;Authors' Abstract
Subspace methods for blind joint channel estimation and multiuser detection in CDMA systems
Authors: Xiaodong Wang, H. Vincent Poor
Venue: Wireless Networks (2000)

Recently developed subspace techniques for blind adaptive multiuser detection are briefly reviewed first. In particular, blind methods based on signal subspace tracking for adapting linear multiuser detectors in AWGN CDMA channels are considered, as well as extensions of these techniques to frequency selective fading channels, dispersive channels, and antenna array spatial processing. In addition, subspace&dash;based nonlinear adaptive techniques for robust blind multiuser detection in non&dash;Gaussian ambient noise channels are also described. Several new techniques are then developed within the subspace framework for blind joint channel estimation and multiuser detection, under some specific channel conditions. These include &lpar;1&rpar; an adaptive receiver structure for joint multiuser detection and equalization in dispersive CDMA channels, &lpar;2&rpar; a subspace method for joint multiuser detection and equalization in unknown correlated noise, and &lpar;3&rpar; a method for joint interference suppression and channel tracking in time&dash;varying fading channels.
Random sampling techniques for space efficient online computation of order statistics of large datasets
Authors: Gurmeet Singh Manku, Sridhar Rajagopalan, Bruce G. Lindsay
Venue: ACM SIGMOD Record (1999)

In a recent paper [MRL98], we had described a general framework for single pass approximate quantile finding algorithms. This framework included several known algorithms as special cases. We had identified a new algorithm, within the framework, which had a significantly smaller requirement for main memory than other known algorithms. In this paper, we address two issues left open in our earlier paper. First, all known and space efficient algorithms for approximate quantile finding require advance knowledge of the length of the input sequence. Many important database applications employing quantiles cannot provide this information. In this paper, we present a novel non-uniform random sampling scheme and an extension of our framework. Together, they form the basis of a new algorithm which computes approximate quantiles without knowing the input sequence length. Second, if the desired quantile is an extreme value (e.g., within the top 1% of the elements), the space requirements of currently known algorithms are overly pessimistic. We provide a simple algorithm which estimates extreme values using less space than required by the earlier more general technique for computing all quantiles. Our principal observation here is that random sampling is quantifiably better when estimating extreme values than is the case with the median.
Experimental Evaluation of Behavior-Based Failure-Detection Schemes in Real-Time Communication Networks
Authors: Seungjae Han
Venue: IEEE Transactions on Parallel and Distributed Systems (1999)

Effective detection of failures is essential for reliable communication services. Traditionally, non-real-time computer networks have relied on behavior-based techniques for detecting communication failures. That is, each node uses heartbeats to detect the failure of its neighbors and the end-to-end transport protocol (e.g., TCP) achieves reliable communication by acknowledgment/retransmission. Recently, there has been a growing demand for reliable ¿real-time¿ communication, but little research has been done on the failure detection problem. In this paper, we present two behavior-based failure-detection schemes¿neighbor detection and end-to-end detection¿for reliable real-time communication services and experimentally evaluate their effectiveness. Specifically, we measure and analyze the coverage and latency of these detection schemes through fault-injection experiments. The experimental results have shown that nearly all failures can be detected very quickly by the neighbor detection scheme, while the end-to-end detection scheme uncovers the remaining failures with larger detection latencies.
Certain algorithmic problems for Lie algebras
Authors: A. I. Shirshov
Venue: ACM SIGSAM Bulletin (1999)

This short paper describes work similar to that appearing in Buchberger's 1965 thesis inventing Gr ouml;bner bases, but in the context of Lie Algebras. Preceding Buchberger by only three years, this paper, along with the two cited references, are the original papers defining what have become known as Gr ouml;bner-Shirshov bases.
Actor-Critic--Type Learning Algorithms for Markov Decision Processes
Authors: Vijaymohan R. Konda, Vivek S. Borkar
Venue: SIAM Journal on Control and Optimization (1999)

Algorithms for learning the optimal policy of a Markov decision process (MDP) based on simulated transitions are formulated and analyzed. These are variants of the well-known "actor-critic" (or "adaptive critic") algorithm in the artificial intelligence literature. Distributed asynchronous implementations are considered. The analysis involves two time scale stochastic approximations.
Designing multimedia for learning: narrative guidance and narrative construction
Authors: Lydia Plowman, Rosemary Luckin, Diana Laurillard, Matthew Stratfold, Josie Taylor
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

Narrative is fundamental to the ways we make sense of texts of all kinds because it provides structure and coherence, but it is difficult to see how this works in the context of multimedia interactive learning environments (MILES). We tested our hypotheses about the form and function of narrative in MILES by developing three versions of material on CD-ROM which had different narrative structures and analysed the impact of the different versions on learner behaviour. We present a theoretical framework in which we explain the concepts of narrative guidance and narrative construction and their application to the design of MILES.
Entrepreneurship for information systems researchers (invited tutorial) (abstract only)
Authors: Ashish Gupta
Venue: Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2000)

Today's environment offers tremendous opportunity for researchers to contribute to the advancement of commercial enterprises. Traditionally this involvement has been in the form of research grants from larger organizations and combined projects with research laboratories or advance development centers. More recently the involvement has been in the form of researchers starting or helping start small companies that are productising cutting edge technology.This tutorial will discuss logistics of start up companies, funding, and other issues associated with commercialising technology through the start-up route. Questions will be answered by the speaker and by knowledgeable members of the audience.
Local Labeling and Resource Allocation Using Preprocessing
Authors: Hagit Attiya, Hadas Shachnai, Tami Tamir
Venue: SIAM Journal on Computing (1999)

This paper studies the power of nonrestricted preprocessing on a communication graph G, in a synchronous, reliable system. In our scenario, arbitrary preprocessing can be performed on G, after which a sequence of labeling problems has to be solved on different subgraphs of G. We suggest a preprocessing that produces an orientation of G. The goal is to exploit this preprocessing for minimizing the radius of the neighborhood around each vertex from which data has to be collected in order to determine a label. We define a set of labeling problems for which this can be done. The time complexity of labeling a subgraph depends on the topology of the graph G and is always less than $\min\{\chi(G), O((\log n)^{2})\}$. On the other hand, we show the existence of a graph for which even unbounded preprocessing does not allow fast solution of a simple labeling problem. Specifically, it is shown that a processor needs to know its $\Omega(\log n / \log \log n)$-neighborhood in order to pick a label.Finally, we derive some results for the resource allocation problem. In particular, we show that $\Omega(\log n / \log \log n)$ communication rounds are needed if resources are to be fully utilized. In this context, we define the compact coloring problem, for which the orientation preprocessing provides fast distributed labeling algorithm. This algorithm suggests efficient solution for the resource allocation problem.
Probabilistic 3D Object Recognition
Authors: Ilan Shimshoni, Jean Ponce
Venue: International Journal of Computer Vision (2000)

A probabilistic 3D object recognition algorithm is presented. In order to guide the recognition process the probability that match hypotheses between image features and model features are correct is computed. A model is developed which uses the probabilistic peaking effect of measured angles and ratios of lengths by tracing iso-angle and iso-ratio curves on the viewing sphere. The model also accounts for various types of uncertainty in the input such as incomplete and inexact edge detection. For each match hypothesis the pose of the object and the pose uncertainty which is due to the uncertainty in vertex position are recovered. This is used to find sets of hypotheses which reinforce each other by matching features of the same object with compatible uncertainty regions. A probabilistic expression is used to rank these hypothesis sets. The hypothesis sets with the highest rank are output. The algorithm has been fully implemented, and tested on real images.
Achieving the best performance on superscalar processors
Authors: H. S. Shahhoseini, M. Naderi, S. Nemati
Venue: ACM SIGARCH Computer Architecture News (1999)

In this paper the operation of a superscalar processor is studied. An analytical model is developed for computing the throughput and the speedup of the superscalar processors. The throughput is computed as a function of the reoccurrence period of the instructions in the program. It is shown that, when the number of the instructions is sufficiently large, the probability of referring to the different pipes and the number of pipes are more important than the length of the pipes.Also the results show that maximum throughput of a p-issues superscalar processor is equal to p instructions per cycle. This upper bound is reachable if and only if some conditions for reoccurrence period of the instructions in the program are fulfilled. At the end of the paper some remarks related to the structural designing and the number of pipes are offered.
Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
Authors: Nader H. Bshouty, Jeffrey C. Jackson
Venue: SIAM Journal on Computing (1999)

We generalize the notion of probably approximately correct (PAC) learning from an example oracle to a notion of efficient learning on a quantum computer using a quantum example oracle. This quantum example oracle is a natural extension of the traditional PAC example oracle, and it immediately follows that all PAC-learnable function classes are learnable in the quantum model. Furthermore, we obtain positive quantum learning results for classes that are not known to be PAC learnable. Specifically, we show that disjunctive normal form (DNF) is efficiently learnable with respect to the uniform distribution by a quantum algorithm using a quantum example oracle. While it was already known that DNF is uniform-learnable using a membership oracle, we prove that a quantum example oracle with respect to uniform is less powerful than a membership oracle.
Cost-effective Management of International Networks
Authors: Floris G. H. van den Broek, Maarten G. H. Looijen
Venue: International Journal of Network Management (1997)

This article describes the influence of a country&rsquo;s regulatory framework and availability of services on the management of an international network. &copy; 1997 John Wiley Sons, Ltd.
A Class of Highly Scalable Optical Crossbar-Connected Interconnection Networks (SOCNs) for Parallel Computing Systems
Authors: Brian Webb, Ahmed Louri
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

A class of highly scalable interconnect topologies called the Scalable Optical Crossbar-Connected Interconnection Networks (SOCNs) is proposed. This proposed class of networks combines the use of tunable Vertical Cavity Surface Emitting Lasers (VCSEL's), Wavelength Division Multiplexing (WDM) and a scalable, hierarchical network architecture to implement large-scale optical crossbar based networks. A free-space and optical waveguide-based crossbar interconnect utilizing tunable VCSEL arrays is proposed for interconnecting processor elements within a local cluster. A similar WDM optical crossbar using optical fibers is proposed for implementing intercluster crossbar links. The combination of the two technologies produces large-scale optical fan-out switches that could be used to implement relatively low cost, large scale, high bandwidth, low latency, fully connected crossbar clusters supporting up to hundreds of processors. An extension of the crossbar network architecture is also proposed that implements a hybrid network architecture that is much more scalable. This could be used to connect thousands of processors in a multiprocessor configuration while maintaining a low latency and high bandwidth. Such an architecture could be very suitable for constructing relatively inexpensive, highly scalable, high bandwidth, and fault-tolerant interconnects for large-scale, massively parallel computer systems. This paper presents a thorough analysis of two example topologies, including a comparison of the two topologies to other popular networks. In addition, an overview of a proposed optical implementation and power budget is presented, along with analysis of proposed media access control protocols and corresponding optical implementation.
Achieving utility arbitrarily close to the optimal with limited energy
Authors: Gang Qu, Miodrag Potkonjak
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

Energy is one of the limited resources for modern systems, especially the battery-operated devices and personal digital assistants. The backlog in new technologies for more powerful battery is changing the traditional system design philosophies. For example, due to the limitation on battery life, it is more realistic to design for the optimal benefit from limited resource rather than design to meet all the applications' requirement. We consider the following problem: a system achieves a certain amount of utility from a set of applications by providing them certain levels of quality of service(QoS). We want to allocate the limited system resources to get the maximal system utility. We formulate this utility maximization problem, which is NP-hard in general, and propose heuristic algorithms that are capable of finding solutions provably arbitrarily close to the optimal. We have also derived explicit formulae to guide the allocation of resources to actually achieve such solutions. Simulation shows that our approach can use 99.9% of the given resource to achieve 25.6% and 32.17% more system utilities over two other heuristics, while providing QoS guarantees to the application program.
Robust Tracking of Position and Velocity With Kalman Snakes
Authors: Natan Peterfreund
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1999)

A new Kalman-filter based active contour model is proposed for tracking of nonrigid objects in combined spatio-velocity space. The model employs measurements of gradient-based image potential and of optical-flow along the contour as system measurements. In order to improve robustness to image clutter and to occlusions an optical-flow based detection mechanism is proposed. The method detects and rejects spurious measurements which are not consistent with previous estimation of image motion.
Video anywhere: a system for searching and managing distributed heterogeneous video assets
Authors: Amit Sheth, Clemens Bertram, Kshitij Shah
Venue: ACM SIGMOD Record (1999)

Visual information, especially videos, plays an increasing role in our society for both work and entertainment as more sources become available to the user. Set-top boxes are poised to give home users access to videos that come not only from TV channels and personal recordings, but also from the Internet in the form of downloaded and streaming videos of various types. Current approaches such as Electronic Program Guides and video search engines search for video assets of one type or from one source. The capability to conveniently search through many types of video assets from a large number of video sources with easy-to-use user profiles cannot be found anywhere yet. VideoAnywhere has developed such a capability in the form of an extensible architecture as well as a specific implementation using the latest in Internet programming (Java, agents, XML, etc.) and applicable standards. It automatically extracts and manages an extensible set of metadata of major types of videos that can be queried using either attribute-based or keyword-based search. It also provides user profiling that can be combined with the query processing for filtering. A user-friendly interface provides management of all system functions and capabilities. VideoAnywhere can also be used as a video search engine for the Web, and a servlet-based version has also been implemented.
The GRD Chip: Genetic Reconfiguration of DSPs for Neural Network Processing
Authors: Masahiro Murakawa, Shuji Yoshizawa, Isamu Kajitani, Xin Yao, Nobuki Kajihara, Masaya Iwata, Tetsuya Higuchi
Venue: IEEE Transactions on Computers (1999)

This paper describes the GRD (Genetic Reconfiguration of DSPs) chip, which is evolvable hardware designed for neural network applications. The GRD chip is a building block for the configuration of a scalable neural network hardware system. Both the topology and the hidden layer node functions of a neural network mapped on the GRD chips are dynamically reconfigured using a genetic algorithm (GA). Thus, the most desirable network topology and choice of node functions (e.g., Gaussian or sigmoid function) for a given application can be determined adaptively. This approach is particularly suited to applications requiring the ability to cope with time-varying problems and real-time constraints. The GRD chip consists of a 100Mhz 32-bit RISC processor and 15 33Mhz 16-bit DSPs connected in a binary-tree network. The RISC processor is the NEC V830 which executes mainly the GA. According to chromosomes obtained by the GA, DSP functions and the interconnection among them are dynamically reconfigured. The GRD chip does not need a host machine for this reconfiguration. This is desirable for embedded systems in practical industrial applications. Simulation results on chaotic time series prediction are two orders of magnitude faster than on a Sun Ultra 2.
Petabyte databases
Authors: Dirk Düllmann
Venue: Proceedings of the 1999 ACM SIGMOD international conference on Management of data (1999)

This paper describes the use of Object-Database Management Systems (ODBMS)for the storage of High-Energy Physics (HEP) data.