ppxscal/embedding_network huggingface dataset:
The New Pact: How Online Worlds Forge a New Form of Alliance between Players and Designers
Authors: Nicolas Gaume
Venue: Proceedings of the 8th International Conference on Entertainment Computing (2009)

Today's Pop Culture is tomorrow's classic. Entertainment is often able to reflect a society's questions and anxieties of the day. We will discuss how and why today's Digital Generation has replaced their grandparents' heroes and their parents' anti-heroes by their very own avatars. How and why the empathy with heroes that has traditionally been utilized by movies has been gradually overtaken by the personalized and immersive experience of games as lived through the eyes of an avatar? How multiplayer activities are now establishing new social paradigms where these avatars help us all deal with the natural schizophrenia of everyday life by allowing us to explore our possible selves. The Social Networks boom has demonstrated our appetite for connections with others; and games our appetite for second lives, our desire to involve ourselves and master complex worlds. Perhaps, tomorrow new public Agoras will be created from a new generation of Virtual Worlds built using the grammar that video games have forged over the last 40 years...The Author. Nicolas Gaume founded in 1990, at the age of 19, Kalisto Entertainment, a video game development studio. Over its 12 years of life, Kalisto produced more than 50 titles for PC and consoles. Kalisto also worked with Orange to launch their mobile games efforts. The company employed a staff of over 350 people in the USA, Japan and France. Besides his Kalisto venture, Nicolas Gaume founded in 1994, NGM Productions, a children book publishing company in China. NGM published popular French series such as "Père Castor" (Flammarion) or "Les Incollables/Brain Quest" (Play Bac) between 1994 and 1999, when the company was sold. He also co-founded, in 1995, one of the first French web agency, Wcube, sold to Swedish group, Framfab, and, in 2000, a wine promotion site, winealley.com. He was also board member of the French media group Sud-Ouest, of the TV animation production company, Xilam of the German data management software publisher, NXN, sold in 2004 to Avid. Between July 2002 and May 2005, Nicolas has worked as a consultant advising media group such as AOL, Orange or Lagardère and game companies such as Codemasters or Ubisoft, primarily on their development partnerships strategies. For thee years, Nicolas Gaume was then Senior VP GM of the mobile games applications division of Cellfish Media, a Lagardère company. Early 2008, he founded a new company, Mimesis Republic, focusing on the design, development and operation of virtual worlds and social networks. He also currently serves as chairman of the French national video game development school -ENJMIN- and president of the French game developers association, SNJV. 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
Semantic Annotation for the LingvoSemantics Project
Authors: Ivan Habernal, Miloslav Konopík
Venue: Proceedings of the 12th International Conference on Text, Speech and Dialogue (2009)

In this paper, a methodology of semantic annotation of the LingvoSemantic corpus is presented. Semantic annotation is usually a time consuming and expensive process. We thus developed a methodology that significantly reduces the demands of the process. The methodology consists of a set of techniques and computer tools designed to simplify the process as much as possible. We claim that in this way it is possible to obtain sufficient amount of annotated data in a reasonable time frame. The LingvoSemantic project focuses on semantic analysis of user questions to an Internet information retrieval system. The semantic representation approach is based on abstract semantic annotation methodology. However, we advanced the annotation process. The bootstrapping method was used during the corpus annotation. The resulting annotated corpus consists of 20292 annotated sentences. In comparison to the straight-forward style of annotation, our approach significantly improved the efficiency of the annotation. The results, as well as a set of recommendations for creating the annotated data, are presented at the end of the paper.
Automated Composition of Semantic Web Services Using Case-Based Planning
Authors: Jia Hu, Zhiyong Feng
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

One of the most challenging issues of service-centric software engineering is the automatic composition of services. In academia, most approaches reduce the service composition problem to the AI planning problem and generate a plan for the user's request from scratch. However in the real world there may be a large amount of same or similar requests, so how to adapt the existing solutions for the past requests to functionally fit for the current same or similar ones becomes a new challenge in the context of semantic web services. In our study, we propose an approach for automated composition of semantic web services based on case-based planning. The generated plan can have sequential and non-sequential control constructs. Additionally, a case study from the bioinformatics domain is given to illustrate our approach.
Design of an embedded system for the proactive maintenance of electrical valves
Authors: Luiz F. Gonçalves, Jefferson L. Bosa, Renato V. B. Henriques, Marcelo S. Lubaszewski
Venue: Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes (2009)

