-
Gauss_Seide-Matlab
Gauss_Seidel迭代法的Matlab程序 (Gauss_Seidel iteration of the Matlab program)
- 2007-07-08 21:45:14下载
- 积分：1
-
stereoflow
Flow using diffuse connectivity
Research code. Not for commercial use.
If you use this code for results in your papers, please cite:
A roadmap to the integration of early visual modules,
A. S. Ogale and Y. Aloimonos,
International Journal of Computer Vision: Special Issue on Early Cognitive Vision
Usage:
[bestshiftsX, bestshiftsY, occlL, bestshiftsRX, bestshiftsRY, occlR] = flow(iLt, iRt, shiftrangeX, shiftrangeY, alpha)
Created by: Abhijit Ogale (ogale@cs.umd.edu)
- 2010-11-17 01:06:04下载
- 积分：1
-
Estimated-power-spectrum
Levinson算法估计功率谱的MATLAB源程序 含有不同参数情况下的功率谱曲线，含有仿真结果(Levinson algorithm to estimate the power spectrum MATLAB source code contains the power spectral curve, in the case of different parameters contains simulation results)
- 2013-04-10 09:47:14下载
- 积分：1
-
Step-Fourier-method
分步傅里叶算法是非线性薛定谔方程数值求解的一个非常快速的方法(Step Fourier method is a very fast method of numerical nonlinear Schrodinger equation)
- 2014-05-26 07:22:49下载
- 积分：1
-
DigitalBeamforming
各向同性直线阵列的波束形成算法，给出阵元间距、阵元个数、波长、波束指向角度，即可(Isotropic linear array beamforming algorithm to Hsing Yuan spacing, the number of array element, wavelength, beam pointing angle, you can)
- 2007-07-18 16:34:09下载
- 积分：1
-
NumericalMethods
Paolo Brandimartes programs for his book: "Numerical methods in finance and economics: a MATLAB-based introduction" ISBN: "9780471745037"
- 2010-08-26 19:22:04下载
- 积分：1
-
Untitled
线性方程组的cg解法matlab，可以用于cg方法来计算线性方程组(Cg solution of linear equations matlab)
- 2010-11-08 18:18:43下载
- 积分：1
-
WienerScalart96
Wiener滤波matlab程序,望多多指教.(Wiener filtering process, and hopes the exhibitions.)
- 2007-04-15 09:09:27下载
- 积分：1
-
AIEM
改进的积分方程模型，微波遥感领域，用于求土壤的后向散射系数等；该模型为双站散射。(Improved integral equation model, the field of microwave remote sensing, and soil after backscattering coefficient model for bistatic scattering.)
- 2021-03-16 21:29:22下载
- 积分：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
