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

图标索引 历史查询
 

recurrence properties
相关语句
  递推性质
     Recurrence Properties on the Partition Function
     划分函数的递推性质
短句来源
  “recurrence properties”译为未确定词的双语例句
     All sequences corresponding in one-to-one to directed walks in a directed graph G with element of points in G are called graphical sequences of G. This paper discusses some recurrence properties for generating function of graphical sequences, mainly including cut point theorem, cut edge theorem, delete point formula. Using there properties can simplify the computation of generating function of graphical sequences.
     以有向图G的顶点为元素,G的有向途径所对应的序列称为图型序列.本文讨论图型序列母函数的一些递归性质,主要包括割点定理,割边定理和删点公式.利用这些性质可以简化图型序列母函数的计算.
短句来源
  相似匹配句对
     Recurrence Properties on the Partition Function
     划分函数的递推性质
短句来源
     Recurrence and early metastasis are its biological properties.
     其恶性程度高,侵袭性强,易复发、易早期转移。
短句来源
     The technological properties.
     本文介绍了累托石粘土的性能和开发利用现状。
短句来源
     THE TECHNICAL PROPERTIES OF S. B. R
     SBR法工艺特性研究
短句来源
     (4) recurrence;
     (4 )边缘复发 ;
短句来源
查询“recurrence properties”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  recurrence properties
Recurrence properties of a point particle moving on a regular lattice randomly occupied with scatterers are studied for strictly deterministic, nondeterministic, and purely random scattering rules.
      
Recurrence properties of Lorentz lattice gas cellular automata
      
For such processes we can estimate explicitly the diffusion exponent, the recurrence properties, and the large fluctuations.
      
The rotation of the solar corona has been studied using recurrence properties of the green coronal line (5303 ?) for the interval 1947-1970.
      
Mean and recurrence properties of the temperature in dynamic thermoelasticity
      
更多          


All sequences corresponding in one-to-one to directed walks in a directed graph G with element of points in G are called graphical sequences of G. This paper discusses some recurrence properties for generating function of graphical sequences, mainly including cut point theorem, cut edge theorem, delete point formula. Using there properties can simplify the computation of generating function of graphical sequences.

以有向图G的顶点为元素,G的有向途径所对应的序列称为图型序列.本文讨论图型序列母函数的一些递归性质,主要包括割点定理,割边定理和删点公式.利用这些性质可以简化图型序列母函数的计算.

This paper discusses some properties for multivariate generating function of graphical sequences, including cutset theorem and some recurrence properties. Using these properties one can simplify the computation of multivariate generating function of graphical sequences.

本文讨论了图型序列多元母函数的性质,给出了割集定理和一些递归性质.利用这些性质可简化图型序列多元母函数的计算.

In this paper, we summarize our recent work on some complexity problems in dynamical systems related to chaos, entropy and recurrence properties under the ideas of localization (pairs or tuples). We solve a long open problem by proving that Devaney chaos implies Li-Yorke one. We show that there are ‘many' compacta admitting completely scrambled homeomorphisms, which include some countable compacta, the cantor set and continua of arbitrary dimension. Using the local notions of entropy: entropy tuples and...

In this paper, we summarize our recent work on some complexity problems in dynamical systems related to chaos, entropy and recurrence properties under the ideas of localization (pairs or tuples). We solve a long open problem by proving that Devaney chaos implies Li-Yorke one. We show that there are ‘many' compacta admitting completely scrambled homeomorphisms, which include some countable compacta, the cantor set and continua of arbitrary dimension. Using the local notions of entropy: entropy tuples and sequence entropy pairs, we characterize the structures of a topological K-system and a topological null system. Finally, we give a finer classification of recurrence properties in terms of weak disjointness, complexity function of an open cover, and access time set.

基于局部化(点对或点串)的思想,本文总结了作者近年来在与混沌、熵以及系统回复属性相关的系统复杂性问题方面所取得的进展.解决了Devaney混沌是否蕴含着Li-Yorke混沌这一长时间的公开问题.并说明了“许多”紧度量空间其上存在完全混沌的系统,这些空间包括一些可数的紧度量空间、康托集和任意维的连续统.借助于熵串和序列熵对,刻画了拓扑K系统以及拓扑null系统的结构.最后,使用弱不交性、开覆盖的复杂性函数以及回复时间集对系统回复属性进行了更为细致的分类.

 
图标索引 相关查询

 


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

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