meshgrid-and-other-plot-commands

心电滤波程序及产生噪声心电波形和正常心电波形的程序(ECG noise filtering procedures and have a normal ECG waveform and process ECG waveform)

基于比例积分的蔡氏电路控制仿真，第一平衡点处镇定(Chua s circuit based on proportional integral control simulation, the first stabilization of the equilibrium point)

仿真激光的发光原理和速率方程以及调Q技术(Simulation of laser light-emitting principle and rate equations and Q-technology)

该程序是对声音信号的滤波，采用的是小拨变换滤波，最后画出波形，希望对大家有用(The program is a voice signal filtering, using a small dial transform filtering, the final draw waveform, in the hope that useful)

SVDD的工具箱，可以很好的处理一类分类问题，详见Support Vector Data Description一文(SVDD tools，can be used to process one class classification problem,for more details ,we refer to "Support Vector Data Description")

说明：  非常好的数学建模资料，有matlab实现，数学建模与数学实验（第3版）课件+matlab(Mathematical modeling of very good information, there is matlab implementation, mathematical modeling and mathematical experiment (3rd Edition) courseware+ matlab)

该程序可准确计算出每年（只局限于1900到2099年）复活节的日期。(The date of Easter Day every year could be exactly caculated.The year can only be between 1900 and 2099.)

windows下matlab编程 虚拟现实工具箱(matlab Virtual Reality Toolbox 4.8)

expand axes for matlab

二次规划师非线性优化中的一种特殊情形，它的目标函数是二次实函数，约束函数都是线性函数。由于二次规划比较简单，便于求解（仅次于线性规划），并且一些非线性优化问题可以转化为求解一些列的二次规划问题，因此二次规划的求解方法较早引起人们的重视，称为求解非线性优化的一个重要途径。二次规划的算法较多，本文仅介绍求解等式约束凸二尺规划的拉格朗日方法以及求解一般约束凸二次规划的有效集方法。(Quadratic nonlinear optimization planners in a special case, its real objective function is a quadratic function, constraint functions are linear functions. Because of quadratic programming is relatively simple and easy to solve (after linear programming), and some non-linear optimization problem can be transformed into solving quadratic programming problems some columns, solving quadratic programming method therefore attracted attention earlier, saying an important way for solving nonlinear optimization. More quadratic programming algorithm, this paper describes only two feet Solving the Equality Constrained Convex Programming effective Lagrangian method and set method for solving general constrained convex quadratic programming.)