ppxscal/embedding_network huggingface dataset:
Analyzing Interactions between Navigation Strategies Using a Computational Model of Action Selection
Authors: Laurent Dollé, Mehdi Khamassi, Benoît Girard, Agnès Guillot, Ricardo Chavarriaga
Venue: Proceedings of the international conference on Spatial Cognition VI: Learning, Reasoning, and Talking about Space (2008)

For animals as well as for humans, the hypothesis of multiple memory systems involved in different navigation strategies is supported by several biological experiments. However, due to technical limitations, it remains difficult for experimentalists to elucidate how these neural systems interact. We present how a computational model of selection between navigation strategies can be used to analyse phenomena that cannot be directly observed in biological experiments. We reproduce an experiment where the rat's behaviour is assumed to be ruled by two different navigation strategies (a cue-guided and a map-based one). Using a modelling approach, we can explain the experimental results in terms of interactions between these systems, either competing or cooperating at specific moments of the experiment. Modelling such systems can help biological investigations to explain and predict the animal behaviour.
Cognitive Modeling of Knowledge-Guided Information Acquisition in Games
Authors: Reijer Grimbergen
Venue: Proceedings of the 6th international conference on Computers and Games (2008)

Since Chase and Simon presented their influential paper on perception in chess in 1973, the use of chunks has become the subject of a number of studies into the cognitive behavior of human game players. However, the nature of chunks has remained elusive, and the reason for this lies in the lack of using a general cognitive theory to explain the nature of chunks. In this paper it will be argued that Marvin Minsky's Society of Mind theory is a good candidate for a cognitive theory to define chunks and to explain the relation between chunks and problem-solving tasks. To use Minsky's Society of Mind theory to model human cognitive behavior in games, we first need to understand more about the primitive agents dealing with the relation between perception and knowledge in memory. To investigate this relation, a reproduction experiment is performed in shogi showing that perception is guided by knowledge in long-term memory. From the results we may conclude that the primitive agents in a cognitive model for game-playing should represent abstract concepts such as board, piece, and king rather than the perceptual features of board and pieces.
Automated dialog systems for Romanian language
Authors: Chivu Catalin, Chivu Catrina
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

The automated dialog systems are based on natural language processing, which has main purpose the development of language computing theory using knowledge specific to informatics field, as algorithms, data structures, knowledge representation models and automat reasoning models. For many specialists in the field, speech technology includes two main subfields: vocal synthesis and speech recognition. These two subfields are complementary. The present paper presents such a system developed for Romanian language.
Personalized Previews of Alternative Routes in Virtual Environments
Authors: Mehmed Kantardzic, Pedram Sadeghian
Venue: Proceedings of the 11th international conference on User Modeling (2007)

In virtual environments (VEs) there are often many routes available to a destination and each route has its own unique characteristics. At the same time, each VE user has unique preferences when selecting a route. In this paper, we present a new methodology for developing a personalized route preview interface, which provides a preview of several routes to a destination that closely match the user's preferences. The user's preferences are modeled by an automatically generated user profile that does not require any explicit input from the user. Simulation experiments have shown the potential of this approach in both accurately learning the user's preferences and personalizing the preview interface.
Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
Authors: Martin Korp, Aart Middeldorp
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

The match-bound technique is a recent and elegant method to prove the termination of rewrite systems using automata techniques. To increase the applicability of the method we incorporate it into the dependency pair framework. The key to this is the introduction of two new enrichments which take the special properties of dependency pair problems into account.
Driver or Passenger? An Analysis of Citizen-Driven eGovernment
Authors: Katarina Lindblad-Gidlund
Venue: Proceedings of the 7th international conference on Electronic Government (2008)

eGovernment is often put forward as a transformation supporting empowerment and democracy, building on principles such as `citizen-driven' and `citizen-centered' development. In addition it is often symbolized by a technology-laden and romantic progressivism. In this article this picture is analyzed from the perspective of the ones supposed to put eGovernment into practice. A model to analyze our relation with technology laden governmental development is put forward. The results, resting on a large scale empirical study in a local municipality, show that a remarkably high number of civic servants (acting in their role as citizens) did not see any possibility to change the transformation if they thought it not to serve the citizens. Implying that there is still a long way to go to live up to such beautiful proclamations, and also highlights the question whether `citizen-driven eGovernment' is an accurate framing?
Benefits of Perceptually Transparent Vibration Rendering in Mobile Device
Authors: Jonghyun Ryu, Seungmoon Choi
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