This paper presents a proactive maintenance scheme for the detection and diagnosis of faults in electrical valves. In our case study, these actuators are used for controlling the flow in an oil distribution network. An embedded system implements selforganizing maps for the detection and classification of faults that lead to deviations either on torque, or on the valve opening position. For fault detection, the map is trained using a mathematical model devised for the electrical valve. For fault classification, training is performed by fault injection based on parameter deviations over this same mathematical model. In both cases, the maps store the energies of the torque and the opening position that are computed using the wavelet packet transform. Once the maps are trained, the embedded system is ready for online monitoring the actuator. During the on-line testing phase, the embedded system computes the best matching between an acquired input vector (current torque and position energies) and the synaptic weight vector of the trained map. This matching is quantified by computing the Euclidean distance between these vectors and guide the fault detection and classification steps. The complete scheme was prototyped using FPGAs. The results obtained for area, performance and memory requirements point out to a low cost, promising solution for embedding maintenance in electrical actuators.
Quantum Algorithms of the Subset-Sum Problem on a Quantum Computer
Authors: Weng-Long Chang, Ting-Ting Ren, Mang Feng, Lai Chin Lu, Kawuu Weicheng Lin, Minyi Guo
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

In this paper, quantum algorithms for solving an instance of the subset-sum problem is proposed and a NMR experiment for the simplest subset-sum problem to test our theory is also performed.
A Web-Based, Interactive Annotation Editor for the eCampus Development Environment for SCORM Compliant E-Learning Modules
Authors: Benedikt Deicke, Jan-Torsten Milde, Hans-Martin Pohl
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

The eCampus development environment was created in an interdisciplinary project at the University of Applied Sciences Fulda. Today it is a fully webbased application for the easy creation of E-Learning modules complying the SCORM standard. The webbased, interactive annotation editor for the eCampus development environment is used to both automatically and manually annotate existing OpenOffice documents in order to transform them into E-Learning modules. The editor is build using Open Source software and frameworks such as Ruby on Rails.
Extending Host Identity Protocol with Paging
Authors: Yajuan Qin, Shuigen Yang
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

Host Identity Protocol (HIP) is mainly designed to provide secure and continuous communication by decoupling the transport layer from the internetworking layer. Furthermore, HIP can provide for a degree of internetworking mobility and multi-homing at a low infrastructure cost. Currently, HIP does not support paging, which is widely used in wireless networks to reduce the signaling cost for location management and to save the power consumption of the mobile node. In this paper, we propose P-HIP, paging extensions for HIP, and discuss the architecture, protocol, algorithm, and the data handling of P-HIP. We develop an analytical model to study the performance of HIP and P-HIP, and discuss the performance results in terms of the signaling cost.
A Digital Watermarking Method Using Binary Cluster
Authors: Wei-Hung Lin, Yuh-Rau Wang, Shi-Jinn Horng
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

In this paper, we propose a wavelet-tree-based watermarking method for copyright protection by using distance vector of binary cluster. Wavelet trees are classified into two clusters using the distance vector, which is obtained from the two smallest coefficients of a wavelet tree, to denote binary watermark bits. The trees are classified into two clusters so that they exhibit a sufficiently large statistical difference based on the distance vector, which difference is then used for subsequent watermark extraction. The watermark is embedded in the insignificant coefficients of wavelet trees, and uses the difference of the distance between the two smallest wavelet coefficients to extract the watermark. Experimental results show that the proposed method is very efficient in resisting various kinds of attacks and the watermarked image looks visually lossless.
Anti-jamming for embedded wireless networks
Authors: Miroslav Pajic, Rahul Mangharam
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

Resilience to electromagnetic jamming and its avoidance are difficult problems. It is often both hard to distinguish malicious jamming from congestion in the broadcast regime and a challenge to conceal the activity patterns of the legitimate communication protocol from the jammer. In the context of energy-constrained wireless sensor networks, nodes are scheduled to maximize the common sleep duration and coordinate communication to extend their battery life. This results in well-defined communication patterns with possibly predictable intervals of activity that are easily detected and jammed by a statistical jammer. We present an anti-jamming protocol for sensor networks which eliminates spatio-temporal patterns of communication while maintaining coordinated and contention-free communication across the network. Our protocol, WisperNet, is time-synchronized and uses coordinated temporal randomization for slot schedules and slot durations at the link layer and adapts routes to avoid jammers in the network layer. Through analysis, simulation and experimentation we demonstrate that WisperNet reduces the efficiency of any statistical jammer to that of a random jammer, which has the lowest censorship-to-link utilization ratio. WisperNet has been implemented on the FireFly sensor network platform.
Classifying factored genres with part-of-speech histograms
Authors: S. Feldman, M. Marin, J. Medero, M. Ostendorf
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers (2009)

