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

Achieving better connections between deposited lines in additive manufacturing via machine learning

  • Additive manufacturing is becoming increasingly popular because of its unique advantages, especially fused deposition modelling (FDM) which has been widely used due to its simplicity and comparatively low price. All the process parameters of FDM can be changed to achieve different goals. For example, lower print speed may lead to higher strength of the fabricated parts. While changing these parameters (e.g. print speed, layer height, filament extrusion speed and path distance in a layer), the connection between paths (lines) in a layer will be changed. To achieve the best connection among paths in a real printing process, how these parameters may result in what kind of connection should be studied. In this paper, a machine learning (deep neural network) model is proposed to predict the connection between paths in different process parameters. Four hundred experiments were conducted on an FDM machine to obtain the corresponding connection status data. Among them, there are 280 groups of data that were used to train the machine learning model, while the rest 120 groups of data were used for testing. The results show that this machine learning model can predict the connection status with the accuracy of around 83%. In the future, this model can be used to select the best process parameters in additive manufacturing processes with corresponding objectives.

    Citation: Jingchao Jiang, Chunling Yu, Xun Xu, Yongsheng Ma, Jikai Liu. Achieving better connections between deposited lines in additive manufacturing via machine learning[J]. Mathematical Biosciences and Engineering, 2020, 17(4): 3382-3394. doi: 10.3934/mbe.2020191

    Related Papers:

    [1] Yijun Lou, Li Liu, Daozhou Gao . Modeling co-infection of Ixodes tick-borne pathogens. Mathematical Biosciences and Engineering, 2017, 14(5&6): 1301-1316. doi: 10.3934/mbe.2017067
    [2] Marco Tosato, Xue Zhang, Jianhong Wu . A patchy model for tick population dynamics with patch-specific developmental delays. Mathematical Biosciences and Engineering, 2022, 19(5): 5329-5360. doi: 10.3934/mbe.2022250
    [3] Guo Lin, Shuxia Pan, Xiang-Ping Yan . Spreading speeds of epidemic models with nonlocal delays. Mathematical Biosciences and Engineering, 2019, 16(6): 7562-7588. doi: 10.3934/mbe.2019380
    [4] Ardak Kashkynbayev, Daiana Koptleuova . Global dynamics of tick-borne diseases. Mathematical Biosciences and Engineering, 2020, 17(4): 4064-4079. doi: 10.3934/mbe.2020225
    [5] Holly Gaff . Preliminary analysis of an agent-based model for a tick-borne disease. Mathematical Biosciences and Engineering, 2011, 8(2): 463-473. doi: 10.3934/mbe.2011.8.463
    [6] Holly Gaff, Robyn Nadolny . Identifying requirements for the invasion of a tick species and tick-borne pathogen through TICKSIM. Mathematical Biosciences and Engineering, 2013, 10(3): 625-635. doi: 10.3934/mbe.2013.10.625
    [7] Maeve L. McCarthy, Dorothy I. Wallace . Optimal control of a tick population with a view to control of Rocky Mountain Spotted Fever. Mathematical Biosciences and Engineering, 2023, 20(10): 18916-18938. doi: 10.3934/mbe.2023837
    [8] Pengfei Liu, Yantao Luo, Zhidong Teng . Role of media coverage in a SVEIR-I epidemic model with nonlinear incidence and spatial heterogeneous environment. Mathematical Biosciences and Engineering, 2023, 20(9): 15641-15671. doi: 10.3934/mbe.2023698
    [9] Chang-Yuan Cheng, Shyan-Shiou Chen, Xingfu Zou . On an age structured population model with density-dependent dispersals between two patches. Mathematical Biosciences and Engineering, 2019, 16(5): 4976-4998. doi: 10.3934/mbe.2019251
    [10] Yongli Cai, Yun Kang, Weiming Wang . Global stability of the steady states of an epidemic model incorporating intervention strategies. Mathematical Biosciences and Engineering, 2017, 14(5&6): 1071-1089. doi: 10.3934/mbe.2017056
  • Additive manufacturing is becoming increasingly popular because of its unique advantages, especially fused deposition modelling (FDM) which has been widely used due to its simplicity and comparatively low price. All the process parameters of FDM can be changed to achieve different goals. For example, lower print speed may lead to higher strength of the fabricated parts. While changing these parameters (e.g. print speed, layer height, filament extrusion speed and path distance in a layer), the connection between paths (lines) in a layer will be changed. To achieve the best connection among paths in a real printing process, how these parameters may result in what kind of connection should be studied. In this paper, a machine learning (deep neural network) model is proposed to predict the connection between paths in different process parameters. Four hundred experiments were conducted on an FDM machine to obtain the corresponding connection status data. Among them, there are 280 groups of data that were used to train the machine learning model, while the rest 120 groups of data were used for testing. The results show that this machine learning model can predict the connection status with the accuracy of around 83%. In the future, this model can be used to select the best process parameters in additive manufacturing processes with corresponding objectives.



    1. Introduction

    Lyme disease accounts for over 90% of all reported vector-borne disease in the United States. Its current invasive spread in the eastern U.S. constitutes a major public health concern [1,6]. In the eastern United States, Lyme disease is caused by the bacterium Borrelia burgdorferi, with the blacklegged tick Ixodes scapularis serving as the principal vector. B. burgdorferi-infected I. scapularis are found at highest densities in endemic foci in the Northeast and upper Midwestern United States. However, increasing incidence of human cases is related, in part, to the ongoing geographical spread of ticks into new areas such as Michigan, Indiana, Ohio and Virginia (Hahn et. al. [9]).

    Ticks are capable of moving only very short distances independently, so their fast and large scale spatial spread cannot be attributed solely to their own mobility. Rather, large-scale changes in tick distribution arise as a consequence of the movement of ticks by the vertebrate hosts to which they attach while feeding (see, e.g., [4,5,10,15]). Among such hosts are, in the order of the distances they can move, white-footed mice Peromyscus leucopus, white-tailed deer Odocoileus virginianus, and some migratory birds. Mice can be infected by this bacterium and therefore can transmit the pathogen, and can also transport the tick nymphs. In [4], a reaction diffusion system is proposed to model the advance of the natural infection cycle mediated by the white-footed mouse. Although white-tailed deer diffusion is also mentioned in the model, since the deer cannot be infected and accordingly do not transmit the bacterium the focus of [4] is on the transmission dynamics, the role of deer diffusion in the spatial spread of the pathogen is not discussed in detail in [4]. In relation to birds, in addition to the works [3,18], there have been some works that quantitatively model the role of bird migration in the tick's range expansion, see, e.g., [23].

    This paper focuses on the role of white-tailed deer in spreading the ticks. Over the past 50 years, white-tailed deer populations have undergone explosive population growth due to reversion of agricultural lands to forest and restrictions on hunting. This expanding deer population is believed to have facilitated blacklegged tick expansion throughout the Northeast and Midwest [2]. To understand this, we first point out an important difference between birds and deer in transporting I. scapularis and B. burgdorferi. On the one hand, birds carrying the infected immature stages of the tick are capable of traveling longer distances than deer. On the other hand, if immature ticks dropping from birds are to establish a new population they must survive one or two moults and then find a mate, which will be unlikely if they are dropped far from existing populations. In contrast, during fall deer will be carrying numerous already-mated female ticks, each of which becomes engorged with blood while on the deer and then falls to the ground ready to lay approximately 2000 eggs that can form the basis of a new tick population at that location. This observation seems to suggest that deer play a more important role in the tick's range expansion in regions inhabited by white-tailed deer.

    In this study we use a spatial model to quantitatively investigate the role of white-tailed deer dispersal in the spatial spread of I. scapularis (and hence B. burgdorferi). Our model combines age structure with the dispersal of deer leading to a system with two time delays and spatial nonlocality resulting from the dispersal of the deer when the adult ticks are attached to them enjoying blood meals. We will begin, in the next section, with a detailed derivation of the model.


    2. Model formulation

    To assess the rate at which deer can transport blacklegged ticks into new areas, we develop a differential equation model with spatial effects that describes the stage-structured tick population and its transport by deer. Blacklegged ticks typically undergo a 2-year life cycle in which the larvae quest for a host (typically a small mammal or bird), and if successful feed for several days, drop back to the ground, and later moult into a nymph. The nymph then quests, feeds and moults -again typically on a small mammal. The final adult life stage (which is male or female) then quests and feeds (typically on a deer), falls to the ground when fully engorged and then produces approximately 2000 eggs that hatch into the next generation of larvae.

    The mouse population (which feeds the immature ticks) and the deer population (which feeds the adult ticks) are assumed to be homogeneous and constant over time in both the tick-infested and tick-free regions. Mouse home ranges are much smaller than those of deer, so the only significant movement of ticks is by deer transporting adult females while they feed. Because of this, and for simplicity, we assume that larvae and nymphs do not disperse. Since the average time a tick spends attached to a deer is around one week, the relevant deer movements are assumed to be those undertaken in the course of each deer's normal home range activity, rather than long-distance directional movements associated with natal dispersal or seasonal migration.

    Consider a spatial domain ΩRn, which at this point could be either finite or infinite. Let L(x,t) and N(x,t) be the population densities of larvae and nymphs at time t, location xΩ. Denote by Aq(x,t) and Af(x,t) the populations of questing adults and female fed adults respectively. Taking into account the above assumptions and scenarios, we propose the following mathematical model for t0, xΩ:

    {L(x,t)t=br4ed4τ1Af(x,tτ1)d1L(x,t)r1L(x,t),N(x,t)t=r1g(L(x,t))d2N(x,t)r2N(x,t),Aq(x,t)t=r2N(x,t)d3Aq(x,t)r3Aq(x,t),Af(x,t)t=r32Ωk(x,y)ed3τ2Aq(y,tτ2)dyr4Af(x,t)d4Af(x,t), (1)

    where the parameters are defined in Table 1. The table also gives the values of the parameters for the stage-structured components of the model which were all, except for τ1, used in the non-spatial model for Ixodes scapularis life cycles in [7] which were adopted from the earlier work [17]. In [17], τ1 was taken as the time delay for pre-oviposition and was determined by 1300×c1.42 where c is the temperature in celsius, and hence, when c varies between 15o and 30o, τ1 will be between 27.80 and 10.40 days. For simulation convenience, we take τ1=20 days in this paper. In [7], τ1 was given the range of 20-200 days.

    Table 1. Explanation of parameters.
    Parameters Meaning Value
    b Birth rate of tick 3000
    1/r1 average time that a questing larvae needs to feed and moult 1/0.13
    1/r2 average time that a questing nymph needs to feed and moult 1/0.13
    1/r3 average time that a questing adult needs to successfully attach to a deer 1/0.03
    r4 Proportion of fed adults that can lay eggs 0.03
    d1 per-capita death rate of larvae 0.3
    d2 per-capita death rate of nymphs 0.3
    d3 per-capita death rate of questing adults 0.1
    d4 per-capita death rate of fed adults 0.1
    τ1 average time between last blood feeding and hatch of laid eggs 20 days
    τ2 average time tick is attached to a deer 10 days
     | Show Table
    DownLoad: CSV

    The structure of system (1) can be visualized with the help of the diagram in Fig. 1.

    Figure 1. The life-stage components of the model: questing larvae (L) find a host, feed and moult into questing nymphs (N), which then find a new host, feed and moult into questing adults (Aq). Adult females that find a deer host (Af) feed, drop to the forest floor, lay 2000 eggs and then die. Hatching eggs create the next generation of questing larvae. The r parameters are the per-capita transition rates between each compartment.

    A very important aspect of model (1) is the term with the integral, which models the transport of adult ticks by deer. Note that Aq and Af are respectively the numbers of questing adults and female adults that are already fed and are no longer attached to deer. There is no variable in system (1) representing the actual number of adult ticks that are attached to the deer. Such a variable is unnecessary in system (1), since it is already a closed system determining the variables L, N, Aq and Af. However, a variable representing the ticks attached to deer is useful for explaining the derivation of the integral term in (1), which is the rate at which female adults drop off the deer after feeding. Next, we present a detailed derivation of that integral term. We let udeer(x,t,a), where xΩRn is a vector if n2, be the population density of ticks that are attached to deer. Here a is an age variable representing age since attaching to a deer (not age since the tick's birth). We assume that udeer(x,t,a) satisfies the standard McKendrick-von Foerster equation for an age-structured population:

    (t+a)udeer(x,t,a)=d3udeer(x,t,a)+D2udeer(x,t,a),forxΩ,a(0,τ2),t>0, (2)

    where D>0 is the diffusion coefficient of the deer, since the ticks under discussion are attached to deer. The population of ticks attached to deer at (x,t) is Adeer(x,t), given by

    Adeer(x,t)=τ20udeer(x,t,a)da. (3)

    Differentiating (3) and using (2) gives

    Adeer(x,t)t=udeer(x,t,0)udeer(x,t,τ2)d3Adeer(x,t)+D2Adeer(x,t). (4)

    The rate at which ticks drop off the deer after feeding is udeer(x,t,τ2), and we shall show that this term equals the integral term in the fourth equation of (1). To aid in the calculation of udeer(x,t,τ2), define

    uξdeer(x,a)=udeer(x,a+ξ,a)ed3a. (5)

    Differentiating with respect to a, and using (2),

    uξdeer(x,a)a=D2uξdeer(x,a),xΩ.

    This is the heat equation, and its solution can be expressed in the form

    uξdeer(x,a)=ΩK(x,y,a)uξdeer(y,0)dy (6)

    where the Green's function K(x,y,a), a non-negative function, satisfies

    K(x,y,a)a=D2xK(x,y,a),K(x,y,0)=δ(xy) (7)

    and the boundary conditions to which the deer are subjected at Ω. Here, δ is the Dirac delta function and 2x is the Laplacian operator computed with respect to the first argument xΩ of K(x,y,a), with y treated as constant (recall x and y are vectors unless Ω is a one-dimensional domain). Using (5) and (6), and setting a=τ2, ξ=tτ2,

    udeer(x,t,τ2)=ed3τ2ΩK(x,y,τ2)udeer(y,tτ2,0)dy.

    But udeer(x,t,0) is the rate at which questing adults attach to deer. The term representing this is the last term in the third equation of (1), and therefore

    udeer(x,t,0)=r3Aq(x,t).

    Therefore

    udeer(x,t,τ2)=ed3τ2ΩK(x,y,τ2)r3Aq(y,tτ2)dy.

    After the insertion of a factor 12, since only the females will lay eggs, we complete the derivation of the integral term in the fourth equation of (1) with

    k(x,y)=K(x,y,τ2).

    The kernel k(x,y) accounts for the probability that a questing adult that attaches to a deer at location y will be engorged after τ2 time units and drop to the ground at location x. For some particular domains Ω and boundary conditions it is possible to solve (7) to find K(x,y,a), and hence k(x,y) in (1), explicitly. For example, if Ω=[0,l], with homogeneous Neumann (zero flux) boundary conditions, then Kx(0,y,a)=Kx(l,y,a)=0 and

    k(x,y)=K(x,y,τ2)=1l[1+n=1{cosnπl(xy)+cosnπl(x+y)}eD(nπ/l)2τ2].

    If Ω=[0,l], with homogeneous Dirichlet boundary conditions, then

    k(x,y)=1ln=1{cosnπl(xy)cosnπl(x+y)}eD(nπ/l)2τ2.

    We are interested mainly in the case when Ω=(,), which may provide a reasonable approximation for a long and narrow domain. For this case,

    k(x,y)=Γ(xy),whereΓ(z):=14Dτ2πez24Dτ2 (8)

    which was derived in [12,19].

    We point out that, just recently, starting from a version of the McKendrick-von Foerster equation without spatial effects but with temporal periodicity, Liu et al [14] also derived a periodic model with age structure for a tick population. A threshold dynamics result is obtained for the model in [14].

    To prevent the tick population from increasing to unrealistic levels, density dependence is incorporated into model (1) through a simple nonlinear relationship between questing larvae and questing nymphs. The biological basis for this relationship is that there should be an upper limit to the number of larvae that the mouse population is able to feed -an equivalent relationship was assumed in [21]. This leads us to propose the following expression for the function g(L) in (1):

    g(L)={NcapLcapLforL[0,Lcap],NcapforL[Lcap,). (9)

    The function g(L) in (9) is not differentiable at L=Lcap. For mathematical convenience, we adopt the following alternative:

    g(L)=Ncapk2Lk1+k2L=NcapLk1/k2+L=NcapLh+L, (10)

    which is smooth and yet captures the main features of the function given by (9). In the remainder of this paper, we always use (10) for g(L), with the parameter h adjusting g(0)=Ncap/h.

    For the majority of this paper we have in mind model (1) for x(,), with the nonlinear function given by (10) and the kernel k(x,y) by (8). In Section 3 we justify the well-posedness of the model by verifying the positivity and boundedness of all solution variables, identify the tick's basic reproduction number R0, addressing the stability of the extinction steady state and discussing the existence and stability of a positive constant steady state when R0>1. In Section 4 we focus on traveling wave front solutions that connect the extinction equilibrium with the positive equilibrium. The minimum wave speed of such traveling wave fronts is closely related to the spatial spread rate of the tick population and therefore is of great significance. By analyzing the characteristic equation of the linearization of the model at the extinction equilibrium, we find a critical value c which is proved to be a lower bound of the minimal wave speed in the sense that there is no traveling wave front with speed c<c. Dependence of c on the dispersion rate D and productive rate b is also numerically explored. In Section 5, guided by the results from Section 4, we numerically explore the existence of traveling wave fronts and investigate the spread rate. We present some simulation results which suggest that c is not only the minimum wave speed but also the spread rate for the tick population. Therefore, the dependence of c on the dispersion rate D, which is numerically explored in Section 4, may help evaluate the role of the white tailed deer in the geographical spread of the ticks. We conclude the paper with Section 6, in which we summarize the main results and discuss some possible future research projects related to this work. Since the model contains a spatial non-local term and two time delays, finding numerical solutions to the traveling wave equations is challenging. For the readers' convenience, we include an appendix summarizing the details of the numerical methods used.


    3. Analysis of the model


    3.1. Well-posedness

    Associated to (1) are the following biologically and mathematically meaningful initial conditions:

    {L(x,0),N(x,0)are continuous forxΩwithL(x,0)0,N(x,0)0;Aq(x,s)is continuous for(x,s)Ω×[τ2,0]withAq(x,s)0;Af(x,s)is continuous for(x,s)Ω×[τ1,0]withAf(x,s)0. (11)

    Using the method of steps, one can easily see that the initial value problem (1)-(11) has a unique solution for t[0,t) for some t>0. Furthermore, using the method of variation of parameters in (1), one obtains

    {L(x,t)=L(x,0)e(d1+r1)t+br4ed4τ1t0Af(x,sτ1)e(d1+r1)(st)ds,N(x,t)=N(x,0)e(d2+r2)t+r1Ncapt0L(x,s)h+L(x,s)e(d2+r2)(st)ds,Aq(x,t)=Aq(x,0)e(d3+r3)t+r2t0N(x,s)e(d3+r3)(st)ds,Af(x,t)=Af(x,0)e(d4+r4)t+r32ed3τ2t0Ωk(x,y)Aq(y,sτ2)e(d4+r4)(st)dyds. (12)

    Let τ=min{τ1,τ2}. By the initial condition (11), we have L(0,x)0, N(0,x)0, Aq(θ,x)0 for θ[τ2,0], and Af(θ,x)0 for θ[τ1,0]. Thus all the second terms on the right hand sides of the above equations are nonnegative for t(0,τ]. If L(0,x)>0, then from the first equation we have L(t,x)>0 for t[0,τ], and a recursive argument yields that L(t,x)>0 actually for all t>0. This will also consecutively lead to N(t,x)>0, Aq(t,x)>0 and Af(t,x)>0 for t>0. Moreover, we can see that the positivity of any one of the four components at t=0 is sufficient to ignite the positivity of all components of the corresponding solution for t>0.

    Next, we prove an important property of the kernel k(x,y) in (1).

    Proposition 1. If Ω=(,), or if ΩRn is finite and homogeneous Neumann boundary conditions are applied, then

    Ωk(x,y)dx=1,forallyΩ.

    If Ω is finite with homogeneous Dirichlet boundary conditions, then

    Ωk(x,y)dx<1,forallyΩ.

    Proof. When Ω=(,), the conclusion is a result of (8) and the property of normal distribution. Now assume ΩRn is bounded and consider the quantity ΩK(x,y,a)dx. Recall that K satisfies (7). In the case of homogeneous Neumann boundary conditions, xK(x,y,a)n=0 on Ω and therefore

    aΩK(x,y,a)dx=DΩ2xK(x,y,a)dx=DΩxK(x,y,a)ndS=0

    where n is the outward pointing unit normal to Ω and dS is a surface element. Hence, if yΩ,

    Ωk(x,y)dx=ΩK(x,y,τ2)dx=ΩK(x,y,0)dx=Ωδ(xy)dx=1.

    In the case of homogeneous Dirichlet boundary conditions we have K(x,y,a)=0 for xΩ, yet we know K(x,y,a)>0 inside Ω, for all a>0. Therefore xK(x,y,a)n0 on Ω in this case and so ΩK(x,y,a)dx decreases with a. Therefore, this time we have < replacing = in the middle element of the above, with the consequence that Ωk(x,y)dx<1. The proof is complete.

    Next, we show that the solution is bounded for xΩ and t[0,t). Firstly, applying the boundedness of g(L) to the second equation of (1), we obtain

    N(x,t)tr1Ncap(d2+r2)N(x,t).

    This implies that

    lim suptN(x,t)r1Ncapd2+r2,for allxΩ,

    proving boundedness of N(x,t). Applying the same argument to the other three equations of (1), in the order of NAqAfL, we conclude that L(x,t),Aq(x,t) and Af(x,t) are all bounded for xΩ and t[0,t).


    3.2. Extinction steady state and its stability

    Irrespective of the domain Ω or boundary conditions, system (1) always has the extinction steady state (trivial steady state) E0=(0,0,0,0). Linearizing (1) at E0 leads to

    {u1(x,t)t=br4ed4τ1u4(x,tτ1)(d1+r1)u1(x,t),u2(x,t)t=r1Ncaphu1(x,t)(d2+r2)u2(x,t),u3(x,t)t=r2u2(x,t)(d3+r3)u3(x,t),u4(x,t)t=r32Ωk(x,y)ed3τ2u3(y,tτ2)dy(d4+r4)u4(x,t). (13)

    Consider the case Ω=(,), or a bounded ΩRn with homogeneous Neumann boundary conditions. Tracking the average time and recruitment during each stage in (13), one obtains the basic reproduction number R0 of the model:

    R0=br4ed4τ1d1+r1(r1/h)Ncapd2+r2r2d3+r3(r3/2)ed3τ2d4+r4=Ncapb2he(d3τ2+d4τ1)4i=1ridi+ri. (14)

    From the biological interpretation of R0, we anticipate that E0 will be locally asymptotically stable if R0<1 and unstable if R0>1. We prove this by analyzing the linear stability of the extinction steady state of (13).

    Substituting the ansatz ui(x,t)=eλtψi(x) into (13), we obtain the following eigenvalue problem:

    {λψ1(x)=br4ed4τ1eλτ1ψ4(x)(d1+r1)ψ1(x),λψ2(x)=r1Ncaphψ1(x)(d2+r2)ψ2(x),λψ3(x)=r2ψ2(x)(d3+r3)ψ3(x),λψ4(x)=r32ed3τ2eλτ2Ωk(x,y)ψ3(y)dy(d4+r4)ψ4(x). (15)

    We shall show that the dominant eigenvalue λ of the linearised system is a real number. The sign of λ determines the stability of the extinction equilibrium E0: when λ<0, E0 is asymptotically stable; and when λ>0, E0 is unstable. If the domain Ω=(,), or if Ω is finite with homogeneous Neumann boundary conditions, then the sign of λ depends solely on the value of R0. The stability result for these cases can be formulated as follows.

    Proposition 2. If Ω=(,), or if ΩRn is finite and homogeneous Neumann boundary conditions are applied, then the extinction steady state E0=(0,0,0,0) of system (1) is locally asymptotically stable if R0<1 and unstable if R0>1, where R0 is given by (14).

    Proof. Let λC be any eigenvalue, with ψi, i=1,,4 as introduced above. The first equation of (15) gives

    ψ4(x)=λ+d1+r1br4ed4τ1eλτ1ψ1(x). (16)

    Similarly, from the second and third equations of (15),

    ψ1(x)=(λ+d2+r2)hr1Ncapψ2(x), (17)

    and

    ψ2(x)=λ+d3+r3r2ψ3(x). (18)

    The fourth equation of (15) then yields

    eλτ1eλτ2Ωk(x,y)ψ3(y)dy=2h(λ+d4+r4)(λ+d1+r1)(λ+d2+r2)(λ+d3+r3)bNcaped4τ1ed3τ2r1r2r3r4ψ3(x),=2h4i=1(λ+di+ri)bNcape(d3τ2+d4τ1)4i=1riψ3(x)

    so that

    eλτ1eλτ2Ωk(x,y)ψ3(y)dy=4i=1(λ+di+ri)R04i=1(di+ri)ψ3(x). (19)

    Integrating with respect to x over Ω, changing the order of the double integral that arises, and using the first statement of Proposition 1, we obtain the characteristic equation for λ to be

    f1(λ)=f2(λ) (20)

    where

    f1(x)=R0e(τ1+τ2)x4i=1(di+ri), (21)
    f2(x)=4i=1(x+di+ri). (22)

    Noting that f1(x) is deceasing with f1()= and f1()=0, and f2(x) is a W shaped function and is increasing after its largest root xm=min{di+ri;i=1,2,3,4}, we know that (20) has a unique real root λ on (xm,) and it is the dominant real root since f1(x)<f2(x) for x>λ. We claim that λ is indeed the dominant root (the root of greatest real part) of the characteristic equation (20). To this end, we let λ be any root in C and show that Reλλ. Indeed, taking the absolute value of (20) gives

    R0e(τ1+τ2)(Reλ)4i=1(di+ri)=4i=1|λ+di+ri|4i=1|Reλ+di+ri|,

    that is, f1(Reλ)f2(Reλ), implying that Reλλ. This claim means that the dominant root in C of the characteristic equation is precisely the dominant real root λ.

    Finally, by the aforementioned properties of f1(x) and f2(x), it is obvious that λ<0 when f1(0)<f2(0) (i.e. R0<1) and λ>0 when f1(0)>f2(0) (i.e. R0>1). Thus, all eigenvalues of (13) have negative real parts when R0<1, and there exists a real positive eigenvalue when R0>1. Now, by Theorems 2.16 and 2.17 in Thieme [20], we conclude the stability (under R0<1) and instability (under R0>1), completing the proof.

    Remark. The above argument fails in the case of homogeneous Dirichlet boundary conditions applied to a finite domain Ω, since in that case Ωk(x,y)dx is not equal to 1. However, we may still assert that if R0<1 the extinction steady state is locally asymptotically stable. The reason is that for the Dirichlet problem the second statement of Proposition 1 is applicable. Taking the absolute value of (19),

    4i=1|λ+di+ri|R04i=1(di+ri)|ψ3(x)|=e(Reλ)(τ1+τ2)|Ωk(x,y)ψ3(y)dy|e(Reλ)(τ1+τ2)Ωk(x,y)|ψ3(y)|dy.

    Integrating over xΩ and changing the order of integration, but this time using the second statement of Proposition 1, we obtain

    4i=1|Reλ+di+ri|R04i=1(di+ri)4i=1|λ+di+ri|R04i=1(di+ri)e(Reλ)(τ1+τ2)

    which implies that f2(Reλ)f1(Reλ) and therefore that Reλ belongs to an interval of values for which the graph of the quartic curve y=f2(x) lies below that of the exponential y=f1(x). However, in the situation when R0<1, such intervals include only negative real numbers and it follows that Reλ<0. The difference with the Dirichlet problem is that R0>1 does not necessarily imply that the dominant eigenvalue λ>0, although an argument can be made that we do have λ>0 when R0>1 if the domain Ω is sufficiently large. The reason is that as the domain increases in size without bound, Ωk(x,y)dx approaches 1. This can be shown using a scaling argument to be found in the proof of Proposition 5.1 of Gourley and Ruan [8]. In fact, if Ω is bounded and homogeneous Dirichlet boundary conditions are applied on Ω, R0 as defined in (14) is no longer the basic reproduction number, though it is still an important parameter relevant to the stability of the extinction steady state. For the Dirichlet problem the basic reproduction number is the right hand side of (14) multiplied by ˆK, where ˆK is the spectral radius of the linear operator F:X0X0 defined by

    (Fϕ)(x)=Ωk(x,y)ϕ(y)dy,xΩ (23)

    where X0={ϕC(Ω,R);ϕ|Ω=0}.


    3.3. Persistence steady state and its stability

    In the case Ω=(,), or ΩRn with homogeneous Neumann boundary conditions on Ω, we have seen from Subsection 3.2 that, when R0>1 (equivalently, λ>0), the extinction steady state E0 becomes unstable. In this case, straightforward calculations show that there exists a positive steady state E+=(L+,N+,A+q,A+f) given by

    L+=h(R01),N+=d3+r3r2A+q,A+q=d4+r4r32ed3τ2A+f,A+f=d1+r1br4ed4τ1L+.

    When this persistence (positive) steady state exists, it is locally asymptotically stable. The arguments are similar to those just described for studying the linear stability of the extinction steady state. Linearizing system (1) at E+=(L+,N+,A+q,A+f), we obtain

    {v1(x,t)t=br4ed4τ1v4(x,tτ1)(d1+r1)u1(x,t),v2(x,t)t=r1NcaphR20v1(x,t)(d2+r2)v2(x,t),v3(x,t)t=r2v2(x,t)(d3+r3)v3(x,t),v4(x,t)t=r32Ωk(x,y)ed3τ2v3(y,tτ2)dy(d4+r4)v4(x,t). (24)

    This linear system is the same as (13) except that h is replaced by ˆh=hR20. Thus, a composed parameter ˆR0 obtained by replacing h with hR20, that is ˆR0=1R20R0=1R0, determines the stability of E+: if R0>1 (i.e., ˆR0<1) then E+ is not only biologically meaningful but also locally asymptotically stable.


    4. Traveling wave solutions and the spreading speed

    In this section, we consider Ω=(,) and explore the existence of traveling wave solutions of (1), which are solutions of the form

    L(x,t)=φ1(x+ct),N(x,t)=φ2(x+ct),Aq(x,t)=φ3(x+ct),Af(x,t)=φ4(x+ct).

    Here, φ=(φ1,φ2,φ3,φ4)C2(R,R4) is called the profile of the traveling wave, s:=x+ct is the moving variable, and c>0 is the wave speed. Substituting this form of solution into system (1), we find that φ=(φ1,φ2,φ3,φ4) satisfies

    {cφ1(s)=br4ed4τ1φ4(scτ1)(d1+r1)φ1(s),cφ2(s)=r1g(φ1(s))(d2+r2)φ2(s),cφ3(s)=r2φ2(s)(d3+r3)φ3(s),cφ4(s)=r32+Γ(z)ed3τ2φ3(szcτ2)dz(d4+r4)φ4(s), (25)

    where Γ(y) is the Gaussian kernel given in Section 2. When R0>1, E0=(0,0,0,0) and E+=(φ+1,φ+2,φ+3,φ+4) are equilibria of (25), where φ+1=L+,φ+2=N+,φ+3=A+q and φ+4=A+f.

    We are interested in traveling wave fronts that connect E0 and E+, and therefore we apply the following asymptotic boundary conditions to (25):

    limsφi=0,lims+φi(s)=φ+i,i=1,2,3,4. (26)

    Linearizing system (25) at the trivial equilibrium E0 yields the following linear system:

    {cφ1(s)=br4ed4τ1φ4(scτ1)(d1+r1)φ1(s),cφ2(s)=r1Ncaphφ1(s)(d2+r2)φ2(s),cφ3(s)=r2φ2(s)(d3+r3)φ3(s),cφ4(s)=r32+Γ(z)ed3τ2φ3(szcτ2)dz(d4+r4)φ4(s). (27)

    The characteristic equation associated with (27) is

    P(λ,c)=0 (28)

    where

    P(λ,c)=|cλ+d1+r100br4ed4τ1ecτ1λr1Ncaphcλ+d2+r2000r2cλ+d3+r3000r32ed3τ2ecτ2λˉk(λ)cλ+d4+r4|,

    where

    ˉk(λ)=+Γ(y)eλydy=14Dτ2π+ey24Dτ2eλydy=eDτ2λ2.

    Evaluating the determinant on the left hand side of (28), we obtain

    4i=1[cλ+(di+ri)]r1r2r3r4bNcap2he(d4τ1+d3τ2)eDτ2λ2c(τ1+τ2)λ=0;

    that is

    4i=1[cλ+(di+ri)]R0[4i=1(di+ri)]eDτ2λ2c(τ1+τ2)λ=0. (29)

    Generically, the behaviour of solutions of (25)-(26) at is qualitatively reflected by the behaviour of solutions of (27) at . Note that, generically, only positive real roots of the characteristic equation (29) can lead to positive solutions of (1) that tend to 0 as s, because a negative real root of (29) corresponds to an unbounded solution and complex roots correspond to a solution that oscillates about 0 and therefore assumes negative values. Therefore, in order for (25)-(26) to have a positive solution (corresponding to a traveling wave front connecting E0 and E+), it is necessary that (29) should have at least one real positive root.

    Set

    H1(λ,c)=4i=1[cλ+(di+ri)],H2(λ,c)=R0[4i=1(di+ri)]eDτ2λ2c(τ1+τ2)λ.

    Then (29) can be rewritten as H1(λ,c)=H2(λ,c). From elementary calculus, one knows that H1(λ,c) is of W shape but is increasing for λ>0, and H2(λ,c) is of U shape with the minimum attained at a positive value of λ. It can be shown that there exists a c>0 such that, when c<c, H2(λ,c)>H1(λ,c) and (29) has no real positive roots; when c=c, (29) has one real positive root λ; and when c>c, (29) has two real positive roots λ2>λ1>0. Indeed c is given by

    c=minc>0{c:H1(λ,c)=H2(λ,c)haspositiverealrootswithrespecttoλ}

    and is determined by the tangential conditions:

    H1(λ,c)=H2(λ,c),andH1λ(λ,c)=H2λ(λ,c),λ>0. (30)

    There is no explicit formula for c, but c can be numerically computed for given values of the model parameters. To demonstrate this, we choose the baseline parameter values as: b=3000, r1=0.13, r2=0.13, r3=0.03, r4=0.03, d1=0.3, d2=0.3, d3=0.1, d4=0.1, τ1=20, τ2=10 as given in Table 1, and Ncap=5000, h=100 and D=1. Then, straightforward calculation by (14) gives R0=18.18, and (30) gives c=0.24. For these parameter values, H1(λ,c) and H2(λ2,c) are illustrated in Fig. 2.

    Figure 2. H1(λ,c) and H2(λ,c) for different c. (a) c=0.55; (b) c=c=0.6176844021, (λ=0.7081234538); (c) c=0.7. Here, the model parameters are taken as b=3000, r1=0.13, r2=0.13, r3=0.03, r4=0.03, d1=0.3, d2=0.3, d3=0.1, d4=0.1, τ1=20, τ2=10, Ncap=5000, h=100 and D=1.

    Based on (30), we may also numerically explore the dependence of c on some model parameters. As examples, we present some results on its dependence on the production rate b of ticks and the diffusion rate D of white tailed deer in Fig. 3. Note that, if equation (29) is rewritten in terms of ˜λ, where cλ=˜λ, it becomes evident that what matters is the value of D/c2 and therefore that c scales with D. The numerically computed relationship between c and D, shown in the second panel of Fig. 3, is very consistent with this observation. It highlights the need for the experimental determination of the value of D, the diffusion coefficient of the deer, because once we know D, and the proportionality constant in the relationship between c and D, we also know the spread rate c that our model predicts. Diffusion coefficients can in practice be estimated using recapture data or radio tracking.

    Figure 3. Dependence of c on b and D respectively: (a) with D=1; (b) with b=3000. Other parameters are taken as: r1=0.13, r2=0.13, r3=0.03, r4=0.03, d1=0.3, d2=0.3, d3=0.1, d4=0.1, τ1=20, τ2=10, Ncap=5000 and h=100.

    From the above we have seen that, for c<c, (29) has no real positive root and hence (1) cannot have a traveling wave front with speed c connecting E0 and E+. It is expected that c is indeed the minimum wave speed in the sense that, for every c>c, system (1) has such a connecting traveling wave front with speed c. The proof of the existence of a traveling wave front with speed c>c involves the construction of suitable upper and lower solutions to the wave profile equation (25). The argument is very lengthy and the details are subtle, and we leave it for a more mathematical paper (in preparation). In that paper, we will also prove that c is not only the minimal wave speed but also the asymptotic rate of spread for (1) when R0>1.


    5. Numerical simulation

    Although we defer to another paper the proof that c is both the minimal wave speed and the speed of spread for (1) when R0>1, we will in this section provide some numerical simulation results that support these claims. We start by numerically demonstrating the existence of traveling wave front solutions of system (1). For this purpose, we choose the baseline parameters as in Fig. 2. For these parameter values, c is numerically computed as c=0.24. We use a numerical method described in [12] which is summarized in the appendix. For convenience, we choose the same baseline parameters as in Fig. 2, giving R0=18.18, and the positive steady state

    (L+,N+,A+q,A+f)=(1.72×103,1.43×103,1.43×103,60.63).

    Fig. 4 shows that there is no traveling wave solution for c=0.1<c, since ϕ1,ϕ2,ϕ3 may take negative values. Fig. 5 shows the existence and profile of a traveling wave front with c=0.4>c.

    Figure 4. There is no biologically relevant traveling wave front solution with speed c=0.1<c=0.24: ϕ1 may take negative values.
    Figure 5. There is a non-negative traveling wave front solution with speed c=0.4>c=0.24.

    Next, we numerically simulate solutions of the original initial value problem (1) to observe the time evolution of solutions toward a traveling wave front. To estimate the spreading rate, we use the same approach as was mentioned in [16]. The idea is to assume some threshold population density ˆu, below which we cannot numerically detect the presence of the population. By tracking the propagation of such a threshold density we can then estimate the spreading rate. In other words, if we denote by ˆx the location where the population density reaches the threshold ˆu, then the asymptotic rate of spread is given by

    c=limtdˆx(t)dt.

    With the model parameter values given above, Fig. 6(a)-(b) and Fig. 7(a)-(b) show the evolution of the (L,N) components and the (Aq,Af) components of the solution of (1). The shaded regions in Fig. 6(c)-(d) and Fig. 7(c)-(d) mark the regions in space where the population size is larger than 0.1. The upper-lower boundaries of these areas are straight lines that have slope approximately equal to ±c=±0.24, coinciding with the minimal wave speed for the traveling wave fronts of (1) that connect E0 and E+ when R0>1.

    Figure 6. (a): time evolution of L(x,t); (b): time evolution of N(x,t); (c): contours of (a) with region where L(x,t)>0.1 shown in grey; (d): contours of (b) with region where N(x,t)>0.1 shown in grey.
    Figure 7. (a): time evolution of Aq(x,t); (b): time evolution of Af(x,t); (c): contours of (a) with region where Aq(x,t)>0.1 shown in grey; (d): contours of (b) with region where Af(x,t)>0.1 shown in grey.

    6. Conclusion and discussion

    In this paper, based on the fact that blacklegged ticks are only capable of moving very short distances by themselves and the general belief that dispersal of ticks over appreciable distances is via transport on the white tailed deer on which the adult ticks feed, we developed a spatial differential equation model for a stage-structured tick population. In addition to well-posedness, we identified a basic reproduction ratio R0 for the tick population and discussed the stability of the extinction steady state E0 and the persistence steady state E+ in terms of R0.

    We also discussed traveling wave front solutions to the model that connect E0 and E+. Such solutions describe tick invasion as a wave of transition from the extinction steady state to a persistence steady state of ticks. We obtained a lower bound c for the speed of such propagating traveling wave fronts, in the sense that the model cannot have traveling fronts with speed c<c. We also performed some numerical simulations for the wave profile equation and the results suggest that c is the minimal wave speed, meaning that for every c>c there is a traveling wave front of speed c connecting the extinction and persistence steady states E0 and E+.

    We also numerically simulated the solutions of the original initial value problem (1). The results not only demonstrate the evolution of solutions toward a traveling wave front, but also suggest that c is the asymptotic rate of spread of the tick population. Note that c is determined by two algebraic equations that can be solved numerically, though not analytically. The dependence of c on important model parameters can also be explored numerically. For example, since we are concerned with how the dispersion of white tailed deer affects the spatial spreading speed, we numerically explored the dependence of c on the diffusion rate D, as shown in Fig. 3(b), by which one can immediately estimate c as long as the diffusion rate D is known. This clearly demonstrates the role played by deer dispersal. We point out that c in this paper only accounts for the spread speed caused by the white-tailed deer diffusion; however, as is shown in Caraco et al [4], some smaller mammals, such as the white-footed mouse Peromyscus leucopus, can also play a role in the range expansion of the tick Ixodes scapularis. Therefore, even if the deer diffusion rate is available so that c can actually be obtained, it may not give the actual range expansion speed of the tick. In order to obtain a better or more accurate estimate/prediction of geographical spread speed of the tick Ixodes scapularis, it would be natural to derive a model that combines the roles of mice and deer. Toward that goal, our model establishes a framework, and we leave it for a future research project.

    Theoretically confirming that c is not only the minimal wave speed but also the spreading rate of the model system is more challenging. In a forthcoming and more mathematical paper [11], by reformatting our model into the framework of [22] and applying some recent results for such a set-up, we achieve this goal.

    In this paper, we have concentrated mainly on the case when the spatial domain is Ω=(,). In the real world, a two dimensional domain is clearly more realistic and there are a variety of realistic possibilities including both bounded and unbounded two-dimensional domains, and various boundary conditions. Both the domain itself and the boundary conditions affect the kernel k(x,y) (see, e.g., [13] and the examples given in Section 2 of this paper) and result in a variety of systems giving rise to various mathematical and ecological issues of interest.


    7. Appendix A: Numerical method

    To solve the wave equations (25) with asymptotic boundary condition (26) numerically, we truncate R=(,) to [M,M], where M is a very large number, and take the uniform partition: s1=M, s2n+1=M, sj=s1+(j1), where =2M/2n=M/n, j=1,2,,2n+1. Then, for sj (j=2,,2n),

    {cφ1(sj)=br4ed4τ1φ4(sjcτ1)(d1+r1)φ1(sj),cφ2(sj)=r1g(φ1(sj))(d2+r2)φ2(sj),cφ3(sj)=r2φ2(sj)(d3+r3)φ3(sj),cφ4(sj)=r32ed3τ2+k(sjycτ2)φ3(y)dy(d4+r4)φ4(sj). (31)

    The asymptotic boundary conditions limsφi(s)=0 and lims+φi(s)=φi are then translated to

    φi(M)=0,φi(M)=φi;φi(s)=0,s<M;φi(s)=φi,s>M,i=1,,4.

    It then follows that

    f1(φ3,sj):=+k(y)φ3(sjycτ2)dy=+k(sjycτ2)φ3(y)dy=(M+MM++M)k(sjycτ2)φ3(y)dy=MMk(sjycτ2)φ3(y)dy+φ3(M)+Mk(sjycτ2)dy.

    Applying the composite trapezium rule for integrals, we obtain

    MMk(sjycτ2)φ3(y)dy=2[k(sjs1cτ2)φ3(s1)+22nl=2k(sjslcτ2)φ3(sl)+k(sjs2n+1cτ2)φ3(s2n+1)], (32)

    and

    +Mk(sjycτ2)dy=sjMcτ2k(y)dy=12(1sj+M+cτ2sjMcτ2k(y)dy)
    =12{12[k(sjMcτ2)+k(sj+M+cτ2)+22[2n+m2(j1)]l=2k(sjMcτ2+(l1))]}.

    Then

    f1(φ3,sj)=2nl=2k(sjslcτ2)φ3(sl)+f2(sj)

    where

    f2(sj)=2[k(sjs1cτ2)φ3(s1)+k(sjs2n+1cτ2)φ3(s2n+1)]+φ3(M)+Mk(sjycτ2)dy=2k(sjMcτ2)φ3+φ3+Mk(sjycτ2)dy=2k(sjMcτ2)φ3+φ32{12[k(sjMcτ2)+k(sj+M+cτ2)]2[2n+m2(j1)]l=2k(sjMcτ2+(l1))}=φ32{12[2n+m2(j1)]l=2k(sjMcτ2+(l1))}.

    Let m1=cτ1 and m2=cτ2. Then sjcτ1=sjm1. Using conventional numerical differentiation, we see that

    {cφ1(sj+1)φ1(sj1)2=br4ed4τ1φ4(sjm1)(d1+r1)φ1(sj),cφ2(sj+1)φ2(sj1)2=r1g(φ1(sj))(d2+r2)φ2(sj),cφ3(sj+1)φ3(sj1)2=r2φ2(sj)(d3+r3)φ3(sj),cφ4(sj+1)φ4(sj1)2=r32ed3τ2f1(φ3,sj)(d4+r4)φ4(sj), (33)

    for j=2,,2n, or

    {cφ1(sj+1)cφ1(sj1)2br4ed4τ1φ4(sjm1)+2(d1+r1)φ1(sj)=0,cφ2(sj+1)cφ2(sj1)2r1g(φ1(sj))+2(d2+r2)φ2(sj)=0,cφ3(sj+1)cφ3(sj1)2r2φ2(sj)+2(d3+r3)φ3(sj)=0,cφ4(sj+1)cφ4(sj1)r3ed3τ2f1(φ3,sj)+2(d4+r4)φ4(sj)=0 (34)

    for j=2,,2n. The second equation in (34) is equivalent to the following equation:

    cφ2(sj+1)cφ2(sj1)2hr1Ncapφ1(sj)+2(d2+r2)φ2(sj)+chφ1(sj)φ2(sj+1)chφ1(sj)φ2(sj1)+2h(d2+r2)φ1(sj)φ2(sj)=0.

    Thus, system (34) can be expressed as

    [M1100M14M21M22000M32M33000M43M44][φ1(s2)φ1(s2n)φ2(s2)φ2(s2n)φ3(s2)φ3(s2n)φ4(s2)φ4(s2n)]+[C1C2C3C4]=0, (35)

    where

    Mii=[2(di+ri)c0c2(di+ri)cc2(di+ri)c0c2(di+ri)],i=1,,4,
    M14=[002br4ed4τ12br4ed4τ100],
    M21=[2hr1Ncap002hr1Ncap],
    M32=[2r2002r2],

    M43=r32ed3τ2ˆM43 with

    ˆM43=[k(s2s2cτ2)k(s2s3cτ2)k(s2s2ncτ2)k(s3s2cτ2)k(s3s3cτ2)k(s3s2ncτ2)k(s2ns2cτ2)k(s2ns3cτ2)k(s2ns2ncτ2)],
    C1=[00cφ1],C3=[00cφ3],C4=[r3ed3τ2f2(s2)r3ed3τ2f2(s3)cφ4r3ed3τ2f2(s2n)],
    C2=[1hφ1(s2)[cφ2(s3)+2(d2+r2)φ2(s2)]1hφ1(s3)[cφ2(s4)cφ2(s2)+2(d2+r2)φ2(s3)]1hφ1(s2n1)[cφ2(s2n)cφ2(s2n2)+2(d2+r2)φ2(s2n1)]cφ2+1hφ1(s2n)[cφ2cφ2(s2n1)+2(d2+r2)φ2(s2n)]].

    The algebraic system (35) can then be solved numerically using Matlab.


    Acknowledgments.

    This work was initiated at the Current Topics Workshop: Spatial-Temporal Dynamics in Disease Ecology and Epidemiology, held at the Mathematical Biosciences Institute (MBI) at Ohio State University during October 10-14,2011. The workshop was organized by R. Liu, J. Tsao, J. Wu and X. Zou, and was funded by the NSF through the MBI. We thank Dr. G. Hickling for bringing this problem to a group discussion which stimulated this research project. We also thank those participants at the workshop who offered helpful suggestions and advice on the model, and particularly Drs. Hickling and Tsao for their valuable input during the discussions at the MBI and for providing some valuable references.




    [1] J. Liu, A. T. Gaynor, S. Chen, Z. Kang, K. Suresh, A. Takezawa, et al., Current and future trends in topology optimization for additive manufacturing, Struct. Multidiscip. Optim., 57 (2018), 2457-2483. doi: 10.1007/s00158-018-1994-3
    [2] J. Liu, Y. Zheng, R. Ahmad, J. Tang, Y. Ma, Minimum length scale constraints in multi-scale topology optimisation for additive manufacturing, Virtual. Phys. Prototyping, 14 (2019), 229-241. doi: 10.1080/17452759.2019.1584944
    [3] Y. F. Fu, B. Rolfe, L. N. S. Chiu, Y. Wang, X. Huang, K. Ghabraie, Design and experimental validation of self-supporting topologies for additive manufacturing, Virtual. Phys. Prototyping, 14 (2019), 382-394. doi: 10.1080/17452759.2019.1637023
    [4] H. Yu, J. Huang, B. Zou, W. Shao, J. Liu, Stress-constrained shell-lattice infill structural optimisation for additive manufacturing. Virtual. Phys. Prototyping, 15 (2020), 35-48. doi: 10.1080/17452759.2019.1647488
    [5] J. Liu, Piecewise length scale control for topology optimization with an irregular design domain, Comput. Methods Appl. Mech. Eng., 351 (2019), 744-765. doi: 10.1016/j.cma.2019.04.014
    [6] C. Wang, X. Tan, E. Liu, S. Tor, Process parameter optimization and mechanical properties for additively manufactured stainless steel 316L parts by selective electron beam melting, Mater. Des., 147 (2018), 157-166. doi: 10.1016/j.matdes.2018.03.035
    [7] Y. Tang, G. Dong, Q. Zhou, Y. Zhao, Lattice Structure Design and Optimization With Additive Manufacturing Constraints, IEEE Trans. Autom. Sci. Eng., 15 (2018), 1546-1562. doi: 10.1109/TASE.2017.2685643
    [8] C. Yu, J. Jiang, A Perspective on Using Machine Learning in 3D Bioprinting, Int. J. Bioprint., 6 (2020), 94-101.
    [9] J. Jiang, J. Stringer, X. Xu, Support Optimization for Flat Features via Path Planning in Additive Manufacturing, 3D Print. Addit. Manuf., 6 (2019), 171-179. doi: 10.1089/3dp.2017.0124
    [10] J. Jiang, X. Xu, J. Stringer, Support Structures for Additive Manufacturing: A Review, J. Manuf. Mater. Process., 2 (2018), 64.
    [11] T. Wuest, D. Weimer, C. Irgens, K. D. Thoben, Machine learning in manufacturing: Advantages, challenges, and applications, Prod. Manuf. Res., 4 (2016), 23-45.
    [12] K. Aoyagi, H. Wang, H. Sudo, A. Chiba, Simple method to construct process maps for additive manufacturing using a support vector machine, Addit. Manuf., 27 (2019), 353-362.
    [13] A. Menon, B. Póczos, A. W. Feinberg, N. R. Washbum, Optimization of Silicone 3D Printing with Hierarchical Machine Learning, 3D Print. Addit. Manuf., 6 (2019), 181-189. doi: 10.1089/3dp.2018.0088
    [14] H. He, Y. Yang, Y. Pan, Machine learning for continuous liquid interface production: Printing speed modelling, J. Manuf. Syst., 50 (2019), 236-246. doi: 10.1016/j.jmsy.2019.01.004
    [15] J. Francis, L. Bian, Deep Learning for Distortion Prediction in Laser-Based Additive Manufacturing using Big Data, Manuf. Lett., 20 (2019), 10-14. doi: 10.1016/j.mfglet.2019.02.001
    [16] M. Khanzadeh, P. Rao, R. Jafari-Marandi, B. K. Smith, M. A. Tschopp, L. Bian, Quantifying Geometric Accuracy with Unsupervised Machine Learning: Using Self-Organizing Map on Fused Filament Fabrication Additive Manufacturing Parts, J. Manuf. Sci. Eng., 140 (2018), 031011. doi: 10.1115/1.4038598
    [17] Z. Zhu, N. Anwer, Q. Huang, L. Mathieu, Machine learning in tolerancing for additive manufacturing, CIRP Ann., 67 (2018), 157-160. doi: 10.1016/j.cirp.2018.04.119
    [18] B. Zhang, S. Liu, Y. C. Shin, In-Process monitoring of porosity during laser additive manufacturing process, Addit. Manuf., 28 (2019), 497-505.
    [19] F. Tamburrino, S. Graziosi, M. Bordegoni, The influence of slicing parameters on the multi-material adhesion mechanisms of FDM printed parts: An exploratory study, Virtual Phys. Prototyping, 14 (2019), 316-322. doi: 10.1080/17452759.2019.1607758
    [20] J. Jiang, J. Stringer, X. Xu, R. Y. Zhong, Investigation of printable threshold overhang angle in extrusion-based additive manufacturing for reducing support waste, Int. J. Comput. Integr. Manuf., 31 (2018), 961-969. doi: 10.1080/0951192X.2018.1466398
    [21] J. Jiang, J. Lou, G. Hu, Effect of Support on Printed Properties in Fused Deposition Modelling Processes, Virtual Phys. Prototyping, 14 (2019), 308-315. doi: 10.1080/17452759.2019.1568835
    [22] J. Jiang, G. Hu, X. Li, X. Xu, P. Zhang, J. Stringer, Analysis and prediction of printable bridge length in fused deposition modelling based on back propagation neural network, Virtual Phys. Prototyping, 14 (2019), 253-266. doi: 10.1080/17452759.2019.1576010
    [23] F. Weng, S. Gao, J. Jiang, J. Wang, P. Guo, A novel strategy to fabricate thin 316L stainless steel rods by continuous direct metal deposition in Z direction, Addit. Manuf., 27 (2019), 474-481.
    [24] J. Jiang, F. Weng, S. Gao, J. Stringer, X. Xu, P. Guo, A Support Interface Method for Easy Part Removal in Direct Metal Deposition, Manuf. Lett., 20 (2019), 30-33. doi: 10.1016/j.mfglet.2019.04.002
    [25] J. Jiang, X. Xu, J. Stringer, Effect of Extrusion Temperature on Printable Threshold Overhang in Additive Manufacturing, CIRP Conference on Manufacturing Systems, 2019. Available from: https://www.researchgate.net/publication/333259282_Effect_of_Extrusion_Temperature_on_Printable_Threshold_Overhang_in_Additive_Manufacturing.
    [26] J. Jiang, X. Xu, J. Stringer, Optimisation of multi-part production in additive manufacturing for reducing support waste, Virtual Phys. Prototyping, 14 (2019), 219-228. doi: 10.1080/17452759.2019.1585555
    [27] J. Jiang, X. Xu, J. Stringer, Optimization of Process Planning for Reducing Material Waste in Extrusion Based Additive Manufacturing, Rob. Comput. Integr. Manuf., 59 (2019), 317-325. doi: 10.1016/j.rcim.2019.05.007
    [28] J. Jiang, X. Xu, J. Stringer, A new support strategy for reducing waste in additive manufacturing, The 48th International Conference on Computers and Industrial Engineering (CIE 48), 2018. Available from: https://www.researchgate.net/profile/Jingchao_Jiang/publication/329999272_A_New_Support_Strategy_for_Reducing_Waste_in_Additive_Manufacturing/links/5c367bf492851c22a368bcad/A-New-Support-Strategy-for-Reducing-Waste-in-Additive-Manufacturing.pdf.
    [29] T. H. Luu, C. Altenhofen, T. Ewald, A. Stork, D. Fellner, Efficient slicing of Catmull-Clark solids for 3D printed objects with functionally graded material, Comput. Graph, 82 (2019), 295-303. doi: 10.1016/j.cag.2019.05.023
    [30] Y. Wang, W. Li, A slicing algorithm to guarantee non-negative error of additive manufactured parts, Int. J. Adv. Manuf. Technol., 101 (2019), 3157-3166. doi: 10.1007/s00170-018-3199-8
    [31] J. Flores, I. Garmendia, J. Pujana, Toolpath generation for the manufacture of metallic components by means of the laser metal deposition technique, Int. J. Adv. Manuf. Technol., 101 (2019), 2111-2120. doi: 10.1007/s00170-018-3124-1
    [32] N. Volpato, T. T. Zanotto, Analysis of deposition sequence in tool-path optimization for low-cost material extrusion additive manufacturing, Int. J. Adv. Manuf. Technol., 101 (2019), 1855-1863. doi: 10.1007/s00170-018-3108-1
    [33] B. Ezair, S. Fuhrmann, G. Elber, Volumetric covering print-paths for additive manufacturing of 3D models, Comput. Aided Des., 100 (2018), 1-13. doi: 10.1016/j.cad.2018.02.006
    [34] Y. Xiong, S. I. Park, S. Padmanathan, A. G. Dharmawan, S. Foong, D. W. Rosen, et al., Process planning for adaptive contour parallel toolpath in additive manufacturing with variable bead width, Int. J. Adv. Manuf. Technol., 105 (2019), 4159-4170. doi: 10.1007/s00170-019-03954-1
    [35] B. Huang, W. Wang, S. Ren, R. Y. Zhong, J. Jiang, A proactive task dispatching method based on future bottleneck prediction for the smart factory, Int. J. Comput. Integr. Manuf., 32 (2019), 278-293. doi: 10.1080/0951192X.2019.1571241
    [36] R. Caruana, A. Niculescu-Mizil, An empirical comparison of supervised learning algorithms, ACM International Conference Proceeding Series, 2006,161-168. Available from: https://dl.acm.org/doi/abs/10.1145/1143844.1143865.
    [37] L. Francis, Unsupervised learning, Predict. Model. Appl. Actuarial Sci., 1 (2014), 280-311.
    [38] K. Arulkumaran, M. P. Deisenroth, M. Brundage, A. A. Bharath, Deep reinforcement learning: A brief survey, IEEE Signal Process. Mag., 34 (2017), 26-38. doi: 10.1109/MSP.2017.2743240
    [39] K. He, X. Zhang, S. Ren, J. Sun, Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classification, The IEEE International Conference on Computer Vision (ICCV), 2015, 1026-1034. Available from: https://www.cv-foundation.org/openaccess/content_iccv_2015/html/He_Delving_Deep_into_ICCV_2015_paper.html.
    [40] D. P. Kingma, J. Ba, Adam: A method for stochastic optimization, arXiv: 1412.6980, 2017.
    [41] J. M. Chacón, M. A. Caminero, E. García-Plaza, P. J. Núñez, Additive manufacturing of PLA structures using fused deposition modelling: Effect of process parameters on mechanical properties and their optimal selection, Mater. Des., 124 (2017), 143-157. doi: 10.1016/j.matdes.2017.03.065
    [42] A. Lanzotti, M. Grasso, G. Staiano, M. Martorelli, The impact of process parameters on mechanical properties of parts fabricated in PLA with an open-source 3-D printer, Rapid Prototyp J., 21 (2015), 604-617. doi: 10.1108/RPJ-09-2014-0135
    [43] K. G. Christiyan, U. Chandrasekhar, K. Venkateswarlu, A study on the influence of process parameters on the Mechanical Properties of 3D printed ABS composite, IOP Conference Series: Materials Science and Engineering, Institute of Physics Publishing, 2016. Available from: https://iopscience.iop.org/article/10.1088/1757-899X/114/1/012109/meta.
  • This article has been cited by:

    1. Xiulan Lai, Xingfu Zou, Minimal wave speed and spread speed in a system modelling the geographic spread of black-legged tick Ixodes scapularis, 2020, 269, 00220396, 6400, 10.1016/j.jde.2020.05.002
    2. Ruiwen Wu, Propagation dynamics of a nonlocal spatial Lyme disease model in a time–space periodic habitat, 2023, 72, 14681218, 103843, 10.1016/j.nonrwa.2023.103843
    3. Xiao-Qiang Zhao, The linear stability and basic reproduction numbers for autonomous FDEs, 2023, 0, 1937-1632, 0, 10.3934/dcdss.2023082
    4. Yu-Cai Hao, Guo-Bao Zhang, Juan He, Exponential stability of traveling wavefronts for a system modeling the geographic spread of black-legged tick Ixodes scapularis, 2023, 74, 0044-2275, 10.1007/s00033-023-02014-9
    5. Mingdi Huang, Shi-Liang Wu, Xiao-Qiang Zhao, The principal eigenvalue for partially degenerate and periodic reaction-diffusion systems with time delay, 2023, 371, 00220396, 396, 10.1016/j.jde.2023.06.024
    6. Azmy S. Ackleh, Amy Veprauskas, Aijun Zhang, The impact of dispersal and allee effects on tick invasion: a spatially-explicit discrete-time modelling approach, 2023, 1023-6198, 1, 10.1080/10236198.2023.2285895
  • Reader Comments
  • © 2020 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(6359) PDF downloads(607) Cited by(51)

Article outline

Figures and Tables

Figures(7)  /  Tables(3)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog