交割集,interval cut set,音标,读音,翻译,英文例句,英语词典

您的位置：首页 -> 词典 -> 交割集

1) interval cut set 点击朗读

交割集

2) single crossing bond 点击朗读

单交叉割集

3) dual crossing bond 点击朗读

双交叉割集

4) non-intersect minimum cut sets 点击朗读

不交化最小割集

5) Non intersect Minimal Cut Set 点击朗读

不交化最小割集矩阵

6) cut set 点击朗读

割集

In order to relieve this situation,this paper makes use of the independence condition to decompose the whole Bayesian network according to the characteristics of safety analysis,compresses the items number in reasoning process,proposes the algorithms for top event probability and cut sets,simultaneously analyses the computational complexity.

为此,利用独立性条件分解整个网络,压缩推理时显式表达的项数,给出了计算顶事件发生概率及割集的算法,并分析了算法复杂性。

The paper proposed a method called CSA-CJ which is adapt to find cut sets of huge highway transportation network.

提出了一种适合大型公路交通网络的割集搜索算法CSA -CJ。

Facing the question of max-flow in network,based on cut set define and max-flow min-cut theorem,with adjacency matrix to deposit network data,using the data structure of stack to organise network data,traversing all cut sets,the minimum capacity in all cut sets is max-flow in network.

针对网络最大流问题,在割集定义和最大流-最小割定理基础上,以邻接矩阵为网络数据存储结构,利用栈作为数据组织形式,遍历网络中所有割集,最小容量的割集即为网络最大流。

更多例句>>

补充资料：〖ZK(〗各证集说诸方备用并五脏六腑集论合抄〖ZK)〗

〖ZK(〗各证集说诸方备用并五脏六腑集论合抄〖ZK)〗

内科著作。1卷。原题清叶桂(天士)家传，撰年不详。此书汇集内科杂证70余种，方剂近200首。每证各为一论，阐明疾病性质、病因、症状、治则及方药。论后每引经说，概括病机。所列方药服法亦皆详备。又列“五脏六腑论”一章，引用《内经》、《难经》，逐一论述五脏六腑之形象、部位、表里关系、病症及治法。本书内容多录自《临证指南》，恐系后人伪托叶氏之作。现存抄本

说明：补充资料仅用于学习参考，请勿用于其它任何用途。

参考词条

交割交货,交割交割、交货最小割集解列割集

说明：双击或选中下面任意单词，将显示该词的音标、读音、翻译等；选中中文或多个词，将显示翻译。
	您的位置：首页 -> 词典 -> 交割集 1) interval cut set 交割集 2) single crossing bond 单交叉割集 3) dual crossing bond 双交叉割集 4) non-intersect minimum cut sets 不交化最小割集 5) Non intersect Minimal Cut Set 不交化最小割集矩阵 6) cut set 割集 1. In order to relieve this situation,this paper makes use of the independence condition to decompose the whole Bayesian network according to the characteristics of safety analysis,compresses the items number in reasoning process,proposes the algorithms for top event probability and cut sets,simultaneously analyses the computational complexity. 为此,利用独立性条件分解整个网络,压缩推理时显式表达的项数,给出了计算顶事件发生概率及割集的算法,并分析了算法复杂性。 2. The paper proposed a method called CSA-CJ which is adapt to find cut sets of huge highway transportation network. 提出了一种适合大型公路交通网络的割集搜索算法CSA -CJ。 3. Facing the question of max-flow in network,based on cut set define and max-flow min-cut theorem,with adjacency matrix to deposit network data,using the data structure of stack to organise network data,traversing all cut sets,the minimum capacity in all cut sets is max-flow in network. 针对网络最大流问题,在割集定义和最大流-最小割定理基础上,以邻接矩阵为网络数据存储结构,利用栈作为数据组织形式,遍历网络中所有割集,最小容量的割集即为网络最大流。更多例句>> 补充资料：〖ZK(〗各证集说诸方备用并五脏六腑集论合抄〖ZK)〗〖ZK(〗各证集说诸方备用并五脏六腑集论合抄〖ZK)〗内科著作。1卷。原题清叶桂(天士)家传，撰年不详。此书汇集内科杂证70余种，方剂近200首。每证各为一论，阐明疾病性质、病因、症状、治则及方药。论后每引经说，概括病机。所列方药服法亦皆详备。又列“五脏六腑论”一章，引用《内经》、《难经》，逐一论述五脏六腑之形象、部位、表里关系、病症及治法。本书内容多录自《临证指南》，恐系后人伪托叶氏之作。现存抄本说明：补充资料仅用于学习参考，请勿用于其它任何用途。参考词条

©2011 dictall.com