ppxscal/embedding_network huggingface dataset:
Server selection methods in personal metasearch: a comparative empirical study
Authors: Paul Thomas, David Hawking
Venue: Information Retrieval (2009)

Server selection is an important subproblem in distributed information retrieval (DIR) but has commonly been studied with collections of more or less uniform size and with more or less homogeneous content. In contrast, realistic DIR applications may feature much more varied collections. In particular, personal metasearch--a novel application of DIR which includes all of a user's online resources--may involve collections which vary in size by several orders of magnitude, and which have highly varied data. We describe a number of algorithms for server selection, and consider their effectiveness when collections vary widely in size and are represented by imperfect samples. We compare the algorithms on a personal metasearch testbed comprising calendar, email, mailing list and web collections, where collection sizes differ by three orders of magnitude. We then explore the effect of collection size variations using four partitionings of the TREC ad hoc data used in many other DIR experiments. Kullback-Leibler divergence, previously considered poorly effective, performs better than expected in this application; other techniques thought to be effective perform poorly and are not appropriate for this problem. A strong correlation with size-based rankings for many techniques may be responsible.
Concept Formation in Linguistic Ontologies
Authors: Natalia Loukachevitch
Venue: Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies (2009)

Problems of conceptualization in linguistic ontologies are discussed We show that it is necessary to form concepts of a linguistic ontology as close as possible to the meanings of linguistic units, because excessive generalization and clustering of meanings necessarily lead to distortions in the system of relations, excessive problems in a specific subject field, or an application. At the same time it is important to ensure that concepts can be distinguished from superconcepts and sibling concepts. The usage of really existing multiword expressions helps us mitigate these contradictory requirements. The introduction of concepts on the basis of multiword expressions does not change the essence of a linguistic ontology, but also makes the distinction between the concepts much clearer.
Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: Overview and progress report
Authors: M. Lozano, C. García-Martínez
Venue: Computers and Operations Research (2010)

Nowadays, a promising way to obtain hybrid metaheuristics concerns the combination of several search algorithms with strong specialization in intensification and/or diversification. The flexible architecture of evolutionary algorithms allows specialized models to be obtained with the aim of providing intensification and/or diversification. The outstanding role that is played by evolutionary algorithms at present justifies the choice of their specialist approaches as suitable ingredients to build hybrid metaheuristics. This paper focuses on hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification. We first give an overview of the existing research on this topic, describing several instances grouped into three categories that were identified after reviewing specialized literature. Then, with the aim of complementing the overview and providing additional results and insights on this line of research, we present an instance that consists of an iterated local search algorithm with an evolutionary perturbation technique. The benefits of the proposal in comparison to other iterated local search algorithms proposed in the literature to deal with binary optimization problems are experimentally shown. The good performance of the reviewed approaches and the suitable results shown by our instance allow an important conclusion to be achieved: the use of evolutionary algorithms specializing in intensification and diversification for building hybrid metaheuristics becomes a prospective line of research for obtaining effective search algorithms.
Hierarchical dirichlet trees for information retrieval
Authors: Gholamreza Haffari, Yee Whye Teh
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

We propose a principled probabilisitc framework which uses trees over the vocabulary to capture similarities among terms in an information retrieval setting. This allows the retrieval of documents based not just on occurrences of specific query terms, but also on similarities between terms (an effect similar to query expansion). Additionally our principled generative model exhibits an effect similar to inverse document frequency. We give encouraging experimental evidence of the superiority of the hierarchical Dirichlet tree compared to standard baselines.
Gabor Neural Network Based Facial Expression Recognition for Assistive Speech Expression
Authors: Lau Bee Theng
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

This research focuses on utilizing the biometrics recognition to trigger the speech expresser. Our selected biometric is facial expression. Though CPC have no verbal language ability, they have facial expression ability that can be interpreted to relate to their voice speech needs. However facial expression of a CPC may not be exactly identical at all times. Furthermore CPC are unique and require special speech profiles. After a thorough research in face recognition and artificial intelligence domain, neural network coupled with Gabor feature extraction is found to outperform others. A Neural Network with Gabor filters is built to train the facial expression classifiers. This research has proven successful to help CPC to express their voice speech through software with 98% successful facial recognition rate.
Three-Dimensional Motion Simulation of Robot Driver
Authors: Zhigang Niu, Lili Wang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

