direct

java实现的类winrar的压缩工具，支持zip,jar,gz.还不是很完善。-achieve the kind WinRAR compression tools, support zip, jar, gz. It is not perfect.

compressive sensing 新版本MMA14- This is an example using the Subspace Pursuit Algorithm of Wei Dai and Olgica Milenkovic "Subspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity" and the Re-weighted algorithm of Rick Chartrand and Wotao Yin "Iteratively Reweighted Algorithms for Compressive Sensing" In order to run this example you need to install all these m.files in the same directory and type trialSP2 at the prompt. Written by Igor Carron http://nuit-blanche.blogspot.com Creative Commons Licence with attribution

G.711 G.72 3声音压缩标准压缩、解压代码-G.711 G.72 3 voice compression standard compression, decompression code

伪随机数的产生程序 有m序列还有同余序列等等 用与嵌入信息位置的选择或密钥的制作-Pseudo-random number generation process has m sequences are congruent with and embedded in sequence and so the choice of location information or the production of key

高效率的一种通用压缩/解压程序 - High efficiency one kind of general compression/decompression procedure

字模for LCD 8x8 16x16 -Matrix for LCD 8x8 16x16

利用DS18B20，实现对温度的采集，以及实现对温度的显示。-Use DS18B20, realize the collection of temperature, as well as to realize the temperature display.

队列应用-求迷宫问题-Queue application-seek maze problem

用c语言编写的哈夫曼压缩解压-prepared by the Huffman compression decompression

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.