|Code Listing by Stephen Faul|
This function estiamtes the Kolmogorov Complexity of a binary sequence. The algorithm is as described in Lempel and Ziv (IEEE trans inf theory IT-22, 75 (1976)) and Kaspar and Schuster (Physical Review A, vol 36, no 2, pg 842).
Input is binary sequence, output is kolmogorov complexity.
Takes the data length, window length and window overlap length as inputs and returns the number of windows that will result. Will also return the start samples and end samples of each window if asked.
Five methods for converting a signal to a binary representation. Methods outlined in Arthur Petrosian, "Kolmogorov Complexity of finite sequences and recognition of different preictal eeg patterns".
This function returns the delay vector given the data, the embedding dimension and the time delay. Useful to use for priming data for use with PCA/ICA, SVD or Chaos Theory Analysis amongst...
All files and free downloads are copyright of their respective owners. We do not provide any hacked, cracked, illegal, pirated version of scripts, codes, components downloads. All files are downloaded from the publishers website, our file servers or download mirrors. Always Virus check files downloaded from the web specially zip, rar, exe, trial, full versions etc. Download links from rapidshare, depositfiles, megaupload etc not published.