ppxscal/embedding_network huggingface dataset:
Energy Efficient Spatial Query Processing in Wireless Sensor Networks
Authors: Kyungseo Park, Byoungyong Lee, Ramez Elmasri
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Because a sensor network depends on limited battery power, energy saving is important to increase the sensor network lifespan. We propose semi-distributed spatial query indexing structure that disseminates a query into the network and retrieves data energy efficiently using a localized tree building algorithm. We also propose a sectioned tree index, which divides the network area into several squares and each square has a local index subtree organized within that square. Local trees are interconnected to form one big tree in the network. Local trees are also built based on any algorithm that is energy consumption aware at each sub-root node in a locally centralized way. We use an existing two dimensional indexing technique for energy efficient query dissemination. We show that our proposed scheme is energy efficient for query and data processing heuristically. Our proposed scheme, sectioned tree, is finally simulated in sparse and dense networks to show the energy saving for query and data processing in the sensor network.
Co-evolutionary classifier systems for multi-agent simulation
Authors: L. M. Hercog, T. C. Fogarty
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

In this paper, MAZCS-a multi-agent system that learns using ZCS-is used for social modelling on the "El Farol" problem. Experiments with ten agents and different goal settings for the problem show that MAZCS is always able to solve it and emergent behaviour is derived from the autonomous control of each agent. The results are divided into macro and micro-level analysis, the former providing the overall performance of the system, the latter the detailed ZCS rule evolution and explanation of the agent's actions. Performance analysis of the rules shows that the emergent behaviour is caused by a combination of the reward received by each ZCS and its reinforcement mechanism. For its performance and action explanation MAZCS has proved to be a good modelling tool for social simulation. Furthermore the system solved the problem when using a hundred agents, assuring scalability for bigger simulation needs.
A Link Reliability-Aware Route Maintenance Mechanism for Mobile Ad Hoc Networks
Authors: Dong Shi, Xinming Zhang, Xuemei Gao, Wenbo Zhu, Fengfu Zou
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Hosts in mobile ad hoc networks (MANET) are capable of self-configuration and they can migrate at will, which makes the network topology highly dynamic. Thus, routes may break easily since the data session fails when one node moves out of the sensing range of its partner. Besides that, if overused, nodes tend to drain their power completely due to the limited battery life. That will result in a short life span of the network, which means serious performance degradation. The routing maintenance in traditional routing protocols such as Dynamic Source Routing (DSR) is triggered only after an active routing path breaks and in most cases, is realized by a route discovery process to build a new route. This kind of "after-the-event" routing maintenance raises the overhead heavily since considerable cost has to be spent in detecting the path break and establishing a new one. In this paper, we propose a new routing maintenance mechanism named link reliability-aware route maintenance (LRRM). Implemented on DSR, our mechanism tries to evaluate the link reliability of each hop actively and replace those debilitated nodes with robust ones through a local recovery if necessary. After that, the route change shall be informed to the source node by unicasting. Simulation results have proven LRRM's validity in extending network lifetime. Our mechanism also outperforms original DSR in throughput, delivery ratio and average end-to-end latency.
An Abstract Transcript Notation for Analyzing Interactional Construction of Meaning in Online Learning
Authors: Daniel Suthers, Nathan Dwyer, Ravi Vatrapu, Richard Medina
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This work is based on the premise that the interactional construction of meaning is as important in online settings as it is face-to-face, especially in collaborative learning. Yet most studies of online learning use quantitative methods that assign meaning to contributions in isolation and aggregate over many sessions, obscuring the situated procedures by which participants accomplish learning through the affordances of online media. Methods for studying the interactional construction of meaning are available, but have largely been developed for brief episodes of face-to-face data, and need to be adapted to online learning where media resources, time scale, and synchronicity differ. In order to resolve this tradeoff, we have prototyped an abstract transcript notation to support sequential and interactional analysis of distributed and asynchronous interactions. The paper describes applications to data derived from asynchronous interaction of dyads and small groups.
Scalable, distributed data structures for internet service construction
Authors: Steven D. Gribble, Eric A. Brewer, Joseph M. Hellerstein, David Culler
Venue: Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4 (2000)