In order to observe the robot driver’s workspace configuration and optimize its designing sizes, a three-dimensional motion simulation is studied in this paper. A three-dimensional realistic model of the robot driver is built by the model tool of AutoCAD for simulating the moving process of robot driver vividly. Through data format conversion, the model is imported into OpenGL which has excellent scene and real-time ability. After being rendered and colored in OpenGL, the model is put into the development platform of VC++. Finally, the visual three-dimensional movement based on the model of the robot driver is successfully realized.
Empirical Research and Design of M-Learning System for College English
Authors: Wei Wang, Shaochun Zhong, Zhuo Zhang, Senlin Lv, Lina Wang
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

M-learning is an important research area in educational technology nowadays, but the design of m-learning system needs more empirical research in China. This study uses experience research, survey research and interview means to find out suitable m-learning models for Chinese college students. Based on the empirical research, this paper brings up an m-learning system model of colleague English, which can provide with personalized services and can integrate with e-learning seamlessly. This study will benefit those who would like to develop and design m-learning systems or materials.
Sensation Seeking, Self Forgetfulness, and Computer Game Enjoyment
Authors: Xiaowen Fang, Fan Zhao
Venue: Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009 (2009)

This paper investigates the relationship between enjoyment of computer game play and two personality traits (sensation seeking and self-forgetfulness). Hypotheses were proposed based on a review of computer game enjoyment, game characteristics, personality theories, and effects of computer game play. A survey is conducted in two US universities. Results and implica-tions are discussed.
Usability Evaluation by Monitoring Physiological and Other Data Simultaneously with a Time-Resolution of Only a Few Seconds
Authors: Károly Hercegfi, Márton Pászti, Sarolta Tóvölgyi, Lajos Izsó
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

This paper outlines the INTERFACE methodology developed by researchers of our department. It is based on the simultaneous assessment of Heart Period Variability (HPV), Skin Conductance (SC), and other data. The objective and significance of this paper are (1) showing its capability of identifying quality attributes of software elements with a time-resolution of only a few seconds and (2) presenting its practical applicability in the evaluation phase of a real software development process. The Department of Ergonomics and Psychology at the Budapest University of Technology and Economics carried out a contract-based applied research project for the Generali-Providencia Insurance Co. Ltd. The Company was in the process of further developing the software used in its customer centers, and our Department contracted to assess the user interface. Both analytical and empirical usability evaluation methods were applied. In this paper, we highlight the new experiences of the INTERFACE testing methodology.
A Case Analysis of Creative Spiral Instruction Model and Students' Creative Problem Solving Performance in a LEGO® Robotics Course
Authors: Chun-Hung Lin, Eric Zhi-Feng Liu, Chan-Hsin Kou, Marjo Virnes, Erkki Sutinen, Shan-Shan Cheng
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

The creative spiral instruction model was applied into a LEGO® robotics course in this study. In order to understand the effect of the LEGO robotics course on students' creativities and problem solving performance, students' problem solving process and performance in the course were analyzed. Six undergraduate students participated in this study. The participants were divided into two groups, Group A and Group B, having three members per group. Results showed that during the problem solving process, students in both groups exhibited creativity and acquired knowledge about program design and assembly of LEGO robots. During the problem solving process, three strategies were mainly used by students to solve the problems: 1. Slight adjustment. 2. New elements adding. 3. Problems redefining. After analyzing the creative problem solving process, the result showed richness of data collection being beneficial for understanding the problem solving modes.
Reseach and Design of the Intranet Authentication Management Framework Based on Intrusion Tolerance
Authors: Guo-xiang Yao, Lin-feng Wei, Quan-long Guan, Sai-zhi Ye
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

The security of the Intranet has been given more emphasized in recent years. This paper analyzes the defects of the Intranet admission control protocol and the intrusion tolerant technology, which is used for Certification Authentication (CA) and the Authentication Server (AS). An Intranet Security Authentication Management Framework based on Intrusion Tolerance (IT-IAMF) is proposed, and the principle of the major modules in the framework is analyzed. Finally, the prevention strategies and the security attributes of attack in this framework are illustrated.
Virtual Task Simulation for Inclusive Design
Authors: Russell Marshall, Keith Case, Steve Summerskill, Ruth Sims, Diane Gyi, Peter Davis
Venue: Proceedings of the 2nd International Conference on Digital Human Modeling: Held as Part of HCI International 2009 (2009)

