高级检索

    丁雪丰, 宋国新. 一种使用混合匹配的有限服务自动组装算法[J]. 华东理工大学学报(自然科学版), 2009, (5): 746-749.
    引用本文: 丁雪丰, 宋国新. 一种使用混合匹配的有限服务自动组装算法[J]. 华东理工大学学报(自然科学版), 2009, (5): 746-749.
    A Finite Service Automatic Composition Algorithm Using Hybrid Matchmaking[J]. Journal of East China University of Science and Technology, 2009, (5): 746-749.
    Citation: A Finite Service Automatic Composition Algorithm Using Hybrid Matchmaking[J]. Journal of East China University of Science and Technology, 2009, (5): 746-749.

    一种使用混合匹配的有限服务自动组装算法

    A Finite Service Automatic Composition Algorithm Using Hybrid Matchmaking

    • 摘要: 提出了语义企业服务总线的概念,并给出了相应的原型设计及实现该总线所涉及的技术。针对语义Web服务的自动组装问题,设计了一种使用混合匹配的有限服务自动组装算法,相比手工和半自动的组装方法,该算法能实现语义Web服务的全自动组装。

       

      Abstract: The concept of semantic enterprise service bus is proposed in this paper. It also gives the design of the prototype and the technologies to build the prototype. In order to solve the automatic composition of semantic web services, this paper proposes a finite service automatic composition algorithm using hybrid matchmaking. Compared with manual and semiautomatic methods, this algorithm can do the composition automatically.

       

    /

    返回文章
    返回