MIMOOFDM-cazac

说明：  这是一个信赖域方法的程序，简单实用，对初学者非常有用(This is a trust region method procedures, simple, practical, very useful for beginners. )

Script de Histogramas para Imagenes

说明：  大型的光伏电站逆变器，用于相关控制的理论研究与仿真，逻辑性强，详细，很有参考价值(Large-scale photovoltaic power plant inverter for the relevant control theory and simulation, logical, detail, great reference value)

高频多续的进行信号处理，得到高频的谱分析，建立hose工具箱(Estimates ARMA parameters via the q-slice algorithm.)

说明：  comsol 案例，值得拥有，微纳光力案例(Comsol case, worth having)

子图像与母图像的匹配（子图像是母图像的一部分），用于判断子图是否在母图中(Sub-image and the master image matching (sub-image is the image part of the mother), used to determine whether the parent graph graph)

％电影动画： ％1.首先调用moviein函数对内存初始化.创建一个足够大的矩阵来容纳一系列指定的图形（帧） ％2.调用getframe函数生成每一帧.该函数返回一个矢量，利用这个矢量创建一个电影动画矩阵 ％3.调用movie函数按照指定速度进行指定次数的播放 ％例子2：演示如何实现快速傅立叶变换（exp(j*2*pi/n)）的可视化过程( Movie animation: 1. First transfers the moviein function to the memory initialization Founds graph which an enough big matrix holds a series of assigns (frame) % 2. Transfers the getframe function to produce each This function returns to a vector, uses this vector to found a movie animation matrix % 3. Transfers the movie function according to assign the speed to carry on assigns the number of times the broadcast Example 2: How demonstrates realizes fast Fourier transforms (exp (j*2*pi/n)) the visible process )

是一分学习MATLAB 很好的教程，可以从中学到很多东西，简单易懂(A good learning MATLAB tutorial, you can learn a lot from, and easy to understand)

流水线型车间作业调度问题可以描述如下：n个任务在流水线上进行m个阶段的加工，每一阶段至少有一台机器且至少有一个阶段存在多台机器，并且同一阶段上各机器的处理性能相同，在每一阶段各任务均要完成一道工序，各任务的每道工序可以在相应阶段上的任意一台机器上加工，已知任务各道工序的处理时间，要求确定所有任务的排序以及每一阶段上机器的分配情况，使得调度指标(一般求Makespan)最小。下面的源码是求解流水线型车间作业调度问题的遗传算法通用MATLAB源码，属于GreenSim团队原创作品，博客上发布的是不完全的源码，本人将其补充完成已成功运行，转载请注明GreenSim团队原创作品。(Pipelined job-shop scheduling problem can be described as follows: n tasks on the assembly line m processing stages, each stage has at least one machine and at least one stage there are multiple machines, and the same processing performance of each machine on the same stage , at every stage to complete each task are a process, each process of each task can be processed on any machine on the corresponding stage of the processing time of each process known tasks, all tasks required to determine the sort and every Distribution of the machine on a stage, making scheduling index (typically seek Makespan) Min. The following code is a Genetic Algorithm for Job Shop Scheduling Problem pipelined general MATLAB source code, original works belong GreenSim team, the blog post is incomplete source code, I will supplement has been successfully completed its operation, please indicate the original team GreenSim works.)

calssification algorithmqq