hunhebiancheng_123

matlab求解热传导方程的几个例子，有注释，适合初学者(matlab solving a few examples of the heat conduction equation, with notes, suitable for beginners)

用FORTRON程序编的最速下降法，用来解决无约束规划问题(With FORTRON program compiled the steepest descent method, which is used to solve the unconstrained programming problem)

正向正态云发生器算法，利用Matlab或VC编程实现正向正态云发生器算法，绘制出云模型。(Forward normal cloud generator)

⑴.设计游乐平面图，所含景点不少于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.)

A little FAT32 Parser with some fuctions.

编程心态管理，自我控制！提高效率。建立目标(Manages itself to move, the formulation goal, the self-surveillance develops the flow )

图像预处理 字符识别实例(I&II) 有助于处理验证码(图像预处理——字符识别实例(I&II))

说明：  罚函数法的Matlab程序设计的相关程序，不一定能运行有些错误可能(external penalty function method)

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

实现buffer.h中的各个缓冲类的函数 (Implementation of the various buffer buffer.h a function of class)