New-folder-(3)

已知指定参数值，用matlab编程实现一个滞后补偿器。已满足题目参数要求。(Known to specify parameter values, using matlab programming a lag compensator. Parameter requirements have been met subject.)

介绍用matlab进行有限元计算的国外经典著作，前面重点介绍了有限元的相关内容，后面重点讲解了如何利用matlab的工具箱实现有限元的计算。(This book gives a background treatment of the Galerkin method in Chaps. 2–4. Topics such as developing weak formulations as prelude to solving the finite element equation, interpolation functions, derivation of elemental equations, assembly and sample solutions were treated in these chapters. Chapter 5 gives an overview on the use of the pdetoolbox. Chapter 6 and 7 give different sample problems and their solutions on heat transfer and elasticity in Materials Engineering.)

说明：  顶点覆盖近似算法，本人已经运行过，可以使用(Vertex cover approximation algorithm, I have to run off, you can use)

说明：  MATLAB课件，可以帮助快速学习MATLAB，介绍详细，有举例详解(MATLAB software can help fast learning MATLAB, introduced in detail, and explain, for example)

This particular code very useful to simulate the antenna array design and very effective

surf算法对导入的图像在视频里做匹配，方框标记出来, 清晰易懂(use SURF detector to match object of interest )

This code is for solving differential eqns using cholesky decomposition method, gausselimination method, croutsdecomposition method, LaverrierFaddeev, GAUSSSIEDELGAUSSSIEDEL method

本人原创的用遗传算法实现的vrp问题求解，基于matlab语言(I original genetic algorithm is used to achieve the vrp problem solving, based on the matlab language)

对于高频输出的陀螺数据进行分割处理并合并,实现陀螺漂移零偏计算(For high-frequency output of the gyro data processing is divided and combined to achieve the gyro bias drift calculation)

单列多服务台排队系统 概要设计 首先根据系统初始化输入的数据对系统进行初始化，根据顾客的数量和顾客平均到达时间间隔，产生系统中每名顾客到达时间间隔，将每名顾客到达时刻插入事件表，事件表根据时间采用最小堆进行排序，最早发生的事件放到事件表的顶端。(Summary of single multi-server queuing system design is first initialize the input data according to the system to initialize the system, according to the number of customers and average customer arrival time, a system in the arrival time for each customer, each customer will get time into the event table, event table with the minimum heap according to the time to sort the events into the first event table top.)