LE

自己写的用于调试美国产的卫星接收机输出信号的软件，里面包含有接收机协议。(the soft weare writed by vc6.0,use for debug the signal of the receiver )

Elementary graphics editing.Sources MFC application that was created in VIsual C ++. Run the program and draw the strip.

标准粒子群算法PSO,MATLAB中实验,对学习粒子群算法很有帮助(Standard particle swarm optimization PSO, MATLAB in experiments on learning PSO helpful)

camlav下载，欢迎研究杀毒人士下载，里面有代码的所有内容(calav，welcome to download the code)

实现枚举设备的功能，像window设备管理器一样的功能。简单使用，解决了很多程序员的苦恼问题(The achievement of enumerated devices, such as Device Manager window functions the same. Simple to use, a lot of programmers to solve the problem of distress)

lua open source libary

说明：  可以读出股票作为个人在股票软件方面的一个小尝试(Can be read as an individual stock in the stock software is a small attempt)

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

基于蚁群算法的路径规划，包括二维路径和三维路径，非常实用，无BUG，注释详细(Path planning, ant colony algorithm, including 2D and 3D path planning path,)

LM算法的MATLAB实现。Levenberg-Marquardt算法是最优化算法中的一种。最优化是寻找使得函数值最小的参数向量。(LM algorithm in MATLAB. Levenberg-Marquardt algorithm is an optimization algorithm. Optimization is to find the minimum value makes the function parameter vector.)