Optimal control of a space-borne laser system for a 100 m asteroid deflection under uncertainties

The paper demonstrates the technical feasibility to deflect a 100 m diameter asteroid using a moderate size spacecraft carrying a 1-20 kW solar-powered class laser. To this purpose, a recent model of the laser ablation mechanism based on the characteristics of both the laser systems and the asteroid has been used to calculate the exerted thrust in terms of direction and magnitude. This paper shows a preliminary deflection uncertainty analysis for two different control logic and assuming different laser mechanism capabilities. In particular, an optimal thrust control direction and fixed laser pointing strategies were considered with two laser optics settings: the first maintaining the focus length fixed and the second able to exactly focus on the surface. Preliminary results show that in general the fixed laser pointing strategy at low power is less able to impart high deflection. Nonetheless, when the power increases, the optimal thrust method produces undesired torques, which reduces the laser momentum coupling as side effects. However, the overall efficiency is higher in the optimal thrust case. Since the collision risk between an impacting asteroid and the Earth depends on the probability distribution of the input uncertainty parameters, it is necessary to study how the overall deflection will be affected. Both aleatory and epistemic uncertainties are taken into account to evaluate the probability of success of the proposed deflection methods

Functional and Efficient Query Interpreters: Principle, Application and Performances’ Comparison

This paper presents a general approach to implement efficient queries’ interpreters in a functional programming language. Indeed, most of the standard tools actually available use an imperative and/or object-oriented language for the implementation (e.g. Java for Jena-Fuseki) but other paradigms are possible with, maybe, better performances. To proceed, the paper first explains how to model data structures and queries in a functional point of view. Then, it proposes a general methodology to get performances (i.e. number of computation steps to answer a query) then it explains how to integrate some optimization techniques (short-cut fusion and, more important, data transformations). It then compares the functional server proposed to a standard tool (Fuseki) demonstrating that the first one can be twice to ten times faster to answer queries

Expression of a rice chitinase gene in transgenic banana (''Gros Michel'', AAA genome group) confers resistance to black leaf streak disease

Transgenic banana (Musa acuminata 'Gros Michel') integrating either of two rice chitinase genes was generated and its resistance to Black Leaf Streak disease caused by the fungus Mycosphaerella fijiensis was tested using a leaf disk bioassay. PCR screening indicated the presence of the hpt selectable marker gene in more than 90 % of the lines tested, whereas more than three quarters of the lines contained the linked rice chitinase gene resulting in a co-transformation frequency of at least 71.4 %. Further, a unique stable integration of the transgenes in each line revealed some false negative PCR results and the expected co-transformation frequency of 100 %

Aetiology of canine infectious respiratory disease complex and prevalence of its pathogens in Europe

The canine infectious respiratory disease complex (CIRDC) is an endemic worldwide syndrome involving multiple viral and bacterial pathogens. Traditionally, Bordetella bronchiseptica (Bb), canine adenovirus type 2 (CAV-2), canine distemper virus (CDV), canine herpesvirus (CHV) and canine parainfluenza virus (CPiV) were considered the major causative agents. Lately, new pathogens have been implicated in the development of CIRDC, namely canine influenza virus (CIV), canine respiratory coronavirus (CRCoV), canine pneumovirus (CnPnV), Mycoplasma cynos and Streptococcus equi subspecies zooepidemicus. To better understand the role of the different pathogens in the development of CIRDC and their epidemiological relevance in Europe, prevalence data were collected from peer-reviewed publications and summarized. Evidence of exposure to Bb is frequently found in healthy and diseased dogs and client-owned dogs are as likely to be infected as kennelled dogs. Co-infections with viral pathogens are common. The findings confirm that Bb is an important cause of CIRDC in Europe. CAV-2 and CDV recovery rates from healthy and diseased dogs are low and the most likely explanation for this is control through vaccination. Seroconversion to CHV can be demonstrated following CIRDC outbreaks and CHV has been detected in the lower respiratory tract of diseased dogs. There is some evidence that CHV is not a primary cause of CIRDC, but opportunistically re-activates at the time of infection and exacerbates the disease. The currently available data suggest that CIV is, at present, neither a prevalent nor a significant pathogen in Europe. CPiV remains an important pathogen in CIRDC and facilitates co-infection with other viral and bacterial pathogens. CnPnV and CRCoV are important new elements in the aetiology of CIRDC and spread particularly well in multi-dog establishments. M. cynos is common in Europe and is more likely to occur in younger and kennelled dogs. This organism is frequently found together with other CIRDC pathogens and is significantly associated with more severe respiratory signs. S. zooepidemicus infection is not common and appears to be a particular problem in kennels. Protective immunity against respiratory diseases is rarely complete, and generally only a reduction in clinical signs and excretion of pathogen can be achieved through vaccination. However, even vaccines that only reduce and do not prevent infection carry epidemiological advantages. They reduce spread, increase herd immunity and decrease usage of antimicrobials. Recommending vaccination of dogs against pathogens of CIRDC will directly provide epidemiological advantages to the population and the individual dog

