ppxscal/embedding_network huggingface dataset:
An Influence Model for Reference Object Selection in Spatially Locative Phrases
Authors: Michael Barclay, Antony Galton
Venue: Proceedings of the international conference on Spatial Cognition VI: Learning, Reasoning, and Talking about Space (2008)

A comprehensive influence model for choosing a reference object in a spatially locative phrase is developed. The model is appropriate for a Bayesian network implementation and intended as a step toward machine learning of spatial language. It takes its structure from the necessary steps a listener must take in utilising spatial communication and contains as variables parameters derived from the literature concerning characteristics of landmarks for wayfinding as well as reference objects in general. Practical limitations on the implementation and training of the model are discussed.
Agents and Databases: A Symbiosis?
Authors: Heiko Schuldt
Venue: Proceedings of the 12th international workshop on Cooperative Information Agents XII (2008)

Over the last decades, data and information management has been subject to significant changes. Access to data and information is no longer provided by monolithic database systems. Rather, applications need to cope with an increasing number of heterogeneous and distributed data and information sources, ranging from traditional databases, large document collections and information sources on the Internet and the Semantic Web. This also affects the way data and information is searched, accessed, and processed. In particular, the agent community has addressed this change and has spawned the field of information agents. An information agent pro-actively searches, retrieves, accesses and maybe even processes information on behalf of its user. Also the database community has faced the challenges stemming from this change by making database functionality available even outside of database systems.In this paper, we review the recent developments in both fields and show examples of activities which lead to synergies in both communities and which emphasize on the potential for symbiotic co-existence.
Software architecture for dynamic adaptation of heterogeneous applications
Authors: Christine Louberry, Marc Dalmau, Philippe Roose
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

The recent apparition of mobile wireless sensor aware to their physical environment and able to process information must allow proposing applications able to take into account their physical context and to react according to the changes of the environment. It suppose to design applications integrating both software and hardware components able to communicate. Applications must use context information from components to measure the quality of the proposed services in order to adapt them in real time. This work is interested in the integration of sensors in distributed applications. It present a service oriented software architecture allowing to manage and reconfigure applications in heterogeneous environment where entities of different nature collaborate: software components and wireless sensors.
Roulette Sampling for Cost-Sensitive Learning
Authors: Victor S. Sheng, Charles X. Ling
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

In this paper, we propose a new and general preprocessor algorithm, called CSRoulette, which converts any cost-insensitive classification algorithms into cost-sensitive ones. CSRoulette is based on cost proportional roulette sampling technique (called CPRS in short). CSRoulette is closely related to Costing, another cost-sensitive meta-learning algorithm, which is based on rejection sampling. Unlike rejection sampling which produces smaller samples, CPRS can generate different size samples. To further improve its performance, we apply ensemble (bagging) on CPRS; the resulting algorithm is called CSRoulette. Our experiments show that CSRoulette outperforms Costing and other meta-learning methods in most datasets tested. In addition, we investigate the effect of various sample sizes and conclude that reduced sample sizes (as in rejection sampling) cannot be compensated by increasing the number of bagging iterations.
HP Distance Via Double Cut and Join Distance
Authors: Anne Bergeron, Julia Mixtacki, Jens Stoye
Venue: Proceedings of the 19th annual symposium on Combinatorial Pattern Matching (2008)

The genomic distance problem in the Hannenhalli-Pevzner theory is the following: Given two genomes whose chromosomes are linear, calculate the minimum number of inversions and translocations that transform one genome into the other. This paper presents a new distance formula based on a simple tree structure that captures all the delicate features of this problem in a unifying way.
Erratum: Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors
Authors: Jittat Fakcharoenphol, Boonserm Kijsirikul
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

There are errors in our paper "Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors," which appeared in ALT'05 [3]. The errors are related to our uses of union bounds. We briefly describe the problem and discuss which of our results can be shown to hold. We also provide a counter example for our previous claim in the full version of the erratum.
A Fault Tolerant Agent Communication Language for Supporting Web Agent Interaction
Authors: Nicola Dragoni, Mauro Gaspari, Davide Guidi
Venue: Agent Communication II: International Workshops on Agent Communication, AC 2005 and AC 2006, Utrecht, Netherlands, July 25, 2005, and Hakodate, Japan, May 9, 2006, Selected and Revised Papers (2006)

