ppxscal/embedding_network huggingface dataset:
HitME: low power Hit MEmory buffer for embedded systems
Authors: Andhi Janapsatya, Sri Parameswaran, Aleksandar Ignjatović
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

In this paper, we present a novel HitME (Hit-MEmory) buffer to reduce the energy consumption of memory hierarchy in embedded processors. The HitME buffer is a small direct-mapped cache memory that is added as additional memory into existing cache memory hierarchies. The HitME buffer is loaded only when there is a hit on L1 cache. Otherwise, L1 cache is updated from the memory and the processor's memory request is served directly from the L1 cache. The strategy works due to the fact that 90% of memory accesses are only accessed once, and these often pollute the cache. Energy reduction is achieved by reducing the number of accesses to the L1 cache memory. Experimental results show that the use of HitME buffer will reduce the L1 cache accesses resulting in a reduction in the energy consumption of the memory hierarchy. This decrease in L1 cache accesses reduces the cache system energy consumption by an average of 60.9% when compared to traditional L1 cache memory architecture and an energy reduction of 6.4% when compared to filter cache architecture for 70nm cache technology.
Enhancing artificial intelligence on a real mobile game
Authors: Fabio Aiolli, Claudio E. Palazzi
Venue: International Journal of Computer Games Technology (2009)

Mobile games represent a killer application that is attracting millions of subscribers worldwide. One of the aspects crucial to the commercial success of a game is ensuring an appropriately challenging artificial intelligence (AI) algorithm against which to play. However, creating this component is particularly complex as classic search AI algorithms cannot be employed by limited devices such as mobile phones or, even on more powerful computers, when considering imperfect information games (i.e., games in which participants do not a complete knowledge of the game state at any moment). In this paper, we propose to solve this issue by resorting to a machine learning algorithm which uses profiling functionalities in order to infer the missing information, thus making the AI able to efficiently adapt its strategies to the human opponent. We studied a simple and computationally light machine learning method that can be employed with success, enabling AI improvements for imperfect information games even on mobile phones. We created a mobile phone-based version of a game called Ghosts and present results which clearly show the ability of our algorithm to quickly improve its own predictive performance as far as the number of games against the same human opponent increases.
Visual and sonar data fusion for path following and obstacle avoidance by non-holonomic mobile robot
Authors: Amar Rezoug, Mohand Saïd Djouadi
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

this paper aims to contribute in mobile robots endowment with autonomy when accomplishing robotic taske. The problem treated concerns not only path following by non-holonomic robot (pioneer II DX) using visual data coming from CCD camera mounted on the latter, but also obstacle avoidance using data coming from front robot sonar battery. Thanks to the visual data, the robot is visually servoied to a ground coloured line. The possible or dynamic obstacles on the robot trajectory are avoided using Fuzzy approach exploiting sonar data. Finally experimental result are presented.
Exploring early evaluation techniques of ambient health promoting devices in home environments of senior citizens living independently
Authors: Rajasee Rege, Heekyoung Jung, William Hazelwood, Greg Orlov, Kay Connelly, Kalpana Shankar
Venue: Proceedings of the 2nd International Workshop on Systems and Networking Support for Health Care and Assisted Living Environments (2008)

In this paper, our goal is to explore different early evaluation techniques and their effectiveness for designing better ambient health- promoting devices for the elderly. One cannot assess the complete impact of these devices without full implementation of the device. However, through early evaluation, we present a set of considerations that can help gain meaningful insights to refine and improve upon the existing conceptual models of health monitoring ambient devices.
Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
Authors: Pierre Hansen, Christophe Meyer
Venue: Discrete Applied Mathematics (2009)

We present and compare three new compact linearizations for the quadratic 0-1 minimization problem, two of which achieve the same lower bound as does the ''standard linearization''. Two of the linearizations require the same number of constraints with respect to Glover's one, while the last one requires n additional constraints where n is the number of variables in the quadratic 0-1 problem. All three linearizations require the same number of additional variables as does Glover's linearization. This is an improvement on the linearization of Adams, Forrester and Glover (2004) which requires n additional variables and 2n additional constraints to reach the same lower bound as does the standard linearization. Computational results show however that linearizations achieving a weaker lower bound at the root node have better global performances than stronger linearizations when solved by Cplex.
MLP-Aware Runahead Threads in a Simultaneous Multithreading Processor
Authors: Kenzo Craeynest, Stijn Eyerman, Lieven Eeckhout
Venue: Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers (2008)

