Ma-Calculatrice

说明：  上数据挖掘课的课件，是EM算法的，其中还包括最大似然值，最大似然估计，以及cluster(data mining,EM Algorithm ,Likelihood, Mixture Models and Clustering )

用C++编写的一维和二维快速傅里叶变换程序(Prepared with C++ one-dimensional and two-dimensional fast Fourier transform procedure)

粒子群算法在解决非线性方程上的应用，给出了详细程序(Particle swarm algorithm for solving nonlinear equations, gives detailed procedures)

计算bessel函数的值。在调压室的结构应力计算时可用到。(Calculate bessel function value. Stress in the surge tank can be calculated to.)

用牛顿法解非线性方程组(包括论文及源程序)(with Newton method for solving systems of nonlinear equations (including papers and source))

模糊最小二乘支持向量机，用于剔除偏离较远的数据点，减小野值的影响(Fuzzy least squares support vector machine for the deviation from the data points far removed, to reduce the impact of outliers)

贪婪算法，可以用于资源分配等许多数学问题和工程问题中(Greedy algorithm)

说明：  Delphi实现最小二乘法，进行多点拟合，目前支持4点拟合(Delphi realizes the least square method and multi-point fitting. At present, it supports four-point fitting.)

假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品，能否从n件物品中挑选若干件恰好装满背包，即使w1 +w2 + … + wn=T，要求找出所有满足上述条件的解。例如：当T=10，各件物品的体积{1，8，4，3，5，2}时，可找到下列4组解：（1，4，3，2），（1，4，5），（8，2），（3，5，2）。 [需求分析](Suppose there are a load of the backpack of the total volume of T and n volumes were w1, w2, ... wn items, whether selected from n items a number of exactly filled backpack, even if w1+w2+ ...+ wn = T, find out the solution of all the above conditions are met. For example: when T = 10, the volume of items {1,8,4,3,5,2}, can be found in the following four solutions: (1,4,3,2), (1,4,5 ), (8,2), (3,5,2). [Needs Analysis])

wolfe程序模块的C++算法，可以重复使用,对于解决一维搜索是很好的..(C++ algorithm wolfe program modules can be reused for solving one-dimensional search is good ..)