api-zliao

Shell sort is a very interesting modification of the sorting algorithm simple inserts.

用龙贝格法求定积分，此例的变量数为三，但整体思路是没错的。(With Romberg method for the definite integral, the number of variables in this case is three, but the overall idea is correct.)

遗传算法可用于优化计算，C++，lingo都可用(Genetic algorithms can be used for optimization, C++, lingo are available)

说明：  cegui使用说明,初学者可以看看,对api的介绍(cegui cegui cegui )

基于MatLab和VC编写程序，实现点云数据的快速建模，三角网格的绘制。(MatLab, and VC-based programming to achieve fast data point cloud modeling, triangular mesh rendering.)

电能质量3 5 7次谐波治理 以三相不平衡负载的影响搭建的简单simulink模型(A simple Simulink model for the 357 harmonic control of power quality based on the influence of unbalanced three-phase loads)

关于Matlab PACE workshop 的详细介绍资料，可以供大家参考(Matlab PACE Workshop of presentation materials for your reference)

非对称的贝塞尔光束的分布！以及光的自旋和轨道角动量对他的影响！(Bessel beams)

NSC program calculates BER of NSC

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