1) disjoint sum
不相交和
2) Sum of disjoint products
不交和
1.
Presents an algorithm for generating the sum of disjoint products by using binary decision diagram as well as certain ordering role of paths and Boolean algebra formulas.
利用二分决策图，同时采用道路排序技巧及布尔代数运算给出了求不交和的方法，它比单纯采用二分决策图的算法更简单，不交和的项数更少，从而得到一个求网络可靠度的有效算法。
2.
A new algorithm for generating the sum of disjoint products is proposed.
给出网络可靠度一种新的不交和算法。
3.
Using the sum of disjoint products method,this paper study the linear and circular consecutive k out of n:F system Two O(nk) formulas to calculate the system unreliability are deduce
本文从最小割出发 ,运用不交和的方法来研究线形和环形连续k out of n :F系统 ,最后得到了系统的失效概率计算公式 ,该算法的复杂度是O(nk)。
3) at strife
不和, 相争
4) disjoint
[英][dis'dʒɔint] [美][dɪs'dʒɔɪnt]
不相交
1.
This paper discusses the homogeneous embeddings of disjoint Steiner triple systems.
本文讨论了不相交Steiner三元系组{X,A_i)|1≤i≤n}的齐次嵌入问题,并完整地解决了n=3时,不相交Steiner三元系组的齐次嵌入。
2.
The algorithm will firstly put the multiple disjoint paths which have been found,into the path set Px and put the paths which are not disjoint from path set Px into the candidate path set Cx.
将寻找到的多条不相交路径添加到路径集Px中,将相交路径添加到备用路径集Cx中。
3.
Two pure idempotent Latin squares are strictly disjoint,if their 3-tuple sets are disjoint.
设S是v元集,拉丁方A=(a_(ij))是指S上的一个v阶方阵,使得S的每个元素在A的每一行和每一列中都恰好出现一次,当A满足:对任意i∈S,都有a_(ii)=i,且三元组集合{{i,j,a_(ij)}:i,j∈S且i,j,a_(ij)都不相同}含有v(v-1)个不同的元素时,称之为纯的幂等拉丁方,若两个纯幂等拉丁方的三元组集合是不相交的,则称之为严格不相交的。
5) disjoint union
不相交并
6) disjoint term
不相交项
补充资料：V形相交纹
V形相交纹 青铜器纹饰之一。以两“V”形相互交叉，作一颠一倒排列，尖角和四周饰以变云纹。盛行于战国时期。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条