资源列表
noice
- 在MATLAB环境下产生白噪声程序，三个性质可以设定，能够正常使用-In the MATLAB environment to produce white noise process, the three properties can be set to normal use
improved-AFSA
- 基于混沌迭代式的改进鱼群算法用于对非线性函数寻优-an improved Artificial Fish-swarm Algorithm on optimization for unlinear function
v_limite_betaDQM
- DQM法求解输液管道的流致振动问题，求解临界流速。考察颤振失稳和发散失稳的失稳方式。-DQM pipeline flow infusion method induced vibration problems, solving the critical velocity. Investigated the flutter instability and divergence instability of the instability mode.
New-folder-(2)
- gaussain pulse propagation in simple medium- Generates movies
fitness
- 一种基于人工鱼群算法求解这一类函数极值的代码,并通过仿真实验的研究,验证了该算法求解函数极值是有效可行的。 -Algorithm based on artificial fish extreme function of this type of code, and through simulation studies to verify the function of the algorithm is effective and feasible extreme.
graph
- 在图论的最短路问题中，我们经常用到floyd和Dijkstra来解决问题-In graph theory, shortest path problem, we often use the floyd and Dijkstra to solve the problem
IFMT
- 能够非常清楚的看出幅值和时间的变化规律，不用再画时、频图-Can very clear indication of the amplitude and the change of time rule，Don t draw, frequency chart
gauss
- 列主元高斯分解 用于计算方法的线性方程组的求解-Out the main element Gaussian decomposition method used to calculate the solution of linear equations
Numerical-method-solve-equations
- 数值方法解方程组AX=B（LU分解），过程分3步，首先，分解系数矩阵A=LU，然后，解LY=B，最后再求UX=Y 另一种是直接求解的（2.1）-Numerical method to solve the equations AX = B (LU decomposition), 3 step process, first of all, the decomposition of the coefficient matrix A = LU, then, Xie LY = B, and finally
windmolde
- 四分量风速模型，风电系统仿真部分，为风力机提供原动力-Four-component wind model, the wind power system simulation part, to provide impetus for the wind turbine
ford-max-flow
- 解决最小费用最大流问题，一般有两条途径。一条途径是先用最大流算法算出最大流，然后根据边费用，检查是否有可能在流量平衡的前提下通过调整边流量，使总费用得以减少？只要有这个可能，就进行这样的调整。调整后，得到一个新的最大流。-Minimum cost maximum flow problem to solve, there are generally two ways. One way is to use a maximum flow algorithm to calculate the maxim
RS2shouming
- 用于克隆攻击检测，该检测算法每个ID 对应着一个检测节点。每个消息在网络中随即转发很多次。-For cloning attack detection, the detection algorithm to detect each corresponds to a node ID. Each message in the network immediately forwarded many times.