pf-segmentation-master

MemDC防止屏幕闪烁的好方法，如不使用内存DC在画图，显示时会闪烁。(memdc redraw dc)

在学校图书馆下的MATLAB混合编程的书，对MATLAB的接口有详细介绍，特别是初学者，对mxArray不熟悉者。(At the school library under the mixed MATLAB programming book on the MATLAB interface has a detailed introduction, especially beginners, to those who are not familiar with the mxArray.)

低通巴特沃斯滤波器设计求阶数，适合广大学生们参考，(Low-pass Butterworth filter design requirements order, for the majority of students reference)

eemd的源码,内含5个m文件，分别求取不同参数(the source code of eemd the source code of eemd the source code of eemd the source code of eemd...the source code of eemd)

matlab，讲的很详细和大家分享一下！(matlab, said very detailed and to share with you!)

室内环境射线跟踪算法研究，室内反射点追踪的计算(Indoor environmental ray tracing algorithm to calculate the reflection point indoor track)

原始周期图法求功率谱估计的matlab程序(The original periodogram seek power spectrum estimation matlab program )

利用GNSS 进行高精度导航定位的前提是正确固定载波相位观测值的整周模糊度。由Galileo 系统的4 个载波观测值可以 形成诸多有良好特性的组合观测值,利用这些组合观测值,结合MCAR 方法,可以有效地确定整周模糊度。(The use of high-precision GNSS navigation and positioning the premise is correct carrier phase observations fixed integer ambiguity. May consist of four carriers observations Galileo system There are many good characteristics to form a combination of observations using a combination of these observations, combined with MCAR method can effectively determine the integer ambiguity.)

说明：  概率论和排队论的书籍 全英文的 很有帮助(Probability theory and queuing theory of helpful books in English)

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