-
m3
说明: To solve an initial value problem, say, equation
y = dsolve( Dy = y*x , x ) with y(1) = 1, use of calculus of vaiation
- 2013-11-20 00:33:45下载
- 积分:1
-
binarize
source code to binarize image
- 2010-01-11 19:42:15下载
- 积分:1
-
Matlab
Matlab快捷键命令大全,感觉很有用,希望大家喜欢!!(Matlab shortcut command Guinness, feel useful, I hope you like it! !)
- 2011-01-08 12:33:30下载
- 积分:1
-
Power-Electronics-Handbook
Power Electronics Handbook
- 2014-01-07 19:41:34下载
- 积分:1
-
maze_gen3
迷宫程序,用matlab编写的一段实现迷宫的小程序(Maze procedure, using Matlab prepared a section of the maze procedure)
- 2012-03-22 15:05:19下载
- 积分:1
-
A-Numerical.methods.in.engineering.with-Matlab
This is a comprehensive guide to engineering students for using matlab
- 2012-05-09 23:16:47下载
- 积分:1
-
Nonlinear system_Hassan_K_Khalil
说明: 非线性 matlab Nonlinear system_Hassan_K_Khalil的matlab代码。书本的代码编写主要集中在第二章,第十三章,第十四章代码(the matlab code of Nonlinear system_Hassan_K_Khalil, the code main are in the charpter 2 ,charpter 13 and charpter 14)
- 2020-12-27 08:39:02下载
- 积分:1
-
work
信道的均衡匹配的源码,自己根据书编写的。根据不不同的输入参数,求信号的滚进系数,不同的对比(Channel balanced match source, their own book, prepared in accordance with. According to different input parameters, and rolled into coefficient signals in different contrast)
- 2009-03-14 10:03:08下载
- 积分:1
-
FIR
FIR滤波器中汉宁窗和布莱克曼窗幅频特性曲线和相频特性曲线对比(FIR filter Hanning window and Blackman window of amplitude-frequency curve and phase frequency response curve compared)
- 2020-07-01 14:20:01下载
- 积分:1
-
littleworld
NW小世界网络的构成原则为:从一个环状的规则网络开始,网络含有N个结点,每个结点向与它最近邻的K个结点连出K条边,并满足N>>K>>In(N)>>1。随后进行随机化加边,以概率p在随机选取的一对节点之间加上一条边。其中,任意两个不同的节点之间至多只能有一条边,并且每一个节点都不能有边与自身相连。改变p值可以实现从最近邻耦合网络(p=0)向全局耦合网络(p=1)转变。在p足够小和N足够大时,NW小世界模型本质上等同于WS小世界模型。
(NW constitutive principles of small-world networks: from the rules of a ring network, network with N nodes, each node is connected to the K node with its nearest neighbor K edges, and meet N > > K > > In (N) > > 1. Followed by randomization into the plus side, with probability p with an edge between a pair of nodes in a randomly selected. Wherein between any two different nodes at most only one edge, and each node can not have a side connected with itself. P value can be changed to achieve the transition from the nearest neighbor coupling network (p = 0) coupled to the global network (p = 1). When p is small enough and large enough N, NW small-world model is essentially the same as the WS small-world model.)
- 2013-04-26 21:17:37下载
- 积分:1