几个压缩算法程序（改进包括lzw、lz77、compress、huffeman）

基本回音程式,可以改变parameter来测试其速度和音响。-Basic response programs, can change the parameter to test the speed and sound.

《数字图像处理编程入门》吕凤军 第九章的代码。程序较简单，但实现了所有的基本功能。可以作为好的入门教材。-"Digital Image Processing Programming Primer" Mr Lu Fengtai chapter IX of the military code. Procedure is relatively simple, but achieving all of the basic functions. Could serve as a good introductory materials.

FSG加密工具2.0＋源代码经典加壳程序-FSG encryption tools 2.0+ source code procedures classic shell! !

contourlet_toolbox工具箱，用以实现contourlet编码-Toolbox contourlet_toolbox to realize Contourlet coding

非常好的可执行文件压缩软件，支持的格式包括 atari/tos，djgpp2/coff，dos/com，dos/exe，dos/sys，rtm32/pe，tmt/adam，watcom/le，win32/pe，Linux/i386 等等，压缩比率也非常的高。-very good executable file compression software, including support for the format atari/los, djgpp2/coff, dos/com, dos/exe, dos/sys, rtm32/pe, TMT/adam, Watcom/le, win32/pe, Linux/i386, etc., the compression ratio is very high.

目前为止 我所看到翻书效果模拟得最真实的源码-Far fflippage simulate most real

LZW压缩算法源代码和示例程序代码c-LZW compression calculates the law origin code and demonstration procedure code c

0_1背包问题用动态规划解给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？ 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-0_1 knapsack problem using dynamic programming solution of a given n types of goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.

这是一组JPEG解码指令和源代码，详细描述了文档开头部分

That is, can understand the principle of Huffman coding, you can understand the image compression technology