You are on page 1of 9

A pest management SI model with periodic biological

and chemical control concern


q
Jianjun Jiao
a,b,
*
, Lansun Chen
a
a
Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, Peoples Republic of China
b
School of Mathematics and Statistics, Guizhou College of Finance and Economics, Guiyang 550004, Peoples Republic of China
Abstract
In this work, we consider an SI model for pest management, with concerns about impulsive releases of infective pests
and pesticides sprays. We prove that all solutions of
S
0
t rSt 1
SthIt
K
_ _
bStI
2
t; t 6 ns;
I
0
t bStI
2
t wIt; t 6 ns;
DSt l
1
St; t ns;
DIt l
2
It l; t ns; n 1; 2; . . . ;
_

_
I
are uniformly ultimately bounded and there exists globally asymptotic stability periodic solution of pest-extinction when
ln
1
1l
1
> rs
rlh1expws
Kw11l
2
expws

bl
2
1exp2ws
2w11l
2
expws
2
is satised, and the condition for permanence of system (I) is also ob-
tained. It is concluded that the approach of combining impulsive infective releasing with impulsive pesticide spraying pro-
vides reliable tactic basis for practical pest management.
2006 Elsevier Inc. All rights reserved.
Keywords: Impulsive; Infective; Chemical control; Pest- extinction
1. Introduction
According to reports of the Food and Agriculture Organization, the warfare between man and pests has
sustained for thousands of years. With the development of society and progress of science and technology,
human have adopted some advanced and modern weapons, for instance chemical pesticides, biological pesti-
cides, remote sensing and measure, computers, atomic energy etc., where some brilliant achievements have
0096-3003/$ - see front matter 2006 Elsevier Inc. All rights reserved.
doi:10.1016/j.amc.2006.06.070
q
Supported by National Natural Science Foundation of China (10171117) and the Doctoral Fund of Guizhou College of Finance and
Economic (in China).
*
Corresponding author. Address: Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, Peoples
Republic of China.
E-mail addresses: jiaojianjun02@263.net (J. Jiao), lschen@math.ac.cn (L. Chen).
Applied Mathematics and Computation 183 (2006) 10181026
www.elsevier.com/locate/amc
been obtained. However, the warfare is not over, and will continue. A great deal of and a large variety of pes-
ticides were used to control pests. In all, pesticides are useful because they can quickly kill a signicant portion
of a pest population and sometimes provide the only feasible method for preventing economic loss. However,
pesticide pollution is also recognized as a major health hazard to human beings and benecial insects. Length-
ening the period of pesticides spraying may reduce the cost of pest management. In this paper, a good
approach is given which combines pesticides ecacy tests with biological research.
The use of bacteria, fungi and viruses is potentially one of the most important approaches in pest control.
For example, Bacillus thuringiensis, which is available in commercial preparations, is used in the control of a
large number of pests [13,8,9]. An advantage of using insect pathogens is that they are safe to man and are
usually safe to benecial insects.
There is a vast amount of literature on the applications of microbial disease to suppress pests [3,4,7,9,10],
and many good articles [1525] devote to disease transmission, but there are a few papers on a mathematical
model of the dynamical of microbial disease in pest control [5,6,11,31]. In this paper, we will introduce addi-
tional infective pests, which are obtained in the laboratory, into a natural SI system with spaying pesticides for
pest control. We shall examine the strategy of combining periodic releasing of infective pests with periodic
spraying of pesticides in a more exible manner.
2. Model formulation
The basic SI model is
S
0
t bStIt;
I
0
t bStIt wIt;
_
2:1
where b > 0 is called the transmission coecient, w > 0 is called the death coecient of I(t), S(t) denotes the
number of susceptible insects and I(t) denotes the number of infective insects. In our models we assume that all
newborns are susceptible, and the basic model considered in [12] follows a model of the epidemic under a con-
trol variable:
S
0
t bStIt;
I
0
t bStIt wIt ut;
_
2:2
where u(t), which is a control variable, denotes the rate of pests infected in the laboratory, and there are some
other conditions for the above system, but we consider that the variable u(t) is dicult in practice. And the
susceptible pests S(t) will not go to extinction with regard to human beings and some mass residing animals,
Anderson et al. pointed out that standard incidence is more suitable than bilinear incidence [2628]. Levin
et al. have adopted a incidence form like bS
q
I
p
or
bS
q
I
p
N
which depends on dierent infective diseases and envi-
ronments [29,30]. So we develop (2.2) by introducing a constant periodic releasing of the infective pests and
spaying pesticides at a xed moment, that is, we consider the following impulsive dierential equation with a
xed moment:
S
0
t rSt 1
SthIt
K
_ _
bStI
2
t; t 6 ns;
I
0
t bStI
2
t wIt; t 6 ns;
DSt l
1
St; t ns;
DIt l
2
It l; t ns; n 1; 2; . . . ;
_

