chap8

解决图论中Warshall-Floyd 算法，Kruskal 避圈法，匈牙利算法，求最佳匹配的算法，求最大流的Ford--Fulkerson 标号算法，求解最小费用流问题的matlab程序(Solve the graph theory Warshall-Floyd algorithm, Kruskal avoid lap law, Hungary algorithm, and the best matching algorithm, for maximum flow of the Ford- Fulkerson labeling algorithm for solving the minimum cost flow problem of matlab procedures)

计算机演算程序，平方映射分岔的Qbasic计算程序，平方映射的李雅普诺夫的Qbasic计算程序，．埃侬吸引子的李雅普诺夫指数的Qbasic计算程序，．单摆运动的分岔的Qbasic计算程序(Computer calculus procedures, square mapping bifurcation Qbasic program, square Lyapunov mapping of Qbasic computer program. Egypt Lennon attractor Lyapunov exponent of Qbasic computer program. Bifurcation of the pendulum movement Qbasic program)

Predication with RBF neural network BY hossein dehghan

二维卷积过滤器 卷积是一种像素过滤器 用像素本身以及邻近像素的加权平均值来替换这个像素(Two-dimensional convolution filter Filters of the convolution is a weighted average of the pixel and the neighboring pixels in the pixel itself, the pixel is replaced)

control of shunt active filter

meishenme dabuliao zhuyaoshi wo xiang yao xiazai yidian dongxi (meishenme dabuliao zhuyaoshi wo yao xiang xiazai yidian dongxi)

matlab程序，fdtd算法创建pec完美匹配曾目标的程序，语言简单易懂(Matlab, FDTD algorithm to create the pec perfect match has target program, easy to understand language)

说明：  MATLAB求解偏微分方程（扩散方程）有限差分法 源程序代码(MATLAB to solve partial differential equation ( diffusion equation ) finite difference method source code)

Copula理论及matlab应用实例 内含详细代码 已经过调试运行(Copula theory and application example with detailed code )

机械优化设计主要包括建立优化设计问题的数学模型和选择合适的优化方法及程序两方面的内容.基于二次插值法的基本原理,通过实例,编写MATLAB程序进行求解,计算结果说明了二次插值法是一种求解一元函数极小点问题最优解的可行高效的方法.(Mechanical optimization design includes a mathematical model to optimize the design of the problem and choose the appropriate two aspects of optimization methods and procedures based on the basic principles of quadratic interpolation method, is solved by way of example, the preparation of MATLAB, the results illustrate the quadratic interpolation method is a function of one yuan to solve the problem of the optimal solution of the minimum point efficient way possible.)