b

处理文字得到笔画,内有实验图片，实验阶段，可以运行，环境matlab2009a(Word processing to get strokes, there are experimental pictures, the experimental stage, you can run, environmental matlab2009a)

说明：  matlab的初级教程，适用于初级学习的人(matlab primary curriculum for primary learning)

Model Reference Adaptive Control

交流BUCKBOOST拓扑的MATLAB仿真 (AC_BUCK_BOOST )

惯导和多普勒组合滤波器设计的详细程序,其中使用的是卡尔曼滤波技术。(the program of the integrated navigation about SINS and DVL)

加恒定的膜电流,计算0~50ms时间段内 Hodgkin-Huxley模型的积分，并完整地分析和解释所得到的结果(With constant membrane currents, the integral of the Hodgkin-Huxley model in the 0~50ms period is calculated, and the results are fully analyzed and explained)

为了获得更加准确的估计位置,对一种基于数据融合的定位解算算法进行了研究,在将模拟退火算法与经典的泰勒级数展开法和Chan氏算法进行性能比较的基础上,将模拟退火算法与上述两种经典的位置解算算法相结合,通过构造多算法协同定位模型,并基于该模型设计了融合定位算法,对传统定位解算算法进行改进,提出了一种基于数据融合的定位解算算法。仿真结果表明,融合算法的定位精度优于非融合算法且运算量较小(In order to obtain more accurate estimates of the location of a data fusion-based positioning solver algorithm is studied in the simulated annealing algorithm with the classical Taylor series expansion method and Chan' s algorithms performance comparison based on simulated annealing algorithm with the above-mentioned two kinds of classical solution calculate the location of the Combination, by constructing a multi-algorithm co-location model, and model design based on the location of the fusion algorithm, the traditional location solver algorithm is proposed to improve a position based on data fusion solver algorithm. Simulation results show that the positioning accuracy of better than fusion fusion algorithm and the computation of non-small)

从任意一条单边路径开始。所有两点之间的距离是边的权，或者无穷大，如果两点之间没有边相连。 　　2，对于每一对顶点 u 和 v，看看是否存在一个顶点 w 使得从 u 到 w 再到 v 比己知的路径更短。如果是更新它。 　　3，不可思议的是，只要按排适当，就能得到结果。(A unilateral path from any start. All the distance between two points is the right side, or infinity, if there is no edge between two points connected. 2, for each pair of vertices u and v, to see if there is a vertex w from u to w and then to make than the known path v shorter. If you are updating it. 3, incredibly, just press the appropriate row, you can get results.)

Matlab编写的相位展开(相位解缠)，程序实现两种相位展开(相位解缠)的算法，一个是质量图导引路径积分相位展开算法，另一个是Goldstein的枝切法。(2D PHASE UNWRAPPING ALGORITHMS for the phase quality guided phase unwrapping method and Goldstein s branch cut phase unwrapping method)

说明：  源码基于杂交的粒子群算法求解无约束优化问题，主要是各粒子的位置和速度.(Source code based on hybrid particle swarm algorithm for solving unconstrained optimization problems, mainly the particle position and velocity.)