chazhifa

移动衰落信道，该书是英文版，非常好的一本书，还有matlab源代码。(Mobile fading channel, the book is the English version, a very good book, there are matlab source code.)

backstepping方法设计例子，对于初学者为不错的样例，我本人就是通过这些练习起来的。很有效(The backstepping method design examples for beginners is a good sample, I was up by these exercises. Very effective)

通用的牛顿拉夫逊法潮流计算程序，可以自行输入支路参数矩阵，节点参数矩阵。(Universal Newton Raphson power flow )

书名：[MATLAB语言常用算法程序集].(龚纯).清晰版 内容：插值，函数逼近，特征值计算，数值微分，数值积分，方程求根，非线性方程组求解，线性方程组的直接法，线性方程组的的迭代法，随机数生成，特殊函数计算，常微分方程的初值问题，偏微分方程的数值解法，数据统计和分析。(Title: [MATLAB algorithms commonly used in assembly language]. (Gong pure). Clearer view of the contents: interpolation, function approximation, eigenvalue calculation, numerical differentiation, numerical integration, finding roots of equations, nonlinear equations, linear equations group, direct, linear equations of the iterative method, random number generation, calculation of special functions, initial value problems for ordinary differential equations, numerical solution of partial differential equations, statistics and analysis.)

各种优化算法解决tsp问题帮助您能够请搜你过得解决TSP问题(dhaks)

通信系统的matlab仿真程序，给出了大量可用的函数。(communication system simulation program Matlab, given the large number of functions available.)

rapport de stage industriel

code till segmentation

基于粗糙熵和K-均值聚类算法的图像分割 (Based on Rough Entropy and K-means clustering algorithm for image segmentation)

This paper is the result of a literature study carried out by the authors. It is a review of the dierent attempts made to solve the Travelling Salesman Problem with Genetic Algorithms. We present crossover and mutation operators, developed to tackle the Travelling Salesman Problem with Genetic Algorithms with dierent representations such as: binary representation, path representation, adjacency representation, ordinal representation and matrix representation. Likewise, we show the experimental results obtained with dierent standard examples using combination of crossover and mutation operators in relation with path representation. Keywords: Travelling Salesman Problem Genetic Algorithms Binary representation Path representation Adjacency representation Ordinal representation Matrix representation Hybridation. 1 1 Introduction In nature, there exist many processes which seek a stable state. These processes can be seen as natural optimization processes. Over the last...