Related papers: New algorithms for radio pulsar search
Grover's algorithm achieves a quadratic speedup over classical algorithms, but it is considered necessary to know the value of $\lambda$ exactly [Phys. Rev. Lett. 95, 150501 (2005); Phys. Rev. Lett. 113, 210501 (2014)], where $\lambda$ is…
Recent research suggests that tree search algorithms (e.g. Monte Carlo Tree Search) can dramatically boost LLM performance on complex mathematical reasoning tasks. However, they often require more than 10 times the computational resources…
Recent discoveries of multiple long-period pulsars (periods ${\sim}10\,$s or larger) are starting to challenge the conventional notion that coherent radio emission cannot be produced by objects that are below the many theorised death lines.…
We have performed a new search for radio pulsars in archival data of the intermediate and high Galactic latitude parts of the Southern High Time Resolution Universe pulsar survey. This is the first time the entire dataset has been searched…
New methods for finding submatrices of (locally) maximal volume and large projective volume are proposed and studied. Detailed analysis is also carried out for existing methods. The effectiveness of the new methods is shown in the…
Searches for millisecond-duration, dispersed single pulses have become a standard tool used during radio pulsar surveys in the last decade. They have enabled the discovery of two new classes of sources: rotating radio transients and fast…
In this work, we study the robust phase retrieval problem where the task is to recover an unknown signal $\theta^* \in \mathbb{R}^d$ in the presence of potentially arbitrarily corrupted magnitude-only linear measurements. We propose an…
We propose a new scalable method to optimize the architecture of an artificial neural network. The proposed algorithm, called Greedy Search for Neural Network Architecture, aims to determine a neural network with minimal number of layers…
We present a method for detection of weak continuous signals from sources in binary systems via the incoherent combination of many "short" coherently-analyzed segments. The main focus of the work is on the construction of a metric on the…
This article proposes a new population-based optimization algorithm called the Tangent Search Algorithm (TSA) to solve optimization problems. The TSA uses a mathematical model based on the tangent function to move a given solution toward a…
SKA is a new technology radio-telescope array, about two orders of magnitude more sensitive and rapid in sky surveys than present instruments. It will probe the dark age of the universe, just afer recombination, and during the epoch of…
Combination therapies are often needed for effective clinical outcomes in the management of complex diseases, but presently they are generally based on empirical clinical experience. Here we suggest a novel application of search algorithms,…
Modern pulsar surveys produce many millions of candidate pulsars, far more than can be individually inspected. Traditional methods for filtering these candidates, based upon the signal-to-noise ratio of the detection, cannot easily…
Dense Convolutional Network has been continuously refined to adopt a highly efficient and compact architecture, owing to its lightweight and efficient structure. However, the current Dense-like architectures are mainly designed manually, it…
An optimal binary search tree for an access sequence on elements is a static tree that minimizes the total search cost. Constructing perfectly optimal binary search trees is expensive so the most efficient algorithms construct almost…
Footstep planning involves a challenging combinatorial search. Traditional A* approaches require discretising reachability constraints, while Mixed-Integer Programming (MIP) supports continuous formulations but quickly becomes intractable,…
The search for continuous gravitational waves from unknown isolated sources is computationally limited due to the enormous parameter space that needs to be covered and the weakness of the expected signals. Therefore semi-coherent search…
We present a novel algorithm aimed at identifying peaks within a uniformly sampled time series affected by uncorrelated Gaussian noise. The algorithm, called "MEPSA" (multiple excess peak search algorithm), essentially scans the time series…
The periodic mode is analyzed together with two conventional boundary handling modes for particle swarm. By providing an infinite space that comprises periodic copies of original search space, it avoids possible disorganizing of particle…
In our previous paper, we developed a technique for identifying pulsar candidates in interferometric radio images using their distinctive scintillation signatures. Building on this technique, the present study simulates a pulsar population…