ppxscal/embedding_network huggingface dataset:
Laser Pose Estimation and Tracking Using Fuzzy Extended Information Filtering for an Autonomous Mobile Robot
Authors: Hung-Hsing Lin, Ching-Chih Tsai
Venue: Journal of Intelligent and Robotic Systems (2008)

This paper presents methodologies and techniques for posture estimation and tracking of an autonomous mobile robot (AMR) using a laser scanner with at least three retro-reflectors. A three-point laser triangulation method is presented to find an initial posture of the robot and then a fuzzy extended information filtering (FEIF) method is used to improve the accuracy of the robot's posture estimation. With the odometric information from the driving wheels, a FEIF-based posture tracking algorithm is proposed to continuously keep trace of the robot's posture at slow speeds. Simulation and experimental results are conducted to show the efficacy and usefulness of the proposed methods.
A New Approach to Outlier Detection
Authors: Lancang Yang, Bing Shi, Xueqin Zhang, Lei Qiao
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

For many data mining applications, finding the rare instances or the outliers is more interesting than finding the common patterns. At present, many automated outlier detection methods are available, however, most of those are limited by assumptions of a distribution or require upper and lower predefined boundaries in which the data should exist. Whereas a distribution is often unknown, and enough information may not exist about a set of data to be able to determine reliable upper and lower boundaries. For these cases, a new dissimilarity function was defined, which can be viewed as fitness function of genetic algorithm, and a GA-based outlier detection method was formed in this paper. This method allows for detection of multiple outliers, not just one at a time. The illustrations show that the improved approach can automatically detect outliers, and performs better than GLOF approach.
BPEL4Job: A Fault-Handling Design for Job Flow Management
Authors: Wei Tan, Liana Fong, Norman Bobroff
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

Workflow technology is an emerging paradigm for systematic modeling and orchestration of job flow for enterprise and scientific applications. This paper introduces BPEL4Job, a BPEL-based design for fault handling of job flow in a distributed computing environment. The features of the proposed design include: a two-stage approach for job flow modeling that separates base flow structure from fault-handling policy, a generic job proxy that isolates the interaction complexity between the flow engine and the job scheduler, and a method for migrating flow instances between different flow engines for fault handling in a distributed system. An implementation of the design based on a set of industrial products from IBM is presented and validated using a Montage application.
A SCORM Compliant e-learning Platform for Cervical Cancer Prevention
Authors: Stathis Th. Konstantinidis, Anastasia Kitsou, Panagiotis D. Bamidis, Themistoklis Mikos, Menelaos Zafrakas, Maria M. Nikolaidou, Costas Pappas, Theodoros Agorastos
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

Cervical cancer is the second most common cause of cancer deaths in women around the world. The primary underlying cause is infection with high risk type(s) of the human papillomavirus (HPV). In this paper, a framework of developing an e-learning platform with standardized educational material about prevention of uterine cervical cancer and management of precancerous lesions is provided. As technological evolutions during the last decades along with the appearance of international educational standards affect incrementally every facet of education, numerous medical courses will have to be implemented online, and in compliance with SCORM. This paper outlines the efforts undertaken within the Medical School of AUTH to provide such e-courses to GPs. The main conclusion drawn from the first pilot evaluations indicate that learners are capable and ready to use such e-learning technologies.
Investigation of Calibration Techniques in Video Based Eye Tracking System
Authors: Nerijus Ramanauskas, Gintautas Daunys, Donatas Dervinis
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Exact calibration in real time is critical for gaze control systems. Five different calibration techniques were investigated: a standard calibration using linear and second order models (9 and 25 points); 2D mapping with interpolation; a mapping with developed model, describing eye image formation process. Results show that there is no significant difference between polynomial calibration method and a mapping with developed model. Calibration using model has an advantage, because there is no need to follow a whole calibration points each time. The point of gaze accuracy achieved during experiments is less than 1 degree.
Integration of GRID Superscalar and GridWay Metascheduler with the DRMAA OGF Standard
Authors: R. M. Badia, D. Du, E. Huedo, A. Kokossis, I. M. Llorente, R. S. Montero, M. Palol, R. Sirvent, C. Vázquez
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

This paper shares the experiences with one of the BEinGRID pilots, BE14, from a technological point of view. The experiment has integrated GRID superscalar (as programming model) with GridWay (as metascheduler) through the DRMAA standard. Additionally, a portal based in GridSphere has been developed. The portal enables the management of the grid and the automatic deployment and monitoring of applications. This environment has been successfully used to speed up an application that enables new processes and products development in the Chemistry sector with considerable success.
Approximating Alternative Solutions
Authors: Michael Krüger, Harald Hempel
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

