首页 | 本学科首页   官方微博 | 高级检索  
   检索      

基于One-port模式的测试点选取问题
引用本文:戴丽,郁殿龙,谢政.基于One-port模式的测试点选取问题[J].国防科技大学学报,2002,24(4):100-104.
作者姓名:戴丽  郁殿龙  谢政
作者单位:国防科技大学理学院,湖南,长沙,410073
摘    要:在故障诊断过程中 ,每个测试点检测故障所需的时间可能不同。对于每个测试点一次检测所有可检测故障点的问题已经获得解决。对于每个测试点一次只能检测一个故障点 ,分两种情况加以讨论。若要求检测时间之和最小 ,给出了最优算法 ;若要求最大检测时间最小 ,证明了其是NP完全问题 ,并给出近似算法。最后给出一个实例对算法加以说明

关 键 词:故障  检测  NP完全  近似算法  多项式算法
文章编号:1001-2486(2002)04-0100-05
收稿时间:2002/1/11 0:00:00
修稿时间:2002年1月11日

The Problem of Choosing the Testing Points Based on One Port Mode
DAI Li,YU Dianlong and XIE Zheng.The Problem of Choosing the Testing Points Based on One Port Mode[J].Journal of National University of Defense Technology,2002,24(4):100-104.
Authors:DAI Li  YU Dianlong and XIE Zheng
Institution:College of Science, National Univ. of Defense Technology, Changsha 410073, China;College of Science, National Univ. of Defense Technology, Changsha 410073, China;College of Science, National Univ. of Defense Technology, Changsha 410073, China
Abstract:During the course of diagnosing the faults, the time for each testing point to detect the fault may be different. The problem that each testing point can detect once all the fault points that it can detect has been solved. If each testing point can detect only one fault point once, two questions will be discussed. If the sum of all the detection time is required to be minimal, an optimization algorithm is provided;If the maximum detection time is required to be minimal, the problem is proved to be NP completeness and an approximate algorithm is given. Finally an example is given to explain the algorithms.
Keywords:fault  detection  NP  completeness  approximate algorithm  polynomial algorithm
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《国防科技大学学报》浏览原始摘要信息
点击此处可从《国防科技大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号