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.
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.
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.
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.
4985005
Heterogeneous cross domain ranking in latent space
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in many real-world applications, in particular with the rapid growth of the Web 2.0, ranking over multiple interrelated (heterogeneous) domains becomes a common situation, where in some domains we may have a large amount of training data while in some other domains we can only collect very little. One important question is: "if there is not sufficient supervision in the domain of interest, how could one borrow labeled information from a related but heterogenous domain to build an accurate model?". This paper explores such an approach by bridging two heterogeneous domains via the latent space. We propose a regularized framework to simultaneously minimize two loss functions corresponding to two related but different information sources, by mapping each domain onto a "shared latent space", capturing similar and transferable oncepts. We solve this problem by optimizing the convex upper bound of the non-continuous loss function and derive its generalization bound. Experimental results on three different genres of data sets demonstrate the effectiveness of the proposed approach.
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
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.
27905715
Rebuild of King Fang 40 BC musical scales by He's inequality
He Chengtian s inequality is used to re-build the King Fang s musical scales 41/24 and 53/31 in 40 BC. The technology, which might be little known to the West, has been used for millennia by ancient Chinese, and can be powerfully applied to nonlinear problems. 2004 Elsevier Inc. All rights reserved.
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.
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.