Mathematical model of interest matchmaking in electronic social networks

The problem of matchmaking in electronic social networks is formulated as an optimization problem. In particular, a function measuring the matching degree of fields of interest of a search profile with those of an advertising profile is proposed.Comment: 6 pages, 3 figure

Grid service discovery with rough sets

Copyright [2008] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.The computational grid is evolving as a service-oriented computing infrastructure that facilitates resource sharing and large-scale problem solving over the Internet. Service discovery becomes an issue of vital importance in utilising grid facilities. This paper presents ROSSE, a Rough sets based search engine for grid service discovery. Building on Rough sets theory, ROSSE is novel in its capability to deal with uncertainty of properties when matching services. In this way, ROSSE can discover the services that are most relevant to a service query from a functional point of view. Since functionally matched services may have distinct non-functional properties related to Quality of Service (QoS), ROSSE introduces a QoS model to further filter matched services with their QoS values to maximise user satisfaction in service discovery. ROSSE is evaluated in terms of its accuracy and efficiency in discovery of computing services

A Pragmatic Approach for the Semantic Description and Matching of Pervasive Resources

The increasing popularity of personal wireless devices has raised new demands for the efficient discovery of heterogeneous devices and services in pervasive environments. With the advancement of the electronic world, the diversity of available services is increasing rapidly. %This raises new demands for the efficient discovery and location of heterogeneous services and resources in dynamically changing environments. Traditional approaches for service discovery describe services at a syntactic level and the matching mechanisms available for these approaches are limited to syntactic comparisons based on attributes or interfaces. In order to overcome these limitations, there has been an increased interest in the use of semantic description and matching techniques to support effective service discovery. In this paper, we present a semantic matching approach to facilitate the discovery of device-based services in pervasive environments. The approach includes a ranking mechanism that orders services according to their suitability and also considers priorities placed on individual requirements in a request during the matching process. The solution has been systematically evaluated for its retrieval effectiveness and the results have shown that the matcher results agree reasonably well with human judgement. Another important practical concern is the efficiency and the scalability of the semantic matching solution. Therefore, we have evaluated the scalability of the proposed solution by investigating the variation in matching time in response to increasing numbers of advertisements and increasing request sizes, and have presented the empirical results

Towards business model and technical platform for the service oriented context-aware mobile virtual communities

The focus of existing virtual communities is centered on a particular product or social interaction and the role of mobile devices is restricted to exchange a limited amount of contents. Herewith we envisage that the upcoming virtual communities will exploit the potential of social interaction and context information to offer personalized services to its members and mobile devices will play a significant role in this process. As a step towards this direction, in this paper we propose a business model for the mobile virtual communities in which the mobile device takes on the role of a content producer and content consumer. Though there are a number of research issues which need to be addressed to realize such virtual communities, in this paper we focus on the service requirements, architecture and open source software implementation of a technical platform for the content producer and consumer mobile devices

A multimodal restaurant finder for semantic web

Multimodal dialogue systems provide multiple modalities in the form of speech, mouse clicking, drawing or touch that can enhance human-computer interaction. However, one of the drawbacks of the existing multimodal systems is that they are highly domain-specific and they do not allow information to be shared across different providers. In this paper, we propose a semantic multimodal system, called Semantic Restaurant Finder, for the Semantic Web in which the restaurant information in different city/country/language are constructed as ontologies to allow the information to be sharable. From the Semantic Restaurant Finder, users can make use of the semantic restaurant knowledge distributed from different locations on the Internet to find the desired restaurants

Two-fold Semantic Web service matchmaking – applying ontology mapping for service discovery

Semantic Web Services (SWS) aim at the automated discovery and orchestration of Web services on the basis of comprehensive, machine-interpretable semantic descriptions. Since SWS annotations usually are created by distinct SWS providers, semantic-level mediation, i.e. mediation between concurrent semantic representations, is a key requirement for SWS discovery. Since semantic-level mediation aims at enabling interoperability across heterogeneous semantic representations, it can be perceived as a particular instantiation of the ontology mapping problem. While recent SWS matchmakers usually rely on manual alignments or subscription to a common ontology, we propose a two-fold SWS matchmaking approach, consisting of (a) a general-purpose semantic-level mediator and (b) comparison and matchmaking of SWS capabilities. Our semantic-level mediation approach enables the implicit representation of similarities across distinct SWS by grounding service descriptions in so-called Mediation Spaces (MS). Given a set of SWS and their respective grounding, a SWS matchmaker automatically computes instance similarities across distinct SWS ontologies and matches the request to the most suitable SWS. A prototypical application illustrates our approach