ppxscal/embedding_network huggingface dataset:
Context-Aware Multilayer Hierarchical Protocol for Wireless Sensor Network
Authors: Md Enamul Haque, Noriko Matsumoto, Norihiko Yoshida
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

Evolution in Wireless Sensor Network has broadened its pervasive and ubiquitous applications in numerous fields. These applications often require accurate information collecting as well as uninterrupted, prolonged active service. Among the constituting elements of WSN, an energy efficient routing protocol plays a significant role in fulfilling such requirements. In this paper, an energy efficient routing protocol, Context Aware Multilayer Hierarchical Protocol (CAMHP) is proposed where the cluster formation is based on the context of the environment. This three layer hierarchical protocol implements cluster head and super cluster head role rotation techniques for uniform energy consumption across the network. Moreover, an efficient procedure is utilized to avoid similar data traffic from nodes to base station. Simulation results show that the proposed hierarchical protocol achieves significant performance improvement through progressive energy efficiency and longer active service.
GSPeeDI --- A Verification Tool for Generalized Polygonal Hybrid Systems
Authors: Hallstein Asheim Hansen, Gerardo Schneider
Venue: Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing (2009)

The GSPeeDI tool implements a decision procedure for the reachability analysis of GSPDIs, planar hybrid systems whose dynamics is given by differential inclusions, and that are not restricted by the goodness assumption from previous work on the so-called SPDIs.Unlike SPeeDI (a tool for reachability analysis of SPDIs) the underlying analysis of GSPeeDI is based on a breadth-first search algorithm, and it can handle more general systems.
Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model
Authors: Duc-Phong Le, Alexis Bonnecaze, Alban Gabillon
Venue: Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography (2009)

A multisignature scheme allows a group of signers to cooperate to generate a compact signature on a common document. The length of the multisignature depends only on the security parameters of the signature schemes and not on the number of signers involved. The existing state-of-the-art multisignature schemes suffer either from impractical key setup assumptions, from loose security reductions, or from inefficient signature verification. In this paper, we present two new multisignature schemes that address all of these issues, i.e., they have efficient signature verification, they are provably secure in the plain public-key model, and their security is tightly related to the computation and decisional Diffie-Hellman problems in the random oracle model. Our construction derives from variants of EDL signatures.
An Optical Pen Tracking System as Alternative Pointing Device
Authors: Ingmar Seeliger, Ulrich Schwanecke, Peter Barth
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

A webcam together with a pen can replace a mouse as pointing device for many common user interaction tasks. We have implemented an image-processing component integrated in a tool that acts as mouse alternative. The image-processing component tracks the head of a pen based on shape and colour information retrieved in a quick, integrated initial pen-calibration phase using Hough transform triggered by a motion detection cycle. The tracked 2D position of the pen-head seen by the webcam is used to smoothly position the mouse cursor. Combined with auto-clicking we can replace mouse-based user interaction. The system tolerates changing lighting conditions, does not need time-consuming camera calibration and works with off-the-shelf webcams. First user experiences show that this technology can partially replace mouse interaction for Repetitive Strain Injury (RSI) patients as well as completely replace mouse interaction within dedicated environments such as presentation booths or simple games.
Development of a VII-enabled prototype intersection collision warning system
Authors: Mohammad Nekoui, Daiheng Ni, Hossein Pishro-Nik, Richa Prasad, Mohammed Raza Kanjee, Hui Zhu, Thai Nguyen
Venue: International Journal of Internet Protocol Technology (2009)

This paper presents the design of a prototype intersection collision warning system based on Vehicle Infrastructure Integration (VII). This system involves Roadside Equipment (RSE) at an intersection and several units of On-Board Equipment (OBE), each in a moving vehicle. When an equipped vehicle approaches the intersection, its OBE queries the remaining time before the light turns red from the RSE which is synchronised with the intersection signal. Combining its own speed and position, the OBE determines the likelihood of running the red light. In case of such a hazard, the OBE warns its driver and notifies other OBEs wirelessly.
Methods for Computing Trust and Reputation While Preserving Privacy
Authors: Ehud Gudes, Nurit Gal-Oz, Alon Grubshtein
Venue: Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII (2009)