We study the approximability of alternative solutions for NP-problems. In particular, we show that approximating the second best solution is in many cases, such as MaxCut, MaxSat, Minimum Steiner Tree, and others, substantially easier than approximating a first solution. We prove that our polynomial-time approximation scheme for the second best solution of Minimum Steiner Tree is optimal. In contrast we also argue that for the problems Minimum Independent Dominating Set and Minimum Traveling Salesperson Problem a given optimal solution does not simplify finding a second best solution.
Privacy Risks in Trajectory Data Publishing: Reconstructing Private Trajectories from Continuous Properties
Authors: Emre Kaplan, Thomas B. Pedersen, Erkay Savaş, Yücel Saygın
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

Location and time information about individuals can be captured through GPS devices, GSM phones, RFID tag readers, and by other similar means. Such data can be pre-processed to obtain trajectories which are sequences of spatio-temporal data points belonging to a moving object. Recently, advanced data mining techniques have been developed for extracting patterns from moving object trajectories to enable applications such as city traffic planning, identification of evacuation routes, trend detection, and many more. However, when special care is not taken, trajectories of individuals may also pose serious privacy risks even after they are de-identified or mapped into other forms. In this paper, we show that an unknown private trajectory can be re-constructed from knowledge of its properties released for data mining, which at first glance may not seem to pose any privacy threats. In particular, we propose a technique to demonstrate how private trajectories can be re-constructed from knowledge of their distances to a bounded set of known trajectories. Experiments performed on real data sets show that the number of known samples is surprisingly smaller than the actual theoretical bounds.Keywords: Privacy, Spatio-temporal data, trajectories, data mining.
Influence of social relationships on multiagent persuasion
Authors: Katsunori Kadowaki, Kazuki Kobayashi, Yasuhiko Kitamura
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

Life-like agents have the potential to make e-shopping sites on the Web more attractive and persuasive; our interest is to determine how multiple life-like agents should behave as a team to persuade customers. To know how the social relationships among two agents and a human user impacts the effectiveness of persuasion from the viewpoint of the balance theory, we develop a multi-agent persuasion system. In the system, the agents construct a social relationship to the user, and they then try to persuade him/her to select items that they recommend. An evaluation shows that a balanced relationship yields better performance than an imbalanced one.
Robust 3D Watermarking Technique Using Eigendecomposition and Nonnegative Matrix Factorization
Authors: Emad E. Abdallah, A. Ben Hamza, Prabir Bhattacharya
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

We propose a robust 3D object watermarking technique based on spectral decomposition and nonnegative matrix factorization (NMF). The core idea behind our technique is to apply the NMF to small blocks of the spectral coefficient matrix of a 3D triangle mesh. The proposed scheme improves the performance of the data embedding system, perceptual invisibility and it is resistant to a variety of the most common attacks.
An Extension of MPML with Emotion Recognition Functions Attached
Authors: Xia Mao, Zheng Li, Haiyan Bao
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

In this paper, we discuss our research on the multimodal interaction markup language (MIML) which is an extension of multimodal presentation markup language (MPML). Different from MPML, MIML can describe not only the presentations of lifelike agents, but also their emotion detection capability with the facial expression recognition and speech emotion recognition functions attached. Emotional control on lifelike agents provided by MIML makes the human-agent interaction even more intelligent. With the MIML and functions we designed, web-based affective interaction can be described and generated easily.
Face Recognition with VG-RAM Weightless Neural Networks
Authors: Alberto F. Souza, Claudine Badue, Felipe Pedroni, Elias Oliveira, Stiven Schwanz Dias, Hallysson Oliveira, Soterio Ferreira Souza
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

Virtual Generalizing Random Access Memory Weightless Neural Networks (Vg-ram wnn) are effective machine learning tools that offer simple implementation and fast training and test. We examined the performance of Vg-ram wnn on face recognition using a well known face database--the AR Face Database. We evaluated two Vg-ram wnn architectures configured with different numbers of neurons and synapses per neuron. Our experimental results show that, even when training with a single picture per person, Vg-ram wnn are robust to various facial expressions, occlusions and illumination conditions, showing better performance than many well known face recognition techniques.
Semantic Interoperability in Archaeological Datasets: Data Mapping and Extraction Via the CIDOC CRM
Authors: Ceri Binding, Keith May, Douglas Tudhope
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

