-
monituihuosuanfa
说明： 在求解非线性方程中如何运用模拟退火优化算法进行分析(Solving nonlinear equations in the use of simulated annealing algorithm to analyze)
- 2010-04-25 20:46:21下载
- 积分：1
-
matlab
基于小波变换的数字水印提取Matlab源代码(Digital Watermarking Based on Wavelet Transform Matlab source code extraction)
- 2010-05-11 15:54:33下载
- 积分：1
-
Lyapunov-Wolf-
时间序列的最大Lyapunov 指数 Wolf 方法(Time series of maximum Lyapunov index, Wolf method)
- 2015-04-01 10:48:24下载
- 积分：1
-
pdco5
内点优化法，stanford大学The Systems Optimization Laboratory 开发(Interior point,stanford university The Systems Optimization Laboratory)
- 2020-06-23 14:20:02下载
- 积分：1
-
Fast2-DimensionalInterpolation
matlab插值算法interp2的改进，快速interp2插值(Fast 2-dimensional interpolation)
- 2010-10-23 21:46:12下载
- 积分：1
-
Lax
Lax法求解一介波动方程，初始条件：c=1m/s,x=1-2时，u=2m/s.(Lax method to solve wave equation)
- 2014-11-29 07:06:31下载
- 积分：1
-
image_process
matlab image process
- 2015-01-20 10:09:38下载
- 积分：1
-
Rongekutta
求解陀螺仪的姿态角，采用四元素的四阶龙格库塔法求解，含姿态初始四元素的确定。(Solving gyro attitude angle, using the four elements of the fourth-order Runge-Kutta method to solve, including the initial four elements determined attitude.)
- 2013-05-24 09:59:24下载
- 积分：1
-
FastICA_25
fastica 独立成分分析的matlab代码(Independent Component Analysis FastICA matlab code)
- 2008-06-19 10:00:34下载
- 积分：1
-
small-world-networks
1998年, Watts和Strogatz 提出了小世界网络这一概念,并建立了WS模型。 实证结果表明,大多数的真实网络都具有小世界特性(较小的最短路径) 和聚类特性(较大的聚类系数) 。
WS小世界模型构造算法
1、从规则图开始：考虑一个含有N个点的最近邻耦合网络，它们围成一个环，其中每个节点都与它左右相邻的各K/2节点相连，K是偶数。
2、随机化重连：以概率p随机地从新连接网络中的每个边，即将边的一个端点保持不变，而另一个端点取为网络中随机选择的一个节点。其中规定，任意两个不同的节点之间至多只能有一条边，并且每一个节点都不能有边与自身相连。
(In 1998, Watts and Strogatz proposed the concept of the small world network, and the establishment of the WS model. The empirical results show that most real networks have small world (the smaller the shortest path) and clustering properties (high clustering coefficient).
WS small-world model construction algorithm
1, from the rules FIG: consider a nearest neighbor coupling network with N points, they are surrounded by a ring, wherein each node and its left and right adjacent to each of K/2 connected to the node, K is an even number.
The 2 randomized reconnection: randomly with probability p from the new connection on each side of the network, coming section of one of the endpoints remain unchanged, while the other endpoint is taken as the random selection of a node in the network. Which states that between any two different nodes can have at most one edge, and each node can not be connected to its own side.)
- 2021-04-27 08:08:44下载
- 积分：1
