ajax+jsp打造的Blog源码,运行环境：eclipse+tomcat5.5

图像压缩的GUI程序，可以直接调用，直接读入图片对其压缩-image compression GUI program can directly call directly read into its compressed images

对LZSS压缩算法的深入应用.c-LZSS compression algorithm to the deep application. C

基于小波变换得图像压缩算法，用c++编的

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

一个非常好的圆形Slider Control类,对我们非常实用.-a very good round Slider Control category, we are very practical.

利用RealOne控件制作媒体播放器,实现在单文档结构的视图窗口中播放文件-use RealOne media player controls on the production and achieve in a single document structure of the View window shows documents

算术编码与译码原理以及Matlab实现代码-The principle of arithmetic coding and decoding, as well as realize Matlab 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.

the famous Lempel Ziv Welch compressor.

采用VB+ACCESS编写的学生档案管理系统,-VB+ ACCESS prepared using student records management system,