ppxscal/embedding_network huggingface dataset:
Bread Crumbs: A Technique for Modelling Large Outdoor Ground Features
Authors: Wayne Piekarski, Bruce H. Thomas
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

This paper presents a new technique we have created, known as Bread Crumbs, which allows the modelling of large outdoor ground features using a mobile augmented reality system and a user's physical presence. Using this technique, we demonstrate an example of modelling a large grassy area on campus. This technique is one component of a larger set oftools which allow users to capture and work with complex outdoor geometry interactively, and to view this geometry in new and interesting ways.
Transmitting Datacubes over Congested Networks
Authors: A. Albanese, M. Cannataro, P. Rullo, D. Saccá
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

The On-Line Analytical Processing is an emerging technique for the implementation of decision support applications that access remote datacubes over information highways. In this paper, we propose a novel approach for sending datacubes over congested networks, so that, in order to preserve fast response time, some datacube tuple can be eventually lost but preserving a good approximation of the overall datacube. The main idea is to prioritize the datacube information and to send it using a priority-based transmission protocol.The proposed method relies on two well-known techniques: the wavelet decomposition, for the encoding of the datacube into a sequence of prioritized coefficients, and the Priority Encoding Transmission protocol, to delivery them. To reconstruct the datacube with a user-defined error level, priorities are assigned using a thresholding technique. Preliminary experimental results are very encouraging.
Assessment of the ACSE Science Learning Environment
Authors: John F. Pane
Venue:  (1994)

This paper describes an empirical study that assesses a multimedia science learning environment, and the impact on student learning of movies and simulations as lesson components. The study measures summative effects on student performance and satisfaction, and gathers formative data about student use of the environment for iterative improvement to the system and lessons. Two lessons containing movies and simulations were compared with lessons that used static graphics to present the same material. Preliminary results show that participants using the lesson with movies and simulations spend significantly more time working through the material, and score higher on questions that target material that is presented with simulation. Analysis of usage patterns identifies features of the system that are effective, underutilized, misunderstood or problematic.
Non-Rigid Shape from Image Streams
Authors: Stan Sclaroff, Jonathan Alon
Venue:  (1999)

Abstract We present a framework for estimating 3D relative structure (shape) and motion given objects undergoing nonrigid deformation as observed from a fixed camera, under perspective projection. Deforming surfaces are approximated as piece-wise planar, and piece-wise rigid. Robust registration methods allow tracking of corresponding image patches from view to view and recovery of 3D shape despite occlusions, discontinuities, and varying illumination conditions. Many relatively small planar/rigid image patch trackers are scattered throughout the image; resulting estimates of structure and motion at each patch are combined over local neighborhoods via an oriented particle systems formulation. Preliminary experiments have been conducted on real image sequences of deforming objects and on synthetic sequences where ground truth is known.
Manual of the TYPO type checker
Authors: J. M.G.G. Nivelle
Venue:  (1998)

TYPO is a type checker which implements typed lambda calculus with the purpose of formalizing mathematical proofs. TYPO has been constructed with the following design objectives: (1) Easy installation. In order to obtain this goal the program has been written in portable C. The program has modest memory demands. (2) Access to the proof terms. A formalized theory is represented as an ASCII file containing the definitions/theorems and proofs as lambda terms. (3) Maintainability. In order to obtain this goal the program has not been optimized for speed. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Design for Variability in DSM Technologies
Authors: Sani R. Nassif
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Process-induced parameter variations cause performance actuations and are an important consideration in the design of high performance digital ICs. Until recently, it was sufficient to model die-to-die shifts in device (active) and wire (passive) parameters, leading to a natural worst-case design methodology [1, 2].In the deep-submicron era, however, within-die variations in these same device and wire parameters become just as important. In fact, current integrated circuits are large enough that variations within the die are as large as variations from die-to-die. Furthermore, while die-to-die shifts are substantially independent of the design, within-die variations are profoundly influenced by the detailed physical implementation of the IC.This changes the fundamental view of process variability from something that is imposed on the design by the fabrication process to something that is co-generated between the design and the process. This paper starts by examining the sources and historical trends in device and wire variability, distinguishing between inter-die and intra-die variations, and proposes techniques for design for variability (DOV) in the presence of both types of variations.
Research report: information animation applications in the capital markets
Authors: W. Wright
Venue: Proceedings of the 1995 IEEE Symposium on Information Visualization (1995)

