In order to improve the effectiveness of semantic web service discovery, the semantic bias between an interface parameter and an annotation is reduced by extracting semantic restrictions for the annotation from the de...In order to improve the effectiveness of semantic web service discovery, the semantic bias between an interface parameter and an annotation is reduced by extracting semantic restrictions for the annotation from the description context and generating refined semantic annotations, and then the semantics of the web service is refined. These restrictions are dynamically extracted from the parsing tree of the description text, with the guide of the restriction template extracted from the ontology definition. New semantic annotations are then generated by combining the original concept with the restrictions and represented via refined concept expressions. In addition, a novel semantic similarity measure for refined concept expressions is proposed for semantic web service discovery. Experimental results show that the matchmaker based on this method can improve the average precision of discovery and exhibit low computational complexity. Reducing the semantic bias by utilizing restriction information of annotations can refine the semantics of the web service and improve the discovery effectiveness.展开更多
In order to achieve adaptive and efficient service composition, a task-oriented algorithm for discovering services is proposed. The traditional process of service composition is divided into semantic discovery and fun...In order to achieve adaptive and efficient service composition, a task-oriented algorithm for discovering services is proposed. The traditional process of service composition is divided into semantic discovery and functional matching and makes tasks be operation objects. Semantic similarity is used to discover services matching a specific task and then generate a corresponding task-oriented web service composition （TWC） graph. Moreover, an algorithm for the new service is designed to update the TWC. The approach is applied to the composition model, in which the TWC is searched to obtain an optimal path and the final service composition is output. Also, the model can implement realtime updating with changing environments. Experimental results demonstrate the feasibility and effectiveness of the algorithm and indicate that the maximum searching radius can be set to 2 to achieve an equilibrium point of quality and quantity.展开更多
To solve the bottleneck problem in centralized service discovery methods,a novel architecture based on domain ontology for semantic service discovery is proposed.This distributed architecture can adjust the domain par...To solve the bottleneck problem in centralized service discovery methods,a novel architecture based on domain ontology for semantic service discovery is proposed.This distributed architecture can adjust the domain partition and allocate system resources automatically.The characteristics of this mechanism are analyzed,including scalability,self-organization and adaptability.In this mechanism,semantic web service discovery is separated into two parts.First,under balance tree topology,registry proxy can rapidly forward requests to the objective registry center,and avoid the bottleneck problem.Secondly,a semantic distance based service matching algorithm is proposed to promote the effect of service searching.The results of simulation experiments show that the proposed mechanism can serve as a scalable solution for semantic web service publication and discovery.And the improved matching algorithm has higher recall and precision than other algorithms.展开更多
Semantic Web Services is an emerging technology that promises to enable dynamic, execution-time discovery, composition, and invocation of Web Services. Semantic matchmaking plays a vital role in the automated and dyna...Semantic Web Services is an emerging technology that promises to enable dynamic, execution-time discovery, composition, and invocation of Web Services. Semantic matchmaking plays a vital role in the automated and dynamic discovery process of Semantic Web Services and consists in measuring the semantic distance between a requested service and an advertised one. In this paper, an innovative approach to effectively compute the semantic distance between Ontology Web Language for Services （OWL-S） annotated services is proposed. First, an edge-based method for measuring the semantic distance between Web Ontology Language （OWL） concepts is presented. Then, a comparison of the proposed measure and the one presented in a recent related work is made in order to show that our method is more efficient and fine-grained. Finally, some equations to compute semantic matchmaking of service capabilities, which are expressed in terms of inputs and outputs, are presented.展开更多
基金the National Basic Research Program of China under Grant No.2005CB321800 (国家重点基础研究发展计划(973)) the National Natural Science Foundation of China under Grant Nos.90412011 60625203 (国家自然科学基金)
基金The National Basic Research Program of China (973Program)(No.2005CB321802)Program for New Century Excellent Talents in University (No. NCET-06-0926)the National Natural Science Foundation of China (No.60403050,90612009)
文摘In order to improve the effectiveness of semantic web service discovery, the semantic bias between an interface parameter and an annotation is reduced by extracting semantic restrictions for the annotation from the description context and generating refined semantic annotations, and then the semantics of the web service is refined. These restrictions are dynamically extracted from the parsing tree of the description text, with the guide of the restriction template extracted from the ontology definition. New semantic annotations are then generated by combining the original concept with the restrictions and represented via refined concept expressions. In addition, a novel semantic similarity measure for refined concept expressions is proposed for semantic web service discovery. Experimental results show that the matchmaker based on this method can improve the average precision of discovery and exhibit low computational complexity. Reducing the semantic bias by utilizing restriction information of annotations can refine the semantics of the web service and improve the discovery effectiveness.
基金The National Key Technology R&D Program of Chinaduring the 11th Five-Year Plan Period(No2007BAF23B0302)the Major Research Plan of the National Natural Science Foundation of China(No90818028)
文摘In order to achieve adaptive and efficient service composition, a task-oriented algorithm for discovering services is proposed. The traditional process of service composition is divided into semantic discovery and functional matching and makes tasks be operation objects. Semantic similarity is used to discover services matching a specific task and then generate a corresponding task-oriented web service composition （TWC） graph. Moreover, an algorithm for the new service is designed to update the TWC. The approach is applied to the composition model, in which the TWC is searched to obtain an optimal path and the final service composition is output. Also, the model can implement realtime updating with changing environments. Experimental results demonstrate the feasibility and effectiveness of the algorithm and indicate that the maximum searching radius can be set to 2 to achieve an equilibrium point of quality and quantity.
基金The National Basic Research Program of China(973 Program)(No.2010CB328104,2009CB320501)the National Natural Science Foundation of China(No.61070161,61070158,61003257, 61003311)+2 种基金the National Key Technology R&D Program during the 11th Five-Year Plan Period(No.2010BAI88B03)the Foundation of Jiangsu Provincial Key Laboratory of Netw ork and Information Security (No.BM2003201)Open Research Fund from Key Laboratory of Computer Netw ork and Information Integration of Ministry of Education (Southeast University)
文摘To solve the bottleneck problem in centralized service discovery methods,a novel architecture based on domain ontology for semantic service discovery is proposed.This distributed architecture can adjust the domain partition and allocate system resources automatically.The characteristics of this mechanism are analyzed,including scalability,self-organization and adaptability.In this mechanism,semantic web service discovery is separated into two parts.First,under balance tree topology,registry proxy can rapidly forward requests to the objective registry center,and avoid the bottleneck problem.Secondly,a semantic distance based service matching algorithm is proposed to promote the effect of service searching.The results of simulation experiments show that the proposed mechanism can serve as a scalable solution for semantic web service publication and discovery.And the improved matching algorithm has higher recall and precision than other algorithms.
文摘Semantic Web Services is an emerging technology that promises to enable dynamic, execution-time discovery, composition, and invocation of Web Services. Semantic matchmaking plays a vital role in the automated and dynamic discovery process of Semantic Web Services and consists in measuring the semantic distance between a requested service and an advertised one. In this paper, an innovative approach to effectively compute the semantic distance between Ontology Web Language for Services （OWL-S） annotated services is proposed. First, an edge-based method for measuring the semantic distance between Web Ontology Language （OWL） concepts is presented. Then, a comparison of the proposed measure and the one presented in a recent related work is made in order to show that our method is more efficient and fine-grained. Finally, some equations to compute semantic matchmaking of service capabilities, which are expressed in terms of inputs and outputs, are presented.
