microstrip_patch_antenna

移动机器人同时定位与地图创建最前沿技术，来自school summer 的培训材料，一共有三个代码包，包括EKF，PF等代码，这是第二部分，主要是关于数据关联（data association）的.(Mobile Robot Localization and Mapping at the same time to create the most cutting-edge technology, from the school summer training materials, a total of three code package, including the EKF, PF and other code, this is the second part, mainly on the data association (data association) of .)

运用matlab求解追赶曲线，绘出追赶和逃跑曲线图形。(Using matlab to solve catching curves, plot the curve to catch up, and escape graphics.)

[sigma,mu,A]=mygaussfit(x,y) [sigma,mu,A]=mygaussfit(x,y,h) this function is doing fit to the function y=A * exp( -(x-mu)^2 / (2*sigma^2) )

说明：  实现了一个音频水印，包括嵌入，提取过程等。包括了原文件。(This source code realized an audio watermarking.It includes the embeding and extracting procedure.Also the original file is in it.)

这是一个典型的流形学习的算法，算法为目前比较经典的一个，可以参考学习流形学习相关的东西(This is a typical manifold learning algorithm, the algorithm can refer to a more classic, the learning manifold learning things)

高斯-赛德尔迭代、超松弛迭代、雅可比迭代。(The approximate solution of a linear equation set by Jacobi,SOR and Gauss_Seidel method.)

说明：  均值类恒虚警检测器（ML-CFAR），包含了平均检测器（CA-CFAR）和最值检测器（GO-CFAR和SO-CFAR），运算速度快，非常适合于单目标的检测(detectors based on mean level constant false alarm rate (ML-CFAR))

matlab m语言的编程，包括m语言的编程基础，C语言转换和外部接口等(matlab m language programming, including m basics of programming language, C language conversion and external interfaces)

基于遗传算法、小波分析和神经网络的混合优化算法！！(A hybrid algorithm of genetic algorithm, based on wavelet analysis and neural network!! )

用单纯形法解线性规划 根据单纯形法的原理，在线性规划问题中，决策变量（控制变量）x1，x2，…x n的值称为一个解,满足所有的约束条件的解称为可行解。使目标函数达到最大值（或最小值）的可行解称为最优解。这样，一个最优解能在整个由约束条件所确定的可行区域内使目标函数达到最大值（或最小值）。求解线性规划问题的目的就是要找出最优解。 (According to the principle of the simplex method, in linear programming problem, the decision variables (control variable) x1, x2,... X n value is called a solution, meet all of the constraint conditions of the solution of the called feasible solution. The objective function to achieve maximum (or minimum) feasible solution of the optimal solution is called. So, an optimal solution by constraint conditions throughout the feasible region determined the objective function to achieve maximum or minimum value). To solve the linear programming problem is to find out the purpose of the optimal solution. )