cdma

说明：   在三次样条中，要寻找三次多项式，以逼近每对数据点间的曲线。在样条术语中，这些数据点称之为断点。因为，两点只能决定一条直线，而在两点间的曲线可用无限多的三次多项式近似。因此，为使结果具有唯一性。在三次样条中，增加了三次多项式的约束条件。通过限定每个三次多项式的一阶和二阶导数，使其在断点处相等，就可以较好地确定所有内部三次多项式。此外，近似多项式通过这些断点的斜率和曲率是连续的。然而，第一个和最后一个三次多项式在第一个和最后一个断点以外，没有伴随多项式。因此必须通过其它方法确定其余的约束。最常用的方法，也是函数spline所采用的方法，就是采用非扭结(not-a-knot)条件。这个条件强迫第一个和第二个三次多项式的三阶导数相等。对最后一个和倒数第二个三次多项式也做同样地处理。 (the Cubic Spline, to find three polynomial, approaching every right to point the data curve. The kind of terms, these data points called breakpoints. Because only two points a straight decisions, and in between the two curves can be used an infinite number of cubic polynomial approximation. Therefore, in order for the outcome of uniqueness. The Cubic Spline, add the cubic polynomial bound by the conditions. By limiting each cubic polynomial of the first order and second-order derivative, it breakpoint in the same Department, we can better identify all internal cubic polynomial. In addition, the polynomial approximation of these breakpoints slope and curvature is continuous. However, the last one and a cubic polynomial in a breakpoint and the final one, not accompanied by polynomials. There)

dct变换+扩频的数字水印算法 水印为随即序列(Extra transform Spread Spectrum Watermarking digital watermarking algorithm for the forthcoming series)

对信号进行小波变化，找出QRS波形，并利用不同方式进行消噪，从而用图形比较效果(It find the QRS wave of an input signal using wavelet transform and depress noise using several ways,so compare their figure.)

Matlab I beam. used for derive the second moment of area(Matlab I beam)

高分辨率距离像，是一个function函数，根据接收的信号来生成它的高分辨率一维距离像(High-resolution range profile is a function function, according to the received signal to generate its high-resolution one-dimensional range profile)

AsynchronousMachine model and simulation

mulGSND mulGXF1　解非线性方程组　 非常好用的算法　希望大家能用到　(Nonlinear equations is very useful method to hope that we can)

Solve differential equations, higher order method.DFSOLVE integrates a single ordinary differential equation using 4th and 5th order Runge-Kutta formulas. This routine is designed to be used only with DFIELD.

prim算法 kruskal算法用matlab实现 输入标准：x邻接矩阵 p节点集 输出：生成树边集 G(prim algorithm Kruskal algorithm matlab input standard: x adjacency matrix p Node Set Output: Spanning Tree margination G)

比较生存曲线可以用统计假设测试日志秩检验。它是用来测试的零假设，没有任何区别的人口的生存曲线（即概率事件发生在任何时间点是相同的每个人口）.这个函数使用卡普兰曲线的程序来估计生存函数.(Comparison of two survival curves can be done using a statistical hypothesis test called the log rank test. It is used to test the null hypothesis that there is no difference between the population survival curves (i.e. the probability of an event occurring at any time point is the same for each population). This function use the Kaplan-Meier procedure to estimate the survival function, so it is mandatory to download )