bearing-Analysis

任意倍的插值，从1-5倍得到的等等等等等等等等等等(interplotion)

A High Power Amplifier (HPA) Model known in the literature as SSPA model

利用fragment实现分页效果,左边显示一个，右边显示另一个(The effect of the use of fragment implement paging)

将正弦波与宽带噪声分离开来，并提取正弦波信号(The sine wave and separated from the broadband noise, and extract the sine wave signal)

K中心聚类算法 ，声明：本源程序由网络搜集整理，不承担技术及版权问题! (K center clustering algorithm, the statement: This source collected by the network, does not bear the technical and copyright issues!)

遗传算法编程求解旅行商问题；图论中最短路问题的Matlab程序实现；背包问题模型的Matlab程序实现。(Genetic Algorithm for Solving Traveling Salesman Problem programming graph theory, shortest path problem in the Matlab program implementation knapsack problem Matlab model implementation process.)

非常有用的GPU计算工具gpumat的教材，可以在matlab调用gpu命令(GPU computing very useful tool gpumat materials, you can call the gpu command in matlab)

经典music算法仿真，做毕业设计之类的文章的同学可以参考一下(Classical music algorithm simulation)

说明：  hslogic算法仿真，基于matlab的详细的CDMA系统的仿真与测试(dBS2UE_LargeScale = struct( 'PathLoss',zeros(nNumofSector,nTotalNumofUser),... 'ShadowFading',zeros(nNumofSector,nTotalNumofUser),... 'AntennaGain',zeros(nNumofSector,nTotalNumofUser),... 'TotalPathLossIndB',zeros(nNumofSector,nTotalNumofUser),... 'TotalPathLoss',zeros(nNumofSector,nTotalNumofUser),... 'Distance',zeros(nNumofSector,nTotalNumofUser)... );)

说明：  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.