查询词典 disjoint

If d +d ≥n for every two strongly disjoint independent sets S and T with|S|=s and|T|=t, respectively, then G is hamiltonian.

若对任意两个强不交独立集S和T，其中|S|=s，|T|=t，有d+d≥n，则G是哈密尔顿图。

The relation between two fuzzy sets has mutual disjoint, mutual nonLuniformly inclusive, mutual interceptive but not non-uniformly inclusive, and independent, as the same as in probability theory.

模糊集合之间关系与概率论的事件之间关系一样，不仅有不相交，非一致包含，相交而不非一致包含，而且还有相互独立，等等。

If k = 2 and the graph G corresponding to the wireless sensor network is (l+ max{1,l-4})-connected, or k≥3 and G is l(k-1 + 1-connected, then we can find k disjoint sets each of which completely covers all the targets and remains connected to one of sinks.

当k=2并且网络所对应的图G是(l+max{1，1-4})连通的，或者当k≥3并且G是l(k-1+1连通时，我们能够肯定找到k个不相交的节点集合，每个集合中的节点能够完全覆(来源：ABC929c92论文网www.abclunwen.com)盖所有的目标，并且与网关节点连通。

That is, formally speaking, a representation or encoding over an alphabet ∑ of a set D is a function f from D to 2^∑* that satisfies the following condition: f(e1) and f(e2) are disjoint nonempty sets 不相交的非空子集 for each pair of distinct elements e1 and e2 in D.

形式地说，对信息对象集合 D 进行基于字母表∑的物化或编码是从 D 到 2^∑*的函数 f，并且函数 f 满足以下条件：对于 D 内任一对不相同的元素 e1 和 e2，f(e1)和 f(e2)是不相交的非空子集。

The sum of disjoint products method is efficient for computing the reliability of a network.

不交和方法是一种有效的计算网络可靠度的方法。

A new algorithm for generating the sum of disjoint products is proposed.

给出网络可靠度一种新的不交和算法。

The first part is involved in the principles and algorithms on minimal disjoint sum of products of the system reliability structure functions, The second part is involved in the research on system reliability models and event-sequence analysis of large complex repairable systems.

论文分为两部分，第一部分是关于系统可靠性结构函数最小不交化的原理及算法的研究；第二部分是关于大型复杂可修复系统的可靠性分析模型及事件序列分析方法的研究。

Definition and research of disjoint product sum minimization from the point of view of Boolean function coverage, and proof of three theorems as well as putting forward a recurrent formula.

从布尔函数覆盖的角度定义和研究了最小不交化问题，给出并证明了几个有关的定理，并提出一个求布尔函数最小不交积之和的递推计算原理及公式； 3。

Realization of an algorithm MSDP for minimal disjoint sum of products based on the recurrent formula with the sharp # operation. MSDP algorithm can be used to any kind of two-value structure functions (coherent or non-coherent).

根据所提出的递推原理及公式，利用立方体的锐积#运算，给出并实现了一个求最小不交积之和的算法MSDP，并对算法的各主要步骤进行了讨论。

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.

利用二分决策图，同时采用道路排序技巧及布尔代数运算给出了求不交和的方法，它比单纯采用二分决策图的算法更简单，不交和的项数更少，从而得到一个求网络可靠度的有效算法。

In the United States, chronic alcoholism and hepatitis C are the most common ones.

在美国，慢性酒精中毒，肝炎是最常见的。

If you have any questions, you can contact me anytime.

如果有任何问题，你可以随时联系我。