ppxscal/embedding_network huggingface dataset:
Input Text Repairing for Multi-lingual Chat System
Authors: Kenichi Yoshida, Fumio Hattori
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)

Even though various communication tools have resulted in a remarkable increase of global communications, language barriers remain high and complicate communication across languages. Although the multi-lingual chat system allows users to chat with each other in different language using machine translation. the quality of translation is not so high when the input sentence reflects spoken language. In this paper we propose a method that repairs the input sentences in spoken language by retrieving similar sentences using keywords.
Automated processing for map generalization using web services
Authors: Moritz Neun, Dirk Burghardt, Robert Weibel
Venue: Geoinformatica (2009)

In map generalization various operators are applied to the features of a map in order to maintain and improve the legibility of the map after the scale has been changed. These operators must be applied in the proper sequence and the quality of the results must be continuously evaluated. Cartographic constraints can be used to define the conditions that have to be met in order to make a map legible and compliant to the user needs. The combinatorial optimization approaches shown in this paper use cartographic constraints to control and restrict the selection and application of a variety of different independent generalization operators into an optimal sequence. Different optimization techniques including hill climbing, simulated annealing and genetic deep search are presented and evaluated experimentally by the example of the generalization of buildings in blocks. All algorithms used in this paper have been implemented in a web services framework. This allows the use of distributed and parallel processing in order to speed up the search for optimized generalization operator sequences.
Domain filtering consistencies
Authors: Romuald Debruyne, Christian Bessiére
Venue: Journal of Artificial Intelligence Research (2001)

Enforcing local consistencies is one of the main features of constraint reasoning. Which level of local consistency should be used when searching for solutions in a constraint network is a basic question. Arc consistency and partial forms of arc consistency have been widely studied, and have been known for sometime through the forward checking or the MAC search algorithms. Until recently, stronger forms of local consistency remained limited to those that change the structure of the constraint graph, and thus, could not be used in practice, especially on large networks. This paper focuses on the local consistencies that are stronger than arc consistency, without changing the structure of the network, i.e., only removing inconsistent values from the domains. In the last five years, several such local consistencies have been proposed by us or by others. We make an overview of all of them, and highlight some relations between them. We compare them both theoretically and experimentally, considering their pruning efficiency and the time required to enforce them.
A hybrid positioning system for technology-independent location-aware computing
Authors: Massimo Ficco, Stefano Russo
Venue: Software&mdash;Practice Experience (2009)

Location-aware computing is a form of context-aware mobile computing that refers to the ability of providing users with services that depend on their position. Locating the user terminal, often called positioning, is essential in this form of computing. Towards this aim, several technologies exist, ranging from personal area networking, to indoor, outdoor, and up to geographic area systems. Developers of location-aware software applications have to face with a number of design choices, that typically depend on the chosen technology. This work addresses the problem of easing the development of pull location-aware applications, by allowing uniform access to multiple heterogeneous positioning systems. Towards this aim, the paper proposes an approach to structure location-aware mobile computing systems in a way independent of positioning technologies. The approach consists in structuring the system into a layered architecture, that provides application developers with a standard Java Application Programming Interface (JSR-179 API), and encapsulates location data management and technology-specific positioning subsystems into lower layers with clear interfaces. In order to demonstrate the proposed approach we present the development of HyLocSys. It is an open hybrid software architecture designed to support indoor-outdoor applications, which allows the uniform (combined or separate) use of several positioning technologies. HyLocSys uses a hybrid data model, which allows the integration of different location information representations (using symbolic and geometric coordinates). Moreover, it allows support to handset- and infrastructure-based positioning approaches while respecting the privacy of the user. The paper presents a prototypal implementation of HyLocSys for heterogeneous scenarios. It has been implemented and tested on several platforms and mobile devices. Copyright &copy; 2009 John Wiley & Sons, Ltd.
Intelligent Systems and Its Applications in Robotics
Authors: Okyay Kaynak
Venue: Proceedings of the FIRA RoboWorld Congress 2009 on Advances in Robotics (2009)

