bp339

Wireshark. The following reference answers are based on the trace files

matlab程序，采用滤波器进行信号去噪，FFT变换(matlab program using filter signal denoising, FFT transform)

使用方法，以及一些模型的详细建模方法，方面大家学习交流哈哈(Usage pscad introduction)

particle swarm optimization for loss reduction

用matlab模拟二维海面的程序，第一步求出海面的公式，第二步利用求出的公式画出海面(Matlab simulation of two-dimensional surface using the procedure, the first step to derive the formula for the sea, and the second step to derive the formula to use to draw the sea)

四旋翼无人机典型飞行状态的控制律设计，采用PID控制实现。(The state of the typical four-rotor UAV flight control law design, the use of PID control to achieve.)

TI 下载的矢量控制算法，里面包含各种函数，还有PDF文件。(Download the TI vector control algorithm, which contains a variety of functions, and the PDF file.)

此程序实现的是四幅不同曝光图像的图像融合，它使用分块的方法，比较各个块的熵值，然后，由熵值最大的块组成图像。(To achieve the function of this program is four different exposure image fusion image first four image block is to compare their entropy values, select the entropy of a larger block composite image .)

掌握用MATLAB编写LU分解法与PLU分解法的程序；(The preparation of master LU decomposition method with MATLAB and the PLU decomposition procedure)

说明：  遗传算法车间调度,车间作业调度问题遗传算法 -------------------------------------------------------------------------- 输入参数列表 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)