新东方老师强调的6级考试必备100个单词

很好地，希望大家都来看看，关于RS－485方面的知识和串口方面的。-Well, we want everyone to look at it, on the RS-485 serial port of knowledge and respect.

Using the JBIG-KIT library

This 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" In order to run this example you need to install all these m.files in the same directory and type trialSP at the prompt. Written by Igor Carron http://nuit-blanche.blogspot.com Creative Commons Licence with attribution- 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" In order to run this example you need to install all these m.files in the same directory and type trialSP at the prompt. Written by Igor Carron http://nuit-blanche.blogspot.com Creative Commons Licence with attribution

这是一个细胞识别系统。有具有学习意义。是JAVA初学都的良好例子。-failed to translate

huffman编码,请多多指教^_^~多多指教多多指教-huffman coding, please advice ^ _ ^ ~ exhibitions exhibitions

很麻烦的源码上传，郁闷，什么时候能改变一下，为什么要20个字啊-From a source very troublesome, depressing, when you change, why should the 20 words ah

本程序包用标准Ｃ＋＋实现了Huffman编码以及解码的基本类，并且通过ＭＦＣ编写了测试程序，同时显示了各项压缩指标。是学习编码的基本入门资料。-this program use standard c++ to implement Huffman coding and decoding fundamental class,it is tested by a MFC program,which display compression information.it is begginer s material.

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.

使用matlab开发的jpeg工具，其中没有使用matlab中包含的字母进行预测，量化都是自己写的，为lena做压缩，但最后没有做熵的过程

使用java解zip文件包。-Zip file using java package solution.