adaboost_face_recognition

一位意大利博士编写的关于online SVR的工具箱，对我启发很大。附加了Powell法优化工具(a matlab toolbox about online SVR and Powell)

国外最新的关于MATLAB编程方面的书籍，很不错的。(good book.)

学习智能天线的matlab源码，对学习多天线及天线理论极为有用(Matlab source code to learn smart antenna, multiple antennas and antenna on the theory of learning is extremely useful)

matlab一个有趣的小实验程序，通过这个程序，我们可以获得不小收获(it is a matlab program,)

vmware 存储drs 在总的存储压力不大，但是单个存储压力较大的情况下，保持整个存储的平衡。(vmware storage drs in total storage pressure is not, but in the case of a single storage greater pressure to maintain a balance throughout the store.)

利用matlab软件对微电网光伏并网过程进行仿真，针对微电网的并网模式进行研究，实现微电网并网和孤岛两种状态的过渡(Matlab software to simulate the micro-grid photovoltaic grid for the microgrid grid mode research, micro power grid and island state transition)

linprog - 线性规划(在MATLAB5.3使用),用于计算线性规划问题，在命令中直接输入linprog.m即可(linprog- linear programming (in MATLAB5.3 use), used to calculate the linear programming problem, the command can be entered directly linprog.m)

MATLAB java web ,这是一个调用MATLAB 算法的好例子，可以用来开发自己的算法(MATLAB java web)

Buck Boost converter simulink model

说明：   有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。 现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。 可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入： 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数，每组有一对数字。 输出： 可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)