ppxscal/embedding_network huggingface dataset:
Vehicle and Person Tracking in Aerial Videos
Authors: Jiangjian Xiao, Changjiang Yang, Feng Han, Hui Cheng
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)

This paper presents two tracking approaches from Sarnoff Corporation to detect moving vehicles and person in the videos taken from aerial platform or plane. In the first approach, we combine layer segmentation approach with background stabilization and post track refinement to reliably detect small moving objects at the relatively low processing speed. Our second approach employ a fast tracking algorithm that has been optimized for real-time application. To classify vehicle and person from the detected objects, a HOG (Hierarchy Of Gradient) based vehicle v.s. person classifier is designed and integrated with the tracking post-processing. Finally, we report the results of our algorithms on a large scale data set collected from VIVID program and the scores evaluated by NIST CLEAR program.
Overview of the ImageCLEFphoto 2007 Photographic Retrieval Task
Authors: Michael Grubinger, Paul Clough, Allan Hanbury, Henning Müller
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

The general photographic ad-hoc retrieval task of the ImageCLEF 2007 evaluation campaign is described. This task provides both the resources and the framework necessary to perform comparative laboratory-style evaluation of visual information retrieval from generic photographic collections. In 2007, the evaluation objective concentrated on retrieval of lightly annotated images, a new challenge that attracted a large number of submissions: a total of 20 participating groups submitted 616 system runs. This paper summarises the components used in the benchmark, including the document collection and the search tasks, and presents an analysis of the submissions and the results.
Hybrid universal handling systems for micro component assembly
Authors: Martin Freundt, Christian Brecher, Christian Wenzel
Venue: Microsystem Technologies (2008)

Highly sophisticated machining techniques make it possible to manufacture ultra precise micro components as small as 100&#x00a0;&#x03bc;m&#x00b3;. These micro components are normally mounted onto larger macroscopic components before being incorporated into, e.g., medical, telecommunication or sensor technology products. In view of the highly inflexible systems currently available, the work carried out by the Fraunhofer IPT with funding from the SFB&#x00a0;440 focuses on the development of a hybrid, universally applicable fine positioning system. The system consists of an assembly head which, with the aid of an integrated six-axis fine positioning unit and an integrated sensor unit for referencing the assembly position, gives a conventional positioning system such as an articulated robot arm the ability to perform highly precise micro assembly processes. This provides the context for the development work carried out by the Fraunhofer IPT into assembly head design concepts. The first step involved investigating the positioning behavior of a conventional articulated robot arm, and then analyzing the demands placed on the assembly head. This is followed by the development and optimization of the miniaturized guidance, actuator and sensor components that are needed for the construction of a robust, highly precise six-axis fine adjustment system. The result of this work includes a set of linear guides, the size of a matchbox, with air bearings. The prototype guides set up at the Fraunhofer IPT have a non-contact interface, which makes it possible to convey compressed air without friction or force.
Walras Competition Model, an Example of Global Optimization
Authors: Jonas Mockus
Venue: Informatica (2004)

Walras theory is well known and widely used in models of market economy. Various iterative methods are developed to search for the equilibrium conditions. In this paper a new approach is proposed and implemented where the search for Walras equilibrium is defined as a stochastic global optimization problem. This way random nature of customer arrivals is represented and the convergence to equilibrium is provided if equilibrium exists. This paper describes a part of a Web-based integrated system for scientific cooperation and distance graduate studies of theories of optimization, games and markets which aim is to provide researchers and graduate students with hands-on experience on effective use of software. The objectives are to provide a tool for scientific collaboration and to stimulate creative abilities of graduate students to work as independent researchers. The web-site http://soften.ktu.lt/&tilde;mockus includes a family of economic and finnacial models regarding them all as examples of the the general optimization theory.
Integrating Simple Unreliable Perceptions for Accurate Robot Modeling in the Four-Legged League
Authors: Tim Laue, Thomas Röfer
Venue: RoboCup 2006: Robot Soccer World Cup X (2006)

The perception and modeling of other robots has been a topic of minor regard in the Four-Legged League, because of the limited processing und sensing capabilities of the AIBO platform. Even the current world champion, the GermanTeam, abandoned the usage of a robot recognition. Nevertheless, accurate position estimates of other players will be needed in the future to accomplish tasks such as passing or applying adaptive tactics. This paper describes an approach for localizing other players in a robot's local environment by integrating different unreliable perceptions of robots and obstacles, which may be computed in a reasonable way. The approach is based on Gaussian distributions describing the models of the robots as well as the perceptions. The integration of information is realized by using Kalman filtering.
Introducing Objects through Refinement
Authors: Tim Mccomb, Graeme Smith
Venue: Proceedings of the 15th international symposium on Formal Methods (2008)

