-
Matlab_Simulink_to_code
matlab 和 simulink 转换成代码的实现，其中第8章介绍了matlab simulink 到vxworks代码的实现(matlab and simulink to code for some special use)
- 2009-03-08 09:48:07下载
- 积分：1
-
adaptive_track_enginesam
Determines what changes you should make to the signal during a psychoacoustic adaptive track
- 2013-08-18 03:29:20下载
- 积分：1
-
1
说明： Simulation distribution1
- 2013-11-09 19:20:13下载
- 积分：1
-
matlabgaojietongjiliang
高阶统计量目前应用越来越广泛，它比现在的一般统计量更能反应信号的特征，具有很好的应用前景。(Order statistics used widely at present, it is the general statistics than it is now more characteristic response signals, with good prospects.)
- 2011-01-12 11:21:04下载
- 积分：1
-
GA_Binary2
遗传算法遗传算法遗传算法遗传算法遗传算法遗传算法遗传算法遗传算法遗传算法遗传算法(GA Matlab程序)
- 2021-02-21 11:29:42下载
- 积分：1
-
amplitude_ps_4s
光子筛孔分布的例程，用于光子筛成像时使用(Photon sieve distribution routine for use when the imaging photon sieve)
- 2013-10-14 20:00:13下载
- 积分：1
-
elm
极速学习机,可以做模型预测、评价，比BP神经网络更优。(Fast learning machine, you can do the model prediction, evaluation, better than BP neural network.)
- 2013-12-18 23:35:27下载
- 积分：1
-
quad
一个导弹拦截simulink仿真程序，内含目标运动函数、导弹运动模型、导弹制导与控制算法(A Simlink Simulation Program for Missile Interception)
- 2021-04-06 22:39:02下载
- 积分：1
-
BackgroundRemovalforColorImagesBasedonColorCompone
说明： 基于彩色成分差异的彩色图像背景去除算法研究(Background Removal for Color Images Based on Color Components Difference0)
- 2010-03-26 17:59: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
