ppxscal/embedding_network huggingface dataset:
Chinese Sentence Similarity Based on Multi-feature Combination
Authors: Yi Liu, Qiang Liu
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

The Chinese sentence similarity computation has been used widely in the field of Chinese information processing. Many methods have been proposed to measure the similarity of Chinese sentences, but they focus mainly on one or two features, e.g. words, structure or semantic information and so on. The accuracy of these methods is usually lower. In this paper, we present a new approach to compute the similarity of Chinese sentences based on multi-feature combination. This method defines the key features in similarity computation and then combines their contribution to obtain the sentence similarity. Experiments show that this method has higher accuracy in Chinese sentence similarity computation.
Evolutionary design of Evolutionary Algorithms
Authors: Laura Dioşan, Mihai Oltean
Venue: Genetic Programming and Evolvable Machines (2009)

Manual design of Evolutionary Algorithms (EAs) capable of performing very well on a wide range of problems is a difficult task. This is why we have to find other manners to construct algorithms that perform very well on some problems. One possibility (which is explored in this paper) is to let the evolution discover the optimal structure and parameters of the EA used for solving a specific problem. To this end a new model for automatic generation of EAs by evolutionary means is proposed here. The model is based on a simple Genetic Algorithm (GA). Every GA chromosome encodes an EA, which is used for solving a particular problem. Several Evolutionary Algorithms for function optimization are generated by using the considered model. Numerical experiments show that the EAs perform similarly and sometimes even better than standard approaches for several well-known benchmarking problems.
Effects of scale change on distance perception in virtual environments
Authors: Tien Dat Nguyen, Christine J. Ziemer, Jodie M. Plumert, James F. Cremer, Joseph K. Kearney
Venue: Proceedings of the 6th Symposium on Applied Perception in Graphics and Visualization (2009)

We conducted two experiments to investigate effects of scale changes on distance perception in virtual environments. In both experiments, participants first made distance estimates with feedback in a virtual tunnel (adaptation) and then made distance estimates without feedback in a differently sized environment (test). We examined two types of scale changes. In the "Tunnel Scaled" conditions, only the size of the tunnel changed from adaptation to test. In the "All Scaled" conditions, both the tunnel and target sizes changed from adaptation to test, along with the distance between the targets. Both experiments were carried out in an HMD. In the first experiment, participants made distance estimates by moving to targets via a joystick. In the "All Scaled" condition, participants overshot relative to adaptation when going from a large to a small environment, and they undershot relative to adaptation when going from a small to a large environment. We found almost no effects of scale change in either direction when only the tunnel was scaled at test. Experiment 2 was the same except that subjects made distance estimates via blindfolded walking. The pattern of results was the same, though the size of the overshoot/undershoot was attenuated. The discussion focuses on explanations for the effects of scale changes on distance estimates.
Lock-Free Synchronization of Data Flow between Time-Triggered and Event-Triggered Activities in a Dependable Real-Time System
Authors: Josef Templ, Johannes Pletzer, Wolfgang Pree
Venue: Proceedings of the 2009 Second International Conference on Dependability (2009)

Time-triggered execution of periodic tasks provides the cornerstone of dependable real-time systems. In addition, there is often a need for executing event-triggered activities while the system would be otherwise idle. If time-triggered and event-triggered activities exchange information among each other, the data flow must be synchronized such that reading unfinished output data is avoided. We present a lock-free solution for these synchronization issues that is based exclusively on memory load and store operations and can be implemented efficiently on embedded systems without any operating system support. We also discuss the implications of our synchronization approach for the semantics of combined time-triggered and event-triggered execution in a dependable real-time system.
Distributed Episode Control System for Interactive Narrative Entertainment
Authors: Jun'Ichi Hoshino, Katsutoki Hamana, Shiratori Kazuto, Atsushi Nakano
Venue: Proceedings of the 8th International Conference on Entertainment Computing (2009)

We propose the massive action control system (MACS) for interactive narrative entertainment. MACS determines the action priorities for characters based in part on their own internal states, such as the motivation behind the action, feeling, and personality. MACS selects a behavior control module, called an episode tree, of about 1000 events, which is divided into action types based on these internal states and external situations. We demonstrate the effectiveness of the system with the Spilant World interactive animation contents at the National Museum of Emerging Science and Innovation in Japan, and NAMCO amusement park.
A Battery-Free Tag for Wireless Monitoring of Heart Sounds
Authors: Soumyajit Mandal, Lorenzo Turicchia, Rahul Sarpeshkar
Venue: Proceedings of the 2009 Sixth International Workshop on Wearable and Implantable Body Sensor Networks (2009)

