-
solvecone
Conical flow field solver
- 2013-07-20 23:15:49下载
- 积分：1
-
Fig215_ErgodicCapacityVsNumberOfAntennas
c est un code matlab qui compare les différentes systèmes Multi-antennes MIMO MIMSO SIMO SISO de point de vue Capacité
- 2013-11-01 19:22:44下载
- 积分：1
-
script_ber_mimo_zf_bpsk_rayleigh_channel
script_ber_mimo_zf_bpsk_rayleigh_channel montre la performance de egaliseur zf avec mimo
- 2009-04-10 19:58:32下载
- 积分：1
-
cap_turbo
TURBO码的MATLAB源程序，包括流程和子程序。(TURBO MATLAB source code, including the processes and routines.)
- 2006-06-06 23:51:11下载
- 积分：1
-
mimo
3.9G关键技术MIMO性能的MATLAB仿真分析(3.9G MIMO performance of key technical analysis of MATLAB simulation)
- 2011-09-11 15:17:02下载
- 积分：1
-
0.618_(1)
无约束优化,基于黄金分割的最速下降法极小化函数(Unconstrained optimization, based on the steepest descent method minimization function)
- 2012-04-10 19:40:11下载
- 积分：1
-
henonx
Simulates the Henon map
- 2014-09-14 10:59:30下载
- 积分：1
-
ISAR_by727
波音727飞机数据和ISAR仿真程序，处理相对简单，希望高手能够加以改进。(Boeing 727 aircraft ISAR simulation data and procedures to deal with relatively simple, hope master can be improved.)
- 2020-11-16 14:39:40下载
- 积分：1
-
2
说明： 有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。
现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。
可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。
输入：
两个整数L(1<=L<=10000)和M(1<=M<=100)。
接下来有M组整数，每组有一对数字。
输出：
可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 < = L < = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 < = M < = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 < = L < = 10000) and M (1 < = M < = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)
- 2015-03-22 23:35:47下载
- 积分：1
-
apriori
matlab实现推荐系统Apriori算法(recommendation system)
- 2015-04-07 09:48:17下载
- 积分：1
