期刊文献+

基于赋权多段图的Web服务动态选取机制 被引量:1

A DYNAMIC WEB SERVICE SELECTING MECHANISM BASED ON WEIGHTED MULTISTAGE GRAPH
下载PDF
导出
摘要 针对Web服务组合中动态优化选取问题,设计了支持Web服务组合的Web服务评价模型和一个三层结构组织模型。在充分考虑Web服务之间的接口匹配问题的基础上,提出了一个基于赋权多段图最长路径选择策略的Web服务全局优化选取方法,并提出了动态规划、线性规划以及遗传算法进行Web服务动态优化选取。基于赋权多段图的Web服务优化选取方法,有效解决了Web服务组合中Web服务的接口匹配问题,使Web服务的选取更加准确。 Focusing on the dynamic optimization problem in Web service composition, a Web service evaluation module and a three-layer structured module in support of Web service mechanism are designed. The traditional problem of interface matching for Web services is well solved and an optimized algorithm is presented to dynamically select the maximum path based on weighted multistage graph, in which dynamic programming, linear programming and inheriting algorithm are illustrated respectively. The efficiency of interface matching for Web service composition and accuracy in Web service selecting can be significantly and effectively improved.
作者 张明鸣
出处 《计算机应用与软件》 CSCD 北大核心 2007年第8期131-132,143,共3页 Computer Applications and Software
关键词 WEB服务组合 优化选取 接口匹配 赋权多段图 Web service composition Optimized selecting Interface matching Weighted multistage graph
  • 相关文献

参考文献5

  • 1Budak Arpinar I,Boanerges Aleman Meza,Zhang Ruoyan,Angela Maduko.Ontology-Driven Web Services Composition Platform[A].IEEE International Conference on E-Commerce Technology(CEC'04)[C],July 06-09,2004.San Diego,California.
  • 2Zeng L,Benatallah B,Dumas M,Kalagnanam J,Sheng Q Z.Quality Driven Web Services Composition[A].Proc.12th Int'l Conf,World Wide Web(WWW)[C],May 2003.
  • 3Yu Tao,Lin Kwei Jay.Service Selection Algorithms for Web Services with End-to-end QoS Constraints[A].IEEE International Conference on E-Commerce Technology (CEC'04)[C],July 06-09,2004.San Diego,California.
  • 4Zeng Liangzhao,Boualem Benatallah,Member,IEEE,Anne H.H.Ngu,Marlon Dumas,Member,IEEE Computer Society,Jayant Kalagnanam,and Henry Chang.QoS-Aware Middleware for Web Services Composition[J].IEEE Transactions on Software Engineering,2004,30(5).
  • 5Boualem Benatallah,Sheng Quan Z,Marlon Dumas.The Self-Serv Environment for Web Services Composition[J].IEEE Internet Computing,2003,7(1,2):1,40-48.

同被引文献9

  • 1周益民,孙世新,田玲.一种实用的所有点对之间最短路径并行算法[J].计算机应用,2005,25(12):2921-2922. 被引量:16
  • 2隽志才,倪安宁,贾洪飞,李杰.两种策略下的最短路径并行算法研究与实现[J].系统工程理论方法应用,2006,15(2):123-127. 被引量:6
  • 3邵回祖.利用多线程技术实现最短路径的并行算法[J].微计算机信息,2007,23(21):236-237. 被引量:3
  • 4Bilodeaua G A, Shua Y, Cherietab F. Multistage graph-based segmenta- tion of thoracoscopic images [ J ]. Computerized Medical Imaging and Graphics,2006,30(8 ) :437 -446.
  • 5Hua Wang, Ling Tian, ChunHua Jiang. A practical parallel program al- gorithm for all-pair shortest path based on pipeling [ J ]. Journal of Elec- tronic Science and Technology of China. 2008,6 ( 3 ) :329 - 333.
  • 6Shi T, Jaehwan J. LEE. An O (L) parallel shortest path algorithm [ C ] //Proceedings of International Conference on Computer Design, 2009 Vegas Nevada,USA. CSREA Press,2009:119 -124.
  • 7Madduri K, Bader D A, Berry J W, et al. An Experimental Study of A Parallel Shortest Path Algorithm for Solving Large-Scale Graph In- stances[ C]//Proceeding of 9th Workshop on Algorithm Engineering and Experiments, New Orleans, LA, January 6,2007:23 -35.
  • 8Qiang Peng,Yulian Yu, Wenhong Wei. The Shortest Path Parallel Algo- rithm on Single Source Weighted Multi-level Graph[ C ] //Proceedings of 2nd International Workshop on Computer Science and Engineering. IEEE Computer Society, Washington, DC, USA,2009 ( 2 ) :308 - 311.
  • 9卢照,师军.并行最短路径搜索算法的设计与实现[J].计算机工程与应用,2010,46(3):69-71. 被引量:21

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部