This work addresses the problem of genre classification of text and speech transcripts, with the goal of handling genres not seen in training. Two frameworks employing different statistics on word/POS histograms with a PCA transform are examined: a single model for each genre and a factored representation of genre. The impact of the two frameworks on the classification of training-matched and new genres is discussed. Results show that the factored models allow for a finer-grained representation of genre and can more accurately characterize genres not seen in training.
On Certain Continued Fraction Representations of Poly-basic Series
Authors: Remy Y. Denis, S. N. Singh, S. P. Singh
Venue: Proceedings of the 2008 First International Conference on Complexity and Intelligence of the Artificial and Natural Complex Systems. Medical Applications of the Complex Systems. Biomedical Computing (2008)

We establish extended Bailey's transform by providing a simple proof and deduce certain special cases of the same.
Resource constrained distributed constraint optimization with virtual variables
Authors: Toshihiro Matsui, Hiroshi Matsuo, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

Cooperative problem solving with resource constraints are important in practical multi-agent systems. Resource constraints are necessary to handle practical problems including distributed task scheduling with limited resource availability. A dedicated framework called Resource Constrained DCOP (RCDCOP) has recently been proposed. RCDCOP models objective functions and resource constraints separately. A resource constraint is an n-ary constraint that represents the limit on the number of resources of a given type available to agents. Previous research addressing RCDCOPs employs the Adopt algorithm, which is an efficient solver for DCOPs. An important graph structure for Adopt is the pseudo-tree for constraint networks. A pseudo-tree implies a partial ordering of variables. In this variable ordering, n-ary constrained variables are placed on a single path of the tree. Therefore, resource constraints that have large arity augment the depth of the pseudo-tree. This also reduces the parallelism, and therefore the efficiency of Adopt. In this paper we propose another version of the Adopt algorithm for RCDCOP using a pseudo-tree that is generated ignoring resource constraints. The proposed method reduces the previous limitations in the construction of RCDCOP pseudo-trees. The key ideas of our work are as follows: (i) The pseudo-tree is generated ignoring resource constraints. (ii) Virtual variables are introduced, representing the usage of resources. These virtual variables are used to share resources among sub-trees. However, the addition of virtual variables increases the search space. To handle this problem, influence of placement of virtual variables/resources constraints in the pseudo tree is considered. Moreover the search is pruned using the bounds defined by the resource constraints if possible. These ideas are used to extend Adopt. The efficiency of our technique depends on the class of problems being considered, and we describe the obtained experimental results.
Potential-aware automated abstraction of sequential games, and holistic equilibrium analysis of Texas Hold'em poker
Authors: Andrew Gilpin, Tuomas Sandholm, Troels Bjerre Sørensen
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

We present a new abstraction algorithm for sequential imperfect information games. While most prior abstraction algorithms employ a myopic expected-value computation as a similarity metric, our algorithm considers a higher-dimensional space consisting of histograms over abstracted classes of states from later stages of the game. This enables our bottom-up abstraction algorithm to automatically take into account potential: a hand can become relatively better (or worse) over time and the strength of different hands can get resolved earlier or later in the game. We further improve the abstraction quality by making multiple passes over the abstraction, enabling the algorithm to narrow the scope of analysis to information that is relevant given abstraction decisions made for earlier parts of the game. We also present a custom indexing scheme based on suit isomorphisms that enables one to work on significantly larger models than before. We apply the techniques to heads-up limit Texas Hold'em poker. Whereas all prior game theory-based work for Texas Hold'em poker used generic off-the-shelf linear program solvers for the equilibrium analysis of the abstracted game, we make use of a recently developed algorithm based on the excessive gap technique from convex optimization. This paper is, to our knowledge, the first to abstract and game-theoretically analyze all four betting rounds in one run (rather than splitting the game into phases). The resulting player, GS3, beats BluffBot, GS2, Hyperborean, Monash-BPP, Sparbot, Teddy, and Vexbot, each with statistical significance. To our knowledge, those competitors are the best prior programs for the game.
Enhancing Security of a Group Key Exchange Protocol for Users with Individual Passwords
Authors: Junghyun Nam, Sangchul Han, Minkyu Park, Juryon Paik, Ung Mo Kim
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

