-
one-class-SVM
经典的单类相关向量机程序，比较实用，适合初学者(classical one-class SVM program，very practical and satisfied for the beginner)
- 2015-11-11 17:07:12下载
- 积分：1
-
niudun
本文件是基于MATLAB的解最优化算法的源代码，为牛顿法(This document is based on the MATLAB optimization algorithm solution of the source code for the Newton method)
- 2008-12-18 19:46:28下载
- 积分：1
-
TopologyTools
将一个复杂的HashMap转换成的字符传再转换为HashMap(Tranvert the String of HashMAP to HashMAP)
- 2009-11-15 22:10:34下载
- 积分：1
-
NG
说明： 一个图形界面，可以输入不同类别的信号进行仿真(PLOT )
- 2010-03-26 21:33:57下载
- 积分：1
-
3
To support wireless communication : MIMO
- 2013-12-24 21:53:23下载
- 积分：1
-
MUSIC-DOA-estimation-algorithm
MUSIC是基于天线阵列协方差矩阵的特征分解类DOA估计算法，这里是波束空间MUSIC算法源程序。(MUSIC DOA estimation algorithm is based on the decomposition class features antenna array covariance matrix, here is the beam space MUSIC algorithm source.)
- 2014-01-06 15:26:16下载
- 积分：1
-
kalman-1.3
卡尔曼滤波算法 包括数据、程序 已经打包(Kakman filter)
- 2012-04-09 14:10:24下载
- 积分：1
-
Add_log
用于splitlab 的地震目录添加，数据请自行在USGS下载，详细说明见代码内部(used for the log add in splitlab)
- 2012-08-07 14:06:04下载
- 积分：1
-
ADE_FDTD_2D_RCS
使用matlab语言编写FDTD散射问题(FDTD scattering problem with matlab language)
- 2019-05-09 16:14:19下载
- 积分：1
-
rengongmianyi
a=load( q.txt )
width=input( 请输入窗宽 )
step=input( 请输入步长 )
m=length(a)
for i=1:floor((m-width)/step+1)
s(i,1:width)=a(1,1+(i-1)*step:width+(i-1)*step)
end
b=max(max(s))
M=s./b
Rs=input( 请输入本体集半径 )
nd=input( 请输入检测器数模 )
k=1
while k<=nd
d{k}=rand(1,width)
for i=1:floor((m-width)/step+1)
if (norm(d{k}-s(i,:)))^2<Rs
break
end
end
k=k+1
end
for j=1:nd
for i=1:floor((m-width)/step+1)
R(i)=(norm(d{j}-s(i,:)))^2(a = load (' q.txt' ) width = input (' Please enter the window width' ) step = input (' Enter step size' ) m = length (a) for i = 1: floor ((m-width)/step+1) s (i, 1: width) = a (1,1+ (i-1)* step: width+ (i-1)* step) end b = max (max (s)) M = s./b Rs = input (' Please enter the body set radius' ) nd = input (' Please enter the number of detector modules' ) k = 1 while k < = nd d {k} = rand (1, width) for i = 1: floor ((m-width)/step+1) if (norm (d {k}-s (i ,:)))^ 2 <Rs
break
end
end
k=k+1
end
for j=1:nd
for i=1:floor((m-width)/step+1)
R(i)=(norm(d{j}-s(i,:)))^2)
- 2011-05-21 16:46:49下载
- 积分：1
