摘要
文中讨论了基于相关性矩阵的测试点优化方法和故障诊断树的生成方法。在每一项测试所发生的测试费用都相同的条件下,以平均测试费用最优为目标函数的故障诊断树生成问题,可以转化为Huffman编码问题,而采用任何其他方法生成的故障诊断树,其平均测试费用都不是最优的。本文最后用实例对这一问题进行了说明。
The problems of optimal test point selection and optimal diagnosis tree generation are discussed in this paper. If the expected cost is selected as the objective function and each individual test cost is identical, then the optimal diagnosis tree generation problem can be transferred to Huffman coding problem. The example we presents at the end of this paper shows the correctness of the main result of this paper.
出处
《国外电子测量技术》
2006年第3期15-19,共5页
Foreign Electronic Measurement Technology