mcIsing

power control in WCDAM......

关于灾情巡视路线问题的数学模型，利用的是Floyd算法以及Hamilton圈改良算法(a modeling about rounds of disaster，taking advantage of the Floyd algorithm and improved Hamilton circle algorithm)

matlab灰度图像的边缘提取：直方图均衡化，canny算子实现一阶偏微分，计算梯度幅值和方向(matlab Gray Image Edge Extraction: histogram equalization, canny realization of first-order partial differential operator, calculate the gradient magnitude and direction)

技术文件名称：MPLSv1.0软件模块测试规程(Technical file name: MPLSv1.0 order to test software modules)

matla b gui..................(matlab gui...........................)

计算机械振动烈度，由采集的振振动位移数据来求得可直接使用。 (Calculation of the mechanical vibration intensity, obtained by the vibration vibration displacement data collected can be used directly.)

非常帅气的window32 窗口类源码，可以此为基础做进一步的开发。(A Simple Win32 Window Wrapper Class。http://www.codeproject.com/win32/win32windowwrapperclass.asp)

WGS 转换到Carser WGS 转换到Carser(ConvertWGStoCarser ConvertWGStoCarser ConvertWGStoCarser)

用于arduino的加速度传感器MPU788的库文件(library file of MPU788 for Arduino)

递归法求解整数划分。 整数划分，是指把一个正整数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) )