期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
System level test selection based on combinatorial dependency matrix 被引量:1
1
作者 YANG Peng XIE Haoyu QIU Jing 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2021年第4期984-994,共11页
Test selection is to select the test set with the least total cost or the least total number from the alternative test set on the premise of meeting the required testability indicators.The existing models and methods ... Test selection is to select the test set with the least total cost or the least total number from the alternative test set on the premise of meeting the required testability indicators.The existing models and methods are not suitable for system level test selection.The first problem is the lack of detailed data of the units’fault set and the test set,which makes it impossible to establish a traditional dependency matrix for the system level.The second problem is that the system level fault detection rate and the fault isolation rate(referred to as"two rates")are not enough to describe the fault diagnostic ability of the system level tests.An innovative dependency matrix(called combinatorial dependency matrix)composed of three submatrices is presented.The first problem is solved by simplifying the submatrix between the units’fault and the test,and the second problem is solved by establishing the system level fault detection rate,the fault isolation rate and the integrated fault detection rate(referred to as"three rates")based on the new matrix.The mathematical model of the system level test selection problem is constructed,and the binary genetic algorithm is applied to solve the problem,which achieves the goal of system level test selection. 展开更多
关键词 test selection dependency matrix fault detection rate testability prediction binary genetic algorithm
在线阅读 下载PDF
Uncertain bilevel knapsack problem and its solution
2
作者 Junjie Xue Ying Wang Jiyang Xiao 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2017年第4期717-724,共8页
This paper aims at providing an uncertain bilevel knapsack problem (UBKP) model, which is a type of BKPs involving uncertain variables. And then an uncertain solution for the UBKP is proposed by defining PE Nash equil... This paper aims at providing an uncertain bilevel knapsack problem (UBKP) model, which is a type of BKPs involving uncertain variables. And then an uncertain solution for the UBKP is proposed by defining PE Nash equilibrium and PE Stackelberg Nash equilibrium. In order to improve the computational efficiency of the uncertain solution, several operators (binary coding distance, inversion operator, explosion operator and binary back learning operator) are applied to the basic fireworks algorithm to design the binary backward fireworks algorithm (BBFWA), which has a good performance in solving the BKP. As an illustration, a case study of the UBKP model and the P-E uncertain solution is applied to an armaments transportation problem. 展开更多
关键词 UNCERTAINTY bilevel programming knapsack problem binary backward fireworks algorithm
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部