-
MySinAffPro
实现图像基本的缩放、旋转、平移、投影、仿射、相似变换等功能(Image basic scaling, rotation, translation, projection, affine, similarity transformation functions)
- 2010-10-26 14:34:02下载
- 积分:1
-
E4
说明: MATLAB Toolbox for econometric modeling of time series. E4 makes up for the lack of PC software for estimating econometric models by exact maximum likelihood.
- 2009-07-27 00:36:13下载
- 积分:1
-
Inventory-calculatio-system
This project is used to simple inventory calculation system
- 2013-12-06 16:06:15下载
- 积分:1
-
pinpu
信号的频率选择性衰落,根据频率的不同,在某些点上信号增强,某些点上信号减弱,此代码为MATLAB建模的仿真代码,开发环境为matlabR2011B(The signal frequency selective fading)
- 2014-03-24 23:07:36下载
- 积分:1
-
cx
说明: 利用Matlab编写求取4级移位寄存器的M序列
设初始序列为:1 1 1 1 通过一个四级的移位寄存器,其中在第三级有负反馈(一个模二加法),即将序列的第三位和第四位相加(如序列1 1 1 1经移位寄存器第一次移位后为0 1 1 1)的值再赋到第一位.
序列的周期为16.(The use of Matlab to prepare to strike four of the M shift register sequence based initial sequence as follows: 1 1 1 1 4 through a shift register, which in the third grade there is negative feedback (one-mode two adder), the upcoming series third and fourth combined (such as the sequence 1 1 1 1 by the shift register after the first shift for the 0 1 1 1) the value given to the first again. The cycle sequence was 16.)
- 2007-11-28 18:54:54下载
- 积分:1
-
BPMatlab
利用Matlab实现BP神经网络的程序,给出了具体的例子,写得比较详细。(The application of Matlab to achieve BP neural network procedures, specific examples are given with more detail.)
- 2009-05-05 12:10:58下载
- 积分:1
-
Time-Series-Prediction
Time-Series Prediction with NNMLP
- 2014-10-24 05:24:17下载
- 积分:1
-
Code_GK
Matlab code for GK Algorithm for segmentation
- 2015-04-14 15:44:29下载
- 积分:1
-
K_average
K-均值聚类算法,基本算法代码,算法的目的是使各个样本与所在类均值的误差平方和达到最小。(The purpose of K-means clustering algorithm, the basic algorithm code, the algorithm is to make the class where each sample mean squared error is minimized.)
- 2014-06-09 11:24:36下载
- 积分:1
-
SIMULATED-ANNEALING-
这是一个关于商人visit许多城市,怎样走法才能使距离最短的例子,采样的了退火算法的经典案例(Traveling Salesman Problem (TSP) has been an interesting problem for a l
me in classical optimization techniques which are based on linear and nonlin
ogramming. TSP can be described as follows: Given a numberof cities to v
d their distances from all other cities know, an optimal travel route has to
und so that each city is visited one and only once with the least possible dista
aveled. This is a simple problem with handful of cities but becomes complica
the number increases.)
- 2013-12-15 03:26:30下载
- 积分:1