操作系统同步与互斥问题之过桥

One of the world-wide cooperative computing tasks is the "Grand Internet Mersenne Prime Search" -- GIMPS -- striving to find ever-larger prime numbers by examining a particular category of such numbers. A Mersenne number is defined as a number of the form (2p–1), where p is a prime number -- a number divisible only by one and itself. (A number that can be divided by numbers other than itself and one are called "composite" numbers, and each of these can be uniquely represented by the prime numbers that can be multiplied together to generate the composite number — referred to as its prime factors.) Initially it looks as though the Mersenne numbers are all primes. Prime Corresponding Mersenne Number 2 4–1 = 3 -- prime 3 8–1 = 7

本文档介绍了离散傅里叶变换（DFT），即，一个适用于离散傅里叶变换的复值序列。数学将和源代码（写在C编程语言）在附录中提供。

协同过滤，英文名Collaborative 滤波

c写的随机数生成程序，很实用，跨平台，可以在Linux下编译，也可以改成在windows下下编译

解非线性方程组的一种方法：先用一种优化方法将给定初值（它有可能会使得后续的牛顿法发散）通过一条比较快的途径收敛到精确解附近，得到一个新的初始点，然后再通过牛顿法将新的初始点迭代到精确解（一定的误差范围内）。这种方法的优点在于：它可以将牛顿法快速收敛的优势发挥出来，同时又避免了该方法收敛域比较窄的缺点。-solving nonlinear equations in a way : by using a method of optimizing initial Givens (it might make follow-up to Newton"s law divergence) adopted a relatively fast convergence to the channel near the exact solution, to be a new starting point, and then Newton"s law of the new iteration of the initial point of the exact solution ( some of error). This method has the advantage : it can be rapid convergence of Newton"s method to exploit the advantages while avoiding convergence of the method is relatively narrow domain shortcomings.

两个多项式加减乘运算-two polynomial multiplication

通过图形图像，openggl实现了拉格朗日动态图，基于c++ visual2010 ，2008，vc6.0 都能运行

也就是说你在使用 SVM OSU_3.00工具箱要在Matalab软件的界面下进行使用，可以实现SWM的数据分类和回归拟合功能 -In other words you are using SVM OSU_3.00 Toolbox Matalab software to use interface, you can realize SWM data classification and regression fitting function

遗传算法求解tsp问题,采用遗传算法，比其他的算法更容易解决tsp- GA to solve the tsp problem

通过MCU检查声音