English  |  正體中文  |  简体中文  |  Items with full text/Total items : 26994/38795
Visitors : 2388491      Online Users : 36
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/44023

Title: A Graph-Based Approach to Web Service Matchmaking
Authors: Shang-Pin Ma
Jonathan Lee
Contributors: 國立臺灣海洋大學:資訊工程學系
NTOU:Department of Computer Science and Engineering
Keywords: Peer to peer computing
Arrays
Web services
Connectors
Semantics
Buildings
Handheld computers
Date: 2012-12
Issue Date: 2017-11-09T07:20:26Z
Publisher: In Proceedings of the 19th Asia-Pacific Software Engineering Conference (APSEC 2012)
Abstract: Abstract:Web service discovery is the process of locating web services to meet requirements of service requesters, and is an important ingredient in building loosely-coupled SOA-based applications. In this paper, we propose a graph-based web service matchmaking approach based on WSDL without additional meta data or annotations. We divide the service matchmaking approach into two principal themes: constructing request graphs (RG) and service signature graphs (SSG) and calculating distance and similarity between a RG and an SSG. There are three main benefits in the proposed approach: (1) the structure of a service and involved data types are considered in the matching process, (2) the providers do not need to spent considerable effort annotating the service description using tags or ontology models, and (3) both the crisp similarity and fuzzy similarity can be produced automatically.
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/44023
Appears in Collections:[資訊工程學系] 演講及研討會

Files in This Item:

File Description SizeFormat
index.html0KbHTML31View/Open


All items in NTOUR are protected by copyright, with all rights reserved.

 


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback