登录
首页 » matlab » TaylorAlgorithm

TaylorAlgorithm

于 2012-06-04 发布 文件大小:1KB
0 149
下载积分: 1 下载次数: 11

代码说明:

  这是用来仿真无线定位技术的算法源程序,希望可以帮到大家(This algorithm is used to simulate wireless location technology source, I hope you can help)

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

发表评论

0 个回复

  • ofdm2
    在qpsk调制下实现ofdm的仿真 信道是高斯信道(qpsk ofdm awgn)
    2011-05-05 16:00:09下载
    积分:1
  • PSO-MC
    PSO算法和蒙塔卡洛算法的混合算法,求解非线性方程组。单目标优化问题(Hybrid algorithm of PSO and Monta Carlo algorithms for solving nonlinear equations. Single-objective optimization problem)
    2014-11-30 21:49:12下载
    积分:1
  • feisher
    PCA的步骤: 1 先将数据中心化; 2 求得的协方差矩阵; 3 求出协方差矩阵的特征值与特征向量; 4 将特征值与特征向量进行排序; 5 根据要降维的维数d’,求得要降维的投影方向; 6 求出降维后的数据; (PCA steps: 1 of the first data center 2 covariance matrix obtained 3 obtained covariance matrix eigenvalues and eigenvectors 4 eigenvalues and eigenvectors will be sorted 5 according to the dimension of dimension reduction d ' , seek to reduce the dimension projection direction 6, the data obtained after the dimensionality reduction )
    2010-10-28 11:25:05下载
    积分:1
  • MonteCarlo_Simulations_english
    说明:  在mathworks公司上找到的很好的资料,内有ppt和完整的可运行程序。(Found on the company in mathworks good information and complete within the ppt can run the program.)
    2011-03-09 16:46:42下载
    积分:1
  • small-world-networks
    1998年, Watts和Strogatz 提出了小世界网络这一概念,并建立了WS模型。 实证结果表明,大多数的真实网络都具有小世界特性(较小的最短路径) 和聚类特性(较大的聚类系数) 。 WS小世界模型构造算法 1、从规则图开始:考虑一个含有N个点的最近邻耦合网络,它们围成一个环,其中每个节点都与它左右相邻的各K/2节点相连,K是偶数。 2、随机化重连:以概率p随机地从新连接网络中的每个边,即将边的一个端点保持不变,而另一个端点取为网络中随机选择的一个节点。其中规定,任意两个不同的节点之间至多只能有一条边,并且每一个节点都不能有边与自身相连。 (In 1998, Watts and Strogatz proposed the concept of the small world network, and the establishment of the WS model. The empirical results show that most real networks have small world (the smaller the shortest path) and clustering properties (high clustering coefficient). WS small-world model construction algorithm 1, from the rules FIG: consider a nearest neighbor coupling network with N points, they are surrounded by a ring, wherein each node and its left and right adjacent to each of K/2 connected to the node, K is an even number. The 2 randomized reconnection: randomly with probability p from the new connection on each side of the network, coming section of one of the endpoints remain unchanged, while the other endpoint is taken as the random selection of a node in the network. Which states that between any two different nodes can have at most one edge, and each node can not be connected to its own side.)
    2021-04-27 08:08:44下载
    积分:1
  • LCS
    最长公共子序列的个人实验,输入两个不同的字符序列(要求必须是字母),将输出这两个字符序列的最长公共子序列。(Individual experiments longest common subsequence, enter two different sequences of characters (letters must be required), the output of the longest common subsequence of the two-character sequence.)
    2014-01-11 23:55:57下载
    积分:1
  • crops
    说明:  Crops and non-crops image segmentation using K-MEANS clustering and then classification made by KNN classifier
    2019-03-28 14:06:31下载
    积分:1
  • Pysichal-optics
    基于高频电磁散射的物理光学法用于计算散射目标的RCS (Based on high-frequency electromagnetic scattering of the physical optics method used to calculate the scattering target RCS)
    2020-12-03 11:19:25下载
    积分:1
  • PF
    此程序是计算电力系统潮流的通解,通过支路法不断更新参数(This procedure is the general solution of the power flow calculation, continuously updated through the branch method parameters)
    2013-12-09 15:15:05下载
    积分:1
  • ANM
    目前比较前沿的数值渐近法(Asymptotic Numerical Method)求解弹簧平衡路径算例,直接运行可得计算结果图象。(an example of Asymptotic Numerical Method solving two-dimension spring problem)
    2013-03-26 22:21:19下载
    积分:1
  • 696518资源总数
  • 105877会员总数
  • 14今日下载