期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
DATA TRANSFORMATION OF FAULT TREE BY USING MATRIX OPERATION 被引量:2
1
作者 CaiJiakun ChenJinshui 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2003年第3期260-263,共4页
On the base of study of the correlation of fault tree's main data-minimum cutsets, minimum path sets, non-intersect minimum cut sets and non-intersect minimum path sets,transformation method among main data are fo... On the base of study of the correlation of fault tree's main data-minimum cutsets, minimum path sets, non-intersect minimum cut sets and non-intersect minimum path sets,transformation method among main data are found, i.e. the transformation can be realized by theoperation of cut sets matrixes. This method provides anew way to reduce 'NP' difficulty and simplifyFTA. 展开更多
关键词 Fault tree Cut sets matrix non-intersect D operation N operation
在线阅读 下载PDF
Fault Tree Analysis of a Launching with Binary Decision Diagram Method and Fuzzy Theory
2
作者 陈浩 姜梅 +1 位作者 晏晶 朱顺鹏 《Journal of Donghua University(English Edition)》 EI CAS 2015年第6期961-964,共4页
Fault tree analysis(FTA),as a structurally simple,visualized and scientific method,is widely used in various fields.To complete the FTA of the launching device,the binary decision diagram(BDD)method is used to obtain ... Fault tree analysis(FTA),as a structurally simple,visualized and scientific method,is widely used in various fields.To complete the FTA of the launching device,the binary decision diagram(BDD)method is used to obtain the non-intersect cut sets,the minimum cut sets and the probability importance of components.Then,the expert evaluation method is applied to solving fuzzy probability rate of bottom event with zero failure data.In this paper,the BDD and expert evaluation method are applied into FTA to analyze a launch device. 展开更多
关键词 binary decision diagram(BDD) non-intersect cut set probability importance fuzzy possibility rate
在线阅读 下载PDF
A COMBINATORIAL ASPECT OF A DISCRETE-TIME SEMI-INFINITE LOTKA-VOLTERRA EQUATION
3
作者 Shuhei KAMIOKA Satoru MIZUTANI 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2010年第1期71-80,共10页
A graph is introduced,which allows of a combinatorial interpretation of a discrete-timesemi-infinite Lotka-Volterra (dLV) equation.In particular,Hankel determinants used in a determinantsolution to the dLV equation ar... A graph is introduced,which allows of a combinatorial interpretation of a discrete-timesemi-infinite Lotka-Volterra (dLV) equation.In particular,Hankel determinants used in a determinantsolution to the dLV equation are evaluated,via the Gessel-Viennot method,in terms of non-intersectingsubgraphs.Further,the recurrence of the dLV equation describing its time-evolution is equivalentlyexpressed as a time-evolution of weight of specific subgraphs. 展开更多
关键词 Combinatorial proofs discrete integrable systems dynamics on graphs Gessel-Viennot method Hankel determinants non-intersecting paths weighted paths on labeled graphs.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部