Findings from a data mapping and extraction exercise undertaken as part of the STAR project are described and related to recent work in the area. The exercise was undertaken in conjunction with English Heritage and encompassed five differently structured relational databases containing various results of archaeological excavations. The aim of the exercise was to demonstrate the potential benefits in cross searching data expressed as RDF and conforming to a common overarching conceptual data structure schema - the English Heritage Centre for Archaeology ontological model (CRM-EH), an extension of the CIDOC Conceptual Reference Model (CRM). A semi-automatic mapping/extraction tool proved an essential component. The viability of the approach is demonstrated by web services and a client application on an integrated data and concept network.
Reduction of location estimation error using neural networks
Authors: Aylin Aksu, Joseph Kabara, Michael B. Spring
Venue: Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments (2008)

The objective of this work is to estimate the locations of Bluetooth enabled devices. Collecting received signal strength from a device may help with estimating its location. However, for indoor environments, the signal attenuation model becomes complex and difficult to represent concisely due to multi-path and small-scale fading effects. The flexible modeling and learning capabilities of neural networks provide lower errors in determining the position even in the presence of these destructive effects. A standard backpropagation learning algorithm was employed to minimize the error between target and estimated locations in order to find the weights of the links of the neural network. Simulation results show that a neural network with three input units and 8 hidden layer units and two output units can provide 75cm root mean square (RMS) error.
Scalable multimedia documents for digital radio
Authors: Benoit Pellan, Cyril Concolato
Venue: Proceeding of the eighth ACM symposium on Document engineering (2008)

In this paper, we demonstrate the adaptation of multimedia digital radio services in broadcast environments based on scalable multimedia documents. The authoring of our multimedia services relies on the Scalable MSTI model that decomposes multimedia documents into three ordered dimensions: Spatial, Temporal and Interactive descriptions. Our demonstration shows Scalable MSTI multimedia documents that can be adapted to typical T-DMB digital radio usage scenarios.
An Accessible Media Player as a User Agent for the Web
Authors: A. Mourouzis, N. Partarakis, C. Doulgeraki, C. Galanakis, C. Stephanidis
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

This paper presents webLection,a tool that aims at increasing the uptake of the Web by a variety of potential users. With WebLection Web content is locally rendered into standard audio formats, and, ultimately, manipulated just like music employing the playing list behaviour as an intuitive interaction metaphor. Although webLection originates from research for blind Web users, significant benefits emerge for other types users too, including Web developers, since it can be used, on the one hand, to easily transform and make Web content available through its audio equivalent, and on the other hand to inspect the accessibility and usability of Web pages for users of screen readers.
Interactive Coffee Tables: Interfacing TV within an Intuitive, Fun and Shared Experience
Authors: Radu-Daniel Vatavu, Stefan-Gheorghe Pentiuc
Venue: Proceedings of the 6th European conference on Changing Television Environments (2008)

Watching television is usually a shared experience allowing family or friends that share the same viewing interests to watch, comment and enjoy programs together. The interaction part however is at the opposite end being reduced to the traditional remote control which by itself proves very limited with respect to the sharing part: although the viewing experience is shared among the group, the control part of the interface only allows one-viewer-at-a-time interaction. We are discussing in this paper a new interaction technique for controlling the TV set using one commonly available shared wide-area interface: the coffee table. By visually designating interaction sensitive areas on the coffee table surface, television control may be achieved via simple hand movements across the surface which may be performed by any of the viewers at any time. The final interface is thus fun, simple, intuitive, and very important, wide-shareable and immediately available for all the participants.
Multi-domain lightpath authorization, using tokens
Authors: Leon Gommans, Li Xu, Yuri Demchenko, Alfred Wan, Mihai Cristea, Robert Meijer, Cees de Laat
Venue: Future Generation Computer Systems (2009)

