Intérêt et production des hybrides interraciaux pour le pin maritime, application à la forêt méditerranéenne.

Il est parfois intéressant de réunir au sein d'une variété, les caractéristiques favorables que l'on trouve sur deux provenances différentes. Cela passe par la création d'hybrides interraciaux. Dans cet article sont décrits les étapes et les itinéraires techniques pour la production d'hybrides. En région méditerranéenne, cette complémentarité entre races pourrait être recherchée avec la race marocaine Tamjout, dont la résistance à Matsucoccus est bien connue, mais dont les caractéristiques de vigueur et de forme sont nettement insuffisantes

Stability with respect to domain of the low Mach number limit of compressible viscous fluids

We study the asymptotic limit of solutions to the barotropic Navier-Stokes system, when the Mach number is proportional to a small parameter \ep \to 0 and the fluid is confined to an exterior spatial domain \Omega_\ep that may vary with \ep. As $\epsilon \rightarrow 0$, it is shown that the fluid density becomes constant while the velocity converges to a solenoidal vector field satisfying the incompressible Navier-Stokes equations on a limit domain. The velocities approach the limit strongly (a.a.) on any compact set, uniformly with respect to a certain class of domains. The proof is based on spectral analysis of the associated wave propagator (Neumann Laplacian) governing the motion of acoustic waves.Comment: 32 page

Design of a flight control architecture using a non-convex bundle method

We design a feedback control architecture for longitudinal flight of an aircraft. The multi-level architecture includes the flight control loop to govern the short term dynamics of the aircraft, and the autopilot to control the long term modes. Using H1 performance and robustness criteria, the problem is cast as a non-convex and non-smooth optimization program. We present a non-convex bundle method, prove its convergence, and show that it is apt to solve the longitudinal flight control problem

Time quasi-periodic gravity water waves in finite depth

We prove the existence and the linear stability of Cantor families of small amplitude time quasi-periodic standing water wave solutions\u2014namely periodic and even in the space variable x\u2014of a bi-dimensional ocean with finite depth under the action of pure gravity. Such a result holds for all the values of the depth parameter in a Borel set of asymptotically full measure. This is a small divisor problem. The main difficulties are the fully nonlinear nature of the gravity water waves equations\u2014the highest order x-derivative appears in the nonlinear term but not in the linearization at the origin\u2014and the fact that the linear frequencies grow just in a sublinear way at infinity. We overcome these problems by first reducing the linearized operators, obtained at each approximate quasi-periodic solution along a Nash\u2013Moser iterative scheme, to constant coefficients up to smoothing operators, using pseudo-differential changes of variables that are quasi-periodic in time. Then we apply a KAM reducibility scheme which requires very weak Melnikov non-resonance conditions which lose derivatives both in time and space. Despite the fact that the depth parameter moves the linear frequencies by just exponentially small quantities, we are able to verify such non-resonance conditions for most values of the depth, extending degenerate KAM theory

An Algorithmic Reduction Theory for Binary Codes: LLL and more

In this article, we propose an adaptation of the algorithmic reduction theory of lattices to binary codes. This includes the celebrated LLL algorithm (Lenstra, Lenstra, Lovasz, 1982), as well as adaptations of associated algorithms such as the Nearest Plane Algorithm of Babai (1986). Interestingly, the adaptation of LLL to binary codes can be interpreted as an algorithmic version of the bound of Griesmer (1960) on the minimal distance of a code. Using these algorithms, we demonstrate ---both with a heuristic analysis and in practice--- a small polynomial speed-up over the Information-Set Decoding algorithm of Lee and Brickell (1988) for random binary codes. This appears to be the first such speed-up that is not based on a time-memory trade-off. The above speed-up should be read as a very preliminary example of the potential of a reduction theory for codes, for example in cryptanalysis. In constructive cryptography, this algorithmic reduction theory could for example also be helpful for designing trapdoor functions from codes

Wave: A New Family of Trapdoor One-Way Preimage Sampleable Functions Based on Codes

We present here a new family of trapdoor one-way Preimage Sampleable Functions (PSF) based on codes, the Wave-PSF family. The trapdoor function is one-way under two computational assumptions: the hardness of generic decoding for high weights and the indistinguishability of generalized $(U,U+V)$-codes. Our proof follows the GPV strategy [GPV08]. By including rejection sampling, we ensure the proper distribution for the trapdoor inverse output. The domain sampling property of our family is ensured by using and proving a variant of the left-over hash lemma. We instantiate the new Wave-PSF family with ternary generalized $(U,U+V)$-codes to design a "hash-and-sign" signature scheme which achieves existential unforgeability under adaptive chosen message attacks (EUF-CMA) in the random oracle model. For 128 bits of classical security, signature sizes are in the order of 15 thousand bits, the public key size in the order of 4 megabytes, and the rejection rate is limited to one rejection every 10 to 12 signatures.Comment: arXiv admin note: text overlap with arXiv:1706.0806

Smoothing Codes and Lattices: Systematic Study and New Bounds

