登录
首页 » matlab » data_acquisition_Simulink

data_acquisition_Simulink

于 2010-09-23 发布 文件大小:7KB
0 108
下载积分: 1 下载次数: 8

代码说明:

  同过SIMULINK采集数据,希望对有需要的人有帮助!(SIMULINK with excessive data collection, want to help people in need!)

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

发表评论

0 个回复

  • ssd
    Scale invariance in Template matching
    2013-11-20 22:12:46下载
    积分:1
  • StOMP-CS
    压缩感知matlab代码及说明,适合初学者学习使用,STOMP算法(Compressed sensing matlab code and instructions for beginners to learn to use, STOMP algorithm)
    2020-11-24 16:29:32下载
    积分:1
  • xaisezengqiangRetinex
    说明:  对彩色图像颜色的拉伸,增强图像的对比度,以便更好的研究图像(Stretch of the color image color to enhance image contrast in order to better study the image)
    2011-03-13 11:13:31下载
    积分:1
  • 蚁群算法的示
    蚁群算法的示例程序,可设定蚂蚁数和组数,可以显示分类结果。(Ant colony algorithm sample program, you can set the number of ants and the group number, you can display the classification results.)
    2011-05-25 22:16:52下载
    积分:1
  • WSN_Leach
    LEACH for Wireless Sensor Networks
    2012-07-10 17:01:10下载
    积分:1
  • control2
    online identification using neural network
    2015-02-10 04:30:55下载
    积分:1
  • CoherentAGC
    non-coherent Reception of BPSK transmission
    2010-06-28 23:13:20下载
    积分:1
  • Canny_edge
    修正的canny算子进行边缘检测提取,具有高的检测率,精确的定位,明确的相应。(Modified canny operator to extract edge detection with high detection rate, accurate positioning and clear accordingly.)
    2011-07-18 20:21:42下载
    积分:1
  • combine---two-binary-trees-
    This is a small program to create indexs for two binary trees and combine them to a new 003 * index tree and output the new tree,the second tree only has the left child tree then 004 * if the first tree has no left child tree,insert the second tree into the first tree as 005 * its left child and if the first tree has the left child tree,then insert the first tree 006 * into the second tree as its left child. (This is a small program to create indexs for two binary trees and combine them to a new 003* index tree and output the new tree, the second tree only has the left child tree then 004* if the first tree has no left child tree, insert the second tree into the first tree as 005* its left child and if the first tree has the left child tree, then insert the first tree 006* into the second tree as its left child.)
    2012-06-11 16:16:55下载
    积分:1
  • java-swing-htmlparser
    a simple HTML scanner and tag balancer that enables application programmers to parse HTML documents and access the information.(a simple HTML scanner and tag balancer that enables application programmers to parse HTML documents and access the information)
    2014-11-12 21:12:06下载
    积分:1
  • 696518资源总数
  • 104384会员总数
  • 26今日下载