ppxscal/embedding_network huggingface dataset:
Interpreting Motion Expressions in Route Instructions Using Two Projection-Based Spatial Models
Authors: Yohei Kurata, Hui Shi
Venue: Proceedings of the 31st annual German conference on Advances in Artificial Intelligence (2008)

This paper explores the applicability of two formal models of spatial relations, Double Cross and RfDL 3 ¿ 12, to interpret some typical expressions that people use for describing a route. The relations in these two models allow the qualitative representation of the location and spatial extent of a landmark as seen from a route segment. We explore the correspondence between the relations in these two models and the motion expressions that refer to a point-like and a region-like landmark, respectively, which consist of the same set of direction-related expressions and specific sets of topology-related expressions. Through this exploration, we identify intrinsic ambiguities in the direction-related motion expressions that refer to a region-like landmark. Finally, we propose the generalization of our approach by using a spatial ontology, which potentially enables the mobile robots to interpret a large variety of expressions in human route instructions.
Breaking the ε-Soundness Bound of the Linearity Test over GF(2)
Authors: Tali Kaufman, Simon Litsyn, Ning Xie
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

For Boolean functions that are ¿-away from the set of linear functions, we study the lower bound on the rejection probability (denoted by rej(¿)) of the linearity test suggested by Blum, Luby and Rubinfeld. This problem is one of the most extensively studied problems in property testing of Boolean functions.The previously best bounds for rej(¿) were obtained by Bellare, Coppersmith, Håstad, Kiwi and Sudan. They used Fourier analysis to show that rej(¿) for every $0 \leq \epsilon \leq \frac{1}{2}$. They also conjectured that this bound might not be tight for ¿'s that are close to 1/2. In this paper we show that this indeed is the case. Specifically, we improve the lower bound of rej(¿) ¿ ¿ by an additive term that depends only on ¿: rej(¿) $\geq \epsilon + \min \{1376\epsilon^{3}(1-2\epsilon)^{12}, \frac{1}{4}\epsilon(1-2\epsilon)^{4}\}$, for every $0 \leq \epsilon \leq \frac{1}{2}$. Our analysis is based on a relationship between rej(¿) and the weight distribution of a coset of the Hadamard code. We use both Fourier analysis and coding theory tools to estimate this weight distribution.
Pilot study to monitor body temperature of dairy cows with a rumen bolus
Authors: A. H. Ipema, D. Goense, P. H. Hogewerf, H. W. J. Houwers, H. van Roest
Venue: Computers and Electronics in Agriculture (2008)

A bolus containing a mote (temperature sensor, processor and radio) was placed in the rumen of a fistulated cow to monitor body temperature. Rumen temperature was measured every minute and stored in the internal buffer of the mote. The measured temperature was also transmitted to a base station by the mote every minute. A relay mote mounted on the cows' left front leg assisted transmission of the information from rumen to the base station. Cow behaviour affected the success rate of data transmission. The base station received more than 50% of the transmitted data when the cow was standing. Success rate was lower than 40% when the cow was lying down. Rumen temperature varied diurnally with night-time temperatures higher than day-time temperatures. Drinking events resulted in distinct decreases of the rumen temperature. It is concluded that for the application of internal sensor motes wireless communication through the body and living environment of the animal works but improvements are possible. Research should also focus on the interpretation of sensor data on mote level for optimizing data recording frequency and transmission of data to dairy management practice.
Conformal mapping for the efficient MFS solution of Dirichlet boundary value problems
Authors: Andreas Karageorghis, Yiorgos-Sokratis Smyrlis
Venue: Computing (2008)

In this work, we use conformal mapping to transform harmonic Dirichlet problems of Laplace&#x2019;s equation which are defined in simply-connected domains into harmonic Dirichlet problems that are defined in the unit disk. We then solve the resulting harmonic Dirichlet problems efficiently using the method of fundamental solutions (MFS) in conjunction with fast fourier transforms (FFTs). This technique is extended to harmonic Dirichlet problems in doubly-connected domains which are now mapped onto annular domains. The solution of the resulting harmonic Dirichlet problems can be carried out equally efficiently using the MFS with FFTs. Several numerical examples are presented.
Trustbus'07 Keynote Talk Privacy Enhanced Personalization
Authors: Alfred Kobsa
Venue: Proceedings of the 4th international conference on Trust, Privacy and Security in Digital Business (2007)