In general, an input/output (I/O) relation from a command sent to a haptic interface to a resulting percept forms a complicated function, due to the complexity of the haptic interface dynamics and the associated perception process. However, if such I/O relation can be found, using its inverse will allow haptic effects designed in terms of a target percept to be autonomously converted to corresponding device commands, so that the desired haptic effects can be exactly perceived by the user. We call this rendering framework as perceptually transparent rendering. Previously, we showed that perceptually transparent rendering is feasible for vibration rendering in a mobile device with perceived magnitude as a target percept. As a follow-up study, this paper investigates its benefits through a psychophysical experiment. In the experiment, we designed a set of vibration stimuli the intensities of which were evenly spaced either in the device command (applied voltage; the current practice) and the target percept (perceived magnitude; perceptually transparent rendering), and measured the pairwise discriminability of each stimulus set. The results showed that the average discrimination scores of perceptually transparent rendering were always higher, indicating its superior performance to the current practice of mobile device vibration rendering.
Scheduling Intersection Queries in Term Partitioned Inverted Files
Authors: Mauricio Marin, Carlos Gomez-Pantoja, Senen Gonzalez, Veronica Gil-Costa
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

This paper proposes and presents a comparison of scheduling algorithms applied to the context of load balancing the query traffic on distributed inverted files. We put emphasis on queries requiring intersection of posting lists, which is a very demanding case for the term partitioned inverted file and a case in which the document partitioned inverted file used by current search engines can perform very efficiently. We show that with proper scheduling of queries the term partitioned approach can outperform the document partitioned approach.
Digital Video Watermarking Based on RGB Color Channels and Principal Component Analysis
Authors: Hanane Mirza, Hien Thai, Zensho Nakao
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

Embedding a digital watermark in an electronic document is proving to be a feasible solution for multimedia copyright protection and authentication purposes. In the present paper we propose a new digital video watermarking scheme based on Principal Component Analysis. We detect the video shots based on informational content, and color similarities; we extract the key frames of each shot and each key frame is composed of three color channels, and our proposed algorithm allows us to embed a watermark in the three color channels RGB of an input video file. The preliminary results show a high robustness against most common video attacks, especially frame dropping, cropping and recalling for a good perceptual quality.
Adaptive neural-fuzzy control of uncertain constrained multiple coordinated nonholonomic mobile manipulators
Authors: Zhijun Li, Weidong Chen
Venue: Engineering Applications of Artificial Intelligence (2008)

Most studies on the coordination of multiple mobile manipulators system assume exact knowledge of system kinematics and dynamics, and deal only with motion tracking control. However, actual applications may involve tasks in which multiple coordinated mobile manipulators system is required to keep contact on the contour of the constraint surface in tasks. In this paper, we consider multiple mobile manipulators grasping a rigid object in contact with deformable working surfaces, whose geometric and physical model is unknown. The contact forces are nonlinear and unknown. Adaptive neuro-fuzzy (NF) control for coordinated mobile manipulators is proposed for robust force/motion tracking on the constraint surface while it is in motion. The control law is decoupled in three subspaces and adaptive tuning mechanism is developed to deal with the uncertain environmental constraints, disturbances, and unknown robotic dynamics. The proposed adaptive NF hybrid force/motion controller guarantees robust tracking of the desired motion and force trajectories. Simulation examples are presented to illustrate the results.
Improved word alignments for statistical machine translation
Authors: Daniel Marcu
Venue:  (2007)

All state of the art statistical machine translation systems and many example-based machine translation systems depend on an annotation of word-level translational correspondence between sets of parallel sentences. Such an annotation of two parallel sentences is called a "word alignment". The largest number of manually annotated word alignments currently available to the research community for any pair of languages consists of alignments for only thousands of parallel sentences, even though there are several orders of magnitude more parallel sentences available. For instance, for the task of translating Chinese news articles to English, there are currently on the order of 10 million parallel sentences. This is too many for manual alignment, so they must be automatically word aligned. Unsupervised word alignment systems generate poor quality alignments, often using statistical word alignment models developed over 10 years ago, but most recent research into improving word alignments has not led to improved translation. There are several reasons for this: (1) There is no good metric which can be used to automatically measure word alignment quality for the translation task. (2) Statistical word alignment models are based on assumptions about the structure of the problem which are incorrect. (3) It is difficult to add new sources of linguistic knowledge because many current systems must be completely reengineered for each new knowledge source. (4) Statistical models of word alignment are most often learned in an unsupervised training process which is unable to take advantage of annotated data. This thesis remedies these problems by making contributions in the following three areas: (1) We have found a new method for automatically measuring alignment quality using an unbalanced F-Measure metric. We have validated that this metric adequately measures alignment quality for the translation task. We have shown that the metric can be used to derive a loss function for discriminative training approaches, and it is useful for measuring progress during the development of new word alignment procedures. (2) We have designed a new statistical model for word alignment called LEAF, which directly models the word alignment structure as it is used for machine translation, in contrast with previous models which make unreasonable structural assumptions. (3) We have developed a semi-supervised training algorithm, the EMD algorithm, which automatically takes advantage of whatever quantity of manually annotated data can be obtained. The use of the EMD algorithm allows for the introduction of new knowledge sources with minimal effort. We have shown that these contributions improve state of the art statistical machine translation systems in experiments on challenging large data sets.
An Algorithm of Decentralized Artificial Immune Network and Its Implementation
Authors: Mariusz Święcicki
Venue: Proceedings of the 5th Hellenic conference on Artificial Intelligence: Theories, Models and Applications (2008)