Trust and Reputation systems in distributed environments attain widespread interest as online communities are becoming an inherent part of the daily routine of Internet users. Trust-based models enable safer operation within communities to which information exchange and peer to peer interaction are centric. Several models for trust based reputation have been suggested recently, among them the Knots model [5]. In these models, the subjective reputation of a member is computed using information provided by a set of members trusted by the latter. The present paper discusses the computation of reputation in such models, while preserving members' private information. Three different schemes for the private computation of reputation are presented, and the advantages and disadvantages in terms of privacy and communication overhead are analyzed.
From Dubins&#x2019; car to Reeds and Shepp&#x2019;s mobile robot
Authors: Valerii S. Patsko, Varvara L. Turova
Venue: Computing and Visualization in Science (2009)

In the paper, a control system with intermediate dynamics between Dubins&#x2019; car and Reeds and Shepp&#x2019;s mobile robot is investigated. Time-limited reachable sets and reachable sets at given time are computed. Families of semipermeable curves that are useful for the detection of jumps of the value function of time-optimal control problem are constructed.
Statistical Properties of Portals' Users Activity
Authors: Anna Chmiel, Kamila Kowalska, Janusz A. Holyst
Venue: Proceedings of the 2009 International Workshop on Social Informatics (2009)

We investigate the behavior of users at the web portal. We focus on transitions between two subpages, using the information about the path of the users. We construct a weighted network with portal subpages being its nodes and the weights of edges defined as a number of transition from between different subpages. We scrutinize the properties of such a network as a distribution of weights and strengths that corresponds to the power-law relation, as well as the statistics of users behavior. The latter brings interesting results: the average number of distinct subpages visited during the n-th step of a visit scales as a square root relation.
Security of Water Infrastructure Systems
Authors: Demetrios G. Eliades, Marios M. Polycarpou
Venue: Critical Information Infrastructure Security: Third International Workshop, CRITIS 2008, Rome, Italy, October13-15, 2008. Revised Papers (2009)

This paper formulates the security problem in critical water infrastructure systems for diagnosing quality faults. The proposed scheme is based on the discretized equations of advection and reaction of contaminant concentrations in pipes and tanks, expressed in a state-space form. Faults are signals affecting the states, and their impact is measured based on certain epidemiological dynamics. A multi-objective optimization problem is formulated for minimizing various risk-related objectives.
Design of a Reliable Traffic Control System on City Area Based on a Wireless Network
Authors: Junghoon Lee, In-Hye Shin, Cheol Min Kim
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

This paper designs and analyzes the performance of a reliable communication scheme for the traffic control system, which has a grid topology, based on WirelessHart, a newly developed wireless process control protocol. Besides the main communication schedule, additional schedule is defined with a different channel hopping sequence to make a node take an alternative route in the same slot when the channel on the primary path is not clear. Using the split-merge function augmented to the original WirelessHart node operation, the transmission success ratio can be significantly improved on the rectangular path without extending the control loop. The performance evaluation result measured by simulation using a discrete event scheduler demonstrates that the proposed scheme improves the transmission success ratio for 4 × 4 grid by up to 29 % and each split-merge operation can recover almost all channel errors, especially for long hop transmission.
Hierarchical reinforcement learning with the MAXQ value function decomposition
Authors: Thomas G. Dietterich
Venue: Journal of Artificial Intelligence Research (2000)

This paper presents a new approach to hierarchical reinforcement learning based on decomposing the target Markov decision process (MDP) into a hierarchy of smaller MDPs and decomposing the value function of the target MDP into an additive combination of the value functions of the smaller MDPs. The decomposition, known as the MAXQ decomposition, has both a procedural semantics--as a subroutine hierarchy--and a declarative semantics--as a representation of the value function of a hierarchical policy. MAXQ unifies and extends previous work on hierarchical reinforcement learning by Singh, Kaelbling, and Dayan and Hinton. It is based on the assumption that the programmer can identify useful subgoals and define subtasks that achieve these subgoals. By defining such subgoals, the programmer constrains the set of policies that need to be considered during reinforcement learning. The MAXQ value function decomposition can represent the value function of any policy that is consistent with the given hierarchy. The decomposition also creates opportunities to exploit state abstractions, so that individual MDPs within the hierarchy can ignore large parts of the state space. This is important for the practical application of the method. This paper defines the MAXQ hierarchy, proves formal results on its representational power, and establishes five conditions for the safe use of state abstractions. The paper presents an online model-free learning algorithm, MAXQ-Q, and proves that it converges with probability 1 to a kind of locally-optimal policy known as a recursively optimal policy, even in the presence of the five kinds of state abstraction. The paper evaluates the MAXQ representation and MAXQ-Q through a series of experiments in three domains and shows experimentally that MAXQ-Q (with state abstractions) converges to a recursively optimal policy much faster than flat Q learning. The fact that MAXQ learns a representation of the value function has an important benefit: it makes it possible to compute and execute an improved, non-hierarchical policy via a procedure similar to the policy improvement step of policy iteration. The paper demonstrates the effectiveness of this nonhierarchical execution experimentally. Finally, the paper concludes with a comparison to related work and a discussion of the design tradeoffs in hierarchical reinforcement learning.
Introduction to Webometrics: Quantitative Web Research for the Social Sciences
Authors: Michael Thelwall
Venue:  (2009)