This paper highlights the concepts and results of our research, leading to demonstrations during the period 2005-2007 to develop a flexible and simple access control model, and corresponding support tools to provision multi-domain optical network resources on demand. We introduce the general network resources provisioning model that extends the Generic AAA Authorisation sequences for multi-domain scenarios, and explain how token based access control and policy enforcement can be used during the provisioned resource access. To build a solid conceptual foundation for the proposed token, based access control, the paper revisits existing token definition and proposes a new definition in the context of our research. We subsequently show the use of tokens during different stages of the lightpath provisioning process. The paper identifies and describes two major scenarios in multidomain lightpath provisioning: the chain and tree approaches. The proposed token concept allows a simple combination of access control enforcement at different networking layers: the packet layer, the path layer, and the service layer. We end with a brief description of a few demonstrations that proves the proposed concepts and illustrates its acceptance by a wider networking community.
Managing Conditional and Composite CSPs
Authors: Malek Mouhoub, Amrudee Sukpan
Venue: Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence (2007)

Conditional CSPs and Composite CSPs have been known in the CSP discipline for fifteen years, especially in scheduling, planning, diagnosis and configuration domains. Basically a conditional constraint restricts the participation of a variable in a feasible scenario while a composite variable allows us to express a disjunction of variables or sub CSPs where only one will be added to the problem to solve. In this paper we combine the features of Conditional CSPs and Composite CSPs in a unique framework that we call Conditional and Composite CSPs (CCCSPs). Our framework allows the representation of dynamic constraint problems where all the information corresponding to any possible change are available a priori. Indeed these latter information are added to the problem to solve in a dynamic manner, during the resolution process, via conditional (or activity) constraints and composite variables. A composite variable is a variable whose possible values are CSP variables. In other words this allows us to represent disjunctive variables where only one will be added to the problem to solve. An activity constraint activates a non active variable (this latter variable will be added to the problem to solve) if a given condition holds on some other active variables. In order to solve the CCCSP, we propose two methods that are respectively based on constraint propagation and Stochastic Local Search (SLS). The experimental study, we conducted on randomly generated CCCSPs demonstrates the efficiency of a variant of the MAC strategy (that we call MAC+) over the other constraint propagation techniques. We will also show that MAC+ outperforms the SLS method MCRW for highly consistent CCCSPs. MCRW is however the procedure of choice for under constrained and middle constrained problems and also for highly constrained problems if we trade search time for the quality of the solution returned (number of solved constraints).
Skyline Index for Time Series Data
Authors: Quanzhong Li, Ines Fernando Vega Lopez, Bongki Moon
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

We have developed a new indexing strategy that helps overcome the curse of dimensionality for time series data. Our proposed approach, called Skyline Index, adopts new Skyline Bounding Regions (SBR) to approximate and represent a group of time series data according to their collective shape. Skyline bounding regions allow us to define a distance function that tightly lower bounds the distance between a query and a group of time series data. In an extensive performance study, we investigate the impact of different distance functions by various dimensionality reduction and indexing techniques on the performance of similarity search, including index pages accessed, data objects fetched, and overall query processing time. In addition, we show that, for k{\hbox{-}}{\rm{nearest}} neighbor queries, the proposed Skyline index approach can be coupled with the state of the art dimensionality reduction techniques such as Adaptive Piecewise Constant Approximation (APCA) and improve its performance by up to a factor of 3.
Para-Virtualized TPM Sharing
Authors: Paul England, Jork Loeser
Venue: Proceedings of the 1st international conference on Trusted Computing and Trust in Information Technologies: Trusted Computing - Challenges and Applications (2008)

We introduce a technique that allows a hypervisor to safely share a TPM among its guest operating systems. The design allows guests full use of the TPM in legacy-compliant or functionally equivalent form. The design also allows guests to use the authenticated-operation facilities of the TPM (attestation, sealed storage) to authenticate themselves and their hosting environment. Finally, our design and implementation makes use of the hardware TPM wherever possible, which means that guests can enjoy the hardware key protection offered by a physical TPM. In addition to superior protection for cryptographic keys our technique is also much simpler than a full soft-TPM implementation.An important contribution of this paper is to show that a current TCG TPM 1.2 compliant TPM can be multiplexed easily and safely between multiple guest operating systems. However, the peculiar characteristics of the TPM mean that certain features (in particular those that involve PCRs) cannot be exposed unmodified, but instead need to be exposed in a functionally equivalent para-virtualized form. In such cases we provide an analysis of our reasoning on the right balance between the accuracy of virtualization, and the complexity of the resulting implementation.
ω-Degree Spectra
Authors: Alexandra A. Soskova
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

We present a notion of a degree spectrum of a structure with respect to countably many sets, based on the notion of ¿-enumeration reducibility. We prove that some properties of the degree spectrum such as the minimal pair theorem and the existence of quasi-minimal degree are true for the ¿-degree spectrum. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player