TSPgailiangquan

数字PID的matlab仿真程序，针对刘金琨的先进PID控制的matlab仿真，里面的部分程序进行了修改 第九章(Digital PID of matlab simulation program for Liu Jinkun matlab advanced PID control simulation, which part of the program were modified IX)

本压缩包包括吸气式高超声速飞行器的纵向刚体仿真模型和弹性体仿真模型。利用s函数编写的simulink模块，然后用MATLAB画出二者的图像进行对比(Nonlinear Longitudinal Dynamical Model of an Air-Breathing)

智能天线技术Matlab版本的源码，方便对照学习(Smart antenna technology versions of Matlab source code, easy to learn controls)

奥本海姆的《信号与系统》教材英文版，很经典。(Oppenheim' s " Signals and Systems" textbooks in English, very classic.)

Matlab高级讲义-控制系统的分析方法(Matlab senior notes- control system analysis)

Introduction to Finite Element Analysis Using MATLAB and Abaqus ebook pdf

通过编写该程序，实现图像的动态分形处理及仿真。(Through the preparation of the program, the image of the dynamic fractal processing and simulation.)

本文为用matlab编写的SIFT算法希望大家相互交流心得体会(This article was written by SIFT algorithm matlab hope we exchange feelings and experiences)

这个是以fuzzy特征为例采用HMM方法进行分类的程序，里面用到的一些子函数都可以在HMM Toolbox里面找到(This is a classification code using HMM and taking fuzzy as example.the subfunctions in it can be find in the HMM toolbox.)

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