γ | θ | ℓ | dv | dw | σ | β | K | r | c | Θ | ς | L |
1.2 | 0.45 | 0 | 0.0001 | 0.09 | 0.2 | 0.44 | 1 | 1 | 1 | 3 | 0.75 | 1 |
The advancement of deep learning has resulted in significant improvements on various visual tasks. However, deep neural networks (DNNs) have been found to be vulnerable to well-designed adversarial examples, which can easily deceive DNNs by adding visually imperceptible perturbations to original clean data. Prior research on adversarial attack methods mainly focused on single-task settings, i.e., generating adversarial examples to fool networks with a specific task. However, real-world artificial intelligence systems often require solving multiple tasks simultaneously. In such multi-task situations, the single-task adversarial attacks will have poor attack performance on the unrelated tasks. To address this issue, the generation of multi-task adversarial examples should leverage the generalization knowledge among multiple tasks and reduce the impact of task-specific information during the generation process. In this study, we propose a multi-task adversarial attack method to generate adversarial examples from a multi-task learning network by applying attention distraction with gradient sharpening. Specifically, we first attack the attention heat maps, which contain more generalization information than feature representations, by distracting the attention on the attack regions. Additionally, we use gradient-based adversarial example-generating schemes and propose to sharpen the gradients so that the gradients with multi-task information rather than only task-specific information can make a greater impact. Experimental results on the NYUD-V2 and PASCAL datasets demonstrate that the proposed method can improve the generalization ability of adversarial examples among multiple tasks and achieve better attack performance.
Citation: Bingyu Liu, Jiani Hu, Weihong Deng. Attention distraction with gradient sharpening for multi-task adversarial attack[J]. Mathematical Biosciences and Engineering, 2023, 20(8): 13562-13580. doi: 10.3934/mbe.2023605
[1] | Shuixian Yan, Sanling Yuan . Critical value in a SIR network model with heterogeneous infectiousness and susceptibility. Mathematical Biosciences and Engineering, 2020, 17(5): 5802-5811. doi: 10.3934/mbe.2020310 |
[2] | Baoxiang Zhang, Yongli Cai, Bingxian Wang, Weiming Wang . Dynamics and asymptotic profiles of steady states of an SIRS epidemic model in spatially heterogenous environment. Mathematical Biosciences and Engineering, 2020, 17(1): 893-909. doi: 10.3934/mbe.2020047 |
[3] | Mostafa Adimy, Abdennasser Chekroun, Claudia Pio Ferreira . Global dynamics of a differential-difference system: a case of Kermack-McKendrick SIR model with age-structured protection phase. Mathematical Biosciences and Engineering, 2020, 17(2): 1329-1354. doi: 10.3934/mbe.2020067 |
[4] | F. Berezovskaya, G. Karev, Baojun Song, Carlos Castillo-Chavez . A Simple Epidemic Model with Surprising Dynamics. Mathematical Biosciences and Engineering, 2005, 2(1): 133-152. doi: 10.3934/mbe.2005.2.133 |
[5] | Abdelheq Mezouaghi, Salih Djillali, Anwar Zeb, Kottakkaran Sooppy Nisar . Global proprieties of a delayed epidemic model with partial susceptible protection. Mathematical Biosciences and Engineering, 2022, 19(1): 209-224. doi: 10.3934/mbe.2022011 |
[6] | J. Amador, D. Armesto, A. Gómez-Corral . Extreme values in SIR epidemic models with two strains and cross-immunity. Mathematical Biosciences and Engineering, 2019, 16(4): 1992-2022. doi: 10.3934/mbe.2019098 |
[7] | Kento Okuwa, Hisashi Inaba, Toshikazu Kuniya . Mathematical analysis for an age-structured SIRS epidemic model. Mathematical Biosciences and Engineering, 2019, 16(5): 6071-6102. doi: 10.3934/mbe.2019304 |
[8] | Yanmei Wang, Guirong Liu . Dynamics analysis of a stochastic SIRS epidemic model with nonlinear incidence rate and transfer from infectious to susceptible. Mathematical Biosciences and Engineering, 2019, 16(5): 6047-6070. doi: 10.3934/mbe.2019303 |
[9] | Xia Wang, Shengqiang Liu . Global properties of a delayed SIR epidemic model with multiple parallel infectious stages. Mathematical Biosciences and Engineering, 2012, 9(3): 685-695. doi: 10.3934/mbe.2012.9.685 |
[10] | Yan-Xia Dang, Zhi-Peng Qiu, Xue-Zhi Li, Maia Martcheva . Global dynamics of a vector-host epidemic model with age of infection. Mathematical Biosciences and Engineering, 2017, 14(5&6): 1159-1186. doi: 10.3934/mbe.2017060 |
The advancement of deep learning has resulted in significant improvements on various visual tasks. However, deep neural networks (DNNs) have been found to be vulnerable to well-designed adversarial examples, which can easily deceive DNNs by adding visually imperceptible perturbations to original clean data. Prior research on adversarial attack methods mainly focused on single-task settings, i.e., generating adversarial examples to fool networks with a specific task. However, real-world artificial intelligence systems often require solving multiple tasks simultaneously. In such multi-task situations, the single-task adversarial attacks will have poor attack performance on the unrelated tasks. To address this issue, the generation of multi-task adversarial examples should leverage the generalization knowledge among multiple tasks and reduce the impact of task-specific information during the generation process. In this study, we propose a multi-task adversarial attack method to generate adversarial examples from a multi-task learning network by applying attention distraction with gradient sharpening. Specifically, we first attack the attention heat maps, which contain more generalization information than feature representations, by distracting the attention on the attack regions. Additionally, we use gradient-based adversarial example-generating schemes and propose to sharpen the gradients so that the gradients with multi-task information rather than only task-specific information can make a greater impact. Experimental results on the NYUD-V2 and PASCAL datasets demonstrate that the proposed method can improve the generalization ability of adversarial examples among multiple tasks and achieve better attack performance.
Predator-prey relationship exists throughout nature, for example, lions and gazelles, birds and insects, lynx and snowshoe hare, etc. In contrast with random diffusion, prey-taxis describes an active movement behavior of predators towards the zones of higher prey density, and is one of critical reasons why distribution of predators and prey in a region may display heterogeneity or aggregation. The first classical prey-taxis predator-prey model may be trace back to Kareiva and Odell [1] (cf. the Eqs (40), (51), (56), (57) therein) where on the population level they explored a predator-prey interaction between the ladybug beetle Coccinella septempunctata and the golden aphid Uroleucon nigrotuberculatum. This model is generally represented by
{ut=∇⋅(d(w)∇u−uχ(u,w)∇w)+P(u,w),wt=dwΔw+G(u,w), | (1.1) |
where u and w refer to population density of predators and prey respectively, d(w) is the predators' random motility function, χ(u,w) in the prey-taxis term −∇(uχ(u,w)∇w) measures sensitivity of the prey-taxis per unit strength of the gradient ∇w, and dw is random diffusion rate of the prey population. Interspecific and intraspecific interactions between the predators and prey are denoted by
P(u,w)=γuF(u,w)−h(u),andG(u,w)=wf(w)−g(u,w). |
More precisely, γuF(u,w) (resp. wf(w)) may characterize birth or arrival (immigration) of the predators (resp. of the prey), h(u) (resp. g(u,w)) refers to death or departure (emigration) of the predators (resp. of the prey). Thus one may take g(u,w)=uF(u,w) if the death or departures of prey is predominantly caused by predation. As summarized in the Eqs (1.4)–(1.7) of [2], there are numerous forms of functional response function F(u,w) such as Beddington-DeAngelis type (cf. [3,4]), prey dependent form, and ratio dependent forms (cf. [5]). Allee's effect and logistic growth rate function f(w) are frequently-used in the literature. Later we will specify some of them for our purpose.
As a model to account for evolution process of two species inhabiting an isolated environment (thus often coupled with zero-Neumann boundary condition), system (1.1) covers a considerable number of predator-prey relationships of direct prey-taxis effect. We below review several impressive results according to typical assumptions on χ(u,w) since these may greatly govern the existence of global solutions and dynamics behavior of the system.
On the one hand, when χ(u,w) is a constant small enough, Wu et al. [2] proved global existence and boundedness of solutions in Ω⊂Rn(n≥1) under some generic conditions on F,h and f. This smallness may be removed in some cases. To be precise, Jin and Wang [6] obtained the global boundedness and stability of the classical solution with respect to Rosenzweig–MacArthur (F of Holling II and f of logistic) type in Ω⊂R2; For ratio-dependent F and logistic f, Cai et al. [7] established the global existence as well as uniform-in-time boundedness of classical solutions in Ω⊂Rn(n≥1).
On the other hand, when χ(u,w) is density-dependent (i.e., non-constant) and χ(u,w)=χ(u) in particular, one inference is that there is a maximal density of the predators due to volume-filling effect or prevention of overcrowding (cf. [8]). This hypothesis indicates that there is a truncation on the prey-taxis sensitivity χ(u). With this view in mind, Ainseba et al. [9] obtained the existence of weak solutions by Schauder fixed-point theorem and its uniqueness via duality technique, in addition to attaining pattern formation; Tao [10] derived the existence of global-in-time classical solutions in Ω⊂Rn(1≤n≤3); He and Zheng [11] further obtained the global existence of solution with uniform-in-time bound; The existence of non-constant steady states was studied in [12,13] via bifurcation theory and index degree theory. Another viewpoint is that the truncation above may be removed when χ(u,w)=χ(w), partly because uniform-in-time boundedness of w is essentially ensured by the w-equation in Eq (1.1). For example, Jin and Wang [14] showed the global existence and uniqueness of bounded classical solution in Ω⊂R2 when 0≤χ(w)∈C2([0,+∞)).
Note that if there is no consideration of spatial diffusion and prey-taxis effect (i.e., dw=0,d(w)=0 and χ(u,w)=0), then studies on pure ODE systems of predator-prey relationship can be seen in [15,16,17,18,19] and the references therein.
Different from the aforementioned direct search for prey, some predators might start with perceiving chemical signals released by prey, for instance smell of blood or pheromone (trace pheromone, aggregation pheromone, etc.), and then hunt for the prey by tracking such signals, the process of which is called an indirect prey-taxis in this paper. Similar to a role of direct prey-taxis in promoting the heterogeneity of ecosystems, strong indirect prey-taxis may also cause spatial heterogeneity (cf. [20]) without considering predator's reproduction, mortality, and random diffusion of the prey. Later Tyutyunov et al. proposed another more general model (cf. [21]) which reads
{ut=∇⋅(d(v)∇u−χ(v)u∇v)+γuF(w)−θu,vt=dvΔv+βw−σv,wt=dwΔw+wf(w)−uF(w), | (1.2) |
where u=u(t,x) and w=w(t,x) represent population density of predators and prey at position x∈Ω⊂Rn(n≥1) and time t∈(0,+∞) severally; v=v(t,x) is concentration of chemicals released by prey which are secreted at a constant rate β>0, decay in a fixed rate σ>0, and diffuse with a constant diffusivity dv>0. The (−d(v)∇u+uχ(v)∇v) is called the predators' flux density, d(v) is the predators' random-motility function, and uχ(v)∇v means that predators move towards the increasing gradient of the chemical density at an average speed of χ(v)∇v with χ(v) measuring indirect prey-taxis sensitivity per unit strength of the gradient ∇v. In this way the advection term −∇⋅(uχ(v)∇v) is viewed as indirect prey-taxis effect of predators.
Some generic assumptions on d(v),χ(v),f(w) and F(w) can be summarized as follow. One may suppose that
d′(v)<0andχ(v)=−d′(v), |
so ∇⋅(d(v)∇u−χ(v)u∇v)=Δ(d(v)u) and then d′(v)<0 may indicate that predators will slow down their diffusion when encountering prey signals. This is the well-known "density-suppressed" effect and for further details we refer readers to [22,23,24,25,26] and the references therein. The per capita growth rate of prey population in absence of predators is denoted by f(w) which satisfies
f(0)>0andf′(w)<0, |
and thus allows logistic type, i.e., f(w)=r(1−wK) with r,K>0. The prey-only dependent functional response function F(w) is often assumed to fulfill
F(0)=0andF′(w)>0, |
which consequently incorporates:
F(w)=w(Holling type I or Lotka-Volterra type),F(w)=wkck+wk,c>0(Holling type II as k=1 and Holling type III as k>1),F(w)=c(1−e−kw),k>1,c>0(Ivlev type). | (1.3) |
System (1.2) may cover some reaction-diffusion systems used to describe the dynamics amongst the bacterial cell density, concentration of acyl-homoserine lactone, and nutrient density (cf. [22]). In addition, if χ(v)=0 and dv and dw are density-dependent as well, then Eq (1.2) can be used to describe the interactions among uninfected cells, free viruses produced by infected cells, and infected cells (cf. [27]). In this paper we will understand it in the view of indirect predator-prey relationship. Firstly, when χ(v) and d(v) are supposed to be constants and Ω⊂R1, Tyutyunov et al. [21] studied pattern formation condition on stationary states of Eq (1.2) with zero-Neumann boundary condition. Their numerical analysis illustrated that non-trivial homogeneous stationary state of the model becomes unstable with respect to small perturbation caused by increasing prey-taxis strength; Zuo and Song [28] obtained some interesting dynamical behaviors including stability and double-Hopf bifurcation results; Secondly, if χ(v) and d(v) are constants and Ω⊂Rn(n≥1), Yoon and Ahn [29] derived the unique global-in-time classical solution to the system (1.2) with functional response functions involving Beddington-DeAngelis type, and showed asymptotic stability of both prey-only and coexistence steady states. They found that prey-taxis is an essential factor in generating patterns. Thirdly, when d(v) is a positive constant but χ(v) is density dependent, Wang and Wang [30] investigated global existence and boundedness of the unique classical solution as well as the asymptotic stabilities of nonnegative and spatial homogeneous equilibria as Ω⊂Rn(n≥1).
In this fashion a question arises: what will happen if both χ(v) and d(v) are density-dependent? Correlative conclusions remain unknown, to the best of our knowledge. This motivates us in this paper to focus on
{ut=∇⋅(d(v)∇u−uχ(v)∇v)+γuF(w)−θu−ℓu2,x∈Ω,t>0;[2ex]vt=dvΔv+βw−σv,x∈Ω,t>0;[2ex]wt=dwΔw+wf(w)−uF(w),x∈Ω,t>0;[2ex]∇u⋅→n=0,∇v⋅→n=0,∇w⋅→n=0,x∈∂Ω,t>0;[2ex]u(x,0)=u0(x),v(x,0)=v0(x),w(x,0)=w0(x),x∈Ω, | (1.4) |
where Ω⊂Rn(n≥1) is a bounded domain with smooth boundary ∂Ω, →n is the unit outer normal vector towards ∂Ω, ℓ≥0, and dw,γ,θ>0.
Motivated by the above discussion, we have studied in this work the global existence of classical solution of Eq (1.4) and its global asymptotical stability. Before specifying our main results, several notations need to be explained. Let X be a metric space. We denote by Cm+1−(X) the set of functions with their k-times (0≤k≤m,k,m∈N) derivatives being Lipschitz continuous in X. Note that the k-times derivatives are Lipschitz continuous if (k+1)-times derivatives are bounded in X.
To ensure the existence of solutions to Eqs (1.2) and (1.4), the real-valued functions d(v),χ(v),f(w), and F(w) should satisfy that
(H1) d(v),χ(v)∈C1+1−([0,+∞)) and for v∈[0,+∞), χ(v)≥0, d(v)>0 and d′(v)≤0;
(H2) f∈C1+1−([0,+∞)) and there exists a constant K>0 such that f(K)=0 and f(w)<0 for all w>K and f(w)>0 for w∈(0,K);
(H3) F(w)∈C1+1−([0,+∞)) and there is a constant CF>0 such that 0≤F(w)≤CF|w|. Moreover, F′(w)>0 for all w∈[0,+∞).
Thus (H2) allows logistic f(w) and all F(w) in Eq (1.3) support (H3).
Note that our results are applicable to Eq (1.2) since system (1.4) can reduce to Eq (1.2) when ℓ=0. We first derive the existence of global-in-time classical solution to Eq (1.4).
Theorem 2.1. Let Ω⊂Rn(n≥1) be a bounded domain with smooth boundary ∂Ω. Under the hypotheses (H1)–(H3), if (u0,v0,w0)∈C2(¯Ω,R3) with u0,v0,w0≥0(≢0) and fulfills 0-order compatibility condition (i.e. ∇u0|∂Ω=∇v0|∂Ω=∇w0|∂Ω=0), then the problem Eq (1.4) has a unique nonnegative (resp. positive) classical solution on [0,∞) (resp. on (0,∞)) satisfying
(u,v,w)(t,x)∈C([0,+∞)ׯΩ,R3)∩C1,2((0,+∞)ׯΩ,R3). | (2.1) |
Furthermore, there is an constant C>0 independent of t such that
‖u(t,⋅)‖L∞(Ω)+‖v(t,⋅)‖W1∞(Ω)+‖w(t,⋅)‖W1∞(Ω)≤Cfor allt>0, | (2.2) |
where 0<w(t,x)≤max{K,‖w0‖L∞(Ω)} for all (t,x)∈(0,+∞)×Ω.
We next investigate the asymptotic behaviors of such a classical solution. Suppose that Eq (1.4) has a constant steady state denoted by (uc,vc,wc), then
{γucF(wc)=uc(θ+ℓuc),βwc=σvc,wcf(wc)=ucF(wc). | (2.3) |
If in addition each component of (uc,vc,wc) is nonnegative, three possible constant steady states may be formulated as follow:
● extinction state: if uc=0 and wc=0 then (uc,vc,wc)=(0,0,0);
● exclusion (prey-only) state: if uc=0 but wc>0 then wc=K and (uc,vc,wc)=(0,βKσ,K);
● coexistence state: uc,wc>0 thus vc=βwcσ>0,uc=wcf(wc)F(wc) and γF(wc)=θ+ℓuc. Denote by (u∗,v∗,w∗) this positive constant solution.
To construct appropriate Lyapunov functions we desire, we have to impose that
(H4) for any w∈[0,+∞), φ(w):=wf(w)F(w) is continuously differentiable, φ′(w)<0 and 0<φ(0)=limw→0+φ(w) exists.
This is not very stringent and can be achieved if f(w)=r(1−wK) and F(w) is Holling type I or II with 0<K≤c in Eq (1.3).
After these preparations, we can formulate our second result as below.
Theorem 2.2. Suppose that (u,v,w) is a global classical solution to the system (1.4) fulfilling (H1)–(H4). Let K be defined in (H2).
1) If γF(K)≤θ, then the prey-only state (0,βKσ,K) exists and is globally asymptotic stable. Furthermore, if γF(K)<θ, there are constants ˆc1,ˆc2,T0>0 such that
‖u(t,⋅)‖L∞(Ω)+‖v(t,⋅)−βKσ‖L∞(Ω)+‖w(t,⋅)−K‖L∞(Ω)≤ˆc2e−ˆc1t,t>T0. |
2) If the coexistence steady state (u∗,v∗,w∗) exists and
max0≤v≤K2χ(v)2d(v)≤16dvγσβ2u∗minw1∈[0,C1]{−φ′(w1)}minw2∈[0,C1]{F′(w2)}, | (2.4) |
with K2 from Remark 3.2 and C1:=max{K,‖w0‖L∞(Ω)}, then (u∗,v∗,w∗) is globally asymptotic stable. Moreover, there are constants ˉc1,ˉc2,T1>0 such that
‖u(t,⋅)−u∗‖L∞(Ω)+‖v(t,⋅)−v∗‖L∞(Ω)+‖w(t,⋅)−w∗‖L∞(Ω)≤ˉc1e−ˉc2t,t>T1. |
Note that there is no γF(K)>θ (biologically interpreted as "strong predation") assumed in 2) of Theorem 2.2 since it has been ensured by the existence of the coexistence steady state along with (H2) and (H3). In fact, (H2) and (H3) imply 0<w∗<K and then γF(K)>γF(w∗)=θ+ℓu∗≥θ by F′(w)>0 in (H3). Also, Eq (2.4) might be simplified by specific f and F, for example:
Corollary 2.3. If f(w)=r(1−wK) and F(w)=wc+w with 0<K<c then the coexistence steady state exits and Eq (2.4) becomes
max0<v≤K2χ(v)2d(v)≤16dvγσ(c−K)cKβ2u∗, |
with K2 from Remark 3.2. Then the asymptotic stability above-mentioned remains unchanged.
The content of this paper is organized as follows. We shall prove the global existence of the classical solution to system (1.4) in Section 3. For this classical solution, we will show in Section 4 its global asymptotic stability associated with two constant steady states. Finally in Section 5 we intend to derive linear instability criterion of the steady states and to do some numerical simulations from which one may see how density-dependent prey-taxis and predators' diffusion can influence on resulting patterns.
We shall apply the celebrated results developed by H. Amann [31,32] to derive local and global existence of classical solution to Eq (1.4). The conclusions and proofs can be applied to Eq (1.2) after slight modifications.
Lemma 3.1 (Local existence and uniqueness). Let Ω⊂Rn(n≥1) be a bounded open domain. If (H1)–(H3) hold, (u0,v0,w0)∈C2(Ω,R3) with u0,v0,w0≥0(≢0), then there exists Tmax∈(0,+∞] depending on (u0,v0,w0) such that the problem Eq (1.4) has a unique nonnegative (resp. positive) classical solution on [0,Tmax) (resp. (0,Tmax)) satisfying
(u,v,w)(t,x)∈C([0,Tmax)ׯΩ,R3)∩C1,2((0,Tmax)ׯΩ,R3). | (3.1) |
Proof. Note that we first strengthen the conditions in (H1)−(H3) by replacing the interval [0,+∞) with R. Finally we will see the obtained results still make sense without this enhancement. For clarity, we reformulate Eq (1.4) as
{wt=∇⋅(A(w)∇w)+Ψ(w),x∈Ω,t>0,[2ex]∇u⋅→n=0,∇v⋅→n=0,∇w⋅→n=0,x∈∂Ω,t>0,[2ex]w(x,0)=w0(x),x∈Ω, | (3.2) |
where for x∈Ω and t≥0, w=(u,v,w)τ and w0=(u0,v0,w0)τ∈R3 (τ denoting transposition) are two vector-valued functions, ∇w=(∇u,∇v,∇w)τ,
A(w)=(d(v)−uχ(v)dvdw)3×3andΨ(w)=(γuF(w)−θu−ℓu2βw−σvwf(w)−uF(w)). |
It is easy to see that d(v)>0 for v∈R by (H1). Then along with dv,dw>0, all ordering principal minor determinants of A(x) are positive, which implies that A(x) is positively definite for all x∈R3. Thus we know for all t>0,x∈Ω, wt−∇⋅(A(w)∇w) is Petrowskii parabolic (cf. Eq (50) in [33]) and ∇⋅(A(w)∇w) is normally elliptic (cf. p.16 or Theorem 4.4 in [31]) with separated divergence form. Moreover, ∇⋅(A(w)∇w) coupled with the boundary condition in Eq (3.2) is normally elliptic as well.
By (H1) all elements of A(x) are in C1+1−(R) (functions and their first derivatives being Lipschitz continuous on R). Similarly the regularity conditions in (H2) and (H3) show every component of Ψ(w) is C1+1−(R3). In terms of Theorem 7.3-(ii), Theorem 9.2, and Corollary 9.3 of H. Amann [31], we know that given w0∈W2p(Ω,R3) with p>n and p≥2, there exist a Tmax∈(0,+∞] relating to w0 and 0<2ϵ<min{2−n/p,1} such that Eq (1.4) has a unique (cf. the Corollary 9.3) maximal classical solution on [0,Tmax)×Ω satisfying
(u,v,w)∈B(J′,C2+2ϵ(¯Ω,R3))∩C0+ϵ((0,Tmax),C2(¯Ω,R3))∩C1+ϵ((0,Tmax),C(¯Ω,R3)) |
for every compact subinterval J′ of (0,Tmax), where B(X,Y) (resp. Cm(X,Y)) denotes the set of all bounded mappings (resp. all m-th continuously differentiable functions) from X to Y, and Cm+ι(X,Y) is the set of all mappings from X to Y which up to their m-th derivatives are ι- Hölder continuous on X with ι∈(0,1) and m∈N. Moreover, if w0∈C2(Ω,R3), then by Theorem 1 of [32] we know that the Eq (3.2) has a unique maximal classical solution
(u,v,w)∈C([0,Tmax),C(¯Ω,R3))∩C((0,Tmax),C2(¯Ω,R3))∩C1((0,Tmax),C(¯Ω,R3)) | (3.3) |
As a result, Eq (3.3) implies Eq (3.1).
Then we may find this unique local classical solution is nonnegative on [0,Tmax). Indeed, we may first rewrite the u-equation in Eq (1.4) as
ut=d(v)Δu+[d′(v)∇v−χ(v)∇v]⋅∇u−[χ′(v)(∇v⋅∇v)+χ(v)Δv]u+γuF(w)−θu−ℓu2. |
By the regularity Eq (3.3), v,w in u-equation can be treated as known functions at present. Then within any [0,T]⊂[0,Tmax) one can apply comparison principle of linear parabolic equations to such a equation coupled with ∇u⋅→n=0 and u0(x)≥0(≢0). Thus we derive u≥0 in [0,Tmax)×Ω and u>0 in (0,Tmax)×Ω. Similarly, one may acquire that v,w>0 in (0,Tmax)×Ω, and v,w≥0 in [0,Tmax)×Ω. Therefore, R in (H1)−(H3) as supposed at the very beginning of this proof can be replaced by [0,+∞). This completes the proof.
By Theorem 1 of [32], it suffices to verify that ‖(u,v,w)(t,⋅)‖Hsp(Ω)≤C(T)<+∞ for any t∈(0,T)⊂(0,Tmax), p>n and p≥2 as well as some s satisfying 1<s<min{1+1p,2−np}, in order to extend such a local unique classical solution to a global one. To make this extendability criteria easier to verify (i.e., to weaken this Hsp-topology, the Bessel potential space), we resort to Theorem 5.2 of [32] at the cost of imposing an extra condition on the initial value. This can be formulated in the following lemma.
Lemma 3.2. Suppose that (u0,v0,w0)∈C2(¯Ω,R3) additionally fulfills 0-order compatibility condition (i.e., ∇u0|∂Ω=∇v0|∂Ω=∇w0|∂Ω=0). Then the above local classical solution is global if
lim supt↗Tmax{‖u(t,⋅)‖L∞(Ω)+‖v(t,⋅)‖L∞(Ω)+‖w(t,⋅)‖L∞(Ω)}<+∞. |
Lemma 3.3. Under the conditions in Lemma 3.1, it holds that
0<w(t,x)≤max{K,‖w0‖L∞(Ω)},for any(t,x)∈(0,Tmax)×Ω, |
where K is from (H2) and is independent of Tmax.
Proof. One may use comparison principle to prove this result and more details can be seen in Lemma 2.2 of [6].
Remark 3.1. Under the conditions in Lemma 3.1, if (u,v,w) is a nonnegative classical solution to Eq (1.4) on (0,Tmax)×Ω, then
‖u(t,⋅)‖L1(Ω)+‖v(t,⋅)‖L1(Ω)+‖w(t,⋅)‖L1(Ω)≤C | (3.4) |
where C is a positive constant and independent of Tmax.
It is easy to see that the solution to v-equation of Eq (1.4) can be formally expressed via heat semigroup theory with zero-Neumann boundary condition. Precisely, the estimation on v(t,x) follows from Lemma 1 of Kowalczyk and Szymańska [34] as below.
Lemma 3.4. Assume that Ω⊂Rn(n≥1), v0(x)∈W1∞(Ω) and
‖w(t,⋅)‖Lp(Ω)<Cfor allt∈(0,Tmax). |
Then for every t∈(0,Tmax), the classical solution v(t,x) of the v-equation in Eq (1.4) satisfies
‖v(t,⋅)‖W1q(Ω)≤Cwhen{q<npn−p,p<n;q<+∞,p=n;q=+∞,p>n. |
Here C and C are positive constants and independent of Tmax.
In conjunction with Lemma 3.3 we thus have the following W1∞ estimate on v(t,x).
Remark 3.2. There exists a constant K2>0 independent of Tmax such that if v0∈W1∞(Ω), then ‖v(t,⋅)‖W1∞(Ω)≤K2 for all t∈(0,Tmax).
The next lemma is to show L∞ estimate on u(t,x).
Lemma 3.5. Let (H1)–(H3) hold. Suppose that (u,v,w) is the solution of Eq (1.4) obtained in Lemma 3.1. Then there exists a positive constant ˜C independent of Tmax such that
‖u(t,⋅)‖L∞(Ω)≤˜Cfor allt∈(0,Tmax). |
Proof. Here we adopt Moser's iteration method. Indeed, we assume t∈(0,T)⊂(0,Tmax) with 0<T<Tmax. Multiplying the first equation in Eq (1.4) by up−1(p≥1) and integrating the result with respect to x in Ω may yield
1pddt∫Ωup+(p−1)∫Ωd(v)up−2|∇u|2+θ∫Ωup+ℓ∫Ωup+1=(p−1)∫Ωup−1χ(v)∇u⋅∇v+γ∫ΩupF(w). |
Lemma 3.1 shows u(t,x),v(t,x),w(t,x)>0 for all (t,x)∈(0,Tmax)×Ω. In addition, Remark 3.2 concludes that ‖∇v‖L∞(Ω)≤‖v(t,⋅)‖W1∞(Ω)≤K2 (independent of Tmax). Thus (H1) implies d(v)≥d(K2)=:c0 and |χ(v)|≤max0<v≤K2χ(v)=:c1. By 0≤F(w)≤CFw in (H3) we then may obtain
1pddt∫Ωup+(p−1)c0∫Ωup−2|∇u|2+θ∫Ωup+ℓ∫Ωup+1≤(p−1)c1∫Ωup−1|∇u||∇v|+CFγ∫Ωupw. |
Applying Cauchy's inequality to the first term may lead us to
(p−1)c1∫Ωup−1|∇u||∇v|≤(p−1)c02∫Ωup−2|∇u|2+(p−1)c212c0∫Ωup|∇v|2. |
Hence
1pddt∫Ωup+(p−1)c02∫Ωup−2|∇u|2+θ∫Ωup+ℓ∫Ωup+1≤(p−1)c21K222c0∫Ωup+CFγ∫Ωupw. |
Below by setting p≥2 and due to up−2|∇u|2=|up2−1∇u|2=|2p∇up2|2=4p2|∇up2|2, we have
ddt∫Ωup+2(p−1)c0p∫Ω|∇up2|2+pθ∫Ωup+pℓ∫Ωup+1≤p(p−1)c21K222c0∫Ωup+pCFC1γ∫Ωup,ℓ≥0, |
with C1=max{K,‖w0‖L∞(Ω)}. So it remains to consider: (I) θ−CFC1γ>0 and (II) θ−CFC1γ≤0. For the case (I), one may have
ddt∫Ωup+2(p−1)c0p∫Ω|∇up2|2+p(θ−CFC1γ)∫Ωup≤p(p−1)c21K222c0∫Ωup; | (3.5) |
and for the case (II),
ddt∫Ωup+2(p−1)c0p∫Ω|∇up2|2+pθ∫Ωup≤p(p−1)c21K222c0∫Ωup+p(CFC1γ+θ)∫Ωup. | (3.6) |
To conduct Moser's iteration, we use Gagliardo-Nirenberg interpolation to decompose the right-hand ∫Ωup into ∫Ω|up2| and ∫Ω|∇up2|2 so that the latter one can be cancelled if its coefficient is set appropriately.
Indeed, by Gagliardo-Nirenberg interpolation inequality and Young's inequality with parameter η>0 and with index 1α and 11−α one may have
∫Ω|u|p=‖up2‖2L2(Ω)≤c2‖∇up2‖2αL2(Ω)‖up2‖2(1−α)Lq(Ω)+c3‖up2‖2Ls(Ω)≤c2η‖∇up2‖2L2(Ω)+c2(1η)α1−α‖up2‖2Lq(Ω)+c3‖up2‖2Ls(Ω) | (3.7) |
with α=1q−121n+1q−12∈(0,1) as 1≤q<2. Then associated with Eq (3.5), by taking q=s=1 in Eq (3.7) we may infer that α=12n+1, α1−α=n2, and
p(p−1)c21K222c0∫Ω|u|p≤(p−1)c0p∫Ω|∇up2|2+pn+2c4(∫Ω|up2|)2 | (3.8) |
where we have taken η=2c20p2c2(c1K2)2 and c4=(c3+c2(c1K2√c2)n(√2c0)n)⋅(c1K2)22c0. Therefore, we derive
ddt∫Ωup+p(θ−CFC1γ)∫Ωup≤pn+2c4(∫Ω|up2|)2. |
In regard to Eq (3.6), taking q=s=1 in Eq (3.7) again will produce that
p(CFC1γ+θ)∫Ωup≤(p−1)c0p∫Ω|∇up2|2+pn+2c5(∫Ω|up2|)2 | (3.9) |
where we have set η=(p−1)c0p2c2(CFC1γ+θ) and c5=(c3+(c2√CFC1γ+θ)n(√c0)n)⋅(CFC1γ+θ). Hence Eqs (3.8) and (3.9) jointly show that
ddt∫Ωup+pθ∫Ωup≤pn+2c6(∫Ω|up2|)2 | (3.10) |
with c6=c4+c5.
To sum up, by letting κ:=θ−CFC1γ>0 in case (I) or κ:=θ>0 in case (II), there is a constant c7:=max{c4,c6} which is independent of p, such that
ddt∫Ωup+pκ∫Ωup≤c7pn+2(∫Ω|up2|)2≤c7pn+2supt∈[0,T)(∫Ω|up2|)2,p≥2, |
on (0,T)⊂(0,Tmax). Notice that the rightmost term above is unrelated to time variable t. Then solving this inequality with respect to t on (0,T)⊂(0,Tmax) gives
∫Ωup(t,x)dx≤∫Ωup0(x)dx+c7κpn+1supt∈[0,T)(∫Ω|up2(t,x)|dx)2≤(|Ω|+c7κ+1)pn+1max{‖u0‖L∞(Ω),supt∈[0,T)(∫Ω|up2(t,x)|dx)2p}p. |
This indicates
˜F(p)≤(|Ω|+c7κ+1)1ppn+1p˜F(p/2) |
with ˜F(p):=max{‖u0‖L∞(Ω),supt∈[0,T)(∫Ωup(t,x)dx)1p}. Denoting c8=|Ω|+c7κ+1 and setting p=2i,i=1,2,3,⋯, then we have
˜F(2i)≤c∑ik=12−k82∑ik=1k2(n+1)k˜F(1)≤c822n+1(2n+1−1)2˜F(1) |
and ˜F(1)={‖u0‖L∞(Ω),supt∈[0,T)∫Ωu(t,x)dx}≤{‖u0‖L∞(Ω),C} where C is from Eq (3.4) and thus is independent of i,Tmax and T. Finally, letting i→+∞ concludes that for all t∈(0,T)⊂(0,Tmax),
‖u(t,⋅)‖L∞(Ω)≤c822n+1(2n+1−1)2{‖u0‖L∞(Ω),C}. |
Hence such an estimate holds for all t∈(0,Tmax) due to T arbitrarily in (0,Tmax). This completes the proof.
Remark 3.3. By rewriting the third component in Eq (1.4) as
wt=dwΔw−w+R |
with R=w+wf(w)−uF(w), then one may apply Lemma 3.4 to this equation after a rescaling. Since in view of Lemma 3.3 and Lemma 3.5, one may infer that
‖R(t,⋅)‖L∞(Ω)≤C(‖w(t,⋅)‖L∞(Ω)+‖u(t,⋅)‖L∞(Ω))≤Cfor allt∈(0,Tmax), |
with constants C,C independent of Tmax. It follows that
‖w(t,⋅)‖W1∞(Ω)≤Cforallt∈(0,Tmax), |
if w0(x)∈W1∞(Ω) where constant C is independent of Tmax.
This remark is useful to prove asymptotic stability in the next section.
Proof. Lemma 3.1 has shown the existence of local unique classical solution to Eq (1.4). The extendability standard of such a classical solution in Lemma 3.2 can be satisfied by Lemma 3.3, Lemma 3.5, and Remark 3.2. So one can obtain the global existence of unique classical solution to Eq (1.4), and the regularity Eq (2.1). Finally the estimate Eq (2.2) holds for all t>0 by Remark 3.2, Lemma 3.5 and Remark 3.3.
In the last section we have proved that system (1.4) possesses a unique global-in-time classical solution under (H1)–(H3). In this section we concentrate on its longtime behaviors if (H4) holds in addition. To this end, we introduce the following two basic lemmas.
Lemma 4.1. If F fulfills condition (H3), then a function
ζ(z):=∫zκF(η)−F(κ)F(η)dη | (4.1) |
is nonnegative and convex. Furthermore, if z→κ then
F′(κ)4F(κ)(z−κ)2≤ζ(z)≤F′(κ)F(κ)(z−κ)2. |
This lemma can be proved by doing Talyor's expansion of ζ(z) with respect to z up to its second order derivative at z=κ (ζ(κ)=ζ′(κ)=0). One may refer to Lemma 4.1 in [6] for more details.
We below summarize limit property of a dynamic system (cf. Chap.4 in [35]) that we will use later. Given a dynamic system (nonlinear semigroup) {S(t):t≥0} on a complete metric space (M,‖⋅‖). Then for a real-valued continuous function L(x), x∈M, we say L(x) is a Lyapunov function of this dynamic system if for all t≥0,x∈M and δ∈R,
dL(S(t)x)dt:=limδ→0+supL(S(t+δ)x)−L(S(t)x)δ≤0. |
For any x∈M, Γ(x):={S(t)x:t≥0} denotes the trajectory through x. In particular, we call x is an equilibrium point of the dynamic system if Γ(x)={x}.
Lemma 4.2. Let E:={x∈M:dL(S(t)x)dt=0}. Denote by Z:={x∈E:S(t)x∈Efor allt≥0} the largest invariant subset of E. For some x0∈M, if the trajectory Γ(x0)={S(t)x0:t≥0} is contained in a compact set of M, then there are two properties for the ω-limit set Vω(x0) of Γ(x0) (or x0) as:
(i) Vω(x0)⊂Z;
(ii) S(t)x0→Z as t→∞,
where Vω(x0):={limk→+∞S(tk)x0∈M:∃tk>0,limk→+∞tk=+∞}=⋂τ≥0¯{S(t)x0:t≥τ}.
Additionally if all y∈E are equilibria and all elements of E are isolated from each other, then Vω(x0) consists of equilibria and contains only one element.
Lemma 4.1 may help us to construct Lyapunov functions we need. Lemma 4.2 indicates that one may apply Lemma 4.2 to corresponding Lyapunov functions, in order to investigate the global asymptotic stability of the prey–only state (0,βKσ,K) and the coexistence state (u∗,v∗,w∗). Indeed, Theorem 2.1 means that system (1.4) has the unique global-in-time classical solution (u,v,w)∈C2(¯Ω,R3) which is continuous to its initial value (u0,v0,w0)=:u0(x)∈C2(¯Ω,R3). This indicates that system (1.4) can generate a dynamic system on C2(¯Ω,R3), still denoted by {S(t):t≥0}, such that S(t)u0:=u(t,x;u0(x)):=(u(t,x;u0(x)),v(t,x;v0(x)),w(t,x;w0(x)))∈C2(¯Ω,R3), and S(0) is an identity, i.e., S(0)u0(x)=u0(x) for any u0(x)∈C2(¯Ω,R3). Then {S(t)u0:t≥0} is a trajectory through u0(x) which can be contained in a compact subset of C2(¯Ω,R3) by Eq (2.2) and one estimation similar to the Eqs (46) and (48) in Theorem 4.1 of [36]. The (0,βKσ,K) and (u∗,v∗,w∗) can be viewed as two equilibria of this dynamic system.
In addition, (H2) and (H4) indicate that F′(w)>0 and −φ′(w)>0 are continuous on [0,C] for any C>0. Thus
minw∈[0,C]F′(w)minw∈[0,C](−φ′(w)) | (4.2) |
exists and is strictly positive.
With these preparations at hand, we below prove 1) of the Theorem 2.2.
Lemma 4.3. Let (H1)−(H4) hold and (u,v,w) be a globally classical solution of Eq (1.4) obtained in Theorem 2.1. Then the prey–only state (0,βKσ,K) is globally asymptotic stable provided that F(K)≤θγ. Furthermore, if F(K)<θγ, there are constants ˉc1,ˉc2,T0>0 such that for t>T0>0
‖u(t,⋅)‖L∞(Ω)+‖v(t,⋅)−βKσ‖L∞(Ω)+‖w(t,⋅)−K‖L∞(Ω)≤ˉc2e−ˉc1t2(n+1). |
Proof. We may construct a function for t>0 that
L1(t):=L1(u(t),v(t),w(t)):=1γ∫Ωu+M2∫Ω(v−βKσ)2+∫Ω∫wKF(η)−F(K)F(η)dη |
where (u,v,w) is the classical solution to Eq (1.4) and the constant M>0 is to be determined after Eq (4.5).
Next we show that L1 is a Lyapunov function, i.e., dL1dt≤0 for all (u,v,w) solving Eq (1.4). Indeed, under the zero-Neumann boundary condition in Eq (1.4), one has
dL1dt=1γ∫Ωut+M∫Ω(v−βKσ)vt+∫ΩF(w)−F(K)F(w)wt=1γ∫Ω(γuF(w)−θu−ℓu2)+∫ΩF(w)−F(K)F(w)wt+M∫Ω(v−βKσ)vt. | (4.3) |
Moreover,
∫ΩF(w)−F(K)F(w)wt=∫ΩF(w)−F(K)F(w)(dwΔw+wf(w)−uF(w))=−∫ΩdwF(K)F′(w)|∇w|2F2(w)+∫ΩF(w)−F(K)F(w)(wf(w)−uF(w)) |
and from f(K)=0 in (H2) we may derive that
∫ΩF(w)−F(K)F(w)wf(w)=∫Ω(wf(w)F(w)−Kf(K)F(K))(F(w)−F(K))=∫Ωφ′(w1)F′(w2)(w−K)2 |
where φ(w)=wf(w)F(w), wi is between w and K, i=1,2, in addition to
−∫ΩF(w)−F(K)F(w)uF(w)=∫ΩF(K)u−∫ΩF(w)u. |
On the other hand, by βwc=σvc and wc=K, one may infer that
M∫Ω(v−βKσ)vt=M∫Ω(v−βKσ)(dvΔv+βw−σv)=−Mdv∫Ω∇(v−βKσ)∇v+M∫Ω(v−βKσ)(βw−σv)=−Mdv∫Ω|∇(v−βKσ)|2+Mβ∫Ω(v−βKσ)(w−K)−Mσ∫Ω(v−βKσ)2 |
and using the Young's inequality with ε will yield
Mβ∫Ω(v−βKσ)(w−K)≤Mβ∫Ω[ε2(v−βKσ)2+(w−K)22ε] | (4.4) |
for any ε>0,Mβ>0.
Then by using the assumption F(K)≤θγ, setting 0<ε≤2σβ, and by invoking the estimates from Eqs (4.3) and (4.4) one may update Eq (4.3) that
dL1dt=∫Ω(F(K)−θγ)u−∫Ωℓu2γ−dwF(K)∫ΩF′(w)|∇w|2F2(w)+∫Ωφ′(w1)F′(w2)(w−K)2−Mdv∫Ω|∇(v−βKσ)|2−Mσ∫Ω(v−βKσ)2+Mβ∫Ω(v−βKσ)(w−K)≤∫Ω(F(K)−θγ)u+∫Ω(φ′(w1)F′(w2)+Mβ2ε)(w−K)2−M(σ−εβ2)∫Ω(v−βKσ)2≤∫Ω(φ′(w1)F′(w2)+Mβ2ε)(w−K)2. | (4.5) |
In light of Lemma 3.3 we know 0<w1,w2≤C1 with C1=max{K,‖w0‖L∞(Ω)}. Hence making use of Eq (4.2) and taking
0<M≤4σβ2minw∈[0,C1]F′(w)minw∈[0,C1](−φ′(w)) |
will conclude that dL1dt≤0.
For each t>0, we let
L1(t)=∫Ωuγ+∫ΩM2(v−βKσ)2+∫Ω∫wKF(η)−F(K)F(η)dη=:∫ΩH1(u,v,w). |
Here H1(u,v,w):=uγ+M2(v−βKσ)2+ζ(w) is a convex function of (u,v,w) in view of Lemma 4.1 with κ=K. H1(u,v,w) has no more than one minimum point, so does L1(t) in the sense of (u,v,w). The equation dL1(t)dt=0 thus has at most one solution in the sense of (u,v,w), which implies that dL1(t)dt=0 if and only if (u,v,w)=(0,βKσ,K). Then Lemma 4.2 concludes that the solution of Eq (1.4) which is bounded will approach (0,βKσ,K) as t→∞. In other words, (0,βKσ,K) is globally asymptotic stable.
We can further ascertain the corresponding convergent rate. Due to F(K)<θγ, the first inequality in Eq (4.5), and Lemma 4.1, there exists a constant ˆc1>0 such that
dL1(t)dt≤−ˆc1L1(t),fort>0. |
Solving this inequality shows
L1(t)≤ˆc2e−ˆc1t,fort>0 |
where the constant ˆc2>0 depends only on L1(0). Lemma 4.1 also signifies that there is a T1>0 such that
1γ∫Ωu+M2∫Ω(v−βKσ)2+∫ΩF′(K)4F(K)(w−K)2≤ˆc2e−ˆc1t,fort≥T1 |
which means
‖u(t,⋅)‖L1(Ω)+‖v(t,⋅)−βKσ‖L2(Ω)+‖w(t,⋅)−K‖L2(Ω)≤ˆc3e−ˆc12t,fort≥T1 |
with ˆc3=3max{ˆc2γ,(2ˆc2M)1/2,(4F(K)ˆc2F′(K))1/2}.
We next may strengthen this convergence rate. Since (u,v,w) is a classical solution to Eq (1.4), then by Eq (2.2) there exists a constant ˆc4>0 such that ‖u‖L∞(Ω),‖∇v‖L∞(Ω),‖∇w‖L∞(Ω)≤ˆc4 when t>T1>0. Similar to the estimation of Eqs (46) and (48) in Theorem 4.1 of [36] and by semigroup theory and Lp-Lq estimate, there exist ˆc′4>0 and ϵ∈(0,1) such that ‖w(t,⋅)‖C2+ϵ(ˉΩ),‖v(t,⋅)‖C2+ϵ(ˉΩ)≤ˆc′4 for all t>T′1>0. Denote T0=max{T1,T′1}. One can apply the Theorem 7.2 or 7.4 in Chap.V of [37] to the first equation of Eq (1.4) which can be rewritten as ut−d(v)Δu+b(t,x,u,∇u)=0 with
b(t,x,u,∇u)=−[d′(v)∇v−χ(v)∇v]⋅∇u+[χ′(v)(∇v⋅∇v)+χ(v)Δv]u−γuF(w)+θu+ℓu2. |
Then there exits another constant, still denoted by ˆc4, such that ‖∇u‖L∞(Ω)≤ˆc4 for all t>T0.
An application of Gagliardo–Nirenberg interpolation inequality may yield that for all t>T0,
‖u‖L∞(Ω)≤ˆc5(‖∇u‖nn+1L∞(Ω)‖u‖1n+1L1(Ω)+‖u‖L1(Ω))≤ˆc6e−ˆc1t2(n+1),‖v−βKσ‖L∞(Ω)≤ˆc7(‖∇(v−βKσ)‖nn+2L∞(Ω)‖v−βKσ‖2n+2L2(Ω)+‖v−βKσ‖L2(Ω))≤ˆc8e−ˆc1tn+2,‖w−K‖L∞(Ω)≤ˆc9(‖∇(w−K)‖nn+2L∞(Ω)‖w−K‖2n+2L2(Ω)+‖w−K‖L2(Ω))≤ˆc10e−ˆc1tn+2, |
where ˆc6:=ˆc5(ˆcnn+14ˆc1n+13+ˆc3),ˆc8:=ˆc7(ˆcnn+24ˆc2n+23+ˆc3), and ˆc10:=ˆc9(ˆcnn+24ˆc2n+23+ˆc3). Therefore,
‖u‖L∞(Ω)+‖v−βKσ‖L∞(Ω)+‖w−K‖L∞(Ω)≤ˆc11e−ˆc1t2(n+1),t>T0 |
with ˆc11:=ˆc6+ˆc8+ˆc10. This completes the proof.
As is shown in Eq (2.3), the positive coexistence state (u∗,v∗,w∗) should satisfy
u∗F(w∗)=w∗f(w∗)=u∗(θ+ℓu∗)γ>0,v∗=βw∗σ>0,w∗>0. |
We are now in a position to prove part 2) of the Theorem 2.2.
Lemma 4.4. Let (H1)−(H4) hold and (u,v,w) be the global classical solution of Eq (1.4) obtained in Theorem 2.1. If the coexistence steady state (u∗,v∗,w∗) exists and
max0<v≤K2χ(v)2d(v)≤16dvγσβ2u∗min˜w1∈[0,C1]{−φ′(˜w1)}min˜w2∈[0,C1]{F′(˜w2)}, | (4.6) |
with K2 from Remark 3.2 and C1=max{K,‖w0‖L∞(Ω)} and φ(w)=wf(w)F(w), then the (u∗,v∗,w∗) is globally asymptotic stable. Moreover, there are three constants ˜c1,˜c2,T1>0 such that
‖u(t,⋅)−u∗‖L∞(Ω)+‖v(t,⋅)−v∗‖L∞(Ω)+‖w(t,⋅)−w∗‖L∞(Ω)≤˜c1e−˜c2tn+2,t>T1. |
Proof. We may construct the following function for t>0 that
L2(t):=L2(u(t),v(t),w(t)):=1γ∫Ω(u−u∗−u∗lnuu∗)+M2∫Ω(v−v∗)2+∫Ω∫ww∗F(η)−F(w∗)F(η)dη |
where (u,v,w) is the global classical solution of Eq (1.4) and M>0 is a constant to be determined in Eq (4.9). Similar to Lemma 4.3, we first verify dL2(t)dt≤0. Replacing ut,vt,wt in the following equality may yield
dL2(t)dt=1γ∫Ω(ut−u∗uut)+M∫Ω(v−v∗)vt+∫ΩF(w)−F(w∗)F(w)wt=1γ∫Ω(γuF(w)−θu−ℓu2)−u∗γ∫Ω(d(v)|∇u|2u2−χ(v)∇u⋅∇vu+(γF(w)−θ−ℓu))+M∫Ω(−dv|∇v|2+(v−v∗)(βw−σv))−∫ΩdwF(w∗)F′(w)F2(w)|∇w|2+∫Ω(wf(w)F(w)−u)(F(w)−F(w∗)). | (4.7) |
For the terms above involving ∇u and ∇v and for u≠0, one may notice that
−u∗γ∫Ω(d(v)|∇u|2u2−χ(v)∇u⋅∇vu)−M∫Ωdv|∇v|2=−u∗γ∫Ω(∇uu,∇v)H(∇uu,∇v)τ≤0 |
where τ refers to transpose and
H:=(d(v)−χ(v)2−χ(v)2γMdvu∗) |
is positive semi-definite when
M≥max0<v≤C1u∗χ(v)24dvγd(v). | (4.8) |
Here 0<v(t,x)<C1 for all t>0 and all x∈Ω, owning to Remark 3.2 and the regularity Eq (2.1) in Theorem 2.1. In terms of u∗=w∗f(w∗)F(w∗) one may obtain that
∫Ω(wf(w)F(w)−u)(F(w)−F(w∗))=∫Ω(wf(w)F(w)−w∗f(w∗)F(w∗)+u∗−u)(F(w)−F(w∗))=∫Ωφ′(˜w1)F′(˜w2)(w−w∗)2−∫Ω(F(w)−F(w∗))(u−u∗) |
where φ(w)=wf(w)F(w), ˜wi lies between w and w∗, i=1,2. In light of ℓu∗+θ=γF(w∗), we have
1γ∫Ω(γuF(w)−θu−ℓu2)−u∗γ∫Ω(γF(w)−θ−ℓu)=1γ∫Ω(u−u∗)(γF(w)−θ−ℓu)=1γ∫Ω(u−u∗)[γF(w)−θ−ℓu−(γF(w∗)−θ−ℓu∗)]=∫Ω(u−u∗)(F(w)−F(w∗))−ℓγ∫Ω(u−u∗)2. |
Note that (v−v∗)(βw−σv)=β(v−v∗)(w−w∗)−σ(v−v∗)2 by v∗=βw∗σ. One can derive from Young's inequality that
M∫Ω(v−v∗)(βw−σv)=−Mσ∫Ω(v−v∗)2+Mβ∫Ω(v−v∗)(w−w∗)≤M(βε2−σ)∫Ω(v−v∗)2+Mβ2ε∫Ω(w−w∗)2≤Mβ2ε∫Ω(w−w∗)2, |
for 0≤βε2≤σ or 0<ε≤2σβ. Consequently, we know
dL2(t)dt≤−dwF(w∗)∫ΩF′(w)F2(w)|∇w|2+∫Ω(φ′(˜w1)F′(˜w2)+Mβ2ε)(w−w∗)2. |
Lemma 3.3 shows 0<˜w1,˜w2≤C1 with C1=max{K,‖w0‖L∞(Ω)}. Thus by Eq (4.2) we can set
0<M≤4σβ2min[0,C1]{−φ′(˜w1)}min[0,C1]{F′(˜w2)}. | (4.9) |
Then Eq (4.6) implies there exists a M>0 such that both Eqs (4.8) and (4.9) hold, which means dL2(t)dt≤0.
Next we claim that dL2(t)dt=0 will lead to (u,v,w)=(u∗,v∗,w∗). In fact,
L2(t)=1γ∫Ω(u−u∗−u∗lnuu∗)+M2∫Ω(v−v∗)2+∫Ω∫ww∗F(η)−g(w∗)F(η)dη=:∫ΩH2(u,v,w) |
and H2(u,v,w)=1γ(u−u∗−u∗lnuu∗)+M2(v−v∗)2+∫ww∗F(η)−F(w∗)F(η)dη is a nonnegative convex function of (u,v,w) based on Lemma 4.1, the expansion Eq (4.10), and on Eq (4.11) as below. So the equation dL2(t)dt=0 has at most one minimum point in the sense of (u,v,w). Together with (u,v,w)=(u∗,v∗,w∗) leading to dL2(t)dt=0, thus we may infer that the equation dL2(t)dt=0 indicates (u,v,w)=(u∗,v∗,w∗), which concludes that dL2(t)dt=0 if and only if (u,v,w)=(u∗,v∗,w∗). Then by Lemma 4.2 the solution (u,v,w) of Eq (1.4) which is bounded will converges to (u∗,v∗,w∗) as t→∞. In other words, (u∗,v∗,w∗) is globally asymptotic stable.
We can further acquire its the convergent rate. Indeed, letting κ=w∗ in Lemma 4.1 means
ζ(w)=ζ(w∗)+ζ′(w∗)(w−w∗)+12ζ″(˜w)(w−w∗)2=F(w∗)F′(˜w)2F2(˜w)(w−w∗)2≥0, | (4.10) |
with ˜w lying between w and w∗. Furthermore, denoting ρ(u)=u−u∗−u∗lnuu∗ and doing its Taylor expansion at u=u∗ may show
ρ(u)=ρ(u∗)+ρ′(u∗)(u−u∗)+12ρ″(˜u)(u−u∗)2=u∗2˜u2(u−u∗)2≥0, | (4.11) |
where ˜u lies between u and u∗. Lemma 3.5 and the regularity Eq (2.1) jointly show that there exists a ˜T1>0 such that 0<δ≤u≤C2<∞ as t>˜T1, which means u∗2C22≤u∗2˜u2≤u∗2δ2. Again observing the derivations from Eqs (4.7) to (4.9), there is a constant ˜c0>0 such that
dL2(t)dt≤−˜c0L2(t),for allt>˜T1. |
Analogous to the corresponding parts in proving Lemma 4.3, there exist two constants ˜c1,˜c2>0 and T1≥˜T1>0 such that
‖u(t,⋅)−u∗‖L∞(Ω)+‖v(t,⋅)−v∗‖L∞(Ω)+‖w(t,⋅)−w∗‖L∞(Ω)≤˜c1e−˜c2tn+2,t>T1. |
The previous sections involve that there exists the unique global classical solution to Eq (1.4) and it may approach its steady states exponentially under suitable conditions. However, there is no discussion of instability on its steady states. To figure this out, we below shall analyse linear instability of these constant steady states and then numerically explore the impact of density-dependent d(v) and χ(v) on the patterns.
Proposition 5.1. Assume that (uc,vc,wc) is the constant steady state of the system (1.4). Then the (uc,vc,wc) is linearly instable if there exists at least one λj in Eq (5.4) having strictly positive real part (viz. one of Eqs (5.5)–(5.7) holds); It is linearly stable if all the real parts of λj are strictly negative.
Proof. We first linearize the system (1.4) at (uc,vc,wc) as
∂∂t(uvw)=(d(vc)Δ+B1−ucχ(vc)ΔB20dvΔ−σβB30dwΔ+B4)(u−ucv−vcw−wc)=:B˜w | (5.1) |
where ˜w:=(u−uc,v−vc,w−wc)τ,
B1:=γF(wc)−θ−2ℓuc,B2:=γucF′w(wc),B3:=−F(wc),B4:=f(wc)+wcf′(wc)−ucF′w(wc). |
In order to obtain the eigenvalues (denoted by {λj}∞j=0) of the linear operator B, we invoke the following eigenvalue problem:
{−ΔΦ(x)=μΦ(x),x∈Ω,∇Φ(x)⋅→n=0,x∈∂Ω, |
the eigenvalues {μj}∞j=0 of which, without counting the finite multiplicities, can be formulated as
0=μ0<μ1<μ2<⋯<μm<⋯. |
Then to {μj}∞j=0 the corresponding eigenfunctions, denoted by {ϕj(x)}∞j=0 in L2(Ω), constitute an orthonormal basis of L2(Ω). Plus ∂˜w∂t=∂w∂t, we thus can formulate a general solution ˜w to Eq (5.1) (note ∂˜w∂t=B˜w=λ˜w) in the form of components (in particular spatial parts in L2(Ω)) as
u−uc=∞∑j=0ujϕj(x)eλjt,v−vc=∞∑j=0vjϕj(x)eλjt,w−wc=∞∑j=0wjϕj(x)eλjt, | (5.2) |
where uj,vj,wj are constants for all j. Note that if there is a j such that uj=vj=wj=0, one may automatically remove the corresponding terms in Eq (5.2). In this fashion we have
Pj˜w:=(−d(vc)μj+B1−ucχ(vc)μjB20−dvμj−σβB30−dwμj+B4)˜w=λj˜w, | (5.3) |
which is equivalent to
det(λjI−Pj)=0,j=0,1,2,… |
or the eigenpolynomial
λ3j+a1λ2j+a2λj+a3=0,j=0,1,2,… | (5.4) |
where I is a 3×3 unit matrix and other real-valued coefficients are:
a1=−Trace(Pj)=(d(vc)+dv+dw)μj+σ−B1−B4,a2=det(−d(vc)μj+B1−ucχ(vc)μj0−dvμj−σ)+det(−dvμj−σβ0−dwμj+B4),a3=−det(Pj)=(B1−d(vc)μj)(σ+dvμj)(B4−dwμj)−B3B2(σ+dvμj)+B3βucχ(vc)μj. |
Denote p=a2−a123, q=2a1327−a1a23+a3, ϑ=ei2π3=−12+√32i with i=√−1, and Ξ=q24+p327. Then by Cardano's formula for every j one can specify three roots of Eq (5.4) as:
λ(1)j=−a13+3√−q2+√Ξ+3√−q2−√Ξ,λ(2)j=−a13+ϑ3√−q2+√Ξ+ϑ23√−q2−√Ξ,λ(3)j=−a13+ϑ23√−q2+√Ξ+ϑ3√−q2−√Ξ. |
Consequently, we may identify the linear instability by requiring one of the real parts of these roots to be strictly positive in the following cases:
● When Ξ>0, one may readily see that −q2±√Ξ∈R and thus λ(1)j is real and λ(2)j, λ(3)j are complex numbers. So we require
max{Re(λ(1)j),Re(λ(2)j),Re(λ(3)j)}=−a13+max{Λ,−Λ2}>0 | (5.5) |
with Λ:=3√−q2+√Ξ+3√−q2−√Ξ;
● When Ξ=0 then λ(1)j, λ(2)j and λ(3)j are real (by ϑ+ϑ2=−1) and λ(2)j=λ(3)j. Then we demand
max{Re(λ(1)j),Re(λ(2)j),Re(λ(3)j)}=−a13+max{2Λ0,−Λ0}>0 | (5.6) |
with Λ0:=3√−q2;
● When Ξ<0, λ(1)j, λ(2)j, and λ(3)j are real but different from each other. So we need
max{λ(1)j,λ(2)j,λ(3)j}>0. | (5.7) |
This completes the proof.
Note that Proposition 5.1 does not concisely show how the density-dependent d(v) and χ(v) directly affect the patterns. So we next resort to numerical simulations with parameters taken hypothetically. The units of these parameters can be inferred from pp.252–262 of [1].
When motility function d(v) and prey-taxis sensitivity function χ(v) are constants, one may find (cf. [21]) that the coexistence state of spatial one-dimensional model (1.2) (i.e., Eq (1.4) with ℓ=0) becomes unstable regarding small perturbation (by increasing prey-taxis coefficient). In this subsection, we shall show that some density-dependent d(v) and χ(v) can stabilize such a stationary state but this stabilization effect can be weakened by enhancement of conversion rate.
To show this difference, we remain unchanged some parameters and functions taken in [21], except for d(v), χ(v) and conversion rate γ. Specifically, the growth rate function of prey is Θ-logistic type
f(w)=r(1−(wK)Θ),r,K>0,Θ≥1, |
and the functional response function is Ivlev type
F(w)=c(1−e−ςw),ς>1,c>0. |
Let Ω=(0,L) and take other parameters in Table 1. Thus we derive from Eq (2.3) (with ℓ=0) that (u∗,v∗,w∗)≈(1.2599,1.3787,0.6267). In addition, we set initial value as u0(x)=u∗+0.01⋅cos(πx),v0(x)=v∗+0.01⋅sin(πx),w0(x)=w∗+0.01⋅cos(πx).
γ | θ | ℓ | dv | dw | σ | β | K | r | c | Θ | ς | L |
1.2 | 0.45 | 0 | 0.0001 | 0.09 | 0.2 | 0.44 | 1 | 1 | 1 | 3 | 0.75 | 1 |
When d(v)=0.002533 and χ(v)=1, one can still derive the patterns (cf. (a) in Figure 1) that are analogous to the first row of Figure 7 in [21]. However, if we replace them by density-dependent forms such as d(v)=11+e8v−1 or 11+8v, things will become different.
Precisely, it is not difficult to see from (a) to (d) in Figure 1 that some density-dependent d(v) and χ(v) of exponential or algebraic form may flatten, or we say stabilize, the pattern bifurcating from the coexistence steady state (u∗,v∗,w∗) under small perturbations. However, this effect might be suppressed by increasing conversion rate. For example, after resetting conversion rate γ, approximate time-periodic patterns can appear, like the change from (d) to (e) in Figure 1. In addition, by enhancing γ in Figure 1(b), (c) (for instance, by letting γ=26), the system may produce patterns like Figure 1(d) as well.
An individual-based modelling method to simulate one population whose individuals undergo density-dependent movement in 2-dimensional spatial domain can be see in [38]. For two populations spatially in a 2-dimensional disc, i.e., one predator and one prey considered in the system (1.4) with ℓ>0, some density-dependent d(v) and χ(v) may help to change the spatial distribution similarity which exists in non-density-dependent case between predators and signals of prey.
We herein set the growth rate function of prey as
f(w)=r(1−wK),r,K>0, |
and take the functional response function to be the Holling type II
F(w)=wc+w,c>0, |
together with different values of r and different forms of d(v) and χ(v) specified below Figures 2 and 3. Without loss of generality, we may adopt initial values as
u0(x,y)=uc+Q(x,y),v0(x,y)=vc+Q(x,y),w0(x,y)=wc+Q(x,y), |
where Q(x,y)=cosπx+cosπy, (x,y)∈B3(0)–a circle with radius 3 and centre at the origin, (uc,vc,wc) may equal to (0,0,0),(0,βKσ,K) or (u∗,v∗,w∗), the last of which exists as γr>θ, u∗=w∗=K(γr−θ)Kℓ+γr and v∗=Kβ(γr−θ)σ(Kℓ+γr). Other specific parameters are given in Table 2.
γ | θ | ℓ | β | σ | K | dv | dw | c |
10 | 1 | 1 | 10 | 12 | 10 | 0.1 | 0.1 | 1 |
Figures 2 and 3 present the spatial distribution of predator, chemicals released by prey and of prey, in a circular domain at time t=50 and t=500. We may observe that:
(i) non-constant steady states exist since the corresponding patterns have few changes from time t=50 to t=500. Parameter r seems important in producing more abundant patterns after other parameters are fixed, for example (a) and (b) in Figure 2 and that in Figure 3, or (c) and (d) in Figure 2 and that in Figure 3;
(ii) if d(v) and χ(v) are constants, spatial distribution of predators and chemoattractant are very similar; The density-dependent decays of d(v) and χ(v) may lower the similarities, but the extent may be effected by other parameters, like r in f.
System (1.4) describes a spatiotemporal evolution process of an isolated ecosystem within a domain Ω, which includes two populations i.e., one predator and one prey. The most arresting feature in Eq (1.4) is that the predators may search for the prey as their food, mainly through chemoattractants released by the prey, since some factors including natural camouflage, the environment of the prey, range of visibility of the predators, etc., result in many difficulties for the predators in finding the prey directly. So the chemoattractants usually have diffused relatively far from the prey before they are perceived by the predators. Here u(x,t), v(x,t), and w(x,t) refer to population density of the predators, concentration of the chemical signals, and population density of the prey, respectively. The system being isolated means that there might be negligible quantities of the predators, the prey, and the prey signals crossing the boundary of Ω, compared with overwhelming majorities of them (the predators, the prey, and the prey signals) within Ω. Other organisms living in Ω are not taken into consideration in the Eq (1.4).
Theorem 2.1 states that the system (1.4) has a global-in-time classical solution which is continuous to its initial value, when (H1)–(H3) are satisfied. As a result, for given initial densities u0(x),v0(x) and w0(x), one can predict by the unique classical solution of Eq (1.4) the density of the predators, the prey signals and the prey, at any time 0<t<∞ and any spatial position x∈Ω. The obtained L∞ bound in Theorem 2.1 signifies that there is a maximal density for all three of them.
Theorem 2.2 illustrates that in some cases (if (H4) holds), the spatial distributions of the predators, the prey signals, and the prey in Ω may be approximately homogeneous as the time goes by. This is, as it should be, a much ideal case, but at least the large-time behavior of such a solution indicates a trend through which one can foresee whether this ecosystem can evolve into exclusion state (prey being extinct in Ω) or coexistence state over time. So this tendency which can be viewed as an early warning, makes significantly biological sense to protect the biodiversity and ecological balance in the domain Ω.
For simplicity, in regard to numerical simulations we only list the patterns which bifurcate from coexistence steady state in Subsections 5.2 and 5.3 (the case of exclusion state is similar). In Subsection 5.2, (a) of Figure 1 recovers the pattern corresponding to the point A in Figure 7 obtained in [21] with d(v) and χ(v) being constants, which is the starting point of our simulations. Then in (b) and (c) of Figure 1, we set χ(v)=−d′(v) with d(v) satisfying algebraic decay and exponential decay respectively. Finally in Figure 1 (d) and (e) we remove the relation χ(v)=−d′(v) and take χ(v) and d(v) to be algebraic and exponential decay severally. From this process we see that random motility function d(v) and indirect prey-taxis sensitivity χ(v), being density-dependent form, may help the spatial distribution (of the predators, the prey signals, and the prey) to be approximately homogeneous. Because one may observe that the spatial distributions of Figure 1 (b)–(e) become more even than that of Figuere 1 (a), although the approximate time-periodic pattern may appear when the conversation rate γ is increased.
All simulations in Subsection 5.2 are spatial 1-dimensional case, which matter in theory. What will happen in spatial 2-dimensional case makes more realistic sense, which is the aim of Subsection 5.3. Firstly, we see the spatial distribution of high density for both the prey signals and the prey, either in Figures 2 or 3, stagger a little bit each other (instead of being overlap) in position (this point can also be seen in Figure 1 but it is not so distinct). This is consistent with the feature of indirect prey-taxis that signals of the prey have diffused a distance far from the prey before they are captured by the predators. Secondly, when χ(v) and d(v) are constants (cf. (a), (b) in Figures 2 and 3), we find that the spatial distribution of the predators and of the prey signals are highly similar, since the predators conduct the signals-based (indirect prey-taxis) foraging strategy to search for the prey. However, the χ(v) and d(v) in density-dependent form (cf. (c), (d) in Figures 2 and 3) may lower similarity of spatial distribution between the predators and the prey chemicals. Finally, increasing the value of r (from f(w)) in Figure 2 may yield Figure 3 from which one may infer that some parameters in Eq (1.4), like r, are important to produce abundant patterns.
The author is very grateful to Prof. Zhi-An Wang and to the anonymous reviewers of this paper for their valuable suggestions and insightful comments which improve the exposition of this paper deeply and greatly. The author would like to thank The Hong Kong Polytechnic University for supporting publication expenses of this article.
The author declared no conflicts of interest in this paper.
[1] |
A. Krizhevsky, I. Sutskever, G. E. Hinton, Imagenet classification with deep convolutional neural networks, Commun. ACM, 6 (2017), 84-–90. https://doi.org/10.1145/3065386 doi: 10.1145/3065386
![]() |
[2] | K. Simonyan, A. Zisserman, Very deep convolutional networks for large-scale image recognition, preprint, arXiv: 1409.1556. |
[3] | K. He, X. Zhang, S. Ren, J. Sun, Deep residual learning for image recognition, in 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), (2016), 770–778. https://doi.org/10.1109/CVPR.2016.90 |
[4] | J. Hu, L. Shen, G. Sun, Squeeze-and-excitation networks, in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, (2018), 7132–7141. https://doi.org/10.1109/CVPR.2018.00745 |
[5] | J. Long, E. Shelhamer, T. Darrell, Fully convolutional networks for semantic segmentation, in 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), (2015), 3431–3440. https://doi.org/10.1109/CVPR.2015.7298965 |
[6] | D. Eigen, C. Puhrsch, R. Fergus, Depth map prediction from a single image using a multi-scale deep network, preprint, arXiv: 1406.2283. |
[7] | X. Wang, D. Fouhey, A. Gupta, Designing deep networks for surface normal estimation, in 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), (2015), 539–547. https://doi.org/10.1109/CVPR.2015.7298652 |
[8] |
R. Caruana, Multitask learning, Mach. Learn., 28 (1997), 41–75. https://doi.org/10.1023/A:1007379606734 doi: 10.1023/A:1007379606734
![]() |
[9] | S. Ruder, An overview of multi-task learning in deep neural networks, preprint, arXiv: 1706.05098. |
[10] |
S. Vandenhende, S. Georgoulis, W. Van Gansbeke, M. Proesmans, D. Dai, L. Van Gool, Multi-task learning for dense prediction tasks: A survey, IEEE Trans. Pattern Anal. Mach. Intell., 44 (2022), 3614–3633. https://doi.org/10.1109/TPAMI.2021.3054719 doi: 10.1109/TPAMI.2021.3054719
![]() |
[11] | C. Szegedy, W. Zaremba, I. Sutskever, J. Bruna, D. Erhan, I. J. Goodfellow, et al., Intriguing properties of neural networks, Int. Conf. Learn. Represent., 2014. |
[12] | I. J. Goodfellow, J. Shlens, C. Szegedy, Explaining and harnessing adversarial examples, Int. Conf. Learn. Represent., 2015. |
[13] | P. Guo, Y. Xu, B. Lin, Y. Zhang, Multi-task adversarial attack, preprint, arXiv: 2011.09824. |
[14] |
Y. Li, C. Chen, M. Duan, Z. Zeng, K. Li, Attention-aware encoder–decoder neural networks for heterogeneous graphs of things, IEEE Trans. Ind. Inform., 17 (2020), 2890–2898. https://doi.org/10.1109/TII.2020.3025592 doi: 10.1109/TII.2020.3025592
![]() |
[15] |
B. Pu, Y. Liu, N. Zhu, K. Li, K. Li, Ed-acnn: Novel attention convolutional neural network based on encoder–decoder framework for human traffic prediction, Appl. Soft. Comput., 97 (2020), 106688. https://doi.org/10.1016/j.asoc.2020.106688 doi: 10.1016/j.asoc.2020.106688
![]() |
[16] | N. Silberman, D. Hoiem, P. Kohli, R. Fergus, Indoor segmentation and support inference from RGBD images, in Computer Vision – ECCV 2012, (2012), 746–760. https://doi.org/10.1007/978-3-642-33715-4_54 |
[17] |
M. Everingham, L. Van Gool, C. K. Williams, J. Winn, A. Zisserman, The pascal visual object classes (voc) challenge, Int. J. Comput. Vis., 88 (2010), 303–338. https://doi.org/10.1007/s11263-009-0275-4 doi: 10.1007/s11263-009-0275-4
![]() |
[18] | T. Evgeniou, M. Pontil, Regularized multi-task learning, in Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, (2004), 109–117. https://doi.org/10.1145/1014052.1014067 |
[19] |
B. Bakker, T. Heskes, Task clustering and gating for bayesian multitask learning, J. Mach. Learn. Res., 4 (2003), 83–99. https://doi.org/10.1162/153244304322765658 doi: 10.1162/153244304322765658
![]() |
[20] |
A. Argyriou, T. Evgeniou, M. Pontil, Convex multi-task feature learning, Mach. Learn., 73 (2008), 243–272. https://doi.org/10.1007/s10994-007-5040-8 doi: 10.1007/s10994-007-5040-8
![]() |
[21] | A. Kendall, Y. Gal, R. Cipolla, Multi-task learning using uncertainty to weigh losses for scene geometry and semantics, in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, (2018), 7482–7491. https://doi.org/10.1109/CVPR.2018.00781 |
[22] | Z. Chen, V. Badrinarayanan, C. Y. Lee, A. Rabinovich, Gradnorm: Gradient normalization for adaptive loss balancing in deep multitask networks, preprint, arXiv: 1711.02257. |
[23] | O. Sener, V. Koltun, Multi-task learning as multi-objective optimization, Adv. Neural Inf. Process. Syst., (2018), 525–536. |
[24] | I. Misra, A. Shrivastava, A. Gupta, M. Hebert, Cross-stitch networks for multi-task learning, in 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), (2016), 3994–4003. https://doi.org/10.1109/CVPR.2016.433 |
[25] | Y. Gao, J. Ma, M. Zhao, W. Liu, A. L. Yuille, Nddr-cnn: Layerwise feature fusing in multi-task cnns by neural discriminative dimensionality reduction, in 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2019), 3205–3214. https://doi.org/10.1109/CVPR.2019.00332 |
[26] | S. Liu, E. Johns, A. J. Davison, End-to-end multi-task learning with attention, in 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2019), 1871–1880. https://doi.org/10.1109/CVPR.2019.00197 |
[27] | M. Wallingford, H. Li, A. Achille, A. Ravichandran, C. Fowlkes, R. Bhotika, et al., Task adaptive parameter sharing for multi-task learning, in 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2022), 7561–7570. https://doi.org/10.1109/CVPR52688.2022.00741 |
[28] | I. Kokkinos, Ubernet: Training a universal convolutional neural network for low-, mid-, and high-level vision using diverse datasets and limited memory, in 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), (2017), 6129–6138. https://doi.org/10.1109/CVPR.2017.579 |
[29] | F. Ott, D. Rügamer, L. Heublein, B. Bischl, C. Mutschler, Joint classification and trajectory regression of online handwriting using a multi-task learning approach, in 2022 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV), (2022), 266–276. https://doi.org/10.1109/WACV51458.2022.00131 |
[30] | A. Madry, A. Makelov, L. Schmidt, D. Tsipras, A. Vladu, Towards deep learning models resistant to adversarial attacks, preprint, arXiv: 1706.06083. |
[31] | S. M. Moosavi-Dezfooli, A. Fawzi, P. Frossard, Deepfool: a simple and accurate method to fool deep neural networks, in 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), (2016), 2574–2582, https://doi.org/10.1109/CVPR.2016.282 |
[32] |
A. S. Rakin, Z. He, J. Li, F. Yao, C. Chakrabarti, D. Fan, T-bfa: Targeted bit-flip adversarial weight attack, IEEE Trans. Pattern Anal. Mach. Intell., 44 (2022), 7928–7939. https://doi.org/10.1109/TPAMI.2021.3112932 doi: 10.1109/TPAMI.2021.3112932
![]() |
[33] | C. Xie, J. Wang, Z. Zhang, Y. Zhou, L. Xie, A. Yuille, Adversarial examples for semantic segmentation and object detection, in 2017 IEEE International Conference on Computer Vision (ICCV), (2017), 1369–1378. https://doi.org/10.1109/ICCV.2017.153 |
[34] |
G. Zhao, M. Zhang, J. Liu, Y. Li, J. R. Wen, Ap-gan: Adversarial patch attack on content-based image retrieval systems, Geoinformatica, 26 (2022), 347–377. https://doi.org/10.1007/s10707-020-00418-7 doi: 10.1007/s10707-020-00418-7
![]() |
[35] | V. Mirjalili, A. Ross, Soft biometric privacy: Retaining biometric utility of face images while perturbing gender, in 2017 IEEE International Joint Conference on Biometrics (IJCB), (2017), 564–573. https://doi.org/10.1109/BTAS.2017.8272743 |
[36] |
K. Yamanaka, R. Matsumoto, K. Takahashi, T. Fujii, Adversarial patch attacks on monocular depth estimation networks, IEEE Access, 8 (2020), 179094–179104. https://doi.org/10.1109/ACCESS.2020.3027372 doi: 10.1109/ACCESS.2020.3027372
![]() |
[37] | W. Niu, X. Zhan, K. Li, G. Yang, R. Chen, Modeling attack process of advanced persistent threat, in International Conference on Security, Privacy and Anonymity in Computation, Communication and Storage, 10066 (2016), 383–391. https://doi.org/10.1007/978-3-319-49148-6_32 |
[38] |
J. Chen, K. Li, S. Y. Philip, Privacy-preserving deep learning model for decentralized vanets using fully homomorphic encryption and blockchain, IEEE Trans. Intell. Transp. Syst., 23 (2021), 11633–11642. https://doi.org/10.1109/TITS.2021.3105682 doi: 10.1109/TITS.2021.3105682
![]() |
[39] |
R. R. Selvaraju, M. Cogswell, A. Das, R. Vedantam, D. Parikh, D. Batra, Grad-cam: Visual explanations from deep networks via gradient-based localization, 2017 IEEE International Conference on Computer Vision (ICCV), (2017), 618–626. https://doi.org/10.1109/ICCV.2017.74 doi: 10.1109/ICCV.2017.74
![]() |
[40] | R. Mottaghi, X. Chen, X. Liu, N. G. Cho, S. W. Lee, S. Fidler, et al., The role of context for object detection and semantic segmentation in the wild, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, (2014), 891–898. https://doi.org/10.1109/CVPR.2014.119 |
[41] | K. K. Maninis, I. Radosavovic, I. Kokkinos, Attentive single-tasking of multiple tasks, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, (2019), 1851–1860. https://doi.org/10.1109/CVPR.2019.00195 |
[42] | A. Bansal, X. Chen, B. Russell, A. Gupta, D. Ramanan, Pixelnet: Representation of the pixels, by the pixels, and for the pixels, preprint, arXiv: 1702.06506. |
[43] | L. C. Chen, Y. Zhu, G. Papandreou, F. Schroff, H. Adam, Encoder-decoder with atrous separable convolution for semantic image segmentation, in Computer Vision – ECCV 2018, (2018), 801–818. https://doi.org/10.1007/978-3-030-01234-2_49 |
[44] | A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, et al., Pytorch: An imperative style, high-performance deep learning library, in Proceedings of the 33rd International Conference on Neural Information Processing Systems, (2019), 8026–8037. https://doi.org/10.5555/3454287.3455008 |
1. | Shuyun Jiao, Mingzhan Huang, An SIHR epidemic model of the COVID-19 with general population-size dependent contact rate, 2020, 5, 2473-6988, 6714, 10.3934/math.2020431 | |
2. | Chaofan Qian, Yuhui Hu, Novel stability criteria on nonlinear density-dependent mortality Nicholson’s blowflies systems in asymptotically almost periodic environments, 2020, 2020, 1029-242X, 10.1186/s13660-019-2275-4 | |
3. | Qian Cao, Xiaojin Guo, Anti-periodic dynamics on high-order inertial Hopfield neural networks involving time-varying delays, 2020, 5, 2473-6988, 5402, 10.3934/math.2020347 | |
4. | Manickam Iswarya, Ramachandran Raja, Grienggrai Rajchakit, Jinde Cao, Jehad Alzabut, Chuangxia Huang, Existence, Uniqueness and Exponential Stability of Periodic Solution for Discrete-Time Delayed BAM Neural Networks Based on Coincidence Degree Theory and Graph Theoretic Method, 2019, 7, 2227-7390, 1055, 10.3390/math7111055 | |
5. | Yadan Zhang, Minghui Jiang, Xue Fang, A New Fixed-Time Stability Criterion and Its Application to Synchronization Control of Memristor-Based Fuzzy Inertial Neural Networks with Proportional Delay, 2020, 52, 1370-4621, 1291, 10.1007/s11063-020-10305-9 | |
6. | Qian Cao, Guoqiu Wang, Chaofan Qian, New results on global exponential stability for a periodic Nicholson’s blowflies model involving time-varying delays, 2020, 2020, 1687-1847, 10.1186/s13662-020-2495-4 | |
7. | Hong Zhang, Qian Cao, Hedi Yang, Asymptotically almost periodic dynamics on delayed Nicholson-type system involving patch structure, 2020, 2020, 1029-242X, 10.1186/s13660-020-02366-0 | |
8. | Anbalagan Pratap, Ramachandran Raja, Jehad Alzabut, Jinde Cao, Grienggrai Rajchakit, Chuangxia Huang, Mittag‐Leffler stability and adaptive impulsive synchronization of fractional order neural networks in quaternion field, 2020, 43, 0170-4214, 6223, 10.1002/mma.6367 | |
9. | Chaofan Qian, New periodic stability for a class of Nicholson's blowflies models with multiple different delays, 2020, 0020-7179, 1, 10.1080/00207179.2020.1766118 | |
10. | Umesh Kumar, Subir Das, Chuangxia Huang, Jinde Cao, Fixed-time synchronization of quaternion-valued neural networks with time-varying delay, 2020, 476, 1364-5021, 20200324, 10.1098/rspa.2020.0324 | |
11. | Chuangxia Huang, Luanshan Yang, Jinde Cao, Asymptotic behavior for a class of population dynamics, 2020, 5, 2473-6988, 3378, 10.3934/math.2020218 | |
12. | M. Syed Ali, G. Narayanan, Sumit Saroha, Bandana Priya, Ganesh Kumar Thakur, Finite-time stability analysis of fractional-order memristive fuzzy cellular neural networks with time delay and leakage term, 2021, 185, 03784754, 468, 10.1016/j.matcom.2020.12.035 | |
13. | Sudesh Kumari, Renu Chugh, Jinde Cao, Chuangxia Huang, Multi Fractals of Generalized Multivalued Iterated Function Systems in b-Metric Spaces with Applications, 2019, 7, 2227-7390, 967, 10.3390/math7100967 | |
14. | M. Iswarya, R. Raja, G. Rajchakit, J. Cao, J. Alzabut, C. Huang, A perspective on graph theory-based stability analysis of impulsive stochastic recurrent neural networks with time-varying delays, 2019, 2019, 1687-1847, 10.1186/s13662-019-2443-3 | |
15. | Xin Long, Novel stability criteria on a patch structure Nicholson’s blowflies model with multiple pairs of time-varying delays, 2020, 5, 2473-6988, 7387, 10.3934/math.2020473 | |
16. | Lihong Huang, Huili Ma, Jiafu Wang, Chuangxia Huang, GLOBAL DYNAMICS OF A FILIPPOV PLANT DISEASE MODEL WITH AN ECONOMIC THRESHOLD OF INFECTED-SUSCEPTIBLE RATIO, 2020, 10, 2156-907X, 2263, 10.11948/20190409 | |
17. | Xin Yang, Shigang Wen, Xian Zhao, Chuangxia Huang, Systemic importance of financial institutions: A complex network perspective, 2020, 545, 03784371, 123448, 10.1016/j.physa.2019.123448 | |
18. | Wentao Wang, Wei Chen, Persistence and extinction of Markov switched stochastic Nicholson’s blowflies delayed differential equation, 2020, 13, 1793-5245, 2050015, 10.1142/S1793524520500151 | |
19. | Xin Yang, Shigang Wen, Zhifeng Liu, Cai Li, Chuangxia Huang, Dynamic Properties of Foreign Exchange Complex Network, 2019, 7, 2227-7390, 832, 10.3390/math7090832 | |
20. | Qian Cao, Guoqiu Wang, Dynamic analysis on a delayed nonlinear density-dependent mortality Nicholson's blowflies model, 2020, 0020-7179, 1, 10.1080/00207179.2020.1725134 | |
21. | Hong Zhang, Chaofan Qian, Convergence analysis on inertial proportional delayed neural networks, 2020, 2020, 1687-1847, 10.1186/s13662-020-02737-3 | |
22. | Ajendra singh, Jitendra Nath Rai, Stability of Fractional Order Fuzzy Cellular Neural Networks with Distributed Delays via Hybrid Feedback Controllers, 2021, 1370-4621, 10.1007/s11063-021-10460-7 | |
23. | Qian Cao, Xin Long, New convergence on inertial neural networks with time-varying delays and continuously distributed delays, 2020, 5, 2473-6988, 5955, 10.3934/math.2020381 | |
24. | Chuangxia Huang, Xiaoguang Yang, Jinde Cao, Stability analysis of Nicholson’s blowflies equation with two different delays, 2020, 171, 03784754, 201, 10.1016/j.matcom.2019.09.023 | |
25. | Jian Zhang, Chuangxia Huang, Dynamics analysis on a class of delayed neural networks involving inertial terms, 2020, 2020, 1687-1847, 10.1186/s13662-020-02566-4 | |
26. | Qian Wang, Hui Wei, Zhiwen Long, A non-reduced order approach to stability analysis of delayed inertial genetic regulatory networks, 2021, 33, 0952-813X, 227, 10.1080/0952813X.2020.1735531 | |
27. | Jiafu Wang, Su He, Lihong Huang, Limit Cycles Induced by Threshold Nonlinearity in Planar Piecewise Linear Systems of Node-Focus or Node-Center Type, 2020, 30, 0218-1274, 2050160, 10.1142/S0218127420501606 | |
28. | Gang Yang, Qian Cao, Stability for patch structure Nicholson’s blowflies systems involving distinctive maturation and feedback delays, 2020, 0952-813X, 1, 10.1080/0952813X.2020.1836032 | |
29. | Chuangxia Huang, Xin Long, Jinde Cao, Stability of antiperiodic recurrent neural networks with multiproportional delays, 2020, 43, 0170-4214, 6093, 10.1002/mma.6350 | |
30. | Qian Cao, Guoqiu Wang, New findings on global exponential stability of inertial neural networks with both time-varying and distributed delays, 2021, 0952-813X, 1, 10.1080/0952813X.2021.1883744 | |
31. | Ruihan Chen, Song Zhu, Yongqiang Qi, Yuxin Hou, Reachable set bounding for neural networks with mixed delays: Reciprocally convex approach, 2020, 125, 08936080, 165, 10.1016/j.neunet.2020.02.005 | |
32. | Shigang Wen, Yu Tan, Mengge Li, Yunke Deng, Chuangxia Huang, Analysis of Global Remittance Based on Complex Networks, 2020, 8, 2296-424X, 10.3389/fphy.2020.00085 | |
33. | Zhenhua Duan, Changjin Xu, Anti-periodic behavior for quaternion-valued delayed cellular neural networks, 2021, 2021, 1687-1847, 10.1186/s13662-021-03327-7 | |
34. | Yi Wang, Jinde Cao, Gang Huang, Further dynamic analysis for a network sexually transmitted disease model with birth and death, 2019, 363, 00963003, 124635, 10.1016/j.amc.2019.124635 | |
35. | Luogen Yao, Qian Cao, Anti-periodicity on high-order inertial Hopfield neural networks involving mixed delays, 2020, 2020, 1029-242X, 10.1186/s13660-020-02444-3 | |
36. | Anbalagan Pratap, Ramachandran Raja, Jinde Cao, Chuangxia Huang, Michal Niezabitowski, Ovidiu Bagdasar, Stability of discrete‐time fractional‐order time‐delayed neural networks in complex field, 2021, 44, 0170-4214, 419, 10.1002/mma.6745 | |
37. | Luogen Yao, Global exponential stability on anti-periodic solutions in proportional delayed HIHNNs, 2021, 33, 0952-813X, 47, 10.1080/0952813X.2020.1721571 | |
38. | Yanli Xu, Qian Cao, Xiaojin Guo, Stability on a patch structure Nicholson’s blowflies system involving distinctive delays, 2020, 105, 08939659, 106340, 10.1016/j.aml.2020.106340 | |
39. | Yanli Xu, Qian Cao, Global asymptotic stability for a nonlinear density-dependent mortality Nicholson’s blowflies system involving multiple pairs of time-varying delays, 2020, 2020, 1687-1847, 10.1186/s13662-020-02569-1 | |
40. | Sudesh Kumari, Renu Chugh, Jinde Cao, Chuangxia Huang, On the construction, properties and Hausdorff dimension of random Cantor one pth set, 2020, 5, 2473-6988, 3138, 10.3934/math.2020202 | |
41. | A. Pratap, R. Raja, Jinde Cao, J. Alzabut, Chuangxia Huang, Finite-time synchronization criterion of graph theory perspective fractional-order coupled discontinuous neural networks, 2020, 2020, 1687-1847, 10.1186/s13662-020-02551-x | |
42. | Qian Cao, Guoqiu Wang, Hong Zhang, Shuhua Gong, New results on global asymptotic stability for a nonlinear density-dependent mortality Nicholson’s blowflies model with multiple pairs of time-varying delays, 2020, 2020, 1029-242X, 10.1186/s13660-019-2277-2 | |
43. | Rundong Zhao, Qiming Liu, Meici Sun, Dynamical behavior of a stochastic SIQS epidemic model on scale-free networks, 2021, 1598-5865, 10.1007/s12190-021-01550-9 | |
44. | Xianhui Zhang, Convergence analysis of a patch structure Nicholson’s blowflies system involving an oscillating death rate, 2021, 0952-813X, 1, 10.1080/0952813X.2021.1908433 | |
45. | Roberto Galizia, Petri T. Piiroinen, Regions of Reduced Dynamics in Dynamic Networks, 2021, 31, 0218-1274, 2150080, 10.1142/S0218127421500802 | |
46. | Jian Zhang, Ancheng Chang, Gang Yang, Periodicity on Neutral-Type Inertial Neural Networks Incorporating Multiple Delays, 2021, 13, 2073-8994, 2231, 10.3390/sym13112231 | |
47. | Jiaying Zhou, Yi Zhao, Yong Ye, Yixin Bao, Bifurcation Analysis of a Fractional-Order Simplicial SIRS System Induced by Double Delays, 2022, 32, 0218-1274, 10.1142/S0218127422500687 | |
48. | Shuping Li, Xiaorong Zhao, Ruixia Zhang, Site-bond percolation model of epidemic spreading with vaccination in complex networks, 2022, 85, 0303-6812, 10.1007/s00285-022-01816-1 | |
49. | Lian Duan, Lihong Huang, Chuangxia Huang, Spatial dynamics of a diffusive SIRI model with distinct dispersal rates and heterogeneous environment, 2021, 20, 1534-0392, 3539, 10.3934/cpaa.2021120 | |
50. | Jie Li, Jiu Zhong, Yong-Mao Ji, Fang Yang, A new SEIAR model on small-world networks to assess the intervention measures in the COVID-19 pandemics, 2021, 25, 22113797, 104283, 10.1016/j.rinp.2021.104283 | |
51. | Chaouki Aouiti, Mahjouba Ben Rezeg, Impulsive multidirectional associative memory neural networks: New results, 2021, 14, 1793-5245, 10.1142/S1793524521500601 | |
52. | Hong Zhang, Qian Cao, Hedi Yang, Dynamics analysis of delayed Nicholson-type systems involving patch structure and asymptotically almost periodic environments, 2022, 34, 0952-813X, 725, 10.1080/0952813X.2021.1924869 | |
53. | Reinhard Schlickeiser, Martin Kröger, Determination of a Key Pandemic Parameter of the SIR-Epidemic Model from Past COVID-19 Mutant Waves and Its Variation for the Validity of the Gaussian Evolution, 2023, 5, 2624-8174, 205, 10.3390/physics5010016 | |
54. | Xiaojin Guo, Chuangxia Huang, Jinde Cao, Nonnegative periodicity on high-order proportional delayed cellular neural networks involving D operator, 2020, 6, 2473-6988, 2228, 10.3934/math.2021135 | |
55. | Qian Cao, Attractivity analysis on a neoclassical growth system incorporating patch structure and multiple pairs of time-varying delays, 2021, 14173875, 1, 10.14232/ejqtde.2021.1.76 | |
56. | Reinhard Schlickeiser, Martin Kröger, Key Epidemic Parameters of the SIRV Model Determined from Past COVID-19 Mutant Waves, 2023, 3, 2673-8112, 592, 10.3390/covid3040042 | |
57. | Shixiang Han, Guanghui Yan, Huayan Pei, Wenwen Chang, Dynamical Analysis of an Improved Bidirectional Immunization SIR Model in Complex Network, 2024, 26, 1099-4300, 227, 10.3390/e26030227 | |
58. | Guangyu Li, Haifeng Du, Jiarui Fan, Xiaochen He, Wenhua Wang, The Effect of Fangcang Shelter Hospitals under Resource Constraints on the Spread of Epidemics, 2023, 20, 1660-4601, 5802, 10.3390/ijerph20105802 | |
59. | Chuangxia Huang, Jiafu Wang, Lihong Huang, Asymptotically almost periodicity of delayed Nicholson-type system involving patch structure, 2020, 2020, 1072-6691, 61, 10.58997/ejde.2020.61 | |
60. | 德玉 郭, Construction and Dynamic Analysis of a Class of Hepatitis C Model with Population Heterogeneity, 2023, 12, 2324-7991, 4665, 10.12677/AAM.2023.1211458 | |
61. | Guojin Wang, Wei Yao, An application of small-world network on predicting the behavior of infectious disease on campus, 2024, 9, 24680427, 177, 10.1016/j.idm.2023.12.007 | |
62. | Bingjie Wu, Liang’an Huo, Studying the impact of individual emotional states on the co-evolution of information, behavior and disease in multiplex networks, 2025, 03784371, 130480, 10.1016/j.physa.2025.130480 | |
63. | Samuel Lopez, Natalia L. Komarova, An optimal network that promotes the spread of an advantageous variant in an SIR epidemic, 2025, 00225193, 112095, 10.1016/j.jtbi.2025.112095 |
γ | θ | ℓ | dv | dw | σ | β | K | r | c | Θ | ς | L |
1.2 | 0.45 | 0 | 0.0001 | 0.09 | 0.2 | 0.44 | 1 | 1 | 1 | 3 | 0.75 | 1 |
γ | θ | ℓ | β | σ | K | dv | dw | c |
10 | 1 | 1 | 10 | 12 | 10 | 0.1 | 0.1 | 1 |