4357845
Path Similarity Based Directory Ontology Matching
In a directory ontology, only concepts and hypernym/hyponym relationships between them are defined. Directory ontologies are widely used in many real-world applications such as product catalogues and Web directories. The widely used heterogeneous directories also bring a big challenge for integration of them. Previously, little attentions have been paid attention to the problem in the research community. In this paper, we propose a path similarity based approach for directory ontology matching. We define the concept's local label and the concept's path label. Next, we propose a path similarity method, which combines the local label and path label information. Then, a top-down similarity flooding is utilized to improve the matching result. Our experimental results on the music genre ontologies show that the proposed method can achieve a precision of 78% and a recall of 66%, significantly outperforming the baseline method.
4301104
Discovering the staring people from social networks
In this paper, we study a novel problem of staring people discovery from social networks, which is concerned with finding people who are not only authoritative but also sociable in the social network. We formalize this problem as an optimization programming problem. Taking the co-author network as a case study, we define three objective functions and propose two methods to combine these objective functions. A genetic algorithm based method is further presented to solve this problem. Experimental results show that the proposed solution can effectively find the staring people from social networks.
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.
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.
4336661
Actively Learning Ontology Matching via User Interaction
Ontology matching plays a key role for semantic interoperability. Many methods have been proposed for automatically finding the alignment between heterogeneous ontologies. However, in many real-world applications, finding the alignment in a completely automatic way is highly infeasible . Ideally, an ontology matching system would have an interactive interface to allow users to provide feedbacks to guide the automatic algorithm. Fundamentally, we need answer the following questions: How can a system perform an efficiently interactive process with the user? How many interactions are sufficient for finding a more accurate matching? To address these questions, we propose an active learning framework for ontology matching, which tries to find the most informative candidate matches to query the user. The user's feedbacks are used to: 1) correct the mistake matching and 2) propagate the supervise information to help the entire matching process. Three measures are proposed to estimate the confidence of each matching candidate. A correct propagation algorithm is further proposed to maximize the spread of the user's "guidance". Experimental results on several public data sets show that the proposed approach can significantly improve the matching accuracy (+8.0% better than the baseline methods).
4317013
Verification of Web Service Conversations Specified in WSCL
This paper studies one of the standards about Web service conversations, the WSCL specification. We propose a method to verify conversations in WSCL. In this method we first propose using a translator to convert WSCL documents into promela, the modeling language of the model checker SPIN. Then, we run SPIN to check the conversation model against the correctness properties specified by the designer. A toolkit for WSCL verification is introduced at the end of this paper.
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.
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.
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.
207773102
Anisotropic Feature-Preserving Smoothing of 3D Mesh