Program

说明：  小世界网络路径求法，以及聚集度的求法，开发环境是matlab(small world)

说明：  下面的程序是求多项式y=x^6-10x^5-26x^4+344x^3+193x^2-1846x-1680在区间[-8,8]的最小值，误差不超过0.001。对于这个复杂的多项式，可先用matlab绘制函数的大概曲线，确认函数的最小值大概处于[-8,8]之间，再用本程序求出精确解。 (The following procedure is a polynomial y = x ^ 6-10x ^ 5-26x ^ 4+344 x ^ 3+193 x ^ 2-1846x-1680 in the interval [-8,8] of the minimum error is not more than 0.001. This is a complex polynomial, can first draw function with matlab about curves, to confirm the function of the minimum are probably in [-8,8] range, and then find the exact solution of this program.)

matlab扩展编程——matlab扩展编程完整版，pdf格式，包含语音部分的两章的matlab例程(Matlab programming expansion-- Matlab version of the expansion program integrity, pdf format, part of the speech contains two chapters of Matlab routines)

扩展卡尔曼滤波的一个简单matlab源代码，请大家指正(A simple extended Kalman filter matlab source code, please correct me)

二次规划师非线性优化中的一种特殊情形，它的目标函数是二次实函数，约束函数都是线性函数。由于二次规划比较简单，便于求解（仅次于线性规划），并且一些非线性优化问题可以转化为求解一些列的二次规划问题，因此二次规划的求解方法较早引起人们的重视，称为求解非线性优化的一个重要途径。二次规划的算法较多，本文仅介绍求解等式约束凸二尺规划的拉格朗日方法以及求解一般约束凸二次规划的有效集方法。(Quadratic nonlinear optimization planners in a special case, its real objective function is a quadratic function, constraint functions are linear functions. Because of quadratic programming is relatively simple and easy to solve (after linear programming), and some non-linear optimization problem can be transformed into solving quadratic programming problems some columns, solving quadratic programming method therefore attracted attention earlier, saying an important way for solving nonlinear optimization. More quadratic programming algorithm, this paper describes only two feet Solving the Equality Constrained Convex Programming effective Lagrangian method and set method for solving general constrained convex quadratic programming.)

基于Matlab的PCA人脸识别算法，代码注释清楚，实现简单。(PCA face recognition algorithm based on Matlab)

用户可以进行查询，也可以进行取款存款，还可以转账(Users can query, can also make deposits, withdrawals can also be transferred)

说明：  Matlab工具箱实现多变量回归模型的参数估计与特征值(Matlab Toolbox multivariable regression model parameter estimation and eigenvalue)

解决最小费用最大流问题，一般有两条途径。一条途径是先用最大流算法算出最大流，然后根据边费用，检查是否有可能在流量平衡的前提下通过调整边流量，使总费用得以减少？只要有这个可能，就进行这样的调整。调整后，得到一个新的最大流。(Minimum cost maximum flow problem to solve, there are generally two ways. One way is to use a maximum flow algorithm to calculate the maximum flow, then the cost side, check whether it is possible under the premise of the flow balance by adjusting the edge flow, so that the total cost can be reduced? As long as this possible, for such adjustments. Adjusted to obtain a new maximum flow.)

多维粒子群优化算法，用于求解多维函数的优化问题。(Multidimensional PSO algorithm for solving optimization problems of multidimensional function.)