-
matlab
matlab 遗传算法 算例 可以帮助我们了解算法(matlab genetic algorithm example can help us understand the algorithm)
- 2013-01-13 23:03:08下载
- 积分：1
-
Exercise2
程序的内容包括信号的DFT及IDFT处理以及数字滤波器的设计。相关的参考资料也包含在其中。(Contents of the program including the signal DFT and IDFT processing and digital filter design. Related reference information is also included.)
- 2013-09-06 08:27:18下载
- 积分：1
-
DSASW0050144
关于电感天线的选择，我选择的是这款，大家有跟好的选择么。(Manual inductance of the antenna)
- 2014-11-04 16:52:12下载
- 积分：1
-
rectifier3phase
a 3 phase rectifier ckt matlab simulink model
- 2012-08-24 13:10:51下载
- 积分：1
-
baoluoxian
包络曲线的求法 matlab中的一种求上下包络的算法，特别经典的两种算法(Envelope curve for France matlab down in one envelope seeking algorithms, especially the classic two algorithms)
- 2013-11-10 11:52:38下载
- 积分：1
-
JIANXIEBO
总结了近十年的间谐波研究的方法和一些关键技术(Summarizes the research nearly a decade of inter-harmonics method, and some key technologies)
- 2010-09-14 23:47:15下载
- 积分：1
-
lpsvm
该文件是Newton Method for LP Support Vector Machine 文章的程序(This is a procedure for this paper with title "Newton Method for LP Support Vector Machine")
- 2009-05-13 12:06:32下载
- 积分：1
-
PID_Controller
THIS IS THE SOURCE CODE FOR PID CONTROLLER
- 2015-04-10 00:52:51下载
- 积分：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
-
IHT
压缩感知的贪婪迭代算法，算法使用最小二乘估计来重构信号(Greedy iterative algorithm compressed sensing algorithms to reconstruct the signal using a least squares estimation)
- 2014-02-10 21:37:17下载
- 积分：1
