简单的遗传算法，对函数优化具有很高的优越性。

实习性 动态数组(第二版) 大量数据的管理是很多程序员的心病，很难找到一个速度快、效率高、支持超大规模数据的表动态数组是一个功能强大的列表形数据管理链表，利用它可以轻松实现超大数据量的随机插入、删除、修改等操作，它另外一个特点就是速度极快，内存利用率高。 -Practice of dynamic arrays (Second Edition) a large amount of data management is the heart of many programmers, it is difficult to find a fast, high efficiency, support for ultra-large-scale data table dynamic array is a powerful list of shape data management list using it can easily realize large amount of data random insert, delete, modify, such as operation, it is another feature of this approach is extremely fast, high memory utilization.

lms最小平方中位数算法，用来解决最小二乘问题-LMS median least squares algorithm, to solve least squares problem

资源描述下面有整数划分问题扩展出的多个题例： （1）正整数n划分为若干正整数之和，最大加数不超过m的划分数 （2）正整数n划分为不超过m个正整数之和的划分数 （3）正整数n划分为若干正奇整数之和的划分数 （4）正整数n划分为互不相同正整数之和的划分数 约定： 整数划分无顺序，比如对7划分，认为2 2 3和3 2 2和2 3 2为同一种划分。

信号分解后进行特征值提取。包含均值、方根幅值、均方根值、最大值、标准差、偏斜度、峭度、峰值因子、裕度因子、波形因子、脉冲因子、方差等多种特征值，可以进行多个或者单个特征值的输出。在模式识别领域或者是振动噪声分析领域很有用处。

这是一个用c++编写的k-mean程序，完全能够实现聚类算法，可以帮助大家学习c++和聚类算法！

资源描述polar码，基于信道极化，分为好信道和坏信道，满足要求的好信道用于传输信息比特，坏信道用于传输冻结比特。先用BEC构造获取冻结比特位置，在此基础上传输0比特，其他位置传信息比特。输入SC译码算法为信道转移概率，译码算法属于串行译码算法。当前获得译码判决比特，用于下一比特的译码比特的判决。

提出了一个实时的视线追踪方案。程序可运行，追踪效果好。 An eye tracker gives the pixel position of the center of the pupil in an image whereas a gaze tracker determines where the person is looking on the screen. ↩ Timm and Barth. Accurate eye centre localisation by means of gradients. In Proceedings of the Int. Conference on Computer Theory and Applications (VISAPP), volume 1, pages 125-130, Algarve, Portugal, 2011. INSTICC.

平均因子分解法，适用于正定矩阵First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X=U U, where U is the square root matrix of X, and satisfies: (1) U U = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is "positive definite" which guarantees the existence of such kind of decomposition. -Average factor decomposition method applied to positive definite matrix First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X = UU, where U is the square root matrix of X, and satisfies: (1) UU = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is positive

最小生成树算法，将节点 构成的图转换为最小生成树。可用于计算某个节点到另外一些节点的最短距离 

    该程序是用matlab仿真BP译码算法的译码性能曲线，同时证明了gallager引理。程序中可以自由设置码长，迭代次数，仿真点数，通过这些参数的设置可以得到精确度不同的误码性能曲线。