汉字编码转换过程与大家分享好东西

和Unix的compress/uncompress兼容的压缩/解压算法16位程序，适合压缩文本或重复字节较多的文件-16-bit compression and decompression program which is compatible with that in Unix,it is suitable for text

文件压缩功能：压缩指定单个文件，或多个文件（zip格式）；察看压缩文件内每个文件的大小，压缩比信息；解压缩指定文件（zip格式），允许选择压缩包内单个文件进行解压缩；察看整个压缩包的压缩比等信息。-compression function : Compression designated single document, or multiple documents (zip format); A look inside compressed files, each file size, compression ratio; Decompress the specified file (zip format), allowing choice within a single compressed file decompression; Look at the whole compression packet compression ratio and other information.

jpeg2000算法实现-JPEG2000 algorithm

采用VB+ACCESS编写的学生档案管理系统,-VB+ ACCESS prepared using student records management system,

ZIP动态联接库，开发包，适合C++ Bulider，Delphi.-ZIP dynamic link libraries, development kits, for C Bulider, Delphi.

一个不错的视频压缩源码-a good source of video compression

USQ压缩工具, 源码-USQ compression tools, source

#define Zone1 PINC.0 #define Zone2 PINC.1 #define Zone3 PINC.2 #define Zone4 PINC.3 #define Zone5 PINC.4 #define Zone6 PINC.5 #define Zone7 PIND.1 #define Red PORTB.7 #define EndOfValid 11000 eeprom unsigned int Valid= 0 // ---------------------------------------------------------------------------------------------------------------------- void DingDong(void) { Valid++ Red= 1 -#define Zone1 PINC.0 #define Zone2 PINC.1 #define Zone3 PINC.2 #define Zone4 PINC.3 #define Zone5 PINC.4 #define Zone6 PINC.5 #define Zone7 PIND.1 #define Red PORTB.7 #define EndOfValid 11000 eeprom unsigned int Valid= 0 //---------------------------------------------------------------------------------------------------------------------- void DingDong(void) { Valid++ Red= 1

读存储过程，通过一种新的方法读取存储过程。

This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer and Szymanski [2]. An implementation using a binary tree is proposed by Bell [3]. The algorithm is quite simple: Keep a ring buffer, which initially contains "space" characters only. Read several letters from the file to the buffer. Then search the buffer for the longest string that matches the letters just read, and send its length and position in the buffer.