chen1

Hello everybody,I am MAO,I am studying Least mean square algorithm right now.

微软出的CSPDK，可以在2000 sp2及其以下版本使用(Microsoft out CSPDK, in 2000 sp2 and the following version of the use of)

matlab 与 vc++接口五种不同的方法与实例(vc Matlab interface with five different methods and examples)

将Weka数据挖掘工具所产生的K-MEANS和DBSCAN结果转化成MATLAB可输出三维图像的格式(Weka data mining tools will be generated by K-MEANS and DBSCAN results can be exported into MATLAB three-dimensional image format)

一个对应于C5.0的DEMO程序(a C5.0 corresponding to the procedures DEMO)

说明：  掌握用Matlab软件求解微分方程模型的解析解和数值解的方法(Master the use of Matlab software for solving differential equations model of analytical solution and numerical solution methods)

UDF添加动量源项 fluent仿真分析虚拟螺旋桨(UDF momentum)

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )

dick wempdick wempdick wempdick wemp

Combo history box GUI class