Assessing the impact of a joint human-porcine intervention package for Taenia solium control:Results of a pilot study from northern Lao PDR

Following confirmation that a remote village of approximately 300 inhabitants in northern Lao PDR was hyperendemic for the Neglected Tropical Disease Taenia solium, a pilot human-porcine therapeutic control intervention was implemented between October 2013 and November 2014. Mass drug administration with a three day albendazole 400 mg protocol was offered to all eligible humans in October 2013 and March 2014. At these times, and again in October 2014, eligible village pigs received the anti-cysticercosis TSOL18 vaccination and an oral dose of oxfendazole anthelmintic at 30 mg/kg, both repeated one month later. Community and individual human taeniasis prevalences were estimated via copro-antigen ELISA of volunteered human faecal samples prior to October 2013, and again in January 2015, in order to examine the short term impact of the intervention.</p

An Efficient Algorithm for the Complex Roots Problem

AbstractGiven a univariate polynomialf(z) of degreenwith complex coefficients, whose norms are less than 2min magnitude, the root problem is to find all the roots off(z) up to specified precision 2−μ. Assuming the arithmetic model for computation, we provide an algorithm which has complexityO(nlog5nlogB), whereb= χ + μ, and χ = max{n,m}. This improves on the previous best known algorithm of Pan for the problem, which has complexityO(n2log2nlog(m+ μ)). A remarkable property of our algorithm is that it does not require any assumptions about the root separation off, which were either explicitly, or implicitly, required by previous algorithms. Moreover it also has a work-efficient parallel implementation. We also show that both the sequential and parallel implementations of the algorithm work without modification in the Boolean model of arithmetic. In this case, it follows from root perturbation estimates that we need only specify θ = ⌈n(B+ logn+ 3)⌉ bits of the binary representations of the real and imaginary parts of each of the coefficients off. We also show that by appropriate rounding of intermediate values, we can bound the number of bits required to represent all complex numbers occurring as intermediate quantities in the computation. The result is that we can restrict the numbers we use in every basic arithmetic operation to those having real and imaginary parts with at most φ bits, where[formula]and[formula]Thus, in the Boolean model, the overall work complexity of the algorithm is only increased by a multiplicative factor ofM(φ) (whereM(ψ) =O(ψ(log ψ) log log ψ) is the bit complexity for multiplication of integers of length ψ). The key result on which the algorithm is based, is a new theorem of Coppersmith and Neff relating the geometric distribution of the zeros of a polynomial to the distribution of the zeros of its high order derivatives. We also introduce several new techniques (splitting sets and “centered” points) which hinge on it. We also observe that our root finding algorithm can be efficiently parallelized to run in parallel timeO(log6nlogB) usingnprocessors