易语言 文件完整性检测程序! 利用取文件特征的方法

一个非常有用的软件,可以进行各种图象处理工作.应该很有用.-a very useful software that can be various image processing work. Be very useful.

3100 Tenx MCU Firmware -3100 Tenx MCU Firmware

从老外文章里看到一种基于分类器的人脸检测方法，好不容易搞到这个人脸图像训练集和测试集，现在贡献出来，希望对做人脸检测的朋友有帮助（图像比较全，有彩色人脸图像）-from generals saw an article based on the classification of face detection method finally got the facial image training set and test set, now contribute, hope to the human face detection and friends to help (the whole picture, color facial image)

贪吃蛇，用c#写的，可以控制蛇的速度，空格键暂停-Snake, used to write c#, can control the speed of a snake, the space bar suspension

编写筛选查找素数函数： void sieve(bool isPrime[], int n) 其中isPrime[ ]为一个布尔型数组，n为数组大小。由于2是第一个素数， 所以设置isPrime[0]和isPrime[1]的值为false，并设置其余的元素初值为true。 然后对从4到n－1的每一个i，判断i是否能够被2整除，如果i能够被2整除，则设置isPrime[i]为false。 对从2到n/2的每一个可能的数值重复以上处理，当操作结束时，所有值为true的isPrime[i]所对应的i就是素数，它们将是从筛子中掉下来的。-Find prime numbers prepared by screening the function: void sieve (bool isPrime [], int n) which isPrime [] as a Boolean array, n is the size of the array. Because 2 is the first prime number, so set the isPrime [0], and isPrime [1] a value of false, and set the initial value of the remaining elements of true. And then from 4 to n-1 for each i, to determine whether i can be divisible by 2, if i can be divisible by 2, then set the isPrime [i] is false. From 2 to n/2 possible values for each one to repeat the above processing, when the operation ended, all the true value of the isPrime [i] corresponding to i is a prime number, they will be falling from the sieve in the past.

VS2008环境下配置opencv，1. 安装OpenCV 2.1。2. 安装CMake 2.8.3。3. 编译OpenCV。4. 配置Windows环境变量Path。 5. 为VS2008配置OpenCV环境。6. 使用OpenCV2.1编程

数据结构实验：实现两表达式算术求和 任务：能够按照指数降序排列建立并输出多项式； 能够完成两个多项式的相加、相减，并将结果输入； -experimental data structure : achieving two arithmetic expressions Summation tasks : According to index in descending order and the establishment of export polynomial; to complete the combined two polynomials, subtraction, and the results input;

AODMV tclAODV using ns-2 simulations shows that AOMDV is able to effectively cope with mobility-induced route failures. 

多项式的计算问题，这个小程序实现了多项式求积的算法-Polynomial computational problems, this small program to achieve a polynomial quadrature algorithm

floyd算法，可以求解图论中人与两点之间的最短距离