-
FFT2
进行快速傅里叶变换的程序，可以利用C++或者MATLAB直接完成快速傅里叶变换(Fast Fourier transform for the program can be utilized C++ or MATLAB directly to complete the fast Fourier transform)
- 2013-01-24 15:51:43下载
- 积分：1
-
antparset
Spatial Channel model examples
- 2014-11-18 14:17:41下载
- 积分：1
-
Newton-search-algorithm
使用Matlab coder生成Cpp文件与VC++混合编程实现牛顿搜索算法求n次方根。Matlab使用2011a版本。(Use Matlab coder generates Cpp files with VC++ mixed programming algorithm for n-th Newton root search. Matlab using 2011a version.)
- 2011-11-27 14:50:46下载
- 积分：1
-
GPU_FDTDfdtd
一个GPU的FDTD程序，可以参考一下。(A GPU FDTD procedures, you can refer to.)
- 2014-01-09 17:11:48下载
- 积分：1
-
bios_config
BIOS 的设置与调整一直以来都是电脑使用的热点，尤其是大多数初、中级
用户都希望能够有资料帮助他们，本书以 BIOS 的基础知识为起点，针对主板、
显卡、调制解调器等的 BIOS 设置、升级、优化进行了系统的讲解，教读者如何
通过 BIOS 来达到优化系统、解决常见问题。本书的读者定位为：电脑初、中级
用户。 (BIOS setup and adjust the use of computers has always been hot, especially the majority of the early, intermediate users wish to have information to help them, this book to BIOS basic knowledge as a starting point, for motherboards, graphics cards, modems, BIOS, etc. settings, upgrade, and optimize the system to explain, teach readers how to achieve optimized system BIOS to resolve common problems. Readers of this book as: computer early, intermediate users.)
- 2007-11-07 23:38:15下载
- 积分：1
-
220057140143
信号与系统 相关分析与卷积运算的试验报告上课写的(Signal related to the system analysis and convolution computing class written test report)
- 2008-05-07 10:34:34下载
- 积分：1
-
call2
Persian calender mfile 1392 in matlab
- 2014-02-14 00:26:55下载
- 积分：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
-
RTD2120-.GFF-FILES
RTD2120.rar programing GFF files
- 2013-07-30 20:58:35下载
- 积分：1
-
libc
libc 详细说明了C库里代码的实现过程，里边有详细的注释(detailed description of the C library libc code implementation process, detailed notes inside)
- 2010-03-10 09:32:48下载
- 积分：1
