435

用遗传算法求解数学模型中参数的应用实例，亲自编写(genetic algorithm mathematical model parameters of application examples, personally prepared)

Geddes,肤色分割，数字滤波器，Otsu-最大类间方差，非线性映射所产生的混沌序列(Geddes, color segmentation, digital filter, Otsu- Otsu, nonlinear mappings from the chaotic sequence)

使用谢菲尔德大学的工具箱遗传算法求解TSP问题(University of Sheffield toolbox using Genetic Algorithm for TSP)

mo phong matlab quy dao robto mon hoc robo cong nghiep

可见光通信MIMO和OFDM系统仿真，代码里有注释。(MIMO and FODM visible light communication count counting system simulation)

电力拖动，课程设计的全部资料，包含simulink的仿真的全部资料，和具体参数设置。(Electrical towage, curriculum design of all data, include all the information of simulink simulation, and the specific parameters Settings.)

ekf 何友的数据融合的关于ekf的例子的代码，自己写的，不够优化，有需要子函数的联系我(the code of ekf)

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )

通过使用平面波发计算光子晶体能带图，这个图是我自己弄的，非常辛苦。但是希望能给从事光学研究的朋友的带来帮助。(Calculating the bandgap of a photonic crystal by using a plane wave gives me a very hard picture of myself. But I hope to help those who engage in optical research.)

matlab解用分支定界法解整数规划的程序。请大家参考(matlab solution using branch and bound method for solving integer programming procedures. Please refer to)