This paper presents a new persistent data management layer designed to simplify cluster-based Internet service construction. This self-managing layer, called a distributed data structure (DDS), presents a conventional single-site data structure interface to service authors, but partitions and replicates the data across a cluster. We have designed and implemented a distributed hash table DDS that has properties necessary for Internet services (incremental scaling of throughput and data capacity, fault tolerance and high availability, high concurrency, consistency, and durability). The hash table uses two-phase commits to present a coherent view of its data across all cluster nodes, allowing any node to service any task. We show that the distributed hash table simplifies Internet service construction by decoupling service-specific logic from the complexities of persistent, consistent state management, and by allowing services to inherit the necessary service properties from the DDS rather than having to implement the properties themselves. We have scaled the hash table to a 128 node cluster, 1 terabyte of storage, and an in-core read throughput of 61,432 operations/s and write throughput of 13,582 operations/s.
Education in semiconductor manufacturing processes through physically-based dynamic simulation
Authors: G. B. Lu
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

We have developed physically-based dynamic simulators relevant to semiconductor manufacturing processes, which realistically reflect the time-dependent behaviour of equipment, process, sensor, and control systems using commercial simulation software (VisSim/sup TM/) under Windows. Following on their successful research use for engineering design, we are applying them to manufacturing education and training. Because they reflect quantitatively and visually the detailed response of the system to user-initiated actions in real time, these simulators promise a new paradigm of active learning through "hands-on" operation of sophisticated expensive processing equipment. The student experience is open-ended, offering not only guided exercises but also the chance to experiment freely with the virtual equipment. Simulator modules are in development for use by both experienced engineers and manufacturing operators, with enhanced graphical interfaces tailored to the student and application.
Deterministic execution of java's primitive bytecode operations
Authors: Fridtjof Siebert, Andy Walter
Venue: Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1 (2001)

For the application of Java in realtime and safety critical domains, an analysis of the worst-case execution times of primitive Java operations is necessary. All primitive operations must either execute in constant time or have a reasonable upper bound for their execution time. The difficulties that arise for a Java virtual machine and a Java compiler in this context will be presented here. This includes the implementation of Java's class and interface model, class initialization, monitors and automatic memory management. A new Java virtual machine and compiler that solves these difficulties has been implemented and its performance has been analysed.
Visual Data Mining in Software Archives to Detect How Developers Work Together
Authors: Peter Weissgerber, Mathias Pohl, Michael Burch
Venue: Proceedings of the Fourth International Workshop on Mining Software Repositories (2007)

Analyzing the check-in information of open source software projects which use a version control system such as CVS or SUBVERSION can yield interesting and important insights into the programming behavior of developers. As in every major project tasks are assigned to many developers, the development must be coordinated between these programmers. This paper describes three visualization techniques that help to examine how programmers work together, e.g. if they work as a team or if they develop their part of the software separate from each other. Furthermore, phases of stagnation in the lifetime of a project can be uncovered and thus, possible problems are revealed. To demonstrate the usefulness of these visualization techniques we performed case studies on two open source projects. In these studies interesting patterns of developers' behavior, e.g. the specialization on a certain module can be observed. Moreover, modules that have been changed by many developers can be identified as well as such ones that have been altered by only one programmer,.
Feature Ontology for Improved Learning from Large-Dimensional Disease-Specific Heterogeneous Data
Authors: Alexey Tsymbal, Sonja Zillner, Martin Huber
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Nowadays, ontologies and machine learning constitute two major technologies for domainspecific knowledge extraction. While the aim of these two technologies is the same -- the extraction of useful knowledge -- little is known about how the two sources of knowledge can be integrated. This problem is especially important for biomedicine where relevant data are often naturally complex having large dimensionality and including heterogeneous features. In this paper we propose an approach for improving the performance of machine learning by integrating the knowledge provided by ontologies for large-dimensional disease-specific heterogeneous data. The basic idea is to redefine the concept of similarity by incorporating available ontological knowledge. Benefits and difficulties of this integration are discussed and an example from the field of paediatric cardiology is described.
Modelling memory functions with recurrent neural networks consisting of input compensation units: II. Dynamic situations
Authors: Simone K&#x00fc;hn, Holk Cruse
Venue: Biological Cybernetics (2007)