Webometrics is concerned with measuring aspects of the web: web sites, web pages, parts of web pages, words in web pages, hyperlinks, web search engine results. The importance of the web itself as a communication medium and for hosting an increasingly wide array of documents, from journal articles to holiday brochures, needs no introduction. Given this huge and easily accessible source of information, there are limitless possibilities for measuring or counting on a huge scale (e.g., the number of web sites, the number of web pages, the number of blogs) or on a smaller scale (e.g., the number of web sites in Ireland, the number of web pages in the CNN web site, the number of blogs mentioning Barack Obama before the 2008 presidential campaign). This book argues that it can be useful for social scientists to measure aspects of the web and explains how this can be achieved on both a small and large scale. The book is intended for social scientists with research topics that are wholly or partly online (e.g., social networks, news, political communication) and social scientists with offline research topics with an online reflection, even if this is not a core component (e.g., diaspora communities, consumer culture, linguistic change). The book is also intended for library and information science students in the belief that the knowledge and techniques described will be useful for them to guide and aid other social scientists in their research. In addition, the techniques and issues are all directly relevant to library and information science research problems. Table of Contents: Introduction / Web Impact Assessment / Link Analysis / Blog Searching / Automatic Search Engine Searches: LexiURL Searcher / Web Crawling: SocSciBot / Search Engines and Data Reliability / Tracking User Actions Online / Advaned Techniques / Summary and Future Directions 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
The Scheme of Handover Performance Improvement in WiBro
Authors: Wongil Park
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

Demands for a mobile communication and a high quality service such as video streaming or VoIP have been increasing in recent years. The Wireless Broadband Internet (WIBRO)system, which is specified by ETRI (Electronics and Telecommunications Research Institute) and other companies in Korea as well as IEEE 802.16e standard. The feature of this system is that the backbone networks are potentially deployed by IPv6 based technologies due to the All-IP trend. Therefore, it is important to support efficient mobility management protocol on IP layer as well as data link layer based on WiBro system. In this paper, we propose the scheme that different process according to the traffic characteristic. The performance analysis and the numerical results presented in this paper show that our proposal has superior performance.
Avalanche: towards a scalable content-based Pub/Sub network service
Authors: Mohamed Diallo, Serge Fdida
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

In this paper, we aim at contributing to the current discussion of the architecture design of a Network of Information supporting a Data-Centric approach, we explore the ability to extend the "Publish and Subscribe"(Pub/Sub) service model to the Internet scale. For this purpose, we propose an original dissemination scheme that increases the scalability of the Content-Based Pub/Sub framework without sacrificing much of the service semantics.
The Narrator: NLG for digital storytelling
Authors: Mariët Theune, Nanda Slabbers, Feikje Hielkema
Venue: Proceedings of the Eleventh European Workshop on Natural Language Generation (2007)

We present the Narrator, an NLG component used for the generation of narratives in a digital story-telling system. We describe how the Narrator works and show some examples of generated stories.
Low Cost Mechanism for QoS-Aware Re-Planning of Composite Service
Authors: Yu Dai, Zhiliang Zhu, Dancheng Li, Hao Wang, Ying Chen, Bin Zhang
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

To meet the business and user requirements, it is crucial to manage the Quality of Service (QoS) of composite web service. Due to the dynamics nature of the web services, the runtime behavior of web services is likely to differ from the initial estimated one. Therefore, a re-planning to adapt the composite service to the QoS violated services, ensuring the global constraints and preferences will be needed. In this paper, we propose a low cost mechanism for re-planning. Such mechanism is supported by an offline re-planning execution environment and a performance prediction based low cost policy.The experimentations show better performance of the mechanism.
Interactive viscosity
Authors: Stephen L. Macknik, Susana Martinez-Conde
Venue: Proceedings of the 22nd annual ACM symposium on User interface software and technology (2009)

