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.
This routine plots the cubic-spline curve that will pass through given set of points. It is assumed that the user has knowledge of the Mathematics that is being used in the program, if he / she has to understand the logic. As a 'user of...
In this algo, DESA-1 is implemented and the use of NLE operator is visible.
DESA-1 is taken and implemented as described by keiser .Non Linear Operators were introduced by Teager and further introduced by Maragos and Keiser.The algo...
Measures of Analysis of Time Series (MATS) toolkit computes a number of different measures of analysis of scalar time series (linear, nonlinear and other statistical measures). It also contains pre-processing tools (transformations and...
The Real Time Toolbox for Matlab interfaces Matlab to external world. It provides the means for signal analysis and process control directly from the Matlab environment. The base RT Toolbox has no Simulink interface, just Matlab. You can do data...
TWIG is a Web-based groupware suite written in PHP, compatible with both PHP3 and PHP4.
Its features include IMAP and POP3 email, Usenet newsgroups, contact management, scheduling, shared notes and bookmarks, a todo list, and meeting...
Thus, this work offeres a sequential version of the LSI algorithm (SLSI). Its main difference from the existing algorithms is that the dimension of space is not fixed and dynamically changes to ensure a given level of relative...
TWIG is a Web-based groupware suite written in PHP, compatible with both PHP3 and PHP4.
Its features include IMAP and POP3 email, Usenet newsgroups, contact management, scheduling, shared notes and bookmarks, a todo list, and meeting...
We use Conway's Game of Life to demonstrate different optimal control strategies for agent based models (ABM) with a focus on their computational complexity. We show different approaches for global and local controls.
Jabber::Simple takes the strong foundation laid by xmpp4r and hides the relatively high complexity of maintaining a simple instant messenger bot in Ruby.
UNINIT is very similar to the ZEROS function, except that UNINIT returns an uninitialized array instead of a zero-filled array. Thus, UNINIT is faster than the ZEROS function for large size arrays. Since the return variable is uninitialized, the...
TWIG is a Web-based groupware suite written in PHP, compatible with both PHP3 and PHP4.
Its features include IMAP and POP3 email, Usenet newsgroups, contact management, scheduling, shared notes and bookmarks, a todo list, and meeting...
I am describing a solution that allows you to break apart and run large amounts of your Matlab code in parallel on large computational pools. In order to provide the user with the familiar Matlab work environment, I glue back the remotely...
This is the 2-D Fast DOST Decomposition. The computational complexity is O(NlnN)
Let r_scale be the neighborhood radius scale, a brute search method would require N*r_scale to detect the valleys with neighborhood size of r_scale in 1d signal or N*r_scale*r_scale complexity in 2d image. Which is too slow in large data size. In...
Bit::Vector is an efficient C library which allows you to handle bit vectors, sets (of integers), "big integer arithmetic" and boolean matrices, all of arbitrary sizes.
The library is efficient (in terms of algorithmical...
Algorithm StrAP, is able to adaptively cluster data streams with Affinity Propagation. Several steps are made to build StrAP. The first one (Weighted AP) extends AP to weighted items with no loss of generality. The second one...
This script acts on the log file generated during a PolySpace verification. It gives some statistics about the current state of a verification: dlT- options and statistics of each stage * the complexity of a verification: number of...
The function is based on the paper by Held and Karp from 1962. The DP is guaranteed to provide the accurate (optimal) result to the TSP, but the time complexity of this algorithm is O(2^n n^2), which limits the use of this algorithm to 15 cities...
The plural formula configurator sets sensible defaults for plural forms when adding languages and lets you edit the plural formula for all languages on the web interface.
Drupal does not expose these fields for editing due to the... |