检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李想[1] 路靖雯 易鹤 LI Xiang;LU Jingwen;YI He(School of Economics and Management,Beijing University of Chemical Technology,Beijing 100029)
出 处:《系统科学与数学》2023年第6期1377-1388,共12页Journal of Systems Science and Mathematical Sciences
基 金:国家自然科学基金(72001016,71931001,71722007);北京化工大学引进人才项目(buctrc202102);北京化工大学一流学科建设专项资金(XK1802-5)资助课题。
摘 要:n中取连续k型冗余系统的结构刻画与指标计算是可靠性领域中的热点和难点问题.文章构建了共用部件的线形n中取m个(含稀疏d的)连续k的F系统模型,基于有限马尔可夫链嵌入法提出了系统联合可靠度与联合Signature的计算方法.此外,文章基于共用部件的n中取m个(含稀疏d的)连续k的F系统模型研究了智慧路灯系统的可靠度计算和结构比较问题,不仅通过传统定义法验证了有限马尔可夫链嵌入法的正确性,还说明了有限马尔可夫链嵌入法在大规模智慧路灯系统联合可靠度和联合Signature计算问题中的可用性.因此,文章研究的模型与方法可以为工程实践中共用部件的冗余系统提供可靠性评估和管理决策依据.The structure description and index evaluation of consecutive-k-out-of-n type redundant systems is a key and difficult issue in the field of reliability.In this paper,we establish a model of two linear m-consecutive-k-out-of-n:F systems with sparse d that sharing components.Based on the finite Markov chain imbedding approach,an evaluation method for the joint reliability function and the joint signature is proposed.In addition,we study the reliability evaluation and the structure comparison of smart street light systems based on the model of m-consecutive-k-out-of-n:F systems with sparse d that sharing components,which not only verifies the correctness of the finite Markov chain imbedding approach by the traditional definition method,but also shows that it can be applied to the evaluation of the joint reliability and the joint signature for large smart street light systems.Therefore,the model and the method studied in this paper can provide the basis of reliability evaluation and management decision for redundant systems with shared components in engineering application.
关 键 词:n中取连续k型系统 有限马尔可夫链嵌入法 联合可靠度 联合Signature 智慧路灯系统
分 类 号:O211.62[理学—概率论与数理统计]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30