Related papers: New algorithms for radio pulsar search
The data collected during 2005 by the resonant bar Explorer are divided into segments and incoherently summed in order to perform an all-sky search for periodic gravitational wave signals. The parameter space of the search spanned about 40…
We propose a new model-independent method for new physics searches called Cluster Scanning. It uses the k-means algorithm to perform clustering in the space of low-level event or jet observables, and separates potentially anomalous clusters…
We present a general technique, based on parametric search with some twist, for solving a variety of optimization problems on a set of semi-algebraic geometric objects of constant complexity. The common feature of these problems is that…
Pulsar surveys with modern radio telescopes are becoming increasingly computationally demanding. This is particularly true for wide field-of-view pulsar surveys with radio interferometers, and those conducted in real or quasi-real time.…
Algorithms for efficiently finding optimal alphabetic decision trees -- such as the Hu-Tucker algorithm -- are well established and commonly used. However, such algorithms generally assume that the cost per decision is uniform and thus…
We report the discovery of nine previously unknown gamma-ray pulsars in a blind search of data from the Fermi Large Area Telescope (LAT). The pulsars were found with a novel hierarchical search method originally developed for detecting…
Tackling simulation optimization problems with non-convex objective functions remains a fundamental challenge in operations research. In this paper, we propose a class of random search algorithms, called Regular Tree Search, which…
Pulsar search is always the basis of pulsar navigation, gravitational wave detection and other research topics. Currently, the volume of pulsar candidates collected by Five-hundred-meter Aperture Spherical radio Telescope (FAST) shows an…
Pulsar search is one of the main tasks for the Square Kilometre Array (SKA), implemented in the central signal processor (CSP) sub-element. As most the characteristics of undiscovered pulsars are unknown by definition, exhaustive searches…
Searching for periodic non-accelerated signals in presence of ideal white noise using the fully phase-coherent Fast Folding Algorithm (FFA) is theoretically established as a more sensitive search method than the Fast Fourier Transform (FFT)…
This report investigates three fundamental search algorithms: Linear Search, Binary Search, and Two Pointer Search. Linear Search checks each element sequentially, Binary Search divides the search space in half, and Two Pointer Search uses…
Nearly all template-based gravitational wave (GW) searches only include the quasi-circular quadrupolar modes of the signals in their templates. Including additional degrees of freedom in the GW templates corresponding to higher-order…
The on-going PALFA survey is searching the Galactic plane (|b| < 5 deg., 32 < l < 77 deg. and 168 < l < 214 deg.) for radio pulsars at 1.4 GHz using ALFA, the 7-beam receiver installed at the Arecibo Observatory. By the end of August 2012,…
Measurement of the pulsar timing residuals provides a direct way to detect relic gravitational waves at the frequency $f\sim 1/{\rm yr}$. In this paper, we investigate the constraints on the inflationary parameters, the tensor-to-scalar…
Because of their extreme stellar densities, globular clusters are highly efficient factories of X-ray binaries and radio pulsars: per unit of stellar mass, they contain about 1000 times more of these exotic objects. Thus far, 345 radio…
The Particle Swarm Optimization (PSO) algorithm is developed for solving the Schaffer F6 function in fewer than 4000 function evaluations on a total of 30 runs. Four variations of the Full Model of Particle Swarm Optimization (PSO)…
Globular clusters are highly efficient radio pulsar factories. These pulsars can be used as precision probes of the clusters' structure, gas content, magnetic field, and formation history; some of them are also highly interesting in their…
We tackle two long-standing problems related to re-expansions in heuristic search algorithms. For graph search, A* can require $\Omega(2^{n})$ expansions, where $n$ is the number of states within the final $f$ bound. Existing algorithms…
Searching for radio pulsars typically requires a bespoke software pipeline to efficiently make new discoveries. In this paper we describe the search process, provide a tool for installing pulsar software, and give an example of a pulsar…
Pulsar Timing Array (PTA) experiments exploit the clock-like behaviour of an array of millisecond pulsars, with the goal of detecting low-frequency gravitational waves. PTA experiments have been in operation over the last decade, led by…