ISCAS OpenIR
Reusing Service Process Fragments with a Consensus Between Service Providers and Users
Yang, R; Li, B; Wang, J; Li, ZY; Hu, Y
2016
SourceCHINESE JOURNAL OF ELECTRONICS
ISSN1022-4653
Volume25Issue:4Pages:648-657
English AbstractRecent years have witnessed a rapid growth in using Web services for data publishing and sharing among organizations. To improve the efficiency of software development and economize on human and material resources, service reuse is viewed as a powerful means which will not only reuse atomic services, but also reuse arbitrary granularities of Service process fragments (SPFs). However, effectively reusing arbitrary granularities of SPFs has not been solved yet, let alone taking diverse QoS preferences of service providers and users into account. In this paper, we propose a novel method of SPF reuse, named SCKY, based on the Cocke-Kasami-Younger (CKY) algorithm. We first present an extended CKY to do SPF-query. Then we address how to do SPF-query by a probability CKY, i.e., return a SPF with maximum emergence probability. Finally, we explore the SPF-query with a consensus of QoS preferences between service providers and users. Through a set of experiments, the effectiveness and robustness of our approach are evaluated.; Recent years have witnessed a rapid growth in using Web services for data publishing and sharing among organizations. To improve the efficiency of software development and economize on human and material resources, service reuse is viewed as a powerful means which will not only reuse atomic services, but also reuse arbitrary granularities of Service process fragments (SPFs). However, effectively reusing arbitrary granularities of SPFs has not been solved yet, let alone taking diverse QoS preferences of service providers and users into account. In this paper, we propose a novel method of SPF reuse, named SCKY, based on the Cocke-Kasami-Younger (CKY) algorithm. We first present an extended CKY to do SPF-query. Then we address how to do SPF-query by a probability CKY, i.e., return a SPF with maximum emergence probability. Finally, we explore the SPF-query with a consensus of QoS preferences between service providers and users. Through a set of experiments, the effectiveness and robustness of our approach are evaluated.
Indexed TypeSCI
KeywordCocke-kasami-younger Algorithm Service Reuse Service Process Fragment Qos Preferences
DepartmentWuhan Univ, Int Sch Software, Wuhan 430072, Peoples R China. Hubei Univ Sci & Technol, Coll Comp Sci & Technol, Xianning 437100, Peoples R China. Wuhan Univ, State Key Lab Software Engn, Wuhan 430072, Peoples R China. Wuhan Univ, Sch Comp, Wuhan 430072, Peoples R China. Univ Chinese Acad Sci, Inst Software, Sci & Technol Integrated Informat Syst Lab, Beijing 100190, Peoples R China.
Language英语
WOS IDWOS:000379796700009
Citation statistics
Content Type期刊论文
URIhttp://ir.iscas.ac.cn/handle/311060/17321
Collection中国科学院软件研究所
Recommended Citation
GB/T 7714
Yang, R,Li, B,Wang, J,et al. Reusing Service Process Fragments with a Consensus Between Service Providers and Users[J]. CHINESE JOURNAL OF ELECTRONICS,2016,25(4):648-657.
APA Yang, R,Li, B,Wang, J,Li, ZY,&Hu, Y.(2016).Reusing Service Process Fragments with a Consensus Between Service Providers and Users.CHINESE JOURNAL OF ELECTRONICS,25(4),648-657.
MLA Yang, R,et al."Reusing Service Process Fragments with a Consensus Between Service Providers and Users".CHINESE JOURNAL OF ELECTRONICS 25.4(2016):648-657.
Files in This Item:
File Name/Size DocType Version Access License
07534902.pdf(710KB) 开放获取LicenseApplication Full Text
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Yang, R]'s Articles
[Li, B]'s Articles
[Wang, J]'s Articles
Baidu academic
Similar articles in Baidu academic
[Yang, R]'s Articles
[Li, B]'s Articles
[Wang, J]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Yang, R]'s Articles
[Li, B]'s Articles
[Wang, J]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.