straight_wire

说明：  针对小流域设计洪水计算中，采用推理公式求解洪峰流量Qm及汇流时间τ的方法繁琐，查算精度较低等问题，提出用牛顿迭代法求解，该方法较原图解试算法收敛快，迭代次数少，计算速度快，精度可靠。计算实例表明，用简单迭代法与牛顿迭代法计算设计洪峰流量，其结果与图解试算法完全一致。()

采用加权网络中节点强度和权重都是幂率分布的模型，在matlab环境中自动识别连通区域的大小,用于时频分析算法。( Using weighted model nodes in the network strength and weight are power law distribution, Automatic identification in the matlab environment the size of the connected area, For time-frequency analysis algorithm.)

how to build an FM modulation on matlab

Matlab的行优先算法，可以方便的判断对如机场、火车站、公交车的就座问题进行分析(Matlab line priority algorithm, it will be convenient for the judge, such as airports, railway stations, bus seat to undertake an analysis of)

利用MATLAB 编程语言计算空间最近距离的ICP 算法(use matlab compute the shortest distance between two point )

cao算法，可以确定嵌入维数，从而实现相空间重构(Cao algorithm, embedding dimension of time series can be determined, so as to realize the phase space reconstruction)

如果G的边集E(G)中有个子集M，满足M中的任何两条边 都不邻接，则M就是图G的一个匹配。包含边数最多的匹配 称为最大匹配，最大匹配所包含的边数称为最大匹配数。当 G是二分图时，问题就比较特殊了，这就是我们要解决 的问题——最大二分匹配。(If there is a subset M in the edge set E (G) of G, if any two edges in M are not adjacent, then M is a match of graph G. The match with the largest number of edges is called the maximum matching, and the number of edges contained in the maximum matching is called the maximum matching number. When G is a two point graph, the problem is very special. This is the problem we want to solve -- the biggest two points matching.)

helpfull material about matlab and simulink review and commands

lear N = 10^5 EB_NO = [-1:30] liu1 = zeros(1,N) liu2 = zeros(1,N) for ii = 1:length(EB_NO) m= (2*(rand(1,N)>0.5)-1) + j*(2*(rand(1,N)>0.5)-1) s = (1/sqrt(2))*m normalization of energy to 1 n = 1/sqrt(2)*[randn(1,N) + j*randn(1,N)]

针对于三维物体的曲线信息，对曲线进行5*5拟合，能够直接得到曲面的参数方程(For the curve in three-dimensional object information, the 5* 5 curve fitting, be able to direct surface parameter equation)