queuing

说明：  《变结构控制与MATLAB仿真》书中第二章例四的变结构控制程序( Variable Structure Control and MATLAB Simulation chapter book, four cases of variable structure control procedures)

Mechanical damage and fracture of concrete structures, Mazars. The paper deals with microcracking in concrete under mechanical sollicitations

说明：  实现合成孔径成像的三种算法，包括RD（距离多普勒）、RMA（距离徙动）、CS（Chirp Scaling）(Three algorithms for SAR imaging, including RD (Range Doppler), RMA (Range Migration) and CS (Chirp Scaling))

multi scale structural similarity index

程序提出了一种基于人群混合算法，是粒子群优化和引力搜索算法的组合。主要目标提高整合PSO和GSA算法的能力(Hybrid Particle Swarm Optimization and Gravitational Search Algorithm (PSOGSA) A new hybrid population-based algorithm (PSOGSA) is proposed with the combination of Particle Swarm Optimization (PSO) and Gravitational Search Algorithm (GSA). The main idea is to integrate the ability of exploitation in PSO with the ability of exploration in GSA to synthesize both algorithms’ strength. Some benchmark test functions are used to compare the hybrid algorithm with both the standard PSO and GSA algorithms in evolving best solution.)

这是最基本的人工势场法，同时也做了很多注释，初始的是比较完美的数值仿真。但是，如果将注释中的语句与程序中的互换，就可以看到传统人工势场的缺陷。( This is the basic artificial potential field, but also do a lot of notes, the initial value is more perfect simulation. However, if you comment statements and program exchange, we can see the shortcomings of traditional artificial potential field.)

this code about fuzzy controller

压缩感知算法,提出了一种新型的信道估计算法(compressed sensing although，A novel channel estimation algorithm is proposed)

雷达仿真，计算并绘制某特定频率步进信号的合成HRR轮廓。(Radar simulation, computing and drawing a particular step frequency signal synthesis HRR profile.)

蕞优分组周游路线问题是一类物流智能调度问题，是众多的计算难度极大的组合爆炸问题之一。自从运输问题最早是由Hitchcock在1941年提出的[2][4]后，人们对这一类问题给予了极大的关注并进行了大量的研究，提出了有效解决问题的优化算法——单纯形法的变形[2]。但由于问题规模的扩大，纯数学方法在允许的时间和空间上都很难找到问题的最优解，于是人们开始转向寻找问题的近似最优解，遗传算法以其在求解最优化问题中的独特的自组织性、自适应性很快进入人们的视野。 经典的遗传算法对于求解多目标的NP完全性问题非常有效，但对于有多个限制条件的多目标最优化问题缺显得有点力不从心，很难得到稳定度较高、收敛较快的解。本文提出的双层遗传算法模型给这一类问题提供了一个很好的解决方法，虽然建模条件限制了描述的问题的通用性，有待推广，但它能有效利用问题的领域知识，提高了求解效率，保证了解的可行性和最优性，算法思想极具推广潜力，可在其它物流智能调度问题求解算法设计中借鉴。(The most optimal packet travel route problem is a kind of intelligent logistic scheduling problem is one of combinatorial calculation difficult problem many. Since the transportation problem was first proposed by Hitchcock in 1941 after the [2][4], the people of this class of problems given great attention and made a lot of research, the deformation of [2] optimization, simplex method algorithm is effective to solve the problem of. But due to the expansion of the scale of the problem, the pure mathematical methods in the allowed time and space are very difficult to find the optimal solution of the problem, so people begin to turn to the approximate optimal solution for the problem, genetic algorithm in solving optimization problems with its unique in the self-organizing, adaptive soon entered people s field of vision. Very effective classical genetic algorithm for solving multi-objective NP complete problems, but for the multi-objective optimization problem with multiple constraints. I)