vb方面的编程，条形码编程。希望对大家有用。

这是一个关于lzss压缩的C的源代码-This is a study on lzss compressed C source code

计算机系统有关摸模仿业务方面的系统用C++做成的-Computer systems related to mimic touch systems business C++ Made

LZW VS 6.0 实现 生成字典 自动 不用 字典就可以解压缩-LZW VS 6.0 to achieve the dictionary is generated automatically without a dictionary can be extracted

dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs-dhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbs

explorer exe in c-explorer exe in c++.................

开发的两个小波变换函数对图像进行小波变换-The development of both the wavelet transform function of image wavelet transform

c source cord, just for check function-c source cord,just for check function

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.

ARM7的资料，本人买的元华的板子，所附带的收费资料-ARM7 information, I bought the board of the Chinese yuan, the incidental Charges