Inverted_Pendulum

Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optimization techniques which are based on linear and nonlinear programming. TSP can be described as follows: Given a number of cities to visit and their distances from all other cities know, an optimal travel route has to be found so that each city is visited one and only once with the least possible distance traveled. This is a simple problem with handful of cities but becomes complicated as the number increases.

this algorithm generates bessel coefficients for FSK modulation

file dll special for the file spike under matlab code.

here is fantastic iso clustering code which i test it frequently and find it satisfactory. it does k maen clustering in two dimensional data.

这是用matlab实现的无约束优化方法 变量轮换法程序 (Unconstrained optimization method variable rotation method program matlab)

说明：  fractal decomposition

通过动态链接库 ,利用 Delphi面向对象编程的特点以及 Matlab 强大的计算功能 ,详细的介绍了 Delphi 下调用 Matlab 函数的方法及特点 ,并以一个例程的实现 ,阐述了 Delphi下通过动态链接库调用 Matlab函数 ,并最终脱离 Matlab环境下运 行。(Through the dynamic link library, object-oriented programming using Delphi, as well as the characteristics of the powerful Matlab computing functions, a detailed introduction of the Delphi method to call Matlab functions and characteristics, and the realization of a routine, on the adoption of dynamic link under Delphi Matlab library function call, and eventually run from the Matlab environment.)

The Burrows wheeler transform of matrix x, it will decode the Burrows wheeler transformed matrix a and will output the original image with this program will re-calculate the original image of input bwt imag

Simple Tracker *Tracking* , or particle linking, consist in re-building the trajectories of one or several particles as they move along time. Their position is reported at each frame, but their identity is yet unknown: we do not know what particle in one frame corresponding to a particle in the previous frame. Tracking algorithms aim at providing a solution for this problem. (SIMPLETRACKER a simple particle tracking algorithm that can deal with gaps *Tracking* , or particle linking, consist in re-building the trajectories of one or several particles as they move along time. Their position is reported at each frame, but their identity is yet unknown: we do not know what particle in one frame corresponding to a particle in the previous frame. Tracking algorithms aim at providing a solution for this problem. |simpletracker.m| is- as the name says- a simple implementation of a tracking algorithm, that can deal with gaps. A gap happens when one particle that was detected in one frame is not detected in the subsequent one. If not dealt with, this generates a track break, or a gap, in the frame where the particle disappear, and a false new track in the frame where it re-appear. )

task graph generator: task graph for free version 3.5