In this article we have presented a mechanism of antigen transformation as it occurs in the natural system. Using this mechanism as a base the article has defined paradigms which were used to determine the architecture of the decentralized artificial immune network. The achievements results have been shown that the proposed learning mechanisms and the decentralized architecture consisting of computational nodes is calibrated and it can be successfully used in the distributed computational environments such as Grid and Clusters systems.
Interaction and Realizability
Authors: Manfred Broy
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

We deal with the issue of realizability and computability of interactive interface behaviors as described in [1]. We treat the following aspects of interactive behaviors that are represented by relations between communication streams:--- Causality between input and output streams--- Realizability of single output histories for given input histories--- The role of non-realizable output in specific system contexts and for composition--- Relating non-realizable behaviors to state machines--- The concept of interactive computation and computabilityFinally, we relate our results to classical notions of computability. The main goal of this paper is the characterization of a general concept of interactive interface behavior as basis for the extension and generalization of the notion of computability to interactive behaviors.
Implementation of the ABC Quantum Mechanical Reactive Scattering Program on the EGEE Grid Platform
Authors: Dimitrios Skouteris, Alessandro Costantini, Antonio Laganà, Gergely Sipos, Ákos Balaskó, Péter Kacsuk
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

Computer based simulation of quantum mechanical reactive scattering is a CPU intensive process. Despite the small I/O traffic a single simulation requires several thousand CPU hours. The ABC program provides an impelementation for quantum mechanical reaction simulation in such a way that the code can be efficiently ported to parallel computing platforms. The Computational Chemistry and Application Porting Support groups of the EGEE project worked together to create a grid enabled version of the ABC code. The collaboration resulted a Grid application that is capable of using several clusters and storage servers of the EGEE Grid symultaneously, achieving significant speed-up. The application has been ported to EGEE Grid as a parameter study application with the P-GRADE Grid portal. The paper describes the application porting process, the technical analysis and performance of the local and the Grid enabled ABC application.
Shoptalk: toward independent shopping by people with visual impairments
Authors: Vladimir Kulyukin, John Nicholson, Daniel Coster
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

ShopTalk, a proof-of-concept system designed to assist individuals with visual impairments with finding shelved products in grocery stores, is built on the assumption that simple verbal route directions and layout descriptions can be used to leverage the O&M skills of independent visually impaired travelers to enable them to navigate the store and retrieve shelved products. This paper introduces ShopTalk and summarizes experiments performed in a real-world supermarket.
Robots in the kitchen: Exploiting ubiquitous sensing and actuation
Authors: Radu Bogdan Rusu, Brian Gerkey, Michael Beetz
Venue: Robotics and Autonomous Systems (2008)

Our goal is to develop intelligent service robots that operate in standard human environments, automating common tasks. In pursuit of this goal, we follow the ubiquitous robotics paradigm, in which intelligent perception and control, are combined with ubiquitous computing. By exploiting sensors and effectors in its environment, a robot can perform more complex tasks without becoming overly complex itself. Following this insight, we have developed a service robot that operates autonomously in a sensor-equipped kitchen. The robot learns from demonstration, and performs sophisticated tasks, in concert with the network of devices in its environment. We report on the design, implementation, and usage of this system, which is freely available for use, and improvement by others, in the research community.
From fuzzy systems to fuzzy networks
Authors: Alexander Gegov
Venue: Proceedings of the 9th WSEAS International Conference on Fuzzy Systems (2008)