Group key exchange protocols allow a group of parties communicating over a public network to come up with a common secret key called a session key. Due to their critical role in building secure multicast channels, a number of group key exchange protocols have been suggested over the years for a variety of settings. Among these is the so-called EKE-M protocol proposed by Byun and Lee for password-based group key exchange in the different password authentication model, where group members are assumed to hold an individual password rather than a common password. While the announcement of the EKE-M protocol was essential in the light of the practical significance of the different password authentication model, Tang and Chen showed that the EKE-M protocol itself suffers from an undetectable on-line dictionary attack. Given Tang and Chen's attack, Byun et al. have recently suggested a modification to the EKE-M protocol and claimed that their modification makes EKE-M resistant to the attack. However, the claim turned out to be untrue. In the current paper, we demonstrate this by showing that Byun et al.'s modified EKE-M is still vulnerable to an undetectable on-line dictionary attack. Besides reporting our attack, we also figure out what has gone wrong with Byun et al.'s modification and how to fix it.
Shallow semantic parsing for spoken language understanding
Authors: Bonaventura Coppola, Alessandro Moschitti, Giuseppe Riccardi
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers (2009)

Most Spoken Dialog Systems are based on speech grammars and frame/slot semantics. The semantic descriptions of input utterances are usually defined ad-hoc with no ability to generalize beyond the target application domain or to learn from annotated corpora. The approach we propose in this paper exploits machine learning of frame semantics, borrowing its theoretical model from computational linguistics. While traditional automatic Semantic Role Labeling approaches on written texts may not perform as well on spoken dialogs, we show successful experiments on such porting. Hence, we design and evaluate automatic FrameNet-based parsers both for English written texts and for Italian dialog utterances. The results show that disfluencies of dialog data do not severely hurt performance. Also, a small set of FrameNet-like manual annotations is enough for realizing accurate Semantic Role Labeling on the target domains of typical Dialog Systems.
A Study of Characteristics and Processing Method of Broadband Doppler Velocity Log Echo
Authors: Xiong-fei Huang, Bing-cheng Yuan, Xi Chen
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Broadband Doppler velocity log (DVL) measures velocity relative to sea bottom according to Doppler effects and has been used in the navigation of multiple carriers. It improves the measurement accuracy compared to narrowband technique by phase coded technique and pulse-pulse correlation technique. To study the characteristics of the echo and increase accuracy further, echo model is established, the envelope and auto-correlation of echo are analyzed, and the results show that processing the echo illuminated by the whole beam will obtain higher accuracy in high signal to noise ratio. The data of lake experiment are analyzed, and the results prove the conclusion. At last, digital simulation is done, the simulating results are in agreement with the conclusion and processing methods in different SNR are supposed.
GIS for Air Search and Rescue: A heuristic method for Air Search and Rescue operations
Authors: Emrah Sylemez
Venue:  (2009)

Search and Rescue (SAR) operations aim at finding missing objects with minimum time in a determined area. Limiting search area is the critical decision- making part for SAR operations. There are fundamentally two problems in these operations. The first problem is assessing highly reliable probability distribution maps, and the second is determining the search pattern that sweeps the area from air as fast as possible. This book presents use of geographic information systems (GIS) and multi criteria decision analysis (MCDA) in an integrated way within the framework of Search Theory. GIS helps for managing the geographic data in SAR operation and provide SAR experts probability maps of missing object based on MCDA methods. Moreover, in any SAR operation, it is crucial to determine search pattern. Hence this book also gives guidelines for designing most appropriate search pattern through a developed software within GIS. 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
Visualization Corner: Robust Topology-Based Multiscale Analysis of Scientific Data
Authors: Attila Gyulassy, Luis Gustavo Nonato, Peer-Timo Bremer, Claudio Silva, Valerio Pascucci
Venue: IEEE Design Test (2009)

During multiscale analysis, hierarchical function decompositions and error-driven simplifications can't guarantee precise control of topological features. Topology-based multiscale analysis has emerged as an alternative to help researchers understand complex scientific data.
Broadband circularly polarized CPW-fed slot antenna array for millimeter wave application
Authors: Zhi Juan Su, Gui Fu Ding, Wen Jing Lu, Wei qiang Chen
Venue: Microelectronics Journal (2009)

A broadband and circularly polarized 1x4 linear antenna array composed of CPW-fed slot elements for millimeter wave application is discussed. Through a special short-circuiting stub perturbation method, the circular ring slot element achieves circular polarization and a broad bandwidth. Through a parallel feeding network, the array achieves a broad impedance bandwidth of 19% with VSWR=