shili55

说明：  神经网络pid的模型仿真建立，可以有效的控制参数(The model simulation of neural network PID can effectively control parameters)

关于OMP,希望对大家哟偶所帮助。我也会高兴的( itisaboutOMP，i hope you can use it .)

An ad-hoc network with a sender, a destination and a third station act- ing as a relay is analysed. The channels are modelled containing thermal noise, Rayleigh fading and path loss. Di® erent combining methods and di- versity protocols are compared. The amplify and forward protocol shows a better performance than the decode and forward protocol, unless an error correcting code is simulated. To combine the incoming signals the chan- nel quality should be estimated as well as possible. Information about the average quality shows nice bene¯ ts, and a rough approximation about the variation of the channel quality increases the performance even more. What- ever combination of diversity protocol and combining method is used second level diversity is observed. The relative distances between the relay and the stations has a large e® ect on the performance.

采用matlab编程的DTMF检测程序仿真，经过测试，绝对可用，可检测多个DTMF信号！(using Matlab programming DTMF detection process simulation, tested and absolutely can be used, can detect DTMF signals over!)

阵列信号的信源数目估计——AIC，MDL，HQ，EDC法得比较(Array signal source number estimation- AIC, MDL, HQ, EDC method comparatively)

The person face distinguishes the PCA code, MATLAB writes. ,matlab(The person face distinguishes the PCA code , MATLAB writes. , Matlab)

斯坦福大学的原始对偶内点法软件包,权威之作！(primal dual interier point algorithm)

Histogram of Orientated Gradients for gray-level images

著名的Jade算法，利用高阶累积量盲分离。法国Cardoso发明的算法。(famous algorithm, using Cumulant Blind separation. France Cardoso invented the algorithm.)

  最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.( Minimum cost maximum flow algorithm for general Matlab functions based on the Floyd shortest path algorithm of Ford and Fulkerson superposition algorithm of the basic ideas: the cost of unit flow on the arc as a certain length of Floyd for the most short-circuit method to determine the one percent V1 through Vn are the most short-circuit then this short circuit as a scalable road, a method for solving the maximum flow problem on flow increased to the maximum possible value that the shortest way increased traffic, the cost of unit flow on each arc sure, so many iterations, the final minimum cost maximum flow.)