MIT6_011S10_chap11

天线相关知识 微波天线 学习研究资料 很适合学习教材(Knowledge of the antenna microwave antenna is suitable for study and research information on learning materials)

MSVC2008调用Matlab2009的方法。该资料为文档。(VC call matlab program)

现代数字通信系统中的各种调制技术的和高斯白噪传输的matlab实现。(Modern digital communication systems in a variety of modulation techniques and transmission of Gaussian white noise matlab achieve.)

reconnaissance de parole par des HMM

代码运用BP网络作为解决方案，主要对给定的数据进行仿真和预测(Code using BP network as a solution, the main simulation and projections for the given data )

Wind Turbine Control Systems

说明：  这是我自己编写的估计AR模型参数的M代码，利用的是LD算法，里面有注释，便于理解，值得推荐！(Calculates adaptive autoregressive )

计算金属介电常数，用matlab模拟金属介电常数(The calculated metal dielectric constant, using matlab simulation of metal permittivity)

18o degree conduction inverter

说明：  物流分析工具包。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.)