MFC arbitrary graphics production

数据结构算法与应用-C语言描述阅读软件：Adobe Reader 7.0-data structure algorithms and application-C language description reading software : Adobe Reader 7.0

递归方法的汉诺塔问题，网上大多没有界面，这个有界面，有游戏功能！-Recursive method of Hanoi Tower problem, on-line do not have any interface, this interface has gaming features!

128点DIT FFT,能实现128点的快速傅里叶变换，对在校的大学生学习，试验很有帮助！-DIT FFT 128 points, 128 points to achieve the fast Fourier transform, to the college students study, test helpful!

有限元计算程序，供软件工程，力学专业的老师和学生参考-Finite element program for software engineering, mechanical professional teachers and students for reference

一种求PI值的诡异算法 可以很快求到800位嗷-A PI value for the strange algorithm can quickly seek to the sound of wailing 800

经典的数据挖掘算法的源代码，SMO算法的JAVA实现,在WEKA平台上实现的。从weka中提取的，希望大家多多指正，对我们前期学习有所帮助。SMO算法源程序， java编写。

这段代码展示了如何使用遗传算法优化基站位置

通过输入不同M值（2、4、8），可产生相应的2FSK、4FSK、8FSK数字基带调制信号。该程序产生的基带IQ数据下载到信号源后通过了测试验证。

CKNN  Using the Citation KNN algorithm[1] to get the labels for bags in testBags, where minmum Hausdorff distance is used to measure the distances between bags %     CKNN takes, %        PBags     - an Mx1 cell array where the jth instance of ith positive bag is stored in PBags{i}(j,:) %        NBags     - an Nx1 cell array where the jth instance of ith negative bag is stored in NBags{i}(j,:) %        testBags  - a Kx1 cell array where the jth instance of ith test bag is stored in testBags{i}(j,:) %         Refs     - the number of referecnes for each test bag %        Citers    - the number of citers for each test bag %      &n

二叉排序树排序关于二叉树的排序问题数据结构课程设计