-
Codes
this code is implementation of Implicit Active Contours Driven by Local Binary Fitting Energy in matlab environement.
I used this code and it was correct. this codes is free by its author and use it dont have any problem.
- 2014-08-14 14:43:08下载
- 积分：1
-
chaoliujisuan
说明： 关于电力系统中潮流计算中的节点导纳矩阵Y的计算(Node Admittance Matrix Computation)
- 2019-05-06 16:11:23下载
- 积分：1
-
KFandPF
卡尔曼滤波器和粒子滤波器的MATLAB演示程序(Kalman filters and particle filters MATLAB demo)
- 2009-01-28 09:34:44下载
- 积分：1
-
CP0201
matlab仿真,超宽带信号中,等概率二进制产生,重复码编码,th编码,PPM-TH调制,脉冲形成器,PPM-TH发射器等源程序.(matlab simulation, ultra-wideband signals, such as the probability of binary generation, duplicate coding, th coding, PPM-TH modulation, pulse forming device, PPM-TH transmitters, such as source code.)
- 2009-03-05 20:00:23下载
- 积分：1
-
RLS
自己编写的递推增广最小二乘算法，有意者可以参考(I have written Recursive Extended Least Squares algorithm, Interested parties can refer to the)
- 2009-11-28 14:28:09下载
- 积分：1
-
matlab-of-image-processing
本书讲述了运用matlab处理图像，适合初学者，并包含源程序。(The book tells the story of the use of matlab image processing, suitable for beginners, and includes source.)
- 2014-11-19 17:07:50下载
- 积分：1
-
tm_open
this is a FDTD with PML ABC for infinite linear source...
- 2012-10-14 07:41:36下载
- 积分：1
-
MODIFIED-SIMULINK
conventional simulink statcom
- 2013-12-12 17:26:30下载
- 积分：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
-
gsm_duc
8载gsm
duc实例
matlab实例(8gsm duc)
- 2011-01-04 15:32:34下载
- 积分：1
