Weak phenotypic reversion of ivermectin resistance in a field resistant isolate of Haemonchus contortus by verapamil

Recent advances in anthelmintic resistant phenotype reversion by Pgp modulating drugs in ruminant nematodes indicate that this can be a useful tool to helminth control. The aim of the present study was to evaluate the efficacy of ivermectin (IVM) in combination with verapamil (VRP), in oil or water-based vehicle, against an IVM-resistant field isolate of Haemonchus contortus through a larval migration assay and experimental infection trial. In the in vitro assay was observed a phenotypic reversion of H. contortus resistance to ivermectin at a high concentration of VRP, increasing IVM efficacy from 53.1% to 94.3. In the in vivo trial, IVM + VRP demonstrated 36.02% efficacy compared to the 7.75% of IVM alone. The vehicle formulation showed no influence in efficacy. These are the first results demonstrating the effect of VRP as a partial IVM-resistance phenotype reverser in a field isolate of IVM-resistant H. contortus experimentally inoculated in sheep.

Algorithm to determine the intersection curves between bezier surfaces by the solution of multivariable polynomial system and the differential marching method

The determination of the intersection curve between Bézier Surfaces may be seen as the composition of two separated problems: determining initial points and tracing the intersection curve from these points. The Bézier Surface is represented by a parametric function (polynomial with two variables) that maps a point in the tridimensional space from the bidimensional parametric space. In this article, it is proposed an algorithm to determine the initial points of the intersection curve of Bézier Surfaces, based on the solution of polynomial systems with the Projected Polyhedral Method, followed by a method for tracing the intersection curves (Marching Method with differential equations). In order to allow the use of the Projected Polyhedral Method, the equations of the system must be represented in terms of the Bernstein basis, and towards this goal it is proposed a robust and reliable algorithm to exactly transform a multivariable polynomial in terms of power basis to a polynomial written in terms of Bernstein basis .