quick-transfer.zip

说明：  自己写的求解数度代码，喜欢的可以下来看看(Written several times to solve their own code, like you can look down)

顯示WINDOWS的版本,用visual c++寫的(Show WINDOWS version, written with visual c++)

pso程序的源代码 pso程序的源代码-粒子群优化算法源程序 作者：FashionXu 一个pso程序的源代码。在vc.net2003下面通过。 建议：看代码之前，请先弄明白pso是怎么回事。然后请对应着来：程序中用Agent代表一只鸟，PSO代表鸟群。阅读源代码，不要顺着看，先看main(),然后按照出现的东西的顺序，一个一个得来，呵呵，纯粹是建议。(program s source code pso pso program s source code - source code on Particle Swarm Optimization: FashionXu a pso program source code. In vc.net2003 following through. Recommendation: look at the code before you figure out how the matter pso. Then please correspond to: Program using Agent on behalf of a bird, PSO representative of the flock. Read the source code, do not look down, look at the main (), then follow the order of things there, one by one, come, Oh, merely suggestions.)

网页刷流量器，一个很简单的刷网页PV小工具(Web brush flow measure)

使用RDP的通道Channel API进行文件/剪贴板/数据通信(File/Clipboard/Data communication through RDP channel API)

1133671672316介绍matlab的应用(1133671672316 introduced the application of matlab)

this is a very good book for learners of Visual C++. As a beginner i found this was very useful for me. And i hope it will be very useful for those who are interested to learn Visual C++.

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

实现了ipv6到ipv4的转换（部分实现）(to achieve the ipv4 ipv6 conversion (partially))

matlab的雷达相关程序源码，包含MTIMMTDCFAR，动目标自适应处理 可直接使用。 (Matlab radar program source code contains MTIMMTDCFAR moving target adaptive processing can be used directly.)