助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   equivalence relations 的翻译结果: 查询用时:0.189秒
图标索引 在分类学科中查询
所有学科
数学
自然地理学和测绘学
更多类别查询

图标索引 历史查询
 

equivalence relations
相关语句
  等价关系
     The Green's equivalence relations L,R,H,F,D on bisimple ω-inverse semigroups are presented.
     在双单ω-逆半群上给出了L,R,H,F,D等格林等价关系
短句来源
     Fuzzy Mixed Equivalence Relations
     Fuzzy混合等价关系
短句来源
     In this paper, five equivalence relations on the gamma rings are defined. They are Green's equivalences, i.e. L, R, D, H, J.
     在Γ-环上定义了五类等价关系,它们是Green等价L,R,D,H,J.
短句来源
     Fuzzy Mixed Equivalence and Strong Equivalence Relations
     Fuzzy混合等价及强等价关系
短句来源
     In this paper, equivalence relations between the derivatives of Szász-Mirakjan operators and the smoothness of the function they approximate are given.
     本文研究Szász-Mirakjan算子的导数与函数的光滑性之间的等价关系
短句来源
更多       
  “equivalence relations”译为未确定词的双语例句
     And so theorem 37, 37'refered to in[1]are also expanded. At the same time, a series of equivalence relations in respect to almost periodic recurrent motions are obtained.
     由此又推广了[1]的定理37、37,同时进一步得到与运动f(p,t)的几乎周期性相等价的一系列关系,从而把A.
短句来源
     This note established equivalence relations among the matrix norms related to the l p norm and the l p operator norm for 1 p∞ , which completes the comparison results in .
     1.IntroductionForapositivenumber1p∞andacomplexmatrixA=(aij)∈Cn×n,wedenoteby|A|p=ni,j=1|aij|p1pthelpnormofthematrixA,andbyA. .
短句来源
     From behavior matrix,the definition of statewise equivalence relations and automata equivalence of the complete synchronous lattice-valued automata are given,from the statewise equivalence relations,reducible condition and minimization algorithm of this kinds of automata are obtained.
     从行为矩阵出发,给出了完备的同步格值自动机状态等价和自动机等价的定义,从自动机的状态等价,研究了该自动机可约简的条件,并得到了该自动机的最小化算法。
短句来源
     And so theorem 37, 37' refered to in [1] are also expanded. At the same time, a series of equivalence relations in respect to almost periodic recurrent motions are obtained.
     由此又推广了[1]的定理37、37′,同时进一步得到与运动f(p,t)的几乎周期性相等价的一系列关系,从而把的结果与P.
短句来源
     ON EQUIVALENCE RELATIONS AMONG SOME KIND OF GENERALIZED NILPOTENCIES IN X-GROUPS
     X-群中几种广义幂零性的等价性
短句来源
更多       
  相似匹配句对
     The relations of E.
     而E.
短句来源
     Equivalence Relations Based on Logic
     基于逻辑上的等价关系
短句来源
     N-ary Fuzzy Equivalence Relations
     n元模糊等价关系
短句来源
     The Algebra Equivalence
     代数的等价
短句来源
     Ten Relations
     处理十种关系优化外企管理
短句来源
查询“equivalence relations”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  equivalence relations
Finite Equivalence Relations on Algebraic Varieties and Hidden Symmetries
      
In each case the equivalence relations connecting the solutions of the radiation and diffraction problems are derived.
      
Such equivalence relations are said to be monadic.
      
Reducibility between monadic equivalence relations is studied.
      
The results obtained are similar to theorems of modern descriptive set theory on the reducibility of Borel equivalence relations.
      
更多          


In this paper sufficient and necessary Conditions of almost periodic motiors f(P, t)are obtained. Thus, A. Markov’s theorem(i, e. theorem 38 in reference [1])is expanded. And so theorem 37, 37'refered to in[1]are also expanded. At the same time, a series of equivalence relations in respect to almost periodic recurrent motions are obtained. As a consquence, the results obtained by A. Markov, P. Franclin, V.V. Stepanov and A. Tihonov are unified.

本文推广了A.MapkoB的定理(即[l]定理38),得到f(p,t)为几乎周期运动的充要条件是:f(p.t)对于f(p;I)是正向Ляпунов均匀稳定,且是负向Lagr-ange稳定的。由此又推广了[1]的定理37、37,同时进一步得到与运动f(p,t)的几乎周期性相等价的一系列关系,从而把A.MapxoB的结果与P.Franclin ,B.B.Crenanon和A.Tихонов等所得到的关于f(p,t)几乎周期性的结果统一了起来。

In this paper sufficient and necessary Conditions of almost periodic motiors f(p,t) are obtained. Thus, A. Markov's theorem (i, e. theorem 38 in reference [1]) is expanded. And so theorem 37, 37' refered to in [1] are also expanded. At the same time, a series of equivalence relations in respect to almost periodic recurrent motions are obtained. As a consquence, the results obtained by A. Markov, P. Franclin, V. V. Stepanov and A. Tihonov are unified.

本文推广了■的定理(即[1]定理38),得到f(p,t)为几乎周期运动的充要条件是:f(p,t)对于f(p;I)是正向均匀稳定,且是负向Lagrange稳定的。由此又推广了[1]的定理37、37′,同时进一步得到与运动f(p,t)的几乎周期性相等价的一系列关系,从而把的结果与P.Franclin,和等所得到的关于f(p,t)几乎周期性的结果统一了起来。

Recently, F. Rubin implemented on System/360 Model 67 the planarity algorithm of G. Demoucron et al., and found that it ran, in most ordinary cases, about twice as fast as the well-known algorithm of J. Hopcroft and R. Tarjan, although the latter is theoretically a linear one. As F. Rubin remarked at the end of his paper, that his algorithm can be further improved. Particul.arly, in order to look for an embeddable chain, the algorithm must heuristically search in P(G_k), the class of all pieces relative to G_k....

Recently, F. Rubin implemented on System/360 Model 67 the planarity algorithm of G. Demoucron et al., and found that it ran, in most ordinary cases, about twice as fast as the well-known algorithm of J. Hopcroft and R. Tarjan, although the latter is theoretically a linear one. As F. Rubin remarked at the end of his paper, that his algorithm can be further improved. Particul.arly, in order to look for an embeddable chain, the algorithm must heuristically search in P(G_k), the class of all pieces relative to G_k. In this paper, we first introduce an equivalence relation in P(G_k) and then show that it is sufficient only to search anyone of the equivalence subclasses of P(G_k). Furthermore, by storing all pieces in two stacks, we make the search more directed and rapid. We also use a circularly linked list to store planar representations, so that the amount of storage required by our planarity algorithm is only 22m while Rubin algorithm's is 39m, where m is the vertex number of the given graph. has been programmed in ALGOL and implemented on a small computer whose compiler can not deal with recursive procedures. The object program consists of about 2400 instructions.

Rubin最近在System/360 Model67上实现了Demoucron等人的平面性算法,发现它在通常大多数情况下要比目前堪称最优的Hopcroft &Tarjan算法约快一倍。本文改进了Rubin的算法,使它不再需在整个P(Gk)中而仅需在其任一子等价类中探索可嵌链,且因采用了较恰当的数据结构,也使所需的总存储量从Rubin的约39m剧减到约22m(m是给定图的顶点个数)。

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

 


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

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