割集

基本解释 (translations)

cutset

词组短语

cut set

与割集相关的网络例句 [注：此内容来源于网络，仅供参考]

The complexity of tree set analysis for network was compared with that of minimum cut set analysis.

对网络分析的树集分析法与最小割集分析法的复杂性进行了比较，并示例说明以最小割集为基础进行网络可用性分析是最佳的技术途径。

This method can find CS according to the relationship among inputs and outputs implied in the incidence matrix, finally using Boolean absorption law, idempotent law, or prime law to get MCS.

具体方法是在关联矩阵中按行、列查找所表达的输入、输出关系，直到找到基本事件，并将对应事件按"与"、"或"关系展开，这样可以直接从关联矩阵中得出割集，再按照布尔吸收律、等幂率或素数法求出最小割集。

In this paper, firstly, not only the incidence matrix ,adjacent matrix, cycle matrix, cut-set matrix of an undirected graph are summarized, but also the close contact between a graph and its corresponding matrix are discussed ; secondly, many problems of a graph which are solved by analysing its matrix are listed as follows:1、The co-tree set of a graph is obtained by using its cycle-matrix ; 2、The branches of its spanning tree are given by using its cut-set matrix ; 3、By making use of the incidence matrix of a graph ,not only its vertex cut 、cut vertex 、isolated point and spanning tree can be obtained ,but also the two sides which are whether parallel or not can be judged ;4、By using their adjacent matrix ,the two graphes which are whether isomorphous or not can be judged; once more, there is a detailed introduction in view of special graph (for example: bigaritite graph ,regular graph and so on);last but not least, a graph method of calculating the N power of a matrix is given and the practical applications of the theorem for degree is indicated.

本文首先综述了无向图的关联矩阵，邻接矩阵，圈矩阵，割集矩阵以及图和它对应矩阵之间的关系；其次总结出了利用上述各类矩阵可以解决的图的若干问题：1、利用图的圈矩阵可以求其连枝集；2、利用图的割集矩阵可以求其生成树的树枝；3、利用图的关联矩阵不仅可以求其割点、点割集、连通度、孤立点和生成树，而且可以判断两条边是否平行；4、利用图的邻接矩阵可以判断两个图是否同构；再次，针对特殊图（例如：二分图、正则图等等）的邻接矩阵作了详细介绍；最后，得到了利用图计算矩阵的N次幂的方法，指出度数定理的实际应用。

By qualitative analysising, all lateen dangerous factors of VCM spheroid fired blast ed accident are identificated and the dangerous grades are definited.

通过定性分析，辨识了VCM球罐发生火灾、爆炸事故的潜在危险因素，确定了相应的危险等级，然后以"VCM储罐火灾、爆炸"为顶事件建立了事故树，由布尔代数方程求出了28个二阶最小割集，20个三阶最小割集，并计算出各基本事件的结构重要度系数。

Setting forth the realization method by hardware for searching minimal cutset of a graph with N-SearCut model. Then this method affords theory and practice fundament for solving this puzzle of searching for minimal cutset in reliability evaluation of power system.

提出了运用N-SearCut神经网络模型搜索图最小割集的全硬件实现方法，为更理想地解决网络可靠性评估中出现的最小割集搜索这一瓶颈问题提出了新的思路，提供了理论和实践依据。

Then, the uniqueness of factor of prime number is used to calculate the cut sets and the minimal cut sets.

然后采用素数的唯一因子性质计算割集和最小割集。

Minimal Cut Sets are separated from the reduced Fault Tree built by module and Faunet arithmetic.

用故障树最小割集诊断法诊断装备系统故障，以Faunet算法和模块化构建并简化故障树、求解其最小割集。

There are two steeps to achieve the reliability distribution.

该方法可靠度的分配过程分两步：首先按可靠性再分配原理将系统的可靠度分配到各个最小割集；然后将需要调整可靠度的最小割集看成一个子系统，将最小割集的可靠度按基本事件重要度的大小分配到各个基本事件，即所谓二次分配模型。

This algorithm recursively enumerated a part of DACG directed segs which had one connected subgraph by using the theory of edge contraction.

为解决有向装配图有向割集的求解，给出一个生成有向装配连接图有向割集的高效算法，该算法优先考虑检查有向割集两个子图间边的方向。

To resolve directed cutset of Directed Assembly Connection Graph, an efficient algorithm for the enumeration of all directed cutsets of DACG was presented. This algorithm recursively enumerated a part of DACG directed segs which had one connected subgraph by using the theory of edge contraction.

为解决有向装配图有向割集的求解，给出一个生成有向装配连接图有向割集的高效算法，该算法优先考虑检查有向割集两个子图间边的方向。

与割集相关的网络解释 [注：此内容来源于网络，仅供参考]

cradle scythe：割集大镰刀

"CR; compression ratio","压缩比" | "cradle scythe","割集大镰刀" | "crank duster","手摇式撒粉机"

cut set matrix：割集矩阵

cut set 割集 | cut set matrix 割集矩阵 | cutting plane 割平面

fundamental cut set matrix：基本割集矩阵

基本割集 fundamental cut set | 基本割集矩阵 fundamental cut set matrix | 基本子阵 fundamental submatrix

cut set conductance matrix：割集电导矩阵

割集导纳矩阵 cut set admittance matrix | 割集电导矩阵 cut set conductance matrix | 短路输入导纳 short-circuit input admittance

cut set admittance matrix：割集导纳矩阵

割集电流源向量 cut set current source vector | 割集导纳矩阵 cut set admittance matrix | 割集电导矩阵 cut set conductance matrix

cut set：割集

cut point 割点 | cut set 割集 | cut set matrix 割集矩阵

critical cut set：临界割集

3717. critical current density 临界电流密度 | 3718. critical cut set 临界割集 | 3719. critical damping 临界阻尼

Minimal Cut Set：最小割集

水平切片:horizontal cut piece | 最小割集:Minimal Cut Set | 充填法:cut-and-filling

fundamental cut set：基本割集

基本回路 fundamental loop | 基本割集 fundamental cut set | 基本割集矩阵 fundamental cut set matrix

edge disjoint cut-set union：边不相接割集的并集

edge disjoint circuit union 边不相接回路的并集 | edge disjoint cut-set union 边不相接割集的并集 | edge dislocation 边缘位错,刃型位错,刃状位错=>刃状転位