全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多

 邻接 的翻译结果: 查询用时：1.627秒
 历史查询

 邻接
 We also prove an adjacency matrix of bipartite graph G is Hadamard matrix, its sufficient and necessary condition is G=K 2∪K 2. 偶图G 的邻接矩阵是Hadamard矩阵充分必要条件是 G =K2 ∪K2 . 短句来源 (2) the disjoint union of graph Z_n1, Z_n2, Z_nk (denoted by Z_n1 +Z_n2 + ... + Z_nk) is determined by its adjacency spectrum, where all the numbers n1,n2,. . (2) 图Z_n的不相交的并Z_(n1)+Z_(n2)+…+Z_(nk)能由其邻接谱确定,其中,n_1,…,n_k都是大于1的正整数; 短句来源 We discuss the characteristic of Hadamard matrices corresponding Graphs. We prove the adjacency matrices of K 1, K 2∪K 2, K 3∪K 1,K 4 alone are Hadamard matrices in 4 order graphs. 讨论Hadamard矩阵对应的简单图类的邻接矩阵的特征及其相互关系 ,证明了 1- 4阶Hadamard矩阵对应的图只有 K1、K2 ∪K2 、K3 ∪K1和K4; 短句来源 Denote the adjacency matrix of a graph G by A(G); 图G的邻接矩阵记作A（G）。 短句来源 In a simple graph G = (V,E), let the matrix A(G) = (aij)n×n be the adjacency matrix of G, so the eigenvalues of A(G) are named the eigenvalues of G. 在单图G=(V,E)中,用A(G)=(α_(ij))_(n×n)表示图G的邻接矩阵,则矩阵A(G)的特征值称为图G的特征值。 短句来源 更多
 We call n×n matrix A(G) = (a_(ij)), where a_(ij) = 1 if v_i is adjacent to v_j, and a_(ij)= 0 otherwise, the adjacent matrix of G. 称n阶矩阵A(G)=(a_(ij))为图G的邻接矩阵,其中若v_i与v_j相邻,则a_(ij)=1,否则a_(ij)=0。 短句来源 Based on the adjacent matrix, a new topological index mT was set up: mT =∑ δ i· δ j·δ k …) 0 5 ,in which 0 T and 1 T among mT is defined as : 0 T =∑( δ i ) 0 5 , 1 T =∑( δ i · δ j ) 0 5 . The 0 T ( 1 T ) values of 142 molecules for 10 series of compounds were calculated. 在邻接矩阵的基础上 ,建立一种新的拓扑指数 mT ,mT =∑ (δi·δj·δk… ) 0 5 ,其中0 T =∑ (δi) 0 5 ,1T =∑ (δi·δj) 0 5 ,并计算了 1 0个系列 1 42个分子的0 T ,1T值 . 短句来源 Based on the adjacent matrix, a new topological index mT was set up: mT =Σ( δ i·δ j·δ k …) 0.5 , 0 T and 1 T among mT is defined as: 0 T =Σ( δ i ) 0.5 , 1 T =Σ( δ i·δ j ) 0.5 . The 0 T ( 1 T ) values of the molecules of 61 compounds are calculated. 在邻接矩阵的基础上 ,建立一种新的拓扑指数 mT :mT =Σ(δi·δj·δk… ) 0 .5,其中 :0 T =Σ(δi) 0 .5,1T =Σ(δi·δj) 0 .5,并计算了 61种化合物分子的0 T、1T值。 短句来源 G~1 Continuity Conditions of Two Adjacent B-spline Surfaces 两邻接B样条曲面的G~1连续条件 短句来源 The Laplacian matrix is denoted by L(G)=D(G)-A(G),and let matrix M(G)= D(G) +A(G),where A(G)and D(G) are the adjacent matrix and degree-diagonal matrix of a n-order simple graph G respectively. :记 Laplace矩阵 L(G) =D(G) - A(G) ,而 M(G) =D(G) +A(G) ,其中A(G) ,D(G)分别为 n阶简单图 G的邻接矩阵与度对角矩阵 . 短句来源 更多
 By building the adjoining matrix, confirming the start-point of searching,vectorizing the searching sides,calculating the direction factor of adjoining sides,we can search out the next side of the least loop or the most loop rapidly. 算法依据图论知识 ,建立改进后的无向图邻接矩阵 ,根据节点坐标确定搜索始点 ,将搜索边矢量化 ,结合节点坐标求解邻接边的方向因子 ,按方向因子的大小可以快速确定搜索边 ,形成了无向图中最小回路、最大回路搜索算法。 短句来源 The edges of adjoining endothelial cells overlap or interdigitate for some distance, and are separated by narrow space about 20nm wide. 细胞邻接处相互重叠或嵌合,有20nm宽的间隙相隔。 短句来源 After conformed the adjoining label table,the feature information of adjoining label is merged to get the target features. 在对邻接表整合后,将相邻标记的特征信息合并,从而获得视场中各目标的特征。 短句来源 Aquality of service (QoS) routing based on unidirectional Ad-hoc (QRUA) protocol which can support QoS controlled routing is given to satisfy the demands of Ad-hoc networks with unidirectional links. Through using upper table (UT) between adjoining hosts to choose the route with the limitation of bandwidth and delays,the QRUA can perform well in the scenarios of Ad-hoc networks with unidirectional links. 针对Ad_Hoc移动网络的特点,提出了一种支持单向Ad_Hoc移动网络,并且具有QoS控制的路由协议QRUA,该协议充分考虑了网络存在的单向链路,利用邻接主机之间的上游主机表UT来选择满足延时和带宽要求的路由,从而可以适应特定环境下单向Ad_Hoc移动网络的QoS应用需求。 短句来源 This paper presents a new simple storage mode of node and branch information, th is storage mode bases on the adjoining list. 本文提出了一种简单的基于邻接表的节点和支路信息存储方法 ,使用该方法可以不依赖节点和支路的编号顺序进行网络再构 ,具有修改简单和存储方便的特点。 短句来源 更多
 subjacency
 In order to test this hypothesis, based on previous works by Uziel(1993), Martohardjono(1991) , Flynn(1987), and White(1988), I conducted a study which examined the acquisition of Subjacency by mainland Chinese speakers learning English as a second language. 为了检验此假设，在Uziel(1993)，Martobardiono(1991)，White(1988)，Flynn(1987)等研究的基础上，我在中国大陆英语学习者身上进行了实验研究，调查邻接原则的习得。 短句来源 A Research on the Accessibility of Subjacency Principle in Adult Second Language Acquisition 成人二语习得中邻接原则的可及性研究 短句来源 If UG principles are fully accessible to the foreign language learners , and the process of foreign language learning is a process of parameter-reassignment in which the L2 learner resets the parameter-values of the L1 to their values in the L2, then in learning English , Chinese learners are able to acquire English wh-questions under the constraints of Subjacency Principle . 若普遍语法原则对于成人外语学习者来说完全可及，外语学习的过程是一种参数重设的过程：二语学习者把其母语参数值重设为二语参数值，那么中国的成人英语学习者则能成功地习得邻接原则。 短句来源 The experimental results show that Subjacency can successfully be acquired even if the first language lacks it or applies it in different domains, and Chinese learners are found to be capable of resetting the parameter value of Subjacency principle to the English setting, thus successfully acquiring a property of language almost never taught in language classroom . 实验结果显示即使母语中邻接原则的应用域不同，中国英语学习者仍能成功习得这条原则; 他们能重设邻接原则的英语参数值，从而习得语言课堂上从没教过的语言属性。 短句来源 The formation of English special questions is constrained by the Subjacency Principle in Universal Grammar (UG), the English learners of natives or foreigners do not make 'impossible' mistakes in acquiring English special questions. 英语特殊疑问句的构成受普遍语法中邻接原则(SubjacencyPrinciple)的制约,作为母语或二语的英语学习者在习得英语特殊疑问句时不会犯'不可能'的错误。 短句来源

