ppxscal/embedding_network huggingface dataset:
Playability: How to Identify the Player Experience in a Video Game
Authors: J. L. Sánchez, N. Padilla Zea, F. L. Gutiérrez
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

Nowadays Video Games occupy a privileged position in the leisure and entertainment market, representing the fastest-growing industry globally. In this paper we will analyse how, in video game development, Usability alone is not sufficient to achieve the optimum Player Experience. We argue that the concept of Usability needs broadening and deepening, to embrace further attributes and properties that identify and describe the Player Experience. We present our proposed means of defining Playability, its attributes and properties and how associate them with the different elements of a video game.
The Scope & Agglomeration Economies of China's Provincial Information Industry
Authors: Lei Ping, Zhao Lianrong
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Based on panel data of China's provincial information industry since 2000, this paper discussed the Marshallian externalities, relatives industries convergence externalities and Jacobs externalities, found that at the provincial level, there are strong Marshallian externalities which prove the economical rationality of information industry garden. Our research also reveals there are no relative industry convergence externalities and the Jacobs externalities are negative, that is to say less developed regions are capable of developing information industry more rapidly than developed regions through intentional policies carrying out.
BotGAD: detecting botnets by capturing group activities in network traffic
Authors: Hyunsang Choi, Heejo Lee, Hyogon Kim
Venue: Proceedings of the Fourth International ICST Conference on COMmunication System softWAre and middlewaRE (2009)

Recent malicious attempts are intended to obtain financial benefits using a botnet which has become one of the major Internet security problems. Botnets can cause severe Internet threats such as DDoS attacks, identity theft, spamming, click fraud. In this paper, we define a group activity as an inherent property of the botnet. Based on the group activity model and metric, we develop a botnet detection mechanism, called BotGAD (Botnet Group Activity Detector). BotGAD enables to detect unknown botnets from large scale networks in real-time. Botnets frequently use DNS to rally infected hosts, launch attacks and update their codes. We implemented BotGAD using DNS traffic and showed the effectiveness by experiments on real-life network traces. BotGAD captured 20 unknown and 10 known botnets from two day campus network traces.
Minimal-length linearizations for mildly context-sensitive dependency trees
Authors: Y. Albert Park, Roger Levy
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

The extent to which the organization of natural language grammars reflects a drive to minimize dependency length remains little explored. We present the first algorithm polynomial-time in sentence length for obtaining the minimal-length linearization of a dependency tree subject to constraints of mild context sensitivity. For the minimally context-sensitive case of gap-degree 1 dependency trees, we prove several properties of minimal-length linearizations which allow us to improve the efficiency of our algorithm to the point that it can be used on most naturally-occurring sentences. We use the algorithm to compare optimal, observed, and random sentence dependency length for both surface and deep dependencies in English and German. We find in both languages that analyses of surface and deep dependencies yield highly similar results, and that mild context-sensitivity affords very little reduction in minimal dependency length over fully projective linearizations; but that observed linearizations in German are much closer to random and farther from minimal-length linearizations than in English.
Efficient parsing for transducer grammars
Authors: John DeNero, Mohit Bansal, Adam Pauls, Dan Klein
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

The tree-transducer grammars that arise in current syntactic machine translation systems are large, flat, and highly lexicalized. We address the problem of parsing efficiently with such grammars in three ways. First, we present a pair of grammar transformations that admit an efficient cubic-time CKY-style parsing algorithm despite leaving most of the grammar in n-ary form. Second, we show how the number of intermediate symbols generated by this transformation can be substantially reduced through binarization choices. Finally, we describe a two-pass coarse-to-fine parsing approach that prunes the search space using predictions from a subset of the original grammar. In all, parsing time reduces by 81%. We also describe a coarse-to-fine pruning scheme for forest-based language model reranking that allows a 100-fold increase in beam size while reducing decoding time. The resulting translations improve by 1.3 BLEU.
Study of Coal Mine Cognitive Radio Sensing Algorithm
Authors: Gui-zhen Chen, Xiao-chun Zhang, En-jie Ding
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

