ppxscal/embedding_network huggingface dataset:
GRACE: Enabling collaborations in wide-area distributed systems
Authors: Anne-Marie Bosneag, Monica Brockmeyer
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

The globalization of businesses and the cooperation between organizations have brought on an ever increased need for providing support for distributed collaborations. In this paper, we argue that existing peer-to-peer frameworks, although suitable for collaborative environments, fail to provide the support for multiple consistency semantics required by modern complex collaborations. We present GRACE, a middleware platform that enables distributed and mobile collaborations, by combining the capabilities of Distributed Hash Tables (DHTs) with a layered architecture that supports a wide range of semantics. The DHT substrate provides support for mobility, high scalability, availability and load balancing of data, as well as self-repairing capabilities and ease of management, while the layered architecture takes into account the different semantic needs of the applications. We evaluate the efficiency of the algorithm for routing requests to the correct replica in an implementation of GRACE built on Pastry.
An Efficient Consistency Management Algorithm for Real-Time Mobile Collaboration
Authors: Sandy Citro, Jim McGovern, Caspar Ryan
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

Real time mobile collaboration involves two or more co-workers operating concurrently on a shared document using independent mobile devices. The replicated architecture is attractive for such applications since it does not rely on a central server and a user can continue to work on his or her own local document replica even during disconnection period. Several consistency management algorithms have been proposed, however the resource usage of such algorithms, which is critical in a mobile environment, has not been formally studied. Mobile devices are constrained in terms of memory and processing power, and operate in networking environments with limited bandwidth and transient connectivity. Therefore, algorithms that use resources more effectively will improve the quality of the user experience in a mobile environment. ISO 9126-1 [3] considers software to be efficient if it provides a balance between performance, and resource utilisation while performing its function. Therefore, this paper evaluates the efficiency of existing techniques, and proposes a more efficient consistency management algorithm. The new algorithm leverages existing techniques which are shown to be efficient and incorporates a novel history management strategy called partial history copy.Different combinations of these techniques are tested and compared to determine which one is most efficient and thus suitable for mobile usage.
Performance of a Bluetooth IP Network for Streaming High Quality Audio
Authors: Wan Kin Loh, Salil S. Kanhere, Deep Sen
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

An Internet Protocol (IP) network established over Bluetooth affords higher practical throughput compared to the 'SynchronousConnection Oriented' (SCO) physical link allowing the usage of high quality audio codecs such as the Motion Picture Expert Group-1 Layer 3' (MP3) and Ogg Vorbis audio codecs. The Bluetooth IP network by default sets the Logical Link Control and Adaptation Protocol (L2CAP) layer to infinite retransmissions effecting a trade-off between audio quality and audio playback continuity. This paper studies the attributes of the Bluetooth IP network for streaming stored high quality audio.
Using Location for Personalized POI Recommendations in Mobile Environments
Authors: Tzvetan Horozov, Nitya Narasimhan, Venu Vasudevan
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

Internet-based recommender systems have traditionally employed collaborative filtering techniques to deliver relevant "digital" results to users. In the mobile Internet however, recommendations typically involve "physical" entities (e.g., restaurants), requiring additional user effort for fulfillment. Thus, in addition to the inherent requirements of high scalability and low latency, we must also take into account a "convenience" metric in making recommendations. In this paper, we propose an enhanced collaborative filtering solution that uses location as a key criterion for generating recommendations. We frame the discussion in the context of our "restaurant recommender" system, and describe preliminary results that indicate the utility of such an approach. We conclude with a look at open issues in this space, and motivate a future discussion on the business impact and implications of mining the data in such systems.
Fast approximation of nonlinearities for improving inversion algorithms of PNL mixtures and Wiener systems
Authors: J. Solé-Casals, C. Jutten, D. T. Pham
Venue: Signal Processing (2005)

This paper proposes a very fast method for blindly approximating a nonlinear mapping which transforms a sum of random variables. The estimation is surprisingly good even when the basic assumption is not satisfied. We use the method for providing a good initialization for inverting post-nonlinear mixtures and Wiener systems. Experiments show that speed of the algorithm is strongly improved and the asymptotic performance is preserved with a very low extra computational cost.
The next mainstream programming language: a game developer's perspective
Authors: Tim Sweeney
Venue: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2006)