我想查看译文中含有：的双语例句

 Let G be a graph and denote by Q(G)=D(G)+A(G), L(G)=D(G)-A(G) the sum and the difference between the diagonal matrix of vertex degrees and the adjacency matrix of G, respectively. A stepwise optimization algorithm for a network with given adjacency matrix based on a algorithm for constructing minimal-cost routes is designed. By the local optimal Steiner tree is meant a tree with optimally distributed Steiner points for a given adjacency matrix. The adjacency matrix defines the point of local minimum, and all arrangements (coordinates) of the Steiner points that are admissible for it define the minimum neighborhood. To a graph (or a digraph) Γ we assign two matricesN(A) andN(-1)(A) of inner products of the vector rows and of the vector columns, respectively, of the adjacency matrix of Γ; these matrices are said to be adjoint. 更多
 A local-global principle is proved by the second named author in the adjacent paper of this volume. This wavelet basis is obtained from three wavelet generators by scaling, translation and rotation, and the wavelets are supported either by one corner triangle or a pair of adjacent triangles in the triangulation of level k - 1. A subset D of V is called a dominating set of G if for every vertex κ,εV-D,κ is adjacent to at least one vertex of D. The interchange graph G(R,S) is the graph where the vertices are the matrices in U(R,S) and two vertices representing two such matrices are adjacent provided they differ by an interchange. The paper gives two estimates of the distance between adjacent zeros of solutions of the first-order delay differential equations x'(t)+p(t)x(t-τ)=0 in the case when p(t)≥0 and oscillates or p(t) itself oscillates. 更多
 abut
 In primitive lattices the L-simplexes of doubled volume abut the basic L-simplexes by 4-dimensional faces. and the14C activity as well, was reduced by abut one half in treatrrrent with cytochaliisin B, and much less by amiphos-methyl treatment. The lower ampullary setae almost abut against the upper ampullary setae. Patients present with nonspecific neurologic symptoms or visual symptoms and contrast-enhancing lesions that abut a cerebrospinal fluid (CSF) space. The inbreeding species appear to have co-evolved a floral structure in which some anthers abut on the stigma prior to anthesis. 更多
其他
 点击这里查询相关文摘
 相关查询

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

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社