When people saw land, the boat fall into ice and began to disjoint.

当人们看到陆地的时候，船却陷在冰块里并开始解体。

Text mining is the kernel of the disjoint literature-based knowledge discovery.

文本挖掘是基于非相关文献知识发现的核心。

The training sets are both larger and partially disjoint from the testing collections.

这些培训消息集比较大，而且有一部分是与测试集不相交的。

This will ubiquitously induces the disjoint phenomenon between the light and space design.

这就造成室内设计中普遍存在着光与空间设计相脱节的现象。

Techniques for supporting communication with disjoint links and common links are described.

描述了用于以分离链路和公共链路支持通信的技术。

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

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

In this paper studed the algorithm to realize the disjoint calculation in multistate system.

该文研究多状态系统不交化运算的实现算法。

The rewrite phase will use this information to determine that the UNION ALL branches are disjoint.

重写阶段将使用该信息来确定UNION ALL分支不相交。

DB2 10 can now automatically reorganize disjoint partition ranges of a partitioned table space.

DB 2 10现在支持自动重新组织分区表空间的不相连分区范围。

Constructing disjoint minimal path set is an important approach for reliability analysis of network.

网络系统不交化最小路集的求解是进行网络系统可靠性分析的重要途径。

If she is indifferent to your actions, that such a narrow-minded friend of disjoint worth mentioning.

如果她是你的行为无动于衷，这种狭隘的不相交值得一提的朋友。

Retrieves a collection of disjoint text ranges associated with the current text selection or selections.

检索与当前文本选择(或多个文本选择)关联的不连续文本范围的集合。

Adds to the collection of highlighted text in a text container that supports multiple, disjoint selections.

添加到突出显示文本集合中，该集合位于支持多个不连续选择的文本容器中。

EASBRA utilizes the node's geographical information to route and selects the most stable disjoint backup route.

该算法利用网格中节点的地理信息进行路由，并且选择一条最稳定的不相交备用路由。

The methods designing TSC and TSC circuits with code disjoint property for any combinational function are given.

本文给出了将任意组合函数设计为全自检线路，以及具有编码分离性质的全自检线路的方法。

A poset is called a symmetric chain decomposition if the poset can be expressed as a disjoint union of symmetric chains.

如果一个偏序集可以分解成不相交的对称链之并，则称此偏序集具有对称链分解。

A few great leaders can handle leadership and management, but in general good managers and good leaders form disjoint sets.

也有较好的领导人可以处理领导和管理之间的关系，但是好的管理人与领导之间还是有很大的区别的。

M is called taxonomic class of sets if. for every two elements of m, either they are disjoint, or one is a subset of the other.

若m中任意两个子集，或者它们无共同元素，或者一个是另一个的子集，这样的M称为分类集。

Furthermore, we utilize the reliability theory to analyze the route reliabilities of disjoint and non-disjoint multipath routings.

并且，我们利用可靠性理论对相交和不相交两种情况下的路由可靠性进行了理论分析。

The MSS problem seeks to compute a set of vertex-disjoint simple paths in an undirected bipartite graph under certain constraints.

MSS 问题的目标，是在一个二分无向图上寻找由互不相交的路径所构成的集合，并要求这个集合满足一些特定的条件。

An advertising platform is also a special case of a two-sided network connecting two disjoint markets of on-line users and advertisers.

广告平台也是双向网络的例子——联结分离的在线用户与广告主。

Creates two or more polygons that are filled using the current polygon-filling mode. The polygons may be disjoint or they may overlap.

创建使用当前多边形填充模式的两个或多个多边形，多边形可以相互分开或叠加。

The semantic cache consists of disjoint semantic regions, and each semantic region includes a description and a corresponding data pointer.

语义缓存由互不相交的语义区域组成，每一个语义区域包括语义描述及其数据指针。

Barham's implementation simply looks for relatively short, disjoint sequences of characters in a small set (alphanumeric plus a few others).

Barham的实现仅在一个小的集合中(字母数字加一些其它字符)查看相对较短和不相交(disjoint)的字符序列。

Yes, but it isn't immediately obvious as the set of possible MPL sequences isn't inherently disjoint from the set of callable builtin types.

是的，但这不是非常明显，因为可能的MPL序列集不是从可调用内建类型集中自然地分解出来的。

Disjoint paths weight accumulating algorithm is proved to be effective in correlation computing by analyzing the results of the experiments.

分析实验结果发现，不相交路径权值累积算法能有效计算网络成员关联度。

Input the two rectangular determine whether two rectangles intersect if intersect, calculate the area of ​ ​ the intersection of disjoint return.

说明：输入两个矩形，判断两个矩形是否相交，如果相交，计算出相交的面积，不相交返回。

In the cycle packing problem, given an undirected connected graph g, it is required to find the maximum number of pairwise edge disjoint cycles in g.

给定一个无向连通图g，圈包装问题就是求g的边不相交圈的最大数目。