压缩、解压缩程序源代码 可供大家参考 压缩率不错的

摄像管理系统，做的有点糙，但是基本功能已经实现，大家可以参考思路-Camera management system, to do a bit rough, but the basic function has been achieved, we can refer to ideas

AD-DA转换接口 转换接口 转换接口-AD-DA covertion interface

Methodology document

自制家用消毒液产生器-homemade household disinfectant generator

声音文件*.spx的解压缩源代码-sound files*. spx decompress the source code

用C语言编的万年历-C language series hefty almanac

基于哈夫曼算法实现的文件压缩和解压缩程序。用MFC编程实现，有界面，可以浏览选择要压缩或者要解压的文件。-Huffman algorithm based on file compression and decompression process. Programming with MFC, there are interfaces, you can browse option to compress or to decompress the file.

基于matlab的小波变换的图象压缩，每个子程序有详细的说明。-based on Matlab Wavelet image compression, each subroutine with detailed explanations.

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.

openjpeg的最新版本哦。欢迎大家下载学习，同时欢迎一起交流-Oh openjpeg the latest version. Welcome to download the U.S. study, also welcomed the exchange with