English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The sensitivity of blind gamma-ray pulsar searches in multiple years worth ofphoton data, as from the Fermi LAT, is primarily limited by the finitecomputational resources available. Addressing this "needle in a haystack"problem, we here present methods for optimizing blind searches to achieve thehighest sensitivity at fixed computing cost. For both coherent and semicoherentmethods, we consider their statistical properties and study their searchsensitivity under computational constraints. The results validate a multistagestrategy, where the first stage scans the entire parameter space using anefficient semicoherent method and promising candidates are then refined througha fully coherent analysis. We also find that for the first stage of a blindsearch incoherent harmonic summing of powers is not worthwhile at fixedcomputing cost for typical gamma-ray pulsars. Further enhancing sensitivity, wepresent efficiency-improved interpolation techniques for the semicoherentsearch stage. Via realistic simulations we demonstrate that overall theseoptimizations can significantly lower the minimum detectable pulsed fraction byalmost 50% at the same computational expense.

Optimized Blind Gamma-ray Pulsar Searches at Fixed Computing Budget