We have developed a wearable, battery-free tag that monitors heart sounds. The tag powers up by harvesting ambient RF energy, and contains a low-power integrated circuit, an antenna and up to four microphones. The chip, which consumes only 1.0uW of power, generates digital events when the outputs of any of the microphones exceeds a programmable threshold voltage, combines such events together by using a programmable logic array, and transmits them to a base station by using backscatter modulation. The chip can also be programmed to trade-off microphone sensitivity for power consumption. In this paper, we demonstrate that the tag, when attached to the chest, can reliably measure heart rate at distances up to 7m from an FCC-compliant RF power source. We also suggest how delays between signals measured by microphones at the wrist and neck can be used to provide information about relative blood-pressure variations.
The Complexity of Satisfiability for Fragments of Hybrid Logic--Part I
Authors: Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments.In this paper, we investigate the effect of restricting the propositional part of the language on decidability and on the complexity of the satisfiability problem over arbitrary, transitive, total frames, and frames based on equivalence relations. We also consider different sets of modal and hybrid operators. We trace the border of decidability and give the precise complexity of most fragments, in particular for all fragments including negation. For the monotone fragments, we are able to distinguish the easy from the hard cases, depending on the allowed set of operators.
A fast general slew constrained minimum cost buffering algorithm
Authors: Shiyan Hu, Jiang Hu
Venue: Microelectronics Journal (2009)

As VLSI technology moves to the nanoscale regime, ultra-fast slew buffering techniques considering buffer cost minimization are highly desirable. The existing technique proposed in [S. Hu, C. Alpert, J. Hu, S. Karandikar, Z. Li, W. Shi, C.-N. Sze, Fast algorithms for slew constrained minimum cost buffering, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 26 (11) (2007) 2009-2022] is able to efficiently perform buffer insertion with a simplified assumption on buffer input slew. However, when handling more general cases without input slew assumptions, it becomes slow despite the significant buffer savings. In this paper, a fast buffering technique is proposed to handle the general slew buffering problem. Instead of building solutions from scratch, the new technique efficiently optimizes buffering solutions obtained with the fixed input slew assumption. Experiments on industrial nets demonstrate that our algorithm is highly efficient. Compared to the commonly used van Ginneken style buffering, up to 49x speed up is obtained and often 10% buffer area is saved. Compared to the algorithm without input slew assumption proposed in [S. Hu, C. Alpert, J. Hu, S. Karandikar, Z. Li, W. Shi, C.-N. Sze, Fast algorithms for slew constrained minimum cost buffering, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 26 (11) (2007) 2009-2022], up to 37x speedup can be obtained with slight sacrifice in solution quality.
Automatic Classification System for the Diagnosis of Alzheimer Disease Using Component-Based SVM Aggregations
Authors: I. Álvarez, M. López, J. M. Górriz, J. Ramírez, D. Salas-Gonzalez, C. G. Puntonet, F. Segovia
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

The early detection of subjects with probable Alzheimer Type Dementia (ATD) is crucial for effective appliance of treatment strategies. Functional brain imaging including SPECT (Single-Photon Emission Computed Tomography) and PET (Positron Emission Tomography) are commonly used to guide the clinician's diagnosis. Nowadays, no automatic tool has been developed to aid the experts to diagnose the ATD. Instead, conventional evaluation of these scans often relies on subjective, time consuming and prone to error steps. This paper shows a fully automatic computer-aided diagnosis (CAD) system for improving the accuracy in the early diagnosis of the ATD. The proposed approach is based on the majority voting cast by an ensemble of Support Vector Machine (SVM) classifiers, trained on a component-based feature extraction technique which searches the most discriminant regions over the brain volume.
The PhotoSlap game: play to annotate
Authors: Tsung-Hsiang Chang, Chien-Ju Ho, Jane Yung-Jen Hsu
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

This paper presents PhotoSlap, an intelligent system for semantic annotation of photos. The system contains a semi-automatic face detector, a bulk annotation tool, and a multi-player online game, PhotoSlap. By exploring the design principles of gameplay and applying game theoretic analysis, PhotoSlap is designed as a fun and productive game, which adapts itself to different players to produce the desired output. Experiments involving four focus groups showed the game to be fun and effective in annotating people metadata for personal photo collections.
A Term-Based Global Trie for Tabled Logic Programs
Authors: Jorge Costa, João Raimundo, Ricardo Rocha
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

