助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   无限族 的翻译结果: 查询用时:0.757秒
图标索引 在分类学科中查询
所有学科
互联网技术
数学
更多类别查询

图标索引 历史查询
 

无限族
相关语句
  infinite family
     On Infinite Family of Tight Optimal Double Loop Networks
     关于紧优双环网络的无限族
短句来源
     We also present an infinite family of 7-tight optimal double-loop networks and the first 7-tight optimal double-loop network G(81 190 689; 16 035), which has a diameter of 15 612.
     作为具体应用,给出一个7紧优双环网络的无限族. 首次给出了一个7紧优双环网络G(81190689;16035),其直径为15612.
短句来源
     The purpose is by using the viscosity approximation method to study the cnvergence problem of the iterative scheme for an infinite family of onexpansive mappings and a given contractive mapping in a reflexive Banach space.
     利用粘性逼近方法,在自反Banach空间的框架下,研究无限族非扩张映象及对给定的压缩映象的迭代程序的收敛性问题.
短句来源
     A graph is 1 - regular if its automorphism group acts regularly on the set of its arcs. In this paper, we give a infinite family of sabidussi coset graph of valency 3 on the dihedral group D2n of order 2n. Up to isomorphism, it s a infinite family of a cay ley graph.
     一个图1-正则的,如果它的自同构群在它的弧集上作用正则.本文给出一个二面体群D2n上的3度Sabidussi陪集图无限族,它在同构意义下是某一个Cayley图无限族
短句来源
     In this paper,the main result of Reference [6] is generalized and a constructing method for an infinite family of a general tight optimal double-loop network is presented. As a result,some infinite families of 4-tight and 5-tight optimal double-loop networks are gained.
     本文推广了文献[6]的主要结论,给出一个较一般的紧优双环网络无限族构造方法,从而得到若干类4紧优和5紧优双环网络无限族
短句来源
  infinite families
     In this paper,we give new infinite families of k tight optimal double loop networks,the number of whose nodes being n(t,a) =3t 2+(2i?1)t +B(a),wherei=1,2,3,k=0,1,2,L,20.
     本文构造含n(t,a)=3t 2+(2i-1)t+B(a)个结点的k紧优双环网的无限族,其中i=1,2,3,k=0,1,2,L,20.
短句来源
     The tight optimality of undirected double doop networks G(N;±d,(±d+1)) has been proved,where d=(" !2N-1-1)/2.$Some new infinite families of tight UDLN(undirected double loop networks) are found.
     文中证明了双环网络G(N;±d,(±d+1))是紧优的,其中d=("!2N-1-1)/2;#并给出了G(N;r±,±s)的一些其它紧优多项式无限族
短句来源
     Infinite Families of 4-Tight and 5-Tight Optimal Double-loop Networks
     4紧优和5紧优双环网络无限族
短句来源
     3 Infinite Families of 6-tight Optimal Double-loop Networks
     3类6紧优双环网络无限族
短句来源
     By the aid of computer, we also find 27 new 0-tight optimal infinite families, 26 new 1-tight optimal infinite families, 8 new 2-tight optimal infinite families, and 2 3-tight optimal infinite families.
     另外我们利用计算机搜索还找到了27族新的0-紧优无限族,26族新的1-紧优无限族,8族新的2-紧优无限族,2族3-紧优无限族
短句来源
更多       
  “无限族”译为未确定词的双语例句
     Based on the theory of L-shaped tile,a method for finding non-unit step integers is presented.
     在L形瓦理论的基础上,给出一个求非单位步长双环网络的方法,求得两个关于模型G(N;r,s)的紧优双环网络无限族;
短句来源
     INFINITE FAMIL IES OF 2-TIGHT OPTIMAL DOUBLE LOOP NETWORK
     2紧优双环网络无限族
短句来源
     In §3.2, we given two full conditions of one-regular Cayley graphs with valency four and vertex stabilizer are Z_2 × Z_2 on the alternating group.
     在§3.2中,我们给出了单群上的以Z_2×Z_2作为点稳定子群的4度Cayley图1-正则图的两个充分条件,作为应用,我们构造了4个交错群上的以Z_2×Z_2作为点稳定子群的4度1-正则Cayley图无限族
短句来源
     The Tight Optimal Infinite Faimlies of Undirected Double Loop Networks
     两类新的无向双环网络紧优无限族
短句来源
     New in Finite Families of k Tight Optimal Double Loop Networks
     新的k紧优双环网的无限族
短句来源
更多       
查询“无限族”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  infinite family
We construct, among the others, an infinite family of generalizations of the so-called "X-shaped" waves.
      
Also, an infinite family of semisymmetric Zn × Zn-covers of K3,3 are constructed.
      
(2) for any k ? 0, an infinite family of singular k-tight optimal DLN can be constructed.
      
The purpose is by using the viscosity approximation method to study the convergence problem of the iterative scheme for an infinite family of nonexpansive mappings and a given contractive mapping in a reflexive Banach space.
      
Also, an infinite family of outerplanar graphs with the diameter four having arbitrarily large power domination numbers were given.
      
更多          
  infinite families
Also, new infinite families of completely regular codes are constructed from q-ary Hamming codes.
      
The graphs are derived via embeddings of infinite families of trees (forests) in the hyperbolic plane, and subsequent folding into triply periodic minimal surfaces, including the P, D, gyroid and H surfaces.
      
In this paper, we calculate the star chromatic numbers of three infinite families of planar graphs.
      
A new method for constructing infinite families of k-tight optimal double loop networks
      
In this paper, a new method for constructing infinite families of k-tight optimal DLN is presented.
      
更多          


New algorithm for the calculation of the diameters of double loop networks (DLN ) is presented using the results given by Hu and Mukhopadhyaya. And some new infinite families oftight DLNs are constructed.

利用Mukhopadhyaya等1995年的结果和胡泰培1991年的结果给出了一个计算双环网络(DLN)的直径的新算法,并利用该算法构造了一些新的紧优双环网络无限族

In this paper,two infinite families of2 - tight optimal double loop networks are found.This is an answer to a question proposed by L i et al' s in1993 .

找到两个2紧优双环网络的无限族.这肯定地回答了李乔等人于1993年提出的一个问题.

The optimization of 2L shapes originates from the connection of the local network and alignment of computer data.This paper firstly gives several properties of a general 2L shape,especially it proves that the optimum diameter of 2L shapes is 糐B(3N〗-2, where N is the number of vertices. By this,we give the characteristics of an optimum 2L shape and a necessary and sufficient condition that a 2L shaper is tight. Through a method of finding DLN, we discuss the optimization of several families of...

The optimization of 2L shapes originates from the connection of the local network and alignment of computer data.This paper firstly gives several properties of a general 2L shape,especially it proves that the optimum diameter of 2L shapes is 糐B(3N〗-2, where N is the number of vertices. By this,we give the characteristics of an optimum 2L shape and a necessary and sufficient condition that a 2L shaper is tight. Through a method of finding DLN, we discuss the optimization of several families of 2L shapes.

2 L形问题起源于局域网的连接与计算机的数据的存取.先给出一般2 L的几个性质,特别地,给出一般2 L形的最优直径.由此,给出了2 L形达到最优时的特征以及2 L为紧(或几乎紧)的充要条件.透过找紧优和几乎紧无限族的一种方法,讨论了几族2 L形的最优化问题.

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关无限族的内容
在知识搜索中查有关无限族的内容
在数字搜索中查有关无限族的内容
在概念知识元中查有关无限族的内容
在学术趋势中查有关无限族的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社