cum4_ESPRIT

二级倒立摆的非线性部分采用S函数实现，此为S函数实现的源代码(The nonlinear part of the double inverted pendulum using S functions to achieve, this is the S function, the source code)

CDMA技术培训资料，希望对学习CDMA的同学有帮助！(CDMA technical training material)

这个程序实现了一个mini的MAC系统，唯一的缺点是并没有考虑到功率限制的问题。(This program realise a system of minipac,the only shortcoming is that the lack consideration of power constraint.)

Robust Control Design with MATLAB® 2nd 源码(Robust Control Design with MATLAB 2nd matlab Source)

matlab编程时常见错误,如果越到问题，可以很好地帮助你解决出现的问题。(This book tell you how to deal with mistakes about the matlab programming)

该程序主要完成了EMD算法的实现，并附有例子程序进行测试，有助于初学者了解该算法(The program is mainly done to realize EMD algorithm, together with examples of procedures for testing, to help beginners understand the algorithm)

Guide to use and solve Ordinary Differential equations using ode45 in MATLAB

multiobjective optimization

计算矩形微带天线输入阻抗matlab源代码(Matlab code for computation of input impedance of microstrip antenna)

说明：  物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Shortest path, min cost network flow, minimum spanning tree problems Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP Material handling: Equipment selection General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes (logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U.)