direct-linear-convolution

MATLAB5.X程序设计语言.pdf喜欢matlab的可以看一下(MATLAB5.X programming language. Pdf like matlab can look at)

在雷达成像中所用到的多普勒质心估计，用idl语言编写(In radar imaging is used in the Doppler centroid is estimated using idl languages)

BOC调制信号的简介。包括一般BOC信号和AltBOC信号。(About BOC modulation signal. Including general BOC signal and AltBOC signals.)

详细的介绍了有限元在结构分析中的应用理论以及编程。。(A detailed description of the theory of finite element structural analysis and programming..)

these files deals with the cognitive radio>>>types of detection and spectrum sensing

本程序是自己写的，经过验证的，瑞利衰落信道下的BPSK信号仿真(This program is written in their own, after verification, simulation of BPSK signals in Rayleigh fading channels)

2D Multi-Parameter Pie Control

说明：  For partial shading of PV system.

本书研究了统计理论的三个领域，检测理论，估计理论和解调理论。(In books, we shall study three areas of statistical theory, which we have labeled detection theory, estimation theory, and modulation theory. The goal is to develop these theories in a common mathematical framework and to demonstrate how they can be used to solve a wealth of practical problems in many diverse physical situations. )

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