Nnetmod

应用matlab实现的高等数理统计最小二乘估计源码(Matlab implementation of higher application of mathematical statistics source least squares estimation)

利用牛顿法估计广义线性模型参数，涵盖logistic模型和possion模型。matlab代码(Matlab code for estimating the parameters of the generalized linear regression models, including logistic and poission)

A guide to using MATLAB for beginners and experienced users

利用星历参数，计算卫星位置和卫星运行速度等一般参数。为学习matlab提供素材(Ephemeris parameters used to calculate satellite position and satellite speed and other general parameters. Provide material for learning matlab)

本程序是用于信号相关分析的实验程序， 主要功能是计算和比较几种信号的相关函数。(Auto Correlation matlab program)

frost模型进行空时波束合成，增加了阵列的自由度，既可以处理宽带信号也可以进行窄带信号。(When frost empty beam synthesis model, the degree of freedom of the array, can handle both narrow-band signal may be a broadband signal.)

基本粒子群优化算法Matlab源程序 Sphere Model(Particle swarm optimization Matlab source Sphere Model)

ofdm 关于系统仿真的源程序代码 matlab(Ofdm matlab source system simulation program)

本文采用matlab语言编写了数字基带传输系统的模拟实现，并分析了多径传播和加网孔时的输出情况。(this paper Matlab language of the digital base-band transmission system simulation. Analysis and dissemination of multi-path processing mesh of the output.)

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