Biometric recognition: techniques, applications and challenges

提供离散点三角网与等值线的实现给大家共享。有谁把等值线光滑处理了后，请也别忘了给我一份-provides discrete point triangulation with the contours to the realization share. Who put smooth contours handled, please do not forget to also give me a

本程序适用于求解形如f(x)=1/2*x Ax+bx+c二次函数的稳定点 -this procedure applies to solution of the form f (x) = 1/2* x" Ax+ bx+ c quadratic function of the stable point

MD5以512位分组来处理输入的信息，且每一分组又被划分为16个32位子分组，经过了一系列的处理后，算法的输出由四个32位分组组成，将这四个32位分组级联后将生成一个128位散列值。MD5中有四个32位被称作链接变量（Chaining Variable）的整数参数，他们分别为：A=0x67452301，B=0xefcdab89，C=0x98badcfe，D=0x10325476。当设置好这四个链接变量后，就开始进入算法的四轮循环运算。循环的次数是信息中512位信息分组的数目。

《VC++ 常用数值算法》代码，包含众多常用算法，值得学习参考！-"VC numerical algorithm commonly used" code contains many commonly used algorithms, it is worth studying reference!

基于Gabor的指纹识别系统，有源码，有Demo，指纹图像预处理，Gabor增强，二值化，细化，特征点提取，模板保存与匹配。

对于平稳序列,运用ar模型计算其参数，并进行适应性检验。-for a smooth sequence, the use ar model parameters and adaptive testing.

A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.

分布式系统的大作业，关于paxos算法的实现。

资源描述最小权三角剖分问题是求最小总边长三角网的问题。这是一个多边形，输入或输入点集后必须细分为三角形，满足边缘到边缘和顶点到顶点，以这样的方式来减少三角形的周长的总和。

模糊逻辑的VB实现，简单，但是算法的生成很值得看看，在Diablo,halflife等都能见到它的身影，希望对此研究的有用-Fuzzylogic is programmed by VB,simple,but the algorithm of it is deserved to have a look,in Diablo, halflife you,etc. you could its use, so maybe it will what you want