这个也是单纯性算法程序，可以与NM算法比较优劣。

给定一篇英文文本，要求提取其中所有的单词并计算其一元词频（某个单词出现的次数）和二元词频（两个连续单词出现的次数） 举例:I have an apple . And you have an apple , too . 输出: i--1，have--2，an--2，apple--2，and--2，you--1，too--1 an apple--2   

VB实现的线性卡尔曼滤波程序，简单易懂。适合初学者练习参考。-VB linear Kalman filtering procedures, simple and understandable. For beginners practice reference.

求 排列组合,用.net实现,能求出所有的排列组合情况-Permutation and combination for use. Net realized, can be obtained in all cases of permutation and combination

The Molgedey and Schuster decorrelation algorithm, having square mixing matrix and no noise . Truncation is used for the time shifted matrix, and it is forced to be symmetric . The delay Tau is estimated . The number of independent components are calculated using Bayes Information Criterion (BIC), with PCA for dimension reduction.-The Molgedey and Schuster decorrelation algorithm, having square mixing matrix and no noise . Truncation is used for the time shifted matrix, and it is forced to be symmetric . The delay Tau is estimated . The number of independent components are calculated using Bayes Information Criterion (BIC), with PCA for dimension reduction.

吸尘机器人全覆盖算法仿真源码,希望对大家有用-Robot vacuum cleaners cover the whole source simulation algorithm, in the hope that useful to everybody

旅行商问题 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。 例如：给定4个城市{1，2，3，4}及其各城市之间的路程 最优路线是1,3,2,4,1， 其最短路程是25-a salesman, traveling salesman problem, a number of cities to sell commodities, the known distance between the city (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest. For example : given four cities (1,2,3,4) and the distance between the city optimal route is 1,3,2,4, 1, the shortest distance is 25

国家集训队2007论文集 给参加noi acm考试的同学-Essays on the National Team, 2007 to take part in the examination of students noi acm

LexAndYaccTutorial 使用源代码及其详解，编译通过

生物识别：

遗传算法分析代码，可以进行回归分析