对于独立使用FFT和DLL文件

应用背景霍夫曼树-C++源码实现：哈夫曼树是带权路径长度最短的树，权值较大的结点离根较近。关键技术给定n个权值作为n的叶子结点，构造一棵二叉树，若带权路径长度达到最小，称这样的二叉树为最优二叉树，也称为哈夫曼树(Huffman Tree)。

A program to demonstrate the optimization process of particle swarm optimization. A two-dimensional objective function is visualized by level of grey: the lighter the color, the higher the function value. The particles are shown as red circles, their trajectory as red lines.-A program to demonstrate the optimization process of particle swarm optimization. A two- dimensional objective function is visualized by level of gray : the lighter the color, the higher the value function. The particles ar e shown as red circles. their trajectory as red lines.

本系统是一个简单的朴素贝叶斯的数据集分类系统,能够通过输入数据并预测数据集属于哪一个类-The system is a simple Naive Bayes data sets classification system through the input data and prediction data sets belong to which category

求某范围内得素数，我们多核试验提供得，老师让把它并行化-A framework for a prime number, we provide a multi-core test, the teacher let it parallelization

使用自上而下分析法，实现了预测分析程序，主要包括求非终结符的First集，Follow集，和分析表，最后使用栈对文法进行分析。使用VC++6.0打开工作空间便可以直接运行。

利用概率论与随机过程的方法求pi，即著名的浦丰问题的算法-we find a way to calculate pi

如何进行计数的甚至在一个给定的数字位数。在这里我们使用如果数完全除以 2(an integer) 那么它是奇数或者偶数的概念。

Clustering objects on subsets of attributes - COSA - a subspace clustering algorithm.-Clustering objects on subsets of attributes- COSA- a subspace clustering algorithm.

按照既定的步长，输入后筛选已有数据 程序2-accordance with the established step, the imported data screening procedures have been 2

数学建模方法，写论文的重要帮助，不会建模可写不出高质量的文章啊。-Mathematical modeling method, an important thesis help, will not be high-quality modeling can not write an article ah.