YALMIP

说明：  （蒙特卡洛方法） 求出四分之一圆占正方形的比例。随机投点P(x,y)于正方形，π/4的近似值为落在四分之一圆内的点数与总投点数的比值。随机投点次数分别为10000次和50000次，计算π的近似值。 ((Monte Carlo method) are obtained accounting for a quarter of a round square ratio. Voted random point P (x, y) in the square, π/4 for the fall quarter of the approximation of the points won and the ratio of the total vote points. The number of random points, respectively, voted for the 10000 and 50000 times, the calculation of the approximation of π.)

基于matlab的卡尔曼滤波算法的理论介绍和仿真实践，对于信号处理专业的学生入门有帮助(kalman filtering)

麻省理工学院introduction to matlab课程作业指导，包含matlab实例，相互交流(excellent matlab exercises homework for improving matlab )

无线通信中继协作功率控制相关代码，基于通信资源的有效分配,比如中继选择和功率控制等， 多中继感知协作通信和功率控制技术是无线通信领域中尤为重要。(Wireless communication relay coordination related generation, power control depends on the communication efficient allocation of resources, such as relay selection and power control, relay more cognitive collaborative communication and power control technology is very important in the area of wireless communication. )

基于脉冲耦合神经网络的图像边缘信息提取。基于脉冲耦合神经网络的图像边缘信息提取。基于脉冲耦合神经网络的图像边缘信息提取。(Pulse coupled neural network based on image edge information extraction. Pulse coupled neural network based on image edge information extraction. Pulse coupled neural network based on image edge information extraction.)

steepest descent method

数据挖掘中聚类算法之DBSCAN算法的matlab实现。(Data mining clustering algorithm of DBSCAN algorithm matlab realize.)

这是篇关于matlab环境下的数字滤波器的论文，低通数字FIR滤波器设计与仿真(This is a chapter on the environment matlab digital filter paper, low-pass digital FIR filter design and simulation)

说明：  :针对遗传算法易陷入局部最优的不足,在标准遗传算法基础上加入了三个新的操作- 复原、重构和录优操作,使改 进后的遗传算法收敛于全局最优,并在此基础上以路边约束、动态避障和路径最短作为适应度函数,提出了动态避障的路径 规划方法。通过实验仿真验证了算法的有效性、准确性和实时性,并与基于以往的遗传算法的路径规划方法进行比较,结果 表明本文提出的方法在产生的路径长度和算法运行时间上都具有更优的性能。(: Genetic algorithm for the lack of easy to fall into local optimum, in the standard genetic algorithm based on the insertion of three new operations- rehabilitation, reconstruction, and excellent operational record, so that the improved genetic algorithm converges to the global optimum, and in this by the roadside on the basis of constraints, dynamic obstacle avoidance and the shortest path as the fitness function is proposed dynamic obstacle avoidance path planning method. Simulation results through experiments the effectiveness of the algorithm, accuracy and real-time, and with previous genetic algorithm based path planning method to compare the results show that the method proposed in the resulting path length and algorithms have a running time better performance.)

用MATLAB编写的svm源程序，可以实现支持向量机，用于特征分类或提取(Using MATLAB svm prepared by the source, can achieve a support vector machine for classification or feature extraction-MATLAB)