登录
首页 » matlab » UT4XLabel

UT4XLabel

于 2012-11-27 发布 文件大小:1KB
0 196
下载积分: 1 下载次数: 6

代码说明:

  该程序用于OMNI数据库中数据的时间格式坐标转换(The procedures used for the the OMNI database in data time format coordinate conversion)

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

发表评论

0 个回复

  • cc7
    吊车双摆系统的仿真 说明了pid控制方法的局限性(Crane double pendulum system simulation illustrates the limitations of pid control)
    2007-08-15 19:59:22下载
    积分:1
  • horizontal
    Vertical Lines detection
    2010-12-02 02:47:17下载
    积分:1
  • image-stitch
    使用Harris角点检测方法进行图像特征点提取,NCC描述的方法进行粗匹配,再使用RANSAC算法进行精匹配。(Using Harris corner detection method for image feature point extraction, NCC description of the method of rough matching, and then use the RANSAC algorithm for fine matching. )
    2016-12-08 20:01:00下载
    积分:1
  • matlab_tabu_job_scheduling
    求解单机成组作业,基于TOC理论,多目标优化(To solve job scheduling on single machine)
    2009-10-01 10:28:16下载
    积分:1
  • 1st
    Simulink工具编写代码(MATLAB Function方式),产生一单径瑞利信道,其多普勒谱为经典谱,其中移动速率为120km/h,含理论描述多普勒经典谱(Simulink tools for writing code (MATLAB Function mode) to produce a single path Rayleigh channel, the Doppler spectrum for the classical spectrum, where mobile speed of 120km/h, with the classical theoretical description of Doppler spectrum)
    2010-10-21 11:38:39下载
    积分:1
  • FDK
    projection and backprojection
    2013-11-05 21:19:11下载
    积分:1
  • optim
    多变量非线性优化模型求解,对约束条件建立m文件(Multi-variable nonlinear optimization model for solving the establishment of restrictive conditions on m file)
    2009-04-18 21:45:14下载
    积分:1
  • pca_demo
    编写PCA算法的程序,对想要学习如何利用PCA算法进行故障诊断的同学很有帮助!( a PCA algorithm program, for the person who want to learn how to use PCA algorithm for fault diagnosis of classmates the progran is very helpful!)
    2013-05-09 17:29:46下载
    积分:1
  • BeamVibCon
    采用LQR方法的悬臂梁振动主动控制的matlab程序(LQR method using active vibration control matlab program cantilever)
    2013-06-09 17:11:15下载
    积分:1
  • knn1
    K最邻近密度估计技术是一种分类方法,不是聚类方法。 不是最优方法,实践中比较流行。 通俗但不一定易懂的规则是: 1.计算待分类数据和不同类中每一个数据的距离(欧氏或马氏)。 2.选出最小的前K数据个距离,这里用到选择排序法。 3.对比这前K个距离,找出K个数据中包含最多的是那个类的数据,即为待分类数据所在的类。(K nearest neighbor density estimation is a classification method, not a clustering method. It is not the best method, but it is popular in practice. Popular but not necessarily understandable rule is: 1. calculate the distance between the data to be classified and the data in each other (Euclidean or Markov). 2. select the minimum distance from the previous K data, where the choice sorting method is used. 3. compare the previous K distances to find out which K data contains the most data of that class, that is, the class to which the data to be classified is located.)
    2017-08-09 21:06:38下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载