Threads experiencing long-latency loads on a simultaneous multith- reading (SMT) processor may clog shared processor resources without making forward progress, thereby starving other threads and reducing overall system throughput. An elegant solution to the long-latency load problem in SMT processors is to employ runahead execution. Runahead threads do not block commit on a long-latency load but instead execute subsequent instructions in a speculative execution mode to expose memory-level parallelism (MLP) through prefetching. The key benefit of runahead SMT threads is twofold: (i) runahead threads do not clog resources on a long-latency load, and (ii) runahead threads exploit far-distance MLP.This paper proposes MLP-aware runahead threads: runahead execution is only initiated in case there is far-distance MLP to be exploited. By doing so, useless runahead executions are eliminated, thereby reducing the number of speculatively executed instructions (and thus energy consumption) while preserving the performance of the runahead thread and potentially improving the performance of the co-executing thread(s). Our experimental results show that MLP-aware runahead threads reduce the number of speculatively executed instructions by 13.9% and 10.1% for two-program and four-program workloads, respectively, compared to MLP-agnostic runahead threads while achieving comparable system throughput and job turnaround time.
Preservation of interactive multimedia performances
Authors: Kia Ng, Tran Vu Pham, Bee Ong, Alexander Mikroyannidis, David Giaretta
Venue: International Journal of Metadata, Semantics and Ontologies (2008)

Preservation of Interactive Multimedia Performances (IMPs) is becoming important, as they are getting more and more popular in the performing arts communities. Preservation requires keeping not only all the necessary components for the production of a performance but also the knowledge about these components so that the original production process can be repeated at any given time. Ontologies provide the means for semantic processing, cataloguing and querying on preserved digital objects. In this paper, a framework for digital preservation of IMPs is introduced. The framework is based on the use of ontologies for describing the complex relationships among different components of a performance to support its preservation.
A generalization of Cobham's theorem to automata over real numbers
Authors: Bernard Boigelot, Julien Brusten
Venue: Theoretical Computer Science (2009)

This article studies the expressive power of finite-state automata recognizing sets of real numbers encoded positionally. It is known that the sets that are definable in the first-order additive theory of real and integer variables can all be recognized by weak deterministic Buchi automata, regardless of the encoding base r>1. In this article, we prove the reciprocal property, i.e., a subset of R that is recognizable by weak deterministic automata in every base r>1 is necessarily definable in . This result generalizes to real numbers the well-known Cobham's theorem on the finite-state recognizability of sets of integers. Our proof gives interesting insight into the internal structure of automata recognizing sets of real numbers, which may lead to efficient data structures for handling these sets.
Technology, Standards, and Real-World Deployments of the EPC Network
Authors: Frédéric Thiesse, Christian Floerkemeier, Mark Harrison, Florian Michahelles, Christof Roduner
Venue: IEEE Internet Computing (2009)

The EPC Network is a global RFID data sharing infrastructure based on standards that are built around the Electronic Product Code (EPC), an unambiguous numbering scheme for the designation of physical goods. The authors present the fundamental concepts and applications of the EPC Network, its integration with enterprise systems, and its functionality for data exchange between organizations in the supply chain.
Sponsored Search Auctions with Markovian Users
Authors: Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Martin Pál
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

Sponsored search involves running an auction among advertisers who bid in order to have their ad shown next to search results for specific keywords. The most popular auction for sponsored search is the "Generalized Second Price" (GSP) auction where advertisers are assigned to slots in the decreasing order of their score, which is defined as the product of their bid and click-through rate. One of the main advantages of this simple ranking is that bidding strategy is intuitive: to move up to a more prominent slot on the results page, bid more. This makes it simple for advertisers to strategize. However this ranking only maximizes efficiency under the assumption that the probability of a user clicking on an ad is independent of the other ads shown on the page. We study a Markovian user model that does not make this assumption. Under this model, the most efficient assignment is no longer a simple ranking function as in GSP. We show that the optimal assignment can be found efficiently (even in near-linear time). As a result of the more sophisticated structure of the optimal assignment, bidding dynamics become more complex: indeed it is no longer clear that bidding more moves one higher on the page. Our main technical result is that despite the added complexity of the bidding dynamics, the optimal assignment has the property that ad position is still monotone in bid. Thus even in this richer user model, our mechanism retains the core bidding dynamics of the GSP auction that make it useful for advertisers.
Digital workspace for optimal E-business strategies
Authors: Cristea Boboila, Constantin Lupsoiu
Venue: Proceedings of the 7th conference on Data networks, communications, computers (2008)

