Study of the desorption of ethylene oxide fixed on various materials during sterilization by a new procedure

A continuous sterilization process using ethylene oxide was studied in comparison with a classical method in order to evaluate gas retention as a function of time and temperature on polyethylene, PVC, and rubber materials

A GRASPxELS with Depth First Search Split Procedure for the HVRP

Split procedures have been proved to be efficient within global framework optimization for routing problems by splitting giant tour into trips. This is done by generating optimal shortest path within an auxiliary graph built from the giant tour. An efficient application has been introduced for the first time by Lacomme et al. (2001) within a metaheuristic approach to solve the Capacitated Arc Routing Problem (CARP) and second for the Vehicle Routing Problem (VRP) by Prins (2004). In a further step, the Split procedure embedded in metaheuristics has been extended to address more complex routing problems thanks to a heuristic splitting of the giant tour using the generation of labels on the nodes of the auxiliary graph linked to resource management. Lately, Duhamel et al. (2010) defined a new Split family based on a depth first search approach during labels generation in graph. The efficiency of the new split method has been first evaluated in location routing problem with a GRASP metaheuristic. Duhamel et al. (2010) provided full numerical experiments on this topic

CLIC: An Agent-Based Interactive and Autonomous Piece of Art

International audienceThis work consists of integrating programming paradigms such as multi-agent systems and rule-based reasoning into a multimedia creation and display platform for interactive artistic creation. It has been developed in order to allow artists to build dynamic and interactive exhibitions based on pictures and sounds and featuring self-evolving and autonomous configurations

A bi-objective stochastic approach for stochastic CARP

The Capacitated Arc Routing Problem (CARP) occurs in applications like urban waste collection or winter gritting. It is usually defined in literature on an undirected graph G = (V, E) , with a set V of n nodes and a set E of m edges. A fleet of identical vehicles of capacity Q is based at a depot node. Each edge i has a cost (length) ci and a demand qi (e.g. an amount of waste), and it may be traversed any number of times. The edges with non-zero demands or tasks require service by a vehicle. The goal is to determine a set of vehicle trips (routes) of minimum total cost, such that each trip starts and ends at the depot, each task is serviced by one single trip, and the total demand handled by any vehicle does not exceed Q . To the best of our knowledge the best published method is a memetic algorithm first introduced in 2001. This article provides a new extension of the NSGA II (Non-dominated Sorting Genetic Algorithm) template to comply with the stochastic sight of the CARP. The main contribution is: - to introduce mathematical expression to evaluate both cost and duration of the longest trip and also standard deviation of these two criteria. - to use a NGA-II template to optimize simultaneously the cost and the duration of the longest trip including standard deviation. The numerical experiments managed on the thee well-known benchmark sets of DeArmon, Belenguer and Benavent and Eglese, prove it is possible to obtain robust solutions in four simultaneous criteria in rather short computation times

Optimization of pathogenicity assays to study the Arabidopsis thaliana-Xanthomonas campestris pv. campastris pathosystem

The cruciferous weed Arabidopsis thaliana and the causal agent of black rot disease of Crucifers Xanthomonas campestris pv. campestris ( Xcc ) are both model organisms in plant pathology. Their interaction has been studied successfully in the past, but these investigations suffered from high variability. In the present study, we describe an improved Arabidopsis- Xcc pathosystem that is based on a wound inoculation procedure. We show that after wound inoculation, Xcc colonizes the vascular system of Arabidopsis leaves and causes typical black rot symptoms in a compatible interaction, while in an incompatible interaction bacterial multiplication is inhibited. The highly synchronous and reproducible symptom expression allowed the development of a disease scoring scheme that enabled us to analyse the effects of mutations in individual genes on plant resistance or on bacterial virulence in a simple and precise manner. This optimized Arabidopsis- Xcc pathosystem will be a robust tool for further genetic and post-genomic investigation of fundamental questions in plant pathology. (Résumé d'auteur

An RxLR effector from phytophthora infestans prevents re-localisation of two plant NAC transcription factors from the endoplasmic reticulum to the nucleus

The plant immune system is activated following the perception of exposed, essential and invariant microbial molecules that are recognised as non-self. A major component of plant immunity is the transcriptional induction of genes involved in a wide array of defence responses. In turn, adapted pathogens deliver effector proteins that act either inside or outside plant cells to manipulate host processes, often through their direct action on plant protein targets. To date, few effectors have been shown to directly manipulate transcriptional regulators of plant defence. Moreover, little is known generally about the modes of action of effectors from filamentous (fungal and oomycete) plant pathogens. We describe an effector, called Pi03192, from the late blight pathogen Phytophthora infestans, which interacts with a pair of host transcription factors at the endoplasmic reticulum (ER) inside plant cells. We show that these transcription factors are released from the ER to enter the nucleus, following pathogen perception, and are important in restricting disease. Pi03192 prevents the plant transcription factors from accumulating in the host nucleus, revealing a novel means of enhancing host susceptibility

Description of the Grover algorithm based on geometric considerations

This paper concerns the Grover algorithm that permits to make amplification of quantum states previously tagged by an Oracle. Grover's algorithm allows searches in an unstructure database of n entries finding a marked element with a quadratic speedup. The algorithm requires a predefined number of runs to succeed with probability close to one.This article provides a description of the amplitude amplification quantum algorithm mechanism in a very short computational way, based on tensor products and provides a geometric presentation of the successive system states. All the basis changes are fully described to provide an alternative to the wide spread Grover description based only on matrices and complex tensor computation. Our experiments encompass numerical evaluations of circuit using the Qiskit library of IBM that meet the theoretical consideration

A technical note for the 91-clauses SAT resolution with Indirect QAOA based approach

This paper addresses the resolution of the 3-SAT problem using a QAOA-like approach. The chosen principle involves modeling the solution ranks of the 3-SAT problem, which, in this particular case, directly represent a solution. This results in a highly compact circuit with few gates, enabling the modeling of large-sized 3-SAT problems. Numerical experimentation demonstrates that the approach can solve instances composed of 91 clauses and 20 variables with an implementation based on Qiskit

A Framework for the Evaluation of Biosecurity, Commercial, Regulatory, and Scientific Impacts of Plant Viruses and Viroids Identified by NGS Technologies

Recent advances in high-throughput sequencing technologies and bioinformatics have generated huge new opportunities for discovering and diagnosing plant viruses and viroids. Plant virology has undoubtedly benefited from these new methodologies, but at the same time, faces now substantial bottlenecks, namely the biological characterization of the newly discovered viruses and the analysis of their impact at the biosecurity, commercial, regulatory, and scientific levels. This paper proposes a scaled and progressive scientific framework for efficient biological characterization and risk assessment when a previously known or a new plant virus is detected by next generation sequencing (NGS) technologies. Four case studies are also presented to illustrate the need for such a framework, and to discuss the scenarios.Peer reviewe

Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization

This paper addresses the parallel machine scheduling problem with family dependent setup times and total weighted completion time minimization. In this problem, when two jobs j and k are scheduled consecutively on the same machine, a setup time is performed between the finishing time of j and the starting time of k if and only if j and k belong to different families. The problem is strongly NP-hard and is commonly addressed in the literature by heuristic approaches and by branch-and-bound algorithms. Achieving proven optimal solution is a challenging task even for small size instances. Our contribution is to introduce five novel mixed integer linear programs based on concepts derived from one-commodity, arc-flow and set covering formulations. Numerical experiments on more than 13000 benchmark instances show that one of the arc-flow models and the set covering model are quite efficient, as they provide on average better solutions than state-of-the-art approaches, with shorter computation times, and solve to proven optimality a large number of open instances from the literature