harris

说明：  一个随机数产生器(mt19937) 计算物理中Monte Carlo方法中的基本条件 周期为2^19937(a random number generator (mt19937) Computational Physics Monte Carlo methods of the basic conditions for the cycle 2 ^ 19937)

Fibonacci问题，sicily 张老师题目(Fibonacci problem, sicily Zhang topic)

说明：  涂层物质中的电磁脉冲特性与雷达截面减缩，涂层物质中的电磁脉冲特性与雷达截面减缩(Radar Cross Section Reduction and Characteristic of Electromagnetic Pulse in Antiradar Coating M aterial )

Ansi To Ascii and Ascii to Ansi converter

2D Multi-Parameter Pie Control

实现火车的调度，即将无需的乱的火车，重新调度成有序的(Realization train scheduling, without the chaos of the train is about to re-scheduled to orderly)

这是《Windows高级编程第五版珍藏版》一书中的源码，11-23章，由于源码太大所以分开上传，这是下(This is the " Windows Advanced Programming Fifth Edition Collector' s Edition," a book source, 11-23 chapters, due to too much so upload separate source, which is under)

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

数字滤波，包含：中位值滤波，算术平均滤波，去极值平均滤波，加权平均滤波，低通滤波()

与气象雷达有关的书籍，对初学者有很大的帮助。(With weather radar related books, a great help for beginners.)