在分形几何里面，非常重要的一部分内容就是分形演化算法。这个模块提供的是用DLA模型模拟植物生长的算法。...

MIMO信道ZF预编码算法，ZF算法也称为迫零算法，它是一种线性编码算法，Ｚ预编码算法的原理是在信道矩阵为方阵时对其直接求逆。当发送端和接收端天线数相同时，信道矩阵是一个复方阵，直接反转信道矩阵就可得到预编码矩阵，预编码矩阵在信号传输过程中与信道矩阵相互抵消，从而维持各用户间的信息相互正交，能够使用户间的干扰被消除。

KD 树的代码，常见的数据搜索算法，更实际

利用AFEPack包求解变二次系数的椭圆型方程.在求解这个问题的过程中，先要把程序的结构进行整理，将变二次项系数的因素加进去 ，并使得其更加有利于复杂一些的问题的求解 。为此，我们使用一个类来管理这个求解的问 题，先写一个对这个类进行声明的头文件 EllipticEquation.h-Use AFEPack package for solving variable coefficient elliptic quadratic equation. In solving this problem, the first to organize the structure of the procedure will change coefficient of quadratic terms added to the list of factors, and make it more conducive to the complexity of some of the problem solving. To this end, we use a class to manage to solve this problem, first write a statement of this type for the header files EllipticEquation.h

通过此程序可以把输入的年份判别是平年,还是闰年.-through this procedure can be imported in the year discriminant is non-leap year, or a leap year.

98年全国大学生数学建模竞赛B题“水灾巡视问题”，是一个推销员问题，本题有53个点，所有可能性大约为exp(53),目前没有好方法求出精确解，既然求不出精确解，我们使用模拟退火法求出一个较优解,将所有结点编号为1到53,1到53的排列就是系统的结构,结构的变化规则是:从1到53的排列中随机选取一个子排列,将其反转或将其移至另一处,能量E自然是路径总长度。具体算法描述如下：步1： 设定初始温度T，给定一个初始的巡视路线。步2 ：步3 --8循环K次步3：步 4--7循环M次步4：随机选择路线的一段步5：随机确定将选定的路线反转或移动，即两种调整方式：反转、移动。步6：计算代价D，即调整前后的总路程的长度之差步7：按照如下规则确定是否做调整：如果D0,则按照EXP(-D/T)的概率进行调整步8:T*0.9-->T,降温-98 National Mathematical Contest in Modeling B and that the "flood inspections", is a salesman problem, and that is 53 points, all possibilities about exp (53), there is no good way to get accurate solutions, since no exact solution for, we used simulated annealing France obtained an optimum solution to all nodes to a number of 53 to 53.1 is with the system structure, changes in the structure of the rules is : from 1-53 with a randomly selected with a son, to reverse or to move it to another, the energy E is the natural path length. The specific algorithm is described as follows : Step 1 : The initial set temperature T,

可以实现圆检测的hough变换程序，可以实现多个圆的同时检测，同时可以设定圆的半径，并给出圆心的位置

Newton差商插值，可输入数组进行插值运算-Newton difference quotient interpolation, may import array interpolation Operational

DFPD是Directional Filtering and a posteriori Decision的缩写，计算复杂度低，对高频区域处理效果比某些高复杂度高的算法还要好。

Learnin Mathematics with the ABACUS Activity-book part 6

禁忌搜索法对初始解、邻域个数及禁忌列表的大小等参数有比较严格的要求, 这些参数直接影响着算法的优化能 力。文章提出了一种改进的禁忌搜索法, 它用有效空间来压缩搜索范围, 这样可以提高搜索效率和全局搜索能力。用短期 和长期禁忌列表存储器来保证算法能搜索到全局空间的每一点, 并且不重复搜索。经过验算和分析, 证明它是一种较好的 全局启发式搜索法-Tabu search method, the initial solution, neighborhood and tabu list size of the number of parameters such as have more stringent requirements, these parameters directly affect the ability to optimize the algorithm. This paper presents an improved tabu search method, it is used effectively to compress the search space, so that can improve search efficiency and global search capabilities. Short-term and long-term memory tabu list to ensure the algorithm to search to the global space, each point, and do not repeat the search. After checking and analysis, to prove that it is a good global heuristic search method