ppxscal/embedding_network huggingface dataset:
Development of head-mounted projection displays for distributed, collaborative, augmented reality applications
Authors: Jannick P. Rolland, Frank Biocca, Felix Hamza-Lup, Yanggang Ha, Ricardo Martins
Venue: Presence: Teleoperators and Virtual Environments (2005)

Distributed systems technologies supporting 3D visualization and social collaboration will be increasing in frequency and type over time. An emerging type of head-mounted display referred to as the head-mounted projection display (HMPD) was recently developed that only requires ultralight optics (i.e., less than 8 g per eye) that enables immersive multiuser, mobile augmented reality 3D visualization, as well as remote 3D collaborations. In this paper a review of the development of lightweight HMPD technology is provided, together with insight into what makes this technology timely and so unique. Two novel emerging HMPD-based technologies are then described: a teleportal HMPD (T-HMPD) enabling face-to-face communication and visualization of shared 3D virtual objects, and a mobile HMPD (M-HMIPD) designed for outdoor wearable visualization and communication. Finally, the use of HMPD in medical visualization and training, as well as in infospaces, two applications developed in the ODA and MIIND labs respectively, are discussed.
Towards Design of a File Location Selection System in Grid Environments
Authors: Tsung-Ying Wu, Kuan-Ching Li, Hsiao-Hsi Wang, Ching-Hsien Hsu, Kuo-Yang Cheng, Wei-Shun Su, Ming-Hsiao Lee
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

Data Grid is one of key factors to build up large-scale dataset storage system and providing high performance computing capacity, by connecting distributed resources in the Grid. One major challenge in data grids is how to provide good and timely access to huge amount of data in distributed locations, given the high latency of interconnection networks. Parallel downloading methods can improve download efficiency and performance, but the download process should have started from appropriate locations for such achievement. In this paper, we present the design of Location Selection System (LSS) for data grid environments, aiming at the problem of downloading locations. The proposed Location Selection System (LSS) not only provides users for setting their own priority strategies, but also provides two downloading modes, manual and automatic. The proposed techniques included as middleware over data grid platforms optimize file downloads, by improving its efficiency and performance.
Hierarchical Procrustes Matching for Shape Retrieval
Authors: Graham McNeill, Sethu Vijayakumar
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

We introduce Hierarchical Procrustes Matching (HPM), a segment-based shape matching algorithm which avoids problems associated with purely global or local methods and performs well on benchmark shape retrieval tests. The simplicity of the shape representation leads to a powerful matching algorithm which incorporates intuitive ideas about the perceptual nature of shape while being computationally efficient. This includes the ability to match similar parts even when they occur at different scales or positions. While comparison of multiscale shape representations is typically based on specific features, HPM avoids the need to extract such features. The hierarchical structure of the algorithm captures the appealing notion that matching should proceed in a global to local direction.
On the classification of perfect codes: side class structures
Authors: Olof Heden, Martin Hessler
Venue: Designs, Codes and Cryptography (2006)

The side class structure of a perfect 1-error correcting binary code (hereafter referred to as a perfect code) C describes the linear relations between the coset representatives of the kernel of C. Two perfect codes C and C¿ are linearly equivalent if there exists a non-singular matrix A such that AC = C¿ where C and C¿ are matrices with the code words of C and C¿ as columns. Hessler proved that the perfect codes C and C¿ are linearly equivalent if and only if they have isomorphic side class structures. The aim of this paper is to describe all side class structures. It is shown that the transpose of any side class structure is the dual of a subspace of the kernel of some perfect code and vice versa; any dual of a subspace of a kernel of some perfect code is the transpose of the side class structure of some perfect code. The conclusion is that for classification purposes of perfect codes it is sufficient to find the family of all kernels of perfect codes.
Performance of MPI Parallel Applications
Authors: S. Richard, B. Miegemolle, J. M. Garcia, T. Monteil
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

The study of the performance of parallel applications may have different reasons. One of them is the planning of the execution architecture to guaranty a quality of service. In this case, it is also necessary to study the computer hardware, the operating system, the network and the users behavior. This paper proposes different models for those based on simulation. First results of this work show the impact of the network and the necessary precision of communication model in fine-grained parallel applications.
Extracting and improving microarchitecture performance on reconfigurable architectures
Authors: Shobana Padmanabhan, Phillip Jones, David V. Schuehler, Scott J. Friedman, Praveen Krishnamurthy, Huakai Zhang, Roger Chamberlain, Ron K. Cytron, Jason Fritts, John W. Lockwood
Venue: International Journal of Parallel Programming (2005)

