As an important application research topic of the intelligent aviation multi-station, collaborative detecting must overcome the problem of scouting measurement with status of 'fragmentation', and the NP-hardne...As an important application research topic of the intelligent aviation multi-station, collaborative detecting must overcome the problem of scouting measurement with status of 'fragmentation', and the NP-hardness problem of matching association between target and measurement in the process of scouting to data-link, which has complicated technical architecture of network construction. In this paper, taking advantage of cooperation mechanism on signal level in the aviation multi-station sympathetic network, a method of obtaining target time difference of arrival (TDOA) measurement using multi-station collaborative detecting based on time-frequency association is proposed. The method can not only achieve matching between target and its measurement, but also obtain TDOA measurement by further evolutionary transaction through refreshing sequential pulse time of arrival (TOA) measurement matrix for matching and correlating. Simulation results show that the accuracy of TDOA measurement has significant superiority over TOA, and detection probability of false TDOA measurement introduced by noise and fake measurement can be reduced effectively.展开更多
The reliability evaluation of a multistate network is primarily based on d-minimal paths/cuts(d-MPs/d-MCs).However,being a nondeterminism polynomial hard(NP-hard)problem,searching for all d-MPs is a rather challenging...The reliability evaluation of a multistate network is primarily based on d-minimal paths/cuts(d-MPs/d-MCs).However,being a nondeterminism polynomial hard(NP-hard)problem,searching for all d-MPs is a rather challenging task.In existing implicit enumeration algorithms based on minimal paths(MPs),duplicate d-MP candidates may be generated.An extra step is needed to locate and remove these duplicate d-MP candidates,which costs significant computational effort.This paper proposes an efficient method to prevent the generation of duplicate d-MP candidates for implicit enumeration algorithms for d-MPs.First,the mechanism of generating duplicate d-MP candidates in the implicit enumeration algorithms is discussed.Second,a direct and efficient avoiding-duplicates method is proposed.Third,an improved algorithm is developed,followed by complexity analysis and illustrative examples.Based on the computational experiments comparing with two existing algorithms,it is found that the proposed method can significantly improve the efficiency of generating d-MPs for a particular demand level d.展开更多
基金supported by the National Natural Science Foundation of China(61472443)the Basic Research Priorities Program of Shaanxi Province Natural Science Foundation of China(2013JQ8042)
文摘As an important application research topic of the intelligent aviation multi-station, collaborative detecting must overcome the problem of scouting measurement with status of 'fragmentation', and the NP-hardness problem of matching association between target and measurement in the process of scouting to data-link, which has complicated technical architecture of network construction. In this paper, taking advantage of cooperation mechanism on signal level in the aviation multi-station sympathetic network, a method of obtaining target time difference of arrival (TDOA) measurement using multi-station collaborative detecting based on time-frequency association is proposed. The method can not only achieve matching between target and its measurement, but also obtain TDOA measurement by further evolutionary transaction through refreshing sequential pulse time of arrival (TOA) measurement matrix for matching and correlating. Simulation results show that the accuracy of TDOA measurement has significant superiority over TOA, and detection probability of false TDOA measurement introduced by noise and fake measurement can be reduced effectively.
基金supported by the National Natural Science Foundation of China(71701207)the Science and Technology on Reliability&Environmental Engineering Laboratory(6142004004-2)the Science and Technology Commission of the CMC(2019-JCJQ-JJ-180)。
文摘The reliability evaluation of a multistate network is primarily based on d-minimal paths/cuts(d-MPs/d-MCs).However,being a nondeterminism polynomial hard(NP-hard)problem,searching for all d-MPs is a rather challenging task.In existing implicit enumeration algorithms based on minimal paths(MPs),duplicate d-MP candidates may be generated.An extra step is needed to locate and remove these duplicate d-MP candidates,which costs significant computational effort.This paper proposes an efficient method to prevent the generation of duplicate d-MP candidates for implicit enumeration algorithms for d-MPs.First,the mechanism of generating duplicate d-MP candidates in the implicit enumeration algorithms is discussed.Second,a direct and efficient avoiding-duplicates method is proposed.Third,an improved algorithm is developed,followed by complexity analysis and illustrative examples.Based on the computational experiments comparing with two existing algorithms,it is found that the proposed method can significantly improve the efficiency of generating d-MPs for a particular demand level d.