A critical component in the implementation of an efficient tabling system is the design of the data structures and algorithms to access and manipulate tabled data. Arguably, the most successful data structure for tabling is tries. However, when used in applications that pose many queries and/or have a large number of answers, tabling can build arbitrarily many and/or very large tables, quickly filling up memory. In this paper, we propose a new design for the table space organization where all terms in tabled subgoal calls and tabled answers are represented only once in a common global trie instead of being spread over several different trie data structures. Our initial experiments using the YapTab tabling system show significant reductions on memory usage without compromising running time.
Improving Reinforcement Learning by Using Case Based Heuristics
Authors: Reinaldo A. Bianchi, Raquel Ros, Ramon Lopez De Mantaras
Venue: Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2009)

This work presents a new approach that allows the use of cases in a case base as heuristics to speed up Reinforcement Learning algorithms, combining Case Based Reasoning (CBR) and Reinforcement Learning (RL) techniques. This approach, called Case Based Heuristically Accelerated Reinforcement Learning (CB-HARL), builds upon an emerging technique, the Heuristic Accelerated Reinforcement Learning (HARL), in which RL methods are accelerated by making use of heuristic information. CB-HARL is a subset of RL that makes use of a heuristic function derived from a case base, in a Case Based Reasoning manner. An algorithm that incorporates CBR techniques into the Heuristically Accelerated Q---Learning is also proposed. Empirical evaluations were conducted in a simulator for the RoboCup Four-Legged Soccer Competition, and results obtained shows that using CB-HARL, the agents learn faster than using either RL or HARL methods.
Short communication: Marxan with Zones: Software for optimal conservation based land- and sea-use zoning
Authors: Matthew E. Watts, Ian R. Ball, Romola S. Stewart, Carissa J. Klein, Kerrie Wilson, Charles Steinback, Reinaldo Lourival, Lindsay Kircher, Hugh P. Possingham
Venue: Environmental Modelling Software (2009)

Marxan is the most widely used conservation planning software in the world and is designed for solving complex conservation planning problems in landscapes and seascapes. In this paper we describe a substantial extension of Marxan called Marxan with Zones, a decision support tool that provides land-use zoning options in geographical regions for biodiversity conservation. We describe new functions designed to enhance the original Marxan software and expand on its utility as a decision support tool. The major new element in the decision problem is allowing any parcel of land or sea to be allocated to a specific zone, not just reserved or unreserved. Each zone then has the option of its own actions, objectives and constraints, with the flexibility to define the contribution of each zone to achieve targets for pre-specified features (e.g. species or habitats). The objective is to minimize the total cost of implementing the zoning plan while ensuring a variety of conservation and land-use objectives are achieved. We outline the capabilities, limitations and additional data requirements of this new software and perform a comparison with the original version of Marxan. We feature a number of case studies to demonstrate the functionality of the software and highlight its flexibility to address a range of complex spatial planning problems. These studies demonstrate the design of multiple-use marine parks in both Western Australia and California, and the zoning of forest use in East Kalimantan.
InfoScape: A Browser for User Behavior-Based Information Retrieval System
Authors: Masaaki Kawata, Katsuhiko Ogawa
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

We propose a system called InfoScape for exploring large histories of user behavior including location data (latitude and longitude). User behavior patterns are created from the histories of user behavior from data sources such as life logs. The browser of this system can find user behavior patterns by a query for a user behavior pattern. Currently, the histories of user behavior consist of 9,324 records. As a result, this study investigates the most effective conditions for the operation of this system working and demonstrates with factors are location and time for creating user behavior-based feature patterns.
Towards a Flexible User Simulation for Evaluating Spoken Dialogue Systems
Authors: Dmitry Butenkov
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

The main aim of research is to introduce a new data-driven user simulation approach for the quality and usability evaluation for spoken dialogue systems.
Instance-level semisupervised multiple instance learning
Authors: Yangqing Jia, Changshui Zhang
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

Multiple instance learning (MIL) is a branch of machine learning that attempts to learn information from bags of instances. Many real-world applications such as localized content-based image retrieval and text categorization can be viewed as MIL problems. In this paper, we propose a new graph-based semi-supervised learning approach for multiple instance learning. By defining an instance-level graph on the data, we first propose a new approach to construct an optimization framework for multiple instance semi-supervised learning, and derive an efficient way to overcome the non-convexity of MIL. We empirically show that our method outperforms state-of-the-art MIL algorithms on several real-world data sets.
An Efficient Algorithm for Cyclic Edge Connectivity of Planar Graphs
Authors: Yunting Lu, Xin Lu
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

