Search
New Code
phpEnter 5.1.
Udemy Clone script 2.01
VisualNEO Web 19.11.7
VisualNEO for Windows 19.4.29.0
SentiVeillance SDK Trial 7.3
Devart ODBC Driver for PostgreSQL 3.2
SecureBridge 9.2
dotConnect for QuickBooks 1.9
dotConnect for Magento 1.9
dotConnect for Zoho CRM 1.10
dotConnect for FreshBooks 1.10
IP2Location Geolocation Database January.2020
dotConnect for BigCommerce 1.10
HTMLPad 2020 16.0
WeBuilder 2020 16.0
Top Code
phpEnter 5.1.
Single Leg MLM 1.2.1
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Invoice Manager by PHPJabbers 3.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Code Listing by Stephen Faul

Code 1-4 of 4   






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".

Methods are:
1....



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...