RayleighFadingSimulati

搜寻最短延时的交织m序列伪码，可选择m序列的长度，自动产生生成多项式(Search for the shortest delay interwoven m PN sequence can choose the length of m sequence, automatically generating polynomial)

关于matlab的编程，主要是plot绘图方面的，请查收！(Matlab programming on the main plot mapping, please check!)

Edge detection result should be enhanced using linear method like Median filter to remove the garbage around the pupil to gain clear pupil to determine perfect centre. Get the centre of the pupil by counting the number of black pixels (zero value) of each column and row. Then get each row and column that has the maximum number of these black pixels. Then determine the center by simple calculation according to the image coordinate to set it correct on the image, consequently we can determine the radius of the pupil. Thus we can find the pupillary boundary (inner). A similar procedure is extended by using a coarse scale to locate the outer boundary (limbus) which can be apparent by using the mid-point algorithms of circle and ellipse.

implementing color detection by using the hue technique

Matlab code for Localization for single mobile attack on wireless network.

利用matlab对802.11协议性能进行分析，改变节点数目以及最小竞争窗口计算吞吐量并做出图像(Using matlab to analyze the 802.11 protocol performance, change the number of nodes and least competitive window to calculate throughput and make the image)

迭代自适应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.)

自己写的一个klman滤波对匀速直线运动物体进行目标跟踪的程序!(himself wrote a klman filter for CV objects target tracking procedures!)

rough set for clustering version 1

基于matlab的k均值算法，程序比较简单，适合初学者学习(Matlab k-means algorithm, the procedure is relatively simple, suitable for beginners to learn)