BDsignal

msk Differential modulation and demodulation. Delete the differential encoding, it would be msk direct modulation and demodulation. I hope it would be uesful for you.

伽玛变化方面的程序，我找了很久迎合了影像处理理论与实际这本书中的实例希望对大家有所帮助。(Gamma-change procedure, I find for a long time to meet the image processing theory and practical examples of this book to all of us want to be helpful.)

说明：  读取sgy格式数据，并利用wigb进行成图(Read sgy format data, and use wigb to map)

只要给个输入就可以直接运行的，在次算法上可以拓展为srAPA，VSapa等方法，值得研究(Just give input can directly run in the second algorithm can be expanded to srAPA, VSapa and so on, is worth studying)

说明：  MATLAB确定几何边界区域函数，用来计算偏微分方程的部分计算源代码(MATLAB sure geometry region function is used to calculate the boundary, partial differential equations of the calculation source code )

最小二乘支持向量回归模型 直接输入训练集和测试样本即可(Least squares support vector regression model direct input training set and test samples )

this code is to perform frequency shift keying modulation technique

Markov随机场的例子程序,对于初学MRF的人很有用,能得到直观的印象(Markov random sample program, for the beginner who MRF useful to get an intuitive impression)

关于异步电机的矢量控制建模仿真（附有相关的文章）(Simulation for Asynchronous Motor Vector Control)

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