-
solveTSP
Source code in matlab of neural network.
- 2010-05-30 02:05:09下载
- 积分:1
-
4
说明: design TCP/AQM router using robust control
- 2013-02-13 06:50:55下载
- 积分:1
-
homework1
octive 斯坦福大学公开课 机器学习公开课作业1(octive machine learning publicly Homework1)
- 2013-03-30 10:19:12下载
- 积分:1
-
HW2
In mathematics, the discrete-time Fourier transform (DTFT) is one of the specific forms of Fourier analysis. As such, it transforms one function into another, which is called the frequency domain representation, or simply the "DTFT", of the original function (which is often a function in the time-domain).(This file includes matlab source code about DTFT and also includes explanation report)
- 2010-01-28 20:34:53下载
- 积分:1
-
SOR
Heat equation with variable coeficients using Succesive Over Relaxation
- 2013-08-05 21:32:21下载
- 积分:1
-
雷达信号瞬时自相关处理 instant_autocorrelation
雷达信号瞬时自相关处理,计算信号瞬时频率,计算雷达信号参数等(instant auto-corelation)
- 2012-03-02 21:33:47下载
- 积分:1
-
featmatch
matlab匹配的匹配算法,可以调节参数(matching matching matlab)
- 2010-06-09 20:34:18下载
- 积分: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
-
113172218finalapplication
一个基于matlab平台关于图像检索的小型GUI!!!(A matlab-based image retrieval on a small platform GUI! ! !)
- 2011-04-21 21:14:30下载
- 积分:1
-
ancbeamfem
锚杆挡墙的立柱和锚杆内力的有限元分析,可以分析立柱在挡墙土压力作用下的挠曲线,以及内力大小,对于锚杆挡墙的优化设计具有较大作用。(FEM analysis on the internal forces and deflection of beam for anchoring retaining wall)
- 2011-04-28 21:25:48下载
- 积分:1