3D computer graphics can be extremely expressive. It is possible to display an entire securities market, like the S&P 500, on a single screen. With the correct approach to the visual design of the layout, these massive amounts of information can be quickly and easily comprehended by a human observer. By using motion and animated interaction, it is possible to use 3D as a reliable, accurate and precise decision-support tool. Information animation applications are particularly suited to the securities industry because that is where we find huge amounts of data, the value of which declines rapidly with time, and where critical decisions are being made on this data in very short periods of time. Information animation technology is an important new tool for the securities industry, where people need to be in the decision-making loop without suffering from information overload. Several examples are discussed including equity trading analytics, fixed income trading analytics and fixed-income risk viewing.
Reuse sensitive process models: are process elements software assets too?
Authors: S. Arbaoui, F. Oquendo
Venue: Proceedings of the 10th International Software Process Workshop (1996)

It is well recognised that development with reuse, or reuse-sensitive software process, contribute to software quality improvement. Reusability is one of the software quality factors and represents an appropriate solution for the development of complex software systems that are more and more considered a composition of reusable software assets. The challenge is no more in building new products from scratch, but in reusing and integrating various existing (eventually large and complex) assets supplied by a number of different producers, tailoring them to a specific market or architecture and controlling the evolution of these products with respect to the evolution of the individual assets. Such a strategy, known as system composition, has several advantages which are described. In return, reuse-sensitive software process requires in general a great deal of knowledge about the application domain and previous applications. We come back to this discussion, and extend it by advocating that software process models are complex software systems and this leads us to the following issue: why don't we apply a reuse-sensitive process to support process model development? In this way we will "inherit" from software engineering a well recognised and successful methodology (i.e. reuse methodology), adapt it, and use it to provide a support to the process model development process, i.e. metaprocess, which remains a critical and open issue.
Hypermedia Aided Learning (HAL): A Viewpoint on Delivering Education in the New Millennium
Venue: Proceedings of the International Conference on Information Visualisation (2000)

This paper will discuss the emergence of Multimedia systems and with it the emergence of hypermedia as a new and powerful learning medium. The effects of this new technology on Computer Aided Learning (CAL) as well as problems associated with CAL are discussed. The paper will argue that Hypermedia Aided Learning (HAL) could remedy some of the problems associated with CAL and pave the way for a new generation of powerful learning tools to emerge. Evaluation of HAL as a learning resource is also presented. The problems associated with HAL and the prospects ahead are discussed. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Feasibility concerns in PGM graphs with bounded buffers
Authors: S. Baruah, S. Goddard, K. Jeffay
Venue: Proceedings of the Third IEEE International Conference on Engineering of Complex Computer Systems (1997)

The Processing Graph Method (PGM)-a dataflow model widely used in the design and analysis of embedded signal-processing applications-is studied from a real-time scheduling perspective. It is shown that the problem of deciding if instances of the general model are feasible on a single processor is intractable (co-NP-complete in the strong sense); however, a useful special case is sometimes more tractable. An efficient feasibility test and an optimal preemptive scheduling algorithm are derived for this special case, and a procedure is presented which permits system architects to make efficient use of computational resources and memory requirements for buffers while constructing real-time dataflow applications that offer hard service guarantees.
Panel: How Can Software Reliability Engineering (SRE) Help System Engineers and Software Architects?
Authors: Panel chair: W. Everett Panelists: W. Ehrlich, J. Musa, P. Mangan, R. Yacobellis
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

This panel session will discuss how Systems Engineers and Software Architects can benefit porn using SRE. Members of the panel will discuss how their respective organizations use (or anticipate using) SRE earlier in the software development life-cycle. The intent is to stimulate and encourage those involved in Systems Engineering and Software Architecture to adopt and use SRE in their work.
Relational Petri Nets with Start/Stop Place
Authors: Ali Karci, Ahmet Arslan
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

We have adapted Petri nets and functional dependencies amongst objects to parallel rule languages. After this adaptation, the yielded Petri net - we will call it Relational Petri Nets (RPNs) with Start/Stop Place - is analyzed in this paper. Liveness, reversibility, no conservation and boundedness in practice, consistency, strongly connected of this kind of net have been specified in this work. The properties of transitions are also analyzed in this work.
Bounds on Fundamental Problems in Parallel and Distributed Computation
Authors: Cynthia Dwork
Venue:  (1984)

NO SUPPLIED
Restrictions on the zeros of a polynomial as a consequence of conditions on the coefficients of even powers and odd powers of the variable
Authors: Jiansheng Cao, Robert Gardner
Venue: Journal of Computational and Applied Mathematics (2003)

