002

用MATLAB编写的青花瓷。。。。。。。。。(Matlab matlabsd af)

在数字图像处理中，运用MATLAB中的函数lpc2mat可以实现图像的一维线性预测编码(In digital image processing, the use of the MATLAB functions lpc2mat can achieve the image of the one-dimensional linear predictive coding)

bowen迟滞模型，用simulink搭建，绝对可用，请下载。(bowen model)

Diffraction Patterns 1st program gives the image of Gaussian beam, the 3nd calculate the pattern of the diffraction using FFT.

BER verses SNR in ofdm with amplifier: The BER performances of OFDM systems over the AWGN channel are given by the BER where N=512. We see that SNR required for BER=10-3 No channel coding scheme is adopted. Therefore, BER is a bit higher. The results with 16 QAM show that the required Signal to Noise Ratio (SNR) for BER=10-2 is almost the same. This is because the noise is the dominant.

用于无线通信系统中提高通信质量、减小误码率的有效措施的操作工具(Used in wireless communication systems to improve communication quality, effective measures to reduce the error rate)

一个matlab实现遗传算法的程序，希望能够给大家提供帮助(a genetic algorithm to achieve the procedure, we hope to be able to provide help to)

预失真算法仿真 基于无记忆功放模型。效果显著可以运行(Pre-distortion algorithm simulation model based on non-memory amplifier. Effect is remarkable 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

数字水印的源码，很全。程序中用到的图也在里面。(Digital watermark source, it is full. Procedures which are used in Fig.)