Objective: Rapid testing is paramount during a pandemic to prevent continued viral spread and excess morbidity and mortality. This study investigates whether testing strategies based on sample pooling can increase the speed and throughput of screening for SARS-CoV-2, especially in resource-limited settings. Methods: In a mathematical modelling approach conducted in May 2020, six different testing strategies were simulated based on key input parameters such as infection rate, test characteristics, population size, and testing capacity. The situations in five countries were simulated, reflecting a broad variety of population sizes and testing capacities. The primary study outcome measurements were time and number of tests required, number of cases identified, and number of false positives. Findings: The performance of all tested methods depends on the input parameters, i.e. the specific circumstances of a screening campaign. To screen one tenth of each country’s population at an infection rate of 1%, realistic optimised testing strategies enable such a campaign to be completed in ca. 29 days in the US, 71 in the UK, 25 in Singapore, 17 in Italy, and 10 in Germany. This is ca. eight times faster compared to individual testing. When infection rates are lower, or when employing an optimal, yet more complex pooling method, the gains are more pronounced. Pool-based approaches also reduce the number of false positive diagnoses by a factor of up to 100. Conclusions: The results of this study provide a rationale for adoption of pool-based testing strategies to increase speed and throughput of testing for SARS-CoV-2, hence saving time and resources compared with individual testing.
6 April 2021 in Foundations of Computational Mathematics
Various key problems from theoretical computer science can be expressed as polynomial optimization problems over the boolean hypercube. One particularly successful way to prove complexity bounds for these types of problems is based on sums of squares (SOS) as nonnegativity certificates. In this article, we initiate optimization problems over the boolean hypercube via a recent, alternative certificate called sums of nonnegative circuit polynomials (SONC). We show that key results for SOS-based certificates remain valid: First, for polynomials, which are nonnegative over the n-variate boolean hypercube with constraints of degree d there exists a SONC certificate of degree at most $$n+d$$ . Second, if there exists a degree d SONC certificate for nonnegativity of a polynomial over the boolean hypercube, then there also exists a short degree d SONC certificate that includes at most $$n^{O(d)}$$ nonnegative circuit polynomials. Moreover, we prove that, in opposite to SOS, the SONC cone is not closed under taking affine transformation of variables and that for SONC there does not exist an equivalent to Putinar’s Positivstellensatz for SOS. We discuss these results from both the algebraic and the optimization perspective.
Enantiospecific effects play an uprising role in chemistry and technical applications. Chiral molecular networks formed by self‐assembly processes at surfaces can be imaged by scanning probe microscopy (SPM). Low contrast and high noise in the topography map often interfere with the automatic image analysis using classical methods. The long SPM image acquisition times restrain Artificial Intelligence‐based methods requiring large training sets, leaving only tedious manual work, inducing human‐dependent errors and biased labeling. By generating realistic looking synthetic images, the acquisition of real datasets is avoided. Two state‐of‐the‐art object detection architectures are trained to localize and classify chiral unit‐cells in a regular molecular chiral network formed by self‐assembly of linear molecular bricks. The comparison of different architectures and datasets demonstrates that the training on purely synthetic data outperforms models trained using augmented datasets. A Faster R‐CNN model trained solely on synthetic data achieved an excellent mean average precision of 99% on real data. Hence this approach and the transfer to real data show high success, also highlighting the high robustness against experimental noise and different zoom levels across the full experimentally reasonable parameter range. The generalizability of this idea is demonstrated by achieving equally high performance on a different structure, too.