arithmetic

输入两个正整数m和n，求其最大公约数和最小公倍数(Enter two positive integers m and n, can seek the common denominator and least common multiple)

PAV (H265) 是 音视频 压缩解压 协议，非常不同于H264/MPEG4，ZPAV (H265) 的基本算法 是 小波，多级树集合群，广义小波，数学形态小波，...... ZPAV (H265) 基本算法 ： 1，图象与声音分解与合成 ：小波 ； 2，图象与声音前处理 ：小波子带零交叉降噪，目标纹理处理，语音处理 ； 3，速率控制 ：小波子带熵速率控制 ； 4，量化与反量化 ：小波子带熵量化与反量化 ； 5，低频分量和高频分量的降维 ：小波子带邻域交叉降维 ； 6，运动矢量和量化表的分解与合成 ：广义小波 ； 7，位面编码 ：数学形态小波，多级树集合群，嵌入零树，位面降维 ； 8，位流编码 ：算术编码，熵编码 ； 9，运动估计 ：宏块最优决策，运动矢量预测 ； A，运动搜索 ：钻石，大钻石，小钻石，方形 ； B，图象与声音后处理 ：低通滤波，断点重构，宏块平滑 ； C，误码纠错 ：矢量仿真，帧间仿真 。 (The PAV (H265) is the audio and video compression and decompression protocol, is very different from H264/MPEG4 ZPAV (H265) algorithm is a wavelet, multi-level tree collection group, and generalized wavelets, mathematical morphology, wavelet, ... ZPAV (H265) algorithm: 1, image and sound decomposition and synthesis: wavelet 2, image and sound processing: wavelet sub-band zero-crossing noise, target texture processing, speech processing 3, the rate control: wavelet subband entropy rate control 4, quantization and inverse quantization: Wavelet subband entropy quantization and inverse quantization 5, the dimensionality reduction of the low frequency component and high frequency components: the wavelet subbands neighborhood cross-dimensionality reduction 6, the decomposition and synthesis of the motion vector and quantization tables: generalized wavelet 7, bit-plane coding: the mathematical form of wavelet multi-level tree collection group, embedded zerotree, bit plane)

电力输发电系统可靠性评估程序 解析法 系统数据在压缩包里(Power transmission and generation system reliability evaluation process analytical method system data compression bag)

顺序表插入删除，典型的教科书式的程序。老师给的。。。。。。(The order of the table insert removed, a typical textbook-style programs.)

利用gzip.dll解压http请求返回的内容。内附gzip.dll。参考网上资料自己写的VB6工程源码。自己编译EXE的时候注意把gzip.dll释放到exe所在目录。(Use gzip.dll to decompress the content returned by HTTP request. Gzip.dll is attached. Refer to the VB6 project source code written by myself.)

bnpts点云文件 进过压缩处理 大约100000个点(bnpts)

这是一个基于LZARI算法的数据压缩的类.Haruhiko Okumura 于1989年7月4日用C语言写实现了这个算法.但是上面用到了一些全局或静态的变量,在MFC下用起来很不方便.作者把它改写成了一个C++类,使它可以方便的压缩和解压缩。(LZARI algorithm based on the type of data compression. Haruhiko SAP in 1989, July 4 C language daily wrote realization of this algorithm. But above uses some static or global variables, using the MFC which are very convenient. Authors rewrite it became a category C, it can be to facilitate the compression.)

实现Huffman算法，对数据进行最优编码压缩。(huffman code)

基于tinyjpeg的jpeg解压缩程序，可解码jpeg数据为YUV分量数据(Based Solutions tinyjpeg jpeg compression program, you can decode jpeg data to YUV component data)

哈夫曼编码译码系统，设置发送者和接受者两个功能， 发送者的功能包括： ①输入待传送的字符信息； ②统计字符信息中出现的字符种类数和各字符出现的次数（频率）； ②根据字符的种类数和各自出现的次数建立哈夫曼树； ③利用以上哈夫曼树求出各字符的哈夫曼编码； ④将字符信息转换成对应的编码信息进行传送。 接受者的功能包括： ①接收发送者传送来的编码信息； ②利用上述哈夫曼树对编码信息进行翻译，即将编码信息还原成发送前的字符信息。 (Huffman decoding system, set the sender and the recipient of two functions, the sender' s features include: (1) input to be transmitted character information ② statistical character information, the number of types of characters and characters the number of occurrences (frequency create a Huffman tree) ② According to the number of types of characters and their respective number of occurrences ③ use the Huffman tree to find the characters Huffman coding ④ character information into the corresponding coding information for delivery. The recipient of the features include: (1) to receive the coded information to the sender transmission ② above Huffman tree coded information to be translated, is about to coded information to restore the character information before sending.)