EMD

信号盲分离算法中的一种：最大信息化算法，该算法是基本算法，在此改进的基础上可以得到很多改进算法(Blind signal separation algorithm in one: the maximum information algorithm, which is the basic algorithm, based on this improved algorithm can be improved a lot)

matlab求解TSP问题源代代码，程序可动态显示路径寻优过程 (matlab source code for solving the TSP problem, the prrogram can show the path of dynamic process optimization )

说明：  用于提取信号的时频域特征参数，比如信号均值、方差、以及一些无量纲的时域特征参数(Time-frequency domain characteristic parameters used to extract signals, such as signal mean, variance, and some dimensionless time domain characteristic parameters)

CBCGPChartCtrl 简单使用，包括图片效果。(CBCGPChartCtrl simple to use, including pictures effect.)

Ansoft HFSS Tutorial: Stripline

自己编写的一个mfa模块，能仿真没有零极点的模型，供大家交流(I have written a mfa module can emulate them some hope a lot of pointing Great God)

显示色谱图和小波变换的matlab演示代码，效果不错，欢迎查看(show matlab code ,good ,welcome to download)

Simulation of Hydraulic System

?Ideal solution to add 802.11n to broadband platforms ?Cost effective, High performance, 802.11n AP/Router WLAN SoC ?Simple 802.11n integration to Ethernet equipped device Overview RT2880 MIMO Wireless Access Point/Router/iNIC SoC 802.11n 2T3R Solution featuring MIMObility?Technology

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