UWB_monocycle1

ALTECH robot 设计电路的第一部分，提前分享设计成果(ALTECH robot circuit design the first part of the design in advance to share the results of)

说明：  遗传算法车间调度,车间作业调度问题遗传算法 -------------------------------------------------------------------------- 输入参数列表 M 遗传进化迭代次数 N 种群规模(取偶数) Pm 变异概率 T m×n的矩阵，存储m个工件n个工序的加工时间 P 1×n的向量，n个工序中，每一个工序所具有的机床数目 输出参数列表 Zp 最优的Makespan值 Y1p 最优方案中，各工件各工序的开始时刻，可根据它绘出甘特图 Y2p 最优方案中，各工件各工序的结束时刻，可根据它绘出甘特图 Y3p 最优方案中，各工件各工序使用的机器编号 Xp 最优决策变量的值，决策变量是一个实数编码的m×n矩阵 LC1 收敛曲线1，各代最优个体适应值的记录 LC2 收敛曲线2，各代群体平均适应值的记录 最后，程序还将绘出三副图片：两条收敛曲线图和甘特图（各工件的调度时序图）(Genetic algorithm scheduling, job shop scheduling problems with genetic algorithms -------------------------------------------------------------------------- genetic evolution of the input parameter list, the number of iterations M N population size (taken even) Pm mutation probability T m × n matrix, stored m one piece n a process of processing time 1 × n vector, n a process in which each machine processes the number of Zp with the best value Y1p Optimal Makespan programs, the start time of each process the workpiece can be drawn based on its optimal solution Gantt Y2p, each time the workpiece end of the process, according to its draw Gantt Y3p optimal solution, each piece of the processes using machine code Xp optimal decision variable, decision variable is a real m × n matrix encoded LC1 convergence curve 1, the generation of the best individual record of LC2 fitness convergence curve 2, the average fitness value on behalf of groups record Finally, the program will draw three pict)

说明：  ISLO与CoSaMP算法在稀疏多径信道估计中的比较的一篇最新论文。前者明显优于后者。(ISLO and CoSaMP latest paper compares an algorithm in sparse multipath channel estimation. The former is much better than the latter.)

simulink仿真，串联电容器在电力系统中的无功补偿(simulink simulation series capacitor reactive power compensation in power system)

通过matlab平台实现两幅图像之间的配准；(Matlab platform through the registration between two images )

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

Spring Mass Damper Simulink model

智能天线自适应LMS算法matlab仿真(LMS algorithm matlab simulation of smart antenna)

............Initial.m ............MutationOperation.asv ............MutationOperation.m ............SelectOperation.asv ............SelectOperation.m ............SelectRand.asv ............SelectRand.m DE Algorithm

OFDM通信系统仿真模型 包括编码，调制，IFFT，上下变频，高斯信道建模，FFT，PAPR抑制，各种同步，解调和解码模块 最后验证了系统设计的可靠性 是通信理论OFDM技术仿真实例(OFDM communication system simulation models, including coding, modulation, IFFT, and down conversion, Gaussian channel model, FFT, PAPR suppression, various synchronization, demodulation and decoding module final validation of the reliability of the system design is communication theory simulation OFDM technology)