MicrosoftWord4

the code leach in wireless sensor network

这是一个可执行的向量量化vector编码程序,希望对大家有所帮助(This is an executable vector encoding vector quantization process, I hope all of you to help)

三角网格表面测地线的计算，matlab源码(Geodesic triangular surface grid computing, matlab source)

matlab7.0应用编程，中文资料，每章一个文件(Application Programming matlab7.0, English information, each devoted to a file)

说明：  改进后的Harris检测，能大大提高检测效率。(Harris improved detection can greatly increase the efficiency of detection.)

一般模式的机载双基地合成孔径雷达回波数据产生，收发平台具有不同的速度与方向，均工作在斜视模式(General pattern of airborne bistatic synthetic aperture radar echo data generated transceiver platform has a different speed and direction, are working in the squint mode)

设计学习有用的matlab介绍文章，可以看一看(good book)

标量法（凡有华）提出的计算瑞雷面波频散函数的程序，可直接调用(Scalar (where China) calculation Rayleigh wave dispersion function program can be called directly)

利用第二代小波变换———提升小波变换,为第一代小波变换提供了一种新的更快速的实现方法,使得其构造不再 依赖于Fourier 变换构造,可以实现所有的第一代小波变换,提升方案把此变换过程分为分裂、预测和更新3 个阶段。(--- Second generation wavelet transform using lifting wavelet transform, for the first generation wavelet transform provides a new, more rapid implementation method, so its structure is no longer dependent on the Fourier transform structure, can achieve all of the first generation wavelet transform, enhance the program to the transformation process is divided into split, predict and update the three stages.)

单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是：线性规划问题的可行域是 n维向量空间Rn中的多面凸集，其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是：先找出一个基本可行解，对它进行鉴别，看是否是最优解；若不是，则按照一定法则转换到另一改进的基本可行解,再鉴别；若仍不是，则再转换,按此重复进行。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination. )