Human modelling tools provide a means to perform virtual task evaluations upon designs within the computer environment. The ability to evaluate the accommodation of a design early on in the design process before physical prototypes can be built has many advantages. These advantages are particularly relevant in supporting people in attempting to design products that are inclusive and accessible. HADRIAN is a new tool developed to provide accessible, and applicable data on people with a broad range of size, age, and ability together with a means of optimising virtual task evaluations. This paper describes the use of HADRIAN in performing a task evaluation, focusing on the underlying methodology that aims to achieve a virtual simulation that mimics a real world user trial.
Scheduling partition for order optimal capacity in large-scale wireless networks
Authors: Yi Xu, Wenye Wang
Venue: Proceedings of the 15th annual international conference on Mobile computing and networking (2009)

The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wireless networks. Existing results have been obtained based on the implicit assumption of negligible overhead in acquiring the network topology and synchronizing the link transmissions. In large networks, however, global topology collection and global link synchronization are infeasible with both the centralized and the distributed link scheduling schemes. This gap between the well-known capacity results and the impractical assumption on link scheduling potentially undermines our understanding of the achievable network capacity. Therefore, the following question remains open: can localized scheduling algorithms achieve the same order of capacity as their global counterpart? In this paper, we propose the scheduling partition methodology by decomposing a large network into many small autonomous scheduling zones, in which localized scheduling algorithms are implemented independently from one another. We prove that any localized scheduling algorithm that satisfies a set of sufficient and necessary conditions can yield the same order of capacity as the widely assumed global scheduling strategy. In comparison to the network dimension √n, scheduling partition sizes Θ(√log n) and Θ(1) are sufficient for optimal capacity scaling in the random and the arbitrary node placement models respectively. We finally propose an example localized link scheduling algorithm to verify the capacity achieved by scheduling partition. Our results thus provide guidelines on the scheduling algorithm design toward maximum capacity scaling in large-scale wireless networks.
Tunnel Fire Pedestrian 3D Virtual Reality Show
Authors: Shu-qing Hao, Hong-wei Huang
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Fire on railway station is a very important disaster is worth of consideration. Fire risk evaluation is an important part for reducing and controlling fire in railway station. Up to now there are several evaluation methods, but few of them combining fire probability with fuzzy evaluation. Based on overall analysis of fire risk in railway station, a mathematical model of comprehensive probability fuzzy evaluation for fire risk is built. When fired, smoke will bring many pollution gases and harmful particles with high temperature. Study the fire risk probability of fuzzy evaluation method to evaluate the fire smoke flow phenomenon will provide help for people’s lives. In the article, the author established the fuzzy evaluation method and use the Smartfire software to simulate the fire on the station, it has provide the critical ventilation velocity that will disturb the fire smoke to flow back and can help people to escape when there is fire also.The result is that when ventilation velocity is 2.5m/s can help people to escape effectively and pollution gases distribution can give management help for people escape.
Integrating Answer Set Programming and Satisfiability Modulo Theories
Authors: Ilkka Niemelä
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

In this talk we consider the problem of integrating answer set programming (ASP) and satisfiability modulo theories (SMT). We discuss a characterization of stable models of logic programs based on Clark's completion and simple difference constraints. The characterization leads to a method of translating a ground logic program to a linear size theory in difference logic, i.e. propositional logic extended with difference constraints between two integer variables, such that stable models of the program correspond to satisfying assignments of the resulting theory in difference logic. Many of the state-of-the-art SMT solvers support directly difference logic. This opens up interesting possibilities. On one hand, any solver supporting difference logic can be used immediately without modifications as an ASP solver for computing stable models of a logic program by translating the program to a theory in difference logic. On the other hand, SMT solvers typically support also other extensions of propositional logic such as linear real and integer arithmetic, fixed-size bit vectors, arrays, and uninterpreted functions. This suggests interesting opportunities to extend ASP languages with such constraints and to provide effective solver support for the extensions. Using the translation an extended language including logic program rules and, for example, linear real arithmetic can be translated to an extension of propositional logic supported by current SMT solvers. We discuss the effectiveness of state-of-the-art SMT solvers as ASP solvers and the possibilities of developing extended ASP languages based on SMT solver technology.
Which way to turn?: guide orientation in virtual way finding
Authors: Mark Evers, Mariët Theune, Joyce Karreman
Venue: Proceedings of the Workshop on Embodied Language Processing (2007)

