LEsprit

matlab中用打靶法求解常微分方程组的两点边值问题(shooting method for bvps)

林智仁教授的lib-svm直接解压到matlab文件夹下即可使用。(Unzip lib-svm professor Lin Zhiren under the MATLAB folder can be used. )

无线传感器网络节点定位算法研究，APIT定位算法的源代码(Wireless sensor network node localization algorithms, APIT localization algorithm source code)

通过建立运动模糊数学模型, 进行了消除运动模糊的仿真实验, 维纳滤波恢复运动模糊图像效果较 好。在图像恢复技术中, 点扩展函数( PSF) 是影响图像恢复结果的关键因素, 所以常常利用先验知识和后验判 断方法估计PSF函数来恢复图像。实验表明在实际恢复过程中如果运动模糊图像混入了噪声, 必须考虑到信噪 比、噪声的自相关函数和原始图像的自相关函数对恢复后图像的影响。(Through the establishment of mathematical model of motion blur was conducted simulation experiments to eliminate motion blur, Wiener filter to restore motion-blurred image effect is good. In the image restoration technology, the point spread function (PSF) that affect the results of image restoration a key factor, so often used to determine a priori knowledge and a posteriori estimation PSF function to restore the image. Experimental results show that the actual recovery process if the motion-blurred images mixed with the noise, we must take into account the signal to noise ratio, the noise autocorrelation function and the autocorrelation function of the original image of the restored image effects.)

PLL锁相环的角度生成问题，角度的代入运算前的修正问题，总算是解决了！(PLL PLL angle generation problem, the angle of substitution before the operation to fix the problem, finally solved!)

this explains about the concept of channel and fading related to it and about the ofdm concept.

some code in matlab programming on NSGA. the code is complete and written using cvx tools. enjoy

波音727的数据和isar技术成像程序，希望对大家有帮助(Boeing 727 technical data and ISAR imaging procedures, we hope to help)

设r是f(x) = 0的根，选取x0作为r初始近似值，过点（x0,f(x0)）做曲线y = f(x)的切线L，L的方程为y = f(x0)+f (x0)(x-x0)，求出L与x轴交点的横坐标 x1 = x0-f(x0)/f (x0)，称x1为r的一次近似值。过点（x1,f(x1)）做曲线y = f(x)的切线，并求该切线与x轴交点的横坐标 x2 = x1-f(x1)/f (x1)，称x2为r的二次近似值。重复以上过程，得r的近似值序列，其中x(n+1)=x(n)－f(x(n))/f (x(n))，称为r的n+1次近似值(Let r is f (x) = 0 root, select the initial approximation x0 as the r, over point (x0, f (x0)) to do the curve y = f (x) the tangent L, L the equation y = f ( x0)+ f ' (x0) (x-x0), find the intersection of L and the x-axis of abscissa x1 = x0-f (x0)/f' (x0), x1 is called an approximation r. Through points (x1, f (x1)) to do the curve y = f (x) the tangent, and find the intersection of the tangent with the x-axis of abscissa x2 = x1-f (x1)/f ' (x1), x2 is called r the second approximation. Repeat the process, get an approximation of the sequence r, where x (n+1) = x (n)-f (x (n))/f ' (x (n)), as an approximation of r n+1 times)

分数阶的混沌代码，很不错的一个基于matlab的程序，欢迎下载(Fractional order of unified chaotic systems，a very good based on the matlab program，welcome to download)