Applications for constrained embedded systems require careful attention to the match between the application and the support offered by an architecture, at the ISA and microarchitecture levels. Generic processors, such as ARM and Power PC, are inexpensive, but with respect to a given application, they often overprovision in areas that are unimportant for the application's performance. Moreover, while application-specific, customized logic could dramatically improve the performance of an application, that approach is typically too expensive to justify its cost for most applications. In this paper, we describe our experience using reconfigurable architectures to develop an understanding of an application's performance and to enhance its performance with respect to customized, constrained logic. We begin with a standard ISA currently in use for embedded systems. We modify its core to measure performance characteristics, obtaining a system that provides cycle-accurate timings and presents results in the style of gprof, but with absolutely no software overhead. We then provide cache-behavior statistics that are typically unavailable in a generic processor. In contrast with simulation, our approach executes the program at full speed and delivers statistics based on the actual behavior of the cache subsystem. Finally, in response to the performance profile developed on our platform, we evaluate various uses of the FPGA-realized instruction and data caches in terms of the application's performance.
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach
Authors: Andrew Brzezinski, Gil Zussman, Eytan Modiano
Venue: Proceedings of the 12th annual international conference on Mobile computing and networking (2006)

This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distributed scheduling algorithms for wireless networks have emerged. Due to their distributed operation, these algorithms can achieve only a fraction of the maximum possible throughput. As an alternative to increasing the throughput fraction by designing new algorithms, in this paper we present a novel approach that takes advantage of the inherent multi-radio capability of WMNs. We show that this capability can enable partitioning of the network into subnetworks in which simple distributed scheduling algorithms can achieve 100% throughput. The partitioning is based on the recently introduced notion of Local Pooling. Using this notion, we characterize topologies in which 100% throughput can be achieved distributedly. These topologies are used in order to develop a number of channel assignment algorithms that are based on a matroid intersection algorithm. These algorithms partition a network in a manner that not only expands the capacity regions of the subnetworks but also allows distributed algorithms to achieve these capacity regions. Finally, we evaluate the performance of the algorithms via simulation and show that they significantly increase the distributedly achievable capacity region.
Duality of the notions of controllability and observability for degenerate linear hybrid systems
Authors: A. A. Shcheglova
Venue: Automation and Remote Control (2006)

Consideration was given to the linear system of equations in continuous and discrete time with constant matrices of coefficients which is not explicit in the derivative of the continuous component of the desired vector function. The notion of conjugate system was introduced, and an analog of the Kalman duality theorem relating the notions of total controllability and observability was proved.
Institutions of learning: a report from the trenches
Authors: Jon Abeles, William Casey, Sandy Berube, Kathleen Scharf, Patricia Sachs
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

In 1995 NYNEX, the Communications Workers of America, the International Brotherhood of Electrical Workers, and a consortium of state and community colleges in New York and New England embarked upon an experimental and exploratory joint learning process which presents its stakeholders with an instructive set of institutional, theoretical, and practical challenges. The program, which is called Next Step, was created as a matter of contract between NYNEX and two major unions in order to foster development of "the workforce of the 21st century" in the face of unpredictable changes in market, technology, and organizations in the volatile telecommunications industry. Next Step is a collaboration between institutions -- and layers within those institutions -- each informed by historically distinct understandings of teaching and learning but now committed to synthesizing a new learning strategy for the future. The parties have agreed to approach Next Step as a work in progress, and as an opportunity to investigate how learning happens in the context of challenging work in a volatile industry.
Mixed-Drove Spatio-Temporal Co-occurence Pattern Mining: A Summary of Results
Authors: Mete Celik, Shashi Shekhar, James P. Rogers, James A. Shine, Jin Soung Yoo
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Mixed-drove spatio-temporal co-occurrence patterns (MDCOPs) represent subsets of object-types that are located together in space and time. Discovering MDCOPs is an important problem with many applications such as identifying tactics in battlefields, games, and predator-prey interactions. However, mining MDCOPs is computationally very expensive because the interest measures are computationally complex, datasets are larger due to the archival history, and the set of candidate patterns is exponential in the number of object-types. We propose a monotonic composite interest measure for discovering MDCOPs and a novel MDCOP mining algorithm. Analytical and experimental results show that the proposed algorithm is correct and complete. Results also show the proposed method is computationally more efficient than naïve alternatives.
End-to-end consensus using end-to-end channels
Authors: Matthias Wiesmann, Xavier Defago
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

