chazhinihe

有N件物品和一个容量为V的背包。第i件物品的费用是c，价值是w。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量，且价值总和最大。(There are N items and a knapsack capacity of V' s. No. i is the cost of items c, the value of w. Solving items into the backpack which will enable the cost of these items does not exceed the sum of the capacity of backpack, and the sum of the maximum value.)

包括了几类MATLAB实用实例源程序，希望大家能所用(MATLAB includes practical examples of the types of source code, hope that we can use)

matlab code for adaptive equalizer..

稀疏表示分类算法在ORL人脸库上的实验，参考文章： Wright J, Yang A Y, Ganesh A, et al. Robust face recognition via sparse representation[J]. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 2009, 31(2): 210-227. (Sparse representation classification algorithms on ORL face experiments, refer to the article: Wright J, Yang AY, Ganesh A, et al Robust face recognition via sparse representation [J] Pattern Analysis and Machine Intelligence, IEEE Transactions on, 2009, 31 (2):.. 210-227.)

说明：  磁流体力学模拟源程序 需要设定初始值就可以计算相信会对大家有帮助(simulation for magnetic dynamic )

DSL物理层仿真系统 matlab代码，包含了DSL系统物理层的基本模块(DSL physical layer simulation system matlab code, contains the basic module system physical layer DSL)

tes for 70-200 tes for 70-200 tes for 70-200

说明：  关于滤波器的源码 能够在MATLAB上运行(On the source filter can be run in MATLAB)

read the SAC format

用于Matlab计算迭代计算的，非常典型，还有完整的解释(Iterative calculation for Matlab, very typical, as well as a complete explanation)