Web personalization has demonstrated to be advantageous for both online customers and vendors. However, current personalization methods require considerable amounts of data about users, and the benefits of personalization are therefore counteracted by privacy concerns. Personalized systems need to take these concerns into account, as well as privacy laws and industry self-regulation that may be in effect. Privacy-Enhanced Personalization aims at reconciling the goals and methods of user modeling and personalization with privacy considerations, and to strive for best possible personalization within the boundaries set by privacy. This talk surveys recent research on factors that affect people's personal information disclosure and on personalization methods that bear fewer privacy risks, and presents design recommendations based thereon.
Development of a Vision System for a Floor Marking Mobile Robot
Authors: Zulkifli Zainal Abidin, Syamsul Bahrin Abdul Hamid, Ahmad Anis Abdul Aziz, Azlan Ab. Malek
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

Participants of an exhibition are usually provided with booths to display their work. Workers usually consturuct these booths by measuring the exhibition floor by hand and marking the floor to determine the size of the booths. This project aims to develop a system that uses video cameras overlooking the exhibition floor to automate the process of measuring and marking the exhibition floor space to the correct predetermined size, i.e. the robot will use machine vision to determine its position and to control its motion in marking the floor according to a predetermined floor plan.
Robust Automatic Segmentation of Cell Nucleus Using Multi-scale Space Level Set Method
Authors: Chaijie Duan, Shanglian Bao, Hongyu Lu, Jinsong Lu
Venue: Medical Imaging and Informatics: 2nd International Conference, MIMI 2007, Beijing, China, August 14-16, 2007 Revised Selected Papers (2008)

In this paper, we propose a novel scheme for cell nucleus segmentation which is multi-scale space level set method. Under this scheme, all nuclei of interest in a microscopic image can be segmented simultaneously. The procedure includes three stages. Firstly, the mathematical morphology method is used to search seed points to localize interested nuclei. Secondly, based on the distribution of these seed points, a level set function is initialized. Finally, the level set function evolves and eventually stops zero level set contours at the boundaries of nuclei labeled by seed points. The evolution in the last stage is a three phase evolution. In each phase, information of different scale spaces is employed. This method was tested by truthful microscope images of lymphocyte, which proved its robustness and efficiency.
Antecedents of Production Innovation during Web Based Application Development
Authors: Wang Cheng, Lan Hailin, Xie Hongming
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Internet technology is changing the way of product development, ranging from information gathering, product innovation and commerce to product development. Production innovations are crucial for success of companies operating in turbulent and uncertain environments. These production innovations need to be introduced at a rapid pace while at the same time companies have to absorb market information and integrate knowledge during web based application development. Hence, the purpose of this paper is to develop a general model on the critical antecedents of production innovation via combining organizational learning theory and knowledge-based perspectives during web based application development. Using structural equations modeling with data collected 208 Chinese firms, the result show that knowledge integration plays a perfect mediating role between learning orientation and production innovation. Managerial implications are explored and future research directions are also identified.
The Generalisation Ability of a Selection Architecture for Genetic Programming
Authors: David Jackson
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

As an alternative to various existing approaches to incorporating modular decomposition and reuse in genetic programming (GP), we have proposed a new method for hierarchical evolution. Based on a division of the problem's test case inputs into subsets, it employs a program structure that we refer to as a selection architecture. Although the performance of GP systems based on this architecture has been shown to be superior to that of conventional systems, the nature of evolved programs is radically different, leading to speculation as to how well such programs may generalise to deal with previously unseen inputs. We have therefore performed additional experimentation to evaluate the approach's generalisation ability, and have found that it seems to stand up well against standard GP in this regard.
Special Session: Tools for Program Development and Analysis in Computational Science
Authors: Jie Tao, Arndt Bode, Andreas Knuepfer, Dieter Kranzlmüller, Roland Wismüller, Jens Volkert
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

The use of supercomputing technology, parallel and distributed processing, and sophisticated algorithms is of major importance for computational scientists. Yet, the scientists' goals are to solve their challenging scientific problems, not the software engineering tasks associated with it. For this reason, computational science and engineering must be able to rely on dedicated support from program development and analysis tools.
Automatic Generation of Expressive Gaze in Virtual Animated Characters: From Artists Craft to a Behavioral Animation Model
Authors: Rossana B. Queiroz, Leandro M. Barros, Soraia R. Musse
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

We present a model for automatic generation of expressive gaze in virtual agents. Our main focus is the eye behavior associated to expressiveness. Our approach is to collect data from animated Computer Graphics films, and codify such observations into an animation framework. The main contribution is the modeling aspects of an animation system, calibrated with empirical observations in order to generate realistic eyes motion. Results show that this approach generates convincing animations that improve the empathy of virtual agents.
KeY-C: A Tool for Verification of C Programs
Authors: Oleg Mürk, Daniel Larsson, Reiner Hähnle
Venue: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction (2007)