End-to-end consensus ensures delivery of the same value to the application layer running in distributed processes. Deliveries that have not been acknowledged by the application before a failure are delivered again. End-to-end primitives are important for applications that need to enforce persistency. We present an algorithm that solves the end-to-end consensus problem. Our approach is to build end-to-end consensus using a new type of communication channels, endto- end channels.
The Registration Problem Revisited: Optimal Solutions From Points, Lines and Planes
Authors: Carl Olsson, Fredrik Kahl, Magnus Oskarsson
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

In this paper we propose a practical and efficient method for finding the globally optimal solution to the problem of pose estimation of a known object. We present a framework that allows us to use both point-to-point, point-to-line and point-to-plane correspondences in the optimization algorithm. Traditional methods such as the iterative closest point algorithm may get trapped in local minima due to the non-convexity of the problem, however, our approach guarantees global optimality. The approach is based on ideas from global optimization theory, in particular, convex under-estimators in combination with branch and bound. We provide a provably optimal algorithm and demonstrate good performance on both synthetic and real data.
Developing a Parametric Approach for 3D Modelling Software
Venue: Proceedings of the conference on Information Visualization (2006)

The creation of 3D models is generally considered by newcomers to be a difficult activity requiring a number of skills and considerable practice. This paper describes work in the INHERIT project which aims to address these issues by providing a 3D modelling tool set which is easy to use, requiring few skills and little practice. This is achieved by the development of software tools which are customised to build particular types of model. The key aspect of these tools is the treatment of the underlying data of the 3D model as a tree structure of nodes which consist of parameterised representations of the components of the object being modelled. The tools then automatically generate the graphics primitives that enable the visualisation and interaction with the object. This paper describes the implementation of the first tool created following this principle which enables schoolchildren to model church structures.
Hierarchical Event Streams and Event Dependency Graphs: A New Computational Model for Embedded Real-Time Systems
Authors: Karsten Albers, Frank Bodmann, Frank Slomka
Venue: Proceedings of the 18th Euromicro Conference on Real-Time Systems (2006)

One of the important aspects of schedulability analysis is the model used to describe the system and its timing behavior. On one side, the accuracy of the test strongly depends on the accuracy of the model. On the other side, a detailed model could lead to an inaccaptable evaluation time. In this paper we propose a new model, the hierarchical event streams, which allows a high accuracy. We provide an efficient feasibility test for the model based on the context of demand and request bound function. Additionally we will provide a methodology to extract this model out of a control-flow graph efficiently. Together this allows a more accurate and efficient schedulability analysis of event driven real- time systems.
Considerations in processing satellite images
Authors: Ronald L. Danielson
Venue: ACM SIGSMALL Newsletter (1980)

Legislated demands for better control of natural resources have motivated many state and local resource management agencies to investigate application of satellite image data to their management activities. The University of Santa Clara and NASA-Ames Research Center have been jointly considering the problems faced by such agencies. Advantages and disadvantages of using relatively small systems for the required computer processing activities are briefly discussed in the paper. In addition, summaries are provided of current status on investigations of user interface considerations, steps involved in developing local processing capability, and improvement of software transportability.
Using UML state machines and petri nets for the quantitative investigation of ETCS
Authors: J. Trowitzsch, A. Zimmermann
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

This paper proposes the modeling of technical systems and their behavior by means of Unified Modeling Language (UML) State Machines and the extending UML Profile for Schedulability, Performance, and Time. This Profile allows the detailed description of quantitative system aspects such as times and probabilistic choice. For the resulting models a transformation into a Stochastic Petri Net is established. The Petri Net's performance measures can be determined by simulation or numerical analysis. A part of the future European Train Control System (ETCS) serves as an application example. The relationship between ETCS communication quality and minimal distance between subsequent trains is investigated.
Using observational pilot studies to test and improve lab packages
Authors: Manoel Mendonça, Daniela Cruzes, Josemeire Dias, Maria Cristina Ferreira de Oliveira
Venue: Proceedings of the 2006 ACM/IEEE international symposium on Empirical software engineering (2006)

