Certain transients require regular observations over several days at intervals of hours or shorter,which cannot be accomplished by telescopes at a single site.The deployment of globally distributed telescopes at geogr...Certain transients require regular observations over several days at intervals of hours or shorter,which cannot be accomplished by telescopes at a single site.The deployment of globally distributed telescopes at geographic locations of different longitudes enables the periodic monitoring of transients through relay observation.However,the simultaneous relay observation of numerous targets requires a telescope array of multiple telescopes that can be efficiently coordinated,and an automated scheduler for the array.This paper proposes IPROS,an integer programming model relay observation scheduler for a telescope array,that accounts for the entire process of relay observation and is consistent with the practical scenarios.We introduce the integer programming mathematical model for the relay observation scheduling problem with the telescope array,upon which the scheduler is based.Additionally,we propose an algorithm to provide a comprehensive formulation of the optimization objective of minimizing cadence deviation in the model.Experimental results demonstrate that the relay observation scheduler based on the integer programming model can effectively address the telescope array relay observation problem.It shows superiority over a scheduler with non-specific consideration of relay observation in the modeling and a scheduler based on greedy thought.展开更多
Location-based cross-matching is a preprocessing step in astronomy that aims to identify records belonging to the same celestial body based on the angular distance formula. The traditional approach involves comparing ...Location-based cross-matching is a preprocessing step in astronomy that aims to identify records belonging to the same celestial body based on the angular distance formula. The traditional approach involves comparing each record in one catalog with every record in the other catalog, resulting in a one-to-one comparison with high computational complexity. To reduce the computational time, index partitioning methods are used to divide the sky into regions and perform local cross-matching. In addition, cross-matching algorithms have been adopted on highperformance architectures to improve their efficiency. But the index partitioning methods and computation architectures only increase the degree of parallelism, and cannot decrease the complexity of pairwise-based crossmatching algorithm itself. A better algorithm is needed to further improve the performance of cross-matching algorithm. In this paper, we propose a 3d-tree-based cross-matching algorithm that converts the angular distance formula into an equivalent 3dEuclidean distance and uses 3d-tree method to reduce the overall computational complexity and to avoid boundary issues. Furthermore, we demonstrate the superiority of the 3d-tree approach over the 2d-tree method and implement it using a multi-threading technique during both the construction and querying phases. We have experimentally evaluated the proposed 3d-tree cross-matching algorithm using publicly available catalog data. The results show that our algorithm applied on two 32-core CPUs achieves equivalent performance than previous experiments conducted on a six-node CPU-GPU cluster.展开更多
Dome A,Antarctica,has been thought to be one of the best astronomical sites on the Earth for decades.Since it was first visited by astronomers in 2008,dozens of facilities for astronomical observation and site testing...Dome A,Antarctica,has been thought to be one of the best astronomical sites on the Earth for decades.Since it was first visited by astronomers in 2008,dozens of facilities for astronomical observation and site testing were deployed.Due to its special geographical location,the data and message exchange between Dome A and the domestic control center could only depend on Iridium.Because the link bandwidth of Iridium is extremely limited,the network traffic cost is quite expensive and the network is rather unstable,the commonly used data transfer tools,such as rsync and scp,are not suitable in this case.In this paper,we design and implement a data transfer tool called NBFTP(narrow bandwidth file transfer protocol)for the astronomical observation of Dome A.NBFTP uses a uniform interface to arrange all types of data and matches specific transmission schemes for different data types according to rules.Break-point resuming and extensibility functions are also implemented.Our experimental results show that NBFTP consumes 60%less network traffic than rsync when detecting the data pending to be transferred.When transferring small files of 1 KB,the network traffic consumption of NBFTP is 40%less than rsync.However,as the file size increases,the network traffic consumption of NBFTP tends to approach rsync,but it is still smaller than rsync.展开更多
Multi-aircraft task allocation(MATA)plays a vital role in improving mission efficiency under dynamic conditions.This paper proposes a novel coevolutionary genetic programming(Co GP)framework that automatically designs...Multi-aircraft task allocation(MATA)plays a vital role in improving mission efficiency under dynamic conditions.This paper proposes a novel coevolutionary genetic programming(Co GP)framework that automatically designs high-performance reactive heuristics for dynamic MATA problems.Unlike conventional single-tree genetic programming(GP)methods,Co GP jointly develops two interacting populations,i.e.,task prioritizing heuristics and aircraft selection heuristics,to explicitly model the coupling between these two interdependent decision phases.A comprehensive terminal set is constructed to represent the dynamic states of aircraft and tasks,whereas a lowlevel heuristic template translates developed trees into executable allocation strategies.Extensive experiments on public benchmark instances simulating post-disaster emergency delivery demonstrate that Co GP achieves superior performance compared with state-of-the-art GP and heuristic methods,exhibiting strong adaptability,scalability,and real-time responsiveness in complex and dynamic rescue environments.展开更多
基金supported by the National Key Research and Development Program of China No.2023YFA1608301the National Natural Science Foundation of China(NSFC,grant Nos.12133010 and 12273025)
文摘Certain transients require regular observations over several days at intervals of hours or shorter,which cannot be accomplished by telescopes at a single site.The deployment of globally distributed telescopes at geographic locations of different longitudes enables the periodic monitoring of transients through relay observation.However,the simultaneous relay observation of numerous targets requires a telescope array of multiple telescopes that can be efficiently coordinated,and an automated scheduler for the array.This paper proposes IPROS,an integer programming model relay observation scheduler for a telescope array,that accounts for the entire process of relay observation and is consistent with the practical scenarios.We introduce the integer programming mathematical model for the relay observation scheduling problem with the telescope array,upon which the scheduler is based.Additionally,we propose an algorithm to provide a comprehensive formulation of the optimization objective of minimizing cadence deviation in the model.Experimental results demonstrate that the relay observation scheduler based on the integer programming model can effectively address the telescope array relay observation problem.It shows superiority over a scheduler with non-specific consideration of relay observation in the modeling and a scheduler based on greedy thought.
基金supported by the National Key Research and Development Program of China (2022YFF0711502)the National Natural Science Foundation of China (NSFC) (12273025 and 12133010)supported by China National Astronomical Data Center (NADC), CAS Astronomical Data Center and Chinese Virtual Observatory (China-VO)。
文摘Location-based cross-matching is a preprocessing step in astronomy that aims to identify records belonging to the same celestial body based on the angular distance formula. The traditional approach involves comparing each record in one catalog with every record in the other catalog, resulting in a one-to-one comparison with high computational complexity. To reduce the computational time, index partitioning methods are used to divide the sky into regions and perform local cross-matching. In addition, cross-matching algorithms have been adopted on highperformance architectures to improve their efficiency. But the index partitioning methods and computation architectures only increase the degree of parallelism, and cannot decrease the complexity of pairwise-based crossmatching algorithm itself. A better algorithm is needed to further improve the performance of cross-matching algorithm. In this paper, we propose a 3d-tree-based cross-matching algorithm that converts the angular distance formula into an equivalent 3dEuclidean distance and uses 3d-tree method to reduce the overall computational complexity and to avoid boundary issues. Furthermore, we demonstrate the superiority of the 3d-tree approach over the 2d-tree method and implement it using a multi-threading technique during both the construction and querying phases. We have experimentally evaluated the proposed 3d-tree cross-matching algorithm using publicly available catalog data. The results show that our algorithm applied on two 32-core CPUs achieves equivalent performance than previous experiments conducted on a six-node CPU-GPU cluster.
基金supported by the Joint Research Fund in Astronomy(U1931130)under the cooperative agreement between the National Natural Science Foundation of China(NSFC)and the Chinese Academy of Sciences(CAS)support from NFSC(Grant Nos.11873010and 117330037)the Operation,Maintenance and Upgrading Fund for Astronomical Telescopes,and Facility Instruments,budgeted from the Ministry of Finance of China(MOF)and administrated by the CAS。
文摘Dome A,Antarctica,has been thought to be one of the best astronomical sites on the Earth for decades.Since it was first visited by astronomers in 2008,dozens of facilities for astronomical observation and site testing were deployed.Due to its special geographical location,the data and message exchange between Dome A and the domestic control center could only depend on Iridium.Because the link bandwidth of Iridium is extremely limited,the network traffic cost is quite expensive and the network is rather unstable,the commonly used data transfer tools,such as rsync and scp,are not suitable in this case.In this paper,we design and implement a data transfer tool called NBFTP(narrow bandwidth file transfer protocol)for the astronomical observation of Dome A.NBFTP uses a uniform interface to arrange all types of data and matches specific transmission schemes for different data types according to rules.Break-point resuming and extensibility functions are also implemented.Our experimental results show that NBFTP consumes 60%less network traffic than rsync when detecting the data pending to be transferred.When transferring small files of 1 KB,the network traffic consumption of NBFTP is 40%less than rsync.However,as the file size increases,the network traffic consumption of NBFTP tends to approach rsync,but it is still smaller than rsync.
基金Project supported by the National Natural Science Foundation of China(No.U2333218)。
文摘Multi-aircraft task allocation(MATA)plays a vital role in improving mission efficiency under dynamic conditions.This paper proposes a novel coevolutionary genetic programming(Co GP)framework that automatically designs high-performance reactive heuristics for dynamic MATA problems.Unlike conventional single-tree genetic programming(GP)methods,Co GP jointly develops two interacting populations,i.e.,task prioritizing heuristics and aircraft selection heuristics,to explicitly model the coupling between these two interdependent decision phases.A comprehensive terminal set is constructed to represent the dynamic states of aircraft and tasks,whereas a lowlevel heuristic template translates developed trees into executable allocation strategies.Extensive experiments on public benchmark instances simulating post-disaster emergency delivery demonstrate that Co GP achieves superior performance compared with state-of-the-art GP and heuristic methods,exhibiting strong adaptability,scalability,and real-time responsiveness in complex and dynamic rescue environments.