Categorical Models for BigData

This paper shows how concepts coming from category theory associated to a functional programming language can help to formalize and reason about data and get efficient programs in a BigData context. More precisely, it shows how data structures can be modeled by functors related by natural transformations (and isomorphisms). The transformation functions can then serve to shift a data structure and then get another program (eventually educing time complexity). The paper then explains the main concepts of the theory, how to apply them and gives an application to a concrete database and the performances obtained

Consistent Group and Coset Reductions of the Bosonic String

Dimensional reductions of pure Einstein gravity on cosets other than tori are inconsistent. The inclusion of specific additional scalar and p-form matter can change the situation. For example, a D-dimensional Einstein-Maxwell-dilaton system, with a specific dilaton coupling, is known to admit a consistent reduction on S^2= SU(2)/U(1), of a sort first envisaged by Pauli. We provide a new understanding, by showing how an S^3=SU(2) group-manifold reduction of (D+1)-dimensional Einstein gravity, of a type first indicated by DeWitt, can be broken into in two steps; a Kaluza-type reduction on U(1) followed by a Pauli-type coset reduction on S^2. More generally, we show that any D-dimensional theory that itself arises as a Kaluza U(1) reduction from (D+1) dimensions admits a consistent Pauli reduction on any coset of the form G/U(1). Extensions to the case G/H are given. Pauli coset reductions of the bosonic string on G= (G\times G)/G are believed to be consistent, and a consistency proof exists for S^3=SO(4)/SO(3). We examine these reductions, and arguments for consistency, in detail. The structures of the theories obtained instead by DeWitt-type group-manifold reductions of the bosonic string are also studied, allowing us to make contact with previous such work in which only singlet scalars are retained. Consistent truncations with two singlet scalars are possible. Intriguingly, despite the fact that these are not supersymmetric models, if the group manifold has dimension 3 or 25 they admit a superpotential formulation, and hence first-order equations yielding domain-wall solutions.Comment: Latex, 5 figures, 45 pages, minor correction

Kaluza-Klein and Gauss-Bonnet cosmic strings

We make a systematic investigation of stationary cylindrically symmetric solutions to the five-dimensional Einstein and Einstein-Gauss-Bonnet equations. Apart from the five-dimensional neutral cosmic string metric, we find two new exact solutions which qualify as cosmic strings, one corresponding to an electrically charged cosmic string, the other to an extended superconducting cosmic string surrounding a charged core. In both cases, test particles are deflected away from the singular line source. We extend both kinds of solutions to exact multi-cosmic string solutions.Comment: 26 pages, LaTex, no figure

O adsorption and incipient oxidation of the Mg(0001) surface

First principles density functional calculations are used to study the early oxidation stages of the Mg(0001) surface for oxygen coverages 1/16 <= Theta <= 3 monolayers. It is found that at very low coverages O is incorporated below the topmost Mg layer in tetrahedral sites. At higher oxygen-load the binding in on-surface sites is increased but at one monolayer coverage the on-surface binding is still about 60 meV weaker than for subsurface sites. The subsurface octahedral sites are found to be unfavorable compared to subsurface tetrahedral sites and to on-surface sites. At higher coverages oxygen adsorbs both under the surface and up. Our calculations predict island formation and clustering of incorporated and adsorbed oxygen in agreement with previous calculations. The calculated configurations are compared with the angle-scanned x-ray photoelectron diffraction experiment to determine the geometrical structure of the oxidized Mg(0001) surface.Comment: 10 pages, 5 figure

Approche formelle de fusion d'ontologies à l'aide des grammaires de graphes typés

L'article propose une approche formelle de fusion d'ontologies se reposant sur les grammaires de graphes typés. Elle se décompose en trois étapes : 1) la recherche de similarités entre concepts ; 2) la fusion des ontologies par l'approche algébrique SPO (Simple Push Out) ; 3) l'adaptation d'une ontologie globale par le biais de règles de réécriture de graphes. Contrairement aux solutions existantes, cette méthode offre une représentation formelle de la fusion d'ontologies ainsi qu'une implémentation fonctionnelle basée sur l'outil AGG