-
140198-11
KEB COMBIVERT
The MS-Repeater (Part. No.: 00.F4.072-2008) is for connection and
amplification of incremental encoder signals during master-slaveoperation.
- 2014-12-30 16:08:27下载
- 积分：1
-
HUONG
说明： simulation ldpc by matlab
- 2020-06-26 18:20:02下载
- 积分：1
-
ai_RayCh
无线通信中采用Dent模型的瑞利衰落信道产生器(Dent model used in wireless communications, Rayleigh fading channel generator)
- 2010-07-09 17:49:55下载
- 积分：1
-
Communication_system_design
一个利用matlab simulink仿真简化通信系统的模型。里面m文件为simulink模块参数设置，适合通信基础浅的人理解通信概念同时上手simulin学习(Matlab simulink simulation using a simplified model of communication system. M files inside simulink module parameters for setting suitable person communication shallow understanding of basic concepts of communication at the same time started studying simulin)
- 2009-03-30 20:28:20下载
- 积分：1
-
LMSComparision
Its a comparison of convergence rate of about all variants of LMS algos
- 2009-10-29 16:37:01下载
- 积分：1
-
ASk_test
2ASK信号的正交解调，包括2ASK信号的产生，与本地载波混频，低通滤波，求包络，恢复出原始信号等(the demodulation of 2ASK)
- 2014-02-24 16:40:32下载
- 积分：1
-
zhouqi_jianjie
用间接周期图法，分别对有噪声和无噪声的信号进行谱估计。(Indirect cycle diagram, respectively noise and noise-free signal spectrum estimation.)
- 2015-01-07 12:40:49下载
- 积分：1
-
bsvm
两类支持向量机,用于分两类的问题其中是带有类别的结构体类型数据(binary svm)
- 2011-05-01 16:58:07下载
- 积分：1
-
Deploy-Nodes
节点定位，仿真锚节点和未知节点的定位，用不同的符号表示。(Deploy Nodes………………………………)
- 2012-04-24 12:15:56下载
- 积分：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
