-
MainAneal
最短路径的模拟退火算法,用matlab编写的。(aneal algorithm)
- 2014-01-02 21:00:59下载
- 积分:1
-
Fwaves
Solve 2d wave equation with Finite difference method有限差分法解二维波动方程(Solve 2d wave equation with Finite difference method)
- 2011-09-08 16:17:39下载
- 积分:1
-
filter-MATLAB
实现自适应滤波器的功能 并经过改进和优化(Implement an adaptive echo cancellation algorithm in C and download it to the TMS320C6713 DSP Starter Kit)
- 2009-06-16 15:08:40下载
- 积分:1
-
2009923154457324436
模拟倒向随即微分方程,给出图形和用户说明,在学术研究中有一定的应用(Then simulated backward differential equations, graphics and user instructions are given in academic research in the application of certain)
- 2011-09-04 21:22:13下载
- 积分:1
-
normally-distributed-random
利用c语言生成符合正态分布的随机数,并在matlab程序中画出曲线图,并与理论值比较(Use c language to generate normally distributed random numbers and draw graphs in matlab program)
- 2013-12-28 17:03:36下载
- 积分:1
-
123
说明: 图像处理(验证码识别)程序
内含事例(Image processing (validation code identification) program contains examples of)
- 2010-04-25 09:16:17下载
- 积分:1
-
MOEA-NSGA-II
Comparison between NSGA-II and e-MOEA(NSGA-II+vs.+e-MOEA)
- 2010-05-23 10:23:22下载
- 积分:1
-
example1
选择二进制编码,利用遗传算法计算函数的最小值(calculate function minimum with genetic algorithm)
- 2014-11-13 16:49:35下载
- 积分:1
-
FIR_Filter_windowing
FIR filter windowing
- 2010-10-24 02:40:11下载
- 积分: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