agreement h261 coding yards inside lib_261.h provided a detailed interface and a...

DataGrid双向排序方法程序设计-DataGrid bidirectional sequencing design methods and procedures

DPCM编码的simulink仿真实现，很好很强大-DPCM coding simulink simulation, very good very strong! ! !

最新h.264 c++原型代码。请解压到固定目录下，目录中有编译说明。-latest h.264 c prototype code. Please extract fixed directory and compile a directory shows.

快速排序,快速排序是对冒泡排序的一种改进。它的基本思想是：通过一躺排序将要排序的数据分割成独立的两部分，其中一部分的所有数据都比另外一不部分的所有数据都要小，然后再按次方法对这两部分数据分别进行快速排序，整个排序过程可以递归进行，以此达到整个数据变成有序序列。-Quick Sort, Quick Sort Bubble Sort is an improvement. Its basic idea is: lying through one sorting to sort the data to be split into two independent parts, one part of all of the data than the other one is not part of the all the data should be small, and then meeting the two methods were part of the data quick sort, the entire sorting process can be recursive, and thus the entire data into an orderly sequence.

感应电机本体程序代码，包括各种坐标之间的变换，-Induction motor body code, including the transformation between the coordinates,

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

自适应的霍夫曼编码是一种扩展的熵编码方法，取得了更高的编码效果。这是几种自适应霍夫曼编码的实现方法。希望对大家有用。-adaptive huffman coding is an extended coding method ,which can get more efficient compression ratio. this is kinds of adaptive huffman coding methods. i hope it will be useful for people who research huffman code.

霍夫曼压缩算法，针对图像压缩，绝对好用，不信试试。-Huffman compression algorithm for image compression, the absolute ease of use, not to try.

label1.Caption:=ComputerId1.MacAddress //得到Mac地址 label2.Caption:=ComputerId1.CPUSerialNumber-label1.Caption : = ComputerId1.MacAddress// Mac address is label2.C aption : = ComputerId1.CPUSerialNumber

这是一个VC++演示的小例子,比较简单,但还是很典型的,按S为方框,按C为椭圆,-VC This is a small example of the demonstration, relatively simple, but still very typical, according to Box S, by C. elliptical,