A fuzzy system is a 'black box' model in the form of a single large rule base which does not take into account any interconnections in a complex process. As opposed to this, a fuzzy network is a 'white box' model in the form of multiple smaller rule bases which takes into account all interconnections. This paper introduces briefly the theoretical foundations of fuzzy networks including formal models, basic operations, structural properties and advanced manipulations. It also highlights fuzzy networks with feedforward and feedback connections. Finally, a comparative evaluation of fuzzy networks in relation to fuzzy systems is presented.
A demonstration of the meshtest wireless testbed for delay-tolerant network research
Authors: Brenton D. Walker, Ian Vo, Matthew Beecher, Matthew Seligman
Venue: Proceedings of the third ACM workshop on Challenged networks (2008)

MeshTest is a laboratory-based multi-hop wireless testbed that can subject real wireless nodes running real DTN implementations to reproducible mobile scenarios. It uses shielded enclosures and an RF matrix switch to dynamically control the attenuation experienced between pairs of nodes. The testbed is an ideal platform for DTN testing, offering convenient experimental control and data management. We have installed the DTN2 Reference Implementation on the testbed nodes, and and have been using it to run experiments. Our current experimental scenarios are similar to the well known Data MULE and Message Ferry models, but a large variety of other experimental scenarios are possible.
Extending Carin to the Description Logics of the $\mathcal{SH}$ Family
Authors: Magdalena Ortiz
Venue: Proceedings of the 11th European conference on Logics in Artificial Intelligence (2008)

This work studies the extension of the existential entailment algorithm of Carin to DLs of the $\mathcal{SH}$ family. The Carin family of knowledge representation languages was one of the first hybrid languages combining Datalog rules and Description Logics. For reasoning in one of its prominent variants, which combines $\mathcal{ALCNR}$ with non-recursive Datalog, the blocking conditions of the standard tableaux procedure for $\mathcal{ALCNR}$ were modified. Here we discuss a similar adaptation to the $\mathcal{SHOIQ}$ tableaux, which provides some new decidability results and tight data complexity bounds for reasoning in non-recursive Carin, as well as for query answering over Description Logic knowledge bases.
Security Assessment Framework Using Static Analysis and Fault Injection
Authors: Hyungwoo Kang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

For large scale and residual software like network service, reliability is a critical requirement. Recent research has shown that most of network software still contains a number of bugs. Methods for automated detection of bugs in software can be classified into static analysis based on formal verification and runtime checking based on fault injection. In this paper, a framework for checking software security vulnerability is proposed. The framework is based on automated bug detection technologies, i.e. static analysis and fault injection, which are complementary each other. The proposed framework provides a new direction, in which various kinds of software can be checked its vulnerability by making use of static analysis and fault injection technology. In experiment on proposed framework, we find unknown vulnerability as well as known vulnerability in Windows network module.
Q&AThe upper limit
Authors: Leah Hoffmann
Venue: Communications of the ACM (2009)

Jeannette Wing talks about clusters, creativity, and the power of computational thinking.
A Tool for Temporal Comparison of Mammograms: Image Toggling and Dense-Tissue-Preserving Registration
Authors: Akira Hasegawa, Huzefa Neemuchwala, Hiroko Tsunoda-Shimizu, Satoru Honda, Kazuo Shimura, Minoru Sato, Tomomi Koyama, Mari Kikuchi, Sonoe Hiramatsu
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

Temporal comparison is indispensable for mammography reading. In this paper, we propose a new method to perform temporal comparison of digital mammograms using persistence of vision and propose a dense-tissue-preserving registration method for the temporal alignment. In this method, we use non-rigid registration to deform a prior mammogram to align with its corresponding current mammogram. We apply a dense-tissue-preserving constraint to the registration to preserve the shape and size of the dense tissue areas. Once aligned, we toggle the display back and forth between the current mammogram and its corresponding registered prior mammogram. The proposed method was applied to 11 temporal mammogram cases and evaluated by two experienced radiologists.
Explaining Verification Conditions
Authors: Ewen Denney, Bernd Fischer
Venue: Proceedings of the 12th international conference on Algebraic Methodology and Software Technology (2008)

Hoare-style program verification relies on the construction and discharge of verification conditions (VCs) but offers no support to trace, analyze, and understand the VCs themselves. We describe a systematic extension of the Hoare rules by labels so that the calculus itself can be used to build up explanations of the VCs. The labels are maintained through the different processing steps and rendered as natural language explanations. The generated explanations are based only on an analysis of the labels rather than directly on the logical meaning of the underlying VCs or their proofs. The explanations can be customized to capture different aspects of the VCs; here, we focus on labelings that explain their structure and purpose.