割集

本文用改进的GO法对电子防滑器试验系统进行了可靠性分析，求出了电子防滑器试验系统的可靠性特征量和最小割集数据。

This paper analyzes the experiment system of electronic antiskid devices using the improved GO methodology . It calculates the reliability parameters and all the minimal cut set of the experiment system of electronic antiskid device .

针对问题的特点，建立了Hopfield网络的能量函数，提出并构造了一种寻找任意图最小割集的神经网络算法&NNMC（NeuralNetworkMinimalCut）算法。

The new neural network algorithm for searching graph minimal cut set , called NNMC algorithm , is established on the basis of construction of Hopfield Network energy function according to the concrete problem .

由基本割集矩阵求其对应图G的一种算法

An algorithm for forming a graph by its fundamental cutset matrix

网络k度薄弱最小割集及其快速搜索算法

The k - weak minimal cut set of networks and fast searching algorithm

网络（G，R）的扩张因子是顶点割集和边割集的扩展。

The expanding factors of graphs are the edge and vertex cut set expansion .

由PETRI网模型求系统最小割集的自顶向下法

A Top-to-Down Method Getting the System 's Minimal Cut Sets by Petri Net

我们称G的一个边集为圈边割集，如果把它删除会使G不连通，并且至少有两个分支包含有圈。

A cyclic edge-cut of a graph G is an edge set , the removal of which separates two cycles .

基于最小割集的数值仿真在FMS可靠性研究中的应用

Research on the Reliability of FMS Based on Minimum Cut Sets Numerous Simulation

割集矩阵在早期不交化FTA中的应用

Study on the application of cut sets matrix to fault tree system analysis

文中采用割集法求解，可以解各类具有复杂负载的MHD发电机的等效网络。

The cutset method can be used for solving circuit problems in the MHD generator under various loading conditions .

FTA软件的理论算法都是基于割集的，大型故障树分析计算量大且割集繁多，需耗费大量的计算时间和内存资源。

Large fault tree analysis of large-scale calculation and large-range cut-set will consume a lot of computing time and memory resources .

本文采用问题归约方法的思想，认为图论割集算法和AND／OR图AO搜索算法是装配顺序生成理想的通用算法。

Based on the problem reduction method , the cut-set algorithm along with AO search algorithm is considered to be the universal algorithm for the generation of assembling sequences .

将寄生电容非灵敏有源开关电容网络（SCN）划分成若干个子网络，对每个子网络定义了运放负端组元割集；

The parasitic-insensitive active switched capacitor network ( SCN ) is partitioned into several sub-networks . Each subnetwork is defined as the op. amp .

本文给出一种比较完善、实用的开关电容网络（SCN）的分析方法&“（？）割集电荷状态变量法”。

A rather perfect and useful analysis method for SCN is given in this paper which is called "(?) cut-set charge state-variable method " .

通过应用割集定理，推导得到了半双工中继系统中采用连续转发（SuccessiveRelaying，SUR）策略时系统可达速率的上界。

The expression of the upper bound for the achievable rate in Successive Relaying ( SUR ) protocol is derived by using the cut-set theorem for half-duplex systems .

用布尔代数化简法求得了故障树的全部最小割集（MCS）和最小路集（MPS）。

By means of the method , all of both minimum cut sets ( MCS ) and minimum path sets ( MPS ) of the fault tree are determined .

实现了基于BDD的定性和定量分析，并使用链表和队列优化求解最小割集的分析过程。

Implements the qualitative and quantitative analysis based on using BDD , and using the link-list and queue for optimizing the minimum cut-set analysis process .

通过引入广义节点的概念和运用KCL方程的推广，在割集方程的基础上形成了广义节点割集方程。

Based on the generalized node , the extended KCL equation and the cut set equations , the equations of the generalized node cut set are derived .

研究了系统逻辑关系的Petri网表示，基于Petri网的建模方法，采用Petri网模型求系统最小割集的自顶向下法。

The Petri net is employed to model the logical relation and to get the minimal cut sets and the minimal path sets of the system 's event , a top-to-down algorithm for this purpose is got .

冲突和并发是Petri网的两种典型的行为，本文基于系统可靠性Petri网模型的逆模型和基于ECS的解冲突算法，得到一种新的求解单调关联系统最小割集的算法。

Conflict and Concurrent are two typical actions in Petri nets . We provide a new method of calculating of minimal cut sets for monotone coherent systems based on reverse model and ECS based conflict resolution method .

针对大规模供电系统线路复杂、数据庞大的特点采用了一种新的解析算法，即结合最小割集法的FMEA方法。

A new assessment algorithm is proposed aiming at circuit-complex and large amounts of data of large-scale power supply system , which is EMEA method combining minimum cut set method .

提出了有限增益运放的电容-nn模型，定义了nullator组元割集。

The capacitor nn model is advanced and the nullator component cutest is defined .

从原始输出进行回溯得到通用割集，用通用割集验证所有候选等价点（CEP）的等价性。

Universal cut was generated by tracing from primary outputs , and equivalence of all candidate equivalent points ( CEPs ) was verified by using universal cut .

FTA法是以系统故障为顶事件，通过查找能引起上一级故障的全部可能的直接故障逐步得到最小割集。

FTA 's top event is the failure of the system . This method can get MCS ( Minimum Cut Set ) through looking up all the possible faults that cause it 's up level fault .

解列割集搜索问题是一个NP-hard问题，必须用启发式方法求解，现有方法计算时间长，难以满足在线应用要求。

Islanding cutset searching is a NP-hard problem , and heuristic approaches are employed to solve it . The approaches mentioned in literature need much calculation time , and can not be used online .

根据故障树早期不交化方法，提出利用割集矩阵运算导出早期不交化的故障树分析新算法，并用C++语言开发了基于Windows的FTA应用软件。

A new computation method has been brought forth by using the cut sets matrix in former non intersect FTA according to the former non intersect methods . The application software based on Windows has also been accomplished with C + + language .

介绍了基于最小割集的仿真方法的原理及其具体实现过程，并分析了它在柔性制造系统FMS（FlexibleMachingSystem）可靠性研究中的应用，最后用一个FMS的实例来验证该方法的正确性。

Introduces a new simulation method based on the minimum cut sets of fault tree , analyzes the way using the method in the research of the reliability of FMS , a case is presented to prove its correctness .

本文通过图论方程推导出用关联矩阵（割集矩阵、回路矩阵）和支路导纳（阻抗）矩阵等直接表示多端口网络的Y和Z参数矩阵的公式，使用这些公式便于编程计算。

In this paper , the matrices of Y-Parameter and Z-Parameter for multiport network directly expressed by incidence matrix ( or Cut-Set matrix , or loop-matrix ) and Branch admittance ( or branch-impedance ) matrix are presented , which are useful in CAD of networks .

利用二元决策图（BDD）中的B&割集和节点概率，提出了基于BDD的关联故障树定量分析新算法。

By the B-cut sets and the probabilities of the nodes of Binary Decision Diagrams ( BDD ), a new quantitative analysis algorithm of coherent fault tree based on BDD is presented in this paper .

本文对特定的RLC线性电路（不含电压源和电容组成的回路，不含电流源和电感组成的割集）进行研究。

A special RLC linear circuit ( in which no voltage sources and capacitors are consisted in a loop , and no current sources and inductors are consisted in a cut-set ) is studied in this paper .