The present wireless communication system under coal mines is characterized by single pattern, fixed communication frequency, incapability of adaptive to various tunnel environments. To solve the above problems, cognitive radio (CR) is applied to the system. This paper focuses on the application of energy detection algorithms used in the spectrum sensing of various tunnels under mines. The detection probability of Rayleigh Channel and Rician Channel is analyzed, and the feedback joint detection algorithm based on the tunnel environment is put forward. The simulation shows that the probability of cooperative sensing system obviously rises with the method of self-adaptive through feedback information to adjust the node weight.
The Presentation of a Class of Orthogonal Vector-Valued Finitely Supported Wavelet Packets with an Integer Dilation Factor
Authors: Suluo Song
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Since 1986, Wavelet analysis has become a popular subject in scientific research.It has been a powerful tool for exploring and solvingmany complicated problems in natural science and engineering computation. In this article, the vector-valued wavelet packets are defined and investigated. A procedure for constructing the vector-valued wavelet packets is presented. The properties of vector-valued wavelet packets are discussed by using integral transformation and operator theory. Finally, new orthogonal bases of L^2(R,C^{u\times u}) is constructed from the orthogonal vector-valued wavelet packets.
Cross-Cultural Analysis of Social Network Services in Japan, Korea, and the USA
Authors: Aaron Marcus, Niranjan Krishnamurthi
Venue: Proceedings of the 3rd International Conference on Internationalization, Design and Global Development: Held as Part of HCI International 2009 (2009)

The techniques of cross-cultural analysis of Websites based on culture models are used to examine user-interface components (the metaphors, mental models, navigation, interaction, and appearance) of social networking sites in three countries. The authors note and evaluate patterns of similarity and difference in the Website designs that seem to link social networking sites by culture dimensions.
An Efficient Search Algorithm for REIK Overlay Network
Authors: Jingjing Song, Jiguo Yu, Zhaojun Xiang
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of settings. In this paper we have presented an efficient similarity search for REIK network called SSREIK which is a novel framework that dynamically structure, in order to build distributed routing information. It allows the evaluation of range and nearest neighbor queries in a distributed manner and utilizes a set of distributed statistics and guarantees that all similar objects to the query are retrieved.
Generalized L2-Divergence and Its Application to Shape Alignment
Authors: Fei Wang, Baba Vemuri, Tanveer Syeda-Mahmood
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

This paper proposes a novel and robust approach to the groupwise point-sets registration problem in the presence of large amounts of noise and outliers. Each of the point sets is represented by a mixture of Gaussians and the point-sets registration is treated as a problem of aligning the multiple mixtures. We develop a novel divergence measure which is defined between any arbitrary number of probability distributions based on L2 distance, and we call this new divergence measure "Generalized L2-divergence". We derive a closed-form expression for the Generalized-L2 divergence between multiple Gaussian mixtures, which in turn leads to a computationally efficient registration algorithm. This new algorithm has an intuitive interpretation, is simple to implement and exhibits inherent statistical robustness. Experimental results indicate that our algorithm achieves very good performance in terms of both robustness and accuracy.
Ambulation Analysis in Wearable ECG, 1st edition
Authors: Subhasis Chaudhuri, Tanmay D. Pawar, Siddhartha Duttagupta
Venue:  (2009)

Ambulation Analysis in Wearable ECG Subhasis Chaudhuri, Tanmay Pawar, Siddhartha Duttagupta Ambulation Analysis in Wearable ECG demonstrates why, due to recent developments, the wearable ECG recorder substantiates a significant innovation in the healthcare field. About this book: Examines the viability of wearable ECG in cardiac monitoring. Includes chapters written by practitioners who have personally developed such hardware to write about the hardware details. Bridges the gap between hardware and algorithmic developments with chapters that specifically discuss the hardware aspects and their corresponding calibration issues. Presents a useful text for both practitioners and researchers in biomedical engineering and related interdisciplinary fields. Assumes basic familiarity with digital signal processing and linear algebra.
Security and Privacy in Mobile Ad Hoc Networks: Key management and anonymous secure routing in large ad hoc networks
Authors: Bo Zhu
Venue:  (2009)

Compared to wired networks, mobile ad hoc networks are much more vulnerable to security attacks. This is mainly due to its features of open medium, dynamic topology, cooperative algorithms, lack of centralized monitoring and management point. In this book, the author first reviews security and privacy issues in mobile ad hoc networks, and then proposes the study of algorithms and protocols for key management and (anonymous) secure routing in large ad hoc networks. More specifically, in terms of key management, the author investigates scalable key management protocols for large ad hoc networks by exploiting hierarchical network structures and cryptographical techniques. As to anonymous secure routing, the author first formally defines a set of requirements on privacy and security of an anonymous secure routing protocol, and then presents a few protocols that are designed to satisfy those requirements. 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
On Approximation Algorithms for Interference-Aware Broadcast Scheduling in 2D and 3D Wireless Sensor Networks
Authors: Ravi Tiwari, Thang N. Dinh, My T. Thai
Venue: Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications (2009)

