登录
首页 » matlab » petri-net-matlab-simulate

petri-net-matlab-simulate

于 2011-05-02 发布 文件大小:139KB
0 245
下载积分: 1 下载次数: 146

代码说明:

  本文介绍了在matlab环境下进行Petri网模型仿真的方法(This article describes the environment in matlab Petri net model for the simulation method)

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

发表评论

0 个回复

  • PVmodule
    Based on mathematical and physical model to get the simulated I-V curve
    2013-10-29 18:57:29下载
    积分:1
  • 2
    基于动态切换函数的动态滑模控制,二阶系统仿真(Dynamic sliding mode control based on dynamic switching function,The second order system simulation)
    2013-10-11 16:27:39下载
    积分:1
  • optimal-beamforming
    针对均匀线形阵列的阵列波束综合问题,并把这一问题描述成一个凸优化问题。针对更普适的情况。 (For array pattern synthesis problem, and describe it as a convex optimization problem.)
    2013-12-16 19:34:52下载
    积分:1
  • power_wind_ig
    power wind generation
    2012-11-10 16:22:45下载
    积分:1
  • MIMO
    本程序主要仿真MIMO系统的ZF以及MMSE算法,在不同信噪比下的误码率。(This program mainly ZF and MMSE algorithm of multi-input multi-output (MIMO) system simulation, under different SNR ber.)
    2015-03-30 19:41:01下载
    积分:1
  • MPSK2
    mpsk的matlab仿真实现 ,供初学者使用参考(MPSK Simulation of matlab for beginners to use reference)
    2008-12-28 16:58:53下载
    积分:1
  • 20067711511036675
    matlab例程,非常好用,便以移植,bianyuxuxi(susan Algorithm is very easy to use, then to transplant)
    2009-04-26 16:57:48下载
    积分:1
  • MATLAB
    MATLAB课件 是比较好的一份MATLAB课件 很细很详细(MATLAB software)
    2009-07-05 15:22:14下载
    积分:1
  • IEEE_33bus2
    IEEE 33-bus with pq loads in psat format using simulink
    2014-06-26 20:35:18下载
    积分:1
  • fs_sup_relieff
    Relief算法中特征和类别的相关性是基于特征对近距离样本的区分能力。算法从训练集D中选择一个样本R,然后从和R同类的样本中寻找最近邻样本H,称为Near Hit,从和R不同类的样本中寻找最近样本M,称为Near Miss,根据以下规则更新每个特征的权重: 如果R和Near Hit在某个特征上的距离小于R和Near Miss上的距离,则说明该特征对区分同类和不同类的最近邻是有益的,则增加该特征的权重;反之,如果R和Near Hit在某个特征上的距离大于R和Near Miss上的距离,则说明该特征对区分同类和不同类的最近邻起负面作用,则降低该特征的权重。(The correlation between feature and category in Relief algorithm is based on distinguishing ability of feature to close sample. The algorithm selects a sample R from the training set D, and then searches for the nearest neighbor sample H from the samples of the same R, called Near Hit, and searches for the nearest sample M from the sample of the R dissimilar, called the Near Miss, and updates the weight of each feature according to the following rules: If the distance between R and Near Hit on a certain feature is less than the distance between R and Near Miss, it shows that the feature is beneficial to the nearest neighbor of the same kind and dissimilar, and increases the weight of the feature; conversely, if the distance between R and Near Hit is greater than the distance on R and Near Miss, the feature is the same. The negative effect of nearest neighbor between class and different kind reduces the weight of the feature.)
    2018-04-17 14:41:55下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载