ppxscal/embedding_network huggingface dataset:
Head Pose Estimation by a Stepwise Nonlinear Regression
Authors: Kevin Bailly, Maurice Milgram, Philippe Phothisane
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

Head pose estimation is a crucial step for numerous face applications such as gaze tracking and face recognition. In this paper, we introduce a new method to learn the mapping between a set of features and the corresponding head pose. It combines a filter based feature selection and a Generalized Regression Neural Network where inputs are sequentially selected through a boosting process. We propose the Fuzzy Functional Criterion, a new filter used to select relevant features. At each step, features are evaluated using weights on examples computed using the error produced by the neural network at the previous step. This boosting strategy helps to focus on hard examples and selects a set of complementary features. Results are compared with three state-of-the-art methods on the Pointing 04 database. 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
Can You Be Persuaded? Individual Differences in Susceptibility to Persuasion
Authors: Maurits Kaptein, Panos Markopoulos, Boris Ruyter, Emile Aarts
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

Persuasive technologies are growing in popularity and many designers create systems which intentionally change users attitudes or behaviors. This study shows that peoples individual differences in susceptibility to persuasion, as implemented using the six persuasion principles proposed by Cialdini 2, relates to their compliance to a persuasive request which is accompanied by a persuasive cue. This result is a starting point for designers to start incorporating individual differences in susceptibility to persuasive cues in their adaptive persuasive systems.
Logical Step-Indexed Logical Relations
Authors: Derek Dreyer, Amal Ahmed, Lars Birkedal
Venue: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science (2009)

We show how to reason about "step-indexed" logical relations in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially to be an essential element of the method. Specifically, we define a logic LSLR, which is inspired by Plotkin and Abadi's logic for parametricity, but also supports recursively defined relations by means of the modal"later" operator from Appel et al.'s "very modal model" paper. We encode in LSLR a logical relation for reasoning(in-)equationally about programs in call-by-value System F extended with recursive types. Using this logical relation, we derive a useful set of rules with which we can prove contextual (in-)equivalences without mentioning step indices.
Exploring the urban environment with a camera phone: lessons from a user study
Authors: Norman Höller, Arjan Geven, Manfred Tscheligi, Lucas Paletta, Katrin Amlacher, Patrik Luley, Dusan Omercevic
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

We present a study investigating two novel mobile services supporting querying for information in the urban environment using camera equipped smart phones as well as two different ways to visualize results -- icon-based visualization and text-based visualization. Both applications enable the user to access information about an object by snapping a photo of it. We investigate how users would use a photo-based tourist guide in a free exploration setting in general as well as the acceptance/preference of two different ways to visualize results.
A Hypergraph Dictatorship Test with Perfect Completeness
Authors: Victor Chen
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

A hypergraph dictatorship test is first introduced by Samorodnitsky and Trevisan and serves as a key component in their unique games based ${\operatorname{PCP}}$ construction. Such a test has oracle access to a collection of functions and determines whether all the functions are the same dictatorship, or all their low degree influences are o(1). Their test makes q ¿ 3 queries, has amortized query complexity $1+O\left(\frac{\log q}{q}\right)$, but has an inherent loss of perfect completeness. In this paper we give an (adaptive) hypergraph dictatorship test that achieves both perfect completeness and amortized query complexity $1+O\left(\frac{\log q}{q}\right)$.
Comment on "Groverian entanglement measure and evolution of entanglement in search algorithm for n(= 3, 5)-qubit systems with real coefficients" (volume 6, number 4, August 2007), by Arti Chamoli and C. M. Bhandari
Authors: Preeti Parashar, Swapan Rana
Venue: Quantum Information Processing (2009)

We point out that the main results--the analytic expressions for the Groverian measure of entanglement, in the above mentioned paper are erroneous. The technical mistake of the paper is discussed. It is shown by an explicit example that the formula for calculating the Groverian measure yields $${G(|\psi\rangle)=0}$$ for some entangled states.
Parametric Modelling of a Flexible Plate Structure Using Artificial Immune System Algorithm
Authors: S. M. Salleh, M. O. Tokhi
Venue: Proceedings of the 8th International Conference on Artificial Immune Systems (2009)

