| 1. | We call this type of cut-set an incident cut-set .
我们把这类割集称为关联割集。 |
| 2. | This class of subgraphs, known as segs, was introduced by reed in 1961 .
这类子图称为广义割集，它是由里德在1961年提出的。 |
| 3. | A generalization of cut-sets is known as a seg. it is also sometimes called a disconnecting set .
割集的一个推广叫做广义割集。有时也把它叫做断开集。 |
| 4. | Universal cut and special cut were combined in the method
该方法结合了通用割集和专用割集。 |
| 5. | Then we look for the minimal segmental sets of the created fault tree
然后对建好的故障树寻找最小割集。 |
| 6. | Finally , the realization algorithm is accomplished according to the minimal segmental sets
最后根据最小割集确定故障诊断的实现算法。 |
| 7. | Cut set matrix
割集矩阵 |
| 8. | Using the traditional method to build up models will cause explosive increase of amount of cut - set along with the growth of number of the component parts
用传统的方法建模，容易造成割集数量随着零件数量的增长而呈爆炸式地增长。 |
| 9. | Compared with the method only using universal cut or special cut , the method can obviously improve the speed of verification for combinational circuits
与只基于通用割集或专用割集的验证方法相比，该方法可以使组合电路的验证速度明显提高。 |
| 10. | The minimal path sets and the minimal cut sets are the key tools to evaluate the network reliability , which divide the system states into two : success ( s = 1 ) and failure ( s = 0 )
网络的最小路集和最小割集分别从成功( s = 1 )和失败( s = 0 )的不同角度描述了网络的不同状态，是网络可靠度求解的关键。 |
