Digital8BitLibrary

GPS学习最全的matlab程序，望大家学习交流(GPS to study the most complete matlab program, hope you learn from the exchange of)

it is a project based on invpwm in voltage regulator

Numerical Methods in Engineering with Matlab by Jaan Kiusalaas

hooke code hooke code hooke code hooke code hooke code

利用matlab的gui设计的带有输入和输出功能的界面图形，实现等距线可视性很强，自己独立编写的数据和图形，学习非常值得,实现pca压缩图像，matlab语言(The interface graphics with input and output function designed by GUI of Matlab can realize the visibility of isometric line. The data and graphics compiled independently by oneself are worth learning. The realization of PCA compressed image and MATLAB language is very worthwhile.)

关于大气MTF的资料，有助于理解大气MTF的作用，估计计算大气MTF的值。(The information on atmospheric MTF, help to understand the role of atmospheric MTF, estimate calculated atmospheric MTF value)

说明：  滤波的一个经典程序，是编写其他程序的基础，作为模板使用，可以学习(A classic filtering procedure is the basis for the preparation of other programs, as a template, you can learn)

用龙格库塔法求得微分方程的数值解；用龙格库塔法求得微分方程的数值解(Obtained by using Runge-Kutta numerical solution of differential equations obtained by using Runge-Kutta numerical solution of differential equations)

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

DMP基于动态运动基元的轨迹学习与规划，可以手动绘制轨迹，也可以载入原始数据(DMP trajectory learning and planning based on dynamic motion primitives)