The foundation of a successful enterprise is the design of strategies that work consistently and at an optimal level to support the business goals. In this paper we present the architecture of a Digital Workspace for finding the optimal production strategies in a certain period of time. We determine, using parametric programming, an optimal investment plan (strategy) with an optimal loading on all machines.
The Giant Component in a Random Subgraph of a Given Graph
Authors: Fan Chung, Paul Horn, Linyuan Lu
Venue: Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph (2009)

We consider a random subgraph G p of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function of G) for which a giant component emerges. Suppose G satisfies some (mild) conditions depending on its spectral gap and higher moments of its degree sequence. We define the second order average degree $\tilde{d}$ to be $\tilde{d}=\sum_v d_v^2/(\sum_v d_v)$ where d v denotes the degree of v. We prove that for any &epsilon;>&thinsp;0, if $p > (1+ \epsilon)/{\tilde d}$ then asymptotically almost surely the percolated subgraph G p has a giant component. In the other direction, if $p < (1-\epsilon)/\tilde{d}$ then almost surely the percolated subgraph G p contains no giant component.
Visual Gesture Recognition for Real-Time Editing System
Authors: Byung-Woo Min, Ho-Sub Yoon, Jung Soh, Young-Kyu Yang
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This research aims to recognize one-stroke pictorial gestures from visual images, and to develop a graphic/text editing system running in real time. The tasks are performed through three steps: moving-hand tracking and trajectory generation, key-gesture segmentation, and gesture recognition by analyzing dynamic features. A gesture vocabulary consists of forty-eight gestures of three types: I) six editing commands, 2) six graphic primitives, 3) alphanumeric characters -twenty- six alphabetic and ten numerical. Some dynamic features are obtained from spatio-temporal trajectories and quantized by the K-means algorithm. The quantized vectors were trained and tested using hidden Markov models (HMMs).
Multiuser OFDM using IP mobile in VPNs and security IP
Authors: M. C. Niculescu, Elena Niculescu, I. Resceanu
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

In this paper we try to present advantages of multiuser OFDM and a hardware implementation, this include adaptive frequency hopping, adaptive modulation, and multiple transmitter cells. An overview of several new which techniques improve the safety of system and the enlargement efficiency. How mobile IP works when the mobile host isaway from home its home agent picks up its IP packets, encapsulates them in a new IP packet and forwards them to the foreign agent and intermediate routers are unaware of the inner IP header.
Managing aspect orderings to support multiple quality concerns
Authors: Bedir Tekinerdogan, Ersin Er
Venue: Proceedings of the 13th workshop on Aspect-oriented modeling (2009)

When multiple aspects are composed undesired behavior may emerge due to the interference of aspects. Different interference management approaches have been proposed including detection and resolution of the conflicting aspects. It appears that the majority of the existing approaches have basically focused on functional correctness, whereby orderings of aspects are evaluated with respect to assumed contractual specification. Although functional correctness is an important quality concern also other quality concerns such as evolvability, reuse and reliability can demand a specific ordering. As such, the resulting possible set of orderings might need to be further reduced. In this paper we discuss the impact of other quality concerns than functional correctness, on the required orderings of aspects. Based on a domain analysis of existing approaches we provide a feature model and complementary to this a metamodel for defining aspect interference management approaches for multiple quality concerns.
Ad Hoc Data and the Token Ambiguity Problem
Authors: Qian Xi, Kathleen Fisher, David Walker, Kenny Q. Zhu
Venue: Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages (2009)

pads is a declarative language used to describe the syntax and semantic properties of ad hoc data sources such as financial transactions, server logs and scientific data sets. The pads compiler reads these descriptions and generates a suite of useful data processing tools such as format translators, parsers, printers and even a query engine, all customized to the ad hoc data format in question. Recently, however, to further improve the productivity of programmers that manage ad hoc data sources, we have turned to using pads as an intermediate language in a system that first infers a pads description directly from example data and then passes that description to the original compiler for tool generation. A key subproblem in the inference engine is the token ambiguity problem -- the problem of determining which substrings in the example data correspond to complex tokens such as dates, URLs, or comments. In order to solve the token ambiguity problem, the paper studies the relative effectiveness of three different statistical models for tokenizing ad hoc data. It also shows how to incorporate these models into a general and effective format inference algorithm. In addition to using a declarative language (pads) as a key intermediate form, we have implemented the system as a whole in ml.
Locating patient expertise in everyday life
Authors: Andrea Civan, David W. McDonald, Kenton T. Unruh, Wanda Pratt
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