Parametric modelling of dynamic systems may benefit from advantages of biologically-inspired immune system, which maintains its own system against dynamically changing environments through the interaction between lymphocytes and/or antibodies. In this paper, artificial immune system with clonal selection algorithm and artificial immune network are used to identify the unknown parameters characterising a flexible plate system. The identification is performed on basis of minimising the mean-squared output error and is assessed with correlation tests and in time and frequency domains. The approach is tested with three different disturbance signals. Simulation results demonstrate the potential of artificial immune system as promising technique with fast convergence and less computational time in comparison to binary-coded genetic algorithm.
A Trust-Based Access Control Model for Pervasive Computing Applications
Authors: Manachai Toahchoodee, Ramadan Abdunabi, Indrakshi Ray, Indrajit Ray
Venue: Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII (2009)

With the rapid growth in wireless networks and sensor and mobile devices, we are moving towards an era of pervasive computing. Access control is challenging in these environments. In this work, we propose a trust based approach for access control for pervasive computing systems. Our previously proposed belief based trust model is used to evaluate the trustworthiness of users. Fine-grained access control is achieved depending on the trust levels of users. We develop a class of trust-based access control models having very formal semantics, expressed in graph theory. The models differ with respect to the features they provide, and the types of the trust constraints that they can support.
Product Design Network Self-contextualization: Enterprise Knowledge-Based Approach and Agent-Based Technological Framework
Authors: Tatiana Levashova, Kurt Sandkuhl, Nikolay Shilov, Alexander Smirnov, Vladimir Tarasov
Venue: Proceedings of the 4th International Conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2009)

The paper introduces self-contextualization in a service infrastructure for product design networks as novel application field for multi-agent technology. The main contributions of this paper are (1) identification of requirements from product design networks to the supporting service infrastructure, (2) the use of enterprise knowledge modelling techniques for the representation of computable context models, (3) a technological framework based on agent technology for self-contextualization based on enterprise knowledge models.
New Smith Predictor and FRBF Neural Network Control for Networked Control Systems
Authors: Wencai Du, Feng Du
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

This A novel approach to random, time-variant network delay in the networked control systems (NCSs) and a controlled plant is proposed in this paper. The approach is a new Smith predictor combined with fuzzy radial basis function neural network (FRBFNN) control. It can identify the controlled plant and adaptively adjusts weights of the controller. Because new Smith predictor hides predictor model of the network delay into real network data transmission process, further the network delay no longer needs to be measured, identified or estimated on-line. Simultaneously, this new Smith predictor doesn’t include the prediction model of the controlled plant, thus it doesn’t need to know the exact mathematical model of the controlled plant beforehand. Thus, it is applicable to some occasions that network delays are the random, time-variant or uncertain, possibly large compared to one, even tens sampling periods, and there are data dropouts in the closed loop. Based on CSMA/AMP (CAN bus), the results of the simulation show the validity of the control scheme.
A Method for Proving Observational Equivalence
Authors: Véronique Cortier, Stéphanie Delaune
Venue: Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium (2009)

Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy (expressed as a reachability property) or authentication. There are however several security properties, which cannot be defined (or cannot be naturally defined) as trace properties and require the notion of observational equivalence. Typical examples are anonymity, privacy related properties or statements closer to security properties used in cryptography.In this paper, we consider the applied pi calculus and we show that for determinate processes, observational equivalence actually coincides with trace equivalence, a notion simpler to reason with.We exhibit a large class of determinate processes, called simple processes, that capture most existing protocols and cryptographic primitives. Then, for simple processes without replication nor else branch,we reduce the decidability of trace equivalence to deciding an equivalence relation introduced by M. Baudet. Altogether, this yields the first decidability result of observational equivalence for a general class of equational theories.
A Cluster-Based Mobility Model for Intelligent Nodes
Authors: Morteza Romoozi, Hamideh Babaei, Mahmood Fathy, Mojtaba Romoozi
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

The study of mobile Ad-hoc networks depends on understanding protocols from simulations, before being applied in a real world setting. To produce a real-world environment within which an ad hoc network can be formed among a set of nodes, there is a need for the development of a realistic, generic and comprehensive mobility model instead of random-based models. Previously, realistic mobility models such as Obstacle Mobility and Pathway Mobility Models have been proposed. In these models, there are pathways and obstacles that constrain the node movements and their signals, but they have not paid attention to movement pattern of the nodes in the pathways. In this paper, a new mobility model is proposed. It includes not only a realistic environment with obstacles and pathways but also intelligent nodes like the human beings who learn how to move in these pathways. Proposed mobility model consider variant type of the mobile node with different specification. This paper shows that various MANET environments and mobile nodes can be modeled based on this work.
Code Breaking for Automatic Speech Recognition
Authors: Frederick Jelinek
Venue: Proceedings of the 12th International Conference on Text, Speech and Dialogue (2009)