Agent Communication Languages (ACLs) have been developed to provide a way for agents to communicate with each other supporting cooperation in Multi-Agent Systems. In the past few years many ACLs have been proposed for Multi-Agent Systems and some standards emerged such as FIPA ACL or KQML. Despite these efforts, an important issue in the research on ACLs is still open and concerns how these languages should deal with failures of agents in asynchronous Multi-Agent Systems. The Fault Tolerant ACL presented in this paper addresses this issue providing knowledge-level fault tolerant communication primitives. To illustrate the potentiality of our ACL, we show how it can be effectively used to support fault tolerant Web agent interaction in common Web Service usage scenarios.
Mechanical Response of Young Canes of Wind-Blown Kiwifruit Vines
Authors: J. H. Kang, S. J. Lee
Venue: Journal of Visualization (2008)

Kiwifruit vines with broad leaves are easily torn or shed by high-speed wind. In this study, the threshold wind speed at which a cane is broken was investigated experimentally with varying physical parameters of a kiwifruit vine under two different ABL (atmospheric boundary layer) conditions. In addition, the temporal variation of wind-blown young canes was visualized using a high-speed camera. The average threshold wind speeds for ABL types A and B are about 20.5 m/s and 18.9 m/s, respectively. A wind-blown young cane takes periodic up-and-down motion when it is broken off. The mean fluttering frequency of young canes of the kiwifruit vines was found to be about 4.5 Hz.
Performance evaluation of finite difference and finite element methods applied to flexible thin plate for active vibration control
Authors: Ali Reza Tavakolpour, Intan Zaurah Mat Darus, Musa Mailah
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

This research presents an investigation into the performance evaluation of Finite Difference (FD) method in modeling a flexible rectangular thin plate structure for real-time application. Using FD method, an appropriate model of a thin plate was derived and the corresponding natural frequencies were estimated. Then, Finite Element (FE) modeling of the plate system was implemented using the ANSYS software and the corresponding modes of vibration were computed by modal analysis. The obtained vibration modes for both models were then evaluated and compared. The effectiveness of FD method for real time application were verified by comparative assessment of the obtained natural frequencies with the exact value reported by other researchers. The FD method was found to be the better choice than FE method to model a plate structure for real-time active vibration control.
Object Tracking Using Grayscale Appearance Models and Swarm Based Particle Filter
Authors: Bogdan Kwolek
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

We propose a hybrid tracking algorithm consisting of two trackers built on grayscale appearance models. In a first tracker we employ an object template that consists of several grayscale image patches. Every patch votes for the possible positions of the object undergoing tracking. A grayscale appearance model that is learned on-line is used in a supplementing tracker. A particle swarm optimization algorithm is utilized to shift particles toward more promising regions in the probability density function. Experimental results show that the hybrid tracker outperforms each of the trackers.
The mutiny: an interactive drama on IDtension
Authors: Nicolas Szilas
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

Mutiny is a piece of entertainment developed with IDtension, an Interactive Drama project initiated 10 years ago [1]. It is a major attempt to provide the user with a deep influence on the story, while maintaining some narrative quality.
Suboptimal Filter for Multisensor Linear Continuous-Time Systems with Uncertainties
Authors: Tyagi Deepak, Du Yong Kim, Vladimir Shin
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

The problem of estimation for uncertain multisensor linear continuous-time systems is considered. A new suboptimal filtering algorithm is proposed herein. The proposed algorithm is based on the fusion formula for an arbitrary number of local Kalman filters. Each local Kalman filter is fused by weighted sum with scalar weights in the proposed suboptimal filter. The real time implementation of the proposed filter is possible because the scalar weights do not depend on current observations unlike optimal adaptive filter. The given examples, demonstrate the effectiveness and high precision of proposed filter
Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness
Authors: Venkatesan Guruswami, Prasad Raghavendra
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)

