实现JPEG编码功能，并能够选择压缩模式

zlib源码 -zlib source

SharpZipLib之前叫做NZipLib，完全由 C# 开发的压缩库，支持Zip, GZip, Tar and BZip2 ，为2007年8月最新0852release版的代码实例！ Changes for v0.85.2 release Minor tweaks for CF, ZipEntryFactory and ZipFile. Fix for zip testing and Zip64 local header patching. FastZip revamped to handle file attributes on extract + other fixes Null ref in path filter fixed. Extra data handling fixes Revamped build and conditional compilation handling Many bug fixes for Zip64. Minor improvements to C# samples. ZIP-1341 Non ascii zip password handling fix. ZIP-355 Fix for zip compression problem at low levels -SharpZipLib called before NZipLib, entirely by the C# Compression library developed to support the Zip, GZip, Tar and BZip2, for in August 2007 the latest version of the code examples 0852release! Changes for v0.85.2 releaseMinor tweaks for CF, ZipEntryFactory and ZipFile.Fix for zip testing and Zip64 local header patching.FastZip revamped to handle file attributes on extract+ Other fixesNull ref in path filte

求树的中序遍历,运用的方法是用非递归的算法来做的.-for tree traversal sequence were used method is the use of non- recursive algorithm very consistent.

基于小波的图像压缩，可运行，基于实数小波和EZW编码-Wavelet-based image compression can be run, based on real wavelet and EZW coding

压缩工程文件打包源码-compression works documents packaged source

探地雷达正演模拟激励源雷克子波的合成matlab源代码-The matlab code for GPR forword modeling of Ricker wavelet

用于电力系统潮流计算 c++程序 -For power system load flow calculation c++ Procedures

哈夫曼压缩程序，实现了文件加读取，对文本文件的压缩率与rar差不多，读学习c/c++的朋友非常有用-huffman compression program, which realizes folder access and compressing rate is the same to rar when compressing text file

signal-processing.rar信号处理demo原码-signal processing signal-processing.rar the original demo code

) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree. -) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The