登录
首页 » matlab » SINS_DV

SINS_DV

于 2012-09-20 发布 文件大小:5049KB
0 283
下载积分: 1 下载次数: 137

代码说明:

  matlab编写的轨迹发生器用于制造原始数据(matlab write the trajectory generator used in the manufacture of the raw data)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • cyclostationary_toolbox
    matlab循环谱分析工具箱,其中包含cyclic_4th_order_cumulant,cyclic_autocorrelation_fast等函数(cyclic spectral analysis toolbox )
    2011-01-11 22:25:12下载
    积分:1
  • pso
    基本粒子群算法源代码,欢迎大家下载使用,谢谢支持!(Particle swarm optimization source code, welcome to download and use, Thank you!)
    2011-01-25 12:23:02下载
    积分:1
  • GO_detection
    在高斯杂波条件下的平均单元选大恒虚警处理(GO-CFAR under gauss clutter)
    2011-07-13 00:07:47下载
    积分:1
  • EKF
    This code is used for trajectoru tracking using EKF.
    2014-10-01 15:22:25下载
    积分:1
  • duoyuandanfenghanshuyouhua
    利用遗传算法的选择、交叉、变异功能来解决多元单峰函数求最优值问题(The use of genetic algorithm selection, crossover and mutation function to solve the multi-function uation unimodal optimal value problem)
    2015-03-16 16:20:04下载
    积分:1
  • ABQ
    这是电网、理论中实现矩阵快速变换的程序代码,附有使用说明书,技术说明(This is a grid, matrix theory, to achieve rapid transformation of the program code, with the use of brochures, technical notes)
    2009-12-16 23:44:10下载
    积分:1
  • M_Files
    一个matlab里面用的很好用的小工具 是用来算出den,num以及一切zplane的(Matlab inside with a good used small tools are used to calculate the den, num, as well as all the zplane)
    2007-11-12 10:39:59下载
    积分:1
  • Matlab_zuixiaofeiyong
    最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.(Minimum cost maximum flow algorithm general Matlab functions The basic idea of ​ ​ the shortest path algorithm of Ford and Fulkerson superposition algorithm based on Floyd: the cost of unit flow on the arc as a certain length of Floyd and the shortest path method to determine the one percent self-V1 to the Vn the most short-circuit and then the this Article is the most short-circuit as a can be the expansion Lu, to use solving the method of the the the problem of the maximum flow will its on the stream the amount of increased to the maximum possible values while the the the the flow of of this Article of the shortest on the road increase, the costs of the unit of flow on each arc sure, so many iterations, the final minimum cost maximum flow.)
    2012-07-27 14:55:22下载
    积分:1
  • cyclic
    Cyclostationary feature analysis
    2014-01-27 13:55:42下载
    积分:1
  • 使用了五种函数进行了对比,有数据算例
    说明:  bilstm saelstm lstm 使用了五种函数进行了对比,有数据算例。可以多输入,也可以单输入。(Comparison of five neural network algorithms)
    2021-04-21 21:38:49下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载