The classical Eneström-Kakeya Theorem states that if p(z)=Σv=0navzv is a polynomial satisfying 0 ≤ a0 ≤ a1 ≤ ... ≤ an, then all of the zeros of p(z) lie in the region |z| ≤ 1 in the complex plane. Many generalizations of the Eneström-Kakeya theorem exist which put various conditions on the coefficients of the polynomial (such as monotonicity of the moduli of the coefficients). We will introduce several results which put conditions on the coefficients of even powers of z and on the coefficients of odd powers of z. As a consequence, our results will be applicable to some polynomials to which these related results are not applicable.
Highly Concurrent Shared Storage
Authors: Khalil Amiri, Garth A. Gibson, Richard Golding
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Switched system-area networks enable thousands of storage devices to be shared and directly accessed by end hosts, promising databases and file systems highly scalable, reliable storage. In such systems, hosts perform access tasks (read and write) and management tasks (storage migration and reconstruction of data on failed devices.) Each task translates into multiple phases of low-level device I/Os, so that concurrent host tasks accessing shared devices can corrupt redundancy codes and cause hosts to read inconsistent data. Concurrency control protocols that scale to large system sizes are required in order to coordinate on-line storage management and access tasks.In this paper, we identify the tasks that storage controllers must perform, and propose an approach which allows these tasks to be composed from basic operations-called base storage transactions (BSTs)-such that correctness requires only the serializability of the BSTs and not of the parent tasks. We present highly scalable distributed protocols, which exploit storage technology trends and BST properties to achieve serializability while coming within a few percent of ideal performance.
A Problem-Specific Fault-Tolerance Mechanism for Asynchronous, Distributed Systems
Authors: Adriana Iamnitchi, Ian Foster
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

The idle computers on a local area, campus area, or even wide area network represent a significant computational resource-one that is, however, also unreliable, heterogeneous, and opportunistic. We describe an algorithm that allows branch-and-bound problems to be solved in such environments. In designing this algorithm, we faced two challenges: (1) scalability, to effectively exploit the variably sized pools of resources available, and (2) fault tolerance, to ensure the reliability of services. We achieve scalability through a fully decentralized algorithm, in which the dynamically available resources are managed through a membership protocol. We guarantee fault tolerance in the sense that the loss of up to all but one resource will not affect the quality of the solution. For propagating information reliably, we use epidemic communication for both the membership protocol and the fault-tolerance mechanism. We have developed a simulation framework that allows us to evaluate design alternatives. Results obtained in this framework suggest that our techniques can execute scalably and reliably.
Incompressible Flows Based Upon Stabilized Methods
Authors: Leopoldo Franca
Venue:  (1993)

We give a brief overview of our efforts in developing stabilizes finite element methods for incompressible flows. In particular, we review some suggestions for stability parameters and comment once more on the curious relationships between some stable Galerkin and stabilized finite element methods.
A New Bayesian Framework for Object Recognition
Authors: Yuri Boykov, Daniel Huttenlocher
Venue:  (1998)

We describe a new approach to feature-based object recognition, using maximum a posteriori (MAP) estimation under a Markov random field (MRF) model. The main advantage of this approach is that it allows explicit modeling of dependencies between individual features of an object. For instance, we use the approach to model the fact that mismatched features due to partial occlusions tend to form spatially coherent groups rather than being independent. Efficient computation of the MAP estimate in our framework can be accomplished by finding a minimum cut on an appropriately defined graph. An even more efficient approximation, that does not use graph cuts, is also presented. This approximation technique, which we call spatially coherent matching (SCM), is closely related to generalized Hausdorff matching. We report some Monte Carlo experiments showing that the SCM technique improves substantially on the tradeoff between correct detection and false alarms compared with previous feature matching methods such as the Hausdorff distance.
Red Hat Linux: Your Visual Blueprint to Open Source Operating Systems
Authors: Paul Whitehead
Venue:  (2002)

