根据定义，平行线是永不相交的直线。
平行线是永不相交的线。
这些培训消息集比较大，而且有一部分是与测试集不相交的。
The training sets are both larger and partially disjoint from the testing collections.
按照定义，平行线是在同一平面上永不相交的线。
Parallel lines are, by definition, lines on the same plane that never join.
请注意，该区域中与此矩形不相交的区域颜色为蓝色。
Notice that the area of the area of the region that does not intersect with the rectangle is colored blue.
加泰隆数又是用不相交的对角线划分几边形成三角形的方式数。
The Catalan numbers also count the number of ways in which ann-gon can be dissected into triangles by nonintersecting diagonals.
请注意，第二个区域中与第一个区域不相交的区域颜色是蓝色。
Notice that the area of the second region that does not intersect with the first region is colored blue.
如果一个偏序集可以分解成不相交的对称链之并，则称此偏序集具有对称链分解。
A poset is called a symmetric chain decomposition if the poset can be expressed as a disjoint union of symmetric chains.
爱和恨可以象两条永不相交的平行线，爱和恨也可能只需要一缕阳光就可以消融。
Love and hate can like two lines which will never intersect, but a piece of sunshine can melt them.
语义缓存由互不相交的语义区域组成，每一个语义区域包括语义描述及其数据指针。
The semantic cache consists of disjoint semantic regions, and each semantic region includes a description and a corresponding data pointer.
通过将集列分成有限个互不相交的子集列，给出了求集列的上限集和下限集的新方法。
Through set sequence is resolved into finite mutually disjunct subsets, the new method to solve the limit superior and limit inferior of set sequence is give.
我宁愿我们是永不相交的平行线。因为在那仅有的一次交点后，我们会离彼此越来越远。
I would rather we were parallel lines, which will never intersect, because after the point of the only intersection, we are going to be further apart.
而交错轴斜齿轮传动由于其可以传递既不平行又不相交的两轴之间的运动和动力而被广泛地应用。
And the transmission of cross helical gear can transmit because of their sport of crossing two axles and power widely application neither parallel nor intersect.
将正常的非规范语言的种类由六类简化为两种不相交的类别：典型非规范语言和歧义非规范语言。
The types of the normal unnormalized language are simplified from six kinds into two disjoint kinds: the typical unnormalized language and the ambiguous unnormalized language.
PLS算子通过聚类分析将种群分割为互不相交的邻域子种群，对每一个子种群应用单纯形法进行并行局部搜索。
PLS partitions the population into a group of disjoint subpopulations by cluster analysis, then USES simplex method to search local optima in each subpopulation in parallel.
本文不利用收缩方法，直接证明了：当图G至多差一边有两棵边不相交的生成树时，G是超欧拉图或者G有割边。
In this note, no using the contraction method, we prove that if a graph G is one edge short of having two edge-disjoint spanning trees, then G has a cut edge or G is supereulerian.
分析载体线振动和角振动所引起的干扰作用，并对几种扭杆轴不相交的单环和双环调谐陀螺方案给出理论分析和评价。
The disturbing torques associated with the lineal and angular vibration of gyro'sfoundation are derived. It gives also the theoretical analysis and evaluation of somedesigns of single-gimbal or…
MSS问题的目标，是在一个二分无向图上寻找由互不相交的路径所构成的集合，并要求这个集合满足一些特定的条件。
The MSS problem seeks to compute a set of vertex-disjoint simple paths in an undirected bipartite graph under certain constraints.
设P和Q为平面内两个互不相交的简单多边形 ，若 P在平面内绕某点旋转 ，文中讨论了其旋转可移动性问题 。
Let P and Q be two nonintersecting simple polygons in the plane, this paper discusses the rotational movability of them if P rotates around a point and collides with Q .
Barham的实现仅在一个小的集合中(字母数字加一些其它字符)查看相对较短和不相交(disjoint)的字符序列。
Barham's implementation simply looks for relatively short, disjoint sequences of characters in a small set (alphanumeric plus a few others).
只有在平坦的宇宙中，空间才符合标准的几何规律——三角形的内角和精确地等于180度，平行线永远不相交。
Only in a flat universe does space obey all the standard geometry-class rules-the angles of a triangle add up to exactly 180 degrees and parallel lines never meet.
我不相信艺术偏好是随时间和文化现性递增的。不是所有的文化都会在某一点相交。
I do not believe the artistic preference timeline is linear across time and cultures and that all cultures pass through the same points.
通过使用新的分析技术，埃雷兹·李伯曼和他的同事发现，基因组片段紧密地构成了一个“分形球”（译注：想象一下由面条揉成的球），尽管基因组片段相互扭曲纠缠，但它们之间却没有节点（译注：也就是面条球里的每根面条都不相交）。
Using new analytic techniques, Erez Lieberman and colleagues found that the genome is packed into what’s called a “fractal globule”—despite being intensely twisted, the string of genes never knots.
并且，我们利用可靠性理论对相交和不相交两种情况下的路由可靠性进行了理论分析。
Furthermore, we utilize the reliability theory to analyze the route reliabilities of disjoint and non-disjoint multipath routings.
该算法利用网格中节点的地理信息进行路由，并且选择一条最稳定的不相交备用路由。
EASBRA utilizes the node's geographical information to route and selects the most stable disjoint backup route.
本文提出的方法在目的端利用获得的中间节点位置信息来生成无向图，再利用广度优先遍历算法BFS计算出另外一条不相交路径。
This method USES intermediate nodes' location information to create undirected graph at destination node, and USES Breath-First Search (BFS) algorithm to find another disjoint path.
说明：输入两个矩形，判断两个矩形是否相交，如果相交，计算出相交的面积，不相交返回。
Input the two rectangular determine whether two rectangles intersect if intersect, calculate the area of the intersection of disjoint return.
说明：输入两个矩形，判断两个矩形是否相交，如果相交，计算出相交的面积，不相交返回。
Input the two rectangular determine whether two rectangles intersect if intersect, calculate the area of the intersection of disjoint return.
应用推荐