dim7by7.m

有两个代码文件，是分别计算微带贴片天线设计时背馈和侧馈两种情况下的天线尺寸的，很全很精确！(There are two code files, which separately calculate design of microstrip patch antenna fed back and the side-fed both cases, the antenna size, it is all very precise!)

实现朴素贝叶斯的分类，很好用的，利用matlab编写，不错的程序(Naive Bayes classification, well used, the use of Matlab prepared, a good program)

小波包分析提取振动信号中的特征频率，STM32制作的MP3的全部资料，利用自然梯度算法。( Wavelet packet analysis to extract vibration signal characteristic frequency, STM32 all the information produced by the MP3, Use of natural gradient algorithm.)

说明：  结合matlab强大的数据处理能力和蒙特卡洛方法的强大随机模拟功能，编写了一个小算例(Combining the powerful data processing ability of MATLAB and the powerful random simulation function of Monte Carlo method, a small calculation example is compiled)

Formant_tracker based on LPC Analysis format:[formants]=formant_tracker(input,dimension,step,window_size,p,threshold)

code for communication

通过Matlab编程计算实现的多类微波传输线阻抗在不同条件下阻抗值的计算.(Matlab programming by calculation of the multi-class microwave transmission line impedance under different conditions impedance calculations.)

基于CDMA使用多个伪到整个对象序列嵌入水印恢复(CDMA-based multiple sequence of pseudo-embedded watermark to restore the entire object)

is a small example of how to use a slider and observe and enter the current value in the slider

“基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法，其基本思路为：把各条弧上单位流量的费用看成某种长度，用Floyd求最短路的方法确定一条自V1至Vn的最短路；再将这条最短路作为可扩充路，用求解最大流问题的方法将其上的流量增至最大可能值；而这条最短路上的流量增加后，其上各条弧的单位流量的费用要重新确定，如此多次迭代，最终得到最小费用最大流。 (" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)