登录
首页 » matlab » ARsuanfa

ARsuanfa

于 2013-01-07 发布 文件大小:806KB
0 215
下载积分: 1 下载次数: 1

代码说明:

  这是关于程控方面的一些东西,里面主要供运营商里面的学生学习(This is about SPC some things, it mainly for operators to the inside of the students learning )

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

发表评论

0 个回复

  • images_3
    使用MATLAB语言实现图像均衡化,不调用内部函数(Using the MATLAB language to implement the image equalization, does not call the internal function)
    2010-05-13 20:41:33下载
    积分:1
  • traffic-sign-detection
    使用matlab对交通标志进行定位,以及识别,简单易懂(The use of MATLAB on traffic signs for positioning, as well as identification, easy to understand)
    2017-03-07 20:54:31下载
    积分:1
  • parkiran
    aoutomatic park count
    2009-11-16 10:58:04下载
    积分:1
  • sjs
    车辆信号被动式红外信号的滤波以及能量分析(Vehicle passive infrared signal filtering and signal energy analysis)
    2009-05-13 10:32:38下载
    积分:1
  • Triangle
    Triangle.m: 2D finite element model design tool
    2015-03-05 15:46:42下载
    积分:1
  • classic-epidemic-model
    传染病经典模型si,sis,sir编程以及其图像和实现(Classic model of infectious diseases si, sis, Sir Programming and its image and implementation)
    2013-12-15 11:23:54下载
    积分:1
  • SAR-运动目标
    说明:  侦察无人机搭载SAR设备对运动目标进行跟踪侦察的路径规划。(The path planning of tracking and reconnoitering the moving target with SAR equipment.)
    2020-04-14 10:39:47下载
    积分:1
  • JSPzzj
    已知n个城市之间的相互距离,现有一个推销员必须遍访这n个城市,并且每个城市 只能访问一次,最后又必须返回出发城市。如何安排他对这些城市的访问次序,可使其 旅行路线的总长度最短? (known cities between the distance from the existing one must salesman n visited this city, every city and can only be visited once, finally starting to return to the city. How to arrange for him to visit these cities priorities, it can travel routes, the total length of the shortest?)
    2006-07-25 18:51:49下载
    积分:1
  • MIMO_LDPC_Simulation
    MIMO与LDPC结合,很好的代码,其中是用QCLDPC码,(MIMO and LDPC combination of good code, which QCLDPC code )
    2012-04-20 09:19:09下载
    积分:1
  • clustering_coefficients
    关于复杂网络的聚类系数算法,用matlab计算,矩阵为稀疏矩阵。(clustering_coefficients(A) returns the clustering coefficients for all vertices in A. The clustering coefficient is the ratio of the number of edges between a vertex s neighbors to the total possible number of edges between the vertex s neighbors. )
    2013-01-13 21:29:35下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载