P97_ODE_AdamBashforth_Predictor_Corrector

WAVEVIB generates a vibroseis waveform (Clauder wavelet) by ％ first calling SWEEP to generate a linear sweep and then calling ％ AUTO to autocorrelate that sweep. Theoretically, the autocorrelation ％ length is ~ 2*slength but only only the central wlength long ％ part is generated. This is like windowing the auto with a boxcar.(WAVEVIB generates a vibroseis waveform (Clauder wavelet) by first calling SWEEP to generate a linear sweep and then calling AUTO to autocorrelate that sweep. Theoretically, the autocorrelation length is ~ 2* slength but only only the central wlength long part is generated. This is like windowing the auto with a boxcar.)

一个用循环谱原理给出的计算程序,可以画出信号的图形(a cyclic spectrum )

说明：  给出了一个有关Chaikin细分法的matlab编程，该程序适合于任意的封闭的初始控制多边形(a program about Chaikin subdivision scheme which can be applied to closed polygon)

滤波器组的PWVD很不错的我已经试过了很好(filter group Ville very good, I have tried very good)

考察ＬＭＳ算法的收敛性： （１） 步长因子的变化对算法收敛的影响； （２） 权初值的设置对算法收敛的影响 (Examine the convergence of the LMS algorithm: (1) changes in the step factor on the convergence of the algorithm (2) The right of the initial value set on the convergence of the algorithm)

光纤LP51模式,光纤模式计算，纤芯模式，有效折射率(Fiber LP51 mode, fiber mode calculation, fiber core mode, effective refractive index)

该程序为电子离合器的程序,可以实现有无按纽信号或者刹车信号等判断(The program procedures for the electronic clutch, you can achieve any signal or brake button signals to determine)

求解抛物线形偏微分方程的Matlab代码(Parabolic partial differential equation of Matlab code)

用matlab实现的基于非负矩阵分解NMF的聚类算法，已测试通过(NMF decomposition using clustering algorithm based on non-negative matrix matlab achieved, have been tested)

说明：  给定n种物品和一个背包,物品i的重量是Wi,价值是vi,被包容量是C,应该如何选择装入被包的物品,使得装入背包中物品的总价值最大?对于每种物品i,只有两种选择,装入或者不装入. 输入:第一行两个正整数n(物品数)和C(容量) 第二行n个正整数n,表示物品价值 第三行n个正整数n,表示物品重量 输出:第一行表示总价值 第二行n个数(0/1),0表示物品不装入,1表示装入 例如, 输入: 5 10 6 3 5 4 6 2 2 6 5 4 输出 15 1 1 0 0 1 (Species of a given n items and a backpack, the weight of item i is Wi, the value of vi, was packet capacity is C, should be how to choose a package of items to be loaded, the backpack load in the largest total value of goods? For each item i, there are only two options, loaded or not loaded. Input: the first line of the two positive integer n (the number of items) and C (capacity) of the second line of n positive integer n, that the value of the third line of n positive integer n, that the weight of output: the total value of the first line of the second line, said n number of (0/1), 0 that the items do not load, that load 1 for example, enter: 5,106,354,622 6 5 4 output 15 1 1 0 0 1)