３D

c++的bit模板只能用常数制定大小，这里重新定义bit使其可以用变量第一定义大小，更方便

Alogothym 对称背景图像处理中。通过 dqd 和图像处理线程开发

在c语言环境下实现快速傅立叶变换的功能，c实现fft变换-In c language environment to achieve the function of fast Fourier transform, c realize fft transform

资源描述里面包含汉字转成拼音首字母，并根据拼音进行搜索

0 / 1背包问题是一个N P-复杂问题，为了解决该问题，，将用回溯算法解决该问题。既然想选择一个对象的子集，将它们装入背包，以便获得的收益最大，则解空间应组织成子集树的形状（如图1 6 - 2所示）。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法，去找到可获得的最大收益。然后，对该算法加以改进，形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0/1 knapsack problem is a P-complex issues, in order to solve the problem, and will be used backtracking algorithm to solve the problem. As to the choice of a subset of object, they will load a backpack, in order to obtain the greatest profits, the solution should be organized into space subset of the shape of the tree (Figure 1 6-2 below). The backtracking algorithms and 4. Two loading problem is very similar. Forming a recursive algorithm to get the maximum benefit available. Then, this algorithm is modified to form code. Improved code can be found at the maximum benefits included in the backpack of a collection of objects.

一个数值微分的例子-Examples of a numerical differentiation

线形最小二乘法拟合。用一个一般的X的幂级数来拟合。-Linear least square method. X with a general power series to fit.

: Apriori算法是一种挖掘关联规则的频繁项集算法,其核心思想是通过候选集生成和情节的向下封闭检测两个阶段来挖掘频繁项集。 

希尔排序-Sort Hill

这是一个基于模拟退火算法的混沌神经网络模型-This is an algorithm based on simulated annealing chaotic neural network model