singlehex2num

本科毕业论文，基于非高斯性最大化的盲信号分离方法，适合本科生做毕业设计。(Undergraduate thesis, based on maximization of non-Gaussian signal separation method, suitable for undergraduate students to do graduate design.)

Dissolve Gas Analysis

This is a comparison of lms and rls algos in digital equaliser

Using the Serial Port with a MATLAB

matlab模拟退火工具包,能用此工具箱解决优化方面的问题(matlab simulated annealing Kit, you can use this kit to solve optimal problem)

一个MATLAB 图形处理软件，是标准的.m 程序，可以批量的对图片进行截图处理，读取截图范围内的强度积分值，并按照图片变 化绘制强度变化曲线。(A MATLAB graphics processing software, is standard .m program, you can batch processing of image shots, read intensity integral value within the range of screenshots and image intensity curve drawn to change.)

sobel edge detector matlab code with comments

在这种程序列表中的主要文件是“vblast.m”。键入“help VBLAST系统”关于details.Study命令行编码 透过该计划加强。这些方案的合理需要大约5000包已被绘制accuracy.This 实施了一个2x2的系统。读者可以方案的其他变化。 该方案已经过测试基于MATLAB版本6.0及以上的信号处理工具箱和通信工具箱选项。(The main file in this list of programs is "vblast.m". Type "help vblast" on the command line for details.Study the coding by stepping through the program. These programs require around 5000 packets for reasonable plotting accuracy.This has been implemented for a 2x2 system. The reader can program other variations. The program has been tested on MATLAB version 6.0 and above with signal processing toolbox and communication toolbox options.)

说明：  用MATLAB去写的关于元胞自动机的程度，比较容易上手，也比较简单易学。(Using MATLAB to write about the extent of cellular automata, and relatively easy to use, but also relatively easy to learn.)

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