ppxscal/embedding_network huggingface dataset:
Finding (Recently) Frequent Items in Distributed Data Streams
Authors: Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere, Christopher Olston
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na¨ýve methods of combining approximate frequency counts from multiple nodes tend to result in excessively large data structures that are costly to transfer among nodes. To minimize communication requirements, the degree of precision maintained by each node while counting item frequencies must be managed carefully. We introduce the concept of a precision gradient for managing precision when nodes are arranged in a hierarchical communication structure. We then study the optimization problem of how to set the precision gradient so as to minimize communication, and provide optimal solutions that minimize worst-case communication load over all possible inputs. We then introduce a variant designed to perform well in practice, with input data that does not conform to worst-case characteristics. We verify the effectiveness of our approach empirically using real-world data, and show that our methods incur substantially less communication than na¨ýve approaches while providing the same error guarantees on answers.
Exploring the Energy-Time Tradeoff in MPI Programs on a Power-Scalable Cluster
Authors: Vincent W. Freeh, Feng Pan, Nandini Kappiah, David K. Lowenthal, Rob Springer
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Recently, energy has become an important issue in highperformance computing. For example, supercomputers that have energy in mind, such as BlueGene/L, have been built; the idea is to improve the energy efficiency of nodes. Our approach, which uses off-the-shelf, high-performance cluster nodes that are frequency scalable, allows energy saving by scaling down the CPU. This paper investigates the energy consumption and execution time of applications from a standard benchmark suite (NAS) on a power-scalable cluster. We study via direct measurement and simulation both intra-node and inter-node effects of memory and communication bottlenecks, respectively. Additionally, we compare energy consumption and execution time across different numbers of nodes. Our results show that a power-scalable cluster has the potential to save energy by scaling the processor down to lower energy levels. Furthermore, we found that for some programs, it is possible to both consume less energy and execute in less time when using a larger number of nodes, each at reduced energy. Additionally, we developed and validated a model that enables us to predict the energy-time tradeoff of larger clusters.
Combining Object and Feature Dynamics in Probabilistic Tracking
Authors: Leonid Taycher, John W. Fisher III, Trevor Darrell
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Objects can exhibit different dynamics at different scales, and this is often exploited by visual tracking algorithms. A local dynamic model is typically used to extract image features that are then used as input to a system for tracking the entire object using a global dynamic model. Approximate local dynamics may be brittle ¿ point trackers drift due to image noise and adaptive background models adapt to foreground objects that become stationary ¿ but constraints from the global model can make them more robust. We propose a probabilistic framework for incorporating global dynamics knowledge into the local feature extraction processes. A global tracking algorithm can be formulated as a generative model and used to predict feature values that are incorporated into an observation process of the feature extractor. We combine such models in a multichain graphical model framework. We show the utility of our framework for improving feature tracking and thus shape and motion estimates in a batch factorization algorithm. We also propose an approximate filtering algorithm appropriate for online applications, and demonstrate its application to background subtraction.
The usability era arrives
Authors: Aaron Weiss
Venue: netWorker (2005)

Some people have loved Apple Computer products for 20 years or more. They are Apple's loyal followers, people for whom Apple's vision has always just made sense. They are also the people who helped Apple survive the lean times, when the dominance of Microsoft Windows threatened to push every other platform over the cliff's edge. I am not one of these people.
Sampling search-engine results
Authors: Aris Anagnostopoulos, Andrei Z. Broder, David Carmel
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approximate algorithms for several applications, such as: Determining the set of categories in a given taxonomy spanned by the search results;Finding the range of metadata values associated to the result set in order to enable "multi-faceted search;"Estimating the size of the result set;Data mining associations to the query terms.We present and analyze an efficient algorithm for obtaining uniform random samples applicable to any search engine based on posting lists and document-at-a-time evaluation. (To our knowledge, all popular Web search engines, e.g. Google, Inktomi, AltaVista, AllTheWeb, belong to this class.)Furthermore, our algorithm can be modified to follow the modern object-oriented approach whereby posting lists are viewed as streams equipped with a next method, and the next method for Boolean and other complex queries is built from the next method for primitive terms. In our case we show how to construct a basic next(p) method that samples term posting lists with probability p, and show how to construct next(p) methods for Boolean operators (AND, OR, WAND) from primitive methods.Finally, we test the efficiency and quality of our approach on both synthetic and real-world data.
Design of a Haptic Display for Catheterization
Authors: Thorsten Alexander Kern, Roland Werthschutzky
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Navigating a catheter inside the patient and orientation during this procedure is mainly dependent on a live x-ray image. Although methods for 3D visualization and remote navigation of the catheter are emerging and subject to tests, still precise positioning is merely the result of intense training and high skills of the performing surgeon. A novel assistance-system intends to provide measured force data from the tip of a guide wire and display them as feedback to the performing surgeon. It is intended to build a simulator giving a first impression of the feel and touch of such an assistance. For this simulator a haptic display is needed. This article refers to design methods and the actual structure of this display. It has to be capable applying torque and force on the catheter. General technical requirements are presented. The realized prototype itself is shown and the experience made are presented.
Geographic routing in city scenarios
Authors: Christian Lochert, Martin Mauve, Holger Füßler, Hannes Hartenstein
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2005)

