-
fn_scramble
To do scrambling and inverser scrambling of array using a key (seed)
- 2010-01-05 15:00:08下载
- 积分：1
-
myaly1_1
matlab源程序，计算系统的相关系数，用于系统各因素的影响度分析。(matlab source code, computing the correlation coefficient for the system factors analysis.)
- 2008-07-03 13:00:57下载
- 积分：1
-
nn2
continue for system identification
- 2011-08-26 16:07:31下载
- 积分：1
-
Research-LTE-A-pre-coding-
本文首先概述了预编码技术的发展历史、基本原理和研究意义。重点介绍了预编码技术在LTE及LTE-A系统中的应用，最后对预编码技术的发展趋势做出预测及综合评论。(This paper outlines the history of pre-coding technology, the basic principles and significance. Focuses on the pre-coding technology in LTE and LTE-A system, and finally to make predictions and comprehensive review on the development trend of the pre-coding technology.)
- 2014-01-07 11:43:35下载
- 积分：1
-
fdtd2D
finite difference time domain 2d code
- 2010-10-30 07:20:18下载
- 积分：1
-
chap1_9
说明： 此程序是变型PID控制算法的仿真程序，采用了变速积分方法，系统偏差大时，积分作用应减小，反之应加强。变速积分可以根据系统误差大小改变积分速度，提高了系统品质。(this procedure is a change in the PID control algorithm simulation program using the variable integration method, the system deviation, the integral role should be reduced, on the contrary should be strengthened. Integral variable speed system error can change the size of integration of speed, quality of the system.)
- 2005-11-13 20:35:00下载
- 积分：1
-
svm
关于支持向量机的很好的学习材料，附有一个基于matlab条件下的小程序。(Support vector machine on a good learning materials, with a little under matlab-based program.)
- 2011-06-27 11:31:11下载
- 积分：1
-
GDOP_6_CD
多星座导航系统GDOP递推特性的仿真程序,程序主要是争对在现有系统中增加2颗其他星座的可见星时GDOP的变化情况组合仿真(GDOP combination of changes in multi-constellation navigation system simulation GDOP recursive feature of the simulation program, the program mainly to fight for increased two existing constellation of visible stars in the existing system...)
- 2015-03-13 10:47:01下载
- 积分：1
-
Rx_uniform
matlab关于多天线相关矩阵的子程序，调用输入为天线间距，到达角度，和角度扩展(matlab on multi-antenna correlation matrix of the subroutine, call input antenna spacing, arrival angle, and angle expansion)
- 2021-04-09 20:48:59下载
- 积分：1
-
0
说明： 给定n种物品和一个背包,物品i的重量是Wi,价值是vi,被包容量是C,应该如何选择装入被包的物品,使得装入背包中物品的总价值最大?对于每种物品i,只有两种选择,装入或者不装入.
输入:第一行两个正整数n(物品数)和C(容量)
第二行n个正整数n,表示物品价值
第三行n个正整数n,表示物品重量
输出:第一行表示总价值
第二行n个数(0/1),0表示物品不装入,1表示装入
例如,
输入:
5 10
6 3 5 4 6
2 2 6 5 4
输出
15
1 1 0 0 1
(Species of a given n items and a backpack, the weight of item i is Wi, the value of vi, was packet capacity is C, should be how to choose a package of items to be loaded, the backpack load in the largest total value of goods? For each item i, there are only two options, loaded or not loaded. Input: the first line of the two positive integer n (the number of items) and C (capacity) of the second line of n positive integer n, that the value of the third line of n positive integer n, that the weight of output: the total value of the first line of the second line, said n number of (0/1), 0 that the items do not load, that load 1 for example, enter: 5,106,354,622 6 5 4 output 15 1 1 0 0 1)
- 2009-07-01 23:07:01下载
- 积分：1
