ppxscal/embedding_network huggingface dataset:
Feature Depth Observation for Image-based Visual Servoing: Theory and Experiments
Authors: Alessandro De Luca, Giuseppe Oriolo, Paolo Robuffo Giordano
Venue: International Journal of Robotics Research (2008)

In the classical image-based visual servoing framework, error signals are directly computed from image feature parameters, allowing, in principle, control schemes to be obtained that need neither a complete three-dimensional (3D) model of the scene nor a perfect camera calibration. However, when the computation of control signals involves the interaction matrix, the current value of some 3D parameters is requiredfor each considered feature, and typically a rough approximation of this value is used. With reference to the case of a point feature, for which the relevant 3D parameter is the depth Z, we propose a visual servoing approach where Z is observed and made available for servoing. This is achieved by interpreting depth as an unmeasurable state with known dynamics, and by building a non-linear observer that asymptotically recovers the actual value of Z for the selected feature. A byproduct of our analysis is the rigorous characterization of camera motions that actually allow such observation. Moreover, in the case of a partially uncalibrated camera, it is possible to exploit complementary camera motions in order to preliminarily estimate the focal length without knowing Z. Simulations and experimental results are presented for a mobile robot with an on-board camera in order to illustrate the benefits of integrating the depth observation within classical visual servoing schemes.
PROSA: P2P Resource Organisation by Social Acquaintances
Authors: Vincenza Carchiolo, Michele Malgeri, Giuseppe Mangioni, Vincenzo Nicosia
Venue: Agents and Peer-to-Peer Computing: 5th International Workshop, AP2PC 2006, Hakodate, Japan, May 9, 2006, Revised and Invited Papers (2006)

P2P overlay networks have been deeply studied in the last few years. The main problems of such networks are resources distribution and retrieving. In this paper is presented. It is based on a novel adaptive algorithm to build an efficient and semantically searchable P2P system. This algorithm is inspired by human relationships, since social communities possess some interesting properties (such as being "small---worlds") that allow fast and efficient routing of queries for resources.
Reliable Geographical Multicast Routing in Vehicular Ad-Hoc Networks
Authors: Maria Kihl, Mihail Sichitiu, Ted Ekeroth, Michael Rozenberg
Venue: Proceedings of the 5th international conference on Wired/Wireless Internet Communications (2007)

Vehicular ad-hoc networks (VANETs) offer a large number of new potential applications without relying on significant infrastructure. Many of these applications benefit from multi-hop relaying of information, thus requiring a routing protocol. Characteristics unique to VANETs (such as high mobility and the need for geographical addressing) make many conven tional ad hoc routing protocols unsuitable. Also, some envisioned applica tions have end-to-end QoS requirements. In this paper we propose a new multicast routing protocol specifically designed for VANETs. Its purpose is to provide a routing service for a future reliable transport protocol. We eval uate its performance using realistic network and traffic models. It is shown that it is possible to implement a reliable multicast routing protocol for VANETs.
Accessible Tourism Introduction to the Special Thematic Session
Authors: Franz Pühretmair, Dimitrios Buhalis
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

The Special Thematic Session is organized to provide a forum to discuss major issues related to Accessible Tourism, to identify existing barriers as well as technologies, strategies and approaches to promote Accessible Tourism. The more Information Communication Technologies and Assistive Technologies increase the potential to enable people with disabilities to take part in almost any area of life, the more eInclusion and eAccessibility become a common responsibility of the mainstream tourism industry. The European Commission appreciates this fact and therefore supports different activities to raise the awareness of the impact and the business opportunities that Accessible Tourism introduces. The forthcoming process of demographic ageing will lead to a growing number of tourists with needs for more accessibility and higher service quality also in tourism.
On the Implementation of a Fast Prime Generation Algorithm
Authors: Christophe Clavier, Jean-Sébastien Coron
Venue: Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems (2007)

A side-channel analysis of a cryptographic algorithm generally concentrates on the encryption or decryption phases, rarely on the key generation phase. In this paper, we show that, when not properly implemented, the fast prime generation algorithm proposed by Joye and Paillier at CHES 2006 is susceptible to side-channel analysis; its main application is the generation of RSA key-pairs for embedded platforms like smart-cards. Our attack assumes that some parity bit can be recovered through SPA when it appears in a branch condition. Our attack can be combined with Coppersmith's theorem to improve its efficiency; we show that for 1024-bit RSA moduli, one can recover the factorization of roughly 1/1000 of the RSA moduli.
E-Stream: Evolution-Based Technique for Stream Clustering
Authors: Komkrit Udommanetanakit, Thanawin Rakthanmanon, Kitsana Waiyamai
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

