N头条>英语词典>disjoint翻译和用法

disjoint

英 [dɪsˈdʒɔɪnt]

美 [dɪsˈdʒɔɪnt]

v.  (使)脱节,(使)解体,(使)脱臼

复数:disjoints 现在分词:disjointing 过去式:disjointed 第三人称单数:disjoints 过去分词:disjointed 

COCA.44300

英英释义

verb

  • become separated, disconnected or disjoint
      Synonym:disjoin
    1. make disjoint, separated, or disconnected
        Synonym:disjoin
      1. separate at the joints
        1. disjoint the chicken before cooking it
        Synonym:disarticulate
      2. part
        1. She disassociated herself from the organization when she found out the identity of the president
        Synonym:disassociatedissociatedivorcedisunite

      adj

      • having no elements in common

        双语例句

        • The disjoint collections of code and data reside within explicit boundaries called services.
          这些相互无关的代码和数据的集合,驻留在显示的界限中,也就是服务。
        • A Disjoint Multi-Path Routing Algorithm in Wireless Sensor Network
          无线传感器网络一种不相交路径路由算法
        • To disjoint, slice, and serve meat or poultry. the flesh of the legs of fowl used as food.
          切片把肉或家禽切成片和食用之用作食物的家禽腿部的肉。
        • Causes and Measures of Beam Distortion and Bearing Disjoint of Curved Bridge with Little Radius
          小半径曲线桥梁体扭转、支座脱空原因分析及处理措施
        • Optical networks are more complicated than the traditional graph-theoretic networks with nodes and links, but their reliability can be effectively improved by the use of disjoint paths.
          光网络比传统的包含节点、链路的图论网络更为复杂,使用分离路径能够有效地改善光网络的可靠性。
        • According to the analyses of disjoint path set for MANET, we propose a transmission scope overlapped based definition of disjoint path;
          对移动自组织网络中多路径之间的不相交性进行了研究,给出了一种基于节点传输范围叠交的路径不相交性定义;
        • Barham's implementation simply looks for relatively short, disjoint sequences of characters in a small set ( alphanumeric plus a few others).
          Barham的实现仅在一个小的集合中(字母数字加一些其它字符)查看相对较短和不相交(disjoint)的字符序列。
        • Furthermore, we utilize the reliability theory to analyze the route reliabilities of disjoint and non-disjoint multipath routings.
          并且,我们利用可靠性理论对相交和不相交两种情况下的路由可靠性进行了理论分析。
        • Methods of Decomposing a Complete Graph K_ ( 2n+ 1) into n Edge Disjoint Hamiltonian Cycles
          完全图K(2n+1)的n个H圈的分解方法
        • Algorithms of Disjoint Literature-based Discovery System
          基于非相关文献知识发现系统的算法