Modelling the cognitive abilities of humans or animals or building agents that are supposed to behave cognitively requires modelling a memory system that is able to store and retrieve various contents. The content to be stored is assumed to comprise information about more or less invariant environmental objects as well as information about movements. A combination of information about both objects and movements may be called a situation model. Here we focus, in part, on models storing dynamic patterns. In particular, two abilities of humans in representing dynamical systems receive special focus: the capability of representing the acceleration of objects, as can be found in the movement of a pendulum or freely falling objects, and the capability of representing actions of transfer, i.e. motion from one point to another, have been modelled using recurrent networks consisting of input compensation units. In addition, possibilities of combining static and dynamic properties within a single model are studied.
An Enhanced Random-walk Method for Content Locating in P2P Networks
Authors: Keivan Ronasi, Mohammad Hamed Firooz, Mohammad Reza Pakravan, Alireza Nasiri Avanaki
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

The important problem of content location in an unstructured distributed network (such as P2P, with no central searching system, graph construction control or file placement regulation) is addressed. The existing methods that are based on either flooding or random walk impose a large traffic load on the network or require a long time to search. In this work, we propose a method that outperforms the existing methods in both of these measures. These advantages are achieved by publishing traces of the contents of each node in its nearby nodes, so that the closer nodes to the target have a stronger trace of it. Such traces are used to rapidly locate the desired content. The superb performance of our method, both in time and bandwidth, is demonstrated by simulations whose results are reported.
Automated detection and segmentation of cylindrical fragments from calibrated C-arm images for long bone fracture reduction
Authors: Guoyan Zheng, Xiao Dong, Paul Alfred Grutzner, Lutz-Peter Nolte
Venue: Computer Methods and Programs in Biomedicine (2007)

Long bone fracture belongs to one of the most common injuries encountered in clinical routine trauma surgery. Automated identification, pose and size estimation, and contour extraction of diaphyseal bone fragments can greatly improve the usability of a computer-assisted, fluoroscopy-based navigation system for long bone fracture reduction. In this paper, a two-step solution is proposed. In the first step, the pose and size of a diaphyseal fragment are estimated through a three-dimensional (3D) morphable object-based fitting process using a parametric cylinder model. This fitting process is optimally solved by a hybrid optimization technique coupling a random sample consensus (RANSAC) paradigm and an iterative closest point (ICP) matching procedure. Monte Carlo simulation was used to determine the parameters for the RANSAC paradigm. The results of the fragment detection step are then fed to the second step, where a region information based active contour model is used to extract the fragment contours. We designed and conducted experiments to quantify the accuracy and robustness of the proposed approach. Our experimental results conducted on images of a plastic bone as well as on those of patients demonstrate a promising accuracy and robustness of the proposed approach.
Analyzing the Energy-Time Trade-Off in High-Performance Computing Applications
Authors: Vincent W. Freeh David K. Lowenthal Feng Pan Nandini Kappiah Rob Springer Barry L. Rountree Mark E. Femal
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Although users of high-performance computing are most interested in raw performance, both energy and power consumption have become critical concerns. One approach to lowering energy and power is to use high-performance cluster nodes that have several power-performance states so that the energy-time trade-off can be dynamically adjusted. This paper analyzes the energy-time trade-off of a wide range of applications—serial and parallel—on a power-scalable cluster. We use a cluster of frequency and voltage-scalable AMD-64 nodes, each equipped with a power meter. We study the effects of memory and communication bottlenecks via direct measurement of time and energy. We also investigate metrics that can, at runtime, predict when each type of bottleneck occurs. Our results show that, for programs that have a memory or communication bottleneck, a power-scalable cluster can save significant energy with only a small time penalty. Furthermore, we find that, for some programs, it is possible to both consume less energy and execute in less time by increasing the number of nodes while reducing the frequency-voltage setting of each node.
ACMS: the Akamai configuration management system
Authors: Alex Sherman, Philip A. Lisiecki, Andy Berkheimer, Joel Wein
Venue: Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2 (2005)

An important trend in information technology is the use of increasingly large distributed systems to deploy increasingly complex and mission-critical applications. In order for these systems to achieve the ultimate goal of having similar ease-of-use properties as centralized systems they must allow fast, reliable, and lightweight management and synchronization of their configuration state. This goal poses numerous technical challenges in a truly Internet-scale system, including varying degrees of network connectivity, inevitable machine failures, and the need to distribute information globally in a fast and reliable fashion. In this paper we discuss the design and implementation of a configuration management system for the Akamai Network. It allows reliable yet highly asynchronous delivery of configuration information, is significantly fault-tolerant, and can scale if necessary to hundreds of thousands of servers. The system is fully functional today providing configuration management to over 15,000 servers deployed in 1200+ different networks in 60+ countries.
The LIMSI ARISE system for train travel information
Authors: L. Lamel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