The last decade of the last millennium is characterized by what might be called the intelligent systems revolution, as a result of which, it is now possible to have man made systems that exhibit ability to reason, learn from experience and make rational decisions without human intervention. Prof. Zadeh has coined the word MIQ (machine intelligence quotient) to describe a measure of intelligence of man-made systems. In this perspective, an intelligent system can be defined as a system that has a high MIQ.The presentation dwells upon how to define "intelligence" of man-made machines and continues with a discussion on computational intelligence, its main components and compares it with biological and artificial intelligence. The paradigm shift from computation with measurements to computation with perceptions is also pointed out to. The state-of-art reached in intelligent systems is overviewed with examples and a perspective on the future is given, based on "futurology" rather than "prophecy". The reasons behind the slow pace of developments are discussed, tying it to the availability of the computing power. The trends seen in this respect over the last century are overviewed and it is argued that the Moore's Law will have to reach an end, not so much because of technological difficulties but because of financial ones. Quantum and molecular computing are offered as possible alternatives. The talk closes with a consideration of the possible research directions in mechatronics and robotics as driving forces behind the development of intelligent systems.
Corporate User-Experience Maturity Model
Authors: Sean Tyne
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

User experience encompasses all aspect of a persons experience with an organization's services and products [1]. Organizations may or may not be aware of their customers' experience with their services or products and give different degrees of attention to developing and managing their customers' experiences. These degrees of attentions given to their customer experience can be measured and charted by phases or stages along a continuum of dedication or maturity. Based on the Capability Maturity Model Integration [2] and the Corporate Usability Maturity [3], this paper presents a model of user experience maturity by level based on an organizations dedication of resources, budget, and process integration.
On the Empirical Evaluation of an Interdisciplinary Framework for Automated Negotiation
Authors: Fernando Lopes, A. Q. Novais, Helder Coelho
Venue: Proceedings of the 4th International Conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2009)

Negotiation is an important and pervasive form of social interaction. The task of designing and implementing autonomous agents with negotiation competence is usually understood as involving the consideration of insights from multiple relevant research areas to integrate different perspectives on negotiation. Hence, this paper uses both game-theoretic techniques and methods from the social sciences as a basis to develop autonomous negotiating agents. It employs game-theoretic techniques to define equilibrium strategies for the bargaining game of alternating offers, and formalizes a set of negotiation strategies and tactics studied in the social sciences and frequently used by human negotiators. This paper also lays the foundation for performing an experiment to investigate the behaviour of autonomous agents equipped with the strategies, paying particular attention to the quality and the cost of bargaining.
Reliable publish/subscribe middleware for time-sensitive internet-scale applications
Authors: Christian Esposito, Domenico Cotroneo, Aniruddha Gokhale
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

Federating mission critical systems over wide-area networks still represents a challenging issue. For example, it is hard to assure both reliability and timeliness in a hostile environment such as Internet. The publish/subscribe (pub/sub) interaction model is a promising solution for scalable data dissemination over wide-area networks. Nevertheless, currently available pub/sub systems lack efficient support to achieve both reliability and timeliness in unreliable scenarios. This paper describes an innovative approach to fill this gap making three contributions. First, a cluster-based peer-to-peer organization is introduced to handle a large number of publishers and subscribers. Second, the cluster coordinator is replicated to mask process crashes and to preserve cluster connectivity toward the outside world. Third, multiple-tree redundancy is applied to tolerate link crashes thereby minimizing unpredictability in the delivery time. We present a simulation-based evaluation to assess the effectiveness of our approach in an unreliable setting. This study indicates that our approach enforces the reliability of event delivery without affecting its timeliness.
Detecting Guessed and Random Learners' Answers through Their Brainwaves
Authors: Alicia Heraz, Claude Frasson
Venue: Proceedings of the 17th International Conference on User Modeling, Adaptation, and Personalization: formerly UM and AH (2009)

This paper describes an experiment in which we tried to predict the learner's answers from his brainwaves. We discuss the efficiency to enrich the learner model with some electrical brain metrics to obtain some important information about the learner during a test. We conducted an experiment to reach three objectives: the first one is to record the learner brainwaves and his answers to the test questions; the second is to use machine learning techniques to predict guessed and random answers from the learner brainwaves; the third is to implement an agent that transmits the prediction results to an Intelligent Tutoring System. 21 participants were recruited, 45827 recording were collected and we reached a prediction accuracy of 96%.
VAR Model of PM2.5, Weather and Traffic in Los Angeles-Long Beach Area
Authors: Weiqiang Wang, Zhendong Niu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