Position-based routing, as it is used by protocols like Greedy Perimeter Stateless Routing (GPSR) [5], is very well suited for highly dynamic environments such as inter-vehicle communication on highways. However, it has been discussed that radio obstacles [4], as they are found in urban areas, have a significant negative impact on the performance of position-based routing. In prior work [6] we presented a position-based approach which alleviates this problem and is able to find robust routes within city environments. It is related to the idea of position-based source routing as proposed in [1] for terminode routing. The algorithm needs global knowledge of the city topology as it is provided by a static street map. Given this information the sender determines the junctions that have to be traversed by the packet using the Dijkstra shortest path algorithm. Forwarding between junctions is then done in a position-based fashion. In this short paper we show how position-based routing can be aplied to a city scenario without assuming that nodes have access to a static street map and without using source routing.
'Openness' and the public airwaves
Authors: Sascha D. Meinrath, Victor Bahl, Kenneth R. Carter, Mark Cooper, Ben Scott, Matt Westervelt
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

A discussion of "openness" and wireless networking focusing on open source, open spectrum, and open architecture issues and their interrelations. This panel is composed of experts in open source development, legal issues, economic issues, and industry concerns; and is moderated by a policy and regulatory expert from the Federal Communications Commission. Panelists were chosen for their expertise in specific areas as well as a demonstrated breadth of knowledge in other facets in wireless communications. The plenary provides multiple perspectives on the importance of reforming access to the public airwaves -- including different foci and priorities -- while allowing ample time for audience participation and panelist debate. The moderator and four panelists will each hand out a "topic briefing" for plenary audience members that summarizes the take-home message and most important points from each of their perspectives.
Foreword
Authors: P. Kyberd, R. H. Chappell, D. Gow
Venue: Robotica (2005)

Prosthetics presents a challenge for engineers, they must balance user needs with practicalities. In the past the compromises made have been towards simpler devices. Recently this has begun to change, new microprocessors, powerful motors and novel batteries make it possible to conceive of different solutions. These papers give an overview of what is now possible.
Automation of Grid Service Code Generation with AndroMDA for GT3
Authors: Sachio Mizuta, Runhe Huang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

To automate code generation, grid services are represented in class models of Unified Modeling Language (UML). The UML output in XMI (XML Metadata Interchange) format derived from a CASE (Computer Aided Software Engineering) tool is used as input of AndroMDA to generate a suite of source code files and related settings. In order to achieve this, a new cartridge of AndroMDA for GT3 (Globus Toolkit 3) was developed, named "andromda-gt3". Stereotypes for expressing the specific services of GT3 are also newly defined, and corresponding templates for generating files are included in the new cartridge. An example of design of a grid service instance is given and, design of a more complicated grid system that consists of more than one service instance is also discussed in this paper.
Classification of Steiner quadruple systems of order 16 and rank at most 131
Authors: V. A. Zinoviev, D. V. Zinoviev
Venue: Problems of Information Transmission (2004)

A Steiner quadruple system SQS(v) of order v is a 3-design T (v, 4, 3, ¿) with ¿ = 1. In this paper we describe all nonisomorphic systems SQS(16) that can be obtained by the generalized concatenated construction (GC-construction). These Steiner systems have rank at most 13 over $$ \mathbb{F} $$ 2. In particular, there is one system SQS(16) of rank 11 (points and planes of the a fine geometry AG(4, 2)), fifteen systems of rank 12, and 4131 systems of rank 13. All these Steiner systems are resolvable.
On the Codimension One Motion Planning Problem
Authors: J.-P. Gauthier, V. Zakalyukin
Venue: Journal of Dynamical and Control Systems (2005)

