y3k=fft(u,(m+n-2)/4) i=1:(m+n-2)/4 subplot(5,2,9) stem(i,u) title( 滤波后上采样 ) k=1:(m+n-2)/4 subplot(5,2,10) stem(k,y3k) title( 上采样频谱 ) xlabel( k ) ylabel( y3k )
上传时间: 2013-12-18
上传用户:zhliu007
maybe is knn or maybe not i m not sure about it it s a temp file
上传时间: 2017-02-11
上传用户:稀世之宝039
Nearest neighbors is a semi deconvolution algorithm. I m a newbie in matlab but I hope this helps somebody :)
标签: deconvolution neighbors algorithm Nearest
上传时间: 2014-11-26
上传用户:xjz632
介绍行列划分算法和矩阵相乘并行算法M P I 程序, 给出基于矩阵相乘并行算法的M P I 实现, 分析和讨 论处理器数目、复杂性、矩阵划分、B 子块传递、死锁避免和矩阵数据的获取等问题.
上传时间: 2017-06-03
上传用户:royzhangsz
hereby i m submitting this file
标签: submitting hereby file this
上传时间: 2017-07-01
上传用户:llandlu
Fortran - Tóm tắ t nộ i dung mô n họ c Các khái niệ m và yế u tố trong ngô n ngữ lậ p trình FORTRAN. Các câ u lệ nh củ a ngô n ngữ FORTRAN. Cơ bả n về chư ơ ng chư ơ ng dị ch và mô i trư ờ ng lậ p trình DIGITAL Visual Fortran. Viế t và chạ y các chư ơ ng trình cho các bài toán đ ơ n giả n bằ ng ngô n ngữ FORTRAN.
上传时间: 2013-12-25
上传用户:songrui
Tried to make CAN logger on AT91sam7X-ek, but have no idea how to implement FATFs... -( I m just a beginner
标签: implement logger Tried FATFs
上传时间: 2017-09-20
上传用户:moerwang
系统资源(r1…rm),共有m类,每类数目为r1…rm。随机产生进程Pi(id,s(j,k),t),0
上传时间: 2014-01-27
上传用户:天诚24
Windowed-Burg method is made in order to improve the Clasical Burg method. Previously, I send the PBURGW.m file, but now I include also the ARBURGW.m algorithm and some NOTES-EXAMPLES to explain it and compare with the pburg.m algorithm from MATLAB.
标签: method Windowed-Burg Previously the
上传时间: 2013-12-22
上传用户:familiarsmile
.数据结构 假设有M个进程N类资源,则有如下数据结构: MAX[M*N] M个进程对N类资源的最大需求量 AVAILABLE[N] 系统可用资源数 ALLOCATION[M*N] M个进程已经得到N类资源的资源量 NEED[M*N] M个进程还需要N类资源的资源量 2.银行家算法 设进程I提出请求Request[N],则银行家算法按如下规则进行判断。 (1)如果Request[N]<=NEED[I,N],则转(2);否则,出错。 (2)如果Request[N]<=AVAILABLE,则转(3);否则,出错。 (3)系统试探分配资源,修改相关数据: AVAILABLE=AVAILABLE-REQUEST ALLOCATION=ALLOCATION+REQUEST NEED=NEED-REQUEST (4)系统执行安全性检查,如安全,则分配成立;否则试探险性分配作废,系统恢复原状,进程等待。 3.安全性检查 (1)设置两个工作向量WORK=AVAILABLE;FINISH[M]=FALSE (2)从进程集合中找到一个满足下述条件的进程, FINISH[i]=FALSE NEED<=WORK 如找到,执行(3);否则,执行(4) (3)设进程获得资源,可顺利执行,直至完成,从而释放资源。 WORK=WORK+ALLOCATION FINISH=TRUE GO TO 2 (4)如所有的进程Finish[M]=true,则表示安全;否则系统不安全。
上传时间: 2014-01-05
上传用户:moshushi0009