叶恒舟, 罗晓娟, 牛秦洲. Web服务请求输入闭包与可满足性分析[J]. 微电子学与计算机, 2011, 28(7): 168-170,174.
引用本文: 叶恒舟, 罗晓娟, 牛秦洲. Web服务请求输入闭包与可满足性分析[J]. 微电子学与计算机, 2011, 28(7): 168-170,174.
YE Heng-zhou, LUO Xiao-juan, NIU Qin-zhou. Web Service Request Input Closure and Satisfiability Analysis[J]. Microelectronics & Computer, 2011, 28(7): 168-170,174.
Citation: YE Heng-zhou, LUO Xiao-juan, NIU Qin-zhou. Web Service Request Input Closure and Satisfiability Analysis[J]. Microelectronics & Computer, 2011, 28(7): 168-170,174.

Web服务请求输入闭包与可满足性分析

Web Service Request Input Closure and Satisfiability Analysis

  • 摘要: 大规模服务库的快速服务组合方法是当前研究的难点,研究快速的服务请求可满足性判定方法与服务集优化方法是解决该类问题的有益探索.通过引入Web服务请求输入闭包概念,论证了一种服务请求可满足性判定方法和Web服务集优化方法,并通过实验分析了领域属性总数与服务总数的比值对用户请求可满足性及服务集优化效果的影响.提出了最小用户代价输入集的概念,给出了一种近似求解最小代价输入集的贪心算法.

     

    Abstract: The research on rapid composition approach for large scale services is still a critical challenge.Exploring service composition satisfiability and service deposit optimization is a useful attempt for such issues.By introducing the concept of Web service request input closure, the paper demonstrates a method of determining service request satisfiability and optimizing Web service deposit, and analyses the effect about the ratio of the total number of field properties and Web services to user request satisfiability and Web service deposit optimization by experiments.The concept of minimal user input cost is put forward and a greedy algorithm to calculate the approximate minimum cost input set is proposed.

     

/

返回文章
返回