jpcx

Perl 语言编程 第三版 作者:Larry Wall, Tom Christiansen, and Jon Orwant 译者:何伟平 (The third edition of the Perl programming language: Larry Wall, Tom Christiansen, and Jon Orwant Translator: weipin)

使用Matlab計算AHP分析, 特徵值與特徵像量, 計算最佳決策分案選擇(To use the Matlab calculation AHP analysis, Eigenvalues ​ ​ and like, calculate the divisional selection of the best decisions)

说明：  尿沉渣图像识别，采用形态学图像分割，som进行识别！(urine image recognition, image segmentation using morphological, som identification!)

说明：  现代信号处理中的LMS算法和RLS算法的MATLAB仿真(Modern Signal Processing LMS algorithm and RLS algorithm MATLAB simulation)

LEACH (Low Energy Adaptive Clustering Hierarchy) is designed for sensor networks where an end-user wants to remotely monitor the environment. In such a situation, the data from the individual nodes must be sent to a central base station, often located far from the sensor network, through which the end-user can access the data. MODIFIED LEACH IS ENHANCED VERSION OF LEACH PROTOCOL TO SAVE ENERGY.

it is calll for lots of data set for lda

利用频域并行的方法对GPS的C码捕获的方法进行了仿真。直接解压就可以了。(frequency domain using the method of parallel GPS C code acquisition of the simulation methods. Decompression directly on it.)

多载波复用信道估计包括mmse，ls lmmse(The whole system simulation ofdm ls,mmse,lmmse)

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.

This file consists of matlab codes for a DEA optimization problem using fast algorithms of cplex