We present a strategy for using the existing theory of class refinement in Object-Z to introduce an arbitrary number of object instances into a specification. Since class refinement applies only to a single class, the key part of the strategy is the use of references to objects of the class being refined. Once object instances have been introduced through local class refinements in this way, they can be turned into foreign class instantiations through the application of straight-forward equivalence preserving transformations. We introduce a set of logical classifiers to allow for the precise determination of which parts of the specification logic must be moved into the foreign class.
Synonymous Chinese Transliterations Retrieval from World Wide Web by Using Association Words
Authors: Chung-Chian Hsu, Chien-Hsing Chen
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

We present a framework for mining synonymous transliterations from a set of Web pages collected via a search engine. An integrated statistical measure is proposed to form search keywords for a search engine in order to retrieve relevant Web snippets. We employ a scheme of comparing the similarity between two transliterations to aid in identifying synonymous transliterations. Experimental results show that the average number of harvesting synonymous transliterations is about 5.04 for an input transliteration. The retrieval results could be beneficial for constructing ontology, especially, in the domain of foreign person names.
Component-Interaction Automata Approach (CoIn)
Authors: Barbora Zimmerova, Pavlína Vařeková, Nikola Beneš, Ivana Černá, Luboš Brim, Jiří Sochor
Venue: The Common Component Modeling Example: Comparing Software Component Models (2007)

The aim of the CoIn approach (Component-Interaction Automata approach) is to create a framework for formal analysis of behavioural aspects of large scale component-based systems. For the modelling purpose, we use the Component-interaction automata language [1]. For the verification, we employ a parallel model-checker DiVinE [2], which is able to handle very large, hence more realistic, models of component-based systems. Verified properties, like consequences of service calls or fairness of communication, are expressed in an extended version of the Linear Temporal Logic CI-LTL.
An Intelligent RFID System for Improving Elderly Daily Life Independent in Indoor Environment
Authors: Kung-Ta Huang, Po-Yen Lin, Chih-Yen Chiang, Jui-Sheng Chang, Chih-Ning Huang, Chia-Tai Chan
Venue: Proceedings of the 6th international conference on Smart Homes and Health Telematics (2008)

Since elderly obliviousness causes social inconvenience and psychical complaint, elders often forget daily schedules and miss their personal belongings such pillboxes or keys. Recently, technological advancements have spurred various ideas and innovations to apply on elder independent living. In this article, we proposed an intelligent RFID (Radio Frequency Identification) system to assist elder living independent and improve aged quality of life.
Service Choreography and Orchestration with Conversations
Authors: Tevfik Bultan
Venue: Proceedings of the 19th international conference on Concurrency Theory (2008)

Service oriented computing provides technologies that enable multiple organizations to integrate their businesses over the Internet. Typical execution behavior in this type of distributed systems involves a set of autonomous peers interacting with each other through messages. Modeling and analysis of interactions among the peers is a crucial problem in this domain due to following reasons: 1) Organizations may not want to share the internal details of the services they provide to other organizations. In order to achieve decoupling among different peers, it is necessary to specify the interactions among different services without referring to the details of their local implementations. 2) Modeling and analyzing the global behavior of this type of distributed systems is particularly challenging since no single party has access to the internal states of all the participating peers. Desired behaviors have to be specified as constraints on the interactions among different peers since the interactions are the only observable global behavior. Moreover, for this type of distributed systems, it might be worthwhile to specify the interactions among different peers before the services are implemented. Such a top-down design strategy may help different organizations to better coordinate their development efforts.
A new characterization of graphic matroids
Authors: John Mighton
Venue: Journal of Combinatorial Theory Series B (2008)

We give a necessary and sufficient condition for a binary matroid to be graphic. The condition is very natural, but, unlike other similar results, it gives a trivial algorithm for testing graphicness.
Web Structure Mining by Isolated Stars
Authors: Yushi Uno, Yoshinobu Ota, Akio Uemichi
Venue: Algorithms and Models for the Web-Graph: Fourth International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers (2007)

