透视 瞬移 人物上色 非常实用的一款工具

计算理论的经典算法，将确定型有穷自动机最简化，根据等价类的算法用vc实现化简过程。-classical theory calculation algorithm, will determine type DFA most simplified, according to the algorithm equivalence classes with vc achieve simplification process.

基于hyperbolic Householder transformation的QR分解。 其使用需要调用hyperbolic Householder transformation程序。-Hyperbolic Householder transformation based on the QR decomposition. Their use need to call the hyperbolic Householder transformation process.

带有测试数据的蚁群算法，可以指定检测区域的大小，经过测试，可以运行，有需要的可以看看。

这是 一个程序来计算值的任何表达式 （使用堆栈） e.g. 3 * 5 + 2 * 4 - 5. 有效利用堆栈的太执行给定的任务 使用只有堆栈 immplementation 算法

人工智能导论的课件，希望对你来说你有用的，能用得到-Introduction to Artificial Intelligence courseware, you want to be useful for you, and can be used to be

矩阵运算，具体说明见程序中，在各个程序中都有详细的介绍- The matrix operation, concrete showing sees in the procedure, all has the detailed introduction in each procedure

平均因子分解法，适用于正定矩阵First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X=U U, where U is the square root matrix of X, and satisfies: (1) U U = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is "positive definite" which guarantees the existence of such kind of decomposition. -Average factor decomposition method applied to positive definite matrix First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X = UU, where U is the square root matrix of X, and satisfies: (1) UU = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is positive

这是一个已经在我们的论文中所使用的标准代码。关于如何使用C / MATLAB HMAX源代码指令：下载的压缩包HMAX解压它：焦油-xvf hmax.tar这样做：MEX myRespC2new.c（这是MEX函数来计算C2激活）到MEX.c文件编译成.mex*或.dll的平台启动MATLAB键入主运行演示程序，它加载的图像（testImage.gray），并计算出它的C2反应（这是存储在c2Resp之后）。

独立于AVL库的存储媒体 虽现在有不少可用的AVL树库，但几乎都是工作在RAM中，当数据量小的时候，这种方式可行，但当树结构变大时时，读取和存储的时间就会大大变长，任务效率大大降低。能不能直接用磁盘进行树的操作呢？若可以，就不必进行频繁的磁盘内存交换了，本程序就实现了这个功能。实际上，这个程序无论是磁盘还是内存，都很好用。-independent of the AVL storage media is now available in a number of the AVL tree, But almost all work in the RAM, when a small amount of data, this approach feasible, but big tree structure constant, read and storage time will be much longer and the task efficiency has been greatly reduced. Can directly use the disk tree operation? If so, there is no need for frequent exchange of disk memory, the process to achieve this function. In fact, this procedure is disk or memory, are very handy.