ipfbnxkh

详细的文档说明及完整的预测控制程序，一定会对你的学习大有帮助。(Detailed documentation and complete predictive control procedures will surely be helpful to your learning.)

说明：  胡氏不变矩，matlab程序，稳定运行，能区分两张图片的不同(Hu invariant moments, matlab program, stable operation, can distinguish between two different images)

matlab的TCM编译码器的设计与实现，以及误码性能分析(PCM codec design matlab)

李智仁的机器学习讲义，2006年暑期版本，详细讲解了机器学习相关内容(Li Zhiren machine learning lectures, summer 2006 version, explained in detail the contents of machine learning related)

用lin法求高阶方程，可解特征方程, 可以是两队复根，可以是一对复根和两个实根，也可以是四个实根。(lin method, solve latent function)

说明：  有利于初学者MATLAB编程学习有利于初学者MATLAB编程学习有利于初学者MATLAB编程学习(it will help you to study MATLAB PROGRAM it will help you to study MATLAB PROGRAM it will help you to study MATLAB PROGRAM)

文件很好，是一份简单又易懂的课件，有需要ide看看(The file is good, is a simple and easy to understand courseware, ide take a look at)

matlab的一些其他演示，有助于大家学习matlab的简单语法，欢迎下载(Matlab demo of some of the other help you learn a simple syntax Matlab welcome to download)

Plots the irradiation diagram of a 4 TONPILZ-like elements array

遗传算法tsp问题 针对题目中物流配送路径优化问题，本文引入0-1规划思想，建立了带约束条件的物流配送问题的数学模型。求解时，引入遗传算法的编码方式，并针对分区数与客户数量相差较小的情况，灵活运用分区配送算法确定包含最优解的分区序列组，紧密结合枚举法使得其算法兼顾简单、快速的优点。应用Matlab软件可执行得到最短路径。兼顾时间因素导致的复杂影响，我们引入了惩罚函数，并通过设定惩罚系数，进一步由最短路径求得最优路径。(Genetic algorithm tsp problem of logistics distribution routing optimization problem subject, this paper introduces 0-1 programming ideas, a mathematical model with the constraints of logistics and distribution problems. Solving, introducing genetic algorithm encoding, and the number of partitions and the number of customers for a small difference, the flexible use of the partition containing the partition algorithm to determine the distribution of the optimal solution sequence group, closely enumeration method allows both the algorithm is simple, fast advantages. Matlab software application executable to get the shortest path. Complex factors affecting both the time, we introduce a penalty function, and by setting the penalty coefficient, and further obtain the optimal path from the shortest path.)