We present KeY-C, a tool for deductive verification of C programs. KeY-C allows to prove partial correctness of C programs relative to pre- and postconditions. It is based on a version of KeY that supports Java Card. In this paper we give a glimpse of syntax, semantics, and calculus of C Dynamic Logic (CDL) that were adapted from their Java Card counterparts, based on an example. Currently, the tool is in an early development stage.
Concept for Controlled Self-optimization in Online Learning Neuro-fuzzy Systems
Authors: Nils Rosemann, Werner Brockmann
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

Many modern control systems, e.g., in automotive or robotic applications get increasingly complex and hard to design. This is due to the complex interactions of their internal subsystems, but additionally, these systems operate in a dynamically changing, complex environment. The Organic Computing (OC) initiative tries to cope with the resulting engineering demands by introducing emergence and self-x properties into the systems (e.g., self-organization, self-optimization). Within this context, we focus on control systems which adapt their behavior autonomously by learning.
Ubi Lex, Ibi Poena: Designing Norm Enforcement in E-Institutions
Authors: Davide Grossi, Huib Aldewereld, Frank Dignum
Venue: Coordination, Organizations, Institutions, and Norms in Agent Systems II: AAMAS 2006 and ECAI 2006 International Workshops, COIN 2006 Hakodate, Japan, May 9, 2006 Riva del Garda, Italy, August 28, 2006. Revised Selected Papers (2007)

The viability of the application of the e-Institution paradigm for obtaining overall desired behavior in open multiagent systems (MAS) lies in the possibility of bringing the norms of the institution to have an actual impact on the MAS. Institutional norms have to be implemented in the society. The paper addresses two possible views on implementing norms, the so-called regimentation of norms, and the enforcement of norms, with particular attention to this last one. Aim of the paper is to provide a theory for the understanding of the notion of enforcement and for the design of enforcement mechanisms in e-Institutions.
Inaccuracies of Shape Averaging Method Using Dynamic Time Warping for Time Series Data
Authors: Vit Niennattrakul, Chotirat Ann Ratanamahatana
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Shape averaging or signal averaging of time series data is one of the prevalent subroutines in data mining tasks, where Dynamic Time Warping distance measure (DTW) is known to work exceptionally well with these time series data, and has long been demonstrated in various data mining tasks involving shape similarity among various domains. Therefore, DTW has been used to find the average shape of two time series according to the optimal mapping between them. Several methods have been proposed, some of which require the number of time series being averaged to be a power of two. In this work, we will demonstrate that these proposed methods cannot produce the real average of the time series. We conclude with a suggestion of a method to potentially find the shape-based time series average.
Accessibility-Based Resource Selection in Loosely-Coupled Distributed Systems
Authors: Jinoh Kim, Abhishek Chandra, Jon B. Weissman
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Large-scale distributed systems provide an attractive scalable infrastructure for network applications. However,the loosely-coupled nature of this environment can make data access unpredictable, and in the limit, unavailable. We introduce the notion of accessibility to capture both availability and performance. An increasing number of data intensive applications require not only considerations of node computation power but also accessibility for adequate job allocations. For instance, selecting a node with intolerably slow connections can offset any benefit to running on a fast node. In this paper, we present accessibility-aware resource selection techniques by which it is possible to choose nodes that will have efficient data access to remote data sources. We show that the local data access observations collected from a node's neighbors are sufficient to characterize accessibility for that node. We then present resource selection heuristics guided by this principle, and show that they significantly out perform standard techniques. The suggested techniques are also shown to be stable even under churn despite the loss of prior observations.
Visual Debugging of MPI Applications
Authors: Basile Schaeli, Ali Al-Shabibi, Roger D. Hersch
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

We present the design and implementation of a debugging tool that displays a message-passing graph of the execution of an MPI application. Parts of the graph can be hidden or highlighted based on the stack trace, calling process or communicator of MPI calls. The tool incorporates several features enabling developers to explicitly control the ordering of message-passing events during the execution, and test that reordering these events does not compromise the correctness of the computations. In particular, we describe an automated running mode that detects competing sends matching the same wildcard receive and enables the developer to choose which execution path should be followed by the application.
Towards extending and using SPARQL for modular document generation
Authors: Faisal Alkhateeb, Sébastien Laborie
Venue: Proceeding of the eighth ACM symposium on Document engineering (2008)

