{"title":"一种基于动态组合的Web服务发现算法","authors":"Fu-cun Zhang, Yan Wang, L. Wang","doi":"10.1109/SNPD.2007.400","DOIUrl":null,"url":null,"abstract":"The growing number of Web services has greatly placed pressure on discovering Web services. It is a very desiderate to solve the problem how we can discover Web services accurately. The paper proposes a method based on service composition by describing Web services with OWLS. We firstly analyzed the process model of the service. Then, we make matchmaking and return the result to the requester. Compared with the algorithms based on service profile, it has made use of the process model and taken the composition and repeating execution of Web services into consideration, which can discover the services accurately .The effectiveness of the algorithm is proved by us with experiment.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Web service discovery algorithm based on dynamic composition\",\"authors\":\"Fu-cun Zhang, Yan Wang, L. Wang\",\"doi\":\"10.1109/SNPD.2007.400\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The growing number of Web services has greatly placed pressure on discovering Web services. It is a very desiderate to solve the problem how we can discover Web services accurately. The paper proposes a method based on service composition by describing Web services with OWLS. We firstly analyzed the process model of the service. Then, we make matchmaking and return the result to the requester. Compared with the algorithms based on service profile, it has made use of the process model and taken the composition and repeating execution of Web services into consideration, which can discover the services accurately .The effectiveness of the algorithm is proved by us with experiment.\",\"PeriodicalId\":197058,\"journal\":{\"name\":\"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SNPD.2007.400\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SNPD.2007.400","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

Web服务数量的增长极大地增加了发现Web服务的压力。如何准确地发现Web服务是一个迫切需要解决的问题。通过使用owl描述Web服务,提出了一种基于服务组合的方法。首先分析了服务的流程模型。然后,我们进行配对并将结果返回给请求者。与基于服务概要的算法相比,该算法利用了流程模型,考虑了Web服务的组成和重复执行,能够更准确地发现服务,并通过实验证明了算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Web service discovery algorithm based on dynamic composition
The growing number of Web services has greatly placed pressure on discovering Web services. It is a very desiderate to solve the problem how we can discover Web services accurately. The paper proposes a method based on service composition by describing Web services with OWLS. We firstly analyzed the process model of the service. Then, we make matchmaking and return the result to the requester. Compared with the algorithms based on service profile, it has made use of the process model and taken the composition and repeating execution of Web services into consideration, which can discover the services accurately .The effectiveness of the algorithm is proved by us with experiment.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An RBF Network Based Beamformer for Mimo Wireless Communication Systems Tailoring Software Evolution Process Communication Optimization Algorithms based on Extend Data Flow Graph Improving Blind Equalization Algorithm for Wireless Communication Systems Speech Enhancement Employing Modified a Priori SNR Estimation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1