中国跳棋程序源码

     该程序代码对应《算法设计与分析基础---第2版》中最开始的求取最大公约数的三种算法，第一种欧几里得算法，第二种是连续整数检测方法，第三种方法是分解质因数的方法，代码简单易懂，适于参考学习。

Runge-Kutta-Fehlberg method

用底层代码书写， 没有使用opengl等工具，更方便理解转化的过程

崭新矢量机SVM源码，IEEE上发表，技术有一定帮助-New vector machine SVM source, IEEE published, technology has certainly helped

c实现的A律/mu律pcm编译码算法 只需要根据不同的需要更改输入数据即可-c achieve A legal/mu legal pcm encryption algorithm based on different needs only the need to change the input data can be

Some of the basic matrix operations

模式识别，距离计算，聚类分析，判别函数，判断准则等的算法实现-Pattern recognition, distance calculation, cluster analysis, discriminant function, the algorithm to determine criteria

recognition of handwriting that implement with matlab and neutral network.

约瑟夫问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，没人持有一个密码。一开始人选一个正整数作为报数上限值m，从第一个人开始按顺时针自1开始报数，报到m是停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。-a description of the problem is : No. 1, 2, ..., n n clockwise direction by individuals sitting around a circle, no one holding a password. One person started as a positive integer limits on the number of reported m, from the first individuals to embark on the clockwise from a few reportedly started, the report m is reportedly stopped a few. M reported out of the list of his password as a new value m, from a clockwise direction in the next re-started from a newspaper a few, like that, until the total of all listed so far.

MEPG4协议编解码算法和源代码、DEMO等