Global Dynamics for an HIV Infection Model with Crowley-Martin Functional Response and Two Distributed Delays

In this paper, an HIV dynamics model with two distributed intracellular delays incorporating Crowley-Martin functional response infection rate is investigated. The authors take into account multiple stage disease transmission and the latently infected cells (not yet producing virus) in our system. The authors consider nonnegativity, boundedness of solutions, and global asymptotic stability of the system. By constructing suitable Lyapunov functionals and using the Lyapunov-LaSalle invariance principle, the authors prove the global stability of the infected (endemic) equilibrium and the diseasefree equilibrium for time delays. The authors have proven that if the basic reproduction number R₀ is less than unity, then the disease-free equilibrium is globally asymptotically stable, and if R₀ is greater than unity, then the infected equilibrium is globally asymptotically stable. The results obtained show that the global dynamic behaviors of the model are completely determined by the basic reproduction number R₀ and that the time delay does not affect the global asymptotic properties of the model.     

Global stability of endemic equilibrium point of basic virus infection model with application to HBV infection

In this paper, the authors first show that if R ₀ ≤ 1, the infection free steady state is globally attractive by using approaches different from those given by Min, et al.(2008). Then the authors prove that if R ₀ > 1, the endemic steady state is also globally attractive. Finally, based on a patient’s clinical HBV DNA data of anti-HBV infection with drug lamivudine, the authors establish an ABVIM. The numerical simulations of the ABVIM are good in agreement with the clinical data.     

Global stability of an age-structured sir epidemic model with pulse vaccination strategy

This paper discusses the application of a pulse vaccination strategy to prevent and control some infectious diseases,which is described by age-structured SIR model in which susceptible and recovered individuals are structured by chronological age,while infected individuals are structured by infection age(duration since infection).The time dependent disease-free equilibrium is determined, for which an explicit expression exists.The analytical results show that there exists a globally stable infect ion-free situation if the impulsive period T and proportion p satisfy Ro(p,T) < 1.Optimal problem is discussed:Pulse vaccination strategy with minimal costs at given Ro(p,T) < 1.     

技术扩散现象的指数稳定性

考虑在技术传播中两类群体的变化规律，得到两个阅值R0和R1．当R0＜1时，技术扩散现象全局指数地衰减；当R1＞1时，存在技术扩散平衡点，技术扩散现象在局部范围内将指数地趋于稳定。     

An SEIRS epidemic model with two delays and pulse vaccination*

Pulse vaccination is an effective and important strategy to eradicate an infectious disease. The authors investigate an SEIRS epidemic model with two delays and pulse vaccination. By using the discrete dynamical system determined by stroboscopic map, the authors obtain that the infectious population dies out if R△ 〈 1, and the infectious population is uniformly persistent if R^△ 〉 1. The results indicate that a short period of pulse vaccination or a large pulse vaccination rate is a sufficient condition to eradicate the disease.     

ON AN SIS EPIDEMIC MODEL WITH STAGE STRUCTURE

A SIS infectious disease model with stage structure consisting of immature and mature stages is proposed using a discrete time delay. The aim of the paper is to investigate under which conditions the disease becomes endemic or not and to find the difference between the model with stage structure and the corresponding model without stage structure. It is shown that either there exists a unique endemic equilibrium point which is globally asymptotically stable or the disease dies out by using an iterative scheme. The effect of the time delay on the populations at equilibria is considered.     

网络上具有一般直接免疫的SIRS传染病模型分析

考虑复杂网络上具有一般直接免疫率的SIRS传染病模型。由地方病平衡点的存在性,确定了传染病的流行阈值λc,并且通过构造合适的李雅普诺夫函数证明:当λ≤λ_c时,无病平衡点全局渐近稳定;当λλ_c时,地方病平衡点全局渐近稳定。根据免疫率的分布,提出了一致性直接免疫和目标性直接免疫。结果表明,在平均免疫率相等的条件下存在免疫丧失率的临界值δ_c,当δδ_c(δδ_c)时,目标性免疫的流行阈值小于(大于)一致性免疫的流行阈值。     

Solutions for singular p-Laplacian equation in R n

