jiuyeng_v76

由matlab平台实现,是一种提取共振峰信息的有效方法.(from Matlab platform is a resonance peak extraction of information in an effective manner.)

alternator project - synchronus machine project

利用matlab生成word和excel文件的源码已经实例数据。源自谢中华老师的教材。(Using matlab to generate word and excel file data source is instantiated. Xie Zhonghua teachers from teaching.)

先进PID控制MATLAB仿真(第3版), 作者: 刘金琨,2、3部分源码(Advanced PID control MATLAB simulation (3rd edition), Author: Jinkun, 2,3 some source)

流行学习方法局部保持投影（LPP）算法MATLAB代码(Popular learning methods locality preserving projections (LPP) algorithm MATLAB code)

MATLAB克里金(Kriging)插值法又称空间自协方差最佳插值法，它是以南非矿业工程师D．G．Krige的名字命名的一种最优内插法。克里金法广泛地应用于地下水模拟、土壤制图等领域，是一种很有用的地质统计格网化方法。( MATLAB kriging (Kriging) interpolation method, also known as spatial autocorrelation covariance optimal interpolation method, which is based on the South African mining engineer D. G. Krige named for an optimal interpolation. Kriging widely used in groundwater modeling, soil mapping, is geostatistical gridding method useful.)

说明：  MATLAB实现股票价格预测 源程序代码(MATLAB source code to achieve stock price prediction)

说明：  MATLAB7最新GUI图形图像编程的说明(MATLAB7 latest GUI graphics programming note)

invetre 3phase by jahed

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