matlab_qpsk0

说明：  常用的数值积分方法(特别是梯形、Simpson方法、和Romberg算法)，编制复合梯形公式，复合Simpson公式，Romberg算法的程序，数值积分方法的逐步精致化过程(Commonly used numerical integration methods (in particular, trapezoidal, Simpson method, and the Romberg algorithm), the preparation of composite trapezoidal rule, composite Simpson formula, Romberg algorithm procedure, numerical integration process of gradual refinement)

this code shows the stbc model fluctuation.................................................

用于对一组具有相似数据 的聚类，并且可视化。(SOM)

这是一种广义预测控制的一个matlab程序，希望对学习模型预测控制的有所帮助(This is a generalized predictive control matlab program, helpful learning model predictive control)

用MATLAB语言编写的程序，称为M文件。M文件可以根据调用方式的不同分为两类：命令文件(Script File)和函数文件(Function File)。 (Using MATLAB language program, known as the M file. M files can be grouped into two categories: call command file (Script File) and function (Function File) file. )

基于matlab的PIV算法，简单易懂，专为初学者编写。(A Simple and easy to understand PIV algorithm, designed for beginners.)

Matlab程序设计经典入门教程Matlab Programming Tutorial Classic(Matlab Programming Tutorial classic Matlab Programming Tutorial Classic)

循环流化床锅炉燃烧过程线性自抗扰控制 对初学者很有帮助(CFBB combustion of LADRC)

说明：   有一个长度为整数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.)

标准的MOPSO文件，遗憾是无约束条件，，，，(Standard MOPSO files, unfortunately unconstrained conditions)