Data streams have recently attracted attention for their applicability to numerous domains including credit fraud detection, network intrusion detection, and click streams. Stream clustering is a technique that performs cluster analysis of data streams that is able to monitor the results in real time. A data stream is continuously generated sequences of data for which the characteristics of the data evolve over time. A good stream clustering algorithm should recognize such evolution and yield a cluster model that conforms to the current data. In this paper, we propose a new technique for stream clustering which supports five evolutions that are appearance, disappearance, self-evolution, merge and split.
Mitigation of Turbulence-Induced Scintillation Noise in Free-Space Optical Communication Links Using Kalman Filter
Authors: Chunyi Chen, Huamin Yang, Huilin Jiang, Jingtao Fan, Cheng Han, Ying Ding
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

Atmospheric turbulence causes fluctuation of the received light signal in free-space optical (FSO) communication links through atmosphere, impairing link performance. The propagation of light wave in atmospheric turbulence was studied, and the received signal was modeled. Then the optimum decision threshold model was derived for FSO communication links using intensity modulation with direct detection (IM/DD). The turbulence-induced signal fluctuation, i.e. scintillation noise, was modeled as multiplicative noise in the received signal. In order to mitigate the scintillation noise, an adaptive Kalman filter was used to predict the value of received signal and turbulence statistics. Based on the Kalman filter, the detection with adaptive decision threshold was realized. Finally, the performance of Kalman filter was calculated, and the results show the error between optimum decision threshold and adaptive decision threshold is smaller than 0.48%. Kalman filter is an effective tool to combat turbulence-induced scintillation noise.
Explicit Control of Service Execution to Support QoS-Based Grid Scheduling
Authors: Claudia Napoli, Maurizio Giordano
Venue: Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing (2008)

Grid scheduling is shifting from a system-centric approach towards a user-centric one, i.e. service provision is driven by both user and provider-dependent Quality-of-Service (QoS) requirements. In this scenario, the possibility to explicitly control the execution of services allows providers to make different decisions on the QoS they provide their services with according to the requirements of new service requests. In the present work an infrastructure that allows providers to dynamically adapt the execution of services according to both the changing conditions of the environment where they operate in, and the requirements of service users is presented. The infrastructure is based on program continuations to provide service schedulers with application-level primitives to handle suspension and resuming of service execution. The same primitives are also accessible as web service operations by consumer programs so allowing to change QoS parameters of requested services at run-time. This approach makes the proposed infrastructure a flexible and easily programmable middleware to experiment with different scheduling policies in service-oriented scenarios. As a case of study, we show that on top of a time-sharing low-level scheduling, a provider can adopt a high-level scheduling policy using service suspension and resuming primitives so that consumer priority requirements can be met at run-time.
Quasi-bicliques: Complexity and Binding Pairs
Authors: Xiaowen Liu, Jinyan Li, Lusheng Wang
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

Protein-protein interactions (PPIs) are one of the most important mechanisms in cellular processes. To model protein interaction sites, recent studies have suggested to find interacting protein group pairs from large PPI networks at the first step, and then to search conserved motifs within the protein groups to form interacting motif pairs. To consider noise effect and incompleteness of biological data, we propose to use quasi-bicliques for finding interacting protein group pairs. We investigate two new problems which arise from finding interacting protein group pairs: the maximum vertex quasi-biclique problem and the maximum balanced quasi-biclique problem. We prove that both problems are NP-hard. This is a surprising result as the widely known maximum vertex biclique problem is polynomial time solvable [16]. We then propose a heuristic algorithm which uses the greedy method to find the quasi-bicliques from PPI networks. Our experiment results on real data show that this algorithm has a better performance than a benchmark algorithm for identifying highly matched BLOCKS and PRINTS motifs.
Extractable Perfectly One-Way Functions
Authors: Ran Canetti, Ronny Ramzi Dakdouk
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