Your conscious experience is not a function of the world, it is a function of the neural networks of your brain. Therefore, the biology of the brain and consciousness is as fundamental to understanding the universe, as we know it, as the high-energy physics of subatomic particles. This is especially true for the study of sensory and cognitive illusions, since they represent effects that clearly stand out as not representing the real world. That is, since illusions don't match reality we can know that by studying illusions we are studying exactly what the brain is actually doing, and not just what we think the brain should be doing. Your brain does a staggering amount of pragmatic self-dealing guesswork and outright confabulation in order to construct the highly imperfect mental simulation of reality known as "consciousness." This is not to say that objective reality isn't "out there" in a very real sense--but no one lives there. No one's ever even been there for a visit. Ironically, the fact that consciousness feels like a solid, robust, fact-rich transcript of reality is just one of the countless illusions your brain creates for itself. Illusions are not errors of the brain. Far from it. Illusions arise from processes that are critical to our survival. Our brains have developed illusory processes so that we may experience the world in a ready-to-consume manner. Remove the machinery of illusion, and you unwind the entire tapestry of human awareness. Illusions are those perceptual experiences that do not match the physical reality. They are therefore exquisite tools with which to analyze the neural correlates of human perception and consciousness. Neuroscientists have long known that they can only be sure of where they stand, in terms of correlating neural responses to awareness, when they correlate the awareness of an illusion to the brain's response, specifically because of the illusions' mismatch with reality. The study of illusions is therefore of critical importance to the understanding of the basic mechanisms of sensory perception and conscious awareness. If you've ever seen a good magician perform, you know how thrilling it is to watch the impossible happening before your eyes. The laws of physics, probability, psychology and common sense--the four trusty compass points in your mental map of reality--are suddenly turned into liabilities. Objects and people appear, vanish, levitate, transpose, transform, and with all your smarts you can't imagine how it's being done. Magicians are the premier artists of attention and awareness, and they manipulate our cognition like clay on a potter's wheel. And the mechanisms underlying magic perception have implications for our daily lives. The magical arts work because humans have hardwired processes of attention and awareness that are hackable. By understanding how magicians hack our brains, we can better understand how we work.
Learning to Rank for Information Retrieval
Authors: Tie-Yan Liu
Venue: Foundations and Trends in Information Retrieval (2009)

Learning to rank for Information Retrieval (IR) is a task to automatically construct a ranking model using training data, such that the model can sort new objects according to their degrees of relevance, preference, or importance. Many IR problems are by nature ranking problems, and many IR technologies can be potentially enhanced by using learning-to-rank techniques. The objective of this tutorial is to give an introduction to this research direction. Specifically, the existing learning-to-rank algorithms are reviewed and categorized into three approaches: the pointwise, pairwise, and listwise approaches. The advantages and disadvantages with each approach are analyzed, and the relationships between the loss functions used in these approaches and IR evaluation measures are discussed. Then the empirical evaluations on typical learning-to-rank methods are shown, with the LETOR collection as a benchmark dataset, which seems to suggest that the listwise approach be the most effective one among all the approaches. After that, a statistical ranking theory is introduced, which can describe different learning-to-rank algorithms, and be used to analyze their query-level generalization abilities. At the end of the tutorial, we provide a summary and discuss potential future work on learning to rank.
Learning to Disambiguate Search Queries from Short Sessions
Authors: Lilyana Mihalkova, Raymond Mooney
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II (2009)

Web searches tend to be short and ambiguous. It is therefore not surprising that Web query disambiguation is an actively researched topic. To provide a personalized experience for a user, most existing work relies on search engine log data in which the search activities of that particular user, as well as other users, are recorded over long periods of time. Such approaches may raise privacy concerns and may be difficult to implement for pragmatic reasons. We present an approach to Web query disambiguation that bases its predictions only on a short glimpse of user search activity, captured in a brief session of 4---6 previous searches on average. Our method exploits the relations of the current search session to previous similarly short sessions of other users in order to predict the user's intentions and is based on Markov logic, a statistical relational learning model that has been successfully applied to challenging language problems in the past. We present empirical results that demonstrate the effectiveness of our proposed approach on data collected from a commercial general-purpose search engine.
Chinese Annual Electric Power Consumption Forecasting Based on Grey Model and Global Best Optimization Method
Authors: Ming Meng, Wei Shang
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

The annual electric power consumption is one of the most important factors in operation decisions of Chinese electric power generation groups. The grey model is feasible method to deal with this trend extension problem with few data. But the simple approximation in dispersing the first order differential equation affects it forecasting precise. Based on adjusting the positions of each particle, the global best optimization method could search the best proportion point. This could improve the forecasting results in the practice of annual electric power consumption.