图片处理功能

这是我根据别人的算法写的模拟停车场问题的c程序，原有算法有一些指针调用的错误！，现已改正-This is the basis of others I write the algorithm simulation of the car park c procedures, some of the original algorithm called the wrong target! That has now been rectified.

C#寻找素数 素数寻找问题由来已久，一直是一些数学家追求的目的。-C#-finding prime numbers to find a few long-standing problem, mathematicians have been some of the objective pursued.

利用C语言产生随机数，每次的随机数都是不一样的，并把随机数写到指定的文件中-The use of C language random number generated each time the random number is not the same, and wrote a random number of the document specified

采用RB树的数据结构，采用mfc框架，界面仿照金山字典，实现 搜索，删除，添加，记忆功能。 在搜索的过程中最大化优化效率，使得时间最少，相比传统的字典树有它的优势！！！！

人脸识别的最基本的算法PCA，主要是描述了特征值法的基本原理，内容很详细。-Most basic algorithm for PCA Face RecognitionFace recognition algorithm is the most basic PCA, mainly describes the basic principles of characteristic value method, content, very detailed.

一个求素数个数的程序 算pi(1000000000)不要1秒每个块如果10 0000, 需要 < 100000次全搜索加上8000 * 8000 < 6400 0000 总的次数小于7000 0000,就是说,搜索次数大大降低-for a few number-counting procedures pi (1000000000) not a second of each block of 10 0000, the need lt; Search 100,000 plenary with 8,000* 8,000 lt; 6400 0000 total is less than the number 7000 0000, that is to say, greatly reducing the number of search

在Delphi中安装RTC-SDK组件

一个基于指数法的火力毁伤评估软件，没有涉密数据，代码一般-an index based on the fire damage assessment software, no classified data, the general code

％ [nearest_neighbours] = find_nearest_neighbours( database, desc, max_dist ) ％ Find the indices of the nearest neighbours of the given desriptors in the近邻点寻找算法，在非线性时间序列中很有用，是常用的算法- [Nearest_neighbours] = find_nearest_neighbours (database, desc, max_dist) Find the indices of the nearest neighbours of the given desriptors in the neighbor-point search algorithm, the nonlinear time series of very useful, is a commonly used algorithm

基于稀疏的人脸识别，数据库为ORL，共40人，每人10幅图片，可以随机选择训练样本，剩下为测试样本。选择20次结果的平均值为最终结果。