Tropical differential equations

Tropical differential equations are introduced and an algorithm is designed which tests solvability of a system of tropical linear differential equations within the complexity polynomial in the size of the system and in the absolute values of its coefficients. Moreover, we show that there exists a minimal solution, and the algorithm constructs it (in case of solvability). This extends a similar complexity bound established for tropical linear systems. In case of tropical linear differential systems in one variable a polynomial complexity algorithm for testing its solvability is designed.We prove also that the problem of solvability of a system of tropical non-linear differential equations in one variable is NP-hard, and this problem for arbitrary number of variables belongs to NP. Similar to tropical algebraic equations, a tropical differential equation expresses the (necessary) condition on the dominant term in the issue of solvability of a differential equation in power series.     

On stationary Markov processes with polynomial conditional moments

We study a class of stationary Markov processes with marginal distributions identifiable by moments such that every conditional moment of degree say m is a polynomial of degree at most m. We show that then under some additional, natural technical assumption there exists a family of orthogonal polynomial martingales. More precisely we show that such a family of processes is completely characterized by the sequence {(α_n, p_n)}_{n ? 0} where α′_ns are some positive reals while p′_ns are some monic orthogonal polynomials. Bakry and Mazet (Séminaire de Probabilit?s, vol. 37, 2003) showed that under some additional mild technical conditions each such sequence generates some stationary Markov process with polynomial regression.

We single out two important subclasses of the considered class of Markov processes. The class of harnesses that we characterize completely. The second one constitutes of the processes that have independent regression property and are stationary. Processes with independent regression property so to say generalize ordinary Ornstein–Uhlenbeck (OU) processes or can also be understood as time scale transformations of Lévy processes. We list several properties of these processes. In particular we show that if these process are time scale transforms of Lévy processes then they are not stationary unless we deal with classical OU process. Conversely, time scale transformations of stationary processes with independent regression property are not Lévy unless we deal with classical OU process.     

Effects of awareness program and delay in the epidemic outbreak

In the present paper, an epidemic model has been proposed and analyzed to investigate the impact of awareness program and reporting delay in the epidemic outbreak. Awareness programs induce behavioral changes within the population, and divide the susceptible class into two subclasses, aware susceptible and unaware susceptible. The existence and the stability criteria of the equilibrium points are obtained in terms of the basic reproduction number. Considering time delay as the bifurcating parameter, the Hopf bifurcation analysis has been performed around the endemic equilibrium. The direction of the Hopf bifurcation and the stability of the bifurcating periodic solutions are investigated by using the normal form theory and central manifold theorem. To verify the analytical results, comprehensive numerical simulations are carried out. Copyright © 2016 John Wiley & Sons, Ltd.     

SWEIA艾滋病毒传染模型及应用

人类免疫缺陷病毒(HIV)是一种严重威胁生命的病毒,感染艾滋病毒患者一般经历四个阶段:i)艾滋病毒阴性的窗口期(W);ii)阳性的无症状潜伏期(E);iii)有症状期(Ⅰ);以及iv)移除阶段(A).为深入研究艾滋病传播过程,建立SWEIA艾滋病毒传染模型,定义基本再生数,分析无病与地方病平衡点的存在性和局部稳定性,根据2004至2015年中国艾滋病患者数据,采用遗传算法对SWEIA模型中参数进行估计.通过对基本再生数敏感性分析以及模型数值随参数不同而产生的变化,揭示艾滋病窗口期的接触率是影响艾滋病流行的主要原因之一.     

Eléments finis stochastiques en élasticité linéaireA stochastic finite element method in linear mechanics

The stochastic finite element method presented in this Note consists in representing in a probabilistic form the response of a linear mechanical system whose material properties and loading are random. Each input random variable is expanded into a Hermite polynomial series in standard normal random variables. The response (e.g., the nodal displacement vector) is expanded onto the so-called polynomial chaos. The coefficients of the expansion are obtained by a Galerkin-type method in the space of probability. To cite this article: B. Sudret et al., C. R. Mecanique 332 (2004).     

Critical periods of perturbations of reversible rigidly isochronous centers

In this paper we discuss bifurcation of critical periods in an m-th degree time-reversible system, which is a perturbation of an n-th degree homogeneous vector field with a rigidly isochronous center at the origin. We present period-bifurcation functions as integrals of analytic functions which depend on perturbation coefficients and reduce the problem of critical periods to finding zeros of a judging function. This procedure gives not only the number of critical periods bifurcating from the period annulus but also the location of these critical periods. Applying our procedure to the case n=m=2 we determine the maximum number of critical periods and their location; to the case n=m=3 we investigate the bifurcation of critical periods up to the first order in ε and obtain the expression of the second period-bifurcation function when the first one vanishes.     

Effective partitioning method for computing generalized inverses and their gradients

We extend the algorithm for computing {1}, {1, 3}, {1, 4} inverses and their gradients from [11] to the set of multiple-variable rational and polynomial matrices. An improvement of this extension, appropriate to sparse polynomial matrices with relatively small number of nonzero coefficient matrices as well as in the case when the nonzero coefficient matrices are sparse, is introduced. For that purpose, we exploit two effective structures form [6], which make use of only nonzero addends in polynomial matrices, and define their partial derivatives. Symbolic computational package MATHEMATICA is used in the implementation. Several randomly generated test matrices are tested and the CPU times required by two used effective structures are compared and discussed.     

Explicit solution of the finite time L2-norm polynomial approximation problem

The aim of this paper is to present a new approach to the finite time L₂-norm polynomial approximation problem. A new formulation of this problem leads to an equivalent linear system whose solution can be investigated analytically. Such a solution is then specialized for a polynomial expressed in terms of Laguerre and Bernstein basis.