1) the number of sect set
割集数
2) least partition assembly count
最小割集数
3) Segmentation of Data Set
数据集分割
1.
The Application of Entropy in the Segmentation of Data Set;
信息熵在数据集分割中的应用研究
4) partitioned data set(PDS)
分割数据集
5) 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.
针对网络最大流问题,在割集定义和最大流-最小割定理基础上,以邻接矩阵为网络数据存储结构,利用栈作为数据组织形式,遍历网络中所有割集,最小容量的割集即为网络最大流。
6) Cut-set
割集
1.
Research on generation algorithm of assembly sequence based on cut-set under integration circumstance;
集成环境下基于割集的装配顺序生成算法研究
2.
Based on the theoretical analysis of the establishment of cut-set voltage equation,a more straightforward and simplified way has been proposed.
本文通过对割集电压方程建立过程的理论分析,提出并证明了一种直接的、更为简便的列写割集电压方程的方法。
3.
The systematic method of the large scale network is presented by using network Graph Theory and matrix algebra and through the analysis of the independent equation of the large scale network cut-set voltage.
借用网络图论与矩阵代数,通过对大规模网络割集电压的独立方程分析,提出大规模网络的系统化计算法,进而确立了组成大规模网络的元件参数与描述该网络相应矩阵中元素间的对应关系。
补充资料：基本割集矩阵(见网络图论)
基本割集矩阵(见网络图论)
fundamental cut-set matrix
Jl匕en ge〕1〕日zhen基本割集矩阵(fundamental eut一setnla一trix)见网络图论。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条