We study the approximability of the MAX k-CSP problem over non-boolean domains, more specifically over {0,1,...,q ¿ 1} for some integer q. We extend the techniques of Samorodnitsky and Trevisan [19] to obtain a UGC hardness result when q is a prime. More precisely, assuming the Unique Games Conjecture, we show that it is NP-hard to approximate the problem to a ratio greater than q 2 k/q k . Independent of this work, Austrin and Mossel [2] obtain a more general UGC hardness result using entirely different techniques.We also obtain an approximation algorithm that achieves a ratio of C(q) ·k/q k for some constant C(q) depending only on q, via a subroutine for approximating the value of a semidefinite quadratic form when the variables take values on the corners of the q-dimensional simplex. This generalizes an algorithm of Nesterov [16] for the ±1-valued variables. It has been pointed out to us [15] that a similar approximation ratio can be obtained by reducing the non-boolean case to a boolean CSP.
Correcting a Space-Efficient Simulation Algorithm
Authors: Rob Glabbeek, Bas Ploeger
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of the same order as the size of the output of the algorithm. Of these, the one with the best time complexity exploits the representation of the simulation problem as a generalised coarsest partition problem. It is based on a fixed-point operator for obtaining a generalised coarsest partition as the limit of a sequence of partition pairs. We show that this fixed-point theory is flawed, and that the algorithm is incorrect. Although we do not see how the fixed-point operator can be repaired, we correct the algorithm without affecting its space and time complexity.
Reverse Correlation for Analyzing MLP Posterior Features in ASR
Authors: Joel Pinto, Garimella S. Sivaram, Hynek Hermansky
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

In this work, we investigate the reverse correlation technique for analyzing posterior feature extraction using an multilayered perceptron trained on multi-resolution RASTA (MRASTA) features. The filter bank in MRASTA feature extraction is motivated by human auditory modeling. The MLP is trained based on an error criterion and is purely data driven. In this work, we analyze the functionality of the combined system using reverse correlation analysis.
Nonlinear Pseudorandom Sequences Based on 90/150 LHGCA
Authors: Un-Sook Choi, Sung-Jin Cho, Han-Doo Kim, Yoon-Hee Hwang, Seoktae Kim
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

In a stream cipher the plaintext digits are encrypted one at a time, and the transformation of successive digits varies during the encryption. LFSRs produce sequences having large periods and good statistical properties, and are readily analyzed using algebraic techniques. But the output sequences of LFSRs are also easily predictable, if we know proper successive output sequences in output sequences. In this paper, we give a new method which generates nonlinear sequences using maximum-length cellular automata.
The Barcelogic SMT Solver
Authors: Miquel Bofill, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

This is the first system description of the Barcelogic SMT solver, which implements all techniques that our group has been developing over the last four years as well as state-of-the-art features developed by other research groups. We pay special attention to the theory solvers and to functionalities that are not common in SMT solvers.
2008 Special Issue: Imprecise correlated activity in self-organizing maps of spiking neurons
Authors: Francisco J. Veredas, Héctor Mesa, Luis A. Martínez
Venue: Neural Networks (2008)

How neurons communicate with each other to form effective circuits providing support to functional features of the nervous system is currently under debate. While many experts argue the existence of sparse neural codes based either on oscillations, neural assemblies or synchronous fire chains, other studies defend the necessity of a precise inter-neural communication to arrange efficient neural codes. As it has been demonstrated in neurophysiological studies, in the visual pathway between the retina and the visual cortex of mammals, the correlated activity among neurons becomes less precise as a direct consequence of an increase in the variability of synaptic transmission latencies. Although it is difficult to measure the influence of this reduction of correlated firing precision on the self-organization of cortical maps, it does not preclude the emergence of receptive fields and orientation selectivity maps. This is in close agreement with authors who consider that codes for neural communication are sparse. In this article, integrate-and-fire neural networks are simulated to analyze how changes in the precision of correlated firing among neurons affect self-organization. We observe how by keeping these changes within biologically realistic ranges, orientation selectivity maps can emerge and the features of neuronal receptive fields are significantly affected.
Hyponymy Extraction and Web Search Behavior Analysis Based on Query Reformulation
Authors: Rui P. Costa, Nuno Seco
Venue: Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence (2008)

A web search engine log is a very rich source of semantic knowledge. In this paper we focus on the extraction of hyponymy relations from individual user sessions by examining, search behavior. The results obtained allow us to identify specific reformulation models as ones that more frequently represent hyponymy relations. The extracted relations reflect the knowledge that the user is employing while searching the web. Simultaneously, this study leads to a better understanding of web user search behavior.
The Development of the Technique of Computer Simulating Color-Schlieren
Authors: Long-De Guo, Long Zhang
Venue: Journal of Visualization (2004)

The computer simulation study for color-schlieren is to provide a new method for validations between experiment and theory, which can get color-schlieren image from the computational flow field data. This paper gives a brief description about the theory of method, technical way, algorithm, key problem that has been solved, the computational results and the future development direction.
Ontology-driven, unsupervised instance population
Authors: Luke K. McDowell, Michael Cafarella
Venue: Web Semantics: Science, Services and Agents on the World Wide Web (2008)

