拓扑型的英文

• topological type

• "拓扑"英文翻译    topology
• "型"英文翻译    mould; model
• "拓扑" 英文翻译 :    topology
• "dfs拓扑" 英文翻译 :    dfs topology /
• "层拓扑" 英文翻译 :    etale topology
• "泛拓扑" 英文翻译 :    universal topology
• "积拓扑" 英文翻译 :    product topology
• "杰拓扑" 英文翻译 :    ej-top
• "紧拓扑" 英文翻译 :    compacttopology
• "开拓扑" 英文翻译 :    compact-open topology
• "强拓扑" 英文翻译 :    majorant topology; strong topology
• "弱拓扑" 英文翻译 :    weak topology
• "商拓扑" 英文翻译 :    quotient topology
• "拓扑的" 英文翻译 :    topological
• "拓扑地" 英文翻译 :    topologically
• "拓扑法" 英文翻译 :    topological approach; topological method
• "拓扑格" 英文翻译 :    topological lattice
• "拓扑和" 英文翻译 :    topological sum
• "拓扑化" 英文翻译 :    topologize
• "拓扑环" 英文翻译 :    topological ring
• "拓扑积" 英文翻译 :    topological product
• "拓扑廖" 英文翻译 :    topological manifold
• "拓扑码" 英文翻译 :    topological codes
• "拓扑偶" 英文翻译 :    topological pair
• "拓扑群" 英文翻译 :    continuous group; topological groups

• On topology - type optimization of trusses under multiple load cases
  多工况下杆系结构拓扑型优化设计
• Some topological minimax theorems
  几个拓扑型极大极小定理
• And then , some people presented two - level topology - aware collective communication operation algorithm ( e . g . magpie )
  于是，近来有人提出了两层的已知拓扑型集合通信算法(例如magpie ) 。
• In the paper , we modified the algorithm ' s condition that the root process of broadcast is po is , it can satisfy the instance that the root of a broadcast is an arbitrary process p , only with simple change
  本文对根进程是叩的多层已知拓扑型广播算法作了改进，只需要进行简单的变换就可以满足广播的根进程是任意一个p的一般情况。
• Completion time of the collective communication operation is optimal in the grid environment . in this paper , we gave an example about broadcast , analyzed and compared a topology - unaware broadcast algorithm ( e . g . a binomial tree broadcast ) , a two - level topology - aware broadcast ( e . g
  在这篇论文中，我们以广播通信为例，分析比较了未知拓扑型的广播算法，两层的已知拓扑型广播算法（例如ma吵人以及多层的已知拓扑型广播算法（例如mh0十02l并重点研究了网格环境下的多层已知拓扑型广播算法。
• Some existing topology - unaware collective operations algorithms do n ' t make use of the information about network topology . firstly , these approaches construct a model of network topology and make use of a set of parameters to describe the communication characteristics of a network model , then build the optimal trees based parameter values and their models to realize collective communication
  现有的一些未知拓扑型集合通信算法，并不利用网络拓扑结构信息，都是首先对网络模型化，并且用各种参数来描述该模型中网络通信的特点，然后基于此模型和其参数值为集合通信操作构造最优树来实现集合通信。