Practical automatic speech recognition is of necessity a (near) real time activity performed by a system whose structure is fixed and whose parameters once trained may be adapted on the basis of the speech that the system observed during recognition.However, in specially important situations (e.g., recovery of out-of-vocabulary words) the recognition task could be viewed as an activity akin to code-breaking to whose accomplishment can be devoted an essentially infinite amount effort. In such a case everything would be fair, including, for instance, the retraining of a language and/or acoustic model on the basis of newly acquired data (from the Internet!) or even a complete change of the recognizer paradigm.An obvious way to proceed is to use the basic recognizer to produce a lattice or confusion network and then do the utmost to eliminate ambiguity. Another possibility is to create a list of frequent confusions (for instance the pair IN and AND) and prepare a appropriate individual decision processes to resolve each when it occurs in test data. We will report on our initial code breaking effort.
A practical radiometric compensation method for projector-based augmentation
Authors: Xinli Chen, Xubo Yang, Shuangjiu Xiao, Meng Li
Venue: Proceedings of the 7th IEEE/ACM International Symposium on Mixed and Augmented Reality (2008)

Radiometric compensation has made it possible for a projector to display on ordinary surface with colors and textures. For previous methods, it’s necessary to calibrate both the projector and camera at first. The calibration can be time-consuming and needs to be redone once the system settings change. We present a method that simplifies the calibration process. As a result, the system is more practicable for ad-hoc setups.
Programming Verifiable Heterogeneous Agent Systems
Authors: Louise A. Dennis, Michael Fisher
Venue: Programming Multi-Agent Systems: 6th International Workshop, ProMAS 2008, Estoril, Portugal, May 13, 2008. Revised Invited and Selected Papers (2009)

Our overall aim is to provide a verification framework for practical multi-agent systems. To achieve practicality, we must be able to describe and implement heterogeneous multi-agent systems. To achieve verifiability, we must define semantics appropriately for use in formal verification. In this paper, we tackle the problem of implementing heterogeneous multi-agent systems in a semantically clear, and appropriate, way.
The geometric element transformation method for mixed mesh smoothing
Authors: Dimitris Vartziotis, Joachim Wipper
Venue: Engineering with Computers (2009)

The geometric element transformation method (GETMe) is a geometry-based smoothing method for mixed and non-mixed meshes. It is based on a simple geometric transformation applicable to elements bounded by polygons with an arbitrary number of nodes. The transformation, if applied iteratively, leads to a regularization of the polygons. Global mesh smoothing is accomplished by averaging the new node positions obtained by local element transformations. Thereby, the choice of transformation parameters as well as averaging weights can be based on the element quality which leads to high quality results. In this paper, a concept of an enhanced transformation approach is presented and a proof for the regularizing effect of the transformation based on eigenpolygons is given. Numerical examples confirm that the GETMe approach leads to superior mesh quality if compared to other geometry-based methods. In terms of quality it can even compete with optimization-based techniques, despite being conceptually significantly simpler.
Security Protocol Analysis Based on Rewriting Approximation
Authors: Nan Liu, Wen-ye Zhu, Yue-fei Zhu
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

TA4SP is a state-of-art tool of AVISPA that can automatically verify security protocol with unbounded number of parallel sessions. But it still has some limitations and can’t verify hierarchy of authentication automatically. In this paper, we use an approximation-based model to define security protocol and design an algorithm close to the real implementation to calculate the fix-point tree automata based on the tool TA4SP. A method is proposed for analyzing hierarchy of authentication properties as extension of TA4SP. We illustrate the effectiveness of this model with the example of NSPK protocol.
Evaluating Urban Expansion of Nanjing City Based on Remote Sensing and GIS
Authors: Zhixiang Yang, Xiufeng He, Zhiquan Hu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

