-
APMTMLHDGV01Ver2001
APMTMLHDGV01Ver2001_Tools_Software_general_05011YXC.rar华为手机刷机平台(Tools Software general )
- 2014-09-10 21:02:40下载
- 积分：1
-
MexDemo
matlab开发，在Vs2010里配置matlab调用环境(matlab developer)
- 2012-09-15 19:05:33下载
- 积分：1
-
lorenz
本程序用来做是基于matlab的洛伦兹仿真。(This program is based on the Lorentz matlab simulation.)
- 2020-07-04 03:20:02下载
- 积分：1
-
cosine_rolloff_timedomain_compare
不同滚降系数条件下余弦滚降时域波形的比较。(Different roll-off factor conditions Cosine waveform comparison.)
- 2013-04-23 23:32:31下载
- 积分：1
-
Project-OSV
This piece of code can be used to import text file data of the signature samples, and pre-process them.
- 2015-04-04 18:30:19下载
- 积分：1
-
47651494PSK
改文件描述了2DPSK的一些基本原理及其实现方法，主要在MATLAB环境实现(the description of 2DPSK)
- 2009-07-07 17:47:04下载
- 积分：1
-
PR
说明： 基于matlab人脸识别系统的开发与研究，关于人脸识别的研究(failed to translate)
- 2011-05-17 07:21:59下载
- 积分：1
-
matlabquzaosuanfa
通过编程用多种方法完成数字图像的降噪处理，并进行比较分析。(Programmed with a variety of methods to complete digital image noise reduction processing, and comparative analysis. Enable students to more fully grasp the basic theory of image processing, principles and means of achieving a comprehensive analysis of certain issues and problem-solving ability.)
- 2011-12-01 21:54:26下载
- 积分：1
-
liziqun_Matlab
粒子群算法的matlab实现，自己写的，对初学者有一定帮助(good for learning)
- 2013-11-29 12:17:59下载
- 积分：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
