LDP

matlab下的轮廓跟踪算法，获得边界数值数组和一些测量位置和边界。(get border as numeric array and a number of measurements of a spot and a border)

matlab图像处理实例详解chap8——图像变换技术(matlab image processing examples explain chap8- image conversion technology)

SVD奇异值分解做降维处理，主要用于降维处理，可用于图像压缩，数据融合等领域(SVD singular value decomposition (SVD) is used for dimensionality reduction, which is mainly used for dimensionality reduction, and can be applied to image compression, data fusion and other fields.)

使用matlab进行积分编程的技巧。介绍了使用int，double命令进行积分的方法。(Integrating the use of matlab programming skills. Describes the use int, double commands integral method.)

这是一个Lyapunov指数计算方法文件，里面有基本的混沌识别方法和混沌预测方法，很有用。(This is a calculation of Lyapunov index files, which are the basic identification method and chaos chaotic forecasting method, very useful.)

BP神经网络设计自适应逆控制器，实现无模型控制(BP neural network design adaptive inverse controller, model control)

calculate the max_lyapnov exponent (calculate the max_lyapnov exponent)

  最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.( Minimum cost maximum flow algorithm for general Matlab functions based on the Floyd shortest path algorithm of Ford and Fulkerson superposition algorithm of the basic ideas: the cost of unit flow on the arc as a certain length of Floyd for the most short-circuit method to determine the one percent V1 through Vn are the most short-circuit then this short circuit as a scalable road, a method for solving the maximum flow problem on flow increased to the maximum possible value that the shortest way increased traffic, the cost of unit flow on each arc sure, so many iterations, the final minimum cost maximum flow.)

说明：  进程列表程序，包含AIX, System V, SUNOS (The app for listing processes, containing AIX, System V, SUNOS)

To encode a binary data using runlength encoding with setting the count buffer to limit to a required datatype size value. If image use reahape to make it to row.