The Semantic Web's need for machine understandable content has led researchers to attempt to automatically acquire such content from a number of sources, including the web. To date, such research has focused on ''document-driven'' systems that individually process a small set of documents, annotating each with respect to a given ontology. This article introduces OntoSyphon, an alternative that strives to more fully leverage existing ontological content while scaling to extract comparatively shallow content from millions of documents. OntoSyphon operates in an ''ontology-driven'' manner: taking any ontology as input, OntoSyphon uses the ontology to specify web searches that identify possible semantic instances, relations, and taxonomic information. Redundancy in the web, together with information from the ontology, is then used to automatically verify these candidate instances and relations, enabling OntoSyphon to operate in a fully automated, unsupervised manner. A prototype of OntoSyphon is fully implemented and we present experimental results that demonstrate substantial instance population in three domains based on independently constructed ontologies. We show that using the whole web as a corpus for verification yields the best results, but that using a much smaller web corpus can also yield strong performance. In addition, we consider the problem of selecting the best class for each candidate instance that is discovered, and the problem of ranking the final results. For both problems we introduce new solutions and demonstrate that, for both the small and large corpora, they consistently improve upon previously known techniques.
Low-cost accelerometry-based posture monitoring system for stroke survivors
Authors: Sonia Arteaga, Jessica Chevalier, Andrew Coile, Andrew William Hill, Serdar Sali, Sangheeta Sudhakhrisnan, Sri H. Kurniawan
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

This paper reports a low-cost autonomous wearable accelerometry-based posture monitoring system for stroke survivors. The hardware part of the system consists of monitoring devices, each of which comprises of a three-axial accelerometer and a beeper, LED light and vibrator to provide redundant modes of inappropriate posture warnings that would hopefully trigger self-correction. The inappropriate posture data are stored in an EEPROM. The software part of the system downloads, analyzes and presents the data in graphical format to enable a carer or therapist to quickly glance at the durations, frequency and locations of inappropriate postures.
Study on How to Build Global Computing Overlay Network
Authors: RongHua Du, AiPing Li
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

We describe a peer-to-peer self-organizing overlay network for our global computing system. The preliminary simulation results show that the network has some small-world characteristics such as higher clustering coefficient and short path length, which leads to an efficient heuristic task scheduling algorithm on which any volunteer peer with limited knowledge about its neighbors can dispatch its excrescent computation tasks to the more powerful nodes globally, in a way contrary to the current global computing system in which a global broker is responsible for the task scheduling. We argue that our approach is a start point to eliminate the broker component which makes these systems unscalable.
Flip Error Resistant Stitching in Sensor Network Localizations
Authors: Oh-Heum Kwon, Ha-Joo Song
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

In patch-and-stitch localization algorithms, a fliperror refers to the kind of error in which a patch is stitched to the map as being wrongly reflected. In this paper, we present an anchor-free localization algorithm which tries to detect and prevent flip errors. The flip error prevention is achieved by two filtering mechanisms: the flip-ambiguity test and the flip-conflict detection. We evaluate the performances of proposed techniques though simulations and show that they achieve significant performance improvements.
Integrating and Accessing Medical Data Resources within the ViroLab Virtual Laboratory
Authors: Matthias Assel, Piotr Nowakowski, Marian Bubak
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

This paper presents the data access solutions which have been developed in the ViroLab Virtual Laboratory infrastructure to enable medical researchers and practitioners to conduct experiments in the area of HIV treatment. Such experiments require access to a number of geographically distributed data sets (residing at various hospitals) with heavy focus on integration and security issues. Scientists conducting virtual experiments need to be able to manipulate such distributed data in a consistent and secure manner. We describe the main components of the Virtual Laboratory framework being devoted to data access and explain how data is processed in the presented environment.
MPSQAR: Mining Quantitative Association Rules Preserving Semantics
Authors: Chunqiu Zeng, Jie Zuo, Chuan Li, Kaikuo Xu, Shengqiao Ni, Liang Tang, Yue Zhang, Shaojie Qiao
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

To avoid the loss of semantic information due to the partition of quantitative values, this paper proposes a novel algorithm, called MPSQAR, to handle the quantitative association rules mining. And the main contributions include: (1) propose a new method to normalize the quantitative values; (2) assign a weight for each attribute to reflect the values distribution; (3) extend the weight-based association model to tackle the quantitative values in association rules without partition; (4) propose a uniform method to mine the traditional binary association rules and quantitative association rules; (5) show the effectiveness and scalability of new method by experiments.