xinhao

这种小波构造方式适合于各种DB系列的小波，但面对db6等比较长的小波，则均衡器的权长要足够长(Wavelet way that is suitable for a variety of wavelet DB series, but in the face of such a long db6 wavelet, it' s the right balance should be sufficiently long length)

ApEn approx_entropy 两种计算近似熵的算法，一个程序简洁明了，一个从基本原理分布算起便于理解，亲自调试，都通过程序验证，结果一致，替换数据即可使用(Approximate entropy algorithm the ApEn approx_entropy two calculations, a program concise, counting a distribution from the basic principles of ease of understanding, the person commissioning, program verification, and the results are consistent, replace the data can be used)

radar信号处理（MATLAB版第二版），书中介绍中带有详细代码，希望对初学者有用~(radar signal processing (MATLAB version of the second edition), the book describes in detail with the code, I hope useful for beginners ~)

说明：  通过步进电机的数学模型对二相步进电机进行仿真，并通过卡尔曼滤波处理数据，最终通过处理后的数据预估两相步进电机的相电流和相电压。(The mathematical model of the stepping motor is used to simulate the two-phase stepping motor, and the data are processed by Kalman filter. Finally, the phase current and phase voltage of the two-phase stepping motor are predicted by the processed data.)

森林火灾蔓延Matlab仿真编程，对比了增加隔离带和无隔离带火灾蔓延的趋势(MATLAB Simulation Programming of Forest Fire Spread)

用于解反问题的共轭梯度法，对于Ax=b，输入矩阵A，列向量b，以及迭代步数k，可求的列向量x(Solution of inverse problems for the conjugate gradient method, for Ax = b, the input matrix A, the column vector b, as well as the number of iterations k, rectifiable column vector x)

说明：  动画电影制作样例，很有帮助，很好，国外牛人写的，规范(Animated film production sample, helpful, well, foreign cattle were written, standardized)

编码实现Hough变换算法,最基本的Hough变换检测直线方法，可以实现(achieve to detect lines)

matlab从入门到精通，讲解了matlab 的基础知识(matlab from entry to the master，Explained the basics of matlab)

旅行商问题（Travelling Salesman Problem, 简记TSP):假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 此处使用蚁群算法求解TSP问题(Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths.Here,we use the procedure of ant colony algorithm to work out the TSP.)