BPNN

蕞优分组周游路线问题是一类物流智能调度问题，是众多的计算难度极大的组合爆炸问题之一。自从运输问题最早是由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)

基于PR控制器的三相PMSM矢量控制仿真模型(Simulation Model of Three-Phase PMSM Vector Control based on PR Controller)

Implements the traditional benchmark formulation used in optimization literature

matlab11节点不同渗透率下24小时全天潮流计算(matlab11 node 24 hours a day under different permeability flow calculation)

Bit error of OOK modulation for UWB

采用小波变换稀疏方法和正交匹配跟踪算法处理图像(Sparse wavelet method and orthogonal matching tracking algorithm)

用七元线形天线阵ULA，实现传统波束形成法、Bartlett波束形成法、Capon波束形成法(failed to translate)

Chapter 4. Interpolation and Polynomial Approximation Algorithm 4.1 Evaluation of a Taylor Series Algorithm 4.2 Polynomial Calculus Algorithm 4.3 Lagrange Approximation Algorithm 4.4 Nested Multiplication with Multiple Centers Algorithm 4.5 Newton Interpolation Polynomial Algorithm 4.6 Chebyshev Approximation

Otsu-最大类间方差Matlab代码 最大类间方差法原理：最大类间方差法是由日本学者大津于1979年提出的,是一种自适应的阈值确定的方法,又叫大津法,简称OTSU。它是按图像的灰度特性,将图像分成背景和目标2 部分。背景和目标之间的类间方差 ％ 大,说明构成图像的2 部分的差别越大,当部分目标错分为背景或部分背景错分为目标都会导致2 部 ％ 分差别变小。(Otsu- Otsu Matlab code Otsu Principle : Otsu law by Japanese scholars in the large-1979's, is an adaptive threshold established methodology, also known as big-law, referred to Otsu. It is based on image characteristics of the gray image can be divided into the background and objectives of Part 2. Background and objectives between the between-class variance%, which meant that the two images form part of the greater difference, When some background into the wrong target or part of the background into the wrong target will lead to sub-2% difference becomes smaller.)

无线通信系统中在rayleigh衰落信道下的matlab仿真源程序(wireless communication system in rayleigh fading channel simulation source of Matlab)