lightningcentralcontrol

matlab程序,完成hufffman编解码的功能 (matlab program to complete the hufffman codec function)

带有MPPT功能的光伏阵列Matlab通用仿真模型.kdh(MPPT in PV arrays with Matlab Simulation Model. Kdh)

说明：  一个数如果恰好等于它的因子之和，这个数就称为“完数”。例如6=1＋2＋3.编程 　　　 找出1000以内的所有完数。 (If a number is just equal to the sum of its factors, this number is called &quot End of a few.&quot For example 6 = 1+2+3. Programmatically find all finished within a number of 1000.)

读取matlab的mat文件(read the document mat)

说明：  一些有关最优控制理论的控制实例程序集和仿真 (Control instance assembly of the optimal control theory and simulation)

本书详细介绍了平时编程过程中可能范的各种错误，介绍了高质量C编程的各种知识以及各种技巧。(This book details the normal process of programming a variety of errors that might Fan introduced a variety of high-quality C programming knowledge and a variety of skills.)

matlab processing and realization of the voice, very useful

一张图片是之前用摄像机采集的，另一张图片是经过离散沃尔什变换再量化编码压缩后又解压所得，能看出区别吗？呵呵。flik.m是原图，newflik.m是新图。 附上所有MATLAB源程序，有兴趣的话，你也可以用这几个程序对自己的照片“加工”一番。以下6个程序分别保存为6的m文件，文件名与下面给出的一致。待“加工”图片应该存放在Matlab的Work目录下。(Before a picture is collected by the camera, another picture is the result of discrete Walsh transform and then re-quantization coding compression decompression income, you can see the difference? Ha ha. flik.m is the image, newflik.m is a new map. MATLAB source code attached to all interested, you can also use these procedures on their own photo processing of something. The following six procedures were saved as 6 m file, the file name is given with the following consensus. To be processing picture should be stored in Matlab s Work directory.)

FDTD时域差分 边界MUR MATLAB编程(Difference time domain FDTD boundary MUR MATLAB Programming)

说明：  给定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)