用fortran编写的有限元网格划分程序，主要用于生成三角形单元。可用于不同的数值计算，比如有限体积法，有限单元法，等等。...

face detection based on color

VC 实现逐行读取txt文本文件

非线性方程求解例子--Examples of Non Linear equation`s solution

趣味问题的程序原代码 海滩上有一堆桃子，五只猴子来分。第一只猴子把这堆桃子凭据分为五份，多了一个，这只 　　　猴子把多的一个扔入海中，拿走了一份。第二只猴子把剩下的桃子又平均分成五份，又多了 　　　一个，它同样把多的一个扔入海中，拿走了一份，第三、第四、第五只猴子都是这样做的， 　　　问海滩上原来最少有多少个桃子？- On the interest question procedure original code beach has pile of peaches, five monkeys divide. The first monkey divides into this pile of peach proof five, many, this monkey has thrown into many in the sea, took away. The second monkey the peach which is left over equally divides into five, also many, it similarly has thrown into many in the sea, took away, third, fourth, the fifth monkey all is does this, asked how many peaches on the beach most is originally unusual?

一个计算圆周率的自编程序（带原码）。可以计算40000位以内的圆周率。经过充分优化，速度非常快。 开发平台：turbo-pascal 7.0， 嵌入汇编。-a calculation of the ratio of circumference wrote (with the original code). 40,000 can be calculated within the pi. After full optimization, speed very quickly. Platform : turbo-pascal 7.0, embedded in the compilation.

利用该程序，可以作为相应程序的一个函数功能-Use of the procedure, the procedure can be used as a function of the corresponding function

加密算法，通过一组数学公式,把原文转换成密文-encryption algorithm, a mathematical formula group, the original transformed into ciphertext

Bellman Ford algorithm for finding the shortest path between nodes is an algorithm used.  primarily in the gray box identifies nodes are between our EDGE. Then we set the starting node (for one example)  resulting path will be drawn on lef

O 因子正定 N 由 N 矩阵成低密度脂蛋白 A * * T， L 在哪里与部分沿对角线的下三角矩阵 D 是一个对角矩阵与积极的条目 在对角线上 输入： 维度 N;1 条目 A(I,J) < = I J < = A.N 输出： 条目 L(I,J) 1 < = J < 我 1 < = I < = N L 和 D(I)， 1 < = I < = D.N

这是一个用于生成等值线的源代码，程序根据输入的高程文本文件，自动跟踪等值点，并生成相应的等值线。- This is uses in to produce the equivalent line the source code, the elevation text documents which the procedure basis inputs, automatic tracking equivalent spot, and production corresponding equivalent line.