The Los Angeles Long Beach Area has been the largest air polluter in LA regions. How to decrease the air pollution concentrations becomes a hot topic recently. A vector autoregressive model (VAR) was applied to modeling the time series of monthly maximum Particulate Matter (PM) 2.5 concentration in Los Angeles Long Beach Area. This paper explored the association among the current month PM2.5 concentrations and traffic and the meteorological covariates including wind speeds, temperatures, soil temperatures, dew points, for all the three datasets for LA Long Beach, 2001-2007, the VAR model appears to be supported by the datasets. This paper also provide parameter estimation, diagnostic checking procedures to model. Diagnostic tests have been applied to different VAR (p) models.
Temporal difference and policy search methods for reinforcement learning: an empirical comparison
Authors: Matthew E. Taylor, Shimon Whiteson, Peter Stone
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Reinforcement learning (RL) methods have become popular in recent years because of their ability to solve complex tasks with minimal feedback. Both genetic algorithms (GAs) and temporal difference (TD) methods have proven effective at solving difficult RL problems, but few rigorous comparisons have been conducted. Thus, no general guidelines describing the methods' relative strengths and weaknesses are available. This paper summarizes a detailed empirical comparison between a GA and a TD method in Keepaway, a standard RL benchmark domain based on robot soccer. The results from this study help isolate the factors critical to the performance of each learning method and yield insights into their general strengths and weaknesses.
A Foundation for Requirements Analysis of Dependable Software
Authors: Denis Hatebur, Maritta Heisel
Venue: Proceedings of the 28th International Conference on Computer Safety, Reliability, and Security (2009)

We present patterns for expressing dependability requirements, such as confidentiality, integrity, availability, and reliability. The paper considers random faults as well as certain attacks and therefore supports a combined safety and security engineering. The patterns - attached to functional requirements - are part of a pattern system that can be used to identify missing requirements.
Research and Design on Library Management System Based on Struts and Hibernate Framework
Authors: Erxiang Chen, Minghui Liu
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

If some small libraries use traditional librarymanagement system, they maybe waste resources. Inorder to this problem, a library management systembased on struts and hibernate frame is put forward. Thissystem has MVC architecture. It is a mutil-tier systemincluding presentation layer, business layer, datapersistence layer and database layer, which can separatecodes, and improve maintainability and reuse of thesystem.
Adaptive Monte Carlo methods for matrix equations with applications
Authors: Yongzeng Lai
Venue: Journal of Computational and Applied Mathematics (2009)

This paper discusses empirical studies with both the adaptive correlated sequential sampling method and the adaptive importance sampling method which can be used in solving matrix and integral equations. Both methods achieve geometric convergence (provided the number of random walks per stage is large enough) in the sense: e"@n@?c@l^@n, where e"@n is the error at stage @n, @l@?(0,1) is a constant, c>0 is also a constant. Thus, both methods converge much faster than the conventional Monte Carlo method. Our extensive numerical test results show that the adaptive importance sampling method converges faster than the adaptive correlated sequential sampling method, even with many fewer random walks per stage for the same problem. The methods can be applied to problems involving large scale matrix equations with non-sparse coefficient matrices. We also provide an application of the adaptive importance sampling method to the numerical solution of integral equations, where the integral equations are converted into matrix equations (with order up to 8192x8192) after discretization. By using Niederreiter's sequence, instead of a pseudo-random sequence when generating the nodal point set used in discretizing the phase space @C, we find that the average absolute errors or relative errors at nodal points can be reduced by a factor of more than one hundred.
Combining Electroencephalograph and Functional Near Infrared Spectroscopy to Explore Users' Mental Workload
Authors: Leanne M. Hirshfield, Krysta Chauncey, Rebecca Gulotta, Audrey Girouard, Erin T. Solovey, Robert J. Jacob, Angelo Sassaroli, Sergio Fantini
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

We discuss the physiological metrics that can be measured with electroencephalography (EEG) and functional near infrared spectroscopy (fNIRs). We address the functional and practical limitations of each device, and technical issues to be mindful of when combining the devices. We also present machine learning methods that can be used on concurrent recordings of EEG and fNIRs data. We discuss an experiment that combines fNIRs and EEG to measure a range of user states that are of interest in HCI. While our fNIRS machine learning results showed promise for the measurement of workload states in HCI, our EEG results indicate that more research must be done in order to combine these two devices in practice.
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
Authors: Jérôme Leroux
Venue: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science (2009)