In this paper, we improve the results of [5] related to motion planning problems for corank one sub-Riemannian (SR) metrics. First, we give the exact estimate of the metric complexity, in the generic 3-dimensional case. (Only bounds from above and from below were given in [5].) Second, we show that the general expression for the metric complexity (that was proven to hold generically in the C¿ case, or under certain nonvanishing condition (C) in the analytic case) is, in fact, always true under condition (C), on the complement of a subset of codimension infinity, in the set of C¿ "motion planning problems." Both results are constructive, i.e., an "asymptotic optimal synthesis" is exhibited in both cases.
A Java framework for bio-analysis systems
Authors: Raymond Imhoff, Colin Depradine
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

The discipline of fluorescence analysis, in the chemical sciences, requires the use of software for analyzing and viewing of fluorescence data. While there is software available for this task, it is generally both extremely expensive and proprietary. As a result, the software cannot be modified or updated to meet the needs of a specific researcher. This paper discusses the JFluro system, which is an open source Java based system used for the analysis of fluorescence data. The source code is freely available to researchers, removing the constraints imposed by proprietary software. Also, visual user interfaces have been developed to simplify its use for both novice and advanced users.
Proposal of meta-data in a database for identification using face images
Authors: Rieko Inaba, Kiyoharu Aizawa, Kashiko Kodate
Venue: Systems and Computers in Japan (2005)

This paper proposes the introduction of meta-data for efficient retrieval of particular personal data from a large-scale face database. The face index is calculated from the feature parameters of the face, and is defined as the meta-data. The purpose of this approach is to structure the database and to minimize the number of database matching operations in retrieval, so that the processing efficiency is improved. In this study, (1) Garson's facial index and (2) the three-point face index are proposed as the face indexes. For verification, an experiment on face index introduction is performed, using an already constructed optical face recognition system, and an efficiency improvement is demonstrated. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(3): 53&ndash;64, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10639
The WT10G dataset and the evolution of the web
Authors: Wei-Tsen Milly Chiang, Markus Hagenbuchner, Ah Chung Tsoi
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

The purpose of this paper is threefold. First, we study the evolution of the web based on data available from an earlier snapshot of the web and compare the results with those predicted in [2]. Secondly, we establish whether the WT10G dataset, a popular benchmark for the development and evaluation of internet based applications is appropriate for the tasks. Finally, is there a need for a collection of a new dataset for such purposes. The findings are that the appropriateness of using the popular WT10G dataset in recent Internet-based experiments is questionable and that there is a need for a new collection of dataset for development and evaluation purposes of algorithms related to Internet search engine developments.
Cycles in random k-ary maps and the poor performance of random number generation
Authors: Robin Pemantle
Venue: Journal of Algorithms (2005)

Knuth [The Art of Computer Programming, vol. 2: Semi-Numerical Algorithms, 3rd ed., Addison-Wesley, Reading, MA, 1997] shows that iterations of a random function perform poorly on average as a random number generator. He proposes a generalization in which the next value depends on two or more previous values. This note demonstrates, via an analysis of the cycle length of a random k-ary map, the equally poor performance of a random instance in Knuth's more general model.
A decision-theoretic approach to reliable message delivery
Authors: Francis C. Chu, Joseph Y. Halpern
Venue: Distributed Computing (2001)

We argue that the tools of decision theory should be taken more seriously in the specification and analysis of systems. We illustrate this by considering a simple problem involving reliable communication, showing how considerations of utility and probability can be used to decide when it is worth sending heartbeat messages and, if they are sent, how often they should be sent.
Programming Configurable Multiprocessors
Authors: Steven A. Guccione
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

A new high performance computation technique involving multiple processors on a single silicon die is quickly gaining popularity. This new design approach provides very high performance, excellent power efficiency and a high level of programmability as compared to other existing solutions. This approach also serves to move the design effort away from hardware design and toward software. This results in a faster time to market as well as a lower up-front design cost. This paper discusses the Configurable Multiprocessor design environment from Cmpware, Inc.. This toolkit is used to design ASIC, FPGA and SoC multiprocessor solutions.
A microscopic visual feedback system
Authors: Hiromasa Oku, Idaku Ishii, Masatoshi Ishikawa
Venue: Systems and Computers in Japan (2004)

