ADW1007_DRF4463F_Reference_Code

median filter for image in c

黑箱优化算法，挺不错的，希望大家喜欢(Black-box optimization algorithm, very good, and I hope everyone likes)

Generates a symmetric matrix with non-zero diagonal elements

MemDC防止屏幕闪烁的好方法，如不使用内存DC在画图，显示时会闪烁。(memdc redraw dc)

实现ZOOM-FFT的功能，对频谱进行了10倍的细化。(realize ZOOM-FFT fanction)

要在VC中成功编译Matlab引擎程序，必须包含引擎头文件engine.h并引入Matlab对应的库文件libmx.lib、libmat.lib、libeng.lib(VC to successfully compile Matlab engine procedures, must include the engine header files engine.h and the introduction of the corresponding Matlab library files libmx.lib, libmat.lib, libeng.lib)

说明：  MATLAB数学实验之符号运算，其中包含课件以及习题和答案，文档中附有源程序(MATLAB Mathematical experiments symbolic computation, which includes courseware, as well as exercises and answers documents available source)

c++priemer第三版，中文完美翻译，超好，希望对大家有用(c++ priemer third edition, Chinese perfect translation, super good, I hope useful for everyone)

用Matlab程序， 播放世界名曲卡农 播放世界名曲卡农播放世界名曲卡农 (Matlab play world music canon)

说明：  给定n种物品和一个背包,物品i的重量是Wi,价值是vi,被包容量是C,应该如何选择装入被包的物品,使得装入背包中物品的总价值最大?对于每种物品i,只有两种选择,装入或者不装入. 输入:第一行两个正整数n(物品数)和C(容量) 第二行n个正整数n,表示物品价值 第三行n个正整数n,表示物品重量 输出:第一行表示总价值 第二行n个数(0/1),0表示物品不装入,1表示装入 例如, 输入: 5 10 6 3 5 4 6 2 2 6 5 4 输出 15 1 1 0 0 1 (Species of a given n items and a backpack, the weight of item i is Wi, the value of vi, was packet capacity is C, should be how to choose a package of items to be loaded, the backpack load in the largest total value of goods? For each item i, there are only two options, loaded or not loaded. Input: the first line of the two positive integer n (the number of items) and C (capacity) of the second line of n positive integer n, that the value of the third line of n positive integer n, that the weight of output: the total value of the first line of the second line, said n number of (0/1), 0 that the items do not load, that load 1 for example, enter: 5,106,354,622 6 5 4 output 15 1 1 0 0 1)