登录
首页 » matlab » random_position

random_position

于 2011-04-03 发布 文件大小:1KB
0 153
下载积分: 1 下载次数: 2

代码说明:

说明:  关闭OFDM信号子载波,画出OFDM信号频谱图,查看旁瓣泄露情况(Close OFDM signal sub-carrier OFDM signal spectrum plot, view the situation sidelobe leakage)

文件列表:

random_position.m,1629,2011-04-02

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

发表评论

0 个回复

  • fitness
    fitness,适应度函数,计算适应度函数,(fitness, fitness function, calculate the fitness function,)
    2012-08-24 21:05:34下载
    积分:1
  • LMS_ADV
    lms系统逆辨识的实现,有个延时需要自己加上(lms against the identification system to achieve, there is a need to delay added by)
    2011-12-02 00:36:08下载
    积分:1
  • gauss-seidel
    二维热传导扩散方程的高斯-赛德尔迭代方法。(A two-dimensional thermal diffusion problem using Gauss-Seidel iteration method.)
    2021-01-18 14:28:44下载
    积分:1
  • 7ef682d55cf0社会力模型
    说明:  行人群体疏散仿真的社会力模型,可用于做系统仿真(Social force model for pedestrian evacuation)
    2021-03-19 16:59:19下载
    积分:1
  • FFRLS
    利用遗忘因子递推最小二乘法做的参数估计,介绍还算详尽(Forgetting factor recursive least squares method using the parameter estimates do)
    2020-11-27 15:09:30下载
    积分:1
  • 11087 统逆序对
    Description 设a[0…n-1]是一个包含n个数的数组,若在i<j的情况下,有a[i]>a[j],则称(i, j)为a数组的一个逆序对(inversion)。 比如 <2,3,8,6,1> 有5个逆序对。请采用类似“合并排序算法”的分治思路以O(nlogn)的效率来实现逆序对的统计。 一个n个元素序列的逆序对个数由三部分构成: (1)它的左半部分逆序对的个数,(2)加上右半部分逆序对的个数,(3)再加上左半部分元素大于右半部分元素的数量。 其中前两部分(1)和(2)由递归来实现。要保证算法最后效率O(nlogn),第三部分(3)应该如何实现? 此题请勿采用O(n^2)的简单枚举算法来实现。 并思考如下问题: (1)怎样的数组含有最多的逆序对?最多的又是多少个呢? (2)插入排序的运行时间和数组中逆序对的个数有关系吗?什么关系? 输入格式 第一行:n,表示接下来要输入n个元素,n不超过10000。 第二行:n个元素序列。 输出格式 逆序对的个数。 输入样例 5 2 3 8 6 1 输出样例 5(Set a[0... N-1] is a n array containing n numbers. If there is a [i] > a [j] i n the case of I < j, then (i, j) is a n inversion pair of a array. For example, <2,3,8,6,1> has five reverse pairs. Please use the idea of "merge sorting algorithm" to achieve the statistics of inverse pairs with O (nlogn) efficiency. The number of inverse pairs of a sequence of n elements consists of three parts: (1) The number of reverse pairs in the left half, (2) the number of reverse pairs in the right half, (3) the number of elements in the left half is greater than that in the right half. The first two parts (1) and (2) are implemented by recursion. To ensure the final efficiency of the algorithm O (nlogn), how should the third part (3) be implemented? Do not use O (n ^ 2) simple enumeration algorithm to solve this problem.)
    2019-01-07 23:52:06下载
    积分:1
  • LINESLIDER
    线接触滑块的计算方法,给定雷诺方程和膜厚方程,然后用迭代方法计算压力分布和膜厚分布,以及承载能力(The calculation method of the line contact of the slider, a given Reynolds equation and the film thickness of the equation, and then calculated using iterative methods, pressure distribution and film thickness distribution, as well as carrying capacity)
    2020-12-10 09:19:18下载
    积分:1
  • Unconstrained-directly
    基于GWBASIC实现的无约束寻优算法,内附GWBASIC主程序和说明(Non-binding on GWBASIC achieve optimization algorithm, the main program and instructions included GWBASIC)
    2011-09-25 19:18:07下载
    积分:1
  • janming_v79
    随机调制信号下的模拟ppm,阐述了负荷预测的应用研究,是国外的成品模型。( Random ppm modulated analog signal under It describes the application of load forecasting, Foreign model is finished.)
    2016-11-24 21:16:27下载
    积分:1
  • cylinder
    计算圆柱绕流的有限体积法计算程序 fortran编写 (Calculating flow around a cylinder)
    2013-07-04 21:35:42下载
    积分:1
  • 696518资源总数
  • 105885会员总数
  • 31今日下载