Related papers: Computationally efficient algorithm for fast trans…
High-throughput spectrometers are capable of producing data sets containing thousands of spectra for a single biological sample. These data sets contain a substantial amount of redundancy from peptides that may get selected multiple times…
We describe how a novel online changepoint detection algorithm, called Poisson-FOCuS, can be used to optimally detect gamma-ray bursts within the computational constraints imposed by miniaturized satellites such as the upcoming…
Controlling the properties of organic/inorganic materials requires detailed knowledge of their molecular adsorption geometries. This is often unattainable, even with current state-of-the-art tools. Visualizing the structure of complex…
Compressive sensing(CS) has drawn much attention in recent years due to its low sampling rate as well as high recovery accuracy. As an important procedure, reconstructing a sparse signal from few measurement data has been intensively…
Particle production from secondary proton-proton collisions, commonly referred to as pile-up, impair the sensitivity of both new physics searches and precision measurements at LHC experiments. We propose a novel algorithm, PUMA, for…
We introduce a temporal scheme for data sampling, based on a variable delay between two successive data acquisitions. The scheme is designed so as to reduce the average data flow rate, while still retaining the information on the data…
An algorithm is proposed to calculate traveling dissipative solitons for the FitzHugh-Nagumo equations. It is based on the application of the steepest descent method to a certain functional. This approach can be used to find solitons…
Clustering algorithms fundamentally group data points by characteristics to identify patterns. Over the past two decades, researchers have extended these methods to analyze trajectories of humans, animals, and vehicles, studying their…
We discuss the distributed matching scheme in accelerators where control of transverse beam phase space, oscillation, and transport is accomplished by flexible distribution of focusing elements beyond dedicated matching sections. Besides…
We present a retrieval algorithm based on generalized projections for ultrashort pulse characterization using dispersion scan (d-scan). The new algorithm is tested on several simulated cases and in two different experimental cases in the…
Distributed compressed sensing is concerned with representing an ensemble of jointly sparse signals using as few linear measurements as possible. Two novel joint reconstruction algorithms for distributed compressed sensing are presented in…
The field of quickest change detection (QCD) concerns design and analysis of algorithms to estimate in real time the time at which an important event takes place and identify properties of the post-change behavior. The goal is to devise a…
Practical application of the harmonic summing technique in the power-spectrum analysis for searching pulsars has exhibited the technique's effectiveness. In this paper, theoretical verification of harmonic summing considering power's…
This paper deals with Gibbs samplers that include high dimensional conditional Gaussian distributions. It proposes an efficient algorithm that avoids the high dimensional Gaussian sampling and relies on a random excursion along a small set…
The fundamental problem of our interest here is soft-input soft-output multiple-input multiple-output (MIMO) detection. We propose a method, referred to as subspace marginalization with interference suppression (SUMIS), that yields…
We study the statistical characteristics of a box-fitting algorithm to analyze stellar photometric time series in the search for periodic transits by extrasolar planets. The algorithm searches for signals characterized by a periodic…
We introduce a path sampling method for the computation of rate constants for systems with a highly diffusive character. Based on the recently developed algorithm of transition interface sampling (TIS) this procedure increases the…
We introduce a method for detecting astrophysical transients evolving on timescales of milliseconds to minutes using cosmic microwave background (CMB) survey telescopes. While previous transient searches in CMB data operate in map space,…
A method is presented which allows for a tremendous speed-up of computer simulations of statistical systems by orders of magnitude. This speed-up is achieved by means of a new observable, while the algorithm of the simulation remains…
Pulsar searches are computationally demanding efforts to discover dispersed periodic signals in time- and frequency-resolved data from radio telescopes. The complexity and computational expense of simultaneously determining the…