graphcut源代码，提供下载，共同学习，共同进步

劲舞009.让别人掉线.SF可用!大家来下载吧-Dance 009. Let others dropped. SF available! Everyone to download it

tar原码，不知道有没有用-tar source was not aware useless

霍夫曼编码是可变字长编码(VLC)的一种，是消除编码冗余最常用的方法。 它是Huffman于1952年提出一种编码方法，它的基本原理是频繁使用的数据用较短的代码代替，较少使用的数据用较长的代码代替，每个数据的代码个不相同。有时称之为最佳编码，一般就叫作Huffman编码。下面引证一个定理，该定理保证了按字符出现概率分配码长，可使平均码长最短。-Huffman coding is a variable word length coding (VLC) A is to remove redundant code of the most commonly used methods. It is Huffman in 1952 made a coding method, and its basic tenets are frequently used data with the code instead of a shorter, less use of the data over a longer period instead of the code, the code for each data-not the same. Sometimes referred to as the best coding, the general called on Huffman coding. Below prove a theorem, the theorem guarantees by the characters emerging probability distribution yards long, will enable the shortest average yards long.

仿WinRar解压缩VB版 这个示例就是利用这个动态链接库进行的一些操作，但目前还没有压缩文件的功能，里面的dll函数接口还需要进一步的解析和查找资料，官方好像也没有提供，希望有知道的网友也可以提供一下。更希望感兴趣的网友继续进行挖掘和开发。 源代码附有详细的注释和文档说明。使用前请把压缩包里的 UnRar.dll拷贝到你的计算机的系统文件夹下，如 WindowsSystem32下。-WinRar imitation extract VB version of this example is the use of the dynamic link library to carry out some operation, but it has not been compressed files, inside the dll interface function need further analysis and search for information, the official did not seem to offer hope to have users know that you can provide. Also hope that users are interested in continuing to carry out excavation and development. Source code with detailed notes and documentation. Please use the pre-compression of the bag UnRar.dll copy to your computer s System Folder, such as under WindowsSystem32.

Lossless Audio 缩解压 window-Lossless Audio reduction extracting window

本程序采用了最简单的方块编码对512×512的lena图像进行了编码.运行程序后可以看出，方块取得越大，图像编码后失真越大。-This procedure uses the most simple code box 512 × 512 on the lena image coding. After running the program we can see that the box to obtain the greater the greater the distortion image is encoded.

基于改进K-means的压缩IP 由于k-means本身受异常点影响较大，这里采用迭代k-means的方法，降低异常点的影响，减少计算量和提高聚类数目的灵活性。并添加合并异常聚类方法，提高聚类的均匀性-K-means based on improved compression IP As k-means itself is influenced by outliers, where an iterative k-means method to reduce the impact of outliers, reducing the number of cluster computing capacity and enhanced flexibility. And add the combined abnormal clustering method to improve the uniformity of clustering

分页内容 很详细自己看吧 不多说上来拿东西的哎-Page content in great detail for yourself to come and collect more than say the last thing hey

用于数据流压缩的huffman算法源代码-data flow for the Huffman compression algorithm source code

windows gzip source code