-
xinxilun
排队论模型仿真程序。用MATLAB实现 。欢迎大家一起讨论(Queuing theory model simulation program. Use MATLAB to achieve. Welcome to discuss with)
- 2010-01-26 18:06:55下载
- 积分：1
-
nit
数值积分工具箱 这些都是通用集成例程：
quadg.m - 高Quad和QUAD8的准确性更换（1-D）quad2dg.m - 集成在一个矩形区域的2-Dquad2dggen.m - 比一般地区一体化的2-D- 超过ND超矩形区域quadndg.m ND集成(Numerical integration toolbox these are universal integrated routines:
Quadg.m- Quad and QUAD8(1-D ) quad2dg.m accuracy replacement- integrated in a rectangular area of the2-Dquad2dggen.m than in the general area in the integration of2-D over ND super rectangle quadndg.m ND integration)
- 2012-05-02 20:18:13下载
- 积分：1
-
boil
This is a boiling tutorial for fluent
- 2011-09-01 19:57:25下载
- 积分：1
-
Beamforming
program based on Rayliegh fading channel with and without beamforming.
- 2013-02-08 12:46:14下载
- 积分：1
-
ADS1282_noise_thd
ADS1282内噪音测试程序，用DSP读取数据，再用MATLAB解析数据并且分析(a code for ADS1282 noise test)
- 2012-01-01 20:32:41下载
- 积分：1
-
ex9_14
对微波基础理论的Matlab仿真。对于微波初学者有借鉴作用。程序补充三(based on microwave theory of Matlab. Microwave for a beginner lessons. Added three procedures)
- 2007-04-04 17:31:36下载
- 积分：1
-
tspjinjisousuo
禁忌搜索算法的matlab实现，以旅行商问题为例，使用该算法找出满意解。(Tabu search algorithm matlab realize, to the traveling salesman problem, for example, the use of the algorithm to find satisfactory solution.)
- 2013-11-24 17:41:09下载
- 积分：1
-
zuiyouhuasuanfa
最优化求函数迭代有牛顿法。0.618.等(Demand function optimization iteration Newton method. 0.618.)
- 2012-11-11 19:58:23下载
- 积分：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
-
67506274generatcomplexnetworks
是一篇关于复杂网络的论文这个文档还是有点价值的(Is a complex network of papers on this document is still a bit value of)
- 2009-11-04 23:22:34下载
- 积分：1
