期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
ON THE ALGORITHMIC COMPLEXITY OF STATIC STRUCTURES
1
作者 Joel RATSABY J. CHASKALOVIC 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2010年第6期1037-1053,共17页
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 syst... 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. 展开更多
关键词 Data compression descriptional complexity RANDOMNESS static structure.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部