Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services sele...Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.展开更多
A novel layered method was proposed to solve the problem of Web services composition.In this method,services composition problem was formally transformed into the optimal matching problem of every layer,then optimal m...A novel layered method was proposed to solve the problem of Web services composition.In this method,services composition problem was formally transformed into the optimal matching problem of every layer,then optimal matching problem was modeled based on the hypergraph theory,and solved by computing the minimal transversals of the hypergraph.Meanwhile,two optimization algorithms were designed to discard some useless states at the intermediary steps of the composition algorithm.The effectiveness of the composition method was tested by a set of experiments,in addition,an example regarding the travel services composition was also given.The experimental results show that this method not only can automatically generate composition tree whose leaf nodes correspond to services composition solutions,but also has better performance on execution time and solution quality by adopting two proposed optimization algorithms.展开更多
Web Services 是基于 Internet 进行分布式计算的基本元素,面向 Service 的计算将成为未来计算技术发展的趋势。但如何能够自动发现需要的 Service 资源,提高 Web Services 组合的智能化程度,是近来的研究热点之一。IRS-Ⅱ首先提出基于...Web Services 是基于 Internet 进行分布式计算的基本元素,面向 Service 的计算将成为未来计算技术发展的趋势。但如何能够自动发现需要的 Service 资源,提高 Web Services 组合的智能化程度,是近来的研究热点之一。IRS-Ⅱ首先提出基于任务本体的 Service 发布、发现和组合方法,可以说是将 Service 发现和组合从语法的层次提升到了语义的层次。本文首先深入分析了IRS-Ⅱ提出的方法及其体系结构,然后对 Web Services 的智能检索和服务组合的问题进行讨论。展开更多
基金Project(70631004)supported by the Key Project of the National Natural Science Foundation of ChinaProject(20080440988)supported by the Postdoctoral Science Foundation of China+1 种基金Project(09JJ4030)supported by the Natural Science Foundation of Hunan Province,ChinaProject supported by the Postdoctoral Science Foundation of Central South University,China
文摘Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.
基金Project(2010CB328101) supported by the National Basic Research Program of ChinaProject(2009AA01Z401) supported by the National High Technology Research and Development Program of China+4 种基金Projects(60803032,90818023) supported by the National Natural Science Foundation of ChinaProjects(09510701300,09JC1414200,09DZ1120403) supported by the Shanghai Science and Technology Commission,China"Shu Guang" Project(10SG23) supported by Shanghai Municipal Education Commission and Shanghai Education Development Foundation,ChinaProject(09QA1405800) supported by Shanghai Science and Technology Commission Rising-Star Program,ChinaProject(NCET-10-0598) supported by Program for New Century Excellent Talents in Chinese University
文摘A novel layered method was proposed to solve the problem of Web services composition.In this method,services composition problem was formally transformed into the optimal matching problem of every layer,then optimal matching problem was modeled based on the hypergraph theory,and solved by computing the minimal transversals of the hypergraph.Meanwhile,two optimization algorithms were designed to discard some useless states at the intermediary steps of the composition algorithm.The effectiveness of the composition method was tested by a set of experiments,in addition,an example regarding the travel services composition was also given.The experimental results show that this method not only can automatically generate composition tree whose leaf nodes correspond to services composition solutions,but also has better performance on execution time and solution quality by adopting two proposed optimization algorithms.
文摘Web Services 是基于 Internet 进行分布式计算的基本元素,面向 Service 的计算将成为未来计算技术发展的趋势。但如何能够自动发现需要的 Service 资源,提高 Web Services 组合的智能化程度,是近来的研究热点之一。IRS-Ⅱ首先提出基于任务本体的 Service 发布、发现和组合方法,可以说是将 Service 发现和组合从语法的层次提升到了语义的层次。本文首先深入分析了IRS-Ⅱ提出的方法及其体系结构,然后对 Web Services 的智能检索和服务组合的问题进行讨论。