This paper presents an integrated study of urban expansion in Nanjing City, Jiangsu Province of China, by using Geographical Information Systems (GIS) and remote sensing. Landsat TM/ETM+ images of 2000 and 2007 were used in this study. An improved method was proposed to extract urban built-up areas from the images, which was based on Normalized Difference Built-up Index (NDBI). The proposed method could remove sparse vegetation from the mapped results. Assisted by spatial analysis and statistic techniques of GIS, the spatial distribution of urban land-use was analyzed and the characteristics of urban land-use expansion were studied. The results revealed a notable urban growth from 2000 to 2007 in the study area, and the most active expansion parts were the northeast-southwest axial and the southeast area of the main city zone in Nanjing. Furthermore, the driving forces of urban spatial expansion were also discussed. By analyzing related socio-economic data, it was found that economic development and population growth were the main factors; government decision-making and natural environment also influenced the speed and direction of urban expansion in some degree.
Recovery planning for ambiguous cases in perceptual anchoring
Authors: Mathias Broxvall, Silvia Coradeschi, Lars Karlsson, Alessandro Saffiotti
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 3 (2005)

An autonomous robot using symbolic reasoning, sensing and acting in a real environment needs the ability to create and maintain the connection between symbols representing objects in the world and the corresponding perceptual representations given by its sensors. This connection has been named perceptual anchoring. In complex environments, anchoring is not always easy to establish: the situation may often be ambiguous as to which percept actually corresponds to a given symbol. In this paper. we extend perceptual anchoring to deal robustly with ambiguous situations by providing general methods for detecting them and recovering from them. We consider different kinds of ambiguous situations and present planning-based methods to recover from them. We illustrate our approach by showing experiments involving a mobile robot equipped with a color camera and an electronic nose.
The Application of Saftey Audit and Monitor Technology in Power Management
Authors: Chanjuan Liu, Yilei Wang, Tao Li
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

This paper give the applications of safety audit and monitor technology in power management system. This paper first introduce the audit technology and its working environment and then introduce the elopements of the system which including the design of monitoring module in Proxy and network capability, etc. And it also proposes the implement flow of these function models including the implement flow of security audit model and network monitoring model, it also gives the design and realization of IP address peculate model and monitoring module in Proxy.
A Parameter Free Approach for Clustering Analysis
Authors: Haiqiao Huang, Pik-Yin Mok, Yi-Lin Kwok, Sau-Chuen Au
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

In the paper, we propose a novel parameter free approach for clustering analysis. The approach needs not to make assumptions or define parameters on the cluster number or the results, while the clustered results are visually verified and approved by experimental work. For simplicity, this paper demonstrates the idea using Fuzzy C-Means (FCMs) clustering method, but the proposed open framework allows easy integration with other clustering methods. The method-independent framework generates optimal clustering results and avoids intrinsic biases from individual clustering methods. 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
On Distance-3 Matchings and Induced Matchings
Authors: Andreas Brandstädt, Raffaele Mosca
Venue: Graph Theory, Computational Intelligence and Thought: Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday (2009)

For a finite undirected graph G = (V,E) and positive integer k ¿ 1, an edge set M ¿ E is a distance-k matching if the mutual distance of edges in M is at least k in G. For k = 1, this gives the usual notion of matching in graphs, and for general k ¿ 1, distance-k matchings were called k-separated matchings by Stockmeyer and Vazirani. The special case k = 2 has been studied under the names induced matching (i.e., a matching which forms an induced subgraph in G) by Cameron and strong matching by Golumbic and Laskar in various papers.Finding a maximum induced matching is $\mathbb{NP}$-complete even on very restricted bipartite graphs but for k = 2, it can be done efficiently on various classes of graphs such as chordal graphs, based on the fact that an induced matching in G corresponds to an independent vertex set in the square L(G)2 of the line graph L(G) of G which, by a result of Cameron, is chordal for any chordal graph G.We show that, unlike for k = 2, for a chordal graph G, L(G)3 is not necessarily chordal, and finding a maximum distance-3 matching remains $\mathbb{NP}$-complete on chordal graphs. For strongly chordal graphs and interval graphs, however, the maximum distance-3 matching problem can be solved in polynomial time. Moreover, we obtain various new results for induced matchings.
Genetic Operator PSO with Information Reused Scheme and its Application in VRP
Authors: Huang Xiaoyan, Wen Zhan, Fu Kechang, Zhu Ming
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

For the sake of characters of logistics, Improved Genetic Operator based Particle Swarm Optimization (GOPSO) is proposed. An pseudo-continuous encoding algorithm are proposed to the GOPSO for the Vehicle routing problem(VRP), then information of all the particles is reserved and stored. The reserved information can be utilized to reform and update the particles, by which the efficiency of GOPSO is improved. The effectiveness and advantage of the proposed algorithm is demonstrated by the simulations.