Broadcast scheduling is a mechanism for performing interference-aware broadcasting in multi-hop wireless sensor networks (WSNs). Existing studies assume all the WSN nodes lie on a 2D plane. This assumption is not always appropriate, as in practice the sensor nodes may acquire positions in the 3D space. In this paper, we study the broadcast scheduling problem in which we consider two different models of the transmission graph: Disk Graph (DG) in 2D and Ball Graph (BG) in 3D. We consider each node may have different transmission ranges and the interference range is ¿ time of the transmission range (where ¿> 1). We devise efficient coloring methods for coloring a hexagonal tiling in 2D and truncated octahedragonal tiling in 3D, which leads to O(1)-approximation ratio for broadcast scheduling problem in 2D and 3D, respectively.
Modelling Biological Clocks with Bio-PEPA: Stochasticity and Robustness for the Neurospora crassa Circadian Network
Authors: Ozgur E. Akman, Federica Ciocchetta, Andrea Degasperi, Maria Luisa Guerriero
Venue: Proceedings of the 7th International Conference on Computational Methods in Systems Biology (2009)

Circadian clocks are biochemical networks, present in nearly all living organisms, whose function is to regulate the expression of specific mRNAs and proteins to synchronise rhythms of metabolism, physiology and behaviour to the 24 hour day/night cycle. Because of their experimental tractability and biological significance, circadian clocks have been the subject of a number of computational modelling studies.In this study we focus on the simple circadian clock of the fungus Neurospora crassa. We use the Bio-PEPA process algebra to develop both a stochastic and a deterministic model of the system. The light on/off mechanism responsible for entrainment to the day/night cycle is expressed using discrete time-dependent events in Bio-PEPA.In order to validate our model, we compare it against the results of previous work which demonstrated that the deterministic model is in agreement with experimental data. Here we investigate the effect of stochasticity on the robustness of the clock's function in biological timing. In particular, we focus on the variations in the phase and amplitude of oscillations in circadian proteins with respect to different factors such as the presence/absence of a positive feedback loop, and the presence/absence of light. The time-dependent sensitivity of the model with respect to some key kinetic parameters is also investigated.
The Research of Geological Hazards Warning and Forecast System Based on Rainfall Model
Authors: Lianping Xie, Luojia Zhong, Shangde Xiao, Yanlong Zhou
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

This paper is according to the illustration of intensity of rainfall--duration of rainfall and the critical precipitation theory which refers to the relationship between rainfall and the happening of landslides, taking the main types, scale, time and spatial distribution and the actual extent of damage of geologic hazards in Hubei province into consideration, establishing a critical precipitation and early warning and forecast criterion model of regional geologic hazards based on the research on the relationship between rainfall and the spatial distribution, coming up with a solution of early warning and forecast system of geologic hazards, which is on the base of Internet web or communication, WebGIS (MapGIS IMS), and the architecture of SQL Server and its relative Operating Systems.
Low Pressure Plasmas and Microstructuring Technology, 1st edition
Authors: Gerhard Franz
Venue:  (2009)

This monograph presents an up to date perspective of gas discharge physics and its applications to various industries. It starts from a comprehensive overview of the different types to generate plasmas by DC discharges, capacitive and inductive radiofrequency coupling, helicon waves including electron cyclotron resonance, and ion beams. To compare these theories with inert plasmas, a fundamental description of plasma diagnostics is presented on the basis of four prominent methods and extended to reactive plasmas.The second part extensively deals with the interaction of these plasmas with surfaces in order to coat or to etch them with reactive gases. Main topics are sputtering, plasma-enhanced chemical vapor deposition, and reactive ion etching. The difficulties which had to be overcome to reach the next technological node in the semiconductor map are documented by a long row of microfeatures. These processes and corresponding microscopic mechanisms are discussed in the final section of this part. In the concluding third part, various fundamental derivations are minutely extended which are required for a deep understanding of the plasma processes. In retrospect, the semiconductor industry has triggered the development of new methods to excite plasmas. But it was now the industrial part to operate these plasmas with reactive gases. As a result of this combined effort, surface modifications with plasmas are now in widespread use even in low-cost applications due to its easy and convenient implantation as well as its favorable environmental impact. 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
Multi-task Feature Selection Using the Multiple Inclusion Criterion (MIC)
Authors: Paramveer S. Dhillon, Brian Tomasik, Dean Foster, Lyle Ungar
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I (2009)

