LQR

很好很实用的matlab工程函数：插值与拟合，代数方程解法，微分方程解法，优化以及综合实验(Matlab works well very useful functions: interpolation and fitting, solution of algebraic equations, differential equation, optimization, and comprehensive experimental)

matlab中矢量控制模型，其中32变换可以用S函数来实现(matlab in vector control model, of which 32 can transform S function to realize)

This is a comprehensive guide to engineering students for using matlab

雷达匹配数字滤波器的matlab simulink实现，通信专业本科毕业论文用的到的。(Matched radar matlab simulink realization of digital filters, communication undergraduate thesis used to.)

说明：  针对Z变换法无法求取相邻采样点之间的输出响应的局限，利用MATLAB程 序语言，对单位负反馈系统的改进z变换法进行了程序设计。通过simulink仿真的实验，证 明该程序运算快速、准确，使用方便。(For the Z transform method can not strike between adjacent sampling points in response to the limitations of the output, using MATLAB programming language, a negative feedback system of units of the z transform method to improve the program design. Through simulink simulation experiments show that the procedures for computing fast, accurate and easy to use.)

三阶统计量估计,用于信号统计分析.谢谢大家(Third-order statistics estimated for the signal statistical analysis. Thank you, everyone)

复杂网络中有一些常见的基本模型，如随机图，WS小世界网络，NW小世界网络及BA无标度网络等，本程序从这些网络的产生机理，生成了这些复杂网络模型，并且分析了其基本性质如平均路径长度，聚类系数及度分布等。(Complex networks have some common basic model, such as random graph, WS small-world networks, NW small-world networks and scale-free BA network, the program generated from the mechanism of these networks to generate the complex network model and analysis its basic nature, such as the average path length, clustering coefficient and degree distribution.)

Fin the FFT, this program find the fast fourier transform, this is of many applications for the processing signal

说明：  一段图像处理的高斯高通滤波器的matlab源代码，思路清晰，可以直接运行。(A Gaussian image processing of high-pass filter matlab source code, clear, can run.)

We consider the scheduling of simple linear deteriorating jobs on parallel machines a new perspective based on game theory. In scheduling, jobs are often controlled by independent and selfish agents, in which each agent tries to a machine for processing that optimizes its own payoff while ignoring the others. We formalize this situation as a game in which the players are job owners, the strategies are machines, and a player’s utility is inversely proportional to the total completion time of the machine selected by the agent. The price of anarchy is the ratio between the worst-case equilibrium makespan and the optimal makespan. In this paper, we design a game theoretic approximation algorithm Aand prove that it converges to a pure-strategy Nash equilibrium in a linear number of rounds. We also derive the upper bound on the price of anarchy of Aand further show that the ratio obtained by Ais tight. Finally, we analyze the time complexity of the proposed algorithm