zip

一种改进的方案，它针对硬故障集的特点利用指示频率连续长度码(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. )

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

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

压缩包中包含了gl.h，glaux.h，glext.h，glui.h，glut.h等头文件以及对应的库文件。还有对应的配置方法。(Compression package contains gl.h, glaux.h, glext.h, glui.h, glut.h Header Files and corresponding library file. There are corresponding configuration.)

说明：  图的算法实现 （1）将图的信息建立文件； （2）从文件读入图的信息，建立邻接矩阵和邻接表； （3）实现Prim、Kruskal、Dijkstra和拓扑排序算法。 (Graph Algorithms (1) will map the information to create the document (2) read from the document map information, the establishment of adjacency matrix and adjacency list (3) the realization of Prim, Kruskal, Dijkstra, and topological sorting algorithm.)

解压ZIP格式的文件，VC++写的，完全可用的，希望你能喜欢。(Extracting ZIP format file write the VC++, completely available, hope you like it.)

基于类函数形函数的参数化建模方法，适用于气动设计和优化(Class/Shpae Transform method)

有关算术编码对文本压缩的程序在c++环境中实现(about arithmetic compressed)

哈夫曼编码译码系统，设置发送者和接受者两个功能， 发送者的功能包括： ①输入待传送的字符信息； ②统计字符信息中出现的字符种类数和各字符出现的次数（频率）； ②根据字符的种类数和各自出现的次数建立哈夫曼树； ③利用以上哈夫曼树求出各字符的哈夫曼编码； ④将字符信息转换成对应的编码信息进行传送。 接受者的功能包括： ①接收发送者传送来的编码信息； ②利用上述哈夫曼树对编码信息进行翻译，即将编码信息还原成发送前的字符信息。 (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.)

Huffman编码，使用哈弗曼树生成前缀码，把输入的字符编码并把原字符解码(Huffman code and decode)