We address the problem of joint feature selection in multiple related classification or regression tasks. When doing feature selection with multiple tasks, usually one can "borrow strength" across these tasks to get a more sensitive criterion for deciding which features to select. We propose a novel method, the Multiple Inclusion Criterion (MIC), which modifies stepwise feature selection to more easily select features that are helpful across multiple tasks. Our approach allows each feature to be added to none, some, or all of the tasks. MIC is most beneficial for selecting a small set of predictive features from a large pool of potential features, as is common in genomic and biological datasets. Experimental results on such datasets show that MIC usually outperforms other competing multi-task learning methods not only in terms of accuracy but also by building simpler and more interpretable models.
Survey on Oblivious Routing Strategies
Authors: Harald Räcke
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

We give a survey about recent advances in the design of oblivious routing algorithms. These routing algorithms choose their routing paths independent of the traffic in the network and they are therefore very well suited for distributed environments in which no central entitiy exist that could make routing decisions based on the whole traffic pattern in the network.
Arabic morphology using only finite-state operations
Authors: Kenneth R. Beesley
Venue: Proceedings of the Workshop on Computational Approaches to Semitic Languages (1998)

Finite-state morphology has been successful in the description and computational implementation of a wide variety of natural languages. However, the particular challenges of Arabic, and the limitations of some implementations of finite-state morphology, have led many researchers to believe that finite-state power was not sufficient to handle Arabic and other Semitic morphology. This paper illustrates how the morphotactics and the variation rules of Arabic have been described using only finite-state operations and how this approach has been implemented in a significant morphological analyzer/generator.
Dynamics of Inter-Meeting Time in Human Contact Networks
Authors: Eiko Yoneki, Dan Greenfield, Jon Crowcroft
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

We envision new communication paradigms, using physical dynamic interconnectedness among people. Delay Tolerant Networks (DTNs) are a new communication paradigm to support such network environments, and our focus is a type of DTN that provides intermittent communication for humans carrying mobile devices: the Pocket Switched Network (PSN). Information propagation in PSNs is highly influenced by human connectivity networks, i.e. social networks. In our previous work, we have exploited constructing weighted networks using characteristics of pair connections such as the duration of contact time and frequency of contacts from time series of human connectivity network traces. The approach we took is based on empirical and heuristic and the focus is finding a single aggregated logical network structure. The physical network topology in the real world is time dependent and it is a complex task to describe its dynamics. This paper aims to identify dynamics of meeting groups in human connectivity traces, where meeting groups are expected to be a group interacting among the nodes in physical space. Thus, we define ‘meeting group’ differently from ‘community’. We exploit statistical approach that provides quantitative attributes to uncover meeting groups. We identify the power law behavior of meetings that is important for supporting to understanding dynamics of information flow between meeting groups and building group oriented communication protocol.
DTask and LiteBody: Open Source, Standards-Based Tools for Building Web-Deployed Embodied Conversational Agents
Authors: Timothy Bickmore, Daniel Schulman, George Shaw
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

Two tools for developing embodied conversational agents and deploying them over the world-wide web to standard web browsers are presented. DTask is a hierarchical task decomposition-based dialogue planner, based on the CEA-2018 task description language standard. LiteBody is an extensible, web-based BML renderer that runs in most contemporary web browsers with no additional software and provides a conversational virtual agent with a range of conversational nonverbal behavior adequate for many user-agent interaction applications. Together, these tools provide a complete platform for deploying web-based conversational agents, and are actively being used on two health counseling applications.
Introducing switching ordered statistic CFAR Type I in different radar environments
Authors: Saeed Erfanian, Vahid Tabataba Vakili
Venue: EURASIP Journal on Advances in Signal Processing (2009)

In this paper, a new CFAR detector based on a switching algorithm and OS-CFAR for nonhomogeneous background environments is introduced. The new detector is named Switching Ordered Statistic CFAR type I (SOS CFAR I). The SOS CFAR I selects a set of suitable cells and then with the help of the ordering method, estimates the unknown background noise level. The proposed detector does not require any prior information about the background environment and uses cells with similar statistical specifications to estimate the background noise. The performance of SOS CFAR I is evaluated and compared with other detectors such as CA-CFAR, GO-CFAR, SO-CFAR, and OS-CFAR for the Swerling I target model in homogeneous and nonhomogeneous noise environments such as those with multiple interference and clutter edges. The results show that SOS CFAR I detectors considerably reduce the problem of excessive false alarm probability near clutter edges while maintaining good performance in other environments. Also, simulation results confirm the achievement of an optimum detection threshold in homogenous and nonhomogeneous radar environments by the mentioned processor.