Controlled experiments are a key approach to evaluate and evolve our understanding of software engineering technologies. However, defining and running a controlled experiment is a difficult and errorprone task. This paper argues that one can significantly reduce the risks associated with defining a new controlled experiment by running a set of well-planned observational pilot studies aimed at improving the experimental material. It gives the steps for such an approach and illustrates it with a case study that shows the definition of an experiment to evaluate inspection techniques for information visualization tools through a set of four observational studies and one experimental trial. Based on the lessons learned we present some guidelines on how to test and improve experimental material in such way.
Performance modeling of critical event management for ubiquitous computing applications
Authors: Tridib Mukherjee, Krishna Venkatasubramanian, Sandeep K. S. Gupta
Venue: Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems (2006)

A generic theoretical framework for managing critical events in ubiquitous computing systems is presented. The main idea is to automatically respond to occurrences of critical events in the system and mitigate them in a timely manner. This is different from traditional fault-tolerance schemes, where fault management is performed only after system failures. To model the critical event management, the concept of criticality, which characterizes the effects of critical events in the system, is defined. Each criticality is associated with a timing requirement, called its window-of-opportunity, that needs to be fulfilled in taking mitigative actions to prevent system failures. This is in addition to any application-level timing requirements.The criticality management framework analyzes the concept of criticality in detail and provides conditions which need to be satisfied for a successful multiple criticality management in a system. We have further simulated a criticality aware system and its results conform to the expectations of the framework.
Robust recognition of physical team behaviors using spatio-temporal models
Authors: Gita Sukthankar, Katia Sycara
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

This paper presents a framework for robustly recognizing physical team behaviors by exploiting spatio-temporal patterns. Agent team behaviors in athletic and military domains typically exhibit an observable structure characterized by the relative positions of teammates and external landmarks, such as a team of soldiers ambushing an opponent or a soccer player moving to receive a pass. We demonstrate how complex team relationships that are not easily expressed by region-based heuristics can be modeled from data and domain knowledge in a way that is robust to noise and spatial variation. To represent team behaviors in our domain of MOUT (Military Operations in Urban Terrain) planning, we employ two classes of spatial models: 1) team templates that encode static relationships between team members and external landmarks; and 2) spatially-invariant Hidden Markov Models (HMMs) to represent evolving agent team configurations over time. These two classes of models can be combined to improve recognition accuracy, particularly for behaviors that appear similar in static snapshots. We evaluate our modeling techniques on large urban maps and position traces of two-person human teams performing MOUT behaviors in a customized version of Unreal Tournament (a commercially available first-person shooter game).
Robust Accounting in Decentralized P2P Storage Systems
Authors: Ivan Osipkov, Peng Wang, Nicholas Hopper
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

A peer-to-peer (P2P) storage system allows a network of peer computers to increase the availability of their data by replicating it on other peers in the network. In such networks, a central challenge is preventing "freeloaders", or nodes that use disproportionately more storage on other peers than they contribute to the network. While several existing systems claim to solve this problem, we show that all known approaches are vulnerable to various attacks by either a single greedy peer or a small group of peers. To address this problem, we describe a robust distributed system to account for the storage activities of each peer. We analyze the security of this system, prove that it is secure under a much stronger attack model than previous work, and evaluate the efficiency of a prototype implementation.
Digital Audio Watermarking Algorithm Based on Quantizing Coefficients
Authors: Zhao Xu, Ke Wang, Xiao-hua Qiao
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

A kind of digital audio watermarking algorithm based on discrete wavelet transform (DWT) is proposed in the paper. In the paper, we adopt remote sensing image as watermarking image (such as satellite image). In order to enhance the remote sensing image into the audio, watermarking information is dealt with error diffusion method which is one kind of half-toning technique. Using chaos sequence for synchronization code and embedded it into audio with the water-marking, the watermarking thus has the ability of selfsynchronization. The algorithm quantizes the lowestfrequency coefficients of DWT of the audio signals, so that the watermarking can be detected in a blinding way. The experimental results indicate the algorithm is robust to Gauss-yawp, loss compression and more than 12 attacking means by stirmarkaudio attacking software.