zip4j

随机解调器，可在压缩感知中获取压缩采样。(Get compressed samples)

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

计算多重积分是蒙特卡罗方法的重要应用领域之一。本章着重介绍计算定积分的蒙特卡罗方法的各种基本技巧，而这些技巧在粒子输运问题中也是适用的(Calculation of multiple points is an important application of the Monte Carlo method, one of the areas. This chapter focuses on calculation of definite integral of the Monte Carlo method, a variety of basic skills, and these skills in particle transport problems are also applicable to)

这里给出的源代码huffman.zip用8种不同的方式实现了Huffman编码算法。这些代码意在演示不同Huffman算法的实现原理，比较算法执行效率的差别，但并没有针对实际应用环境的需求，做更多的空空空间或效率优化。全部代码以C++语言开发，为了更容易地实现各种数据结构，代码中大量应用了标准C++库与模板技术。——总之，这些代码的作用在于示例与演示；如果大家想把这些代码应用在实际应用中，可能还需要 (The given here source code huffman.zip eight different ways to achieve the Huffman coding algorithm. These codes are intended to demonstrate different Huffman algorithm implementation principle, the difference of the algorithm execution efficiency, but does not demand for practical application environment, do more empty space or efficiency optimization. The entire code C++ language development code in order to make it easier to achieve a variety of data structures, a large number of applications the standard C++ library template.- In short, these code examples and demonstration If we want the code used in practical applications may also need)

这是关于图象压缩的程序，包括有损压缩或无损压缩两类。用的是jpeg2000的压缩标准，但是这是jpeg2000的第一部分(This is the image compression procedures, including lossy compression or lossless compression of two categories. Using the JPEG2000 compression standard, but this is the first part of JPEG2000)

Rle8的解码程序(Rle8 decoding procedures)

该程序用来计算变压器互感，相关参数计算一定正确(The procedure used to calculate the mutual inductance of transformer, the relevant parameters must correct)

JPEG压缩核心变换DCT实现源码，用matlab7.0实现(JPEG compression core transform DCT achieve source used to achieve matlab7.0)

哈夫曼编码(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).)

说明：  A Visual Cryptography Based Watermark Technology for Individual