We propose a new cryptographic primitive, called extractable perfectly one-way (EPOW) functions. Like perfectly one-way (POW) functions, EPOW functions are probabilistic functions that reveal no information about their input, other than the ability to verify guesses. In addition, an EPOW function, f, guarantees that any party that manages to compute a value in the range of f "knows" a corresponding preimage.We capture "knowledge of preimage" by way of algorithmic extraction. We formulate two main variants of extractability, namely non-interactive and interactive. The noninteractive variant (i.e., the variant that requires non-interactive extraction) can be regarded as a generalization from specific knowledge assumptions to a notion that is formulated in general computational terms. Indeed, we show how to realize it under several different assumptions. The interactive- extraction variant can be realized from certain POW functions.We demonstrate the usefulness of the new primitive in two quite different settings. First, we show how EPOW functions can be used to capture, in the standard model, the "knowledge of queries" property that is so useful in the Random Oracle (RO) model. Specifically, we show how to convert a class of CCA2-secure encryption schemes in the RO model to concrete ones by simply replacing the Random Oracle with an EPOW function, without much change in the logic of the original proof. Second, we show how EPOW functions can be used to construct 3-round ZK arguments of knowledge and membership, using weaker knowledge assumptions than the corresponding results due to Hada and Tanaka (Crypto 1998) and Lepinski (M.S. Thesis, 2004). This also opens the door for constructing 3-round ZK arguments based on other assumptions.
Model-based schedulability analysis of safety critical hard real-time Java programs
Authors: Thomas Bøgholm, Henrik Kragh-Hansen, Petur Olsen, Bent Thomsen, Kim G. Larsen
Venue: Proceedings of the 6th international workshop on Java technologies for real-time and embedded systems (2008)

In this paper, we present a novel approach to schedulability analysis of Safety Critical Hard Real-Time Java programs. The approach is based on a translation of programs, written in the Safety Critical Java profile introduced in [21] for the Java Optimized Processor [18], to timed automata models verifiable by the Uppaal model checker [23]. Schedulability analysis is reduced to a simple reachability question, checking for deadlock freedom. Model-based schedulability analysis has been developed by Amnell et al. [2], but has so far only been applied to high level specifications, not actual implementations in a programming language. Experiments show that model-based schedulability analysis can result in a more accurate analysis than possible with traditional approaches, thus systems deemed non-schedulable by traditional approaches may in fact be schedulable, as detected by our analysis. Our approach has been implemented in a tool, named SARTS, successfully used to verify the schedulability of a real-time sorting machine consisting of two periodic and two sporadic tasks. SARTS has also been applied on a number of smaller examples to investigate properties of our approach.
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
Authors: Jiří Srba
Venue: Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems (2008)

Time dependant models have been intensively studied for many reasons, among others because of their applications in software verification and due to the development of embedded platforms where reliability and safety depend to a large extent on the time features. Many of the time dependant models were suggested as real-time extensions of several well-known untimed models. The most studied formalisms include Networks of Timed Automata which extend the model of communicating finite-state machines with a finite number of real-valued clocks, and timed extensions of Petri nets where the added time constructs include e.g. time intervals that are assigned to the transitions (Time Petri Nets) or to the arcs (Timed-Arc Petri Nets). In this paper, we shall semi-formally introduce these models, discuss their strengths and weaknesses, and provide an overview of the known results about the relationships among the models.
Sweep-to-CSG Conversion Using Pattern Recognition Techniques
Authors: Donald Vossler
Venue: IEEE Computer Graphics and Applications (1985)

A new algorithm gives the user a quick method for describing solid geometry, in terms of two-dimensional outlines that are swept through space. 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
Computer Search for Large Sets of Idempotent Quasigroups
Authors: Feifei Ma, Jian Zhang
Venue: Computer Mathematics: 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers (2008)

A collection of n ¿ 2 idempotent quasigroups of order n is called a large set if any two of them are disjoint, denoted by LIQ(n). While the existence of ordinary LIQ(n) has been extensively studied, the spectrums of large sets of idempotent quasigroups with various identities remain open, for example, large set of Steiner pentagon quasigroups of order 11 which is denoted by LSPQ(11). This paper describes some computer searching efforts seeking to solve such problems. A series of results are obtained, including the non-existence of LSPQ(11).
Towards an Ontology for Describing Emotions
Authors: Juan Miguel López, Rosa Gil, Roberto García, Idoia Cearreta, Nestor Garay
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

