期刊文献+

ON THE ALGORITHMIC COMPLEXITY OF STATIC STRUCTURES

ON THE ALGORITHMIC COMPLEXITY OF STATIC STRUCTURES
原文传递
导出
摘要 This paper provides a first indication that this is true for a system comprised of a static structure described by hyperbolic partial differential equations and is subjected to an external random input force. The system deforms the randomness of an input force sequence in proportion to its algorithmic complexity. The authors demonstrate this by numerical analysis of a one-dimensional vibrating elastic solid (the system) on which we apply a maximally-random force sequence (input). The level of complexity of the system is controlled via external parameters. The output response is the field of displacements observed at several positions on the body. The algorithmic complexity and stochasticity of the resulting output displacement sequence is measured and compared against the complexity of the system. The results show that the higher the system complexity, the more random-deficient the output sequence.
出处 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2010年第6期1037-1053,共17页 系统科学与复杂性学报(英文版)
关键词 Data compression descriptional complexity RANDOMNESS static structure. 算法复杂性 静态结构 作者 双曲型偏微分方程 随机输入 输出序列 输出响应 位移测量
  • 相关文献

参考文献20

  • 1G. J. Chaitin, A theory of program size formally identical to information theory, Journal of the ACM, 1975, 22(3): 329-340.
  • 2A. V. Deshmukh, J. Talavage, and M. Barash, Complexity in manufacturing systems, part 1: Analysis of static complexity, IIE Transactions, 1998, 30(7): 645-655.
  • 3V. V. Vyugin, Algorithmic complexity and stochastic properties of finite binary sequences, The Computer Journal, 1999, 42: 294-317.
  • 4J. Ratsaby, An algorithmic complexity interpretation of Lin's third law of information theory, Entropy, 2008, 10(1): 6-14.
  • 5J. Ratsaby, On the randomness in learning, Proc. of 7 th IEEE International Conference on Computational Cybernetics, ( ICCC'09), 2009: 141-145.
  • 6J. Ratsaby, On the sysratio and its critical point, Mathematical and Computer Modelling, 2010.
  • 7J. Ratsaby, Some consequences of the complexity of intelligent prediction, Broad Research in Artificial Intelligence and Neuroscience, 2010, 1(3): 113-118.
  • 8J. Ratsaby, On the relation between a system's complexity and its interaction with random environments, Proceedings of International symposium on stochastic models in reliability engineering, life sciences and operations management (SMRLO'10), 2010: 893-901.
  • 9J. Ratsaby, An empirical study of the complexity and randomness of prediction error sequences, Communications in Nonlinear Science and Numerical Simulation, in Press, 2010.
  • 10J. Ratsaby and I. Chaskalovic, Random patterns and complexity in static structures, Proc. of International Conference on Artificial Intelligence and Pattern Recognition ( AIPR '09), Mathematics and Computer Science, 2009: 255-261.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部