-
16bit-CLA
a 16 bit carry look ahead adder verilog code
- 2011-01-24 18:57:57下载
- 积分:1
-
main
特征线法(中矩形公式)数值模拟一维不可压缩瞬变流动(Characteristic line method (in the rectangle formula) one-dimensional numerical simulation of transient flow of incompressible)
- 2009-09-15 11:17:21下载
- 积分:1
-
svpwm12345
SVPWM在永磁同步电机上的仿真,很好的与SPWM的仿真形成比较(PMSM simulation based on SVPWM)
- 2009-03-29 09:52:23下载
- 积分:1
-
jidashirandituicanshuguji
v(k)随机信号,输入信号为幅值为M序列程序.利用极大似然递推进行参数辨识,文件的*m文件,可以直接运行,能直接辨识出参数,绘制误差曲线等,程序中带有详细注释。(v (k) random signal, the input signal amplitude for the M series for the process. the use of recursive maximum likelihood parameter identification, documentation* m files, you can directly run directly identified parameters, such as mapping error curve, procedures with detailed notes in.)
- 2009-06-16 09:56:35下载
- 积分:1
-
huffman
哈夫曼编码(huffman)编码,实现了其基本功能(Huffman Coding (huffman) encoding, to achieve its basic functions)
- 2008-06-30 17:56:10下载
- 积分:1
-
toolbox_sparsity
这是一个Matlab实现的图像Sparcy变换的程序,有助于了解多尺度变换。(This is a Matlab implementation of the image Sparcy transformation process, help to understand multi-scale transformation.)
- 2010-05-31 12:08:27下载
- 积分: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
-
Simulated-annealing-algorithm
使用matlab编写的模拟退火算法,经过matlab验证过,程序可以直接拷贝使用(Prepared using matlab simulated annealing algorithm matlab verified through the program can be directly copied using)
- 2013-12-28 14:28:22下载
- 积分:1
-
409DOA
研究阵列信号的算法,Esprit算法的仿真程序,已经测试过了,不错(Algorithm of array signals, Esprit algorithm simulation program, has been tested, and good)
- 2010-06-24 22:24:48下载
- 积分:1
-
optical-flow-method-for-3-D-images
An implementation of Lucas-Kanade optical flow method for 3-D images(This is an implementation of Lucas-Kanade optical flow method for three dimensional images like NIFTI, DICOM etc. A demo with test dataset is given.)
- 2013-10-03 22:28:50下载
- 积分:1