-
copula函数拟合出来后，通过计算各类copula函数的aic值aic_account
说明： copula函数拟合出来后，通过计算各类copula函数的aic值，找到最佳的copula二元分布模型(Calculating AIC values of different Copula Functions)
- 2020-11-10 09:59:46下载
- 积分：1
-
radarcode
使用MATLAB生成线性调频信号，并进行傅里叶变换，并进行脉冲压缩(Chirp signal is generated using MATLAB and Fourier transform, and pulse compression)
- 2014-11-21 09:01:30下载
- 积分：1
-
matlab-computation-book
用matlab进行科学计算和工程应用的教程(Using matlab tutorials scientific computing and engineering applications)
- 2013-12-13 00:33:28下载
- 积分：1
-
bmorph
Binary erosion and dilation, with fast iterative calls.
For any structuring element other than square or disk this function is way faster than imerode.m and imdilate.m (more than an order of magnitude). It s also handy when you don t have the Matlab Image Processing Toolbox :-)...
It also allows very fast iterative calls (for instance when sweeping the structuring element while looking for a certain effect, threshold in image statistics, etc).
See the help in bmorph.m and the attached .pdf file.
- 2010-09-23 17:54:52下载
- 积分：1
-
BOCaBPSK
Mathematica 环境下GNSS导航信号体制中的BOC调制、BPSK调制的功率谱计算及频谱图绘制程序，相关函数计算(GNSS navigation signal system in the BOC Mathematica modulation, BPSK modulation of the power spectrum calculation and spectral mapping procedures, the calculation of the correlation function)
- 2016-03-10 11:08:41下载
- 积分：1
-
ebma
matlab code for ebma
- 2010-11-08 06:00:23下载
- 积分：1
-
tp3.tar
Border detection with first derivatives
- 2009-12-25 04:44:31下载
- 积分：1
-
BatteryStatus
Battery Status, battery info, battery voltage, battery temperature, battery health
- 2013-07-19 09:52:17下载
- 积分：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
-
16-pianweifenfangcheng-shuzhijiefa
偏微分方程的数值解法【matlab例程】经典算法直接应用方便快捷(Numerical Solution of Partial Differential Equations [convenient] classical algorithm matlab routines direct application)
- 2014-01-20 13:49:25下载
- 积分：1