The study of emotion in human beings has traditionally been a research interest area in disciplines such as psychology and sociology. The appearance of affective computing paradigm has made it possible to include findings from these disciplines in the development of affective interfaces. Still, there is a lack of applications that take emotion related aspects into account. This situation is mainly due to the great amount of proposed theoretical models and the complexity of human emotions. Besides, the importance that mobile computing area is acquiring has made necessary to bear context related aspects in mind. The proposal presented in this paper is based on a generic ontology for describing emotions and their detection and expression systems taking contextual and multimodal elements into account. The ontology is proposed as a way to develop a formal model that can be easily computerized. Moreover, it is based on a standard, the Web Ontology Language (OWL), which also makes ontologies easily shareable and extensible. Once formalized as an ontology, the knowledge about emotions is used in order to make computers more accessible, personalised and adapted to user needs.
The ICSI RT07s Speaker Diarization System
Authors: Chuck Wooters, Marijn Huijbregts
Venue: Multimodal Technologies for Perception of Humans: International Evaluation Workshops CLEAR 2007 and RT 2007, Baltimore, MD, USA, May 8-11, 2007, Revised Selected Papers (2008)

In this paper, we present the ICSI speaker diarization system. This system was used in the 2007 National Institute of Standards and Technology (NIST) Rich Transcription evaluation. The ICSI system automatically performs both speaker segmentation and clustering without any prior knowledge of the identities or the number of speakers. Our system uses "standard" speech processing components and techniques such as HMMs, agglomerative clustering, and the Bayesian Information Criterion. However, we have developed the system with an eye towards robustness and ease of portability. Thus we have avoided the use of any sort of model that requires training on "outside" data and we have attempted to develop algorithms that require as little tuning as possible.The system is simular to last year's system [1] except for three aspects. We used the most recent available version of the beam-forming toolkit, we implemented a new speech/non-speech detector that does not require models trained on meeting data and we performed our development on a much larger set of recordings.
Associative Memories Applied to Pattern Recognition
Authors: Roberto A. Vazquez, Humberto Sossa
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

An associative memory (AM) is a special kind of neural network that allows associating an output pattern with an input pattern. In the last years, several associative models have been proposed by different authors. However, they have several constraints which limit their applicability in complex pattern recognition problems. In this paper we gather different results provided by a dynamic associative model and present new results in order to describe how this model can be applied to solve different complex problems in pattern recognition such as object recognition, image restoration, occluded object recognition and voice recognition.
System Call API Obfuscation (Extended Abstract)
Authors: Abhinav Srivastava, Andrea Lanzi, Jonathon Giffin
Venue: Proceedings of the 11th international symposium on Recent Advances in Intrusion Detection (2008)

We claim that attacks can evade the comprehension of security tools that rely on knowledge of standard system call interfaces to reason about process execution behavior. Our attack, called Illusion, will invoke privileged operations in a Windows or Linux kernel at the request of user-level processes without requiring those processes to call the actual system calls corresponding to the operations. The Illusion interface will hide system operations from user-, kernel-, and hypervisor-level monitors mediating the conventional system-call interface. Illusion will alter neither static kernel code nor read-only dispatch tables, remaining elusive from tools protecting kernel memory.
Collection Browsing through Automatic Hierarchical Tagging
Authors: Korinna Bade, Marcel Hermkes
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

In order to navigate huge document collections efficiently, tagged hierarchical structures can be used. For users, it is important to correctly interpret tag combinations. In this paper, we propose the usage of tag groups for addressing this issue and an algorithm that is able to extract these automatically for text documents. The approach is based on the diversity of content in a document collection. For evaluation, we use methods from ontology evaluation and showed the validity of our approach on a benchmark dataset.
Optimal feedrate scheduling for a reconfigurable lathe
Authors: A. Epureanu, F. B. Marin, V. Marinescu, M. Banu, I. Constantin
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

This paper presents a virtual machining algorithm that optimizes federate scheduling aiming to improve the efficiency of cutting process. The manufacturing machine considered is a reconfigurable machine, configured as lathe with a specific architecture. A geometric searching procedure is proposed to find the parameter values corresponding to cutter locations along tool path during generation of the final surface.
Effective Pattern Similarity Match for Multidimensional Sequence Data Sets
Authors: Seok-Lyong Lee, Deok-Hwan Kim
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

In this paper we present an effective pattern similarity match algorithm for multidimensional sequence data sets such as video streams and various analog or digital signals. To approximate a sequence of data points we introduce a trend vector that captures the moving trend of the sequence. Using the trend vector, our method is designed to filter out irrelevant sequences from a database and to find similar sequences with respect to a query. Experimental results show that it provides a lower reconstruction error and a higher precision rate compared to existing methods.