teager

给予MATLAB的法制函数方法，包含Powell的子程序(MATLAB function to give way to the rule of law, including Powell' s subroutine)

High accuracy optical flow using a theory for warping(The files optical_flow_brox.m and optical_flow_sand.m are the files you need to run. optical_flow_brox.m implements the traditional algorithm. Just replace the first lines where images are read, with your image, and start the process. optical_flow_sand.m implements a variant presented in CVPR 2006. Again just replace the lines "img1 = imread( ... )" and "img2 = imread( ... )" with your images and the rest is automatic. The variable num_levels controls the number of images in the laplacian pyramid to be constructed. Change it to suit your convenience.)

a method to calcualte the deformation parameter for the digital image correleation mehod

matlab中同步电机在abc轴系下的建模，自己用S函数编的，很好用的哦，适用于初学(synchronous motor in matlab modeling in abc shaft under its own series of S functions, good used, applies to the beginner)

二维声学BEM程序，matlab语言，对初研究者十分有用(Two dimensional acoustic BEM program, MATLAB language)

OPTIMUM VALUES FOR SIMULATED ANNEALING TRIALS

阿鲁发行可理解和空间哈空间和康皇客家健康双方的空间上看到合肥看见谁的罚款速度快解放看见爱上的合法看见(Aru understandable and spatial distribution of space and Kang Huang Ha Hakka healthy to see both sides of the room to see who is a fine of Hefei, quick to see the liberation of the legitimate love to see)

pattern recognition part two toolbox for matlab

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

这是关于数字预失真的仿真程序，应用LMS急降方法实现系数更新，对失真有很好的效果(This is the digital predistortion simulation program, the drop of the LMS coefficient update method implementation, have a good effect on the distortion)