Game developers have long been early adopters of new technologies. This is so because we are largely unburdened by legacy code: With each new hardware generation, we are free to rethink our software assumptions and develop new products using new tools and even new programming languages. As a result, games are fertile ground for applying academic advances in these areas.And never has our industry been in need of such advances as it is now! The scale and scope of game development has increased more than ten-fold over the past ten years, yet the underlying limitations of the mainstream C/C++/Java/C# language family remain largely unaddressed.The talk begins with a high-level presentation of the game developer's world: the kinds of algorithms we employ on modern CPUs and GPUs, the difficulties of componentization and concurrency, and the challenges of writing very complex software with real-time performance requirements.The talk then outlines the ways that future programming languages could help us write better code, providing examples derived from experience writing games and software frameworks that support games. The major areas covered are abstraction facilities -- how we can use them to develop more extensible frameworks and components; practical opportunities for employing stronger typing to reduce run-time failures; and the need for pervasive concurrency support, both implicit and explicit, to effectively exploit the several forms of parallelism present in games and graphics.
A Novel Pulse Echo Correlation Tool for Transmission Path Testing and Fault Finding using Pseudorandom Binary Sequences
Authors: David M. Horan, Richard A. Guinee
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

In this paper a novel pulse sequence testing methodology is presented as an alternative to Time Domain Reflectometry (TDR) for transmission line ¿health¿ condition monitoring, faultfinding and location. This scheme uses Pseudo Random Binary Sequence (PRBS) injection with cross correlation (CCR) techniques to build a unique response profile, as a characteristic signature, to identify the type of fault, if any, or load termination present as well as its distance from the point of stimulus insertion. This fault characterization strategy can be applied to a number of industrial application scenarios embracing high frequency (HF) printed circuit board (PCB) and integrated circuit (IC) device operation, overhead lines and underground cables in inaccessible locations, which rely on a transmission line pathway or ¿via¿ common to all cases either for signal propagation or power conveyance. This unique trouble-shooting tool is due to the perturbation of the transmission line with a special pseudonoise (pN) ¿key-code¿ sequence of uncorrelated pulses of random polarity and the subsequent CCR measurement of their aggregate response at the test node input for line fault identification and localisation. Based on the distinct spike-like attribute of the PRBS autocorrelation (ACR) function, a ¿pre-location¿ fault measurement relies on the relative time displacement of the device/system conditioned PRBS CCR ¿echo¿ response from the ACR peak. This procedure not only results in the reflection transit time from the fault interface and thus the distance of the fault from the point of stimulus but also fault/load parameter identification. This methodology can be performed online at low amplitude levels for normal uncorrelated signal traffic rejection and to average out the presence of transmission link extraneous noise pickup over several PRBS cycles. In this paper a lumped parameter circuit model is presented to emulate generalized transmission line behaviour, using the well-known pSpice simulation package, for a range of known load-terminations mimicking fault conditions in a range of application scenarios encountered in practice. Numerous line behavioural simulations for various fault conditions, known apriori, with measured CCR response demonstrate the capability of and establishes confidence in the effectiveness of the PRBS test method in fault type identification and location. The accuracy of the method is further validated through theoretical calculation using known lumped parameters, fault termination conditions and link distance in transmission line simulation.
Towards Feasible Region Calculus: An End-to-End Schedulability Analysis of Real-Time Multistage Execution
Authors: William Hawkins, Tarek Abdelzaher
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

Efficient schedulability analysis of aperiodic distributed task systems has received much less attention in real-time computing literature than its periodic counterpart. As systems become larger and more complex and as workloads become less regular, simple aperiodic task analysis techniques are needed to accommodate unpredictability and scale, while erring on the safe side. This paper presents a simple analytic framework for computing the end-to-end feasibility regions of distributed aperiodic task systems under a category of fixed-priority scheduling. It is based on a simple primitive called the generalized stage delay theorem that expresses the maximum fraction of the end-to-end deadline that a task can spend at a resource as a function of the (instantaneous or synthetic) utilization of that resource. For the task to meet its end-to-end deadline, the sum of such fractions must be less than 1. This constraint identifies a volume in a multidimensional space in which each dimension is the utilization of one resource. This volume is a generalization of the notion of utilization bounds for schedulability in single-resource systems. It extends the bound (a uni-dimensional schedulable region) to a multi-dimensional representation for distributed-resource systems. Prior work identified this volume for the special case of an infinite number of concurrent infinitesimal tasks. This paper generalizes the result to arbitrary sets of finite tasks, making it applicable to realistic workloads. We evaluate the performance of admission control based on feasible regions using simulation, showing that it is successful in eliminating deadline misses.
On the Removal of Shadows from Images
Authors: Graham D. Finlayson, Steven D. Hordley Cheng Lu Mark S. Drew
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

