Dissertation > Excellent graduate degree dissertation topics show

Study of Semantic Web Service Discovery Algorithm Based on OWL-S

Author: TanChaoHong
Tutor: ZhangGuiZhu
School: Jiangnan University
Course: Applied Computer Technology
Keywords: Semantic Web Web services OWL-S Service Matching Algorithm of Matching
CLC: TP393.09
Type: Master's thesis
Year: 2011
Downloads: 112
Quote: 0
Read: Download Dissertation

Abstract

Web services are mainly composed of by publishing the service, service discovery and search, service bindings. As an integral part of web service, if you want to to quickly and accurately find the services in the numerous network services, an efficient and reliable service discovery technology is necessary. For today’s UDDI-based service discovery, there exist some defects of the low-precision and low-recall in the methods of semantic service, So introducing the concept of semantics in the service discovery has become a research hotspot. The current semantic Web service discovery methods, mostly concentrated in the match on the level of functional properties, but also select the method of particle size of a large class match.Since keyword-based UDDI framework can not support the semantics of information, Web Service Description Language WSDL can not effectively support the semantic description, resulting in inefficient. This paper introduces the description of OWL-S service language for the semantic annotation. As an ontology description language, OWL-S is able to describe the service function as a machine-understandable way, but there still exist some defects, such as the service can not describe the non-functional properties. This paper describes add non-functional properties on the basis of the existing service to expand its services, not only achieving the match between functional attributes and basic description of related services, but also achieving the match of the quality attributes of service and other non-functional attributes.At the same time, the paper describes a variety of services matching algorithm in the semantic service discovery. By introducing the DAML / UDDI classic matching algorithm, and on this basis, it analyzes the problems of algorithm and which is needed to improve. To increase the accuracy, introduced the precise number which is defined combining the concept of level matching.While making some improvements and additions to the relationship between different concept nodes in an ontology, proposed a weighted distance table of concept nodes, rich the computing of nodes. In addition to focusing on semantic similarity method based on semantic distance, adding attribute similarity algorithm and refinement algorithm of hierarchical node. In order to combine the respective advantages of the three algorithms proposed hybrid algorithm, introduced weighting factors to distinguish the focus of the three, makes it possible to more accurately discover services.Based on the model and framework of the existing service discovery, the paper describes a service discovery model based on semantic technology. Introducing the roughly process from the registration and release for service providers to the matching process between the requested services and the published services for the service requester in the service discovery framework.Finally, put forward a semantic service discovery and matching system, to realize the match of the published services and request services on the input and output functions to verify the algorithm and theory by the system.

Related Dissertations

CLC: > Industrial Technology > Automation technology,computer technology > Computing technology,computer technology > Computer applications > Computer network > General issues > The application of computer network
© 2012 www.DissertationTopic.Net Mobile