RDF is one of the most used languages for resource description and SPARQL has become its standard query language. Nonetheless, SPARQL remains limited to generate automatically documents from RDF repositories, as it can be used to construct only RDF documents. We propose in this paper an extension to SPARQL that allows to generate any kind of XML documents from multiple RDF data and a given XML template. Thanks to this extension, an XML template can itself contain SPARQL queries that can import template instances. Such an approach allows to reuse templates, divide related information into various templates and avoid templates containing mixed languages. Moreover, reasoning capabilities can be exploited using RDF Schema or simply RDFS.
Business Ecosystem Modelling: Combining Natural Ecosystems and Multi-Agent Systems
Authors: César A. Marín, Iain Stalker, Nikolay Mehandjiev
Venue: Proceedings of the 11th international workshop on Cooperative Information Agents XI (2007)

The increasing popularity of the "business ecosystem" concept in (business) strategy reflects that it is seen as one way to cope with increasingly dynamic and complex business environments. Nevertheless, the lack of a convincing model of a business ecosystem has led to the development of software which only give organisations a partial aid whilst neglecting their need for adaptation. Research in Multi-Agent Systems has proved to be suitable for modelling interactions among disparate sort of entities such as organisations. On the other hand, natural ecosystems continue to adapt themselves to changes in their dynamic and complex environments. In this paper, we present the Dynamic Agent-based Ecosystem Model. It combines ideas from natural ecosystems and multi-agent systems for business interactions.
Granular Computing and Modeling the Human Thoughts in Web Documents
Authors: Tsau Young Lin
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

The totality of human thoughts in a document set is modeled by a polyhedron. A point represents a THOUGHT, a simplex a CONCEPT, a connected component a COMPLETE CONCEPT, the simplicial structure the whole IDEA. The building block is the simplex; it represents the concept that is carried by a set of high frequency and nearby co-occurring keywords. The simplicial structure of the keywords provides an "informal" formal language about human thoughts in a document set. The model theory of this language gives the desirable model.
A P2P Platform for Socially Intelligent Web Service Publication and Discovery
Authors: Michael Pantazoglou, Aphrodite Tsalgatidou
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

The ability of service providers to adequately describe and publish their Web services is a critical factor to the success in their discovery by interested parties. To date, most of the efforts made towards this direction have mainly focused on the use of ontologies. However, the resulted approaches impose centralized control of the ontology vocabularies and/or schemas, suffer from considerable interoperability issues and require complex, heavyweight technologies. In this paper we present our ongoing work on a peer-to-peer platform supporting publication and discovery of Web services in a socially intelligent manner. The novelty of our approach is that it combines the p2p architecture with the principles of the Social Web to enable autonomous, decentralized semantic annotation and maintenance of Web service descriptions, through the collective intelligence emerging by the social networking interactions between service providers and requesters.
Attention Selection with Self-supervised Competition Neural Network and Its Applications in Robot
Authors: Chenlei Guo, Liming Zhang
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

This paper proposes a novel attention selection system with competition neural network supervised by visual memory. As compared with others, this system can not only attend some salient regions randomly according to sensory information but also mainly focus on some learned objects by the visual memory. So it can be applied in robot self-localization or object tracking. The weights of neural networks can be adapted in real time to environment change.
Poincare based singularities detection algorithm in fingerprint classification
Authors: Liu Wei
Venue: Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing (2008)

Fingerprint classification is an important indexing method for any large scale fingerprint recognition system or database as a method for reducing the number of fingerprints that need to be searched. Singularities are the most important and reliable features in classification. This paper describes an improved rapid singularities searching algorithm which employees delta field Poincare index. The algorithm only searches the direction field which has the larger direction changes to get the singularities. Then a singularities detection post-processing method is used to increase the accuracy. The algorithm was tested on NIST-4 database and got a good performance.
Robust decision making using data envelopment analytic hierarchy process
Authors: Subramanian Nachiappan, Ramakrishnan Ramanathan
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

Need of robust multi criteria decision making techniques are becoming essential in day today life for decision makers to make appropriate decisions. This paper attempts to explore robustness through rank reversal properties of the Data Envelopment Analytic Hierarchy Process (DEAHP) in decision making. DEAHP uses the principles of Data Envelopment Analysis (DEA) to generate the local weights of elements from pairwise comparison matrices (PCM) and to compute the final weights in the Analytic Hierarchy Process (AHP). Though DEAHP was proposed relatively recently, it has been used in some practical applications by researchers worldwide. At the same time, it has also been criticised, especially on its rank reversal properties without much supporting evidence. Hence, simulation experiments were conducted to study the rank reversal properties of DEAHP, mainly drawing from similar experiments in the AHP literature. Randomly generated matrices of different sizes were used in the experiments. The results indicate that DEAHP possesses desirable rank reversal properties.