PCA人脸识别源代码

高级加密标准（AES）

dddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd

编程序管理学生成绩，计算并输出学生姓名、各公共课的成绩、平均分和总分,专业课会计学成绩、经济学成绩以及所有课程的总成绩。在main函数中进行测试。-Procedures for the management of student achievement, students calculate and output the name of the results of the public courses, with an average points and total score, specialized accounting results, performance and economics of the total score of all courses. In the main function for testing.

矩阵求逆 采用追赶法实现矩阵求逆的快速算法-Matrix Inverse

计算时间序列的近似熵,英文为Approximate entropy此程序可以较为快速的计算出序列的近似熵。

Fourier-Mellin算法，更多细节请看下面的网址： http://www.ecs.soton.ac.uk/~aiw99r/fm_transform/-Fourier-Mellin algorithm for fm transform , for more detailed information please check with http://www.ecs.soton.ac.uk/~aiw99r/fm_transform/

    本例子在VC6.0上编写了判断点是否处于多边形内的最佳方法，它和一般的叉乘判别法，角度判别法，面积判别法不同，它适用于任意多边形（包括凹凸边形）。它的基本思想就是：假设需要判定的点P，通过点P水平向左做射线，如果P在多边形内部，那么这条射线与多边形的交点必为奇数，反之，交点个数为偶数。所以，我们可以顺序考虑多边形的每条边，求出交点的总个数。当然，存在一些特殊情况，例如射线刚好和多边形端点相交。对于一些特殊情况，算法也有所考虑，并一一解决。具体见算法里的注释即可。

数组为8位char型数值，通过该函数可以计算出数组的16位循环校验码。-Array for the 8-bit char type values can be calculated through the function of an array of 16 cycle parity-check codes.

资源描述此程序是利用回溯法的思想，来解决N皇后问题。利用Ｃ＃语言进行开发，可以更加直观的观察回溯法的运用步骤。

资源描述CS7495 Final Project  Sooraj Bhat Object Removal by Exemplar-based Inpainting USING THE CODE Everything was done in Matlab and MEX (i.e. a C function callable from Matlab).  First, the C code needs to be compiled.  At the Matlab prompt, type:    mex bestexemplarhelper.c You should then be able to run the following (which takes ~2mins on my 2GHz Pentium 4 laptop with 256MB of RAM):    [i1,i2,i3,c,d,mov] = inpaint("bungee0.png","bungee1.png",[0 255 0]); A smaller run (~25 seconds) would be:    [i1,i2,i3,c,d,mov] = inpaint("bw0.png","bw2.png",[0 255 0]); To visualize:    plotall;    close; movie(mov); SAMPLE IMAGES & RESULTS *0.png      The original images ("bw" and "bungee") *{1,2}.png    The different fill region masks. *P2.png     &nbs