高性能视频编码HM（HEVC)

：介绍TSP问题和遗传算法的基本原理。针对解决TSP问题，阐述遗传算法在编码表示和遗传操作算子等方面的应用情况，以及该算法在实现过程中的一些处理方法，最后给出该算法的运行结果和总结。

牛顿－拉夫孙算法-Newton-Raphson algorithm SUN

一个小巧的蚁群算法演示程序，C语言源码，在TC2.0下调试成功！-A small demo program ant colony algorithm, C language source code, in TC2.0 debugging success!

一个VB小程序,能够进行大数的计算,可以作为学习的参考-a small procedure to carry out large numbers of calculation can be used as reference for the study

1．简介 本程序是用C语言编的一个基于命令行的文件合并分割器。主要用于分割和合并文件，可以按大小分或者按个数等分。支持分割和合并的批处理。其中命令行以及批处理语句有一定的规则，需要用户学习后才能熟练使用。 2．功能  能够实现多个文件的合并功能  能够实现同一目录下的所有文件或所有具有相同属性(同后缀)的文件，按照文件名的顺序合并  能够实现对于一个文件的分割功能，可以按照两种要求进行分割：第一，按照用户给出的分割个数；第二，按照用户给出的每个文件大小  支持文件合并与分割功能的批处理-1. Introduction This procedure is used C language based on a series of the command line in the paper division for the merger. Mainly for segmentation and merger documents, in accordance with the size of sub-sub or by number. Support split and merger of the batch. These command line and batch statements to certain rules, requiring the user to learn the use of skilled before. 2. Function# 61548 can be achieved by merging multiple files functional# 61,548 to achieve the same directory of all documents or all of the same attributes (with extensions) of the document, according to documents from the merger order to achieve# 61,548 for a separate function of the document, according to two separate requirements : First, the

//=== === === === === === ===== //函数说明 //函数名称：Correlation //函数功能：计算最小二乘法拟合的多项式的相关系数 //使用方法：int M------ 拟合多项式的阶数（已知条件） // double *b--- 拟合曲线的系数,排列顺序为由高阶到低阶（已知条件） // double *x--- 结点x轴数据（已知条件） // double *y--- 结点y轴数据（已知条件） // double *Yg-- 结点估计值，个数为m（过程变量） // int m------ 结点个数（已知条件） //注意事项：多项式阶数最高为10,多项式的形式为 y = a0 + a1x +a2x2 -//=== === === === === ==== === === === === === === =// letter Description// function name : Correlation// Function functions : Calculation least squares polynomial fitting of the correlation coefficient// Use : int M------ polynomial fitting stage (known condition)//* b--- double fitting song The coefficient, Higher-order the order on grounds of low order (known condition)//* double-node x x axis data (known to be pieces)// double* y--- node y-axis data (known condition)//* double FSL-- Nodes estimates, Number m (process variables)// int m------ node number (known condition)// Note : polynomial order of a maximum of 10. polynomials in the

数字水印技术处理程序集合，具有功能全，卡发好-digital watermarking technology procedures set with a full-featured, a good card

资源描述封装好的C#做的dll可以以直接使用，主要是引用的windows api(c++)。里面重新实现了一些ini的操作方法，注释说明比较清楚，自己可以写一个例子调试一下看看，有任何问题可以联系我

资源描述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