4332951
RiMOM: A Dynamic Multistrategy Ontology Alignment Framework
Ontology alignment identifies semantically matching entities in different ontologies. Various ontology alignment strategies have been proposed; however, few systems have explored how to automatically combine multiple strategies to improve the matching effectiveness. This paper presents a dynamic multistrategy ontology alignment framework, named RiMOM. The key insight in this framework is that similarity characteristics between ontologies may vary widely. We propose a systematic approach to quantitatively estimate the similarity characteristics for each alignment task and propose a strategy selection method to automatically combine the matching strategies based on two estimated factors. In the approach, we consider both textual and structural characteristics of ontologies. With RiMOM, we participated in the 2006 and 2007 campaigns of the Ontology Alignment Evaluation Initiative (OAEI). Our system is among the top three performers in benchmark data sets.
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.
2957538
WWW 2008 workshop on social web search and mining: SWSM2008
The invention relates to a method for the manufacture of diaphragms of fibrous potassium titanate and an organic binder for electrochemical cells and has as the object to develop such a method in such a direction that it allows the manufacture of diaphragms which are relatively thin but have, at the same time, a sufficient long-term chemical and mechanical stability at high operating temperatures. According to the invention, provision is made for this purpose to apply potassium titanate, together with polytetrafluoroethylene and a styrene-butadiene copolymer, from a suspension, to a screen with a mesh width between about 0.1 and 0.4 mm. The diaphragms made by the method according to the invention are suitable particularly as cover layers in fuel cells with an alkaline electrolyte.
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.
5652709
Multiple strategies detection in ontology mapping
Ontology mapping is the task of finding semantic relationships between entities (i.e. concept, attribute and relation) of two ontologies. In the existing literatures, many (semi-)automatic approaches have found considerable interest by combining several mapping strategies (namely multi-strategy mapping). However, experiments show that multi-strategy based mapping does not always outperform its single-strategy counterpart. We here mainly consider the following questions: For a new, unseen mapping task, should one use a multi-strategy or a single-strategy? And if the task is suitable for multi-strategy, then which strategies should be selected in the combined scenario? This paper proposes an approach of multiple strategies detection for ontology mapping. The results obtained so far show that multi-strategy detection improves both on precision and recall significantly.
32675845
Loss Minimization Based Keyword Distillation
Keywords provide rich semantic information for documents. It benefits many applications such as topic retrieval, document clustering, etc. However, there still exist a large amount documents without keywords. Manually assigning keywords to existing documents is very laborious. Therefore it is highly desirable to automate the process. Traditional methods are mainly based on a predefined controlled-vocabulary, which is limited by unknown words. This paper presents a new approach based on Bayesian decision theory. The approach casts keyword distillation to a problem of loss minimization. To determine which word can be assigned as keywords becomes a problem to estimate the loss. Feature selection is one of the most important issues in machine learning. Several plausible attributes are always be assigned as the learning features, but they are all based on the assumption of words' independence. Machine learning based on them dose not produce satisfactory results. In this paper, taking the words' context and linkages between words into account, we extend the work of feature selection. Experiments show that our approach significantly improves the quality of extracted keywords.
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
23010555
User Profile Management for Personalized Telecom Service
With the emergence of Information Communication Technology (ICT), enabling end users to take part in telecom service creation is critical for telecom operators. To stimulate the production of end user-generated services, the service platform should provide adaptation and personalization mechanisms to end users. We present a user profile repository approach that takes account of the personalization and adaptation of telecom service during creation and execution. It is shown how to interact with other components in order to enable creation, deployment and execution of services in a personalized way. We design the architecture of user profile repository, and implement a prototype to verify the functionality. We present how to use IETF XCAP (XML Configuration Access Protocol) protocol to handle user profiles data, and use SIP notification mechanism to subscribe user profiles data in the User Profile Repository.
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.