ME500单片机开发系统演示程序

基于Huffman变换的图像压缩算法，c++语言开发的。-image Compression algorithm based on Huffman

用C++实现的学生信息管理系统，实现了学生和老师的创建，添加，删除和查找，统计，界面设置飞入界面，更加人性化-With C++ Realize student information management system, students and teachers to create, add, delete, and search, statistics, interface set to fly into the interface more user-friendly

这是JPEG解码源代码，C++环境下的，内附使用说明-This is the JPEG decoder source code, the C environment, enclosing use

一个用ZIP算法实现的自解压程序制作，就像RAR的自解压以一样，不过压缩率没有RAR的好。-ZIP algorithm used to achieve a self-extracting process of production, like the self-extracting RAR to the same, but the compression rate is not a good RAR.

此布局惟一的遗憾是在IE6以下浏览器中显示为怪异模式,因为HTML代码的头一句加了一个注释,如果删除后在IE中滚动条高度显示不全-This layout only regret is that in IE6 the following displayed in the browser as a bizarre model because the head of an HTML code for adding a comment, if you remove IE after the scroll bar displays a high degree of insufficiency

温度控制系统的设计-Temperature Control System Design

这是个解压缩软件UNZIP的C源程序代码 ，请站长接收-This is a decompression software UNZIP C source code, the receiving station

zip压缩，解压缩代码.-zip compression, decompression code.

jpeg解码程序，把图片的编码变成.c文件，方便各位学习开发。-jpeg decoding process, the coding into the picture. c files to facilitate the development of all learning.

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