搜索

x

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

格子复杂性和符号序列的细粒化

柯大观 张 宏 童勤业

引用本文:
Citation:

格子复杂性和符号序列的细粒化

柯大观, 张 宏, 童勤业

Lattice complexity and fine-graining of symbolic sequence

Ke Da-Guan, Zhang Hong, Tong Qin-Ye
PDF
导出引用
  • 提出一种新的有限长一维符号序列的复杂性度量——格子复杂性,建立在LempelZiv复杂性和一维迭代映射系统的符号动力学基础上.同时提出了符号序列的细粒化方法,可与格子复杂性以及LempelZiv复杂性结合.新度量在细粒化指数较小时与LempelZiv复杂性基本一致,在细粒化指数增大时显示出截然不同的特性.以Logistic映射为对象的计算实验表明,格子复杂性对混沌区的边缘最敏感.最后还讨论了上述复杂性度量的其他一些重要性质.
    A new measure of complexity for finite symbol sequences, named as lattice comple xity, is presented, based on LempelZiv complexity and the symbolic dynamics of onedimensional iterated maps system. To make lattice complexity distinguished from LempelZiv measure, an approach called finegraining method is also prop osed. When finegraining order is small enough, the two measures are almost equ al. When finegraining order goes to large, the differentiation between them be comes apparent. Applying these measures to studies of logistic map, we find thos e be regarded as complex sequences by lattice complexity are clearly generated a t the edge of the chaotic region. The derived properties of the measures are als o discussed.
    • 基金项目: 国家自然科学基金(批准号:30170267)和国家重大基础研究前期研究专项(批准号:2002CCA 01800)资助的课题.
计量
  • 文章访问数:  6992
  • PDF下载量:  872
  • 被引次数: 0
出版历程
  • 收稿日期:  2004-02-17
  • 修回日期:  2004-05-24
  • 刊出日期:  2005-01-05

/

返回文章
返回