The Research of Automatic Dynamic Service Composition Based on Causal Relationship Matrix

ZHU Xue-feng; XIE Qian; DAI Gui-lan

Chinese

您当前的位置：

首页 >

文章列表页 >

The Research of Automatic Dynamic Service Composition Based on Causal Relationship Matrix

更新时间：2026-09-04

- The Research of Automatic Dynamic Service Composition Based on Causal Relationship Matrix
- Vol. 31, Issue 12, Pages: 67-70(2014)
- 作者机构：
  
  1. 河南大学机构计算机与信息工程学院,河南,开封,475000
  2. 清华大学信息技术研究学院,北京,100084
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：2014
- 稿件说明：
移动端阅览
朱雪峰, 谢谦, 戴桂兰. 基于因果关系矩阵的动态服务组合技术研究[J]. 微电子学与计算机, 2014, 31(12): 67-70,74.

ZHU Xue-feng, XIE Qian, DAI Gui-lan. The Research of Automatic Dynamic Service Composition Based on Causal Relationship Matrix[J]. 2014, 31(12): 67-70.
朱雪峰, 谢谦, 戴桂兰. 基于因果关系矩阵的动态服务组合技术研究[J]. 微电子学与计算机, 2014, 31(12): 67-70,74. DOI：

ZHU Xue-feng, XIE Qian, DAI Gui-lan. The Research of Automatic Dynamic Service Composition Based on Causal Relationship Matrix[J]. 2014, 31(12): 67-70. DOI：

摘要

为提高卫星信息资源领域的服务动态组合速度和准确度

提出了一种基于因果关系矩阵和图论的组合方法.将用户需求通过语义匹配筛选出一个服务集合

再将服务集合按照因果关系矩阵规则构建出一个服务的输出与服务输入之间匹配程度的矩阵

在组合方法中

使用之前构建好的关系矩阵

并通过基于图的组合算法准确快速地从矩阵中选择相应的服务构建出服务链集合.再根据每个服务链的非功能属性值

筛选出最符合用户需求的服务组合产品.该方法将服务间的依赖关系使用最大化

提高了组合服务链过程中匹配相应节点服务的速度.

Abstract

In order to increase the speed and accuracy of the dynamic service composition in satellite information resource area

this text proposed a combined method based on causal relationship matrix and Graph theory.Firstly

it screens out a service composition from user demands through semantic matching

then a matrix of matching degree between service inputs and service output is structured according to the rules of causal relationship matrix.By making use of relationship matrix

a set of service chain is made fast and accurately

via selecting corresponding services in the matrix through the graphical combinational algorithm.Furthermore

it picks out the service combination product that best fitting user requirements on the basis of non-functional attribute value of each service chains.This method maximums the use of dependency among every services

and increases the speed of matching corresponding nodes during the process of combining service chain.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Web Service Request Input Closure and Satisfiability Analysis

Annotated Dependency Graph-Based Approach for Service Composition

Steganography model guided by attention mechanism and improved dense convolution

Research on the design of blockchain-based AI-generated content traceability framework

Aerial small object detection algorithm based on improved RT-DETR

Related Author

YE Heng-zhou

LUO Xiao-juan

NIU Qin-zhou

HUANG Wei

ZHU Qiao-ming

LI Pei-feng

LIU Mei-mei

Related Institution

College of Information Science and Engineering,Guilin University of Technology

School of Computer Science and Technology, Soochow University

Key Lab of Computer Information Processing Technology of Jiangsu Province

AI问答

Postal code：100079
Tel：（010）53879206 Email：tmw@bjxintong.com.cn
Technical support is provided by Beijing Founder electronics co., LTD 京ICP备09082226号-64 京公网安备11010602201714号
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.

⁰