模糊内模

cuda学习ppt01具体为lecture1+cuda+introduction+2008，请看ppt了解详情。(cuda study ppt01 lecture1+cuda+introduction+2008 power point)

《文明进化史》策略游戏源码+编译资源。收集到的一个游戏源码。-"history of the evolution of civilization" strategy game-source compiler resources. Collected a game-source.

数字电路故障分析之D算法C++实现。按照教科书编写，可能比较古板。-digital circuit failure analysis algorithm C D realization. According to textbook writing, perhaps more rigid.

数独游戏的Csharp源代码，很不错的，可以不注册下载(Sudoku game Csharp source code, very good, they do not register to download)

说明：  QT界面开发，产品研发界面自定义设计、包含自定义设置项，(QT interface development, product development interface custom design, including custom settings.)

Scalper Free Expire

说明：  用N来表示训练用例（样本）的个数，M表示特征数目。 输入特征数目m，用于确定决策树上一个节点的决策结果；其中m应远小于M。 从N个训练用例（样本）中以有放回抽样的方式，取样N次，形成一个训练集（即bootstrap取样），并用未抽到的用例（样本）作预测，评估其误差。 对于每一个节点，随机选择m个特征，决策树上每个节点的决定都是基于这些特征确定的。根据这m个特征，计算其最佳的分裂方式。 每棵树都会完整成长而不会剪枝，这有可能在建完一棵正常树状分类器后会被采用）。(N is used to represent the number of training cases (samples), and M is used to represent the number of features. The number of input features m is used to determine the decision result of a node in the decision tree, where m should be far less than m. From N training cases (samples), n times are sampled in the way of put back sampling to form a training set (i.e. bootstrap sampling), and the unselected cases (samples) are used to predict and evaluate the error. For each node, m features are randomly selected, and the decision of each node in the decision tree is determined based on these features. According to these m characteristics, the best splitting mode is calculated. Each tree will grow completely without pruning, which may be adopted after building a normal tree classifier).)

说明：  这是一本很好的适合初学者的umat子程序(his is a good umat subroutine for beginners)

gps pygarmin-0[1].6.tgz

说明：  有关小波包的各种程序，小波包分解和选择最佳节点树等。(Various programs related to wavelet packet, wavelet packet decomposition and selection of the best node tree, etc.)