4361176
SWARMS: A New Tool for Domain Exploration in Semantic Web
This paper is concerned with ?domain exploration?. By domain exploration, we mean searching for data on a specific domain which has been modeled by ontology. We have found that exploration needs on a domain can be categorized into data search and navigation, through an analysis of survey results. In our approach, the domain data is organized as instances of domain concepts. The instances are indexed and data search is conducted by index-based search which is also known the keyword based search. In data navigation, users can select an instance in the result of the index based search to display in visualization view. In visualization view, we use graph to visualize the instance and its context. By instance?s context, we mean that other instances which has relations between the selected one. Users can click a node in the graph to navigate to its visualization view. In visualization view, we provide constraint-based search, users can input properties? values to search for instances that has the input value in the certain properties. Other than index-based search, we provide association search for any two instances. By association of two instances, we mean that the possible direct relations and indirect relations between the two instances. In this paper, we will describe SWARMS? architecture, component technologies and its performance in FOAF domain, because FOAF(Friend-Of-A-Friend) [1] domain?s data size is largest among the three domains. The FOAF domain contains more than 90,000 persons and more than 100,000 publications of the people in the domain.
4370569
Using Bayesian decision for ontology mapping
Ontology mapping is the key point to reach interoperability over ontologies. In semantic web environment, ontologies are usually distributed and heterogeneous and thus it is necessary to find the mapping between them before processing across them. Many efforts have been conducted to automate the discovery of ontology mapping. However, some problems are still evident. In this paper, ontology mapping is formalized as a problem of decision making. In this way, discovery of optimal mapping is cast as finding the decision with minimal risk. An approach called Risk Minimization based Ontology Mapping (RiMOM) is proposed, which automates the process of discoveries on 1:1, n:1, 1:null and null:1 mappings. Based on the techniques of normalization and NLP, the problem of instance heterogeneity in ontology mapping is resolved to a certain extent. To deal with the problem of name conflict in mapping process, we use thesaurus and statistical technique. Experimental results indicate that the proposed method can significantly outperform the baseline methods, and also obtains improvement over the existing methods.
47246127
Enhancing Semantic Web by Semantic Annotation: Experiences in Building an Automatic Conference Calendar
Muhammad Abulaish, Jamia Millia Islamia, India Fabrizio Angiulli, Universita della Calabria, Italy Anupriya Ankolekar, Carnegie Mellon University, USA Martin Arlitt, HP Labs, USA Helen Ashman, University of South Australia, Australia Bruno Bachimont, Universite de Technologie de Compigne, France Salem Benferhat, Universite d'Artois, France Shlomo Berkovsky, University of Haifa, Israel Omar Boucelma, University of Aix-Marseille 3, France Patrick Brezillon, Universite Paris 6, France Cory Butz, University Of Regina, Canada Rajkumar Buyya, University of Melbourne, Australia Maria Claudia Buzzi, National Research Council, Italy Mario Cannataro, University of "Maria Graecia" Catanzaro, Italy Nick Cercone, Dalhousie University, Canada Liming Chen, University of Ulster, UK Yixin Chen, Washington University, USA William K. Cheung, Hong Kong Baptist University, Hong Kong Yiu-ming Cheung, Hong Kong Baptist University, Hong Kong Joongmin Choi, Hanyang University, Korea Ruth Cobos, Universidad Autonoma de Madrid, Spain Nigel Collier, National Institute of Informatics, Japan Juan Carlos Cubero, University of Granada, Spain Alfredo Cuzzocrea, DEIS-Unical, Italy Jos de Bruijn, University of Innsbruck, Austria Martine De Cock, Ghent University, Belgium Maarten de Rijke, ISLA, University of Amsterdam, The Netherlands Dominique Decouchant, Laboratoire LIG, France Jean-Yves Delort, Montpellier University, France Ying Ding, University of Innsbruck, Austria Yaniv Eytani, University of Illinois at Urbana-Champaign, USA Maria Covadonga Fernandez-Baizan, Technical University of Madrid, Spain Naoki Fukuta, Shizuoka University, Japan Maurizio Gabbrielli, University of Bologna, Italy Fabien Gandon, Institut de Recherche en Informatique de Toulouse, France Xiaoying Gao, Victoria University of Wellington, New Zealand
34234891
The Fuzzy PI Control for the DSTATCOM Based on the Balance of Instantaneous Power
The DSTATCOM regulates the voltage at the point of common coupling (PCC) by injecting reactive power to the PCC, making it meet the requirement of the voltage quality. First, this paper deduces from the balance theory of instantaneous power of the DSTATCOM system the direct output voltage control strategy, in which the current detection circuit is not demanded. Compared with the cascade control strategy, it has the merits of a simple structure and fast response, but it doesn't perform well when the parameters of the system are changed. So the paper proposes the fuzzy PI control to solve the problem. The validity and effectiveness of the control strategy has been verified by theoretical analysis and digital simulation.
29502101
The Stable Conditions of a Task-Pair with Helper-Thread in CMP
A movie film image projecting device wherein a movie film is intermittently stopped in a manner synchronized with rotation of a sprocket by means of travel-synchronizing holes which have been formed longitudinally with respect to the movie film and a light from a light source is projected on a stated region of the movie film at a stopped base position. Detectors for detecting at a plurality of locations the displacement of the film from the base position at the time the movie film has stopped, on the basis of the travel-synchronizing holes, output a different position detection signal corresponding to the deviation of the film from the base position at each of the plurality of locations. An abnormality judging circuit supplied with the position detection signals determines whether or not the position detection signals are abnormal and outputs an abnormality detection signal for each of the position detection signals which is determined to be abnormal. An optical axis correcting unit supplied with the position detection signals and the abnormality detection signals then corrects the optical axis of light transmitted through the movie film on the basis of the position detection signals which are judged by the abnormality judging means to be not abnormal.
12619937
Content-Based 3D Model Retrieval for Digital Museum
In this paper, we propose a new shape feature for shape-similarity search of 3D polygonal-mesh models in digital museum. The shape feature is an extension of the D2 shape functions proposed by Osada. Our proposed shape feature is a combination of geometry and texture which is also invariant to similarity transformation. Experiments showed that, our method achieved better performance improvement especially for appearance retrieval of 3d model.
7492825
Subdivision Interpolating Polygonization of Implicit Surfaces with Normal Meshes
Normal mesh is a new fundamental surface description, which is multiresolution mesh where each level can be written as a normal offset from a coarser version. In this paper, we present an algorithm to create normal subdivision triangulations approximating implicit surfaces. Our algorithm begins from a coarse base mesh created by a space-division based polygonization method for implicit surface, and the base mesh is then optimized by Laplacian smoothing operator. Subsequently, the faces of the base mesh are subdivided iteratively and the newly created vertices are located on the implicit surface along a certain direction, which depends on the normals of vertices of the faces. Finally, we obtain a piecewise-linear approximation of the surface, which is a normal mesh with subdivision connectivity and provides a multi-resolution description of the implicit surface naturally. Under the same error restriction, the mesh has much fewer data with respect to the traditional polygonization algorithms