Coping with a new health issue often requires individuals to acquire knowledge and skills to manage personal health. Many patients turn to one another for experiential expertise outside the formal bounds of the health-care system. Internet-based social software can facilitate expertise sharing among patients, but provides only limited ways for users to locate sources of patient expertise. Although much prior research has investigated expertise location and systems to augment expertise sharing in workplace organizations, the transferability of this knowledge to other contexts, such as personal health, is unclear. Guided by expertise locating frameworks drawn from prior work, we conducted a field study to investigate expertise locating in the informal and everyday context of women diagnosed with breast cancer. Similarities between patients' expertise locating practices and practices of professionals in workplace organizations suggest similar support strategies could apply in both contexts. However, unlike professionals, unsolicited advice often triggered patients to locate expertise. They identified expertise through various forms of gatekeeping. The high-stakes nature of problems patients faced also led them to use triangulation strategies in anticipation of breakdowns in expertise location. Based on these key differences, we explored five design additions to social software that could support patients in their critical need to locate patient expertise.
A Highly Accurate Method for Assessing Reliability of Redundant Arrays of Inexpensive Disks (RAID)
Authors: Jon Elerath, Michael Pecht
Venue: IEEE Transactions on Computers (2009)

Abstract - The statistical bases for current models of RAID reliability are reviewed and a highly accurate alternative is provided and justified. This new model corrects statistical errors associated with the pervasive assumption that system (RAID group) times to failure follow a homogeneous Poisson process, and corrects errors associated with assuming the time-to-failure and time-to-restore distributions are exponentially distributed. Statistical justification for the new model uses theory for reliability of repairable systems. Four critical component distributions are developed from field data. These distributions are for times to catastrophic failure, reconstruction and restoration, read errors, and disk data scrubs. Model results have been verified and predict between 2 to 1,500 times as many double disk failures as estimates made using the mean time to data loss method. Model results are compared to system level field data for RAID group of 14 drives and show excellent correlation and greater accuracy than either MTTDL.
Transparent and adaptive computation-block caching for agent-based simulation on a PDES core
Authors: Yin Xiong, Maria Hybinette, Eileen Kraemer
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We present adaptive computation-block caching that supports improved performance and is suited for agent-based simulations. The approach is illustrated in SASSY (Scalable Agents Simulation System). SASSY leverages a Parallel Discrete Event Simulation for performance, but provides an agent-based API to the developer. Agent-based simulation is suited to computation-block caching because relevant calculations completed at each event may be relatively heavyweight and may be repeated. The potential savings of avoiding a computation entirely may offset the overhead cost of caching. The approach is refined through the use of statistical methods for choosing which computation blocks should be cached or not. If the relevant computation is trivial, caching is not worth the cost. In other cases caching provides a substantial speedup. Our mechanism tracks these costs online and adjusts accordingly. It requires no additional coding but is automatically integrated into applications. We assess the performance of the approach in a benchmark-application.
LELE: Leader Election with Load Balancing Energy in Wireless Sensor Network
Authors: Mohammad Mehdi Shirmohammadi, Karim Faez, Mostafa Chhardoli
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

In this article the LEACH (low energy adaptive clustering hierarchy) in the homogeneous wireless sensor networks (WSNs) was considered and a new protocol with an approach toward promoting LEACH was introduced. In the new protocol which is called LELE (leader election with load balancing energy), the major work was how to elect the leader which was done through changing the sensor's energy, LELE protocol compares the amount of energy and distance of a node with its neighbouring sensors to elect it as leader. And, finally the sensor with the higher energy (has more suitable position as compared with the neighbouring nodes ) for chosen as the leader. After simulating the new protocol and comparing it with the previous protocol it was well observed that LELE in addition to balancing the energy and throughput, increases the network's lifetime as compared with that of LEACH. In the new protocol the time distance between the observation of the first dead sensor and the last sensor's having lost its energy is so short.
Test-bed platform for bio-inspired distributed systems
Authors: Ichiro Satoh
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

This paper presents a general-purpose test-bed platform for implementing and evaluating bio-inspired approaches over real distributed systems. It enables each software agent to be dynamically organized with other agents and deployed at computers according to its own organization and deployment policies. We developed several bio-inspired approaches with the platform to evaluate them over real distributed systems instead of using simulation-based evaluations. In fact, our experiment on an ant-based routing mechanism, which is one of the most typical bio-inspired approaches for distributed systems obtained different results from the results of existing simulation-based experiments. We believe that our platform is useful for bridging the gap between simulation-based approaches and real systems.