In this paper we describe an experiment aimed at determining the most effective and natural orientation of a virtual guide that gives route directions in a 3D virtual environment. We hypothesized that, due to the presence of mirrored gestures, having the route provider directly face the route seeker would result in a less effective and less natural route description than having the route provider adapt his orientation to that of the route seeker. To compare the effectiveness of the different orientations, after having received a route description the participants in our experiment had to 'virtually' traverse the route using prerecorded route segments. The results showed no difference in effectiveness between the two orientations, but suggested that the orientation where the speaker directly faces the route seeker is more natural.
A Dichotomy Theorem for Polynomial Evaluation
Authors: Irénée Briquel, Pascal Koiran
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

A dichotomy theorem for counting problems due to Creignou and Hermann states that or any finite set S of logical relations, the counting problem #SAT(S) is either in FP, or #P-complete. In the present paper we show a dichotomy theorem for polynomial evaluation. That is, we show that for a given set S, either there exists a VNP-complete family of polynomials associated to S, or the associated families of polynomials are all in VP. We give a concise characterization of the sets S that give rise to "easy" and "hard" polynomials. We also prove that several problems which were known to be # P-complete under Turing reductions only are in fact # P-complete under many-one reductions.
Improving Scalability with the Use of the Overlay Multicast Protocol (OMP)
Authors: Hind O. Al-Misbahi, Arwa Y. Al-Aama
Venue: International Journal of Internet Protocol Technology (2009)

Demands to increase network usage efficiency and scalability do exist. IP and overlay multicast provide multicasting services by enabling data to be sent to several recipients simultaneously over a network. Although MPLS, a high performance method for forwarding packets, has many benefits, implementation of multicast on MPLS still suffers from IP multicast limitations. This paper proposes the Overlay Multicast Protocol (OMP) in which the overlay approach is applied on MPLS networks to improve the scalability of multicasting. Comparisons of OMP with Protocol Independent Multicast-Sparse Mode and Protocol Independent Multicast-Source Specific Multicast are presented, showing improved scalability when using OMP.
Exploiting Contact Spatial Dependency for Opportunistic Message Forwarding
Authors: Chao Chen, Zesheng Chen
Venue: IEEE Transactions on Mobile Computing (2009)

The movement of real users often follows patterns that can be characterized by certain statistical metrics of the contacts. Such metrics are useful for routing decisions, especially in sparse mobile ad hoc networks where node connectivity is opportunistic and messages are delivered using store-carry-forward routing. Past analysis on real-world data traces indicates that human behaviors affect the node contact pattern and spatial dependency exists among mobile nodes. A new metric called the expected dependent delay that characterizes the expected delay of a contact dependent on the previous hop is proposed. It characterizes the spatial dependency between neighboring contact pairs and reflects the regularity in node movement. In sparse opportunistic mobile ad hoc networks, a good approximation of the expected delay of a multihop path can be derived as the sum of the expected delay of the first hop and the expected dependent delays of later hops. We apply the proposed path-delay estimation to end-to-end routing. Simulation results show that compared with routing schemes that consider only the delivery probability or the expected delay, the proposed scheme can reduce the message delay significantly, when the network is sufficiently sparse and the spatial dependency is quantitatively constant over time. Moreover, the proposed method is tractable and can be easily implemented in combination with other routing techniques such as multipath routing and per-contact routing.
Improved Genetic Algorithm for Designing DNA Sequences
Authors: Zhang Hongyan, Liu Xiyu
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

Designing DNA sequences is one of the most practical and important research topics in DNA computing. An improved genetic algorithm for designing of the equal-length single-stranded DNA sequences is proposed, especially for the short DNA sequences needed in the DNA computing experiment. This algorithm can satisfy certain combinatorial and thermodynamic constraints such as GC content constraint, Hamming distance constraint and similarity constraint. It can generate the good short DNA sequences quickly by giving up the bad sequences in every generation. Finally, through analyzing the experiment data, two formulas are given to estimate the number of the DNA sequences satisfied GC content constraint and Hamming distance constraint.
Foundations of r-contiguous matching in negative selection for anomaly detection
Authors: Thomas Stibor
Venue: Natural Computing: an international journal (2009)

Negative selection and the associated r-contiguous matching rule is a popular immune-inspired method for anomaly detection problems. In recent years, however, problems such as scalability and high false positive rate have been empirically noticed. In this article, negative selection and the associated r-contiguous matching rule are investigated from a pattern classification perspective. This includes insights in the generalization capability of negative selection and the computational complexity of finding r-contiguous detectors.