czt

matlab的gscale函数功能是将强度图像等映射到别的值范围。(Function of matlab gscale intensity images is mapped to another range.)

VC实现对MATLAB的调用，对于研究二者混合编程的人比较有用(VC++ implementation of the MATLAB call for the mixture of the two studies were more useful for programming)

说明：  在网上下载的好用的傅里叶变换程序 时域变频域信号分析(Fourier transform program)

实现信号的SVD 分解,对信号中的奇异性进行监测，对突变信号点也可以很好监测(to complete the SVD for signals，Singularity of signal monitoring, signal monitoring point can be very good for mutations)

空间插值方法汇总Inverse Distance to a Power（反距离加权插值法） Kriging（克里金插值法）Minimum Curvature（最小曲率）Modified Shepardd s Method（改进谢别德法）Natural Neighbor（自然邻点插值法）Nearest Neighbor（最近邻点插值法）Polynomial Regression（多元回归法）Radia (Spatial interpolation method summary Inverse Distance to a Power (inverse distance weighted interpolation) on Kriging (kriging) Minimum Curvature the (smallest curvature) Modified Shepardd s Method (improved Xiebie De law) Natural Neighbor (natural neighbor interpolation) Nearest Neighbor (nearest neighbor interpolation) Polynomial the Regression (multiple regression) Radia)

　VC + + 与MATLAB 混合编程,可以将VC 优秀的可视化编程能力和MATLAB 强大的计算能力结合起来。 分析了C 语言与MATLAB7. x 在接口的特点,详细介绍了VC + + 6. 0 与MATLAB7. x 混合编程的三种方法: MATLAB 引擎、MATLAB 编译器和MATLAB COM 编译器(VC++ Mixed with MATLAB programming, can be excellent VC Visualization MATLAB programming capacity and computing power together. Analysis of the C language and MATLAB7. X in the interface characteristics described in detail VC++ 6. 0 and MATLAB7. X mixed programming in three ways: MATLAB engine, MATLAB Compiler and MATLAB COM compiler)

this is windows trayicon sample code.

The ant algorithm matlab simulation(The ant algorithm matlab simulation )

灯光中央控制系统的设计应用,是一份非常经典的灯光控制应用领域的文档(灯光中央控制系统的设计应用)

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )