Search

Background Oxathiapiprolin is a piperidinyl thiazole isoxazoline fungicide discovered by DuPont and commercialized by Corteva Agriscience. It acts by inhibiting a novel fungal target, an oxysterol binding protein (OSBP), and is intrinsically highly active against oomycetes including grape downy mildew (Plasmopara viticola) and potato late blight (Phytophthora infestans). Because the fungicide acts at a single site there is a need to determine the risk of resistance development. Results Oxathiapiprolin controlled European Plasmopara viticola and Phytophthora infestans isolates at very low concentrations with half maximal effective concentration (EC50 ) values ranging from 0.001 to 0.0264 mg L-1 and 0.001 to 0.03 mg L-1 , respectively. Laboratory mutagenesis studies performed with Phytophthora capsici using ultraviolet (UV) irradiation generated mutants with reduced sensitivity to oxathiapiprolin. All resistant mutants had a base pair change in the OSBP gene that resulted in an amino acid change. Most common substitutions were S768Y, G770V, G839W and L863W. Isolates of Plasmopara viticola and Phytophthora infestans with reduced sensitivity were also detected in field trial sites where oxathiapiprolin had been applied repeatedly each season over several consecutive years. Conclusions The risk of oxathiapiprolin resistance development in Plasmopara viticola and Phytophthora infestans is medium to high and strict resistance management measures are required. Over-exposure of target populations to single-site fungicides during product development should be avoided.

International audience; Comparison of several types of differentiation algorithms has been performed in the paper Wang, Zheng, Efimov, and Perruquetti (2018) with application to a robotic blimp altitude control. Unfortunately, one of the differentiation methods, the algebraic differentiator, has not been applied properly. The clarifications and the new comparison results are given in this note.

We present a time-domain broadband beamforming based on a unimodular-upper polynomial matrix decomposition. The unimodular factor is the product of elementary $J$ - orthogonal matrices and a lower-triangular matrix with 1's on the diagonal, as in the constant matrix lower upper (LU) decomposition. This leads to a $J$ - orthogonal LU polynomial matrix decomposition, as a combination of two classical matrix factorization methods: Smith canonical form and LU Gaussian elimination. The inversion of the unimodular factor, for use as a pre/postfilter in the beamforming scheme, is immediate and can be achieved with O(1) complexity. The resulting reduced multiple-input multiple-output (MIMO) channel is exactly diagonal, leading to separate single-input single-output (SISO) channels with no cochannel inteference. There is no need to model the MIMO channel as a Laurent polynomial as usual, thus introducing unnecessary delays just for technical reasons. In addition, it turns out that each of the resulting SISO channels, except to the last channel, reduces to a simple additive noise channel, with no intersymbol interference (ISI), except for unprobable original MIMO channels. However, these very interesting features are to be balanced with the possible noise enhancement in the postfiltering step. The performance in terms of bit error rate (BER) is studied and compared with the QR-based frequency-domain and time-domain broadband beamforming. In particular, the proposed beamforming scheme can be used both in orthogonal frequency-division multiplexing (OFDM) and in single-carrier MIMO systems, without a cyclic prefix (CP). Meanwhile, the QR-based scheme requires a CP extension.

In this paper, a novel algebraic method is proposed to estimate amplitudes, frequencies, and phases of a biased and noisy sum of complex exponential sinusoidal signals. The resulting parameter estimates are given by original closed formulas, constructed as integrals acting as time-varying filters of the noisy measured signal. The proposed algebraic method provides faster and more robust results, compared with usual procedures. Some computer simulations illustrate the efficiency of our method. Copyright © 2016 John Wiley & Sons, Ltd.

After colonization population sizes may vary across the species range depending on environmental conditions and following colonizations. An interesting question is whether local adaptation occurs more frequently in large ancestral populations or in small derived populations. A higher number of new mutations and a lower effect of genetic drift should favor selection in large populations, whereas small derived populations may require an initial local adaptation event to facilitate the colonization of new habitats. Wild tomatoes are native to a broad range of different habitats characterized by variable abiotic conditions in South America, and represent an ideal system to study this interplay between demography and natural selection. Population genetic analyses and statistical inference of past demography were conducted on pooled-sequencing data from 30 genes (8,080 single nucleotide polymorphisms) from an extensive sampling of 23 Solanum chilense populations over Chile and Peru. We reveal first a north-south colonization associated with relaxed purifying selection in the south as shown by a decrease of genetic variation and an increasing proportion of nonsynonymous polymorphism from north to south, and population substructure with at least four genetic groups. Second, we uncover a dual picture of adaptation consisting of 1) a decreasing proportion of adaptive amino acid substitutions from north to south suggesting that adaptation is favored in large populations, whereas 2) signatures of local adaptation predominantly occur in the smaller populations from the marginal ranges in the south.

International audience; In this paper we propose a robust representation of a digital signal based on error correction codes. For each frame of the signal (N successive samples) a binary decomposition, as a (successive power 2) weighted sum of binary vectors, is first considered. Then, each binary vector is projected into the set of codewords of a corresponding block code. The codes are designed so that their correction powers increases inversely to the weight of the binary vectors since the binary vectors with high weight are less sensitive to disturbance. The corresponding representation (decoding) thus appears as a form of signal quantization that can provide an interesting protection against noise and/or channel distorsion. Some applications showing the utility of the proposed representation are given.