bearing

说明：  非常好的卡尔曼滤波学习程序。文章中有原题，有解题步骤，有实现程序。适合卡尔曼学习过程中的人。(Very good learning process Kalman filter. The article in the original title, there are problem-solving steps to achieve the procedure. Kalman learning process for people.)

说明：  拓扑优化MMA算法从空间的一个初始设计点出发，沿着某个搜索方向以适当步长的迭代格式 ，实现对设计变量的修改，以获得的值。(Starting from an initial design point in space, the topology optimization MMA algorithm modifies the design variables in an appropriate iterative format along a certain search direction to obtain the optimal value)

对互谱法被动测距的原理及算法各个环节进行仿真验证：加权最小二乘估计中权系数的选取；相关窗长度的选取；各频段综合方法等等。最后实现了对9000m—15000m距离的测距(Cross-spectral method for passive ranging all aspects of theory and algorithms for simulation: weighted least squares estimation of the right of the selection coefficient related to the length of the selection window an integrated approach to the various bands and so on. Finally realize the right of ranging from 9000m-15000m)

计算颤振，使用非定长气动力的方法进行计算，准确可靠(Calculated flutter, the use of non-fixed-length aerodynamic calculation, accurate and reliable)

本程序是采用FDTD算法结合PML吸收边界，对对称三层平板光波导的模式场仿真(This program uses FDTD algorithm and PML absorbing boundary to simulate the mode field of symmetrical three-layer planar optical waveguide.)

根据当前运动模型，进行Kalman滤波。得到滤波优化后的运动轨迹(Kalman filtering is carried out according to the current motion model)

说明：  该LINGO程序的功能是：求出工程项目的收益的净现值和每道工序的最优开工时间，约束条件是紧前紧后约束，以及资源约束。。。(The program' s function is LINGO: the project proceeds to derive the net present value of each procedure and the optimal start time constraints are tight after the former tight constraints, and resource constraints. . .)

统计学习经典教材，面试必备，详细介绍支持向量机、Boosting、最大熵、条件随机场等十个统计学习方法。(Classic textbooks for statistical study are essential for interviews)

基于最小二乘的多项式拟合法的GPS周跳探测程序(Based on the least square polynomial fitting method of GPS cycle slip detection program )

自己在各个论坛上搜集的十大算法，Dijkstra算法，Floyd算法，动态规划，分治算法，概率算法，灰色预测，聚类算法，蒙特卡洛，模拟退火算法，神经网络等等，附有算法的原理，部分含有相关的程序源代码。(In various forums to collect the ten algorithms, Dijkstra algorithm, the Floyd algorithm, dynamic programming, divide and conquer algorithms, probabilistic algorithms, gray prediction, clustering algorithms, Monte Carlo, simulated annealing, neural networks, etc., accompanied by the algorithmthe principle, in part contain the source code.)