sciencedirectpapers

一种关于c4.5的简单matlab编程。(A kind of simple matlab program on c4.5.)

说明：  MUSIC方法是Schmidt 在 1979 年首先提出的,并于1986 年重新发表。该方法和 Roy 于1986 年提出的 Esprit方法都是早期经典的超分辨率 DOA 估计方法 即超瑞利限的方法 ,他们同属特征结构的子空间方法。(MUSIC method is Schmidt first proposed in 1979, and re-released in 1986. The method and Roy in 1986, Esprit proposed methods are early classic super-resolution DOA estimation method that is super-Rayleigh limit of the method, they belong to the same characteristic structure of the subspace method.)

matlab课件，入门教程，很好的！我们学校的教材！(matlab study)

VC实现对MATLAB的调用，对于研究二者混合编程的人比较有用(VC++ implementation of the MATLAB call for the mixture of the two studies were more useful for programming)

image swirl,input angle,fuction and output swirl

QR factorization of an m × n matrix A with m ≥ n is a pair of matrices A = QR

with or without modification, are permitted provided that the following conditions are met

matlab for mathmatics chazhi function

方便准确的计算信号的互相关函数和互相关功率谱密度。(To facilitate accurate calculation of the signal cross-correlation function and cross-correlation power spectral density.)

迭代自适应Simpson，Lobatto积分 In almost every standard book on numerics quadrature algorithms like the adaptive Simpson or the adaptive Lobatto algorithm are presented in a recursive way. The benefit of the recursive programming is the compact and clear representation. However, recursive quadrature algorithms might be transformed into iterative quadrature algorithms without major modifications in the structure of the algorithm. We present iterative adaptive quadrature algorithm (adaptiveSimpson and adaptiveLobatto), which preserves the compactness and the clarity of the recursive algorithms (e.g. quad, quadv, and quadl). Our iterative algorithm provides a parallel calculation of the integration function, which leads to tremendous gain in run-time, in general. Our results suggest a general iterative and not a recursive implementation of adaptive quadrature formulas, once the programming language permits parallel access to the integration function. For details the attached PDF file Conrad_08.pdf. (Iterative Adaptive Simpson, Lobatto Points In almost every standard book on numerics quadrature algorithms like the adaptive Simpson or the adaptive Lobatto algorithm are presented in a recursive way. The benefit of the recursive programming is the compact and clear representation. However, recursive quadrature algorithms might be transformed into iterative quadrature algorithms without major modifications in the structure of the algorithm.We present iterative adaptive quadrature algorithm (adaptiveSimpson and adaptiveLobatto), which preserves the compactness and the clarity of the recursive algorithms (eg quad, quadv, and quadl) . Our iterative algorithm provides a parallel calculation of the integration function, which leads to tremendous gain in run-time, in general. Our results suggest a general iterative and not a recursive implementation of adaptive quadrature formulas, once the programming language permits parallel access to the integration function. For details the attached PDF file Conrad_08.pdf.)