A cyclic edge cutset is an edge cutset whose deletion disconnects the graph such that two of the components contain a cycle respectively. The cyclic edge connectivity c (G) is the minimum cardinality of all the cyclic edge cutsets of G. There is no polynomial time algorithm to determine the cyclic edge connectivity of a graph. In this paper,we develop a polynomial time algorithm to determine the cyclic edge connectivity of a planar graph. The time complexity of the algorithm is bounded by O(|V|2).
Arabic named entity recognition using optimized feature sets
Authors: Yassine Benajiba, Mona Diab, Paolo Rosso
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

The Named Entity Recognition (NER) task has been garnering significant attention in NLP as it helps improve the performance of many natural language processing applications. In this paper, we investigate the impact of using different sets of features in two discriminative machine learning frameworks, namely, Support Vector Machines and Conditional Random Fields using Arabic data. We explore lexical, contextual and morphological features on eight standardized data-sets of different genres. We measure the impact of the different features in isolation, rank them according to their impact for each named entity class and incrementally combine them in order to infer the optimal machine learning approach and feature set. Our system yields a performance of F&beta;=1-measure=83.5 on ACE 2003 Broadcast News data.
Construct the Load-Balanced Topology in NEMO
Authors: Long-Sheng Li, Gwo-Chuan Lee, Li-Keng Kang, Jhu-Shyuan Mei
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

The Mobile Network (MONET) is a single network unit and can move around arbitrarily. The NEMO protocol is a way of managing the mobility of an entire MONET which changes its access point to the Internet. In NEMO, the Mobile Router (MR) acts as a central point of Internet attachment for all the mobile nodes, and it is likely to be a potential bottleneck because of its limited wireless link capacity. However, in original NEMO protocol, the MR cannot select a less loaded access router (AR) to connect to the Internet when NEMO handoff occurs. To construct a load balancing NEMO, the mechanism for choosing a suitable AR should be further studied. In this paper we propose two clustering algorithms to construct one NEMO. Further, two load balancing schemes are proposed to resolve the load-balanced handoff problem in NEMO. The simulation results show that the proposed constructing algorithms and load balancing schemes could significantly improve the performance of NEMO in terms of delivery ratio, load balancing index and host-to-host delay.
Superresolution and Denoising of 3D Fluid Flow Estimates
Authors: Andrey Vlasenko, Christoph Schnörr
Venue: Proceedings of the 31st DAGM Symposium on Pattern Recognition (2009)

Three-dimensional high-speed image measurements of fluid flows become state-of-the-art velocimetry techniques in experimental fluid mechanics and related areas of industry. In this paper, we consider data produced by an established technique, sparse Particle Tracking Velocimetry (PTV), in terms of small set of velocity estimates irregularly distributed over a 3D volume, and study a variational approach to super-resolution in a physically consistent way. The output consists of a high-resolution vector field on the voxel grid where additionally the typical quantization noise of the input data can be removed. Numerical experiments validate our approach with 3D data from turbulent flows.
Magic sets for data integration
Authors: Wolfgang Faber, Gianluigi Greco, Nicola Leone
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

We present a generalization of the Magic Sets technique to Datalog programs with (possibly unstratified) negation under the stable model semantics, originally defined in (Faber, Greco, & Leone 2005; 2007). The technique optimizes Datalog¬ programs by means of a rewriting algorithm that preserves query equivalence, under the proviso that the original program is consistent. The approach is motivated by recently proposed methods for query answering in data integration and inconsistent databases, which use cautious reasoning over consistent Datalog¬ programs under the stable model semantics. In order to prove the correctness of our Magic Sets transformation, we have introduced a novel notion of modularity for Datalog¬ under the stable model semantics, which is more suitable for query answering than previous module definitions, and which is also relevant per se. A module under this definition guarantees independent evaluation of queries if the full program is consistent. Otherwise, it guarantees soundness under cautious and completeness under brave reasoning.
The International Directory of Logicians: Who's Who in Logic
Authors: Dov M. Gabbay, John Woods
Venue:  (2009)

The International Directory of Logicians is a listing of over 260 of the world's most foremost living logicians, representing the most important and influential developments of our day. It provides a compact summary of each entrant's eduction, professional appointments, honours and awards, principal publications, as well as a description of the nature and significance of his or her contributions to logic, and a "vision statement" concerning logic's future prospects. Logic here is understood in its broad sense, encompassing all branches of mathematical logic, philosophical logic and the history of logic. Inclusion in the Directory is by invitation only, following a rigorous selection process guided by a distinguished Advisory Board. The Directory is designed to meet the needs of students and professional logicians alike. It is the most informative single-volume record of logic's present state and will serve as an invaluable historical reference for future generations of scholarship.