sm3

使用哈弗曼算法，对文件进行压缩然后再进行解压。(Use the Huffman algorithm to compress the file and then decompress.)

压缩与解压缩类；压缩文件至.zip包内，增加文件至.zip包内，及解压缩相关操作。(zip and unzip。)

一种改进的方案，它针对硬故障集的特点利用指示频率连续长度码(FDR码)进行二次编码压缩。该方法充分利用测试集中无关位较多而测试模式之间变化位较少的特征，应用贪心算法对预先计算的测试集进行了重新排序，尽可能的使相邻的向量间具有最少的不同位，排列成一个最佳的差分向量序列，然后应用FDR码对差分向量序列进行编码,最后对压缩结果重新分块，按照一次压缩的流程进行二次压缩。在解压时，使用片上解压电路解压，能高效地还原出原测试集。最后通过对Soc部分标准电路硬故障集的测试结果显示，本方案具有较好的压缩率。(a new improved method was proposed in the paper,the method using Frequency-Directed Run-length(FDR codes)coding for the twice aimed at hard-fault. It fully takes advantage of the characters that there are many don’t-care bits in the test set but a few different bits between the test patterns, Then it applies the greed calculate way to sort the precomputed test sets and make the close together vector have the least different sites possibly. It uses the FDR codes to coding the vectors,then blocks the results and uses the FDR codes to compress for the second time. Decompression used of on-chip circuit extract unpack,it will be deoxidize the original test efficient.using the hard-fault to compress and the experimental results prove that the improved coding method of this paper has the better compression ratios has been proved at last. )

一个强大的图象压缩开发包，支持压缩格式为jpeg，jpeg2000有损无损压缩(A powerful image compression development kit, support for compression formats jpeg, jpeg2000 detrimental to lossless compression)

16字节字符串压缩成12字节字符串算法，有压缩和解压的算法(16-byte string into a 12-byte string compression algorithm, compression and decompression algorithms)

哈夫曼编码(Huffman Coding)，又称霍夫曼编码，是一种编码方式，哈夫曼编码是可变字长编码(VLC)的一种。Huffman于1952年提出一种编码方法，该方法完全依据字符出现概率来构造异字头的平均长度最短的码字，有时称之为最佳编码，一般就叫做Huffman编码(有时也称为霍夫曼编码)。(Huffman encoding (Huffman Coding), also called Huffman Coding, is a way of Coding, Huffman Coding is variable word length Coding (VLC). Huffman in 1952 put forward a kind of coding method, this method is completely based on the characters of the occurrence probability to construct the average length of the shortest code word, sometimes called the best coding, generally is called Huffman coding (sometimes referred to as the Huffman coding).)

用C++的模板类实现的霍夫曼树及其编码过程，可视地展示霍夫曼树的结构。(Huffman tree and its encoding process to achieve C++ template class, visual display of the structure of the Huffman tree.)

基于霍夫曼算法的压缩与解压程序。其中压缩与解压的exe是分开的。(Using Hoffman algorithm to compress and decompress)

263yasuoyuv.rar是把yuv-411格式文件压缩为*.263可直看(263yasuoyuv.rar is yuv-411 format for the*. 263 files can be read straight)

采用LBM+LES方法编制 了计算程序.首先计算了湍流平板附面层解,用来校对程序的正确性,结果表明计算值和理论值符合得很好.然后计算了亚音可压缩的湍流后台阶流以及超音湍流的 后台阶流.(LBM+LES simulation of flow)