Engineering-Noise-Control--Theory-and-Practice

以网页的形式详细的介绍了MATLAB的基础知识和使用技巧(The form of a web page in detail the basic knowledge of MATLAB and use of skills)

这个代码能够比较精确地实现图像中道路区域的分割与提取。(This code addresses this question by decomposing the road detection process into two steps: the estimation of the vanishing point associated with the main (straight) part of the road, followed by the segmentation of the corresponding road area based upon the detected vanishing point. The main technical contributions of the proposed approach are a novel adaptive soft voting scheme based upon a local voting region using high-confidence voters, whose texture orientations are computed using Gabor filters, and a new vanishing-point-constrained edge detection technique for detecting road boundaries.)

to find a losses in tranmission line

m file matlab program

入侵检测算法，计算机常用的工具，聚类分析(Intrusion detection algorithm, commonly used computer tools, cluster analysis)

LIBSVM使用介绍LIBSVM使用介LIBSVM使用介绍绍LIBSVM使用介绍(LIBSVM use and presentation of LIBSVM use and presentation of the use of IL LIBSVM Shao LIBSVM use and presentation of)

GGGGGKL JHUIU JHYG/II IJUFT LLHGYUF KLULYUG BKUM BGIJH JHU HHHk je m appel helene je suis une fille pas comme les autres

spaital modulation技术相比于v-blast,mrc等方式有了长足的进步。4bit/s/Hz频谱利用率下的空间调制程序，利用BPSK,4QAM和8QAM调制方式。(spaital modulation technique compared to the v-blast, mrc, etc. has made substantial progress. 4bit/s/Hz spatial modulation spectrum utilization under the program, using BPSK, 4QAM and 8QAM modulation.)

MATLAB 牛顿下山法的一个小程序，原理就不详细说了。因牛顿迭代法受初值选取的限制，为防止迭代发散，对迭代过程再附加一项要求:|f(x(k+1))|<|f(x(k))|,将牛顿法迭代的结果:x(k+1) =x(k)-f(x(k))/f (x(k))和前一近似值x(k)适当加权平均做为新的改进值:x(k+1)=u*x(k+1) +(1-u)*x(k),其中u(0<> 迭代时u取1开始，逐次减半计算，直至附加要求符合为止。实例计算中x(k)=x(0)不变，只更新u和x(k+1)，直至:|f(x(k+1))|<|f(x(k))|（即|f(x(1))|<|f(x(0))|)，然后更新下山因子为u=1,继续以牛顿法迭代。(MATLAB Newton-down a small program, the principle is not explained in detail. Newton iteration by the initial value of the selected limit, in order to prevent additional iterative divergence, the iterative process a request: | f (x (k+1)) | < | f (x (k)) | Newton iteration Results: x (k+1) ' = X (k)-f (x (k))/f' (x (k)) and a previous approximation x (k), appropriately weighted average as a new improved value: x (k+1 ) = u* x (k+1) ' + (1-u)* x (k), where u (0 < u> iteration take successive calculated at 50 until the additional requirements found so far. examples of calculation of X ( k) = x (0) unchanged profile u and x (k+1, hungry) until: | f (x (k+1)) | < | f (x (k)) | (i.e. | f (x (1)) | < | f (x (0)) |), then profile downhill factor for u = 1, to continue to Newton iteration.)

fastica的matlab工具箱代码。可以直接调用。(fastica matlab toolbox code. Can be called directly.)