不连通的的英文

• disconnected
• noncommunicating

• "不"英文翻译    a block of wood
• "连通"英文翻译    feed through; connection; co ...
• "的"英文翻译    4次方是 The fourth power of 2 i ...
• "不连通的孔" 英文翻译 :    non intercommunicating pore; non-intercommunicating pore
• "极不连通的" 英文翻译 :    extremelly disconnected
• "全不连通的" 英文翻译 :    totally disconnected
• "不连通的孔隙" 英文翻译 :    dead end pore; disconnect pore
• "互不连通的层" 英文翻译 :    noncommunicating layers
• "完全不连通的" 英文翻译 :    totally disconnected
• "完全不连通的集" 英文翻译 :    punctiform set
• "完全轨态不连通的" 英文翻译 :    totally pathwise disconnected
• "连通的" 英文翻译 :    interconnected
• "部分连通的" 英文翻译 :    partially communicating
• "单侧连通的" 英文翻译 :    unilaterably connected
• "单连通的" 英文翻译 :    einfach zusammenhaengend simply connected; simply-connected
• "弧连通的" 英文翻译 :    bogenweise zusammenhaengend arcwise connected
• "局部连通的" 英文翻译 :    locally-connected; lokal zusammenhaengend locally connected
• "连通的空隙" 英文翻译 :    communicating interstices
• "连通的孔隙" 英文翻译 :    communicating interstices; interconnected pores
• "强连通的图" 英文翻译 :    strongly connected graph
• "完全连通的" 英文翻译 :    full communicating
• "不连通层" 英文翻译 :    non-communicating layer
• "不连通构造" 英文翻译 :    cul-de-sac structure
• "不连通集" 英文翻译 :    disconnected set; disconnecting set
• "不连通空间" 英文翻译 :    disconnected space; unconnected space

• Otherwise g is disconnected .
  否则称G是不连通的。
• This happens if the graph is disconnected or has a cutvertex .
  如果一个图是不连通的或有割点，就发生这种情况。
• Even an air-entraining agent can be used because the minute pores are discontinuous .
  甚至可以使用加气剂，因为小的气孔是不连通的。
• A class fractal set of perfect disconnected
  一类完全不连通的分形集合
• Otherwise g is disconnected
  否则称g是不连通的。
• This algorithm could fast determine disconnected depressions and their influence areas on the basis of acquiring digital tide - coordinates shorelines ( dts )
  此算法在提取数字伴潮海岸线( dts )的基础上，快速确定不连通的洼地及其影响域。
• In chapter 2 , we study the simple separable function sets ( m = 2 ) whose relation graph are connective or disconnective respectively , and achieve some useful results
  第二章分别对关系图连通和不连通的二元单纯可离函数集进行讨论，获得了一些有用的结果。
• Gradient - based multidisciplinary design optimization methods can not be used directly to problems with discrete and integral design variables or with disjoint design space , and they have a propensity to converge to a relative optimum closest to the starting point
  摘要现有基于梯度的多学科设计优化算法难于处理具有离散和整数设计变量、设计空间非凸或不连通的多学科设计优化问题，并且倾向于收敛到接近初始点的局部最优点。
• Let f be a biquadratic polynomial , then ( 1 ) the julia set of f is connected if and only if the orbits of all critical pionts are bounded ; ( 2 ) the julia set of f is totally disconnected if and only if every connected component of the filled julia set of f containing critical points is not periodic under iterations : ( 3 ) if f does not satisfy the conditions ( 1 ) and ( 2 ) , then the julia set of f has infinitely many non - trivial connected components , where a component is trivial if it contains only one point
  A集是完全不连通的当且仅当f的任何临界声、不属于填充julm集的周期分支内。你当j的临界卢、不满足条件小， ” j时， f的几ha集有可数个非平凡的连通分支，这里，一个分支是平凡的，如果它仅由一个卢、组成。 。
• But the difficulty with these two parameters is that they do not take into account what remains after the graph is disconnected . in fact , on one hand , it is often found that two graphs with the same number of vertices ( edges ) and the same connectivity ( edge - connectivity ) ) may result in entirely different forms after a minimum disconnecting set of vertices ( edges ) is removed , one may be totally disconnected while the other may consist of a few very stable components , and thus be much easier to reconstruct
  对于两个具有相同点(边)数，具有相同点连通度(边连通度)的图，从图中分别去掉使图不连通的点(边)集后，所得图的结构可能完全不同，这是因为点连通度、边连通度和局部点、边连通度等连通性参数仅反映了系统被破坏的难易程度，而对系统遭受破坏的程度并没有明确的反映。