主要是一些文件的操作，新建文件夹、下载，上传、分割文件、合并文件、Unzip解压Zip压缩、剪切、复制、粘贴 等功能...

DS18B20+1602温度计，代码可以移植在51系列上的单片机。-DS18B20+1602 thermometer code can be transferred in the 51 series on the microcontroller.

这是一个JPEG编码源代码，所有文件加入VisualC++工程即可，内附使用说明-This is a JPEG encoding the source code, all documents can be joined VisualC works, enclosing use

H.264的编码器，用于图像压缩编解码，希望对大家有用-H.264 encoder for image compression codec, in the hope that useful

计算机系统有关摸模仿业务方面的系统用C++做成的-Computer systems related to mimic touch systems business C++ Made

摁。。大家看看马。。比较好用。的一个你们看看马。。。好用的虎 给我讲下。我会加油努力的。 -Press. . Take a look at the horse. . Useful comparison. You take a look at a horse. . . Useful to me under Tiger. I will fuel efforts.

一种新的基于matlab环境的用SVD原理实现图像压缩的源程序，程序简单易懂-Implementation of new image compression using SVD, the program easy to understand

动态规划的算法实例，包括具体的例子和注释，很详细-Examples of dynamic programming algorithms, including specific examples and notes, very detailed

Compression using lempel-ziv -for a dictionary size of 2k -provide dictionary Lempel ziv algorithm is a dictionary based algorithm that addresses byte sequences from former contents instead of the original data. This algorithm consists of a rule for parsing strings of symbols from a finite alphabet into substrings, whose lengths do not exceed a prescribed integer and a coding scheme which maps these substrings sequentially into uniquely decipherable code words of fixed length. The strings are selected so that they have nearly equal probability of occurrence. Frequently-occurring symbols are grouped into longer strings while occasional symbols appear in short strings. -Compression using lempel-ziv -for a dictionary size of 2k -provide dictionary Lempel ziv algorithm is a dictionary based algorithm that addresses byte sequences from former contents instead of the original data. This algorithm consists of a rule for parsing strings of symbols from a fi

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

jpeg2000算法实现-JPEG2000 algorithm