这是我的圣诞节礼物

讲述一种huffman编码方法的文献，文献里有编码程序的源码，讲解加程序，很全面。-A huffman encoding method on the literature, the literature, there are procedures for the source code to explain the increase in procedures, it is full.

地图着色把地图上的每个城市抽象为一个点，并给每个城市编号，，相邻的城市之间用直线连接。据此做出邻接矩阵，若第i个城市与第j个城市相邻，则metro[i][j]=1,否则metro[i][j]=0。 算法：按照编号从小到大的顺序检查每个城市，对每个城市从1到4使用4种颜色着色，若当前颜色可用（即不与相邻城市颜色相同），则着色；否则测试下一种颜色。 -Map coloring to each city on the map as a point of abstraction, and to every city number, adjacent lines to connect between cities. Accordingly to make adjacency matrix, if the section i and section j cities adjacent cities, the metro [i] [j] = 1, otherwise the metro [i] [j] = 0. Algorithm: In accordance with the code sequence from small to large checks every city, every city on 1-4 from the use of four kinds of color shading, color can be used if the current (ie not with the same colors as the neighboring cities), then coloring Otherwise, the next test colors.

我们老师的一个会计有关绩点的一个课件，很好用的-Our teacher of an accounting point of a performance-related courseware, good used

一个包装zlib的例子，有demo程序-A packaging zlib examples demo program

fdct压缩方法，使用DCT变换压缩周期数据，压缩效果很好-fdct compression method, the use of DCT transform compression cycle data compression works well

一部全面详细介绍SNMP MIB的英文文档，从SMI结果到语法逐一解剖-SNMP MIB a full and detailed description of the English document, the results from the SMI to the syntax of each anatomical

声音的线性预测编码和解码，利用vc的函数直接从mic采集数据或者操作wav文件进行压缩和解压，别情提供回访比较功能。-sound linear forecasting coding and decoding,make use of vc library directly to collect data or operate wav file to compress or decompress ,provide compression function.

这是我的圣诞节礼物-This is my Christmas gift

In each step the LZSS algorithm sends either a character or a pair. Among these, perhaps character "e" appears more frequently than "x", and a pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adaptive kind, along with LZSS.-In each step the LZSS algorithm sends either a character or a lt;position, lengthgt; pair. Among these, perhaps character "e" appears more frequently than "x", and a lt;position, lengthgt; pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adap

惠普实验室的经典代码。用于huffman编码的快速实现，具有参考价值-HP Labs classic code. Huffman coding for the rapid realization of value with reference