getConductingCylinderScatteringWidth

MATLAB图形用户界面的几点思考,很不错的(MATLAB graphical user interface Reflections)

matlab code of PV array

说明：  2015全国研究生数学建模，列车调度问题源代码(The code of National graduate mathmatical modeling competition about train schedule problem )

拟合函数为 g(x)=0.52253+7.90342*x-7.129385*sin(x)(Fitting function for g (x) = 0.52253+7.90342* x-7.129385* sin (x))

This code has been prepared for earning Radar Cross Section of cylindrical PEC objects.

说明：   学习matlab的朋友，这是一个计算线性方程组的程序，略有改进，若有疑问不吝赐教(learning Matlab friends, which is a calculation of linear equations procedures, a slight improvement If in doubt wing)

results than conventional LBP based schemes.Several observations can be made for CLBP. First, LBP is aspecial case of CLBP by using only CLBP_S. Second, we willshow that the sign component preserves more image localstructural information than the magnitude component. Thisexplains why the simple LBP (i.e. CLBP_S) operator worksmuch better than CLBP_M for texture classification. Third, theproposed CLBP_S, CLBP_M and CLBP_C code maps have

实现ECG和BCG信号采集和同步监测，对采集的信号进行了特征量提取并作出相应诊断，波形显示在液晶屏上。(Achieve ECG and BCG signal acquisition and simultaneous monitoring of the collected signals feature extraction and make the appropriate diagnosis, the waveform displayed on the LCD screen.)

非常经典的7自由度车辆动力学模型，用于车辆动力学分析（需要matlab2008以前的版本打开运行）。(Very classic 7 degrees of freedom vehicle dynamics model for vehicle dynamics analysis (need matlab2008 previous versions open run).)

This paper describes two digital implementations of a new mathematical transform, namely, the second generation curvelet transform [12, 10] in two and three dimensions. The first digital transformation is based on unequally-spaced fast Fourier transforms (USFFT) while the second is based on the wrapping of specially selected Fourier samples. The two implementations essentially differ by the choice of spatial grid used to translate curvelets at each scale and angle. Both digitaltransformations return a table of digital curvelet coefficients indexed by a scale parameter, anorientation parameter, and a spatial location parameter. And both implementations are fast in the sense that they run in O(n2 log n) flops for n by n Cartesian arrays in addition, they are also invertible, with rapid inversion algorithms of about the same complexity.