New Code
Free Spire.PDF for Java 2.2.2
CSFreeDB 1.0
Udemy Clone Script | Online Course Learning Script 2.00
Crowdfunding donate 1.019
GoferEats - UberEats Clone 1.0
CADViewX: ActiveX for DWG, DXF, PLT, CGM 14
CADEditorX: ActiveX DWG/DXF, STP, PLT 14
Database Workbench Pro 5.7.2
ASP. NET C# PDF Software 2020.3.2
C# HTML to PDF 2020.3.2
dbForge Schema Compare for MySQL 5.0.191
dotConnect for Dynamics CRM 1.9
dotConnect for MailChimp 1.9
dbForge Query Builder for MySQL 4.5.254
The C# Excel Library 2020.5
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
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
Availability Booking Calendar PHP 1.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:

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