In this paper, the authors study the existence and non-existence of positive solutions for singular p-Laplacian equation −∆ _p u = f(x)u ^−α + λg(x)u ^β in R ^N ; where N ≥ 3, 1 < p < N, λ > 0, 0 < α < 1, max(p, 2) < β + 1 < p* = \fracN_pN - p \frac{{{N_p}}}{{N - p}} . We prove that there exists a critical value ¤ such that the problem has at least two solutions if 0 < λ < Λ; at least one solution if λ = Λ; and no solutions if λ > Λ.     

The limit theorem for dependent random variables with applications to autoregression models

This paper studies the autoregression models of order one, in a general time series setting that allows for weakly dependent innovations. Let {X _t } be a linear process defined by X _t = Σ _k=0^∞ψ _k ɛ _t−k , where {ψ _k , k ≥ 0} is a sequence of real numbers and {ɛ _k , k = 0, ±1, ±2, …} is a sequence of random variables. Two results are proved in this paper. In the first result, assuming that {ɛ _k , k ≥ 1} is a sequence of asymptotically linear negative quadrant dependent (ALNQD) random variables, the authors find the limiting distributions of the least squares estimator and the associated regression t statistic. It is interesting that the limiting distributions are similar to the one found in earlier work under the assumption of i.i.d. innovations. In the second result the authors prove that the least squares estimator is not a strong consistency estimator of the autoregressive parameter α when {ɛ _k , k ≥ 1} is a sequence of negatively associated (NA) random variables, and ψ ₀ = 1, ψ _k = 0, k ≥ 1.     

A general iterative method of fixed points for equilibrium problems and optimization problems

The purpose of this paper is to present a general iterative scheme as below:

Asymptotic normality of wavelet estimator in heteroscedastic model with <Emphasis Type="Italic">α</Emphasis>-mixing errors

Consider heteroscedastic regression model Y _ni = g(x _ni ) + σ _ni ɛ _ni (1 ≤ i ≤ n), where σ _ni ² = f(u _ni ), the design points (x _ni , u _ni ) are known and nonrandom, g(·) and f(·) are unknown functions defined on closed interval [0, 1], and the random errors {ɛ _ni , 1 ≤ i ≤ n} are assumed to have the same distribution as {ξ _i , 1 ≤ i ≤ n}, which is a stationary and α-mixing time series with Eξ _i = 0. Under appropriate conditions, we study asymptotic normality of wavelet estimators of g(·) and f(·). Finite sample behavior of the estimators is investigated via simulations, too.     

The bound of price of anarchy for multi-class and multi-criteria traffic equilibrium problem

In this paper,we use the variational method to study the efficiency loss of user equilibrium for the multi-class,multi-criterion traffic equilibrium with general tolls and a discrete set of value of time.By introducing three important parameters k₁k₂,k₃,we derive several bounds of price of anarchy for this problem when tolls are considered and not considered as part of the system cost,with the cost-based criterion.     

SEMI ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON TWO UNIFORM MACHINES

Ia this paper, we consider a semi on-line version on two uniform machines Mi, i = 1, 2, where the processing time of the largest job is known in advance. A speed si（s1 = 1, 1 ≤s2 = s） is associated with machine Mi. Our goal is to maximize the Cmin. We give a Cmin 2 algorithm and prove its competitive ratio is at most 2s＋1/s＋1 We also claim the Cmin 2 algorithm is tight and the gap between the competitive ratio of Cmin2 algorithm and the optimal value is not greater than 0.555. It is obvious that our result coincides with that given by He for s =1.     

ON THE CONVERGENCE OF A NEW HYBRID PROJECTION ALGORITHM

For unconstrained optimization, a new hybrid projection algorithm is presented m the paper. This algorithm has some attractive convergence properties. Convergence theory can be obtained under the condition that Δ↓f（x） is uniformly continuous. If Δ↓f（x） is continuously differentiable pseudo-convex, the whole sequence of iterates converges to a solution of the problem without any other assumptions. Furthermore, under appropriate conditions one shows that the sequence of iterates has a cluster-point if and only if Ω＊ ≠ θ. Numerical examples are given at the end of this paper.     

A NEW FAMILY OF TRIVALENT CAYLEY NETWORKS ON WREATH PRODUCT Zm ～ Sn

