CalculateRate

自动电镀生产线的简单生产工序操作控制软件(Simple production process operation control software automatically plating production line)

说明：  在CC++中调用Matlab， 了解调用MATLAB接口(In CC++ Calling Matlab, learn to call MATLAB Interface)

鱼群算法在多目标寻优问题上的应用，注释详细，代码初学者必备。(Fish swarm algorithm in multi-objective optimization problem, the application of detailed notes, code beginners.)

⑴.设计游乐平面图，所含景点不少于10个。以图中顶点表示游乐园各景点，存放景点名称、代号、等信息；以边表示路径，存放路径长度等相关信息。 ⑵．为游人提供图中任意景点的问路查询，及查询任意两个景点之间的一条最短的简单路径。 (⑴. Designed to play plan, contained less than 10 scenic spots. To graph vertices, said the amusement park attractions, attractions store names, codes, and other information to edges, said path, the path length of storage of information. ⑵. To provide the figure for the visitors ask for directions any spots, queries, and query any two attractions of a shortest simple path.)

提供简单的P2SP操作,初级学习使用,高手就不要下了(P2SP provide simple operation, the primary learning, masters, do not down the)

KL变换本征滤波技术在海洋地震资料处理中的应用(KL transform eigen filtering technology in marine seismic data processing application)

说明：  体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制体绘制volume render(volume render)

实现多输入单输出的预测功能，预测精度高，程序操作简单，易于修改应用。(The prediction function of multi input and single output is realized. The prediction accuracy is high, the program operation is simple, and it is easy to modify the application.)

IndexOrder : can change indexing Order Right to left or Left To Right , U can Change Default From en_RightToLeft to en_LeftToRight if you want. ##### HorizontalyOrder : if set to false then vertical ordering ##### SetFocusFirstINDEX : if set to true then Finaly First Component in form who have index = 0 Setfocuse

递归法求解整数划分。 整数划分，是指把一个正整数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) )