In this article we revisit smoothing bounds in parallel between lattices and codes. Initially introduced by Micciancio and Regev, these bounds were instantiated with Gaussian distributions and were crucial for arguing the security of many lattice-based cryptosystems. Unencumbered by direct application concerns, we provide a systematic study of how these bounds are obtained for both lattices and codes, transferring techniques between both areas. We also consider multiple choices of spherically symmetric noise distribution. We found that the best strategy for a worst-case bound combines Parseval's Identity, the Cauchy-Schwarz inequality, and the second linear programming bound, and this holds for both codes and lattices and all noise distributions at hand. For an average-case analysis, the linear programming bound can be replaced by a tight average count. This alone gives optimal results for spherically uniform noise over random codes and random lattices. This also improves previous Gaussian smoothing bound for worst-case lattices, but surprisingly this provides even better results with uniform ball noise than for Gaussian (or Bernouilli noise for codes). This counter-intuitive situation can be resolved by adequate decomposition and truncation of Gaussian and Bernouilli distributions into a superposition of uniform noise, giving further improvement for those cases, and putting them on par with the uniform cases

Automatic Assessment of Speech Capability Loss in Disordered Speech

International audienceIn this article, we report on the use of an automatic technique to assess pronunciation in the context of several types of speech disorders. Even if such tools already exist, they are more widely used in a different context, namely, Computer-Assisted Language Learning, in which the objective is to assess nonnative pronunciation by detecting learners' mispronunciations at segmental and/or suprasegmental levels. In our work, we sought to determine if the Goodness of Pronunciation (GOP) algorithm, which aims to detect phone-level mispronunciations by means of automatic speech recognition, could also detect segmental deviances in disordered speech. Our main experiment is an analysis of speech from people with unilateral facial palsy. This pathology may impact the realization of certain phonemes such as bilabial plosives and sibilants. Speech read by 32 speakers at four different clinical severity grades was automatically aligned and GOP scores were computed for each phone realization. The highest scores, which indicate large dissimilarities with standard phone realizations, were obtained for the most severely impaired speakers. The corresponding speech subset was manually transcribed at phone level; 8.3% of the phones differed from standard pronunciations extracted from our lexicon. The GOP technique allowed the detection of 70.2% of mispronunciations with an equal rate of about 30% of false rejections and false acceptances. Finally, to broaden the scope of the study, we explored the correlation between GOP values and speech comprehensibility scores on a second corpus, composed of sentences recorded by six people with speech impairments due to cancer surgery or neurological disorders. Strong correlations were achieved between GOP scores and subjective comprehensibility scores (about 0.7 absolute). Results from both experiments tend to validate the use of GOP to measure speech capability loss, a dimension that could be used as a complement to physiological measures in pathologies causing speech disorders

RNA polymerase II stalling promotes nucleosome occlusion and pTEFb recruitment to drive immortalization by Epstein-Barr virus

Epstein-Barr virus (EBV) immortalizes resting B-cells and is a key etiologic agent in the development of numerous cancers. The essential EBV-encoded protein EBNA 2 activates the viral C promoter (Cp) producing a message of ~120 kb that is differentially spliced to encode all EBNAs required for immortalization. We have previously shown that EBNA 2-activated transcription is dependent on the activity of the RNA polymerase II (pol II) C-terminal domain (CTD) kinase pTEFb (CDK9/cyclin T1). We now demonstrate that Cp, in contrast to two shorter EBNA 2-activated viral genes (LMP 1 and 2A), displays high levels of promoter-proximally stalled pol II despite being constitutively active. Consistent with pol II stalling, we detect considerable pausing complex (NELF/DSIF) association with Cp. Significantly, we observe substantial Cp-specific pTEFb recruitment that stimulates high-level pol II CTD serine 2 phosphorylation at distal regions (up to +75 kb), promoting elongation. We reveal that Cp-specific pol II accumulation is directed by DNA sequences unfavourable for nucleosome assembly that increase TBP access and pol II recruitment. Stalled pol II then maintains Cp nucleosome depletion. Our data indicate that pTEFb is recruited to Cp by the bromodomain protein Brd4, with polymerase stalling facilitating stable association of pTEFb. The Brd4 inhibitor JQ1 and the pTEFb inhibitors DRB and Flavopiridol significantly reduce Cp, but not LMP1 transcript production indicating that Brd4 and pTEFb are required for Cp transcription. Taken together our data indicate that pol II stalling at Cp promotes transcription of essential immortalizing genes during EBV infection by (i) preventing promoter-proximal nucleosome assembly and ii) necessitating the recruitment of pTEFb thereby maintaining serine 2 CTD phosphorylation at distal regions

On the vanishing electron-mass limit in plasma hydrodynamics in unbounded media

We consider the zero-electron-mass limit for the Navier-Stokes-Poisson system in unbounded spatial domains. Assuming smallness of the viscosity coefficient and ill-prepared initial data, we show that the asymptotic limit is represented by the incompressible Navier-Stokes system, with a Brinkman damping, in the case when viscosity is proportional to the electron-mass, and by the incompressible Euler system provided the viscosity is dominated by the electron mass. The proof is based on the RAGE theorem and dispersive estimates for acoustic waves, and on the concept of suitable weak solutions for the compressible Navier-Stokes system