The link structure of the Web is generally viewed as the webgraph, and web structure mining is a research area that mainly aims to find hidden communities in the Web and so on, by focusing on the webgraph. In this paper, we identify a common frequent substructure by observing the webgraph, and newly define it as an isolated star (i-star). We propose an efficient enumeration algorithm of i-stars, and try structure mining by enumerating them from the real web data. As a result, we observed that most of i-stars correspond to index structures in single domains, while some of them are verified to stand for useful communities, which implies the validity of i-stars as candidate substructure for structure mining. We also suggest that the notion of i-star can be a helpful tool for preprocessing the webgraph to have its succinct representation for further structure mining.
Audio Analysis of Human/Virtual-Human Interaction
Authors: Harold Rodriguez, Diane Beck, David Lind, Benjamin Lok
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

The audio of the spoken dialogue between a human and a virtual human (VH) is analyzed to explore the impact of H-VH interaction. The goal is to determine if conversing with a VH can elicit detectable and systematic vocal changes. To study this topic, we examined the H-VH scenario of pharmacy students speaking with immersive VHs playing the role of patients. The audio analysis focused on the students' reaction to scripted empathetic challenges designed to generate an unrehearsed affective response from the human. The responses were analyzed with software developed to analyze vocal patterns during H-VH conversations. The analysis discovered vocal changes that were consistent across participants groups and correlated with known H-H conversation patterns.
Exploring Content and Linkage Structures for Searching Relevant Web Pages
Authors: Darren Davis, Eric Jiang
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

This work addresses the problem of Web searching for pages relevant to a query URL. Based on an approach that uses a deep linkage analysis among vicinity pages, we investigate the Web page content structures and propose two new algorithms that integrate content and linkage analysis for more effective page relationship discovery and relevance ranking. A prototypical Web searching system has recently been implemented and experiments on the system have shown that the new content and linkage based searching methods deliver improved performance and are effective in identifying semantically relevant Web pages.
Evaluation of Graylevel-Features for Printing Technique Classification in High-Throughput Document Management Systems
Authors: Christian Schulze, Marco Schreyer, Armin Stahl, Thomas M. Breuel
Venue: Proceedings of the 2nd international workshop on Computational Forensics (2008)

The detection of altered or forged documents is an important tool in large scale office automation. Printing technique examination can therefore be a valuable source of information to determine a questioned documents authenticity. A study of graylevel features for high throughput printing technique recognition was undertaken. The evaluation included printouts generated by 49 different laser and 13 different inkjet printers. Furthermore, the extracted document features were classified using three different machine learning approaches. We were able to show that, under the given constraints of high-throughput systems, it is possible to determine the printing technique used to create a document.
Testing Systems Specified as Partial Order Input/Output Automata
Authors: Gregor V. Bochmann, Stefan Haar, Claude Jard, Guy-Vincent Jourdan
Venue: Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop (2008)

An Input/Output Automaton is an automaton with a finite number of states where each transition is associated with a single inpuf or output interaction. In [1], we introduced a new formalism, in which each transition is associated with a bipartite partially ordered set made of concurrent inputs followed by concurrent outputs. In this paper, we generalize this model to Partial Order Input/Output Automata (POIOA), in which each transition is associated with an almost arbitrary partially ordered set of inputs and outputs. This formalism can be seen as High-Level Messages Sequence Charts with inputs and outputs and allows for the specification of concurrency between inputs and outputs in a very general, direct and concise way. We give a formal definition of this framework, and define several conformance relations for comparing system specifications expressed in this formalism. Then we show how to derive a test suite that guarantees to detect faults defined by a POIOA-specific fault model: missing output faults, unspecified output faults, weaker precondition faults, stronger precondition faults and transfer faults.
Noisy Image Segmentation by a Robust Clustering Algorithm Based on DC Programming and DCA
Authors: Le Thi Hoai An, Le Hoai Minh, Nguyen Trong Phuc, Pham Dinh Tao
Venue: Proceedings of the 8th industrial conference on Advances in Data Mining: Medical Applications, E-Commerce, Marketing, and Theoretical Aspects (2008)

We present a fast and robust algorithm for image segmentation problems via Fuzzy C-Means (FCM) clustering model. Our approach is based on DC (Difference of Convex functions) programming and DCA (DC Algorithms) that have been successfully applied in a lot of various fields of Applied Sciences, including Machine Learning. In an elegant way, the FCM model is reformulated as a DC program for which a very simple DCA scheme is investigated. For accelerating the DCA, an alternative FCM-DCA procedure is developed. Moreover, in the case of noisy images, we propose a new model that incorporates spatial information into the membership function for clustering. Experimental results on noisy images have illustrated the effectiveness of the proposed algorithm and its superiority with respect to the standard FCM algorithm in both running-time and quality of solutions.
Visual Analysis of Classification Systems and Library Collections
Authors: Magnus Pfeffer, Kai Eckert, Heiner Stuckenschmidt
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

In this demonstration we present a visual analysis approach that addresses both developers and users of hierarchical classification systems. The approach supports an intuitive understanding of the structure and current use in relation to a specific collection. We will also demonstrate its application for the development and management of library collections.
A Unified Framework for Verification Techniques for Object Invariants
Authors: S. Drossopoulou, A. Francalanza, P. Müller, A. J. Summers
Venue: Proceedings of the 22nd European conference on Object-Oriented Programming (2008)

Object invariants define the consistency of objects. They have subtle semantics because of call-backs, multi-object invariants and subclassing. Several visible-state verification techniques for object invariants have been proposed. It is difficult to compare these techniques and ascertain their soundness because of differences in restrictions on programs and invariants, in the use of advanced type systems (e.g. ownership types), in the meaning of invariants, and in proof obligations.We develop a unified framework for such techniques. We distil seven parameters that characterise a verification technique, and identify sufficient conditions on these parameters which guarantee soundness. We instantiate our framework with three verification techniques from the literature, and use it to assess soundness and compare expressiveness.
Optimized Associative Memories for Feature Selection
Authors: Mario Aldape-Pérez, Cornelio Yáñez-Márquez, Amadeo José Argüelles-Cruz
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

Performance in most pattern classifiers is improved when redundant or irrelevant features are removed, however, this is mainly achieved by high demanding computational methods or successive classifiers construction. This paper shows how Associative Memories can be used to get a mask value which represents a subset of features that clearly identifies irrelevant or redundant information for classification purposes, therefore, classification accuracy is improved while significant computational costs in the learning phase are reduced. An optimal subset of features allows register size optimization, which contributes not only to significant power savings but to a smaller amount of synthesized logic, furthermore, improved hardware architectures are achieved due to functional units size reduction, as a result, it is possible to implement parallel and cascade schemes for pattern classifiers on the same ASIC.
A Step Towards Fault Tolerance for Multi-Agent Systems
Authors: Katia Potiron, Patrick Taillibert, Amal Fallah Seghrouchni
Venue: Languages, Methodologies and Development Tools for Multi-Agent Systems: First International Workshop, LADS 2007, Durham, UK, September 4-6, 2007. Revised Selected Papers (2008)

Robustness, through fault tolerance, is a property often put forward in order to advocate MAS. The question is: What is the first step to be fault tolerant? Obviously the answer is: to know faults. The claim of this paper is that existing fault classification suitable for distributed systems does not fit completely MAS needs among other things because of autonomy, the main characteristic of their components. Actually autonomy is the very distinctive concept of agents and has unquestionable worthwhile properties. But do these properties have no compensation?After these observations on the need for fault classification the question would be about its usages for fault tolerance.To answer these questions the paper will, after a short presentation of the fault classification which prevails in fault tolerance community, show that autonomy induces a need for significant extension to this classification. It will then make a special review of this extension and present some expectations with regard to the programing of fault tolerant MAS and the behavior of two general fault handlers.
Synchronization of Video Sequences from Free-Moving Cameras
Authors: Joan Serrat, Ferran Diego, Felipe Lumbreras, José Manuel Álvarez
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

We present a new method for the synchronization of a pair of video sequences and the spatial registration of all the temporally corresponding frames. This is a mandatory step to perform a pixel wise comparison of a pair of videos. Several proposals for video matching can be found in the literature, with a variety of applications like object detection, visual sensor fusion, high dynamic range and action recognition. The main contribution of our method is that it is free from three common restrictions assumed in previous works. First, it does not impose any condition on the relative position of the two cameras, since they can move freely. Second, it does not assume a parametric temporal mapping relating the time stamps of the two videos, like a constant or linear time shift. Third, it does not rely on the complete trajectories of image features (points or lines) along time, something difficult to obtain automatically in general. We present our results in the context of the comparison of videos captured from a camera mounted on moving vehicles.
Exploiting Morphological Query Structure Using Genetic Optimisation
Authors: Jose R. Pérez-Agüera, Hugo Zaragoza, Lourdes Araujo
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

In this paper we deal with two issues. First, we discuss the negative effects of term correlation in query expansion algorithms, and we propose a novel and simple method (query clauses) to represent expanded queries which may alleviate some of these negative effects. Second, we discuss a method to optimise local query expansion methods using genetic algorithms, and we apply this method to improve stemming. We evaluate this method with the novel query representation method and show very significant improvements for the problem of optimising stemming.