4

The purpose of the present work is to investigate inference and statistical prediction when the data and (or) the unknown parameter have large or infinite dimension.

说明：  这是我自己编写的一个完整的多进制GF域上RS信道编解码系统。解码采用梅西迭代算法。整个算法模块功能分明，GF域上运算都单独成为子模块，移植性强。还附有测试程序，方便了解各个模块的功能完成情况。(This is my own preparation of a comprehensive multi-band GF RS domain channel codec system. Messi iterative decoding algorithm used. The whole algorithm module function clear, GF domain computing is to become a separate sub-module, transplants strong. Also included testing procedures to facilitate the understanding of various modules of the completion of the function.)

建立风力发电机模型，此仿真模型采用pmsg电机应用，再根据PI控制器方法构造控制器，达到能控制发电机的转速、转角等等等(Build wind generator model, the simulation model using pmsg motor applications, according to PI controller method to construct the controller, to control the generator speed, angle, etc., before running this simulink model, it should also write the reference value code to run.)

拉普拉斯特征映射,最大差异展开，时频域特征(Laplacian Eigenmap Maximum difference expansion Fast Maximum difference expansion ISOMAP)

详细介绍了3G方案中WCDMA的无线资源管理并给出了仿真方法，在Matlab软件下进行了模拟(Details of the 3G program WCDMA radio resource management and simulation methods in Matlab software, a simulation carried out under)

This is a matlab code which deals with TSP problem. This is done using ant colony algorithm. In this problem each city gets visited once and a shortest path is obtained.

通过matlab的simulink中的s函数，对卫星的轨道六根数进行控制，实现卫星编队的队形保持。(By the simulink in matlab s function to track the number of six satellites is controlled to achieve the formation holding satellite formation.)

说明：  MATLAB SIMULINK仿真程序，基于BOOST电路的扰动观察法实现(MATLAB SIMULINK.Realization of disturbance observation method based on boost circuit)

使用正交滤波器设计最大频率选择小波，非常实用(The use of orthogonal wavelet filter design maximum frequency selection, very useful)

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