Loading [MathJax]/jax/output/SVG/jax.js
Research article Special Issues

Applying deep learning to defect detection in printed circuit boards via a newest model of you-only-look-once


  • Received: 07 April 2021 Accepted: 13 May 2021 Published: 21 May 2021
  • In this paper, a new model known as YOLO-v5 is initiated to detect defects in PCB. In the past many models and different approaches have been implemented in the quality inspection for detection of defect in PCBs. This algorithm is specifically selected due to its efficiency, accuracy and speed. It is well known that the traditional YOLO models (YOLO, YOLO-v2, YOLO-v3, YOLO-v4 and Tiny-YOLO-v2) are the state-of-the-art in artificial intelligence industry. In electronics industry, the PCB is the core and the most basic component of any electronic product. PCB is almost used in each and every electronic product that we use in our daily life not only for commercial purposes, but also used in sensitive applications such defense and space exploration. These PCB should be inspected and quality checked to detect any kind of defects during the manufacturing process. Most of the electronic industries are focused on the quality of their product, a small error during manufacture or quality inspection of the electronic products such as PCB leads to a catastrophic end. Therefore, there is a huge revolution going on in the manufacturing industry where the object detection method like YOLO-v5 is a game changer for many industries such as electronic industries.

    Citation: Venkat Anil Adibhatla, Huan-Chuang Chih, Chi-Chang Hsu, Joseph Cheng, Maysam F. Abbod, Jiann-Shing Shieh. Applying deep learning to defect detection in printed circuit boards via a newest model of you-only-look-once[J]. Mathematical Biosciences and Engineering, 2021, 18(4): 4411-4428. doi: 10.3934/mbe.2021223

    Related Papers:

    [1] Chun Lu, Bing Li, Limei Zhou, Liwei Zhang . Survival analysis of an impulsive stochastic delay logistic model with Lévy jumps. Mathematical Biosciences and Engineering, 2019, 16(5): 3251-3271. doi: 10.3934/mbe.2019162
    [2] Sheng Wang, Lijuan Dong, Zeyan Yue . Optimal harvesting strategy for stochastic hybrid delay Lotka-Volterra systems with Lévy noise in a polluted environment. Mathematical Biosciences and Engineering, 2023, 20(4): 6084-6109. doi: 10.3934/mbe.2023263
    [3] Linni Li, Jin-E Zhang . Input-to-state stability of stochastic nonlinear system with delayed impulses. Mathematical Biosciences and Engineering, 2024, 21(2): 2233-2253. doi: 10.3934/mbe.2024098
    [4] Yongxin Gao, Shuyuan Yao . Persistence and extinction of a modified Leslie-Gower Holling-type Ⅱ predator-prey stochastic model in polluted environments with impulsive toxicant input. Mathematical Biosciences and Engineering, 2021, 18(4): 4894-4918. doi: 10.3934/mbe.2021249
    [5] Jian Meng, Bin Zhang, Tengda Wei, Xinyi He, Xiaodi Li . Robust finite-time stability of nonlinear systems involving hybrid impulses with application to sliding-mode control. Mathematical Biosciences and Engineering, 2023, 20(2): 4198-4218. doi: 10.3934/mbe.2023196
    [6] Meng Gao, Xiaohui Ai . A stochastic Gilpin-Ayala mutualism model driven by mean-reverting OU process with Lévy jumps. Mathematical Biosciences and Engineering, 2024, 21(3): 4117-4141. doi: 10.3934/mbe.2024182
    [7] Yuanpei Xia, Weisong Zhou, Zhichun Yang . Global analysis and optimal harvesting for a hybrid stochastic phytoplankton-zooplankton-fish model with distributed delays. Mathematical Biosciences and Engineering, 2020, 17(5): 6149-6180. doi: 10.3934/mbe.2020326
    [8] Dongmei Li, Tana Guo, Yajing Xu . The effects of impulsive toxicant input on a single-species population in a small polluted environment. Mathematical Biosciences and Engineering, 2019, 16(6): 8179-8194. doi: 10.3934/mbe.2019413
    [9] Ting Kang, Yanyan Du, Ming Ye, Qimin Zhang . Approximation of invariant measure for a stochastic population model with Markov chain and diffusion in a polluted environment. Mathematical Biosciences and Engineering, 2020, 17(6): 6702-6719. doi: 10.3934/mbe.2020349
    [10] Tainian Zhang, Zhixue Luo, Hao Zhang . Optimal harvesting for a periodic n-dimensional food chain model with size structure in a polluted environment. Mathematical Biosciences and Engineering, 2022, 19(8): 7481-7503. doi: 10.3934/mbe.2022352
  • In this paper, a new model known as YOLO-v5 is initiated to detect defects in PCB. In the past many models and different approaches have been implemented in the quality inspection for detection of defect in PCBs. This algorithm is specifically selected due to its efficiency, accuracy and speed. It is well known that the traditional YOLO models (YOLO, YOLO-v2, YOLO-v3, YOLO-v4 and Tiny-YOLO-v2) are the state-of-the-art in artificial intelligence industry. In electronics industry, the PCB is the core and the most basic component of any electronic product. PCB is almost used in each and every electronic product that we use in our daily life not only for commercial purposes, but also used in sensitive applications such defense and space exploration. These PCB should be inspected and quality checked to detect any kind of defects during the manufacturing process. Most of the electronic industries are focused on the quality of their product, a small error during manufacture or quality inspection of the electronic products such as PCB leads to a catastrophic end. Therefore, there is a huge revolution going on in the manufacturing industry where the object detection method like YOLO-v5 is a game changer for many industries such as electronic industries.



    The predator-prey model is one of the hotspots in biomathematics. For example, Yavuz and Sene [1] considered a fractional predator-prey model with harvesting rate, Chatterjee and Pal [2] studied a predator-prey model for the optimal control of fish harvesting through the imposition of a tax and Ghosh et al. [3] presented a three-component model consisting of one prey and two predator species using imprecise biological parameters as interval numbers and applied a functional parametric form in the proposed prey-predator system. Because of its important role in the ecosystem, the food chain model has been extensively studied [4,5,6,7,8]. Specifically, the classical four-species food chain model can be expressed as follows:

    {dx1(t)=x1(t)[r1a11x1(t)a12x2(t)]dt,dx2(t)=x2(t)[r2+a21x1(t)a22x2(t)a23x3(t)]dt,dx3(t)=x3(t)[r3+a32x2(t)a33x3(t)a34x4(t)]dt,dx4(t)=x4(t)[r4+a43x3(t)a44x4(t)]dt, (1.1)

    where x1(t), x2(t), x3(t) and x4(t) represent the densities of prey, primary predator, intermediate predator and top predator at time t, respectively. r1 is the growth rate of prey, r2, r3 and r4 are the death rates of primary predator, intermediate predator and top predator, respectively. aij and aji (i<j) are the capture rates and food conversion rates, respectively. aii are the intraspecific competition rates of species i. All parameters in system (1.1) are positive constants.

    In ecology, biology, physics, engineering and other areas of applied sciences, continuous-time models, fractional-order models as well as discrete-time models have been widely adopted [9,10]. However, "time delays occur so often that to ignore them is to ignore reality" [11,12], and in the models of population dynamics, the delay differential equations are much more realistic [13,14,15]. We know that systems with discrete time delays and those with continuously distributed time delays do not contain each other but systems with S-type distributed time delays contain both. Introducing S-type distributed time delays into system (1.1) yields

    {dx1(t)=x1(t)[r1D11(x1)(t)D12(x2)(t)]dt,dx2(t)=x2(t)[r2+D21(x1)(t)D22(x2)(t)D23(x3)(t)]dt,dx3(t)=x3(t)[r3+D32(x2)(t)D33(x3)(t)D34(x4)(t)]dt,dx4(t)=x4(t)[r4+D43(x3)(t)D44(x4)(t)]dt, (1.2)

    where Dji(xi)(t)=ajixi(t)+0τjixi(t+θ)dμji(θ), 0τjixi(t+θ)dμji(θ) are Lebesgue-Stieltjes integrals, τji>0 are time delays, μji(θ) are nondecreasing bounded variation functions defined on [τ,0], τ=max{τji}.

    On the other hand, the deterministic system has its limitation in mathematical modeling of ecosystems since the parameters involved in the system are unable to capture the influence of environmental noises [16,17]. Introducing Gaussian white noises into the corresponding deterministic model is one common way to characterize environmental noises [18,19,20,21,22,23,24,25]. As we all know, Gaussian white noise ξ(t) is a stationary and ergodic stochastic process with ξ(t)=0 and ξ(t)ξ(s)=σ2δ(ts), where σ2 is the noise intensity [26]. The readers can refer to [27,28,29,30,31,32,33,34] for more related works. In this paper, we assume that ri are affected by Gaussian white noises, i.e., r1r1+σ1˙W1(t), r2r2+σ2˙W2(t), r3r3+σ3˙W3(t) and r4r4+σ4˙W4(t). Then, system (1.2) becomes

    {dx1(t)=x1(t)[r1D11(x1)(t)D12(x2)(t)]dt+σ1x1(t)dW1(t),dx2(t)=x2(t)[r2+D21(x1)(t)D22(x2)(t)D23(x3)(t)]dt+σ2x2(t)dW2(t),dx3(t)=x3(t)[r3+D32(x2)(t)D33(x3)(t)D34(x4)(t)]dt+σ3x3(t)dW3(t),dx4(t)=x4(t)[r4+D43(x3)(t)D44(x4)(t)]dt+σ4x4(t)dW4(t), (1.3)

    where Wi(t) are mutually independent standard Wiener processes defined on a complete probability space (Ω,F,P) satisfying the usual statistical properties, namely dWi(t)=0 and dWi(t)dWj(s)=δijδ(ts)dt [35].

    Besides, population system may be affected by telephone noises which can cause the system to switch from one environmental regime to another [36,37,38]. So, telephone noises should be taken into consideration in system (1.3), resulting the following model:

    {dx1(t)=x1(t)[r1(ρ(t))D11(x1)(t)D12(x2)(t)]dt+σ1(ρ(t))x1(t)dW1(t),dx2(t)=x2(t)[r2(ρ(t))+D21(x1)(t)D22(x2)(t)D23(x3)(t)]dt+σ2(ρ(t))x2(t)dW2(t),dx3(t)=x3(t)[r3(ρ(t))+D32(x2)(t)D33(x3)(t)D34(x4)(t)]dt+σ3(ρ(t))x3(t)dW3(t),dx4(t)=x4(t)[r4(ρ(t))+D43(x3)(t)D44(x4)(t)]dt+σ4(ρ(t))x4(t)dW4(t), (1.4)

    where ρ(t) is a continuous time Markov chain with finite state space S={1,2,...,S}, which describes the telephone noises.

    Moreover, the behaviour of real biological species, in different ecosystems, is affected by Lévy noises [39]. Lévy processes are characterized by stationary independent increments [40]. Assume that L(t) (t0) is a Lévy process, using the decomposition [41]

    L(t)=L(tn)+[L(2tn)L(tn)]++[L(ntn)L((n1)tn)],

    one can observe that the probability distribution of L(t) is infinitely divisible. The most general expression for the characteristic function of L(t) is

    φ(k)=exp{ikμ|σk|α[1iβsgn(k)Φ]},

    where sgn(k) is the sign function with

    Φ={tan(πα/2),forallα1,(2/π)log|k|,forallα=1,

    where α(0,2] is the stability parameter, σ is the scale parameter, σα is the noise intensity, μR is the location parameter and β[1,1] is the skewness parameter [39]. In addition, Lévy noises are statistically independent with zero mean. Now, let us further improve system (1.4) by considering Lévy noises. Some scholars pointed out that Lévy noises can be used to describe some sudden environmental perturbations, for instance, earthquakes and hurricanes [42,43,44,45,46,47]. In the context of an epidemic situation, random jumps could refer to sudden and significant increases in the number of cases or spread of the disease that occur unpredictably [48]. System (1.4) with Lévy noises can be expressed as follows:

    {dx1(t)=x1(t)[(r1(ρ(t))D11(x1)(t)D12(x2)(t))dt+S1(t,ρ(t))],dx2(t)=x2(t)[(r2(ρ(t))+D21(x1)(t)D22(x2)(t)D23(x3)(t))dt+S2(t,ρ(t))],dx3(t)=x3(t)[(r3(ρ(t))+D32(x2)(t)D33(x3)(t)D34(x4)(t))dt+S3(t,ρ(t))],dx4(t)=x4(t)[(r4(ρ(t))+D43(x3)(t)D44(x4)(t))dt+S4(t,ρ(t))], (1.5)

    where Si(t,ρ(t))=σi(ρ(t))dWi(t)+Zγi(μ,ρ(t))˜N(dt,dμ), N is a Poisson counting measure with characteristic measure λ on a measurable subset Z of [0,+), where λ(Z)<+ and ˜N(dt,dμ)=N(dt,dμ)λ(dμ)dt, γj(μ,ρ(t))>1 (μZ) are bounded functions (j=1,2,3,4).

    Finally, environmental pollution caused by agriculture, industries and other human activities has become a big challenge that is commonly concerned by international society. For example, with the rapid development of industrial and agricultural production, some chemical plants and other industries often periodically discharge sewage or other pollutants into rivers, soil and air [49]. These pollutants can cause direct damage to ecosystems, such as species extinction, desertification and the greenhouse effect. Hence, we extend system (1.5) into the following form:

    {dx1(t)=x1(t)[(r1(ρ(t))r11C10(t)D11(x1)(t)D12(x2)(t))dt+S1(t,ρ(t))],dx2(t)=x2(t)[(r2(ρ(t))r22C20(t)+D21(x1)(t)D22(x2)(t)D23(x3)(t))dt+S2(t,ρ(t))],dx3(t)=x3(t)[(r3(ρ(t))r33C30(t)+D32(x2)(t)D33(x3)(t)D34(x4)(t))dt+S3(t,ρ(t))],dx4(t)=x4(t)[(r4(ρ(t))r44C40(t)+D43(x3)(t)D44(x4)(t))dt+S4(t,ρ(t))],dCi0(t)=[kiCe(t)(gi+mi)Ci0(t)]dt,dCe(t)=hCe(t)dt,}tnγ,Δxi(t)=0,ΔCi0(t)=0,ΔCe(t)=b,t=nγ,nZ+(i=1,2,3,4), (1.6)

    where Δxi(t)=xi(t+)xi(t), ΔCi0(t)=Ci0(t+)Ci0(t) and ΔCe(t)=Ce(t+)Ce(t). For other parameters in system (1.6), see Table 1.

    Table 1.  Definition of some parameters in system (1.6).
    Parameter Definition
    Ci0(t) the toxicant concentration in the organism of species i at time t
    Ce(t) the toxicant concentration in the environment at time t
    rii the dose-response rate of species i to the organismal toxicant
    ki the toxin uptake rate per unit biomass
    gi the organismal net ingestion rate of toxin
    mi the organismal deportation rate of toxin
    h the rate of toxin loss in the environment
    γ the period of the impulsive toxicant input
    b the toxicant input amount at every time

     | Show Table
    DownLoad: CSV

    To the best of our knowledge to date, results about a stochastic hybrid delay four-species food chain model with jumps have not been reported. So, in this paper we investigate the dynamics of a stochastic hybrid delay four-species food chain model with jumps in an impulsive polluted environment. The organization of this paper is as follows: In Section 2, some basic preliminaries are presented. In Section 3, the sufficient and necessary conditions for stochastic persistence in mean and extinction of each species are obtained. In Section 4, some numerical examples are provided to illustrate our main results. Finally, we conclude the paper with a brief conclusion and discussion in Section 5.

    We have four fundamental assumptions for system (1.6).

    Assumption 1. W1(t), W2(t), W3(t), W4(t), ρ(t) and N are mutually independent. ρ(t), taking values in S={1,2,...,S}, is irreducible with one unique stationary distribution π=(π1,π2,...,πS)T.

    Assumption 2. rj(i)>0, ajk>0 and there exist γj(i)γj(i)>1 such that γj(i)γj(μ,i)γj(i) (μZ), iS, j,k=1,2,3,4.

    Remark 1. Assumption 2 implies that the intensities of Lévy jumps are not too big to ensure that the solution will not explode in finite time.

    Assumption 3. 0<kigi+mi (i=1,2,3,4), 0<b1ehγ.

    Remark 2. Assumption 3 means 0Ci0(t)<1 and 0Ce(t)<1, which must be satisfied to be realistic because Ci0(t) and Ce(t) are concentrations of the toxicant (i=1,2,3,4).

    Assumption 4. A22A33A44|A||Ξ|>A12A21A23A32A44|Ξ|+A23A32A34A43|A|2.

    Lemma 1. [50,51] Ci0(t) involved in system (1.6) satisfies

    limt+t1t0Ci0(s)ds=kibh(gi+mi)γ=Ki(i=1,2,3,4).

    Denote

    {Aij=aij+0τijdμij(θ),Ki=kibh(gi+mi)γ,b1()=r1()σ21()2Z[γ1(μ,)ln(1+γ1(μ,))]λ(dμ),bj()=rj()+σ2j()2+Z[γj(μ,)ln(1+γj(μ,))]λ(dμ)(j=2,3,4),Σ1=Si=1πib1(i)r11K1,Σj=Si=1πibj(i)rjjKj(j=2,3,4),B1=Σ1,B2=Σ2+A21A11B1,B3=Σ3+A32A22B2,B4=Σ4+A43A33B3,A=(A11A12A21A22),Ξ=(A11A120A21A22A230A32A33),Δ=(A11A1200A21A22A2300A32A33A3400A43A44).

    Denote Σ(2)=(Σ1,Σ2)T, Σ(3)=(Σ1,Σ2,Σ3)T, Σ=(Σ1,Σ2,Σ3,Σ4)T. Denote Aj is A with column j replaced by Σ(2) (j=1,2); Ξj is Ξ with column j replaced by Σ(3) (j=1,2,3); Δj is Δ with column j replaced by Σ (j=1,2,3,4).

    Theorem 1. For any initial condition ϕC([τ,0],R4+), system (1.6) has a unique global solution (x1(t),x2(t),x3(t),x4(t))TR4+ on tR+ a.s. Moreover, for any constant p>0, there exists Ki(p)>0 such that suptR+E[xpi(t)]Ki(p) (i=1,2,3,4).

    Proof. The proof is rather standard and hence is omitted (see e.g., [52]).

    Lemma 2. [53] Suppose Z(t)C(Ω×[0,+),R+) and limt+o(t)t=0.

    (i) If there exists constant δ0>0 such that for t1,

    lnZ(t)δtδ0t0Z(s)ds+o(t),

    then

    {lim supt+t1t0Z(s)dsδδ0a.s.(δ0);limt+Z(t)=0a.s.(δ<0).

    (ii) If there exist constants δ>0 and δ0>0 such that for t1,

    lnZ(t)δtδ0t0Z(s)ds+o(t),

    then

    lim inft+t1t0Z(s)dsδδ0a.s.

    Lemma 3. If |Δ4|>0, then |Δj|>0 (j=1,2,3).

    Proof. Compute

    A44|Δ4|A43|Δ3|=[(A33A44+A34A43)|A|+A11A23A32A44]Σ4.
    A32|Δ2|=A33|Δ3|+A34|Δ4|[(A33A44+A34A43)|A|+A11A23A32A44]Σ3.
    A21|Δ1|=A22|Δ2|+A23|Δ3|[A11A44(A22A33+A23A32)+A34A43|A|+A12A21A33A44]Σ2.

    Noting that Σj<0 (j=2,3,4), we obtain the desired assertion.

    First, let us consider the following auxiliary system:

    { dX1(t)=X1(t)[(r1(ρ(t))r11C10(t)D11(X1)(t))dt+S1(t,ρ(t))],dX2(t)=X2(t)[(r2(ρ(t))r22C20(t)+D21(X1)(t)D22(X2)(t))dt+S2(t,ρ(t))],dX3(t)=X3(t)[(r3(ρ(t))r33C30(t)+D32(X2)(t)D33(X3)(t))dt+S3(t,ρ(t))],dX4(t)=X4(t)[(r4(ρ(t))r44C40(t)+D43(X3)(t)D44(X4)(t))dt+S4(t,ρ(t))],dCi0(t)=[kiCe(t)(gi+mi)Ci0(t)]dt,dCe(t)=hCe(t)dt,}tnγ,ΔXi(t)=0,ΔCi0(t)=0,ΔCe(t)=b,t=nγ,nZ+(i=1,2,3,4). (3.1)

    Lemma 4. System (3.1) satisfies Table 2, where

    ¯XT()=limt+t1(t0X1(s)ds,t0X2(s)ds,t0X3(s)ds,t0X4(s)ds).
    Table 2.  Stochastic persistence in mean and extinction of system (3.1).
    B4 B3 B2 B1 ¯XT()
    0 0 0 0 (B1A11,B2A22,B3A33,B4A44)
    <0 0 0 0 (B1A11,B2A22,B3A33,0)
    <0 0 0 (B1A11,B2A22,0,0)
    <0 0 (B1A11,0,0,0)
    <0 (0,0,0,0)

     | Show Table
    DownLoad: CSV

    Proof. Consider the following stochastic hybrid delay logistic model with Lévy jump in an impulsive polluted environment:

    {dX1(t)=X1(t)[(r1(ρ(t))h1r11C10(t)D11(X1)(t))dt+S1(t,ρ(t))],dC10(t)=[k1Ce(t)(g1+m1)C10(t)]dt,dCe(t)=hCe(t)dt,}tnγ,ΔX1(t)=0,ΔC10(t)=0,ΔCe(t)=b,t=nγ,nN+. (3.2)

    Thanks to Lemma 1 and Lemma 2.3 in [54], system (3.2) satisfies

    {limt+X1(t)=0a.s.(B1<0);limt+t1t0X1(s)ds=B1A11a.s.(B10). (3.3)

    By Itô's formula, we compute

    lnX(t)=ΣtA0t0X(s)ds+(T11(X1)(t)T21(X1)(t)T22(X2)(t)T32(X2)(t)T33(X3)(t)T43(X3)(t)T44(X4)(t))+o(t), (3.4)

    where

    lnX(t)=(lnX1(t)lnX2(t)lnX3(t)lnX4(t)),X(s)ds=(X1(s)dsX2(s)dsX3(s)dsX4(s)ds),A0=(A11000A21A22000A32A33000A43A44),o(t)=o(t)(1111),Tji(Xi)(t)=0τji0θXi(s)dsdμji(θ)0τjitt+θXi(s)dsdμji(θ).

    Case(1): B1<0. Based on Eq (3.3), limt+X1(t)=0 a.s. Therefore, for ϵ(0,1) and t1,

    lnX2(t)(Σ2+ϵ)a22t0X2(s)ds.

    Since Σ2<0, then limt+X2(t)=0 a.s. Similarly, limt+Xj(t)=0 a.s. (j=3,4).

    Case(2): B10. Then,

    limt+t1t0X1(s)ds=B1A11a.s. (3.5)

    Consider the following auxiliary function:

    d~X2(t)=~X2(t)[(r2(ρ(t))r22C20(t)+D21(X1)(t)a22~X2(t))dt+S2(t,ρ(t))].

    Then X2(t)~X2(t) a.s. By Itô's formula, we get

    ln~X2(t)=B2ta22t0~X2(s)ds+o(t).

    In view of Lemma 2, we obtain:

    If B10, B2<0, then limt+~X2(t)=0 a.s.

    If B10, B20, then

    limt+t1t0~X2(s)ds=B2a22a.s.

    Therefore, for arbitrary ζ>0, we have

    limt+t1ttζXi(s)ds=0a.s.(i=1,2). (3.6)

    According to system (3.4) and Eq (3.6), we obtain

    lnX2(t)=B2tA22t0X2(s)ds+o(t).

    Thanks to Lemma 2, we deduce:

    If B10, B2<0, then limt+Xj(t)=0 a.s. (j=2,3,4).

    If B10, B20, then

    limt+t1t0X2(s)ds=B2A22a.s.

    Case(3): B10, B20. Consider the following SDE:

    d~X3(t)=~X3(t)[(r3(ρ(t))r33C30(t)+D32(X2)(t)a33~X3(t))dt+S3(t,ρ(t))].

    Then X3(t)~X3(t) a.s. By Itô's formula, we get

    ln~X3(t)=B3ta33t0~X3(s)ds+o(t).

    In the light of Lemma 2, we obtain:

    If B10, B20, B3<0, then limt+~X3(t)=0 a.s.

    If B10, B20, B30, then

    limt+t1t0~X3(s)ds=B3a33a.s.

    Hence, for arbitrary ζ>0,

    limt+t1ttζXi(s)ds=0a.s.(i=1,2,3). (3.7)

    Thanks to system (3.4) and Eq (3.7), we obtan

    lnX3(t)=B3tA33t0X3(s)ds+o(t).

    Based on Lemma 2, we obtain:

    If B10, B20, B3<0, then limt+Xj(t)=0 a.s. (j=3,4).

    If B10, B20, B30, then

    limt+t1t0X3(s)ds=B3A33a.s.

    Case(4): B10, B20, B30. Consider the following SDE:

    d~X4(t)=~X4(t)[(r4(ρ(t))r44C40(t)+D43(X3)(t)a44~X4(t))dt+S4(t,ρ(t))].

    Then X4(t)~X4(t) a.s. By Itô's formula, we get

    ln~X4(t)=B4ta44t0~X4(s)ds+o(t).

    In view of Lemma 2, we obtain:

    If B10, B20, B30, B4<0, then limt+~X4(t)=0 a.s.

    If B10, B20, B30, B40, then

    limt+t1t0~X4(s)ds=B4a44a.s.

    Hence, for arbitrary ζ>0,

    limt+t1ttζXi(s)ds=0a.s.(i=1,2,3,4). (3.8)

    Thanks to systems (3.4) and (3.8), we deduce

    lnX4(t)=B4tA44t0X4(s)ds+o(t).

    Based on Lemma 2 and the arbitrariness of ϵ, we obtain:

    If B10,B20,B3<0,B4<0, then limt+X4(t)=0a.s.

    If B10,B20,B30,B40, then

    limt+t1t0X4(s)ds=B4A44a.s.

    The proof is complete.

    Lemma 5. For system (1.6):

    (i) lim supt+t1lnxi(t)0 a.s. (i=1,2,3,4).

    (ii) limt+xi(t)=0limt+xj(t)=0 a.s. (1i<j4).

    Proof. From Lemma 4, system (3.1) satisfies limt+t1lnXi(t)=0 a.s. (i=1,2,3,4). By the stochastic comparison theorem, we obtain the desired assertion (i). The proof of (ii) is similar to that of Lemma 4 and here is omitted.

    Theorem 2. Under Assumption 4 system (1.6) satisfies Table 3, where

    ¯xT()=limt+t1(t0x1(s)ds,t0x2(s)ds,t0x3(s)ds,t0x4(s)ds).
    Table 3.  Stochastic persistence in mean and extinction of system (1.6).
    |Δ4| |Ξ3| |A2| B1 ¯xT()
    + (|Δ1||Δ|,|Δ2||Δ|,|Δ3||Δ|,|Δ4||Δ|)
    + (|Ξ1||Ξ|,|Ξ2||Ξ|,|Ξ3||Ξ|,0)
    + (|A1||A|,|A2||A|,0,0)
    + (B1A11,0,0,0)
    (0,0,0,0)

     | Show Table
    DownLoad: CSV

    Proof. Compute |Δ4|<A43|Ξ3|<A32A43|A2|<A21A32A43B1. By Eq (3.8), for any ζ>0,

    limt+t1ttζxi(s)ds=0a.s.(i=1,2,3,4).

    By Itô's formula, we compute

    lnx(t)=ΣtΔt0x(s)ds+o(t). (3.9)

    Case(i): |Δ4|>0. According to system (3.9), we compute

    limt+t1(A21A32A43lnx1(t)+A11A32A43lnx2(t)+A43|A|lnx3(t)+|Ξ|lnx4(t)+|Δ|t0x4(s)ds)=|Δ4|. (3.10)

    In view of Lemma 5 (i) and Lemma 2, we get

    lim inft+t1t0x4(s)ds|Δ4||Δ|a.s. (3.11)

    Based on system (3.9), we compute

    limt+t1(A22A43lnx1(t)A12A43lnx2(t)A12A23lnx4(t)+A43|A|t0x1(s)dsA12A23A44t0x4(s)ds)=A43|A1|A12A23Σ4. (3.12)

    By Lemma 5 (i) and Eq (3.12), for ϵ(0,1) and t1,

    A22A43lnx1(t)(A43|A1|A12A23Σ4+A12A23A44lim supt+t1t0x4(s)ds+ϵ)tA43|A|t0x1(s)ds.

    In view of Eq (3.11), we deduce

    A43|A1|A12A23Σ4+A12A23A44lim supt+t1t0x4(s)dsA43|A1|A12A23Σ4+A12A23A44lim inft+t1t0x4(s)dsA43|A1|A12A23Σ4+A12A23A44|Δ4||Δ|=A43|A||Δ1||Δ|, (3.13)

    where |A|>0 and |Δ|>0. From Lemma 3, we have |Δ1|>0. Based on Lemma 2 and the arbitrariness of ϵ, we obtain

    lim supt+t1t0x1(s)dsA143|A|1(A43|A1|A12A23Σ4+A12A23A44lim supt+t1t0x4(s)ds)=Γsupx1a.s. (3.14)

    According to system (3.9), we compute

    limt+t1(A21A32lnx1(t)+A11A32lnx2(t)+|A|lnx3(t)+A34|A|t0x4(s)ds+|Ξ|t0x3(s)ds)=|Ξ3|. (3.15)

    Thanks to Lemma 5 (i) and Eq (3.15), for ϵ(0,1) and t1,

    |A|lnx3(t)(|Ξ3|A34|A|lim supt+t1t0x4(s)dsϵ)t|Ξ|t0x3(s)ds.

    If

    |Ξ3|A34|A|lim supt+t1t0x4(s)ds>0,

    then by Lemma 2 and the arbitrariness of ϵ, we obtain

    lim inft+t1t0x3(s)ds|Ξ|1(|Ξ3|A34|A|lim supt+t1t0x4(s)ds)=Γinfx3a.s. (3.16)

    If

    |Ξ3|A34|A|lim supt+t1t0x4(s)ds0,

    since lim inft+t1t0x3(s)ds0, we also obtain Eq (3.16).

    According to system (3.9), Eq (3.14) and Eq (3.16), for ϵ(0,1) and t1,

    lnx2(t)(Σ2+A21Γsupx1A23Γinfx3+ϵ)tA22t0x2(s)ds.

    On the basis of Eq (3.13), Eq (3.14) and Eq (3.16), we have

    Σ2+A21Γsupx1A23Γinfx3Σ2+A21|Δ1||Δ|A23|Ξ|1(|Ξ3|A34|A|lim inft+t1t0x4(s)ds)Σ2+A21|Δ1||Δ|A23|Ξ|1(|Ξ3|A34|A||Δ4||Δ|)=A22|Δ2||Δ|. (3.17)

    From Lemma 3, we have |Δ2|>0. By Lemma 2 and the arbitrariness of ϵ, we obtain

    lim supt+t1t0x2(s)dsA122(Σ2+A21Γsupx1A23Γinfx3)=Γsupx2a.s. (3.18)

    By system (3.9), Eq (3.11) and Eq (3.18), for ϵ(0,1) and t1,

    lnx3(t)(Σ3+A32Γsupx2A34|Δ4||Δ|+ϵ)tA33t0x3(s)ds.

    In view of Eq (3.17) and Eq (3.18), we obtain

    Σ3+A32Γsupx2A34|Δ4||Δ|Σ3+A32|Δ2||Δ|A34|Δ4||Δ|=A33|Δ3||Δ|. (3.19)

    In the light of Lemma 3, we have |Δ3|>0. Thanks to Lemma 2 and the arbitrariness of ϵ, we obtain

    lim supt+t1t0x3(s)dsA133(Σ3+A32Γsupx2A34|Δ4||Δ|)=Γsupx3a.s. (3.20)

    By system (3.9) and Eq (3.20), for ϵ(0,1) and t1,

    lnx4(t)(Σ4+A43Γsupx3+ϵ)tA44t0x4(s)ds.

    Thanks to Eq (3.19), we obtain

    Σ4+A43Γsupx3Σ4+A43|Δ3||Δ|=A44|Δ4||Δ|.

    In the light of Lemma 2 and the arbitrariness of ϵ, we obtain

    lim supt+t1t0x4(s)dsA144(Σ4+A43Γsupx3)a.s.

    In other words, we have

    A22A33A44|A||Ξ|A12A21A23A32A44|Ξ|A23A32A34A43|A|2A22A33|A||Ξ|lim supt+t1t0x4(s)dsΣ4+A43A133[Σ3+A32A122(Σ2+A21|A1||A|+A12A21A23Σ4A43|A|A23|Ξ3||Ξ|)A34|Δ4||Δ|]. (3.21)

    According to Eq (3.21) and Assumption 4, we obtain

    lim supt+t1t0x4(s)ds|Δ4||Δ|a.s. (3.22)

    Combining Eq (3.11) and Eq (3.22) yields

    limt+t1t0x4(s)ds=|Δ4||Δ|a.s. (3.23)

    Substituting Eq (3.22) into Eq (3.14) yields

    lim supt+t1t0x1(s)dsA143|A|1(A43|A1|A12A23Σ4+A12A23A44|Δ4||Δ|)=|Δ1||Δ|. (3.24)

    Substituting Eq (3.22) into Eq (3.16) yields

    lim inft+t1t0x3(s)ds|Ξ|1(|Ξ3|A34|A||Δ4||Δ|)=|Δ3||Δ|. (3.25)

    Substituting Eq (3.24) and Eq (3.25) into Eq (3.18) yields

    lim supt+t1t0x2(s)dsA122(Σ2+A21|Δ1||Δ|A23|Δ3||Δ|)=|Δ2||Δ|. (3.26)

    Substituting Eq (3.26) into Eq (3.20) yields

    lim supt+t1t0x3(s)dsA133(Σ3+A32|Δ2||Δ|A34|Δ4||Δ|)=|Δ3||Δ|. (3.27)

    Combining Eq (3.25) and Eq (3.27) yields

    limt+t1t0x3(s)ds=|Δ3||Δ|a.s. (3.28)

    In view of system (3.9), we have

    limt+t1(lnx1(t)+A11t0x1(s)ds+A12t0x2(s)ds)=B1. (3.29)

    By Eq (3.26) and Eq (3.29), for ϵ(0,1) and t1,

    lnx1(t)(B1A12|Δ2||Δ|ϵ)tA11t0x1(s)ds,

    where B1A12|Δ2||Δ|=A11|Δ1||Δ|. From Lemma 3, we have |Δ1|>0. According to Lemma 2 and the arbitrariness of ϵ, we have

    lim inft+t1t0x1(s)ds|Δ1||Δ|a.s. (3.30)

    Combining Eq (3.24) with Eq (3.30) yields

    limt+t1t0x1(s)ds=|Δ1||Δ|a.s. (3.31)

    Substituting Eq (3.31) into system (3.9) yields

    limt+t1(lnx2(t)+A22t0x2(s)ds)=A22|Δ2||Δ|a.s.

    From Lemma 3, we have |Δ2|>0. By Lemma 2, we obtain

    limt+t1t0x2(s)ds=|Δ2||Δ|a.s. (3.32)

    Case(ii): |Ξ3|>0>|Δ4|. Thanks to Eq (3.10), we deduce

    lim supt+t1ln(xA21A32A431(t)xA11A32A432(t)xA43|A|3(t)x|Ξ|4(t))|Δ4|<0a.s.

    which implies

    limt+xA21A32A431(t)xA11A32A432(t)xA43|A|3(t)x|Ξ|4(t)=0a.s. (3.33)

    From Lemma 5 (ii) and Eq (3.33), we obtain

    limt+x4(t)=0a.s. (3.34)

    In other words,

    limt+t1t0x4(s)ds=0a.s.

    According to system (3.9), we compute

    limt+t1(A21A32lnx1(t)+A11A32lnx2(t)+|A|lnx3(t)+|Ξ|t0x3(s)ds)=|Ξ3|. (3.35)

    Combining Lemma 5 (i) with Lemma 2 yields

    lim inft+t1t0x3(s)ds|Ξ3||Ξ|a.s. (3.36)

    Based on system (3.9), we compute

    limt+t1(A22lnx1(t)A12lnx2(t)+|A|t0x1(s)dsA12A23t0x3(s)ds)=|A1|. (3.37)

    By Lemma 5 (i) and Eq (3.37), for ϵ(0,1) and t1,

    A22lnx1(t)(|A1|+A12A23lim supt+t1t0x3(s)ds+ϵ)t|A|t0x1(s)ds.

    On the basis of Eq (3.36), we deduce

    |A1|+A12A23lim supt+t1t0x3(s)ds|A1|+A12A23|Ξ3||Ξ|=|A||Ξ1||Ξ|>0.

    In view of Lemma 2 and the arbitrariness of ϵ, we obtain

    lim supt+t1t0x1(s)ds|A|1(|A1|+A12A23lim supt+t1t0x3(s)ds)=Υsupx1a.s. (3.38)

    According to system (3.9), Eq (3.36) and Eq (3.38), for ϵ(0,1) and t1,

    lnx2(t)(Σ2+A21Υsupx1A23|Ξ3||Ξ|+ϵ)tA22t0x2(s)ds. (3.39)

    Combining Eq (3.38) with system (3.39) yields

    Σ2+A21Υsupx1A23|Ξ3||Ξ|Σ2+A21|A|1(|A1|+A12A23|Ξ3||Ξ|)A23|Ξ3||Ξ|=A22|Ξ2||Ξ|>0. (3.40)

    In the light of Lemma 2 and the arbitrariness of ϵ, we obtain

    lim supt+t1t0x2(s)dsA122(Σ2+A21Υsupx1A23|Ξ3||Ξ|)a.s. (3.41)

    From system (3.9) and Eq (3.41), for ϵ(0,1) and t1,

    lnx3(t)(Σ3+A32A22(Σ2+A21Υsupx1A23|Ξ3||Ξ|)+ϵ)tA33t0x3(s)ds.

    Thanks to Eq (3.40), we obtain

    Σ3+A32A22(Σ2+A21Υsupx1A23|Ξ3||Ξ|)Σ3+A32|Ξ2||Ξ|=A33|Ξ3||Ξ|>0.

    In the light of Lemma 2 and the arbitrariness of ϵ, we obtain

    lim supt+t1t0x3(s)dsA133(B3A21A32A11A22B1+A32A22(A21Υsupx1A23|Ξ3||Ξ|))a.s.

    In other words, we have

    A22A33|A|A12A21A23A32A22|A|lim supt+t1t0x3(s)dsB3A21A32A11A22B1+A32A22(A21|A1||A|A23|Ξ3||Ξ|). (3.42)

    In view of Eq (3.42) and Assumption 4, we obtain

    lim supt+t1t0x3(s)ds|Ξ3||Ξ|a.s. (3.43)

    Combining Eq (3.36) and Eq (3.43) yields

    limt+t1t0x3(s)ds=|Ξ3||Ξ|a.s. (3.44)

    Substituting Eq (3.44) into Eq (3.38) yields

    lim supt+t1t0x1(s)ds|A|1(|A1|+A12A23|Ξ3||Ξ|)=|Ξ1||Ξ|. (3.45)

    Substituting Eq (3.45) into Eq (3.41) yields

    lim supt+t1t0x2(s)dsA122(Σ2+A21|Ξ1||Ξ|A23|Ξ3||Ξ|)=|Ξ2||Ξ|. (3.46)

    In view of system (3.9), we compute

    limt+t1(A21lnx1(t)+A11lnx2(t)+|A|t0x2(s)ds+A11A23t0x3(s)ds)=|A2|. (3.47)

    By Lemma 5 (i) and Eq (3.47), for ϵ(0,1) and t1,

    A11lnx2(t)(|A2|A11A23|Ξ3||Ξ|ϵ)t|A|t0x2(s)ds. (3.48)

    From Eq (3.40), we have |Ξ2|>0 and |Ξ|>0. Based on system (3.48) and Lemma 2,

    lim inft+t1t0x2(s)ds|A|1(|A2|A11A23|Ξ3||Ξ|)=|Ξ2||Ξ|a.s. (3.49)

    Combining Eq (3.46) with Eq (3.49) yields

    limt+t1t0x2(s)ds=|Ξ2||Ξ|a.s. (3.50)

    Substituting Eq (3.50) into system (3.9) yields

    limt+t1(lnx1(t)+A11t0x1(s)ds)=A11|Ξ1||Ξ|a.s.

    From Eq (3.38), we have |Ξ1|>0 and |Ξ|>0. Therefore, by Lemma 2, we obtain

    limt+t1t0x1(s)ds=|Ξ1||Ξ|a.s. (3.51)

    Case(iii): |A2|>0>|Ξ3|. Then limt+x4(t)=0 a.s. Thanks to Eq (3.35), we deduce

    lim supt+t1ln(xA21A321(t)xA11A322(t)x|A|3(t))|Ξ3|<0a.s.

    which implies

    lim supt+xA21A321(t)xA11A322(t)x|A|3(t)=0a.s. (3.52)

    According to Lemma 5 (ii) and Eq (3.52), we obtain

    limt+x3(t)=0a.s. (3.53)

    In other words, we derive

    limt+t1t0x3(s)ds=0a.s. (3.54)

    In view of Eq (3.47) and Eq (3.54), we get

    limt+t1(A21lnx1(t)+A11lnx2(t)+|A|t0x2(s)ds)=|A2|. (3.55)

    Based on Lemma 5 (i) and Lemma 2, we have

    lim inft+t1t0x2(s)ds|A2||A|a.s. (3.56)

    In the light of Eq (3.37) and Eq (3.54), we obtain

    limt+t1(A22lnx1(t)A12lnx2(t)+|A|t0x1(s)ds)=|A1|.

    By Lemma 5 (i) and Lemma 2, we obtain

    lim supt+t1t0x1(s)ds|A1||A|a.s. (3.57)

    Substituting Eq (3.54) and Eq (3.57) into system (3.9) yields

    lnx2(t)(Σ2+A21|A1||A|+ϵ)tA22t0x2(s)ds.

    On the basis of Lemma 2 and the arbitrariness of ϵ, we have

    lim supt+t1t0x2(s)dsA122(Σ2+A21|A1||A|)=|A2||A|a.s. (3.58)

    Combining Eq (3.56) with Eq (3.58) yields

    limt+t1t0x2(s)ds=|A2||A|a.s. (3.59)

    By system (3.9) and Eq (3.59), we compute

    limt+t1(lnx1(t)+A11t0x1(s)ds)=B1A12|A2||A|=A11|A1||A|a.s.

    In the light of Lemma 2, we obtain

    limt+t1t0x1(s)ds=|A1||A|a.s. (3.60)

    Case(iv): B1>0>|A2|. Then

    limt+xi(t)=0a.s.(i=3,4). (3.61)

    According to Eq (3.55), we gain

    lim supt+t1ln(xA211(t)xA112(t))|A2|<0a.s. (3.62)

    Hence, lim supt+xA211(t)xA112(t)=0. By Lemma 5 (ii) and Eq (3.62),

    limt+x2(t)=0a.s. (3.63)

    In other words, we derive

    limt+t1t0x2(s)ds=0a.s. (3.64)

    Substituting Eq (3.64) into system (3.9) yields

    lnx1(t)=B1tA11t0x1(s)ds+o(t).

    On the basis of Lemma 2 and the arbitrariness of ϵ, we obtain

    limt+t1t0x1(s)ds=B1A11a.s. (3.65)

    Case(v): B1<0. Compute

    limt+t1(lnx1(t)+A11t0x1(s)ds+A12t0x2(s)ds)=B1. (3.66)

    By Eq (3.66), we have

    lim supt+t1(lnx1(t)+A11t0x1(s)ds)B1.

    In view of Lemma 2, we obtain limt+x1(t)=0 a.s. According to Lemma 5 (ii), we get

    limt+xj(t)=0a.s.(j=2,3,4). (3.67)

    The proof is complete.

    In this section we introduce some numerical examples to illustrate our main results. For simplicity, we suppose that S={1,2}. Then system (1.6) is a hybrid system of the following two subsystems:

    {dx1(t)=x1(t)[(r1(1)r11C10(t)D11(x1)(t)D12(x2)(t))dt+S1(t,1)],dx2(t)=x2(t)[(r2(1)r22C20(t)+D21(x1)(t)D22(x2)(t)D23(x3)(t))dt+S2(t,1)],dx3(t)=x3(t)[(r3(1)r33C30(t)+D32(x2)(t)D33(x3)(t)D34(x4)(t))dt+S3(t,1)],dx4(t)=x4(t)[(r4(1)r44C40(t)+D43(x3)(t)D44(x4)(t))dt+S4(t,1)],dCi0(t)=[0.1Ce(t)(0.1+0.1)Ci0(t)]dt,dCe(t)=0.5Ce(t)dt,}t12n,Δxi(t)=0,ΔCi0(t)=0,ΔCe(t)=0.6,t=12n,nN+(i=1,2,3,4), (4.1)

    and

    {dx1(t)=x1(t)[(r1(2)r11C10(t)D11(x1)(t)D12(x2)(t))dt+S1(t,2)],dx2(t)=x2(t)[(r2(2)r22C20(t)+D21(x1)(t)D22(x2)(t)D23(x3)(t))dt+S2(t,2)],dx3(t)=x3(t)[(r3(2)r33C30(t)+D32(x2)(t)D33(x3)(t)D34(x4)(t))dt+S3(t,2)],dx4(t)=x4(t)[(r4(2)r44C40(t)+D43(x3)(t)D44(x4)(t))dt+S4(t,2)],dCi0(t)=[0.1Ce(t)(0.1+0.1)Ci0(t)]dt,dCe(t)=0.5Ce(t)dt,}t12n,Δxi(t)=0,ΔCi0(t)=0,ΔCe(t)=0.6,t=12n,nN+(i=1,2,3,4), (4.2)

    with initial conditions x1(θ)=2eθ, x2(θ)=1.5eθ, x3(θ)=0.8eθ x4(θ)=0.5eθ and θ[ln2,0].

    Let rii=0.3, τji=ln2, μji(θ)=μjieθ, γj(μ,i)=γj(i) and λ(Z)=1, see Table 4. Denote

    Param(i)=(a11a1200μ11μ1200σ1(i)γ1(i)a21a22a230μ21μ22μ230σ2(i)γ2(i)0a32a33a340μ32μ33μ34σ3(i)γ3(i)00a43a4400μ43μ44σ4(i)γ4(i)).
    Table 4.  Source of some parameter values in system (1.6).
    Parameter Value Source
    ki 0.1 [55]
    gi 0.1 [55]
    mi 0.1 [55]
    h 0.5 [55]
    γ 12 [55]
    b 0.6 [55]
    τji ln2 [56]
    λ(Z) 1 [56]

     | Show Table
    DownLoad: CSV

    Then system (1.6) may be regarded as the result of regime switching between subsystems (4.1) and (4.2) with the following estimated parameters, respectively,

    Param(1)=(0.20.1000.20.1000.10.10.50.30.100.20.10.100.10.100.40.30.200.20.20.20.10.1000.40.3000.10.20.10.1),
    Param(2)=(0.20.1000.20.1001.20.20.50.30.100.20.10.100.20.200.40.30.200.20.20.20.20.2000.40.3000.10.20.20.2).

    Compute |Δ|=0.066525, |Ξ|=0.1005 and |A|=0.195. Denote

    γ(1)=(γ1(1),γ2(1),γ3(1),γ4(1)),r(j)=(r1(j),r2(j),r3(j),r4(j))(j=1,2).

    Let r(1)=(0.9,0.5,0.3,0.2). Compute

    |Δ1|=0.1384,|Δ2|=0.1113,|Δ3|=0.0614,|Δ4|=0.0317>0.

    Based on Theorem 2, all species in subsystem (4.1) are persistent in mean and

    {limt+t1t0x1(s)ds=|Δ1||Δ|=2.0811a.s.limt+t1t0x2(s)ds=|Δ2||Δ|=1.6731a.s.limt+t1t0x3(s)ds=|Δ3||Δ|=0.9226a.s.limt+t1t0x4(s)ds=|Δ4||Δ|=0.4762a.s. (4.3)

    Let r(2)=(0.6,0.3,0.2,0.1). Then B1=0.1527<0. From Theorem 2, all species in subsystem (4.2) are extinctive.

    Case1: (π1,π2)=(0.8,0.2). Compute

    |Δ1|=0.1096,|Δ2|=0.0779,|Δ3|=0.0390,|Δ4|=0.0090>0.

    By Theorem 2, all species in system (1.6) are persistent in mean and

    {limt+t1t0x1(s)ds=|Δ1||Δ|=1.6469a.s.limt+t1t0x2(s)ds=|Δ2||Δ|=1.1709a.s.limt+t1t0x3(s)ds=|Δ3||Δ|=0.5870a.s.limt+t1t0x4(s)ds=|Δ4||Δ|=0.1346a.s. (4.4)

    Case2: (π1,π2)=(0.6,0.4). Compute

    |Δ4|=0.0138<0,|Ξ1|=0.1205,|Ξ2|=0.0700,|Ξ3|=0.0132>0.

    From Theorem 2, x1(t), x2(t) and x3(t) are persistent in mean, while x4(t) is extinctive and

    {limt+t1t0x1(s)ds=|Ξ1||Ξ|=1.1988a.s.limt+t1t0x2(s)ds=|Ξ2||Ξ|=0.6965a.s.limt+t1t0x3(s)ds=|Ξ3||Ξ|=0.1309a.s. (4.5)

    Case3: (π1,π2)=(0.5,0.5). Compute

    |Ξ3|=0.0137<0,|A1|=0.1923,|A2|=0.0852>0.

    Thanks to Theorem 2, x1(t) and x2(t) are persistent in mean, while x3(t) and x4(t) are extinctive and

    {limt+t1t0x1(s)ds=|A1||A|=0.9860a.s.limt+t1t0x2(s)ds=|A2||A|=0.4368a.s. (4.6)

    Case4: (π1,π2)=(0.3,0.7). Compute

    |A2|=0.0279<0,B1=0.1557>0.

    Based on Theorem 2, x1(t) is persistent in mean, while x2(t), x3(t) and x4(t) are extinctive and

    limt+t1t0x1(s)ds=B1A11=0.5191a.s. (4.7)

    Case5: (π1,π2)=(0.1,0.9). Compute B1=0.0499<0. On the basis of Theorem 2, all species in system (1.6) are extinctive.

    Let r(1)=(0.7,0.5,0.3,0.2). We study the effects of Lévy jumps on the persistence in mean and extinction of system (4.1) by changing the values of γj(1) and setting the remaining parameters of the examples to be the same as those in system (4.1). Denote I4={0.3,0.4}, α4I4; I3={0.6,1.1}, α3I3; I2={0.9,1.9}, α2I2; I1={0.8,1.7}, α1I1.

    Case1: Let γ(1)=(0.1,0.1,0.1,α4). Then |Δ4|<0, |Ξ3|=0.0606>0. According to Theorem 2, x1(t), x2(t) and x3(t) are persistent in mean, while x4(t) is extinctive.

    Let γ(1)=(0.1,0.1,0.1,0.1). Then |Δ4|=0.0047>0. By Theorem 2, all species in system (4.1) are persistent in mean. See Table 5.

    Table 5.  Changes of γ4(1) when γ1(1)=γ2(1)=γ3(1)=0.1.
    γ1(1) γ2(1) γ3(1) γ4(1) ¯xT()
    0.1 0.1 0.1 α4 (1.6852,1.1316,0.6027,0)
    0.1 0.1 0.1 0.1 (1.6805,1.1410,0.5618,0.0703)

     | Show Table
    DownLoad: CSV

    Case2: Let γ(1)=(0.1,0.1,α3,α4). Then |Ξ3|<0, |A2|=0.2478>0. Based on Theorem 2, x1(t) and x2(t) are persistent in mean, while x3(t) and x4(t) are extinctive. See Table 6.

    Table 6.  Changes of γ3(1) when γ1(1)=γ2(1)=0.1 and γ4(1)I4.
    γ1(1) γ2(1) γ3(1) γ4(1) ¯xT()
    0.1 0.1 α3 I4 (1.6157,1.2707,0,0)
    0.1 0.1 0.1 I4 (1.6852,1.1316,0.6027,0)

     | Show Table
    DownLoad: CSV

    Case3: Let γ(1)=(0.1,α2,α3,α4). Then |A2|<0, B1=0.6753>0. From Theorem 2, x1(t) is persistent in mean, while x2(t), x3(t) and x4(t) are extinctive. See Table 7.

    Table 7.  Changes of γ2(1) when γ1(1)=0.1, γ3(1)I3 and γ4(1)I4.
    γ1(1) γ2(1) γ3(1) γ4(1) ¯xT()
    0.1 α2 I3 I4 (2.2510,0,0,0)
    0.1 0.1 I3 I4 (1.6157,1.2707,0,0)

     | Show Table
    DownLoad: CSV

    Case4: Let γ(1)=(α1,α2,α3,α4). Then B1<0. Thanks to Theorem 2, all species are extinctive. See Table 8.

    Table 8.  Changes of γ1(1) when γ2(1)I2, γ3(1)I3 and γ4(1)I4.
    γ1(1) γ2(1) γ3(1) γ4(1) ¯xT()
    α1 I2 I3 I4 (0,0,0,0)
    0.1 I2 I3 I4 (2.2510,0,0,0)

     | Show Table
    DownLoad: CSV

    Case1: Let γ1(1)=0.8. Then B1=0.1294<0. According to Theorem 2, all species in system (4.1) are extinctive.

    Let γ1(1)=0.7. Then |A2|=0.0518<0, B1=0.1760>0. By Theorem 2, x1(t) is persistent in mean, while x2(t), x3(t) and x4(t) are extinctive and

    limt+t1t0x1(s)ds=B1A11=0.5868a.s. (4.8)

    Let γ1(1)=0.6. Then |Ξ3|=0.0329<0, |A2|=0.0608>0. Based on Theorem 2, x1(t) and x2(t) are persistent in mean, while x3(t) and x4(t) are extinctive and

    {limt+t1t0x1(s)ds=|A1||A|=1.0564a.s.limt+t1t0x2(s)ds=|A2||A|=0.3119a.s. (4.9)

    Let γ1(1)=0.3. Then |Δ4|=0.0023<0, |Ξ3|=0.0450>0. In view of Theorem 2, x1(t), x2(t) and x3(t) are persistent in mean, while x4(t) is extinctive and

    {limt+t1t0x1(s)ds=|Ξ1||Ξ|=1.5740a.s.limt+t1t0x2(s)ds=|Ξ2||Ξ|=1.0074a.s.limt+t1t0x3(s)ds=|Ξ3||Ξ|=0.4476a.s. (4.10)

    Let γ1(1)=0.1. Then |Δ4|=0.0046>0. From Theorem 2, all species are persistent in mean and

    {limt+t1t0x1(s)ds=|Δ1||Δ|=1.6792a.s.limt+t1t0x2(s)ds=|Δ2||Δ|=1.1392a.s.limt+t1t0x3(s)ds=|Δ3||Δ|=0.5606a.s.limt+t1t0x4(s)ds=|Δ4||Δ|=0.0690a.s. (4.11)

    Case2: Let γ1(1)=0.2. Then |Δ4|=0.0029>0. Thanks to Theorem 2, all species are persistent in mean and

    {limt+t1t0x1(s)ds=|Δ1||Δ|=1.6545a.s.limt+t1t0x2(s)ds=|Δ2||Δ|=1.1065a.s.limt+t1t0x3(s)ds=|Δ3||Δ|=0.5384a.s.limt+t1t0x4(s)ds=|Δ4||Δ|=0.0440a.s. (4.12)

    Let γ1(1)=0.6. Then |Δ4|=0.0122<0, |Ξ3|=0.0230>0. On the basis of Theorem 2, x1(t), x2(t) and x3(t) are persistent in mean, while x4(t) is extinctive and

    {limt+t1t0x1(s)ds=|Ξ1||Ξ|=1.4172a.s.limt+t1t0x2(s)ds=|Ξ2||Ξ|=0.8323a.s.limt+t1t0x3(s)ds=|Ξ3||Ξ|=0.2287a.s. (4.13)

    Let γ1(1)=0.9. Then |Ξ3|=0.0155<0, |A2|=0.0957>0. By Theorem 2, x1(t) and x2(t) are persistent in mean, while x3(t) and x4(t) are extinctive and

    {limt+t1t0x1(s)ds=|A1||A|=1.1608a.s.limt+t1t0x2(s)ds=|A2||A|=0.4908a.s. (4.14)

    Let γ1(1)=1.3. Then |A2|=0.0297<0, B1=0.2129>0. From Theorem 2, x1(t) is persistent in mean, while x2(t), x3(t) and x4(t) are extinctive and

    limt+t1t0x1(s)ds=B1A11=0.7097a.s. (4.15)

    Let γ1(1)=1.7. Then B1=0.0267<0. In view of Theorem 2, all species are extinctive.

    This paper concerns the dynamics of a stochastic hybrid delay food chain model with jumps in an impulsive polluted environment. Theorem 2 establishes sufficient and necessary conditions for persistence in mean and extinction of each species. Our results reveal that the stochastic dynamics of the system is closely correlated with both time delays and environmental noises.

    Some interesting topics deserve further investigation, for instance, it is meaningful to consider the optimal harvesting problem of the stochastic hybrid delay food chain model with Lévy noises in an impulsive polluted environment. One may also propose some more realistic systems, such as considering the generalized functional response and the influences of impulsive perturbations. We will leave investigation of these problems to the future.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    This work is supported by National Natural Science Foundation of China (No. 11901166).

    The authors declare that there are no conflicts of interest.



    [1] H. Suzuki, Junkosha Co Ltd., Printed Circuit Board, US 4640866, March 16, 1987.
    [2] H. Matsubara, M. Itai, K. Kimura, NGK Spark Plug Co Ltd., Printed Circuit Board, US 6573458, September 12, 2003.
    [3] J. A. Magera, G. J. Dunn, The Printed Circuit Designer's Guide to Flex and Rigid-Flex Fundamentals, Motorola Solutions Inc., Printed Circuit Board, US 7459202, August 21, 2008.
    [4] H. S. Cho, J. G. Yoo, J. S. Kim, S. H. Kim, Official Gazette of the United states patent and trademark, Samsung Electro Mechanics Co Ltd., Printed Circuit Board, US 8159824, 2012.
    [5] A. P. S. Chauhan, S. C. Bhardwaj, Detection of bare PCB defects by image subtraction method using machine vision, in Proceedings of the World Congress on Engineering, 2 (2011), 6-8.
    [6] N. K. Khalid, Z. Ibrahim, An Image Processing Approach towards Classification of Defects on Printed Circuit Board, PhD thesis, University Technology Malaysia, Johor, Malaysia, 2007.
    [7] Y. Bengio, A. Courville, P. Vincent, Representation learning: A review and new perspectives, IEEE Trans. Pattern Anal. Mach. Intell., 35 (2013), 1798-828. doi: 10.1109/TPAMI.2013.50
    [8] P. S. Malge, PCB defect detection, classification and localization using mathematical morphology and image processing tools, Int. J. Comput. Appl., 87 (2014), 40-45.
    [9] Y. Takada, T. Shiina, H. Usami, Y. Iwahori, Defect detection and classification of electronic circuit boards using keypoint extraction and CNN features, in The Ninth International Conferences on Pervasive Patterns and Applications Defect, 100 (2017), 113-116.
    [10] D. B. Anitha, R. Mahesh, A survey on defect detection in bare PCB and assembled PCB using image processing techniques, in 2017 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET), (2017), 39-43.
    [11] A. J. Crispin, V. Rankov, Automated inspection of PCB components using a genetic algorithm template-matching approach, Int. J. Adv. Manuf. Technol., 35 (2007), 293-300. doi: 10.1007/s00170-006-0730-0
    [12] F. Raihan, W. Ce, PCB defect detection USING OPENCV with image subtraction method, in 2017 International Conference on Information Management and Technology (ICIMTech), (2017), 204-209.
    [13] I. B. Basyigit, A. Genc, H. Dogan, F. A. Senel, S. Helhel, Deep learning for both broadband prediction of the radiated emission from heatsinks and heatsink optimization, Eng. Sci. Technol. Int. J., 24 (2021), 706-714.
    [14] S. Metlek, K. Kayaalp, I. B. Basyigit, A. Genc, H. Doğan, The dielectric properties prediction of the vegetation depending on the moisture content using the deep neural network model, Int. J. RF Microwave Comput.-Aided Eng., 31 (2020), e22496.
    [15] H. Hosseini, B. Xiao, M. Jaiswal, R. Poovendran, On the limitation of convolutional neural networks in recognizing negative images, in 2017 16th IEEE International Conference on Machine Learning and Applications (ICMLA), (2017), 352-358.
    [16] X. Tao, Z. Wang, Z. Zhang, D. Zhang, D. Xu, X. Gong, et al., Wire defect recognition of spring-wire socket using multitask convolutional neural networks, IEEE Trans. Compon. Package. Manuf. Technol., 8 (2018), 689-698. doi: 10.1109/TCPMT.2018.2794540
    [17] J. R. R. Uijlings, K. E. A. Van De Sande, T. Gevers, A. W. M. Smeulders, Selective search for object recognition, Int. J. Comput. Vision, 104 (2012), 154-171.
    [18] R. Girshick, J. Donahue, T. Darrell, J. Malik, Rich feature hierarchies for accurate object detection and semantic segmentation, in Proceedings of the 2014 IEEE Conference on Computer Vision and Pattern Recognition, (2014), 580-587.
    [19] K. He, X. Zhang, S. Ren, J. Sun, Deep residual learning for image recognition, preprint, arXiv: 1512.03385.
    [20] K. Simonyan, A. Zisserman, Very deep convolutional networks for large-scale image recognition, preprint, arXiv: 1409.1556.
    [21] C. Szegedy, S. Ioffe, V. Vanhoucke, Inception-v4, inception-resnet and the impact of residual connections on learning, preprint, arXiv: 1602.07261.
    [22] C. Szegedy, W. Liu, Y. Jia, P. Sermanet, S. Reed, D. Anguelov, et al., Going deeper with convolutions, preprint, arXiv: 1409.4842.
    [23] N. Suda, V. Chandra, G. Dasika, A. Mohanty, Y. Ma, S. Vrudhula, et al., Throughput-optimized OpenCL-based FPGA accelerator for large-scale convolutional neural networks, in Proceedings of the 2016 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, (2016), 16-25.
    [24] J. Zhang, J. Li, Improving the performance of OpenCL-based FPGA accelerator for convolutional neural network, in Proceedings of the 2017 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, (2017), 25-34.
    [25] D. Wang, J. An, K. Xu, PipeCNN: An OpenCL-based FPGA accelerator for large-scale convolution neuron networks, preprint, arXiv: 1611.02450.
    [26] J. Cong, B. Xiao, Minimizing computation in convolutional neural networks, in International conference on artificial neural networks, Springer, Cham, (2014), 281-290.
    [27] V. A. Adibhatla, H. C. Chih, C. C. Hsu, J. Cheng, M. F. Abbod, J. S. Shieh, Defect detection in printed circuit boards using you-only-look-once convolutional neural networks, Electronics, 9 (2020), 1547. doi: 10.3390/electronics9091547
    [28] M. Pritt, G. Chern, Satellite image classification with deep learning, in 2017 IEEE Applied Imagery Pattern Recognition Workshop (AIPR), (2017), 1-7.
    [29] X. S. Zhang, R. J. Roy, E. W. Jensen, EEG complexity as a measure of depth of anesthesia for patients, IEEE Trans. Biomed. Eng., 48 (2001), 1424-1433. doi: 10.1109/10.966601
    [30] V. Lalitha, C. Eswaran, Automated detection of anesthetic depth levels using chaotic features with artificial neural networks, J. Med. Syst., 31 (2007), 445-452. doi: 10.1007/s10916-007-9083-y
    [31] M. Peker, B. Sen, H. Gürüler, Rapid automated classification of anesthetic depth levels using GPU based parallelization of neural networks, J. Med. Syst., 39 (2015), 1-11.
    [32] P. L. Callet, C. Viard-Gaudin, D. Barba, A convolutional neural network approach for objective video quality assessment, IEEE Trans. Neural Networks, 17 (2006), 1316-1327. doi: 10.1109/TNN.2006.879766
    [33] D. C. Cireşan, U. Meier, L. M. Gambardella, J. Schmidhuber, Convolutional neural network committees for handwritten character classification, in Proceedings of the 2011 International Conference on Document Analysis and Recognition, (2011), 1135-1139.
    [34] N. Kalchbrenner, E. Grefenstette, P. Blunsom, A convolutional neural network for modelling sentences, preprint, arXiv: 1404.2188.
    [35] A. Devarakonda, M. Naumov, M. Garland, Adabatch: Adaptive batch sizes for training deep neural networks, preprint, arXiv: 1712.02029.
    [36] T. Y. Lin, P. Goyal, R. Girshick, K. He, P. Dollár, Focal loss for dense object detection, in Proceedings of the IEEE international conference on computer vision, (2017), 2980-2988.
    [37] L. Shao, F. Zhu, X. Li, Transfer learning for visual categorization: A survey, IEEE Trans. Neural Netw. Learn. Syst., 26 (2015), 1019-1034. doi: 10.1109/TNNLS.2014.2330900
  • Reader Comments
  • © 2021 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(12102) PDF downloads(1684) Cited by(69)

Figures and Tables

Figures(9)  /  Tables(8)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog