kalman

说明：  利用软件工具MATLAB在模式识别中的一个应用，即实现分类器的编程(Using pattern recognition software tool MATLAB in an application, ie, the programming to achieve classification)

code to test the mimo system for the ML and MZ

傅立叶相位加密，用于图像加密，效果好，需要密钥图像，也在压缩包里。适用于灰度图象。(Fourier phase encryption for image encryption, which is good, need to key images, but also compressed bundle. Apply to the gray-scale image.)

计算modified hausdorff距离 matlab函数(modified hausdorff distance (matlab function))

牛顿迭代法 matlab代码 非常好用而经典的算法(Newton iterative method matlab code Very easy to use classic algorithms)

vc 与 matlab之间的接口程序，方便工程计算，也为程序之间做了优化(vc and the interface between matlab program to facilitate the engineering calculations, but also between programs is optimized for the)

《Risk and Asset Allocation》源码(code of the book"Risk and Asset Allocation")

这是一个用Matlab编写的用于WSN中质心算法计算节点位置的源程序(this resource is used to calculate the locationof the nodes in WSN)

conventional simulink statcom

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