Asymptotic exponential cones of Metzler matrices and their use in the solution of an algebraic problem

The aim of this paper is that of investigating the asymptotic exponential cone of a single Metzler matrix, introduced in [23], and of defining and analysing the new concept of asymptotic exponential cone of a family of Metzler matrices (along a certain direction). These results will provide necessary and/or sufficient conditions for the solvability of an interesting algebraic problem that arises in the context of continuous-time positive switched systems and, specifically, in the investigation of the reachability property [21,22,25].     

Problème de Cauchy non autonome pour des équations d'évolution

Nous étudions dans un espace de Banach le problème de Cauchy pour des équations d'évolution gouvernées par des opérateurs dépendant du temps dans un cadre plus général que les hypothèses d'accrétivité. D'une part, ce cadre s'adapte bien à des perturbations continues vérifiant des conditions de type Osgood, d'autre part, l'essentiel des résultats de la théorie moderne des équations d'évolution abstraites se trouve prolongé à ce nouveau contexte.     

Can shadowing mimic the QCD phase transition?

The directed flow of protons is studied in the quark-gluon string model as a function of the impact parameter for S+S and Pb+Pb reactions at 160 AGeV/c. A significant reduction of the directed flow in midrapidity range, which can lead to the development of the antiflow, is found due to the absorption of early emitted particles by massive spectators (shadowing effect). This effect can mimic the formation of the quark-gluon plasma (QGP). However, in the absorption scenario the antiflow is stronger for the system of light colliding nuclei than for the heavy ones, while in the case of the plasma creation the effect should be opposite.     

On a nonlocal problem for semilinear differential equations with upper semicontinuous nonlinearities in general Banach spaces

Sufficient conditions on the existence of mild solutions for the following semilinear nonlocal evolution inclusion with upper semicontinuous nonlinearity: u^′(t)∈A(t)u(t)+F(t,u(t)), 0<t?d, u(0)=g(u), are given when g is completely continuous and Lipschitz continuous in general Banach spaces, respectively. An example concerning the partial differential equation is also presented.     

Local exact Lagrangian controllability of the Burgers viscous equation

We study and give the definition of the exact Lagrangian controllability of the viscous Burgers equation and prove a local result. We give similar results for the heat equation in dimension 1.     

On the sharpness of two-sided bounds for the Perron Root and of the related eigenvalue inclusion sets

The paper considers the sharpness problem for certain two-sided bounds for the Perron root of an irreducible nonnegative matrix. The results obtained are applied to prove the sharpness of the related eigenvalue inclusion sets in classes of matrices with fixed diagonal entries, bounded above deleted absolute row sums, and a partly specified irreducible sparsity pattern.     

An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees

The problem of reconstructing the duplication tree of a set of tandemly repeated sequences which are supposed to have arisen by unequal recombination, was first introduced by Fitch (1977), and has recently received a lot of attention. In this paper, we place ourselves in a distance framework and deal with the restricted problem of reconstructing single copy duplication trees. We describe an exact and polynomial distance based algorithm for solving this problem, the parsimony version of which has previously been shown to be NP-hard (like most evolutionary tree reconstruction problems). This algorithm is based on the minimum evolution principle, and thus involves selecting the shortest tree as being the correct duplication tree. After presenting the underlying mathematical concepts behind the minimum evolution principle, and some of its benefits (such as statistical consistency), we provide a new recurrence formula to estimate the tree length using ordinary least-squares, given a matrix of pairwise distances between the copies. We then show how this formula naturally forms the dynamic programming framework on which our algorithm is based, and provide an implementation in O(n³) time and O(n²) space, where n is the number of copies.     

Dynamic evolution of economically preferred facilities

In a sustained development scenario, it is often the case that an investment is to be made over time in facilities that generate benefits. The benefits result from joint synergies between the facilities expressed as positive utilities specific to some subsets of facilities. As incremental budgets to finance fixed facility costs become available over time, additional facilities can be opened. The question is which facilities should be opened in order to guarantee that the overall benefit return over time is on the highest possible trajectory. This problem is common in situations such as ramping up a communication or transportation network where the facilities are hubs or service stations, or when introducing new technologies such as alternative fuels for cars and the facilities are fueling stations, or when expanding the production capacity with new machines, or when facilities are functions in a developing organization that is forced to make choices of where to invest limited funding.