20084WANGGONG

有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.)

浪涛之巅小说，介绍互联网技术的发展，非常好的资料；(Introduct book for internet development)

Matlab 视频去隔行代码AMCC法，效果很好(Matlab code Deinterlacing)

automatic threshold segmention

Visual C++和matlab联合编程的详细代码(Visual C++ And joint programming in detail matlab code)

根据用户输入的年月日计算出第几天的控制台应用(To calculate the day of the console application based on user input date)

隐马尔科夫模型，matalb实现，比较好的(Hidden Markov Model, matalb achieved relatively good)

matlab编写的一个递归应用，同时生成动态链接库（dll）。并用vc++测试(matlab generate dynamic link library (dll). And using vc++ test)

c语言和matlab互调 c语言和matlab互调 (c language and intermodulation c Matlab language and intermodulation c Matlab and Matlab language intermodulation c Matlab language and intermodulation)

search in list box in exe form