LS

决策树的matlab 程序代码 非常好用 适合初学者(Matlab code decision tree is very useful for beginners)

This script shows the difference of using zero padding (GI) in the end of OFDM symbol and using cyclic prefix (CP).

hao this file direction

本文提出了一种采用六项余弦偶次幂窗三峰插值的算法来对电网谐波进行检测与分析。该算法通过分析电网信号加窗后傅里叶变换的频域表达式，利用谐波频点附近的三根离散频谱的幅值确定谐波谱线的准确位置，进而得到电网谐波的相关参数频率、幅值及相位的计算公式，最后再对其进行加权修正，从而进一步的提高检测的准确度和有效性。( this paper proposes an approach for power network harmonic detection and analysis based on six even order cosine window and triple-spectrum-line interpolation. Through analyzing the adding window signal fourier transform in the frequency domain expression, using amplitude of three discrete spectrum near the harmonic frequency point to determine the accurate position of the harmonic spectrum and get the calculation formula of related parameters of the power network harmonic such as frequency, amplitude and phase, the algorithm further enhances the accuracy and effectiveness by using weighted correction.)

说明：  基于LDA的人脸识别源代码，可以很方便的实现人脸识别(LDA-based face recognition source code, can easily realize face recognition)

MATLAB通信仿真及应用实例 很不错的 老师竭力推荐(on demand)

程序相当有用，可用于数学建模中。数据是实例，程序浅显易懂。(Program is useful for mathematical modeling. Data instance, the program easy to understand.)

成像处理一般包括三个步骤：1、距离向脉冲压缩，对一个合成孔径内的每个回波脉冲均进行压缩；2、距离徙动矫正，把属于同一点目标的脉冲校正到等距离线上、3、方位向脉冲压缩。(Imaging process generally comprises three steps: a distance to the pulse compression of echo pulses each have an inner aperture compression 2, range migration correction, the pulses belonging to the same point in the correction target line equidistant , 3, azimuth compression to pulse.)

基于Matlab的四象限圆弧插补程序，通俗易懂,功能强大.(Matlab-based four-quadrant circular interpolation procedures, user-friendly, powerful.)

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