互不相交 meaning in Chinese
mulually disjoint
mutually disjoint
Examples
- By the method of " every open set in r " is the union of an at most countable collection of disjoint connected open sets " , the paper deals with some problems of countability in real analysis
摘要以“平面上互不相交的若干开集所成之族至多可数”为基点，对一些相关结果给出了全新的直观化证明。 - Clre is designed as pipeline pattern , so every module on the pipeline will be given a flow chart ( by pseudo code ) and interface design chart ( uml ) . for the page , the basic algorithm like signal processing and monte carlo are not include
由于clre是基于流水线设计的,在流水线上每个模块都有互不相交的功能,本文会给出每个模块的执行流程(伪代码)和接口设计( uml ) 。 - A book embedding of a graph g consists of placing the vertices of g on the spine in an order specified by a linear ordering of v ' ( g " ) and assigning edges of the graph to pages so that edges assigned to the same page can be drawn on that page without crossing each other
给定图g的书式嵌入包括两部分内容：首先将g的顶点按照一个由线性标号所定义的顺序嵌入书脊上，其次将e ( g )中的每条边分放于各页，使得每页中的边均可画在该页上而互不相交。 - Relying on the theorem of graham , the sample points are realized the minimal convex hull which computational complexity is o ( nlogn ) . last a new feature extraction - convex - body segmentation and approximation of scattered sample for non - linear classification based on the knowledge of computing geometry and discrete mathematics is presented . new algorithm guarantees that every convex hull is unintersectant . both convex hull between the same classes and convex hull between the different classes are unintersectant
在此基础上,借助计算几何和离散数学等相关知识,为非线性分类问题中的特征提取提出新的思路-散乱样本凸体分割与逼近算法,算法保证了两类样本形成的凸包两两互不相交,即同类样本之间、同类和异类之间形成的凸包互不相交,并且凸包数量逼近最少,为非线性分类提供了新的研究思路。