The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the classical Kosaraju-Lambert-Mayr-Sacerdote-Tenney decomposition. This decomposition is used in this paper to prove that the Parikh images of languages accepted by VASs are semi-pseudo-linear; a class that extends the semi-linear sets, a.k.a. the sets definable in the Presburger arithmetic. We provide an application of this result; we prove that a final configuration is not reachable from an initial one if and only if there exists a Presburger formula denoting a forward inductive invariant that contains the initial configuration but not the final one. Since we can decide if a Preburger formula denotes an inductive invariant, we deduce that there exist checkable certificates of non-reachability. In particular, there exists a simple algorithm for deciding the general VAS reachability problem based on two semi-algorithms. A first one that tries to prove the reachability by enumerating finite sequences of actions and a second one that tries to prove the non-reachability by enumerating Presburger formulas.
Enhancing traveling experiences with augmented reality
Authors: Merja Haveri, Jouka Mattila
Venue: Proceedings of the 13th International MindTrek Conference: Everyday Life in the Ubiquitous Era (2009)

In this poster, we describe an augmented reality (AR) service prototype and the users studies planned for it 2H/09. This service provides additional location based information for travelers in Suomenlinna, a popular tourist attraction by the coast of Helsinki, Finland.
Compact spectral bases for value function approximation using Kronecker factorization
Authors: Jeff Johns, Sridhar Mahadevan, Chang Wang
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

A new spectral approach to value function approximation has recently been proposed to automatically construct basis functions from samples. Global basis functions called proto-value functions are generated by diagonalizing a diffusion operator, such as a reversible random walk or the Laplacian, on a graph formed from connecting nearby samples. This paper addresses the challenge of scaling this approach to large domains. We propose using Kronecker factorization coupled with the Metropolis-Hastings algorithm to decompose reversible transition matrices. The result is that the basis functions can be computed on much smaller matrices and combined to form the overall bases. We demonstrate that in several continuous Markov decision processes, compact basis functions can be constructed without significant loss in performance. In one domain, basis functions were compressed by a factor of 36. A theoretical analysis relates the quality of the approximation to the spectral gap. Our approach generalizes to other basis constructions as well.
An integrative approach to requirements analysis: How task models support requirements reuse in a user-centric design framework
Authors: Cyril Montabert, D. Scott McCrickard, Woodrow W. Winchester, Manuel A. Pérez-Quiñones
Venue: Interacting with Computers (2009)

Many software systems fail to address their intended purpose because of a lack of user involvement and requirements deficiencies. This paper discusses the elaboration of a requirements-analysis process that integrates a critical-parameter-based approach to task modeling within a user-centric design framework. On one hand, adapting task models to capture requirements bridges the gap between scenarios and critical parameters which benefits design from the standpoint of user involvement and accurate requirements. On the other hand, using task models as a reusable component leverages requirements reuse which benefits design by increasing quality while simultaneously reducing development costs and time-to-market. First, we present the establishment of both a user-centric and reuse-centric requirements process along with its implementation within an integrated design tool suite. Secondly, we report the design, procedures, and findings of two user studies aimed at assessing the feasibility for novice designers to conduct the process as well as evaluating the resulting benefits upon requirements-analysis deliverables, requirements quality, and requirements reuse.
Review of statistical analyses in drug discovery and chemogenomics
Authors: Yushi Liu, Joseph S. Verducci
Venue: Statistical Analysis and Data Mining (2009)

A review of the basic organizational structure of chemogenomics outlines how chemoinformatics, combinational and medicinal chemistry integrate with microarray methods and systems biology to discover new drugs. Key statistical issues include investigations of quantitative structural activity relationships (QSARs), the role of compound similarity in constructing experimental designs, and techniques for getting reliable and accurate measures of genomic response. Four current areas of research are highlighted: correlational analyses, integration of non-coding RNA signals into modeling, connectivity maps, and yeast deletion libraries. Copyright &copy; 2009 Wiley Periodicals, Inc. Statistical Analysis and Data Mining 2: 88-102, 2009
Theoretical Analysis on Coherent Noise by Rayleigh Backscattering in Bidirectional Transmission System with Single Mode Fiber
Authors: Wang Yan-Hong, Ni Guo-Qiang, Guo Pan, Gao Kun
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

At present, bidirectional transmission over a signal fiber is applied in many filed, such as WDM. Bidirectional transmission reduces the required number of fibers and uses one optical source, so it is lower cost than unidirectional transmission. But coherent noise by Rayleigh backscattering is mainly a factor of degraded system performance in this kind of system. In this paper, the properties of Rayleigh backscattering are analyzed and the model of backscattering transmission is established in single mode fiber. The phase fluctuation is deduced by the autocorrelation function and the power spectral density. In this paper, at the same time, the impact of coherence Rayleigh noise (CRN) on the system performances and the tradeoff between useful signal and CRN are discussed.