lda

说明：  使用matlab仿真雷达系统设计的经典好书，附书中全部源码(Matlab simulation of radar system design, with all the source code)

performance of TEEN Vs LEACH protocol in wireless sensor network. code is return in MATLAB and simulated successfully. also result are improved than conventional LEACH protocol in wsn.

MATLAB CODE FOR SAR IMAGE DENOISING BY USING DWT AND BILATERAL FILTER ON COLOR DIGITAL IMAGE PROCESSING.AND USING DISCREET WAVELET TRANSFORMATION

小波包分析提取振动信号中的特征频率，基于分段非线性权重值的Pso算法，包括调制，解调，信噪比计算。( Wavelet packet analysis to extract vibration signal characteristic frequency, Based on piecewise nonlinear weight value Pso algorithm, Includes the modulation, demodulation, signal to noise ratio calculation.)

说明：  采用蚁群算法解决TSP旅行商问题。先用dijkstra算法生成初始次优路径，再用蚁群算法搜索全局最优路径。(Ant colony algorithm is used to solve TSP traveling salesman problem. First, Dijkstra algorithm is used to generate the initial suboptimal path, and then ant colony algorithm is used to search the global optimal path.)

Programs related to differrent types of diversity with combining schemes,error probability,soft hand over region and beam forming. codings are based on Matlab.They in word document and Mfile.

基于pso_lssvm的预测程序，直接可用，可以出图，可以修改。加入了粒子变异、权值的递减策略（去掉%就行了）。注意：excel记得放对位置(Pso_lssvm based prediction program, directly available, you can map, you can modify. Added a particle mutation, weight reduction strategy (remove%))

MATLAB语言程序设计教程(电子图书），关于MATLAB的使用。(MATLAB Programming Language Guide (electronic books), on the use of MATLAB.)

discrete-time transfer function to approximate

单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家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. )