Object-Oriented Similarity Measures for Semantic Web Service Matchmaking

The semantic annotation of Web services capabilities with ontological information aims at providing the neces-sary infrastructure for facilitating efficient and accurate service discovery. The main idea is to apply reasoning techniques over semantically enhanced Web service re-quests and advertisements in order to determine Web ser-vices that meet certain requirements. In this paper we present our work for introducing similarity measures in-spired from the domain of Object-Oriented paradigm for ontology concept matching. Our work focuses on the utili-zation of such measures over an Object-Oriented schema that is created through mapping rules of OWL constructs and semantics into the Object-Oriented model. The goal of the approach is to combine the Object-Oriented repre-sentation of the information and the reasoning over OWL semantics in order to enhance the retrieval of semanti-cally relevant, to some criteria, Web services

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

Efficient Retrieval of Web Services Using Prioritization and Clustering

WEB services are software entities that have a well defined interface and perform a specific task. Typical examples include services returning information to the user, such as news or weather forecast services. A web service is formally described in a standardized language (WSDL). The service description may include the parameters associated with web services like input , output and quality of service. As web services and service providers proliferate, there will be a large number of candidate, and likely competing, services for fulfilling a desired task. Hence, effective service discovery mechanisms are required for identifying and retrieving the most appropriate services. The main contributions of our paper are summarized as follows; we propose and implement a method for determining dominance relationships among service advertisements that simultaneously takes into consideration multiple PDM criteria. We introduce a method for prioritization and clustering web services based on similarity measures using efficient algorithms Keywords : Web Service , PDM , dominance score ,TKDD, clustering

OWLS-CSM: A Service Profile Based Similarity Framework for Web Service Discovery

This paper presents OWLS-CSM framework, an OWL-S Service Profile based framework for web service discovery in cloud environment. In the proposed framework, services are presented as advertisements; their concepts are semantically defined and described in a hierarchal ontology to facilitate service matchmaking. In matchmaking process advertisements and query are represented as objects and three levels of similarities are used, based on OWL-S Service Profile, to matching, namely taxonomical similarity, functional similarity and non-functional similarity. Milestone method is adopted in the matchmaking algorithm to match the concepts according to their position in the hierarchal ontology. The results obtained from OWLS-CSM are analyzed and compared with other similar works to prove and evaluate the efficiency of our work.

A Framework for Semantic Interoperability for Distributed Geospatial Repositories

Interoperable access of geospatial information across disparate geospatial applications has become essential. Geospatial data are highly heterogeneous -- the heterogeneity arises both at the syntactic and semantic levels. Finding and accessing appropriate data in such a distributed environment is an important research issue. The paper proposes a methodology for interoperable access of geospatial information based on Open Geospatial Consortium (OGC) specified standards. An architecture for integrating diverse geospatial data repositories has been proposed using service-based methodology. The semantic issues for discovery and retrieval of geospatial data over distributed geospatial services have also been proposed in the paper. The proposed architecture utilizes the ontological concepts for service description and subsequent discovery of services. An approach for semantic similarity assessment of geospatial services has been discussed

A service concept recommendation system for enhancing the dependability of semantic service matchmakers in the service ecosystem environment

A Service Ecosystem is a biological view of the business and software environment, which is comprised of a Service Use Ecosystem and a Service Supply Ecosystem. Service matchmakers play an important role in ensuring the connectivity between the two ecosystems. Current matchmakers attempt to employ ontologies to disambiguate service consumers’ service queries by semantically classifying service entities and providing a series of human computer interactions to service consumers. However, the lack of relevant service domain knowledge and the wrong service queries could prevent the semantic service matchmakers from seeking the service concepts that can be used to correctly represent service requests. To resolve this issue, in this paper, we propose the framework of a service concept recommendation system, which is built upon a semantic similarity model.This system can be employed to seek the concepts used to correctly represent service consumers’ requests, when a semantic service matchmaker finds that the service concepts that are eventually retrieved cannot match the service requests. Whilst many similar semantic similarity models have been developed to date, most of them focus on distance-based measures for the semantic network environment and ignore content-based measures for the ontology environment. For the ontology environment in which concepts are defined with sufficient datatype properties, object properties, and restrictions etc., the content of concepts should be regarded as an important factor in concept similarity measures. Hence, we present a novel semantic similarity model for the service ontology environment. The technical details and evaluation details of the framework are discussed in this paper

EXPRESS: Resource-oriented and RESTful Semantic Web services

This thesis investigates an approach that simplifies the development of Semantic Web services (SWS) by removing the need for additional semantic descriptions.The most actively researched approaches to Semantic Web services introduce explicit semantic descriptions of services that are in addition to the existing semantic descriptions of the service domains. This increases their complexity and design overhead. The need for semantically describing the services in such approaches stems from their foundations in service-oriented computing, i.e. the extension of already existing service descriptions. This thesis demonstrates that adopting a resource-oriented approach based on REST will, in contrast to service-oriented approaches, eliminate the need for explicit semantic service descriptions and service vocabularies. This reduces the development efforts while retaining the significant functional capabilities.The approach proposed in this thesis, called EXPRESS (Expressing RESTful Semantic Services), utilises the similarities between REST and the Semantic Web, such as resource realisation, self-describing representations, and uniform interfaces. The semantics of a service is elicited from a resource’s semantic description in the domain ontology and the semantics of the uniform interface, hence eliminating the need for additional semantic descriptions. Moreover, stub-generation is a by-product of the mapping between entities in the domain ontology and resources.EXPRESS was developed to test the feasibility of eliminating explicit service descriptions and service vocabularies or ontologies, to explore the restrictions placed on domain ontologies as a result, to investigate the impact on the semantic quality of the description, and explore the benefits and costs to developers. To achieve this, an online demonstrator that allows users to generate stubs has been developed. In addition, a matchmaking experiment was conducted to show that the descriptions of the services are comparable to OWL-S in terms of their ability to be discovered, while improving the efficiency of discovery. Finally, an expert review was undertaken which provided evidence of EXPRESS’s simplicity and practicality when developing SWS from scratch

A Dynamic Composition and Stubless Invocation Approach for Information-Providing Services

The automated specification and execution of composite services are important capabilities of service-oriented systems. In practice, service invocation is performed by client components (stubs) that are generated from service descriptions at design time. Several researchers have proposed mechanisms for late binding. They all require an object representation (e.g., Java classes) of the XML data types specified in service descriptions to be generated and meaningfully integrated in the client code at design time. However, the potential of dynamic composition can only be fully exploited if supported in the invocation phase by the capability of dynamically binding to services with previously unknown interfaces. In this work, we address this limitation by proposing a way of specifying and executing composite services, without resorting to previously compiled classes that represent XML data types. Semantic and structural properties encoded in service descriptions are exploited to implement a mechanism, based on the Graphplan algorithm, for the run-time specification of composite service plans. Composite services are then executed through the stubless invocation of constituent services. Stubless invocation is achieved by exploiting structural properties of service descriptions for the run-time generation of messages