我有这个代码在调试运行后

这是老师送我们的他多年来开发的工具包,包括dateioarray et等的处理-This is the teacher sent us over the years, he developed a toolkit, including the date io array net address, etc.

ITU-T G.723.1语音编解码算法源代码-ITU-T G.723.1 speech codec algorithm source code

0_1背包问题用动态规划解给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？ 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-0_1 knapsack problem using dynamic programming solution of a given n types of goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.

UM联信 2009 客户端 注：主程序已经被脱壳-UM 2009 client Note: The main program has been unpacked.

compression with rle algorithm

算术编码与译码原理以及Matlab实现代码-The principle of arithmetic coding and decoding, as well as realize Matlab code

视频压缩标准H264的变换部分的算法实现-H.264 video compression standard part of the Transform algorithm

你是计算机行业的吗？你还在迷茫吗？你还在黑暗中挣扎吗？你还在为未来的发展感到疑惑吗？下载我，我给你答案-You are in the computer industry do? Do you still confused? Are you still struggling to do in the dark? Are your plans for the future development of puzzled do? Download me, I will give you the answer

缩率较高,编译码算法也较为简单的LZ77算法-This algorithm of LZ77 has a good compression,besides it can also be made easily!

在Jpeg中Huffman采用的是范式Huffman编码。经过查相关资料有两种不同说法，请高手指点。谢谢！ 1、构造范式 Huffman 编码的方法大致是： 分别统计从最大编码长度 maxlength 到 1 的每个长度对应了多少个符号。根据这一信息从 maxlength 个 0 开始以递增顺序为每个符号分配编码。例如，编码长度为 5 的符号有 4 个，长度为 3 的有 1 个，长度为 2 的有 3 个，则分配的编码依次为： 00000 00001 00010 00011 001 01 10 11 问题：如果按照这种说法那么我在一付图像中渡到的数据是：编码长度为 6 的符号有 1 个，长度为 5 的有 1 个，长度为 4 的有 3 个，长度为3的个数为4个，长度为2的个数为1个。按照以上的算法得到的编码为：000000；00001；0010；0011；001；010；011；100；01。出现001是0011的前缀。在读取数据流的时候将不能区别。 2、另外一种说法，曾经发帖问过。前面的长度编码加1左移一位得到后面长度的编码。像我这个例子如何确定最短码的起始值？ 谢谢大家指点具体的范式Huffman编码实现-in which Huffman is the paradigm Huffman coding. After investigations related information in two different arguments, please master guiding. Thank you! 1, tectonic paradigm Huffman coding method is generally : statistics separately from the largest maxlength length coding to a length corresponding to each of the number of symbols. According to the information from maxlength-0 progressive order of the distribution of each symbol coding. For example,