-
Spread-of-Internet-Rumours
选拨赛数学建模题目-网络谣言的传播模型。文件中包括题目、参考文献和matlab代码。basic.m中是最简化的模型，extend1.m中更进一步，算法中引入老年人和年轻人的活跃程度和对谣言的易信度的不同，beacons.m中再进一步引入网络警察角色来演化谣言的传播。(American Mathmetical Modeling Competition. Title:Spread of Internet Rumours.The file inclueds the title document,the reference literature and the MATLAB code.)
- 2013-08-14 18:31:10下载
- 积分：1
-
DUMP
裕兴FC磁盘式学习机全功能自动DUMP卡带ROM软件源码!!!!!!!!!!!!!!!!!!!!!!!!!(Yuxing FC disk-based learning machine fully functional automatic cassette DUMP ROM software source code)
- 2013-12-17 14:03:36下载
- 积分：1
-
fmlin
用于产生线性调频信号，在时频分析中非常常用(used to proceed linear-time frequency modulated signal, it is very uesful in signal porcessing)
- 2014-12-02 09:47:26下载
- 积分：1
-
emdanalyse
这个进行形象分解EMD,可以很理解EMD分解,便于学习入门EMD.(The image decomposition for EMD, EMD decomposition can be understood, easy to learn entry-EMD.)
- 2010-07-12 14:50:23下载
- 积分：1
-
scheinerman
Companion Software
- 2010-02-17 07:14:27下载
- 积分：1
-
switch_and_stay
switch and stay模式下，瑞利信道环境中的能量检测(energy detection switch and stay mode, Rayleigh channel environment)
- 2013-04-17 22:21:42下载
- 积分：1
-
PMSM-SMC
永磁同步电机（PMSM）位置滑模变结构控制仿真，SVPWM(Permanent Magnet Synchronous Motor (PMSM) position variable structure control simulation, SVPWM)
- 2021-03-18 09:49:20下载
- 积分：1
-
two_D_DFT
对输入的数字图像进行二维离散傅立叶变换，由matlab实现(The input digital image to two-dimensional Discrete Fourier Transform, from matlab realize)
- 2007-09-18 10:46:04下载
- 积分：1
-
K-meanCluster
How the K-mean Cluster work
Step 1. Begin with a decision the value of k = number of clusters
Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following:
Take the first k training sample as single-element clusters
Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster.
Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample.
Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments. (How the K-mean Cluster workStep 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (Nk) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3. Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4. Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.)
- 2007-11-15 01:49:03下载
- 积分：1
-
tridiagLUsolve.m
Solution of system (LU)*v=d
- 2013-01-10 21:40:53下载
- 积分：1