_
2:3
where r > 0 is the intrinsic growth rate of pests, K > 0 is the pests capacity of environment, DI(t) = I(t
+
) I(t),
0 < h < 1, l P0 is the released amount of infective pests at t = ns, n 2 Z
+
, 1 > l
1
P0, 1 > l
2
P0 respectively,
which represents the portion of susceptible and infective pests due to spraying pesticides at t = ns, n 2 Z
+
and
Z
+
= {1, 2, . . .}, s is the period of the impulsive eect, that is, we can use a combination of biological and
chemical tactics to eradicate pests or keep the pest population below the damage level.
J. Jiao, L. Chen / Applied Mathematics and Computation 183 (2006) 10181026 1019
3. Qualitative analysis for model (2.3)
The solution of (2.3), denote by x(t) = (S(t), I(t))
T
, is a piecewise continuous function x : R

! R
2

, x(t) is
continuous on (ns, (n + 1)s], n 2 Z
+
and xns

lim
t!ns
xt exists. Obviously the global existence and
uniqueness of solutions of (2.3) is guaranteed by the smoothness properties of f, which denote the mapping
dened by the right-side of system (2.3) (see [13]). Before we state the main results, we need to give some lem-
mas which will be used in the next section. Since (S
0
(t) = 0 whenever S(t) = 0, I
0
(t) = 0 whenever I(t) = 0,
t 5ns, and I(ns
+
) = I(ns) + l, l P0. So we have
Lemma 1. Suppose x(t) is a solution of (2.3) with x(0
+
) P0, then x(t) P0 for t P0, and further x(t) > 0, t P0
for x(0
+
) > 0.
Lemma 2 (see [13, p. 23, Lemma 2.2]). Let the function m 2 PC
0
[R
+
, R] satises the inequalities
m
0
t 6 ptmt qt; t Pt
0
; t 6 t
k
; k 1; 2; . . . ;
mt

k
6 d
k
mt
k
b
k
; t t
k
;
_
3:1
where p, q 2 PC[R
+
, R] and d
k
P0, b
k
are constants, then
mt 6 mt
0

t
0
<t
k
<t
d
k
exp
_
t
t
0
ps ds
_ _

t
0
<t
k
<t

t
k
<t
j
<t
d
j
exp
_
t
t
0
ps ds
_ _
_ _
b
k

_
t
t
0

s<t
k
<t
d
k
exp
_
t
s
pr dr
_ _
qs ds; t Pt
0
:
Now, we show that all solutions of (2.3) are uniformly ultimately bounded.
Lemma 3. There exists a constant M > 0 such that S(t) 6 M, I(t) 6 M for each solution (S(t), I(t)) of (2.3) with
all t large enough.
Proof. Dene V(t) = S(t) + I(t), then t 5ns. We have
D

V t wV t r wSt
rS
2
t
K

rhStIt
K
6 r wSt
rS
2
t
K
6 M
0
;
where M
0

Krw
2
4r
, when t = ns, V(ns
+
) = (1 l
1
)S(ns) + (1 l
2
)I(ns) + l 6 V(ns) + l. By Lemma 2, for
t 2 (ns, (n + 1)s], we have
V t 6 V 0 expwt
_
t
0
M
0
expwt s ds

0<ns<t
lexpwt ns
V 0 expwt
M
0
w
1 expwt l
expwt s expwt n 1s
1 expws
< V 0 expwt
M
0
w
1 expwt
l expwt s
1 expws

l expws
expws 1
!
M
0
w

l expws
expws 1
as t ! 1:
So V(t) is uniformly ultimately bounded. Hence, by the denition of V(t), there exists a constant M > 0 such
that S(t) 6 M, I(t) 6 M for t large enough. The proof is complete. h
If S(t) = 0, we have the following subsystem of (2.3):
I
0
t wIt; t 6 ns;
Ins

1 l
2
Ins l; t ns; n 1; 2; . . .
_
3:2
1020 J. Jiao, L. Chen / Applied Mathematics and Computation 183 (2006) 10181026
Obviously

It
l expwtns
11l
2
expws
; t 2 ns; n 1s; n 2 Z

;

I0


l
11l
2
expws
is a positive periodic solu-
tion of (3.2). Since the solution of (3.2) is It 1 l
2


I0


l
11l
2
expwt
_ _
expwt

It;
t 2 ns; n 1s; n 2 Z

, so we derive
Lemma 4. System (3.2) has a positive periodic solution

It and for every solution I(t) of (3.2) we have It !

It
as t ! 1.
From the above discussion we know that (2.3) has a pest-extinction periodic solution
0;

It 0;
l expwt ns
1 1 l
2
expws
_ _
3:3
for ns < t 6 (n + 1)s, and

Ins



I0


l
11l
2
expws
; n 2 Z

.
Theorem 1. Let (S(t), I(t)) be any solution of (2.3), if
ln
1
1 l
1
> rs
rlh1 expws
Kw1 1 l
2
expws

bl
2
1 exp2ws
2w1 1 l
2
expws
2
3:4
holds, then pest-extinction solution 0;

It of (2.3) is globally asymptotically stable.
Proof. First, we prove the local stability. Dening s(t) = S(t), it It

It, we have the following linearly
similar system for (2.3) which concerns one periodic solution 0;

It:
dst
dt
dit
dt
_ _

r
rh
K

It b

It
2
0
b

It
2
w
_ _
st
it
_ _
:
It is easy to obtain the fundamental solution matrix
Ut
exp
_
t
0
r
rh
K

Is b

It
2
ds
_ _
0
expwt
_ _
:
There is no need to calculate the exact form of
*
as it is not required in the analysis that follows. The linear-
ization of the third and fourth equations of (2.3) is
sns

ins

_ _

1 l
1
0
0 1 l
2
_ _
sns
ins
_ _
:
The stability of the periodic solution 0;

It is determined by the eigenvalues of
M
1 l
1
0
0 1 l
2
_ _
/s;
where
k
1
1 l
2
expws < 1; k
2
1 l
1
exp
_
s
0
r
rh
K

Is b

It
2
_ _
ds
_ _
according to the Floquet theory [14], if jk
2
j < 1, i.e.
ln
1
1 l
1
> rs
rlh1 expws
Kw1 1 l
2
expws

bl
2
1 exp2ws
2w1 1 l
2
expws
2
holds, then 0;

It is locally stable.
In the following, we will prove the global attraction. Choose a e > 0 such that
q 1 l
1
exp
_
s
0
r
rh
K

It e b

It e
2
_ _
dt
_ _
< 1:
J. Jiao, L. Chen / Applied Mathematics and Computation 183 (2006) 10181026 1021
From the second equation of (2.3) we notice that
dIt
dt
PwIt, so we consider the following impulsive dif-
ferential equation:
dyt
dt
wyt; t 6 ns;
yt

1 l
2
yt l; t ns;
y0

I0

:
_

_
3:5
From Lemma 2 and comparison theorem of impulsive equation (see Theorem 3.1.1 in [13]), we have
I(t) Py(t) and yt !

It as t ! 1. Then
It Pyt P

It e 3:6
for all t large enough. For convenience we may assume (3.6) holds for all t P0, From (2.3) and (3.6) we get
dSt
dt
6 rSt 1
rh
K

It e b

It e
2
_ _
; t 6 ns;
Sns

1 l
1
Sns; t ns; n 1; 2; . . .
_
3:7
So Sn 1s 6 Sns

1 l
2
exp
_
n1s
ns
r
rh
K
Is e b

It e
2
_ _
ds
_ _
. Hence S(ns) 6 S(0
+
)q
n
and
S(ns) ! 0 as n ! 1, therefore S(t) ! 0 as t ! 1.
Next we prove that It !

It as t ! 1, For 0 < e 6 w, there must exist a t
0
> 0 such that 0 < S(t) < e for
all t Pt
0
. Without loss of generality, we may assume that 0 < S(t) < e for all t P0, then for system (2.3) we
have
wIt 6
dIt
dt
6 w eIt 3:8
then we have z
1
(t) 6 I(t) 6 z
2
(t) and z
1
t !

It; z
2
t !

It as t ! 1. While z
1
(t) and z
2
(t) are the solutions
of
dz
1
t
dt
wz
1
t; t 6 ns;
z
1
t

1 l
2
z
1
t l; t ns;
z
1
0

I0

_
3:9
and
dz
2
t
dt
w ez
2
t; t 6 ns;
z
2
t

1 l
2
z
2
t l; t ns;
z
2
0

I0

;
_

_
3:10
respectively,

z
2
t
l expwetns
11l
2
expwes
for ns < t 6 (n + 1)s. Therefore, for any e
1
> 0, there exists a t
1
, t > t
1
such that

It e
1
< It <

z
2
t e
1
:
Let e ! 0, so we have

It e
1
< It <

It e
1
for t large enough, which implies It !

It as t ! 1. This completes the proof. h
The next part is the investigation of the permanence of the system (2.3). Before starting our theorem, we
give the following denition.
Denition 3.1. System (2.3) is said to be permanent if there are constants m, M > 0 (independent of initial
value) and a nite time T
0
such that for all solutions (S(t), I(t)) with all initial values S(0
+
) > 0, I(0
+
) > 0,
m 6 S(t) 6 M, m 6 I(t) 6 M holds for all t PT
0
. Here T
0
may depend on the initial values (S(0
+
), (I(0
+
)).
1022 J. Jiao, L. Chen / Applied Mathematics and Computation 183 (2006) 10181026
Theorem 2. Let (S(t), I(t)) be any solution of (2.3). If
ln
1
1 l
1
< rs
rlh1 expws
Kw1 1 l
2
expws

bl
2
1 exp2ws
2w1 1 l
2
expws
2
3:11
holds, then the system (2.3) is permanent.
Proof. Suppose (S(t), I(t)) is a solution of (2.3) with S(0) > 0, I(0) > 0. By Lemma 3, we have proved there
exists a constant M > 0 such that S(t) 6 M, I(t) 6 M for t large enough. We may assume S(t) 6 M,
I(t) 6 M and M >

r
b
_
for t P0. From (3.6) we know It >

It e
2
for all t large enough and e
2
> 0, so
It P
l expws
1expws
e
2
m
2
for t large enough. Thus, we only need to nd m
1
> 0 such that S(t) Pm
1
for t large
enough, we will do it in the following two steps.
(1) By condition (3.11), we can select m
3
> 0, e
1
> 0 small enough such that m
3
<
w
b
; d
bm
3
M < w; r rs
r
K
m
3
s
rh
K
be
2
1
_ _
s
l
wd
rh
K
2
1
_ _
1e
wds
11l
2
e
wds

bl
2
1e
2wds

2wd11l
2
e
wds

> 0, we will
prove S(t) < m
3
cannot hold for t P0. Otherwise,
dIt
dt
6 w dIt; t 6 ns;
It

1 l
2
It l; t ns:
_
3:12
By Lemmas 3 and 4, we have I(t) 6 z(t) and zt ! zt; t ! 1, where z(t) is the solution of
dzt
dt
w dzt; t 6 ns;
zt

zt l; t ns;
z0

I0

_
3:13
and

z
2
t
l expwdtns
11l
2
expwds
, t 2 (ns, (n + 1)s]. Therefore, there exists a T
1
> 0 such that
It 6 zt 6 zt e
1
and
dSt
dt
PSt r
r
K
m
3

rh
K
zt e
1
bzt e
1

2
_ _
; t 6 ns;
St

1 l
1
St; t ns; n 1; 2; . . .
_
3:14
for t PT
1
. Let N
1
2 N and N
1
s > T
1
. Integrating (3.14) on (ns, (n + 1)s), n PN
1
, we have
Sn 1s P1 l
1
Sns

exp
_
n1s
ns
r
r
K
m
3

rh
K
zt e
1
bzt e
1

2
_ _
dt
_ _
1 l
1
Snse
r
then S((N
1
+ k)s) P(1 l
1
)
k
S(N
1
s
+
)e
kr
! 1, as k ! 1, which is a contradiction to the boundedness of
S(t). Hence there exists a t
1
> 0 such that S(t) Pm
3
.
(2) If S(t) Pm
3
for t Pt
1
, then our aim is obtained. Hence, we need only to consider those solutions which
leave region R fSt; It 2 R
2

: St < m
3
g and reenter it again. Let t

inf
tPt
1
fSt < m
3
g, then there are
two possible cases for t
*
. h
Case 1. t
*
= ns, n
1
2 Z
+
, then S(t) Pm
3
for t 2 [t
1
, t
*
) and S(t
*
) = m
3
. And (1 l
1
)m
3
6 S(t
+
) 6
(1 l
1
)S(t) 6 m
3
. Select n
2
, n
3
2 N, such that
n
2
s > T
2

ln
e
1
Ml
_ _
w d
;
1 l
1

n
2
e
n
3
r
e
n
2
r
1
s
> 1 l
1

n
2
e
n
3
r
e
n
2
1r
1
s
> 1;
J. Jiao, L. Chen / Applied Mathematics and Computation 183 (2006) 10181026 1023
where r
1
r
rm
3
K

h
K
r
rh
K
M bM
2
< 0. Let T = n
1
s + n
2
s. We claim that there must be a t
2
2 [t
*
, t
*
+ T]
such that S(t
2
) > m
3
. Otherwise, consider (3.13) with z(t
*
+
) = I(t
*
+
). We have
zt zt


l
1 1 l
2
e
wds
_ _
e
wdtt

zt;
t 2 (ns, (n + 1)s], n
1
6 n 6 n
1
+ n
2
+ n
3
, then
jzt ztj < l Me
wdtn
1
1s
< e
1
and It 6 zt 6 zt e
1
, t
*
+ n
2
s 6 t 6 t
*
+ T, which implies (3.14) holds for t
*
+ n
2
s 6 t 6 t
*
+ T. As in
step1, we have
St

T PSt

n
2
se
n
3
r
:
The rst equation of (2.3) gives
dSt
dt
PSt r
r
K
m
3

rh
K
M bM
2
_ _
r
1
St; t 6 ns;
St

1 l
1
St; t ns:
_
3:15
Integrating (3.15) on [t
*
, t
*
+ n
2
s], we have
St

n
2
s Pm
3
1 l
1

n
2
e
r
1
n
2
s
:
Thus we have
St

T Pm
3
1 l
1

n
2
e
r
1
n
2
s
e
n
3
r
> m
3
which is a contradiction. Let

t inf
tPt
fSt Pm
3
g, thus S

t Pm
3
for t 2 t

t. We have St P
1 l
1

n
2
n
3
St

e
r
1
tt

P1 l
1

n
2
n
3
m
3
e
r
1
n
2
n
3

m
1
for t P

t. So we have S(t) Pm
1
. The same arguments
can be continued since S

t Pm
3
. Hence S(t) Pm
1
for all t Pt
1
.
Case 2. t 5ns, n 2 Z
+
, then S(t) Pm
3
for t Pt
0
1
, and S(t
*
) = m
3
. Let t

inf
tPt
0
1
fSt < m
3
g, then S(t) Pm
3
for t 2 t
0
1
; t

and S(t
*
) = m
3
. Suppose t

2 n
0
1
s; n
0
1
1s; n
0
1
2 N. We claim that there must be a
t
0
2
2 n
0
1
1s; n
0
1
1s T. Consider (3.13) with zn
0
1
1s

In
0
1
1s

. We have
zt zn
1
1s


l
1 1 l
2
e
wds
_ _
e
wdtn
0
1
1s
zt;
t 2 (ns, (n + 1)s], n
0
1
1 6 n 6 n
0
1
1 n
2
n
3
, then
jzt ztj < l Me
wdtn
0
1
1s
< e
1
and It 6 zt 6 zt e
1
, n
0
1
1 n
2
s 6 t 6 n
0
1
1 Ts, which implies (3.14) holds for n
0
1

1 n
2
s 6 t 6 n
0
1
1s T. As in step1, we have
Sn
0
1
1 n
2
n
3
s P1 l
1

n
3
Sn
0
1
1 n
2
se
n
3
r
:
The rst equation of (2.3) gives
dSt
dt
PSt r
r
K
m
3

rh
K
b
_ _
M
_ _
r
1
St:
Integrating it on t

; n
0
1
1 n
2
s, we have
Sn
0
1
1 n
2
s P1 l
1

n
2
1
m
3
e
r
1
n
2
1s
:
Then
Sn
0
1
1 n
2
n
3
s Pm
3
e
r
1
n
2
1s
e
n
3
r
> m
3
which is a contradiction. Let

t
0
inf
tPt
fSt Pm
3
g, thus S

t
0
Pm
3
for t 2 t

t. We have St P
St

e
r
1
tt

Pm
3
e
r
1
1n
2
n
3

m
1
for t P

t
0
. The same arguments can be continued since S

t
0
Pm
3
. Hence
S(t) Pm
1
for all t Pt
1
, The proof is complete.
1024 J. Jiao, L. Chen / Applied Mathematics and Computation 183 (2006) 10181026
Remark 3.1. Let f s rs
rlh1expws
Kw11l
2
expws

bl
2
1exp2ws
2w11l
2
expws
2
ln
1
1l
1
, we easily know f 0
ln
1
1l
1
< 0; f s ! 1 as s ! 1, and
f
00
s
rll
2
hw
2
1 1 l
2
e
ws

1 1 l
2
e
ws

3

2e
2w
e
3w
f31 l
2
21 l
2

2
e
ws
1 l
2
e
2w
g
1 1 l
2
e
ws

4
bwl
2
> 0:
So f(s) = 0 has a unique positive root, denoted by s
max
. From Theorems 1 and 2 we know s
max
is a threshold.
If s < s
max
, then the pest-extinction solution 0;

It of system (2.3) is globally asymptotically stable. If
s > s
max
, then the system (2.3) is permanent.
Remark 3.2. If l = 0, i.e. there are no periodic releasing infective pests. Thus, we can easily obtain that
s
1
ln
1
1l
1
is the threshold. Obviously, s
max
> s
1
, i.e. impulsively releasing infective pests may lengthen the
period of spraying pesticides and therefore reduce the cost of pests control.
4. Discussion
In this paper, according to the fact, an SI model with impulsive transmitting infective pests and spraying
pesticides at xed moment is proposed and investigated, we analyzed the pest-extinction periodic solution
of such a system which is global asymptotic stability, and obtained the condition for the permanence of system
(2.3). There are some interesting problems: how to optimize the amount of spraying pesticides? What is the
determining time of impulsive releasing infective pests depending on the state of insect pest? How this impul-
sive releasing infective pest aect the system? In the real world, for the insect pest is with seasonal damages,
should impulsive releasing infective be considered on nite interval? We will continue to study these problems
in the future.
References
[1] L.A. Falcon, Use of Bacteria for Microbial Control of Insects, Academic Press, New York, NY, 1971.
[2] H.D. Burges, N.W. Hussey, Microbial Control of Insects and Mites, Academic Press, New York, NY, 1971, pp. 6795.
[3] L.A. Falcon, Problems associated with the use of arthropod viruses in pest control, Ann. Rev. Entomol. 21 (1976) 305324.
[4] F. Fenner, F.N. Ratclie, Myxomatosis, Cambridge University Press, 1965, pp. 379.
[5] R.M. Anderson, R.M. May, Regulation and stability of host-parasity population interactions, I. Regulatory processes, J. Anim. Ecol.
47 (1978) 219247.
[6] B.S. Goh, The potential utility of control theory to pest management, Proc. Ecol. Soc. 6 (1971) 8489.
[7] P.E. Davis, K. Myers, J.B. Hoy, Biological control among vertebrates, in: C.B. Huaker, P.S. Messenger (Eds.), Theory and Practice
of Biological Control, Plenum Press, New York, NY, 1976, pp. 501519.
[8] N.T.J. Bailey, The Mathematical Theory of Infectious Diseases and its Applications, Grin, London, 1975, pp. 413.
[9] H.D. Burges, N.W. Hussey, Microbial Control of Insects and Mites, Academic Press, New York, NY, 1971, pp. 861.
[10] Y. Tanada, Epizootiology of insect diseases, in: P. Debach (Ed.), Biological Control of Insect Pests and Weeds, Chapman and Hall,
London, 1964, pp. 548578.
[11] N. Gilbert, A.P. Gutierrez, B.D. Frazer, R.E. Jones, Ecological Relationships, W.H. Freeman and Co., San Francisco, CA, 1976.
[12] Bean Sangoh, Management and Analysis of Biological Populations, Elsevier Scientic Press Company, 1980.
[13] V. Lakshmikantham, D.D. Bainov, P. Simeonov, Theory of Impulsive Dierential Equations, World Scientic, Singapore, 1989.
[14] D. Bainov, P. Simeonov, Impulsive dierential equations: periodic solutions and applications, Pitman Monographs Surveys Pure
Appl. Math. 66 (1993).
[15] H.J. Barclay, Models for pest control using predator release, habitat management and pesticide release in combination, J. Appl. Ecol.
19 (1982) 337348.
[16] J.C. Paneyya, A mathematical model of periodically pulse chemotherapy: tumor recurrence and metastasis in a competition
environment, Bull. Math. Biol. 58 (1996) 425447.
[17] A. dOnofrio, Stability properties of pulse vaccination strategy in SEIR epidemic model, Math. Biol. 179 (2002) 5772.
[18] J.C. Van Lanteren, Integrated pest management in protected crops, in: D. Dent (Ed.), Integrated Pest Management, Chapman and
Hall, London, 1995.
[19] M.G. Roberts, R.R. Kao, The dynamics of an infectious disease in a population with birth pulse, Math. Biol. 149 (2002) 2336.
[20] Y.N. Xiao, L.S. Chen, A ratio-dependent predatorprey model with disease in the prey, Appl. Math. Comput. 131 (2002) 397414.
[21] Y.N. Xiao, L.S. Chen, An SIS epidemic model with stage structure and a delay, Acta Math. Appl. English Ser. 16 (2002) 607618.
[22] Y.N. Xiao, L.S. Chen, F.V.D. Bosh, Dynamical behavior for stage-structured SIR infectious disease model, Nonlinear Anal.: RWA 3
(2002) 175190.
J. Jiao, L. Chen / Applied Mathematics and Computation 183 (2006) 10181026 1025
[23] Y.N. Xiao, L.S. Chen, On an SIS epidemic model with stage-structure, J. Syst. Sci. Complexity 16 (2003) 275288.
[24] Z.H. Lu, S.J. Gang, L.S. Chen, Analysis of an SI epidemic with nonlinear transmission and stage structure, Acta Math. Sci. 4 (2003)
440446.
[25] H. Hethcote, The mathematics of infectious disease, SIAM Rev. 42 (2002) 599653.
[26] R. Anderson, R. May, Population Biological of Infectious Diseases, Springer, Berlin, Heidelberg, New York, 1982.
[27] R. Anderson, R. May, Infectious Diseases of Human: Dynamics and Control, Oxford University Press, 1991.
[28] M.C.M. De Jong, O. Diekmann, J.A.P. Heesterbeek, How dose transmission depend on population size? in: D. Mollison (Ed.),
Human Infectious Diseases, Epidemic Models, Cambridge University Press, Cambridge, UK, 1995, pp. 8494.
[29] Wei-min, S.A. Levin, Y. Lwasa, Inuence of nonlinear incidence rates upon the behavior of SIRS Epidemiological models, J. Math.
Biol. 25 (1987) 359380.
[30] Wei-min, H.W. Hethcote, S.A. Levin, Dynamical behavior of epidemiological models with nonlinear incidence rates, J. Math. Biol. 23
(1986) 187240.
[31] K. Wickwire, Mathematical models for the control of pests and infectious diseases: a survey, Theor. Popul. Biol. 8 (1977) 182238.
1026 J. Jiao, L. Chen / Applied Mathematics and Computation 183 (2006) 10181026

You might also like