Over the past few years, there have been advances in research into high-speed vision systems, which can acquire and process video faster than current vision systems that use video signals, with many areas of applied research emerging. In this paper we will explore high-speed vision systems for controlling and manipulating microscopic objects, such as cells or semiconductors, and propose the &ldquo;microscopic visual feedback&rdquo; (MVF) a method for controlling microscopic objects using high-speed visual feedback based on high-speed vision systems. We then consider the components that will be needed in an MVF system, examine the specifications that will be needed for each component, and construct an actual MVF system based on these specifications. Finally, we conduct control-performance testing to ascertain the MVF system's actual ability to control moving microscopic subjects, and by tracking a paramecium in applied testing, demonstrate that this is a viable system for acquiring motion tracks. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(13): 71&ndash;79, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10056
SemanticTalk: software for visualizing brainstorming sessions and thematic concept trails on document collections
Authors: Chris Biemann, Karsten Böhm, Gerhard Heyer, Ronny Melz
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

In this demonstration we introduce a technology to support knowledge structuring processes already at the time of their creation by building up concept structures in real time. Our focus was set on the design of a minimal invasive system, which ideally requires no human interaction and thus gives the maximum freedom to the participants of a knowledge creation or exchange processes. The system captures and displays spoken dialogs as well as text documents for further use in knowledge engineer's tools.
A moving planar mirror based approach for cultural reconstruction: Research Articles
Authors: Kyung Ho Jang, Dong Hoon Lee, Soon Ki Jung
Venue: Computer Animation and Virtual Worlds (2004)

Modelling from images is a cost-effective means of obtaining virtual cultural heritage models. These models can be effectively constructed from classical Structure from Motion algorithm. However, it's too difficult to reconstruct whole scenes using SFM method since general oriental historic sites contain a very complex shapes and brilliant colours. To overcome this difficulty, the current paper proposes a new reconstruction method based on a moving planar mirror. We devise the mirror posture instead of scene itself as a cue for reconstructing the geometry. That implies that the geometric cues are inserted into the scene by compulsion. With this method, we can obtain the geometrical details regardless of the scene complexity. For this purpose, we first capture image sequences through the moving mirror containing the interested scene, and then calibrate the camera through the mirror's posture. Since the calibration results are still inaccurate due to the detection error, the camera pose is revised using frame-correspondence of the corner points that are easily obtained using the initial camera posture. Finally, 3D information is computed from a set of calibrated image sequences. We validate our approach with a set of experiments on some cultural heritage objects. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Organizational collaboration: an STC perspective
Authors: Fred Sampson
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

In this proposal I submit personal qualifications for participation in the CHI 2005 Development Consortium, along with a review of some issues to be discussed and possible resolutions.
Timed grid routing (TIGR) bites off energy
Authors: Roy Friedman, Guy Korland
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

Energy efficiency and collisions avoidance are both critical properties to increase the lifetime and effectiveness of wireless networks. This paper proposes a family of algorithms for reducing both energy consumption and packets collisions in ad-hoc networks. In particular, this family of protocols offers a tradeoff between bandwidth utilization and power consumption. The proposed algorithms are based on geographic knowledge to form a virtual grid and on synchronized clocks in order to achieve a collision free locally computable transmission schedule.As an added benefit to the proposed approach, a new efficient location service that is adjusted to the grid oriented geo-routing is also presented. The paper analyzes the proposed family of algorithms for their induced latency and the energy vs. latency tradeoffs they provide.
A Small Social History of Software Architecture
Authors: Susan Elliott Sim
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

This paper presents an analysis of software architecture as social artifact, that is, something that software developers talk about and use in their work. This analysis is historical in nature, relying on interviews with software developers with experience spanning four decades and the software engineering literature. We found that 1) only large teams have architecture; 2) architecture is more easily found in discourse than in source; and 3) architecture does not happen at a fixed time in the software lifecycle. These observations taken together suggest that software is a boundary object that developers use to explain the system to each other, thereby making it possible to work together.