Matlab-C-CPPhunhebiancheng

relevant dimensionality estimate toolbox(relevant dimensionality estimate)

简要概述了最具代表性的分形结构--扩散限制凝聚(Diffusion-Limited-Aggregation,DLA)模型的生长规则、主要性质,给出了模型模拟分形生长的算法,在MATLAB6.5平台上进行了程序设计,在Windows98/2000/XP下实现了DLA模型模拟生长的动态过程.(Briefly summarizes the most representative of the fractal structure- diffusion-limited condensed (Diffusion- Limited- Aggregation, DLA) model of growth rules, the main properties, gives the model simulation processes-fractal growth algorithm, by MATLAB6.5 platform for software design, in Windows 98/2000/XP realize DLA model to simulate the growth of dynamic process.)

说明：  Simon Hayin的"Adpative Filter Theory"-自适应滤波第4版的所有仿真代码matlab语言版。(Simon Hayin "Adpative Filter Theory"- Self section 4 should be filtering all the simulation version of the Matlab code language version.)

小波变换程序 用MATLAB编程处理，得到信号图像分析 比较初级 用于初级学习(Wavelet transform application MATLAB programming processing, image analysis to compare the primary signal Used for primary learning )

sever mazdai kapibara

修改过的较为简单易懂的代码，encode代码为一个单独的循环编码，可根据需要修改采用，前边几个为一个完整的H、G矩阵生成代码，及校验代码，简单易懂，码长，迭代次数各种参数都可根据需要进行修改。(The modified relatively simple code, the encode code for a single cycle code, can be modified according to the need, in front of a few for a complete H, G matrix to generate the code and check code, simple and easy to understand, code length, iteration number of various kinds of parameters can be modified according to the needs of.)

matlab仿真的GPS信号捕获程序，相关及非相关累积算法(matlab simulation of the GPS signal acquisition process, relevant and non-related accumulation algorithm)

A peak fitting program for time-series signals(A peak fitting program for time-series sig nals)

Thresholding of i/p image

说明：  用栅格模型表示工作环境,确定机器人运动起始结点和目标结点后,对工作环境进行分析,选取起始点与目标点之间连线附近的若干栅格,以被选取栅格为关键点,采用蚁群算法分别计算关键点与起始点和目标节点之间的最短路径,求取全局最短路径(With grid model to represent the working environment, robot motion after initial nodes and target, analysis of working conditions, selecting starting point and the target point near the connection between a number of grid, grid for the key points to be selected, key point and the starting point is obtained by using the ant colony algorithm respectively and the shortest path between the target node, calculate the global shortest path)