wiener

sift算法page，详细论述了sift算法的基本过程(sift algorithm page, sift algorithm discussed in detail the basic processes)

3G里使用的Spreading技术演示仿真。用于教学演示的Matlab模型。A demo of spreading code generation and modulation used in 3G.(3G Lane Spreading the use of simulation technology demonstration. Teaching Demonstration for the Matlab model. A demo of spreading code generation and modulat ion used in 3G.)

matlab的m文件，是关于汉明码编码的，文件可以直接运行(matlab m-file is on the Hamming code, files can be run directly)

matlab cod for radar

移动衰落信道，该书是英文版，非常好的一本书，还有matlab源代码。(Mobile fading channel, the book is the English version, a very good book, there are matlab source code.)

MATLAB进行模糊统计，得到模糊分布(隶属函数)近似解析表达式(MATLAB fuzzy statistics, get fuzzy distribution (membership function) approximate analytical expressions)

矩形波导三维仿真程序，输入矩形波导的尺寸，函数可以计算出矩形波导TE波，TM波的的三维矢量图(the simulation program of the rectangular waveguide. input the size of the waveguide, the program can calculate the TE and TM wave of the waveguide and plot the three dimession figure.)

％％％ Demos for PUMA algorithms ％％％ We present four matlab demos for PUMA. demo1, demo2, demo3, and demo4 illustrate PUMA working with different parameters and with four different images. All you need to do is to run each of the demos. Please be sure that all the files are put on an accessible path for matlab. Notice that this code is intended for research purposes only. For further reference see "Phase Unwrapping via Graph Cuts, IEEE Transactions on Image Processing, 2007( Demos for PUMA algorithms We present four matlab demos for PUMA. Demo1, demo2, demo3, and demo4 illustrate PUMA working with different parameters and with four different images.All you need to do is to run each of the demos . Please be sure thatall the files are put on an accessible path for matlab.Notice that this code is intended for research purposes only.For further reference see )

[x,f]= L01p_e(c,A,b,N)用枚举法求解下列 0-1线性规划问题min f=c *x, s.t. A*x<=b,x的分量全为整数0或1, 其中N表示约束条件 Ax ≤ b中的前N个是等式，N= 0时可以省略。 返回结果x是最优解，f是最优解处的函数值。 ([X, f] = L01p_e (c, A, b, N) with the following enumeration method for solving linear programming problems 0-1 min f = c ' * x, st A* x < = b, x is an integer of all components 0 or 1, where N represents the constraints Ax ≤ b in the equation of the first N, N = 0 can be omitted. Return result x is the optimal solution, f is the function value at the optimal solution.)

实现微分方程向前查分 （教材为微分方程数值解，习题5.2.4）(forward difference)