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

Multi-cloud resource scheduling intelligent system with endogenous security

  • A secure and reliable intelligent multi-cloud resource scheduling system in cyberspace is especially important in some industry applications. However, this task has become exceedingly challenging due to the intricate nature of information, the variety of knowledge representations, the compatibility of diverse knowledge reasoning engines, and the numerous security threats found in cloud networks. In this paper, we applied the endogenous security theory to the multi-cloud resource scheduling intelligent system and presented a novel model of the system. The proposed model incorporates various knowledge representations and inference engines, resulting in a multi-cloud resource scheduling intelligent system that ensures endogenous security. In addition, we have devised a scheme for an intelligent system that schedules multi-cloud resources using dual-channels and has an endogenous security mechanism, which we have named Dynamic, Heterogeneous, and Redundant (DHR). Finally, we have used the multi-cloud resource scheduling intelligent run log database to carry out numerous experiments to validate the efficiency of the dual-channel redundant reasoning system with the endogenous security mechanism's DHR property. The results of the experiment demonstrated that the multi-cloud resource intelligent scheduling system model with an endogenous security mechanism was superior to the current single-channel inference system scheme in regards to security and reliability.

    Citation: Nishui Cai, Guofeng He. Multi-cloud resource scheduling intelligent system with endogenous security[J]. Electronic Research Archive, 2024, 32(2): 1380-1405. doi: 10.3934/era.2024064

    Related Papers:

    [1] Ihsan Ullah, Aman Ullah, Shabir Ahmad, Hijaz Ahmad, Taher A. Nofal . A survey of KdV-CDG equations via nonsingular fractional operators. AIMS Mathematics, 2023, 8(8): 18964-18981. doi: 10.3934/math.2023966
    [2] Rong Rong, Hui Liu . The Burgers-KdV limit in one-dimensional plasma with viscous dissipation: A study of dispersion and dissipation effects. AIMS Mathematics, 2024, 9(1): 1248-1272. doi: 10.3934/math.2024062
    [3] Musawa Yahya Almusawa, Hassan Almusawa . Numerical analysis of the fractional nonlinear waves of fifth-order KdV and Kawahara equations under Caputo operator. AIMS Mathematics, 2024, 9(11): 31898-31925. doi: 10.3934/math.20241533
    [4] Yanxia Hu, Qian Liu . On traveling wave solutions of a class of KdV-Burgers-Kuramoto type equations. AIMS Mathematics, 2019, 4(5): 1450-1465. doi: 10.3934/math.2019.5.1450
    [5] M. Mossa Al-Sawalha, Khalil Hadi Hakami, Mohammad Alqudah, Qasem M. Tawhari, Hussain Gissy . Novel Laplace-integrated least square methods for solving the fractional nonlinear damped Burgers' equation. AIMS Mathematics, 2025, 10(3): 7099-7126. doi: 10.3934/math.2025324
    [6] Shanhao Yuan, Yanqin Liu, Yibin Xu, Qiuping Li, Chao Guo, Yanfeng Shen . Gradient-enhanced fractional physics-informed neural networks for solving forward and inverse problems of the multiterm time-fractional Burger-type equation. AIMS Mathematics, 2024, 9(10): 27418-27437. doi: 10.3934/math.20241332
    [7] Hayman Thabet, Subhash Kendre, James Peters . Travelling wave solutions for fractional Korteweg-de Vries equations via an approximate-analytical method. AIMS Mathematics, 2019, 4(4): 1203-1222. doi: 10.3934/math.2019.4.1203
    [8] Jian-Gen Liu, Jian Zhang . A new approximate method to the time fractional damped Burger equation. AIMS Mathematics, 2023, 8(6): 13317-13324. doi: 10.3934/math.2023674
    [9] Yousef Jawarneh, Humaira Yasmin, Abdul Hamid Ganie, M. Mossa Al-Sawalha, Amjid Ali . Unification of Adomian decomposition method and ZZ transformation for exploring the dynamics of fractional Kersten-Krasil'shchik coupled KdV-mKdV systems. AIMS Mathematics, 2024, 9(1): 371-390. doi: 10.3934/math.2024021
    [10] Xiaoli Wang, Lizhen Wang . Traveling wave solutions of conformable time fractional Burgers type equations. AIMS Mathematics, 2021, 6(7): 7266-7284. doi: 10.3934/math.2021426
  • A secure and reliable intelligent multi-cloud resource scheduling system in cyberspace is especially important in some industry applications. However, this task has become exceedingly challenging due to the intricate nature of information, the variety of knowledge representations, the compatibility of diverse knowledge reasoning engines, and the numerous security threats found in cloud networks. In this paper, we applied the endogenous security theory to the multi-cloud resource scheduling intelligent system and presented a novel model of the system. The proposed model incorporates various knowledge representations and inference engines, resulting in a multi-cloud resource scheduling intelligent system that ensures endogenous security. In addition, we have devised a scheme for an intelligent system that schedules multi-cloud resources using dual-channels and has an endogenous security mechanism, which we have named Dynamic, Heterogeneous, and Redundant (DHR). Finally, we have used the multi-cloud resource scheduling intelligent run log database to carry out numerous experiments to validate the efficiency of the dual-channel redundant reasoning system with the endogenous security mechanism's DHR property. The results of the experiment demonstrated that the multi-cloud resource intelligent scheduling system model with an endogenous security mechanism was superior to the current single-channel inference system scheme in regards to security and reliability.



    The Korteweg–de Vries–Burgers (KdV-Burgers) model, which comes up in several practical situations, such as the turbulence of undular bores in shallow water [1], the transport of liquids carrying gas bubbles [2], the waves that go through an elastic pipe that is filled with a viscous liquid [3], and weakly nonlinear plasma waves that have specific dissipative properties [4], has received a lot of interest over the last few decades. It may also be utilized as a nonlinear model in ferroelectricity theory, turbulence, circuit theory, and other fields [5,6]. The typical version of the KdV-Burger's equation is

    Ut+σ3Ux3+ζ2Ux2+ηUUx=0,t>0. (1.1)

    The KdV [7] and Burgers models [8] are commonly believed to be combined in Eq (1.1). Johnson [9] discovered that a specific limit of the matter led to the proposed model, where U(x,t) is proportional to the radial disturbance of the pipe wall, and x and t are the characterizing and temporal variables, in a field of wave propagation in fluid-filled elastic pipes. The model (1.1) was correct in the far-field of a near-field solution that was originally linear (small amplitude). Nonlinearity (UUx), dispersion (3Ux3), and dissipation (2Ux2) all exist in this equation, which is the basic version of a wave model. Fractional differential equations (FDEs) are extensions of differential equations (DEs) having integer order. FDEs have ample applications in different domains of sciences [10,11,12,13,14]. Due to the wide applications of FDEs, several operators have been defined in the literature [15,16]. The recent operators that are frequently used for studying DEs are the Caputo-Fabrizio (CF) [17] and Atangana-Baleanu (AB) [18] operators. These operators are dependent on the exponential and Mittag-Leffler kernels, respectively. The literature has several applications for the CF and the AB operators. For instance, HIV-1 infection has been investigated via the CF operator in [19]. Ahmad et al. studied the fractional-order Ambartsumian equation through the CF operator [20]. The Φ 4-model has been investigated using the CF and AB operators by Rahman et al. [21]. More applications can be found in the literature [22,23,24]. The fractional non-linear KdV-Burger's equation is taken into consideration in the form:

    αUtα+σ3Ux3+ζ2Ux2+ηUUx=0,0<α1,t>0, (1.2)

    with

    U(x,0)=R(x),

    where U is a function of x and t, x represents the space variable, t represents the time variable and η is a positive constant. We analyze Eq (1.2) in two ways: writing it first in the Atangana-Baleanu-Caputo (ABC) sense and then in the CF sense.

    One of the most significant areas of research for FDEs is the quest for accurate and numerical solutions to FDEs. To date, many strategies for obtaining numerical and precise solutions of FDEs have been developed. A number of FDEs have been examined using these approaches. For example, Ahmad et al. [25] used the Laplace transform to find series of third order dispersive fractional PDEs. A generalized differential transform approach has been developed to solve fractional order PDEs by Odibat and Momani [26]. The homotopy perturbation technique has been proposed to solve the KdV-Burger's fractional PDE by Wang [27]. The Laplace transform was also observed to have a number of advantages, including its convergence to an exact solution of a problem after a certain iteration and that it does not allow any perturbation or discretization. Here, we utilize the double Laplace (DL) transform to compute a series solution of the considered equation.

    The rest of article is organized as follows: Section 2 contains some basic definitions and a remark. The existence and uniqueness of the IVPs are presented in Section 3. In Section 4, the proposed techniques are presented. Section 5 consists of the application and comparison between results and diagrams of the proposed method. Finally, the conclusion is presented in Section 6.

    In this part, we provide some definitions, remarks, and lemmas about fractional calculus. Additionally, we provide a definition of the DL transformation and decomposition technique.

    Definition 1. [18] Let UH1(c,d), c>d and β(0,1]. Then the ABC operator is expressed as

    ABCDβU(t)=B(β)(1β)tcU(s)Eβ(β(ts)β(1β))ds,

    where B(β) is a normalizing factor with the conditions B(0)=B(1)=1, and Eβ is the Mittag-Leffler function

    Eβ(x)=k=0xkΓ(βk+1),0<β<1.

    Definition 2. [17] Let UH1(c,d), d>c and β(0,1]. Then the CF operator is written as

    CFDβU(t)=E(β)1βtcU(t)exp(β(ts)1β)ds,

    where E(β) is the normalizing factor such that E(0)=E(1)=1. When U(t) H1(c,d) then the above equation can be written for u ϵL1(,d) and any β ϵ(0,1] as

    CFDβU(t)=βE(β)1βt(U(t)U(s))exp(β(ts)1β)ds.

    Remark 1. For the above definitions, n=[β]+1, [β] is the greatest integer not greater than β, and "Γ" is the well-known gamma function that can be calculated as

    Γ(β)=0essβ1ds.

    Definition 3. Suppose that U is a function for x,t>0. The DL transformation of U is expressed as [28]

    LxLt[U]=0epx0estUdtdx,

    where p and s are complex numbers.

    Definition 4. Application of the DL transform on the ABC operator is as follows:

    LxLt{ABCDθxU}=B(θ)(1θ)(pθ+θ(1θ))[pθˉU(p,s)n1k=0pθ1kLt{kU(0,t)xk}],

    and

    LxLt{ABCDϑtU}=B(ϑ)(1ϑ)(sϑ+ϑ(1ϑ))[sϑˉU(p,s)m1k=0sϑ1kLx{kU(x,0)tk}],

    where, n=[θ]+1,m=[ϑ]+1.

    Definition 5. Application of the DL transformation on the CF operator is as follows:

    LxLt{CFDθ+nxU}=E(θ)p+(1θ)p[pn+1ˉU(p,s)ni=0pniLt{iU(0,t)xi}],

    and

    LxLt{CFDϑ+mtU}=E(ϑ)s+(1ϑ)s[sm+1ˉU(p,s)mi=0smiLx{iU(x,0)ti}],

    where, n=[θ]+1,m=[ϑ]+1.

    From the interpretation provided above, it is clear that

    LxLtU(x)v(t)=ˉU(p)ˉv(s)=LxU(x)Ltv(t).

    A complex double-integral formulation is used to represent the inverse DL transform L1xL1t{ˉU}=U:

    L1xL1t{ˉU}=12πia+iaiestb+ibiepxˉU(p,s)dpds,

    where, ˉU(p,s), is an analytic function for all p and s that are described in the region Re (p)a and Re (s)b, where a,bR to be chosen appropriately.

    The existence and uniqueness of the IVPs are studied in this part employing α-type ϝ-contraction. For this purpose, assume that (Z,d) is a complete metric space, and is the collection of strictly increasing functions ϝ:R+R having the following required characteristics:

    limnϝ(cn)= if and only if, for each {cn}, limn(cn)=0;

    ● there exists υ(0,1) such that limc0+cυϝ(c)=0.

    Definition 6. [29] Let Q:ZZ be self mapping with α:Z×Z[0,). If

    α(X,W)1α(QX,QW)1,

    for all X,WZ, then Q is referred to as α-admissible.

    Definition 7. [30] Suppose that Q:ZZ, α:Z×Z{}[0,), and there exists ω>0 such that

    ω+α(X,W)ϝ(d(QX,QW))ϝ(d(X,W))

    for each X,WZ with d(QX,QW)>0. Then, Q is called an α-type ϝ-contraction.

    Theorem 1. [30] Let (Z,d) be a complete metric space and Q:ZZ be an α-type ϝ-contraction such that

    1) there exists XZ such that α(X,QX)1;

    2) if there exist {Xn}Z with α(Xn,Xn+1)1 and XnX, then α(Xn,X)1 for all nN;

    3) ϝ is continuous.

    Then, Q has a fixed point XZ. Also for XZ, the sequence {QnX}nN is convergent to X

    Let Z=C([0,1]2,R), where C is the space of all continuous functions X:[0,1]×[0,1]R, and d(X(x,t),W(x,t))=supx,t[0,1]{|X(x,t)W(x,t)|}. Then we can write the IVP (1.1) in the CF fractional derivative sense as

    CFDαtX(x,t)=F(x,t,X(x,t)),0<α1, (3.1)

    with initial condition

    X(x,0)=g(x),

    where F(x,t,X(x,t))=σUxxxζUxxηUUx.

    The following theorem demonstrates the existence of a solution of the problem (3.1).

    Theorem 2. There exists G:R2R such that

    1) |F(x,t,X)F(x,t,W)|2γM(γ)2eb|X(x,t)W(x,t)| for (x,t)[0,1]2 and X,WR;

    2) there exists X1Z such that G(X1,QX1)0, where Q:ZZ is defined by

    QX=X+CF0IγF(x,t,X(x,t));

    3) for X,WZ,G(X,W)0 implies that G(QX,QW)0;

    4) {Xn}Z,limnXn=X, where XZ and G(Xn,Xn+1)0 implies that G(Xn,X)0, for all nN.

    Then, there exists at least one fixed point of Q that is the solution of the given model (3.1).

    Proof. To prove that Q has a fixed point, we consider

    |QXQW||QXQW+1|=|CFI[F(x,tX)F(x,tW)]||CFI[F(x,tX)F(x,tW)]+1|(2(1γ)(2γ)M(γ)|F(x,tX)F(x,tW)|+2γ(2γ)M(γ)τ0|F(x,tX)F(x,tW)|dτ)×(2(1γ)(2γ)M(γ)|F(x,tX)F(x,tW)|+2γ(2γ)M(γ)τ0|F(x,tX)F(x,tW)|dτ+1))(2(1γ)(2γ)M(γ).(2γM(γ))2eb|XW|+2γ(2γ)M(γ).2γM(γ)2τ0eb|XW|dτ)×(2(1γ)(2γ)M(γ).(2γM(γ))2eb|XW|+2γ(2γ)M(γ).2γM(γ)2τ0eb|XW|dτ+1)(ebsupx,t[0,1]|X(x,t)W(x,t)|)(ebsupx,t[0,1]|X(x,t)W(x,t)|+1)=(ebd(X,W))(ebd(X,W)+1)=eb[eb(d(X,W))2+d(X,W)]eb[(d(X,W))2+d(X,W)].

    Thus, for X,WZ with G(X,W)0, we obtain

    (d(QX,QW))2+d(QX,QW)
    eb[(d(X,W))2+d(X,W)].

    Taking the ln on both sides, we have

    b+ln[d(QX,QW))2+d(QX,QW]ln[d(X,W))2+d(X,W].

    If F:[0,)R is defined by F(u)=ln[u2+u],u>0, then Fδ.

    Now, define α:Z×Z{}[0,) as

    α(X,W)={1,ifG(X(x,t),W(x,t))0forallx,t[0,1],,otherwise.

    Then,

    b+α(X,W)F(d(QX,QW))F(d(X,W)),

    for X,WZ with d(QX,QW)>0. Now, by G3,

    α(X,W)1G(X,W)0G(QX,QW)0α(QX,QW)1,

    for all X,WZ. From G2, there exists XZ such that α(X,QX)1. Therefore by G4 and Theorem 1, there exists XZ such that X=QX. Hence, X is the solution of the problem (3.1)

    Similarly, we can write the IVP (1.1) in the ABC sense as

    ABCDαtX(x,t)=F(x,t,X(x,t)),0<α1, (3.2)

    with initial condition

    X(x,0)=g(x),

    where F(x,t,X(x,t))=σUxxxζUxxηUUx.

    The following theorem shows the existence of a solution of the problem (3.2).

    Theorem 3. There exists G:R2R such that

    1) |F(x,t,X)F(x,t,W)|ΓγM(γ)(1γ)Γγ+1eb2|X(x,t)W(x,t)| for (x,t)[0,1]2 and X,WR;

    2) there exists X1Z such that G(Y1,QX1)0, where Q:ZZ is defined by

    QX=X+ABC0IγF(x,t,X(x,t));

    3) for X,WZ,G(X,W)0 implies that G(QX,QW)0;

    4) {Xn}Z,limnXn=X, where XZ and G(Xn,Xn+1)0 implies that G(Xn,X)0, for all nN.

    Then, there exists at least one fixed point of Q which is the solution of the problem (3.2).

    Proof.

    |QXQW|2=|AB0Iγ[F(x,t,X(x,t))F(x,t,W(x,t))]|2|{1γM(γ)[F(x,t,X)F(x,t,W)]+γM(γ)0Iγ[F(x,t,X(x,t))F(x,t,W(x,t))]}|2{1γM(γ)|F(x,t,X)F(x,t,W)|+γM(γ)0Iγ|F(x,t,X(x,t))F(x,t,W(x,t))|}2{1γM(γ).M(γ)Γγ(1γ)Γγ+1eb2|XW|2+γM(γ)M(γ)Γγ(1γ)Γγ+10Iγ1.eb2|XW|2}2={M(γ)Γγ(1γ)Γγ+1eb2|XW|2}2{1γM(γ)+γM(γ)γΓγ}2{M(γ)Γγ(1γ)Γγ+1eb2supx,t[0,1]|X(x,t)W(x,t)|2}2{1γM(γ)+γM(γ)γΓγ}2={M(γ)Γγ(1γ)Γγ+1eb2d(X,W)}2{1γM(γ)+γM(γ)Γγ}2=ebd(X,W).

    Consequently,

    d(QX,QW)ebd(X,W).

    Applying "ln'' on both sides, we have

    ln(d(QX,QW))ln(ebd(X,W)),

    and

    b+ln(d(QX,QW)ln(d(X,W)).

    Let ϝ:[0,)R be defined by ϝ(λ)=lnλ, where λ>0. Then it is easy to show that ϝ.

    Now, define α:Z×Z{}[0,) by

    α(X,W)={1,ifG(X(x,t),W(x,t))0forallx,t[0,1],,otherwise.

    Thus, b+α(X,W)ϝ(d(QX,QW))ϝ(d(X,W)) for X,WZ with d(QX,QW)0. Therefore, Q is an α-type ϝ-contraction. From (G3), we have

    α(X,W)1G(X,W)0G(QX,QW)α(QX,QW)1,

    for all x,t[0,1]. Thus, Q is α-admissible. From (G2), there exists XZ with α(X,QX)1. From (G4) and Theorem[29], there exists XZ such that QX. Hence, X is the solution of the IVP (3.2).

    Here, we briefly introduce the suggested technique MDLDM, which combines the DL transformation and Adomian decomposition method (ADM) for obtaining a series solution of non-linear ordinary DEs and PDEs. It is a very effective approach for obtaining the approximate values of dynamical problems such as KdV-Burgers, Sine-Gordon and KdV type equations. Here, we first introduce the technique and then the application of the given method on Eq (1.1).

    Take the following form:

    LU+RU+NU=f(x,t),tR, (4.1)

    where L is linear, R and N are operators containing linear and non-linear terms, respectively, and f(x,t) is some external function. An, the well-known Adomian polynomials [31] of the functions U0,U1,U2,, can be described as

    An=1n!dndλn[nk=0λkUkUkx]λ=0. (4.2)

    Here, first take Eq (1.1) in the form of ABC sense as:

     ABCDαtU+σUxxx+ζUxx+ηUUx=0, (4.3)

    with initial conditions

    U(x,0)=R(x).

    By applying the DL transform method on both sides of Eq (4.3), we obtain

    LxLtABCDαtU=1[σLxLtUxxx+ζLxLtUxx+ηLxLtUUx].

    Using initial condition and after some calculation, we have

    LxLtU=1sLxR(x)(1α+αsα)LxLt[σUxxx+ζUxx+ηUUx].

    Consider the series form

    U=n=0Un. (4.4)

    The non-linear term UUx can be calculated using "ADM"; we obtain

    UUx=n=0An,
    LxLtn=0Un=1sLxR(x)(1α+αsα)[LxLt(σn=0Unxxx+ζn=0Unxx+ηn=0An)]. (4.5)

    Applying the double Laplace inverse transform and Equating terms of both sides,

    U0=R(x),U1=L1xL1t(1α+αsα)LxLt(σU0xxx+ζU0xx+ηA0),U2=L1xL1t(1α+αsα)LxLt(σU1xxx+ζU1xx+ηA1),U3=L1xL1t(1α+αsα)LxLt(σU2xxx+ζU2xx+ηA2),.

    The final solution can be calculated as follows:

    U=n=0Un. (4.6)

    Now, we take Eq (1.1) in CF fractional derivative sense as:

     CFDαtU+σUxxx+ζUxx+ηUUx=0, (4.7)

    with initial conditions

    U(x,0)=R(x).

    Using (3.1), we obtain the following series solutions:

    U0=R(x).U1=L1xL1t((1s)α+ss)LxLt(σU0xxx+ζU0xx+ηA0),U2=L1xL1t((1s)α+ss)LxLt(σU1xxx+ζU1xx+ηA1),U3=L1xL1t((1s)α+ss)LxLt(σU2xxx+ζU2xx+ηA2),.

    The final form can be expressed as

    U=n=0Un. (4.8)

    Here, we consider a numerical example in the form of time fractional derivatives in ABC and CF operators.

    Example 1. Consider Eq (1.1) in the following form:

    αUtα+σ3Ux3+ζ2Ux2+ηUUx=0,0<α1,t>0, (5.1)

    with initial condition

    U0=a03ζ2tanh2(ζx10σ)25ησ+6ζ2tanh(ζx10σ)25ησ.

    The exact solution of Eq (5.1) is:

    U=a0+6ζ225ησtanh(ζ10σ(x+(3ζ225a0ησ)t25σ))3ζ225ησtanh2(ζ10σ(x+(3ζ225a0ησ)t25σ)).

    Here, we will discuss two cases.

    Case Ⅰ:

    Consider Eq (5.1) in ABC form as follows:

     ABCDαtU+σUxxx+ζUxx+ηUUx=0. (5.2)

    The approximate solutions of Eq (5.2) by using the techniques discussed in Section 4 are obtained in the series up to O(3) and given by

    U0=a03ζ2tanh2(ζx10σ)25ησ+6ζ2tanh(ζx10σ)25ησ,U1=3ζ3(tα+Γ(α)αΓ(α))(3ζ225a0ησ)(tanh(ζx10σ)1)sech2(ζx10σ)3125ησ3Γ(α),U2=3ζ4781250ησ5Γ(α)Γ(1+2α)((t2αα+2(α1)2Γ(2α))Γ(1+α)2tα(α1)Γ(1+2α))(3ζ225a0ησ)2(tanh(ζx10σ)1)(3tanh(ζx10σ)+1)sech2(ζx10σ),
    U3=3ζ5(3ζ225a0ησ)2sech6(xζ10σ)(tanh(ζx10σ)1)781250000σ7η(Γ(α))2Γ(1+α)Γ(1+2α)Γ(1+3α)[24(1+α)2(ζ)2(Γ(α))2(tαα(1+α)Γ(1+α))Γ(1+2α)Γ(1+3α)(cosh(xζ10σ)sinh(xζ10σ))(cosh(xζ10σ)+3sinh(xζ10σ))24t2αζ2Γ(1+α)Γ(1+2α)(tααΓ(1+2α)(1+α)Γ(1+3α))(2+cosh(xζ5σ)sinh(xζ5σ))+Γ(α)Γ(1+α)(2tα(1+α)2Γ(1+3α)(αΓ(2α)(123ζ2+225a0ησ+4(9ζ2+25a0ησ)cosh(xζ5σ)+5(3ζ225a0ησ)cosh(2xζ5σ)30(ζ2+5a0ησ)sinh(xζ5σ)+9ζ2sinh(2xζ5σ)75a0ησsinh(2xζ5σ))+Γ(1+2α)(75ζ2+225a0ησ+4(3ζ2+25a0ησ)cosh(xζ5σ)+5(3ζ225a0ησ)cosh(2xζ5σ)6(ζ2+25a0ησ)sinh(xζ5σ)+9ζ2sinh(2xζ5σ)75a0ησsinh(2xζ5σ)))+Γ(1+α)(t3αα2Γ(1+2α)(123ζ2+225a0ησ+4(9ζ2+25a0ησ)cosh(xζ5σ)+5(3ζ225a0ησ)cosh(2xζ5σ)30(ζ2+5a0ησ)sinh(xζ5σ)+9ζ2sinh(2xζ5σ)75a0ησsinh(2xζ5σ))(1+α)Γ(1+3α)(3t2αα(91ζ2+225a0ησ+20(ζ2+5a0ησ)cosh(xζ5σ)+5(3ζ225a0ησ)cosh(2xζ5σ)14ζ2sinh(xζ5σ)150a0ησsinh(xζ5σ)+9ζ2sinh(2xζ5σ)75a0ησsinh(2xζ5σ))+2(1+α)2Γ(2α)(123ζ2+225a0ησ+4(9ζ2+25a0ησ)cosh(xζ5σ)+5(3ζ225a0ησ)cosh(2xζ5σ)30(ζ2+5a0ησ)sinh(xζ5σ)+9ζ2sinh(2xζ5σ)75a0ησsinh(2xζ5σ)))))].

    The simplified form of U3 is:

    U3=3ζ5(3ζ225a0ησ)2sech4(xζ10σ)(tanh(ζx10σ)1)1562500000σ7η[43(1+expxζ5σ)2(expxζ5σ(6(α1)3(3(1+3expxζ5σ25exp2xζ5σ+exp3xζ5σ+4exp4xζ5σ)ζ225a0(1+expxζ5σ)2(17expxζ5σ+4exp2xζ5σ)ησ)+t2αα(9(α1)Γ(2α)((3+17expxζ5σ91exp2xζ5σ+3exp3xζ5σ+12exp4xζ5σ)ζ225a0(1+expxζ5σ)2(17expxζ5σ+4exp2xζ5σ)ησ)2tααΓ(3α)(3(1+11expxζ5σ41exp2xζ5σ+exp3xζ5σ+4exp4xζ5σ)ζ225a0(1+expxζ5σ)2(17expxζ5σ+4exp2xζ5σ)ησ)))48(2expxζ5σ1)t2αζ2(3(α1)Γ(3α)+tαΓ(1+2α))(Γ(α))2Γ(3α))24tα(α1)Γ(α1)(9ζ2+175a0ησ+5(3ζ225a0ησ)cosh[xζ5σ]18ζ2sech2[xζ5σ]+3(3ζ225a0ησ)sinh[xζ5σ]12ζ2tanh[xζ5σ])].

    Therefore,

    U=U0+U1+U2+U3..... (5.3)

    Case Ⅱ:

    Consider Eq (1.2) in the CF sense as

     CFDαtU+σUxxx+ζUxx+ηUUx=0. (5.4)

    The approximate solutions of Eq (5.4) obtained by using the approaches discussed in Section 4 up to O(3) are given by

    U0==a0(3ζ2)tanh2(ζx10σ)25ησ+(6ζ2)tanh(ζx10σ)25ησ,U1=3ζ3(1+(t1)α)(3ζ225a0ησ)(tanh(ζx10σ)1)sech2(ζx10σ)3125ησ3,U2=3ζ4(α2(t24t+2)+4α(t1)+2)(3ζ225a0ησ)2(tanh(ζx10σ)1)(3tanh(ζx10σ)+1)sech2(ζx10σ)1562500ησ5,
    U3=ζ5(3ζ225a0ησ)2sech6(xζ10σ)1562500000ησ7[4(3(618(1+t)α3(612t+t2)α2+(618t+3t2+t3)α3)ζ225a0(6+18(1+t)α+9(24t+t2)α2+(6+18t9t2+t3)α3)ησ)cosh(xζ5σ)5(6+18(1+t)α+9(24t+t2)α2+(6+18t9t2+t3)α3)(3ζ225a0ησ)cosh(2xζ5σ)3(3(50+150(1+t)α+(150300t+59t2)α2+(50+150t59t2+3t3)α3)ζ2+75a0(6+18(1+t)α+9(24t+t2)α2+(6+18t9t2+t3)α3)ησ+2(3(26(1+t)α+(6+12t+t2)α2+(26tt2+t2)α3)ζ225a0(6+18(1+t)α+9(24t+t2)α2+(6+18t9t2+t3)α3)ησ)sinh(xζ5σ)+(6+18(1+t)α+9(24t+t2)α2+(6+18t9t2+t3)α3)(3ζ225a0ησ)sinh(2xζ5σ))](1+tanh(xζ10σ)).

    The simplified form is

    U3=ζ5(3ζ225a0ησ)2sech6(xζ10σ)(tanh(xζ10σ)1)1562500000ησ7[9(50+α(150t(α1)259t2(α1)α+3t3α250(3+(α3)α)))ζ2225a0(6+18(t1)α+9(2+(t4)t)α2+(6+(t6)(t3)t)α3)ησ+12(618(t1)α3(6+(t12)t)α2+(6+(t3)t(t+6))α3)ζ2cosh[xζ5σ]+(6+18(t1)α+9(2+(t4)t)α2+(6+(t6)(t3)t)α3)(3ζ225a0ησ)(5cosh[2xζ5σ]3sinh[2xζ5σ])18(2+α(66t+(6+t(t+12))α+(2+(t3)t(t+2))α2))ζ2sinh[xζ5σ]+50a0(6+18(1+t)α+9(24t+t2)α2+(6+18t9t2+t3)α3)ση(2cosh[xζ5σ]+3sinh[xζ5σ])]

    The final result in the series form up to O(3) is given by

    U=U0+U1+U2+U3..... (5.5)

    The errors between the exact and approximate solutions in the ABC and CF senses are shown in the Tables 1 and 2, respectively.

    Table 1.  The comparison of approximated ABC and exact solutions for α=1 at various points for Example 1.
    (x, t) U Exact ExactU (x, t) U Exact ExactU
    (4, 0.01) 3.5967 3.5967 4.437×1011 (2, 0.01) 3.42484 3.42484 1.488×109
    (1, 0.01) 2.50239 2.50239 7.202×109 (0, 0.01) 0.02862 0.02862 1.666×108
    (1, 0.01) 1.13462 1.13462 4.376×109 (2, 0.01) 1.19852 1.19852 2.930×1010
    (4, 0.01) 1.2000 1.2000 1.184×1013 (4, 0.1) 3.5959 3.5959 4.635×107
    (2, 0.1) 3.3840 3.3840 1.515×105 (1, 0.1) 2.2941 2.2942 7.761×105
    (0, 0.1) 0.2693 0.2695 1.725×104 (1, 0.1) 1.1556 1.1556 4.302×105
    (2, 0.1) 1.1990 1.1990 2.715×106 (4, 0.1) 1.2000 1.2000 1.085×109
    (4, 0.05) 3.5963 3.5963 2.827×108 (2, 0.05) 3.4077 3.4077 9.378×107
    (1, 0.05) 2.4131 2.4131 4.656×106 (0, 0.05) 0.1395 0.1395 1.06×105
    (1, 0.05) 1.1448 1.1448 2.716×106 (2, 0.05) 1.1987 1.1987 1.769×107
    (4, 0.05) 1.2000 1.2000 7.099×1011 (4, 0.2) 3.5948 3.5948 7.795×106
    (2, 0.2) 3.3282 3.3279 2.4641×104 (1, 0.2) 2.0304 2.0317 1.3403×103
    (0, 0.2) 0.4958 0.4986 2.8191×103 (1, 0.2) 1.1720 1.1713 6.7111×104
    (2, 0.2) 1.1994 1.1994 4.007×105 (4, 0.2) 1.2000 1.2000 1.5911×108

     | Show Table
    DownLoad: CSV
    Table 2.  The comparison of approximated the CF and exact solution for α=1 at various points for Example 1.
    (x, t) U Exact ExactU (x, t) U Exact ExactU
    (4, 0.01) 3.5967 3.5967 4.437×1011 (2, 0.01) 3.4248 3.4248 1.488×109
    (1, 0.01) 2.5023 2.5023 7.202×109 (0, 0.01) 0.02862 0.02862 1.666×108
    (1, 0.01) 1.13462 1.13462 4.376×109 (2, 0.01) 1.19852 1.19852 2.930×1010
    (4, 0.01) 1.2000 1.2000 1.184×1013 (4, 0.1) 3.5959 3.5959 4.635×107
    (2, 0.1) 3.3840 3.3840 1.515×105 (1, 0.1) 2.2941 2.2942 7.761×105
    (0, 0.1) 0.2693 0.2695 1.725×104 (1, 0.1) 1.1556 1.1556 4.302×105
    (2, 0.1) 1.1990 1.1990 2.715×106 (4, 0.1) 1.2000 1.2000 1.085×109
    (4, 0.05) 3.5963 3.5963 2.827×108 (2, 0.05) 3.4077 3.4077 9.378×107
    (1, 0.05) 2.4131 2.4131 4.656×106 (0, 0.05) 0.1395 0.1395 1.06×105
    (1, 0.05) 1.1448 1.1448 2.716×106 (2, 0.05) 1.1987 1.1987 1.769×107
    (4, 0.05) 1.2000 1.2000 7.099×1011 (4, 0.2) 3.5948 3.5948 7.795×106
    (2, 0.2) 3.3282 3.3279 2.4641×104 (1, 0.2) 2.0304 2.0317 1.3403×103
    (0, 0.2) 0.4958 0.4986 2.8191×103 (1, 0.2) 1.1720 1.1713 6.7111×104
    (2, 0.2) 1.1994 1.1994 4.007×105 (4, 0.2) 1.2000 1.2000 1.5911×108

     | Show Table
    DownLoad: CSV

    Take the parameteric values as η=1, a0=0 and ζ and σ=0.1 for numerical computations. Tables 1 and 2 show the errors between the exact and approximated values in the ABC and CF senses, while the exact and computational values are also shown in these tables. Figure 1 depicts the comparison of approximated solutions in ABC and CF forms for different values of α at t=1. The surfaces in Figure 2 show the exact and approximated solutions of the ABC and the CF forms, respectively, for Eq (1.2) at α=1. Figures 3 and 4 present the approximate solutions when α=0.95 and α=0.90, respectively. These graphical representations show the behaviour of ABC and CF operators respectively for the proposed problem. Figures 5 and 6 depict the behaviours of surfaces for various values of α at different time levels. The first representation depicts the ABC form, while the second shows the CF form. It is straightforward to deduce that, as the fractional parameter α decreases, the wave response bifurcates into a wave but only for small values of x, and we observe that the amplitude of the wave grows over time t.

    Figure 1.  Comparison plots of approximated solutions of ABC and CF, respectively, for various values α.
    Figure 2.  Comparison plots of exact solutions, approximated solutions of ABC and CF for α=1 respectively.
    Figure 3.  Comparison plots of approximated solutions of ABC and CF, respectively, for α=0.95.
    Figure 4.  Comparison plots of approximated solutions of ABC and CF, respectively, for α=0.9.
    Figure 5.  Comparison plots of approximated solutions of ABC and CF, respectively, for α=0.5.
    Figure 6.  Comparison plots of approximated solutions of ABC and CF, respectively, for α=0.25.

    In this manuscript, the time fractional KdV-Burger's model with initial conditions under two non-local operators with exponential kernel and Mittag-Leffler kernel has been investigated. The existence of the solution for both operators has been demonstrated through fixed point results of α-type ϝ contraction. The MDLDM was utilized to compute a series solutions that tends to the exact values for the special case α=1. As a result, we found highly accurate computed solutions to the fractional KdV-Burger's equation. The solutions show how consistently accurate the technique is and how broadly applicable it is to fractional nonlinear evolution problems. Quick convergence is seen when solutions are simulated numerically. Furthermore, neither linearization nor perturbation are needed. Therefore, it offers more authentic series solutions that typically converge quickly in actual physical problems.

    The authors declare that they have no conflict of interest.



    [1] P. Kühn, D. N. Relke, C. Reuter, Common vulnerability scoring system prediction based on open source intelligence information sources, Comput. Secur., 131 (2023), 1103286. https://doi.org/10.1016/j.cose.2023.103286 doi: 10.1016/j.cose.2023.103286
    [2] S. Nazir, S. Patel, D. Patel, Assessing and augmenting SCADA cyber security: A survey of techniques, Comput. Secur., 70 (2017), 436–454. https://doi.org/10.1016/j.cose.2017.06.010 doi: 10.1016/j.cose.2017.06.010
    [3] J. Wu, Cyberspace endogenous safety, security, Engineering, 15 (2021), 179–185. https://doi.org/10.1016/j.eng.2021.05.015 doi: 10.1016/j.eng.2021.05.015
    [4] B. Yang, S. Wang, Q. Cheng, T. Jin, Scheduling of field service resources in cloud manufacturing based on multi-population competitive-cooperative GWO, Comput. Ind. Eng., 154 (2021), 107104. https://doi.org/10.1016/j.cie.2021.107104 doi: 10.1016/j.cie.2021.107104
    [5] Z. X. Sun, H. Huang, Z. Li, C. Gu, R. Xie, B. Qian, Efficient, economical and energy-saving multi-workflow scheduling in hybrid cloud, Expert Syst. Appl., 228 (2023), 120401. https://doi.org/10.1016/j.eswa.2023.120401 doi: 10.1016/j.eswa.2023.120401
    [6] G. Zhou, W. Tian, R. Buyya, K. Wu, Growable Genetic Algorithm with Heuristic-based Local Search for multi-dimensional resources scheduling of cloud computing, Appl. Soft Comput., 136 (2023), 110027. https://doi.org/10.1016/j.asoc.2023.110027 doi: 10.1016/j.asoc.2023.110027
    [7] G. Agarwal, S. Gupta, R. Ahuja, A. K. Rai, Multiprocessor task scheduling using multi-objective hybrid genetic Algorithm in Fog–cloud computing, Knowledge-Based Syst., 272 (2023), 110563. https://doi.org/10.1016/j.knosys.2023.110563 doi: 10.1016/j.knosys.2023.110563
    [8] W. Zhang, J. Xiao, W. Liu, Y. Sui, Y. Li, S. Zhang, Individualized requirement-driven multi-task scheduling in cloud manufacturing using an extended multifactorial evolutionary algorithm, Comput. Ind. Eng., 179 (2023), 109178. https://doi.org/10.1016/j.cie.2023.109178 doi: 10.1016/j.cie.2023.109178
    [9] W. Xiong, M. K. Lim, M. L. Tseng, Y. Wang, An effective adaptive adjustment model of task scheduling and resource allocation based on multi-stakeholder interests in cloud manufacturing, Adv. Eng. Inf., 56 (2023), 101937. https://doi.org/10.1016/j.aei.2023.101937 doi: 10.1016/j.aei.2023.101937
    [10] W. Zhang, Y. Zheng, W. Ma, R. Ahmad, Multi-task scheduling in cloud remanufacturing system integrating reuse, reprocessing, and replacement under quality uncertainty, J. Manuf. Syst., 68 (2023), 176–195. https://doi.org/10.1016/j.jmsy.2023.03.008
    [11] X. Wang, H. Lou, Z. Dong, C. Yu, R. Lu, Decomposition-based multi-objective evolutionary algorithm for virtual machine and task joint scheduling of cloud computing in data space, Swarm Evol. Comput., 77 (2023), 101230. https://doi.org/10.1016/j.swevo.2023.101230 doi: 10.1016/j.swevo.2023.101230
    [12] Y. H. Wu, H. B. Li, RNNCTPs: A neural symbolic reasoning method using dynamic knowledge partitioning technology, Knowledge-Based Syst., 268 (2023), 110481. https://doi.org/10.1016/j.knosys.2023.110481 doi: 10.1016/j.knosys.2023.110481
    [13] G. Wang, Y. Zhang, F. Zhang, Z. Wu, An ensemble method with DenseNet and evidential reasoning rule for machinery fault diagnosis under imbalanced condition, Measurement, 214 (2023), 112806. https://doi.org/10.1016/j.measurement.2023.112806 doi: 10.1016/j.measurement.2023.112806
    [14] Y. Gao, R. Bao, Z. Pan, G. Ma, J. Li, X. Cai, Q. Peng, Mechanical equipment health management method based on improved intuitionistic fuzzy entropy and case reasoning technology, Eng. Appl. Artif. Intell., 116 (2022), 105372. https://doi.org/10.1016/j.engappai.2022.105372 doi: 10.1016/j.engappai.2022.105372
    [15] M. B. Fard, A. Hamedani, M. Ebadi, D. Hamidi, K. Motlaghzadeh, M. Emarati, et al., Sustainable waste-to-energy plant site selection by a hybrid method of geographic information system and evidential reasoning: A case study Guilan province, Process Saf. Environ. Prot., 176 (2023), 316–331. https://doi.org/10.1016/j.psep.2023.05.063 doi: 10.1016/j.psep.2023.05.063
    [16] W. Xu, Y. Huang, S. Song, Y. Chen, G. Cao, M. Yu, et al., A new online optimization method for boiler combustion system based on the data-driven technique and the case-based reasoning principle, Energy, 263 (2023), 125508. https://doi.org/10.1016/j.energy.2022.125508 doi: 10.1016/j.energy.2022.125508
    [17] M. R. N. Kalhori, M. H. FazelZarandi, A new interval type-2 fuzzy reasoning method for classification systems based on normal forms of a possibility-based fuzzy measure, Inf. Sci., 581 (2021), 567–586. https://doi.org/10.1016/j.ins.2021.09.060 doi: 10.1016/j.ins.2021.09.060
    [18] J. Wang, Z. Zhang, G. Zhao, Task recommendation method for fusion of multi-view social relationship learning and reasoning in the mobile crowd sensing system, Comput. Commun., 206 (2023), 60–72. https://doi.org/10.1016/j.comcom.2023.04.028 doi: 10.1016/j.comcom.2023.04.028
    [19] W. Xu, Y. Huang, S. Song, B. Chen, X. Qi, A novel online combustion optimization method for boiler combining dynamic modeling, multi-objective optimization and improved case-based reasoning, Fuel, 337 (2023), 126854. https://doi.org/10.1016/j.fuel.2022.126854
    [20] R. Yadav, A. Giri, S. Chatterjee, Understanding the users' motivation and barriers in adopting healthcare apps: A mixed-method approach using behavioral reasoning theory, Technol. Forecasting Social Change, 183 (2022), 121932. https://doi.org/10.1016/j.techfore.2022.121932 doi: 10.1016/j.techfore.2022.121932
    [21] Z. Zhang, L. Wang, J. Duan, Y. M. Wang, An early warning method based on fuzzy evidential reasoning considering heterogeneous information, Int. J. Disaster Risk Reduct., 82 (2022), 103356. https://doi.org/10.1016/j.ijdrr.2022.103356 doi: 10.1016/j.ijdrr.2022.103356
    [22] Z. Zhao, J. Chen, K. Xu, H. Xie, X. Gan, H. Xu, A spatial case-based reasoning method for regional landslide risk assessment, Int. J. Appl. Earth Obs. Geoinf., 102 (2021), 102381. https://doi.org/10.1016/j.jag.2021.102381 doi: 10.1016/j.jag.2021.102381
    [23] X. Long, H. Li, W. Ren, Y. Du, E. Mao, N. Ding, A parameter-extended case-based reasoning method based on a functional basis for automated experiential reasoning in mechanical product designs, Adv. Eng. Inf., 50 (2021), 101409. https://doi.org/10.1016/j.aei.2021.101409 doi: 10.1016/j.aei.2021.101409
    [24] S. Chen, J. Liu, Y. Xu, A logical reasoning based decision making method for handling qualitative knowledge, Int. J. Approximate Reasoning, 129 (2021), 49–63. https://doi.org/10.1016/j.ijar.2020.11.003 doi: 10.1016/j.ijar.2020.11.003
    [25] A. Wang, X. Gao, A variable scale case-based reasoning method for evidence location in digital forensics, Future Gener. Comput. Syst., 122 (2021), 209–219. https://doi.org/10.1016/j.future.2021.03.019 doi: 10.1016/j.future.2021.03.019
    [26] N. Cercone, A. An, C. Chan, Rule-induction and case-based reasoning: Hybrid architectures appear advantageous, IEEE Trans. Knowl. Data Eng., 11 (1999), 166–174. https://doi.org/10.1109/69.755625 doi: 10.1109/69.755625
    [27] D. Sottara, P. Mello, M. Proctor, A configurable rete-oo engine for reasoning with different types of imperfect information, IEEE Trans. Knowl. Data Eng., 22 (2010), 1535–1548. https://doi.org/10.1109/TKDE.2010.125 doi: 10.1109/TKDE.2010.125
    [28] Y. Cao, Z. Zhou, C. Hu, W. He, S. Tang, On the interpretability of belief rule-based expert systems, IEEE Trans. Fuzzy Syst., 29 (2021), 3489–3503. https://doi.org/10.1109/TFUZZ.2020.3024024 doi: 10.1109/TFUZZ.2020.3024024
    [29] S. Guo, W. Zhou, K. Li, Multi-layer Case-based Reasoning Approach of Complex Product System, in 2012 Third World Congress on Software Engineering, (2012), 107–110. https://doi.org/10.1109/WCSE.2012.27
    [30] R. Ouache, E. Bakhtavar, G. Hu, K. Hewage, R. Sadiq, Evidential reasoning and machine learning-based framework for assessment and prediction of human error factors-induced fire incidents, J. Build. Eng., 49 (2022), 104000. https://doi.org/10.1016/j.jobe.2022.104000 doi: 10.1016/j.jobe.2022.104000
    [31] S. Kierner, J. Kucharski, Z. Kierner, Taxonomy of hybrid architectures involving rule-based reasoning and machine learning in clinical decision systems: A scoping review, J. Biomed. Inf., 144 (2023), 104428. https://doi.org/10.1016/j.jbi.2023.104428 doi: 10.1016/j.jbi.2023.104428
    [32] H. Bride, C. H. Cai, J. Dong, J. S. Dong, Z. Hóu, S. Mirjalili, et al., Silas: A high-performance machine learning foundation for logical reasoning and verification, Expert Syst. Appl., 176 (2021), 114806. https://doi.org/10.1016/j.eswa.2021.114806 doi: 10.1016/j.eswa.2021.114806
    [33] Y. Chen, Z. Dai, H. Yu, B. K. H. Low, T. H. Ho, Recursive reasoning-based training-time adversarial machine learning, Artif. Intell., 315 (2023), 103837. https://doi.org/10.1016/j.artint.2022.103837 doi: 10.1016/j.artint.2022.103837
    [34] L. Bellomarini, R. R. Fayzrakhmanov, G. Gottlob, A. Kravchenko, E. Laurenza, Y. Nenov, et al., Data science with Vadalog: Knowledge Graphs with machine learning and reasoning in practice, Future Gener. Comput. Syst., 129 (2022), 407–422. https://doi.org/10.1016/j.future.2021.10.021 doi: 10.1016/j.future.2021.10.021
    [35] M. Namvar, A. Intezari, S. Akhlaghpour, J. P. Brienza, Beyond effective use: Integrating wise reasoning in machine learning development, Int. J. Inf. Manage., 69 (2023), 102566. https://doi.org/10.1016/j.ijinfomgt.2022.102566 doi: 10.1016/j.ijinfomgt.2022.102566
    [36] J. G. C. Krüger, A. de Souza Britto Jr, J. P. Barddal, An explainable machine learning approach for student dropout prediction, Expert Syst. Appl., 233 (2023), 120933. https://doi.org/10.1016/j.eswa.2023.120933 doi: 10.1016/j.eswa.2023.120933
    [37] R. Gao, S. Cui, H. Xiao, W. Fan, H. Zhang, Y. Wang, Integrating the sentiments of multiple news providers for stock market index movement prediction: A deep learning approach based on evidential reasoning rule, Inf. Sci., 615 (2022), 529–556. https://doi.org/10.1016/j.ins.2022.10.029 doi: 10.1016/j.ins.2022.10.029
    [38] J. Liu, Q. Qian, Reinforcement learning-based knowledge graph reasoning for aluminum alloy applications, Comput. Mater. Sci, 221 (2023), 112075. https://doi.org/10.1016/j.commatsci.2023.112075 doi: 10.1016/j.commatsci.2023.112075
    [39] N. Muslim, S. Islam, J. C. Grégoire, Reinforcement learning based offloading framework for computation service in the edge cloud and core cloud, J. Adv. Inf. Technol., 13 (2022), 139–114. https://doi.org/10.12720/jait.13.2.139-146 doi: 10.12720/jait.13.2.139-146
    [40] I. Ahmad, T. Kumar, M. Liyanage, J. Okwuibe, M. Ylianttila, A. Gurtov, Overview of 5g security challenges and solutions, IEEE Commun. Stand. Mag., 2 (2018), 36–43. https://doi.org/10.1109/MCOMSTD.2018.1700063 doi: 10.1109/MCOMSTD.2018.1700063
    [41] H. Hu, J. Wu, Z. Wang, G. Cheng, Mimic defense: a designed-in cybersecurity defense framework, IET Inf. Secur., 12 (2018), 226–237. https://doi.org/10.1049/iet-ifs.2017.0086 doi: 10.1049/iet-ifs.2017.0086
  • This article has been cited by:

    1. Sajjad Ali, Aman Ullah, Shabir Ahmad, Kamsing Nonlaopon, Ali Akgül, Analysis of Kink Behaviour of KdV-mKdV Equation under Caputo Fractional Operator with Non-Singular Kernel, 2022, 14, 2073-8994, 2316, 10.3390/sym14112316
    2. Sadia Arshad, Iram Saleem, Ali Akgül, Jianfei Huang, Yifa Tang, Sayed M Eldin, A novel numerical method for solving the Caputo-Fabrizio fractional differential equation, 2023, 8, 2473-6988, 9535, 10.3934/math.2023481
    3. Vahisht K. Tamboli, Priti V. Tandel, Solution of the non-linear time-fractional Kudryashov–Sinelshchikov equation using fractional reduced differential transform method, 2024, 30, 1405-213X, 10.1007/s40590-024-00602-x
    4. Khan Shehzada, Aman Ullah, Sayed Saifullah, Ali Akgül, Fractional generalized perturbed KdV equation with a power Law kernel: A computational study, 2023, 12, 26667207, 100298, 10.1016/j.rico.2023.100298
    5. Amjad E. Hamza, Osman Osman, Muhammad Umair Sarwar, Khaled Aldwoah, Hicham Saber, Manel Hleili, Exploring Solitons Solutions of a (3+1)-Dimensional Fractional mKdV-ZK Equation, 2024, 8, 2504-3110, 498, 10.3390/fractalfract8090498
    6. Asif Khan, Abid Ullah Khan, Shabir Ahmad, Investigation of fractal fractional nonlinear Korteweg-de-Vries-Schrödinger system with power law kernel, 2023, 98, 0031-8949, 085202, 10.1088/1402-4896/ace08b
    7. Laila A. Al-Essa, Mati ur Rahman, A survey on fractal fractional nonlinear Kawahara equation theoretical and computational analysis, 2024, 14, 2045-2322, 10.1038/s41598-024-57389-0
    8. Sadia Yasin, Meraj Ali Khan, Shabir Ahmad, Saud Fahad Aldosary, Abundant new optical solitary waves of paraxial wave dynamical model with kerr media via new extended direct algebraic method, 2024, 56, 1572-817X, 10.1007/s11082-024-06845-2
    9. Wafa Alfwzan, Shao-Wen Yao, F.M. Allehiany, Shabir Ahmad, Sayed Saifullah, Mustafa Inc, Analysis of fractional non-linear tsunami shallow-water mathematical model with singular and non singular kernels, 2023, 52, 22113797, 106707, 10.1016/j.rinp.2023.106707
    10. Khalid K. Ali, M. Maneea, New approximation solution for time-fractional Kudryashov-Sinelshchikov equation using novel technique, 2023, 72, 11100168, 559, 10.1016/j.aej.2023.04.027
    11. Abdulrahman B. M. Alzahrani, Ghadah Alhawael, Novel Computations of the Time-Fractional Coupled Korteweg–de Vries Equations via Non-Singular Kernel Operators in Terms of the Natural Transform, 2023, 15, 2073-8994, 2010, 10.3390/sym15112010
    12. Sayed Saifullah, Nahid Fatima, Shaimaa A. M. Abdelmohsen, Meznah M. Alanazi, Shabir Ahmad, Dumitru Baleanu, Analysis of a conformable generalized geophysical KdV equation with Coriolis effect, 2023, 73, 11100168, 651, 10.1016/j.aej.2023.04.058
    13. Miguel Vivas-Cortez, Majeed A. Yousif, Bewar A. Mahmood, Pshtiwan Othman Mohammed, Nejmeddine Chorfi, Alina Alb Lupas, High-Accuracy Solutions to the Time-Fractional KdV–Burgers Equation Using Rational Non-Polynomial Splines, 2024, 17, 2073-8994, 16, 10.3390/sym17010016
  • Reader Comments
  • © 2024 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(1029) PDF downloads(48) Cited by(3)

Figures and Tables

Figures(4)  /  Tables(11)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog