We introduce the notion of a perfect process tree as a model for the full propagation of in formation in metacomputation. Starting with constant propagation we construct step-by-step the driving mechanism used in supercompila tion which ensures the perfect propagation of information. The concept of a simple supercompiler based on perfect driving coupled with a simple folding strategy is explain...

Towards a Generic Approach for Schema Matcher Selection: Leveraging User Preand Post-match Effort for Improving Quality and Time Performance Interoperability between applications or bridges between data sources are required to allow optimal information exchanges. Yet, some processes needed to bring this integration cannot be fully automatized due to their complexity. One of these processes is c...

In this paper we survey some of the major data structures for encoding Level Of Detail (LOD) models. We classify LOD data structures according to the dimensionality of the basic structural element they represent into point-, triangle-, and tetrahedron-based data structures. Within each class we will review single-level data structures, general data structures for LOD models based on irregular m...

As the critical dimension in optical lithography continues to shrink and integrated circuit masks become more complex, it is becoming more important to determine where the layout is affected the most by non-ideal process conditions. If the most problematic shapes can be identified and represented in a simple way, then these test patterns can be used to locate areas in any layout that are the mo...

In this paper we give a brief explanation of how Anchor Concept and Sub-Ontology based Ontology Matching (SOBOM) gets the alignment results at OAEI2009. SOBOM deal with the ontology from two different views: an ontology with is-a hierarchical structure ' O and an ontology with other relationships ' ' O . Firstly, from the ' O view, SOBOM starts with a set of anchor concepts provided by linguist...

This report presents a solution to the Simultaneous Localization and Mapping (SLAM) problem for a quadrotor in an office environment. We have implemented a robust, efficient Correlative Scan-Matcher[2] that is able to extract rigid body constraints between both successive and non-successive poses. These pose constraints are used to generate a map via an Exactly Sparse Delayed-State Filter[1]. W...

Due to the high heterogeneity of ontologies, a combination of many methods is necessary in order to discover correctly the semantic correspondences between their elements. An ontology matching tool can be seen as a collection of several matching components, each implementing a specific method dealing with a specific heterogeneity type (terminological, structural or semantic). In addition, a map...

In this paper we demonstrate the techniques for improved fingerprint recognition. We mainly focused on the study of decomposition of image, feature extraction and feature match. A fingerprint is the reproduction of fingertip impressions and produced when a finger is pressed against a smooth surface. The most evident structural characteristic of a fingerprint is its pattern of interleaved ridges...

Schema matching is the task of automatically computing correspondences between schema elements. A multitude of schema matching approaches exists for various scenarios using syntactic, semantic, or instance information. The schema matching problem is aggravated by the fact that models to be matched are often represented in different modeling languages, e.g. OWL, XML Schema, or SQL DDL. Consequen...