This paper is concerned with the derivation of a progression of shadow-free image representations. First, we show that adopting certain assumptions about lights and cameras leads to a 1D, gray-scale image representation which is illuminant invariant at each image pixel. We show that as a consequence, images represented in this form are shadow-free. We then extend this 1D representation to an equivalent 2D, chromaticity representation. We show that in this 2D representation, it is possible to relight all the image pixels in the same way, effectively deriving a 2D image representation which is additionally shadow-free. Finally, we show how to recover a 3D, full color shadow-free image representation by first (with the help of the 2D representation) identifying shadow edges. We then remove shadow edges from the edge-map of the original image by edge in-painting and we propose a method to reintegrate this thresholded edge map, thus deriving the sought-after 3D shadow-free image.
Gate Delay Modeling with Multiple Input Switching for Static (Statistical) Timing Analysis
Authors: Jayashree Sridharan, Tom Chen
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

With increase in operating frequency of modern VLSI designs and increase in process variations relative to the nominal process parameters, the chances of multiple input switching have increased. The traditional method of static timing analysis assuming single input switching is no longer adequate enough to capture gate level delays. We propose a new method of systematically modeling gate delays using the high dimensional model representation (HDMR) model. The proposed method models gate delays with respect to the relative signal arrival times (RSAT) of its inputs. The resulting gate delay models can be used for gate-level static timing analysis. The systematic nature of the proposed algorithm allows gate delay characterization with multiple input switching of up to 5 inputs to be reported for the first time. The proposed model is extended to allow the input signal slope and process variations to be taken into account for statistical static timing analysis. Our results show that the proposed HDMR model gives an error between 2.2% to 9.3% compared to SPICE results depending on the number of inputs involved in switching.
Interactive Visualisation and Testing of Jini Services
Authors: Bruce Quig, Michael Kolling, John Rosenberg, Phillip Steele
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

Dynamic service-oriented architectures aim to provide more flexible and robust systems that are able to handle change over time. However, their dynamic nature however provides extra challenges when understanding, developing, testing and debugging such architectures. This paper identifies and discusses a number of issues and difficulties that are faced in their development. It discusses ways in which the building of such systems can be supported by development tools, focusing particularly on interactive testing and debugging mechanisms. A prototype tool for monitoring and interactively testing Jini services that has been developed to address, and further investigate these issues, is then described.
Energy-Efficient Bounded-diameter Tree Scatternet for Bluetooth PANs
Authors: Muralidhar Medidi, Jonathan Campbell
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Bluetooth is a promising wireless technology that enables devices to form short-range multihop wireless adhoc networks, or personal area networks (PANs). However, scatternet formation is one of the challenges that need to be resolved since the performance of a Bluetooth network depends largely on the scatternet topology used. We first identify a particuar variant of a height-balanced binary tree, termed ACB-tree for almost-complete-binary tree, that allows two such trees to be combined to create a larger ACB-tree while retaining the height-balance requirement. We then present a distributed scatternet formation algorithm for creation of ACB-trees. We further extend the algorithm to produce an ACB-tree scatternet with energy ef- ficient properties. We also present simulations, conducted using Blueware simulator, to provide experiment results to study and compare the performance of the resulting scatternets.
Review of "Nitrogen and Phosphorus: Food Production, Waste and the Environment, by Keith S. Porter", Ann Arbor Science Publishers, 1975
Venue: ACM SIGSIM Simulation Digest (1976)

This is a highly specialized volume and has been included primarily because of its good treatment of animal waste management as well as its sections on the flow of nitrogen and phosphorus on land and affects on watersheds. 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
Fast Routing Computation on InfiniBand Networks
Authors: Aurelio Bermudez, Rafael Casado
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

The InfiniBand architecture has been proposed as a technology both for communication between processing nodes and I/O devices, and for interprocessor communication. Its specification defines a basic management infrastructure that is responsible for subnet configuration and fault tolerance. Each time a topology change is detected, new forwarding tables have to be computed and uploaded to devices. The time required to compute these tables is a critical issue, due to application traffic is negatively affected by the temporary lack of connectivity. In this paper, we show the way to integrate several routing algorithms, in order to combine their advantages. In particular, we merge a new proposal, characterized by its high computation speed but low efficiency, with a traditional one, slower but more efficient. Our goal is to provide new routes in a short period of time, minimizing the degradation mentioned before, and maintaining, at the same time, high network performance.
Low latency and energy efficient mac protocols for wireless sensor networks
Authors: Bassem Alhalabi, Mihaela Cardei
Venue:  (2005)

