登录
首页 » matlab » Q3_1

Q3_1

于 2013-11-29 发布 文件大小:2146KB
0 59
下载积分: 1 下载次数: 4

代码说明:

  hello mr admin please active my account

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • knnsearch
    寻找测试样本的最近邻,可以有效的用于用于模式识别,信号处理(This is a small but efficient tool to perform K-nearest neighbor search, which has wide Science and Engineering applications, such as pattern recognition, data mining and signal processing. The code was initially implemented through vectorization. After discussions with John D Errico, I realized that my algorithm will suffer numerical accurancy problem for data with large values. Then, after trying several approaches, I found simple loops with JIT acceleration is the most efficient solution. Now, the performance of the code is comparable with kd-tree even the latter is coded in a mex file. The code is very simple, hence is also suitable for beginner to learn knn search.)
    2010-03-16 14:08:11下载
    积分:1
  • cdma-matlab
    说明:  用matlab程序模拟实现cdma系统的整个过程。包括并串、串并转换,m序列的产生,直接扩频、解扩,qpsk的调制解调,载波调制解调等。(Matlab simulation procedures used to achieve the whole process of cdma systems. Including and string SERDES, m sequence generation, direct spread spectrum, despreading, qpsk the modulation and demodulation, carrier modulation and demodulation, etc..)
    2020-12-16 11:39:12下载
    积分:1
  • Distribution-network-reconfiguration
    这是应用于配电网重构的改进二进制粒子群算法,能够取得比较理想的效果(Distribution network reconfiguration )
    2021-03-05 15:39:32下载
    积分:1
  • Appendix1B_K_cross_validation
    sourse code for cross validation
    2013-09-15 19:34:45下载
    积分:1
  • m_send_receive
    64长度的m序列的捕获过程,同时有数据部分经过调制解调和m序列的成帧过程等描述(64 m length sequence capture process, while there is some data through the modem and m describe the sequence of framing processes)
    2010-07-13 17:04:16下载
    积分:1
  • bipso
    围绕粒子群的当前质心对粒子群重新初始化.这样,每个粒子在随后的迭代中将在新的位置带着粒子在上次搜索中获得的“运动惯性”(wvi)向Pi,Pg的方向前进,从而可以在粒子群的运动过程中获得新的位置,增加求得更优解的机会.随着迭代的继续,经过变异的粒子群又将趋向于同一点,当粒子群收敛到一定程度时又进行下一次变异,如此反复,直到迭代结束.(particle swarm around the center of mass of the current PSO reinitialization. Thus, Each particle in the next iteration will be in the new location with particles in the last search was the "inertia" (wvi ) Pi, Pg orientation, and thus can PSO course of the campaign was a new position, increase seek better solutions opportunities. With the continued iteration, after variation of PSO will tend to the same point. When PSO converge to a certain extent when the next variation, so repeatedly, until the end of iteration.)
    2006-08-19 17:39:33下载
    积分:1
  • dn
    说明:  配电网潮流计算(40个节点),采用前推后代的方法(distribution network power flow calculation)
    2015-02-23 11:34:44下载
    积分:1
  • maxsumrateIA
    最大速率的迭代干扰对齐算法,是在原先干扰对齐算法的基础上进行改进(Maximum Sum rate Alternative Minimization)
    2015-04-01 09:43:25下载
    积分:1
  • devitrichy
    about IEEE CAN DO THE POSSIBLE STUDIES ON KALMAN
    2013-11-12 18:45:33下载
    积分:1
  • MMSmteam
    关于排队模型的matlab仿真,里面有M/M/s/k模型的仿真讲解和全部代码,可以供大家学习。(Queuing model simulation on matlab)
    2020-08-26 20:08:20下载
    积分:1
  • 696524资源总数
  • 103920会员总数
  • 65今日下载