We propose a new family of interconnection networks （WGn^m） with regular degree three. When the generator set is chosen properly, they are isomorphic to Cayley graphs on the wreath product Zm ～ Sn. In the case of m ≥ 3 and n ≥3, we investigate their different algebraic properties and give a routing algorithm with the diameter upper bounded by [m/2]（3n^2- 8n ＋ 4） - 2n ＋ 1. The connectivity and the optimal fault tolerance of the proposed networks are also derived. In conclusion, we present comparisons of some familiar networks with constant degree 3.     

Sliding mode H∞ control for a class of uncertain nonlinear state-delayed systems

A new proportional-integral (PI) sliding surface is designed for a class of uncertain nonlinear state-delayed systems. Based on this, an adaptive sliding mode controller (ASMC) is synthesized, which guarantees the occurrence of sliding mode even when the system is undergoing parameter uncertainties and external disturbance. The resulting sliding mode has the same order as the original system, so that it becomes easy to solve the H_∞ control problem by designing a memoryless H_∞ state feedback controller. A delay-dependent sufficient condition is proposed in terms of linear matrix inequalities (LMIs), which guarantees the sliding mode robust asymptotically stable and has a noise attenuation level γ in an H_∞ sense. The admissible state feedback controller can be found by solving a sequential minimization problem subject to LMI constraints by applying the cone complementary linearization method. This design scheme combines the strong robustness of the sliding mode control with the H_∞ norm performance. A numerical example is given to illustrate the effectiveness of the proposed scheme.     

IMPROVED ROBUST H-INFINITY ESTIMATION FOR UNCERTAIN CONTINUOUS-TIME SYSTEMS

The design of full-order robust estimators is investigated for continuous-time polytopic uncertain systems. The main purpose is to obtain a stable linear estimator such that the estimation error system remains robustly stable with a prescribed H∞ attenuation level. Firstly, a simple alternative proof is given for an improved LMI representation of H∞ performance proposed recently. Based on the performance criterion which keeps the Lyapunov matrix out of the product of the system dynamic matrices, a sufficient condition for the existence of the robust estimator is provided in terms of linear matrix inequalities. It is shown that the proposed design strategy allows the use of parameterdependent Lyapunov functions and hence it is less conservative than the earlier results. A numerical example is employed to illustrate the feasibility and advantage of the proposed design.     

Transient Queue Size Distribution Solution of Geom / G / 1 Queue with Feedback-A Recursive Method

This paper considers the Geom / G / 1 queueing model with feedback according to a late arrival system with delayed access (LASDA). Using recursive method, this paper studies the transient property of the queue size from the initial state N(0⁺) = i. Some new results about the recursive expression of the transient queue size distribution at any epoch n ⁺ and the recursive formulae of the equilibrium distribution are obtained. Furthermore, the recursive formulae of the equilibrium queue size distribution at epoch n ⁻, and n are obtained, too. The important relations between stationary queue size distributions at different epochs are discovered (being different from the relations given in M / G / 1 queueing system). The model discussed in this paper can be widely applied in all kinds of communications and computer network. This research is supported by the National Natural Science Foundation of China under Grant No. 70871084, the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No. 200806360001, and the Scientific Research Fund of Southwestern University of Finance and Economics.     

Induced Subgraph in Random Regular Graph

Let Gn,d be a random d-regular graph with n vertices, where d = o（n）. Given a fixed graph H, YH denotes the number of induced copies of H in Gn d In this paper, the authors determine the threshold of the event ＂YH 〉 0＂, and also obtain the induced subgraph counts inside the threshold interval.     

The recursive solution of queue length for <Emphasis Type="Italic">Geo/G</Emphasis>/1 queue with <Emphasis Type="Italic">N</Emphasis>-policy

This paper considers a discrete-time queue with N-policy and LAS-DA(late arrival system with delayed access) discipline.By using renewal process theory and probability decomposition techniques,the authors derive the recursive expressions of the queue-length distributions at epochs n~-,n~+,and n.Furthermore,the authors obtain the stochastic decomposition of the queue length and the relations between the equilibrium distributions of the queue length at different epochs(n~-,n~+,n and departure epoch D_n).