In the context of the LE-3 ARISE (Automatic Railway Information Systems for Europe) project we have been developing a dialog system for vocal access to rail travel information. The system provides schedule information for the main French intercity connections, as well as, simulated fares and reservations, reductions and services. The goal is to obtain high dialog success rates with a very open dialog structure, where the user is free to ask any question or to provide any information at any point in time. In order to improve the performance with such an open dialog strategy, we make use of implicit confirmation using the callers wording (when possible), and change to a more constrained dialog level, when the dialog is not going well. In addition to own assessment, the prototype system undergoes periodic user evaluations carried out by the our partners at the French Railways.
Projective Visual Hulls
Authors: Svetlana Lazebnik, Yasutaka Furukawa, Jean Ponce
Venue: International Journal of Computer Vision (2007)

This article presents a novel method for computing the visual hull of a solid bounded by a smooth surface and observed by a finite set of cameras. The visual hull is the intersection of the visual cones formed by back-projecting the silhouettes found in the corresponding images. We characterize its surface as a generalized polyhedron whose faces are visual cone patches; edges are intersection curves between two viewing cones; and vertices are frontier points where the intersection of two cones is singular, or intersection points where triples of cones meet. We use the mathematical framework of oriented projective differential geometry to develop an image-based algorithm for computing the visual hull. This algorithm works in a weakly calibrated setting----that is, it only requires projective camera matrices or, equivalently, fundamental matrices for each pair of cameras. The promise of the proposed algorithm is demonstrated with experiments on several challenging data sets and a comparison to another state-of-the-art method.
Minimally non-linear integer wavelets for image coding
Authors: M. Grangetto
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

In this paper we deal with the problem of finding high performance factorizations of wavelet filters to be employed within the lifting scheme framework to yield the integer wavelet transform (IWT). A method is proposed, based on the search for the factorization yielding the minimally non-linear iterated graphic function. Results are reported, referring to a set of popular wavelet filters, which show that the obtained implementations lead to IWTs achieving very satisfactory results for both lossy and lossless image compression.
Exploitation and peacekeeping: introducing more sophisticated interactions to the iterated prisoner's dilemma
Authors: T. Ord, A. Blair
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

We present a new paradigm extending the iterated prisoner's dilemma to multiple players. Our model is unique in granting players information about past interactions between all pairs of players - allowing for much more sophisticated social behaviour. We provide an overview of preliminary results and discuss the implications in terms of the evolutionary dynamics of strategies.
The collective: simplifying the mobility and management of today's computer environments
Authors: Monica Lam
Venue:  (2007)

Today's computer environments, which include operating systems, applications, settings, and documents, are tied to a computer and often custom created for that computer. The result is difficulties for the user: each computer must be individually managed at the expense of time and money, users have limited ability to move between computers, and recovering from a hardware failure can be time consuming or even impossible. This work proposes and evaluates an architecture called the Collective that addresses these difficulties. With the help of virtual machine monitors, the Collective creates and manages entire computer environments as a data type called a capsule. The Collective stores multiple versions of these capsules in network storage, where they can be pulled down and run by any authorized computer. To simplify management, the Collective introduces a special kind of capsule called a virtual appliance. The software in a virtual appliance is defined by a publisher on behalf of its subscribers. In most appliances, subscribers cannot install software. As a result, the Collective can ensure that the software in the virtual appliance closely follows what is published by the publisher, increasing the predictability of the appliance's behavior. Two features that result from this design are automatic updates and rejuvenation. On reboot, the Collective discards changes and reverts back to the latest published version of the appliance. Virtual appliances keep per-subscriber data in storage that is not reverted. Capsules are large, potentially gigabytes in size. This dissertation describes and evaluates optimizations for transferring capsules efficiently. Experience using a prototype of the Collective suggests that the Collective is a practical way of carrying computing environments between computers and managing the software and configuration of far-flung computing environments.