psosvm

hatch MATLAB and POWER POINT

在MATLAB/simulink下，搭建三相四线制非线性负载。(In the MATLAB/simulink, the three-phase four-wire system to build non-linear load.)

说明：  牛顿拉普逊法就算配电网重构的潮流程序，结构清晰易懂。(Newton Raphson method Rapp trend even if the distribution network reconfiguration process, clear and understandable structure.)

用matlab实现Arnold置乱和周期计算。其中，算法简单，效果好！(Arnold scrambling with matlab implementation and periodic calculations)

本程序能够生成规避障碍轨迹，采用的是双向路径规划法(The program can generate circumvent the obstacle track, two-way path planning method)

RS编解码的仿真，对初识RS的可能有所帮助(RS simulation)

层次分析（AHP）/网络分析（ANP)Analytic Hierarchy Process是一种十分实用的决策方法。 是对一些较为复杂、较为模糊的问题作出决策的简易方法，它特别适用于那些难于完全定量分析的问题 num:包括目标层和方案层的总层数 g:行向量（各层准则数量，包括目标层（第一层）和方案层（最后一层））。 w：返回值w是最后决策的方案层的权重，根据输出选择最佳方案 在输入矩阵时请加‘[]’号，否则会出现语法错误。 调运方式：w=hierarchy(num,g)( Analytical Hierarchy (AHP)/Network Analysis (ANP) Analytic Hierarchy Process is a very practical approach to decision making. Is the easy way of making some of the more complex, more ambiguous issues make it particularly difficult for those who complete quantitative analysis of the problem num: The total number of layers including the target layer and the solution layer g: row vector (layers Guidelines number, including the target layer (first layer) and program level (the last level)). W: w The return value is the right solution layer of the final decision of the heavy, choose the best option based on the output when the input matrix please add ' []' No, there would be a syntax error. Transporting way: w = hierarchy (num, g))

Plate Detection-You must Open The ebigood.fig for see my program

数学建模算法大全中的例子： 多元分析，包含主成分分析 因子分析(Example: mathematical modeling algorithm Guinness multivariate analysis, including principal component analysis factor analysis)

递归法求解整数划分。 整数划分，是指把一个正整数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) )