Energy consumption is a critical design issue in Wireless Sensor Networks (WSNs), since sensor nodes are battery operated, and replacing or recharging the battery is usually infeasible. Energy efficient solutions are sought at all network levels, especially at the medium access level. The IEEE 802.11 MAC protocol is optimized for Ad hoc Wireless Networks, but cannot be adopted for WSNs because it has the idle listening problem, which is a major source of energy waste. Several Medium Access Control (MAC) protocols have been proposed for WSNs to save the transceiver energy by introducing periodic listen/sleep cycles, and thus overcome the idle listing problem. The periodic listen sleep cycles, however, will increase the network latency and require extra overhead to establish and maintain synchronization among nodes in the network. This dissertation introduces a new MAC protocol for WSNs based on the SMAC protocol to improve its latency performance without compromising its energy consumption. The original SMAC provides an efficient solution for the energy consumption problem due to idle listening, but it increases latency especially in low duty cycle applications. TMAC was proposed to further reduce the energy consumption in SMAC and introduced the Forward Request-To-Send (FRTS) packet to solve the early sleep problem observed in TMAC. Later, Adaptive SMAC was proposed to reduce the latency problem in SMAC by at least 50% at light traffic load. Our new protocol, FASMAC, combines the advantages of both adaptive listening and the usage of FRTS packet in TMAC to further reduce the latency of SMAC. In FASMAC, a packet can travel at least three hops away from its source node within one time cycle. This results in at least 67% reduction in latency at light traffic when compared with the original SMAC. We also propose an energy model for performance evaluation of WSNs protocols using the network simulator NS2. The current energy model of NS2 was designed to handle Ad hoc Wireless Networks where the low power consumption sleep mode was not an issue. However, this is not the case in WSNs. We show that NS2 energy model is not suitable to evaluate the performance of WSNs protocols because it does not account for the low power sleep mode. This dissertation proposes a solution to this deficiency and provides simulation results that match real experimental results performed on the actual sensor motes.
On the Forward and Backward Secrecy of HLL Group Key Exchange Mechanism
Authors: Chin-Chen Chang, Jung-San Lee, Chang-Chu Chen
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Due to the explosive development of several emerging applications such as, Multicast communication service, Pay-TV, Teleconference, and Collaborate tasks, mechanisms of group key exchange have attracted a lot of attentions. In 2004, Hwang et al. proposed an efficient group key exchange mechanism for providing secure multicast communications, which is a transformation from the two-party key exchange protocol to the group one. In this article, we point out that Hwang et al.'s proposed mechanism does not preserve the forward secrecy and the backward secrecy. We consequently propose an improved version to repair the security flaws of Hwang et al.'s group key exchange mechanism.
On the Use of Clone Detection for Identifying Crosscutting Concern Code
Authors: Magiel Bruntink, Arie van Deursen, Remco van Engelen Tom Tourwe
Venue: IEEE Transactions on Software Engineering (2005)

In systems developed without aspect-oriented programming, code implementing a crosscutting concern may be spread over many different parts of a system. Identifying such code automatically could be of great help during maintenance of the system. First of all, it allows a developer to more easily find the places in the code that must be changed when the concern changes and, thus, makes such changes less time consuming and less prone to errors. Second, it allows the code to be refactored to an aspect-oriented solution, thereby improving its modularity. In this paper, we evaluate the suitability of clone detection as a technique for the identification of crosscutting concerns. To that end, we manually identify five specific crosscutting concerns in an industrial C system and analyze to what extent clone detection is capable of finding them. We consider our results as a stepping stone toward an automated "aspect miner¿ based on clone detection.
Dance Movement: A Focus on the Technology
Authors: Natalie Ebenreuter
Venue: IEEE Computer Graphics and Applications (2005)

This article is concerned with the function of technology used to develop dance notation applications. The author argues that an appropriate use of technology employed to develop notation applications should ensure that applications remain accessible to the dance community while providing a comprehensive description and record of movement. The level of ease in which technology records movement to allow choreographers and dancers to capture, preserve and interpret the creative process are discussed.This article investigates the current technologies employed to describe and record movement. It evaluates the function they provide in offering a suitable level of accuracy in the description of movement and their accessibility to the dance community. This involves the selection and definition of specific criteria to construct a means of evaluation to demonstrate the potential success in which each technology under review has when fulfilling its purpose.This evaluation argues that Labanotation would be the most effective technology in providing a comprehensive description and record of movement. Underlying concerns and potential benefits associated with the accessibility and current practice of applications that make use of Labanotation are discussed.