:* This highly visual two-color guide demonstrates step by step how to accomplish more than 100 key Red Hat Linux tasks, from installation to security * Covers the Linux shell, file system, text editor, the X Window System, window manager, and xterm * Explains how to use the Mozilla Web browser and instant messaging, how to administer auto-mounting file systems, and how to burn CDs and configure CD writers * Features more than 500 fully annotated screenshots, expanded introductions, and tips with real-life examples Combining clear, step-by-step screen shots with minimal text, our five Visual series are the ultimate resources for visual learners, who represent up to forty percent of your customers. Teach Yourself VISUALLY guides help computer users get up to speed on a wide range of office productivity, graphics, and Web design software. Offering significantly more coverage than our Simplified series, these books provide real-world tips and illustrate basic and intermediate level techniques using crisp full-color screen shots. Visual Blueprints apply the proven Visual formula to professional-level programming, Web development, and networking tips. Each two-color guide includes self-contained two-page lessons, covering more than 100 key topics, accompanied by practical tips and code samples as well as examples and bonus software on CD-ROM.
Don't move: the T-Rex effect in the predator-prey world
Authors: Todd M. Bacastow, Brian R. Cook, Kam-Chuen Jim, C. Lee Giles
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

To develop robust agents capable of adapting to changes in environment conditions we analyze the effects of introducing noise into multi-agent communication and varying prey movement patterns in a version of the predator-prey pursuit problem. In this simulation, predators communicate with languages evolved using a genetic algorithm. We show the time it takes to capture prey increases as more noise is introduced into the predators' communication string. We show that predator performance under noisy conditions can be improved by training the predators with noise. Increasing the amount of noise during predator training increases the performance capability of the predator, thus reducing the amount of time it takes to capture a prey in noisy conditions. Training against different prey movement patterns can also enhance predator performance. We show that predators trained with prey that stop and move randomly perform best when tested against various prey movements. Alternatively, predators trained against constantly idle, or frozen, prey showed the worst performance. When any type of predator was tested against the frozen prey, the predators had some problems completing the capture. Drawing inspiration from the popular film Jurassic Park, we refer to this phenomenon as the T-Rex effect. Prey that hide or do not move have the greatest probability of surviving. Training predators with factors that normally decrease testing performance helps develop robust predators capable of increased performance under both adverse testing conditions.
Approximation formulae for blocking probabilities in a large Erlang loss system: a probabilistic approach
Authors: F. Theberge, R. R. Mazumdar
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

In this paper, we use a probabilistic approach to present a unified view of classical blocking probabilities approximation formulae for a multi-rate Erlang loss system, both in the finite and infinite population cases. Combining our results with the uniform approximation due to Bleistein, we recover the results Mitra and Morrison which were obtained by saddlepoint techniques. We also show that we can avoid using the uniform approximation to get "specialized" formulae for the heavy, critical, generalized critical and light traffic cases. Numerical results for typical loss levels in the ATM case are presented where we compare the uniform approximation (UA) with the specialized approximations (SA).
An Effective and Robust Algorithm for Finding Principal Angles Between Subspaces Using An A-Based Scalar Product
Authors: Andrew V. Knyazev, Merico E. Argentati
Venue:  (2000)

Computation of principal angles between subspaces is important in many applications, e.g., in statistics and information retrieval. In statistics, the angles are closely related to measures of dependency and covariance of random variables. When applied to column-spaces of matrices, the principal angles describe canonical correlations of a matrix pair. We highlight that all popular software codes for canonical correlations compute only cosine of principal angles, thus, making impossible, because of round-off errors, finding small angles accurately. We review a combination of sine and cosine based algorithms that provides accurate results for all angles. We generalize the method to the computation of principal angles in an A-based scalar product, for a symmetric and positive definite matrix A. We prove basic perturbation theorems for absolute errors for sine and cosine of principal angles with improved constants. Numerical examples and a detailed description of our code are given.
Agent Tcl: A flexible and secure mobile-agent system
Authors: Robert S. Gray
Venue:  (1998)

A mobile agent is an autonomous program that can migrate under its own control from machine to machine in a heterogeneous network. In other words, the program can suspend its execution at an arbitrary point, transport itself to another machine, and then resume execution from the point of suspension. Mobile agents have the potential to provide a {\em single, general framework} in which a wide range of distributed applications can be implemented efficiently and easily. Several challenges must be faced, however, most notably reducing migration overhead, protecting a machine from malicious agents (and an agent from malicious machines), and insulating the agent against network and machine failures. Agent Tcl is a mobile-agent system under development at Dartmouth College that has evolved from a Tcl-only system into a multiple-language system that currently supports Tcl, Java, and Scheme. In this thesis, we examine the motivation behind mobile agents, describe the base Agent Tcl system and its security mechanisms for protecting a machine against malicious agents, and analyze the system''s current performance. Finally, we discuss the security, fault-tolerance and performance enhancements that will be necessary for Agent Tcl and mobile agents in general to realize their full potential.