Computational Measurements of the Transient Time and of the Sampling Distance That Enables Statistical Independence in the Logistic Map
暂无分享,去创建一个
[1] Gh. Mihoc,et al. Matematici aplicate în statistică , 1962 .
[2] David Taniar,et al. Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part I , 2006, ICCSA.
[3] A. Vlad,et al. Generating identically and independently distributed samples starting from chaotic signals , 2005, International Symposium on Signals, Circuits and Systems, 2005. ISSCS 2005..
[4] Michael C. Mackey,et al. Chaos, Fractals, and Noise , 1994 .
[5] Riccardo Rovatti,et al. Chaotic Electronics in Telecommunications , 2000 .
[6] Adriana Vlad,et al. Revealing Statistical Independence of Two Experimental Data Sets: An Improvement on Spearman's Algorithm , 2006, ICCSA.
[7] Marina L. Gavrilova,et al. Computational Science and Its Applications - ICCSA 2007, International Conference, Kuala Lumpur, Malaysia, August 26-29, 2007. Proceedings, Part I , 2007, ICCSA.
[8] William H. Beyer,et al. Handbook of Tables for Probability and Statistics , 1967 .
[9] M. Baptista. Cryptography with chaos , 1998 .
[10] A. Kanso,et al. Logistic chaotic maps for binary numbers generations , 2009 .
[11] Adriana Vlad,et al. On Statistical Independence in the Logistic Map: A Guide to Design New Chaotic Sequences Useful in Cryptography , 2007, ICCSA.