mimotools

一个GUI程序，可输入数据和公式进行绘图(a GUI procedures, data entry and mapping formula.)

模拟退火算法求解TSP问题实例，在matlab中的实现。(Simulated annealing algorithm for TSP instances in matlab achieve.)

图像处理MATLAB程序（教学使用）-图像灰度级修正（直方图规定化）(MATLAB image processing program (Teaching)- image gray level correction (histogram specification))

教你怎么从入门到掌握MATLAB的使用。浅显易懂的实例(Teach you how from beginning to master the use of MATLAB. Easy to understand examples)

this journal is created by Sachin Jayaswal Student ID: 20186226 Department of Management Sciences University of Waterloo. it s describe how performances of tabu search and simulated annealing solve the TSP. this journal includes tabu search and SA matlab code to solve tsp.

armax code gives gud results

图像的仿射变换，共包括4个文件，全都是matlab文件，分别为affine.m,grad.m,wrap.m,paremetric.m：，对于图像仿射变换以及图像的超分辨率重构非常有帮助。(image affine transformation, including a total of four documents, and all of Matlab documents, affine.m respectively, grad.m, wrap.m, paremetric.m :, for the affine transformation and the image of the super-resolution image reconstruction have been very helpful.)

对原始图像与gabor小波进行卷积后，得到gabor幅度图，对其进行灰度值分析和二值化后就能得到人眼窗口的定位(The original image after convolution with gabor wavelet get gabor magnitude diagram, its gray value analysis and binarization can get after the positioning of the eye window)

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

chirp signal radar signal processing.doppler filtering imaging