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

PAIGE: A generative AI-based framework for promoting assignment integrity in higher education


  • The integration of Generative Artificial Intelligence (GAI) tools like ChatGPT, Google Bard, and Bing Chat in higher education shows excellent potential for transformation. However, this integration also raises issues in maintaining academic integrity and preventing plagiarism. In this study, we investigate and analyze practical approaches for efficiently harnessing the potential of GAI while simultaneously ensuring the preservation of assignment integrity. Despite the potential to expedite the learning process and improve accessibility, concerns regarding academic misconduct highlight the necessity for the implementation of novel GAI frameworks for higher education. To effectively tackle these challenges, we propose a conceptual framework, PAIGE (Promoting Assignment Integrity using Generative AI in Education). This framework emphasizes the ethical integration of GAI, promotes active student interaction, and cultivates opportunities for peer learning experiences. Higher education institutions can effectively utilize the PAIGE framework to leverage the promise of GAI while ensuring the preservation of assignment integrity. This approach paves the way for a responsible and thriving future in Generative AI-driven education.

    Citation: Shakib Sadat Shanto, Zishan Ahmed, Akinul Islam Jony. PAIGE: A generative AI-based framework for promoting assignment integrity in higher education[J]. STEM Education, 2023, 3(4): 288-305. doi: 10.3934/steme.2023018

    Related Papers:

    [1] Joy Qi En Chia, Li Lian Wong, Kevin Yi-Lwern Yap . Quality evaluation of digital voice assistants for diabetes management. AIMS Medical Science, 2023, 10(1): 80-106. doi: 10.3934/medsci.2023008
    [2] Diogo Henrique Constantino Coledam, Philippe Fanelli Ferraiol, Gustavo Aires de Arruda, Arli Ramos de Oliveira . Correlates of the use of health services among elementary school teachers: A cross-sectional exploratory study. AIMS Medical Science, 2023, 10(4): 273-290. doi: 10.3934/medsci.2023021
    [3] Dionysios Tafiadis, Georgios Tatsis, Nausica Ziavra, Eugenia I. Toki . Voice Data on Female Smokers: Coherence between the Voice Handicap Index and Acoustic Voice Parameters. AIMS Medical Science, 2017, 4(2): 151-163. doi: 10.3934/medsci.2017.2.151
    [4] Debora Moreira, Rida Khan, Paulo Marcelo Gondim Sales . Neuropsychiatric sequelae of medication non-adherence in people living with HIV. AIMS Medical Science, 2023, 10(2): 162-173. doi: 10.3934/medsci.2023014
    [5] Eugenia I. Toki, Polyxeni Fakitsa, Konstantinos Plachouras, Konstantinos Vlachopoulos, Neofytos Kalaitzidis, Jenny Pange . How does noise pollution exposure affect vocal behavior? A systematic review. AIMS Medical Science, 2021, 8(2): 116-137. doi: 10.3934/medsci.2021012
    [6] Tracey Cockerton Tattersall, Nadja Rolli, Martin Butwell . Integrative child psychotherapy: discussion of a common core and unified theory approach. AIMS Medical Science, 2024, 11(2): 181-209. doi: 10.3934/medsci.2024015
    [7] Ayşegül Çelik, Belgüzar Kara . The relationship between the stroke survivors’ functional status and their informal caregivers’ burden and quality of life. AIMS Medical Science, 2019, 6(1): 115-127. doi: 10.3934/medsci.2019.1.115
    [8] Wendell C. Taylor, Kevin Rix, Ashley Gibson, Raheem J. Paxton . Sedentary behavior and health outcomes in older adults: A systematic review. AIMS Medical Science, 2020, 7(1): 10-39. doi: 10.3934/medsci.2020002
    [9] Ray Marks . Narrative Review of Dance-based Exercise and Its Specific Impact on Depressive Symptoms in Older Adults. AIMS Medical Science, 2016, 3(1): 61-76. doi: 10.3934/medsci.2016.1.61
    [10] Tamás Micsik, Göran Elmberger, Anders Mikael Bergquist, László Fónyad . Experiences with an International Digital Slide Based Telepathology System for Routine Sign-out between Sweden and Hungary. AIMS Medical Science, 2015, 2(2): 79-89. doi: 10.3934/medsci.2015.2.79
  • The integration of Generative Artificial Intelligence (GAI) tools like ChatGPT, Google Bard, and Bing Chat in higher education shows excellent potential for transformation. However, this integration also raises issues in maintaining academic integrity and preventing plagiarism. In this study, we investigate and analyze practical approaches for efficiently harnessing the potential of GAI while simultaneously ensuring the preservation of assignment integrity. Despite the potential to expedite the learning process and improve accessibility, concerns regarding academic misconduct highlight the necessity for the implementation of novel GAI frameworks for higher education. To effectively tackle these challenges, we propose a conceptual framework, PAIGE (Promoting Assignment Integrity using Generative AI in Education). This framework emphasizes the ethical integration of GAI, promotes active student interaction, and cultivates opportunities for peer learning experiences. Higher education institutions can effectively utilize the PAIGE framework to leverage the promise of GAI while ensuring the preservation of assignment integrity. This approach paves the way for a responsible and thriving future in Generative AI-driven education.



    This paper concerns existence of multiple positive solutions for certain non-cooperative nonlinear elliptic systems with bistable nonlinearities, whose prototype is

    {Δu=uu3Λuv2Δv=vv3Λu2vu,v>0in RN, with Λ>1. (1.1)

    This system arises in the study of domain walls and interface layers for two-components Bose-Einstein condensates [4]. Domain walls solutions satisfying asymptotic conditions

    {(u,v)(1,0)as xN+,(u,v)(0,1)as xN,, (1.2)

    in dimension N=1 have been carefully studied in [2,4], where in particular it is shown the existence of such a solution for every Λ>1 [4], and its uniqueness in the class of solutions with one monotone component [2]. In fact, uniqueness holds also without such assumption, and even in higher dimension [9]; precisely, in [9] it is shown that a solution to (1.1)–(1.2) (with the limits being uniform in xRN1) in RN with Λ>1 is necessarily montone in both the components with respect to xN, and 1-dimensional. The assumption Λ>1 is natural, since (1.1)–(1.2) has no solution at all when Λ(0,1]. Indeed, it is proved that (1.1) has only constant solutions for both Λ(0,1) [9], and Λ=1 [9,13].

    We also refer to [1,3] for recent results regarding a system obtained from (1.1) adding in each equation an additional term representing the spin coupling.

    To sum up, up to now it is known that (1.1) has only constant solutions for Λ(0,1], and at least one 1-dimensional non-constant solution for Λ>1. Moreover, solutions with uniform limits as in (1.2) are necessarily 1-dimensional, and unique modulo translations. In this paper we prove the existence of infinitely many geometrically distinct solutions to (1.1) in any dimension N2, for any Λ>1. This result enlightens once more the dichotomy Λ(0,1] vs. Λ>1. While for Λ(0,1] problem (1.1) is rigid in itself, and only possesses constant solutions, for Λ>1 we have multiplicity of non-constant solutions, and rigidity results can be recovered only with some extra assumption, such as (1.2).

    Our result is based upon variational methods, and strongly exploits the symmetry of the problem. Roughly speaking, we shall construct solutions to (1.1) such that uv "looks like" a sing changing solution of the Allen-Cahn equation Δw=ww3, with uw+, and vw. The building blocks w in our construction will be both the saddle-type planar solutions (also called "pizza solutions") [5], and the saddle solutions in R2m [7,8].

    We consider the following general version of (1.1):

    {Δu=f(u)Λupvp+1inRNΔv=f(v)Λup+1vpinRNu,v>0inRN,with Λ>0 (1.3)

    where N2, p1, and f is of bistable type; more precisely, let f:RR be a locally Lipschitz continuous and odd nonlinearity. For a value M>0, we define the potential

    F(t)=Mtf(s)ds,

    so that FC1,1(R), and F=f. We suppose that:

    F0=F(±M)in R,andF>0in (M,M). (1.4)

    Note that in this case f(0)=f(±M)=0. F is often called a double well potential, and f is called bistable nonlinearity. A simple example is f(t)=tt3.

    With the above notation, we introduce

    W(s,t)=F(s)+F(t)+Λp+1|s|p+1|t|p+1,(s,t)R2.

    The first of our main result concerns the existence of infinitely many geometrically distinct solutions for problem (1.3) in the plane. We consider polar coordinates (r,θ)[0,+)×[0,2π) in the plane. For any positive integer k, we define:

    Rk, the rotation of angle π/k in counterclockwise sense;

    Rik, the rotation of angle iπ/k in counterclockwise sense, with i=1,,2k;

    0, the line of equation x2=tan(π/2k)x1 in R2;

    i, the line Rik(1), i=1,,k1;

    Ti, the reflection with respect to i;

    αk=tan(π/(2k));

    Sk, the open circular sector {π/(2k)<θ<π/(2k)}={αkx1>|x2|}R2.

    Theorem 1.1 (Saddle-type solutions in the plane). Let p1, fC0,1(R) be odd, and suppose that its primitive F satisfies (1.4). Suppose moreover that:

    infs[0,M]W(s,s)>F(0). (1.5)

    Then, for every positive integer k, there exists a positive solution (uk,vk) to system (1.3) in R2 having the following properties:

    (i) 0<uk,vk<M in R2;

    (ii) vk=ukTi for every i=1,,k, and uk(x1,x2)=uk(x1,x2) in R2;

    (iii) ukvk>0 in Sk.

    Notice in particular that {ukvk=0}=k1i=0i, which implies that (uk,vk)(uj,vj) if jk. Regarding assumption (1.5), we stress that for any bistable f it is satisfied provided that Λ>0 is sufficiently large, and can be explicitly checked in several concrete situations. In particular:

    Corollary 1.2. For every Λ>1, problem (1.1) has infinitely many geometrically distinct non-constant solutions.

    The corollary follows from the theorem, observing that if f(s)=ss3 and p=1, then

    F(s)=(1s2)24,W(s,t)=F(s)+F(t)+Λs2t22;

    thus, condition (1.5) is satisfied if and only if

    infs[0,1]W(s,s)=W(11+Λ,11+Λ)=Λ2(1+Λ)>14=F(0),

    that is, if and only if Λ>1. Notice that, if (1.5) is violated, we have have non-existence of non-constant solutions [9,13], and hence (1.5) is sharp in this case.

    The proof of Theorem 1.1 consists in a 2 steps procedure. At first, we construct a solution to (1.3) in a ball BR with the desired symmetry properties, combining variational methods with an auxiliary parabolic problem. In a second step, we pass to the limit as R+, obtaining convergence to an entire solution of (1.3). Assumption (1.5) enters in this second step in order to rule out the possibility that the limit profile (u,v) is a pair with v=u, with u possibly a constant. Roughly speaking, (1.5) makes the coexistence of u and v in the same region unfavorable with respect to the segregation, from the variational point of view.

    This kind of construction is inspired by [6,11,12], where an analogue strategy was used to prove existence of solutions to

    Δu=uv2,Δv=u2v,u,v>0 in RN. (1.6)

    With respect to [6,12,11], however, the method has to be substantially modified. Solutions to (1.6) "look like" harmonic function in the same way as solutions to (1.3) "look like" solutions to the Allen-Cahn equation. Therefore, tools related with harmonic functions such as monotonicity formulae and blow-up analysis, which were crucially used in [6,12,11], are not available in our context, and have to be replaced by a direct inspection of the variational background. In such an inspection it emerges the role of the competition parameter Λ, which is not present in (1.6) (of course, Λ could be added in front of the coupling on the right hand side in (1.6); but it could be absorbed with a scaling, and hence it would not play any role).

    Remark 1.3. Let us consider the scalar equation Δw+f(w)=0. The existence of a saddle-type (or pizza) solution wk with the properties

    (i) M<wk<M in R2;

    (ii) wkTi=wk for every i=1,,k, and wk(x1,x2)=wk(x1,x2) in R2;

    (iii) wk>0 in Sk.

    was established by Alessio, Calamai and Montecchiari in [5], under slightly stronger assumption on F with respect to those considered here. In some sense, ukvk looks like wk, since they share the same symmetry properties, and for this reason we can call (uk,vk) saddle-type (or pizza) solution.

    Our method for Theorem 1.1 can be easily adapted also in the scalar case, giving an alternative proof for the existence result in [5]. For the sake of completeness, we present the details in the appendix of this paper. The main advantage is that our construction easily gives the following energy estimate

    BR(12|wk|2+F(wk))CR, (1.7)

    with C>0 depending only on k, but not on R. Such estimate seems to be unknown, expect for the case k=2, where it was proved in [7].

    Theorem 1.1 establishes the existence of infinitely many positive solutions to (1.3) in the plane. These can be regarded as solutions also in higher dimension N3, but it is natural to ask whether there exist solutions to (1.3) in RN not coming from solutions in RN1. We can give a positive answer to this question in any even dimension. Let N=2m, and let us consider the Simons cone

    C={xR2m: x21++x2m=x2m+1++x22m}.

    We define two radial variables s and t by

    s=x21++x2m0,t=x2m+1++x22m0. (1.8)

    Theorem 1.4 (Saddle solutions in R2m). Let m2 be a positive integer, p1, fC0,1(R) be odd, and suppose that its primitive F satisfies (1.4). Suppose moreover that (1.5) holds. Then, for every positive integer m, there exists a positive solution (u,v) to system (1.3) in R2m having the following properties:

    (i) 0<u,v<M in R2m;

    (ii) v(s,t)=u(t,s);

    (iii) uv>0 in O={s>t}.

    Notice that {uv=0}=C, and that (u,v) looks like the saddle solution of the scalar Allen-Cahn equation found in [7]. The strategy of the proof is the same as the one of Theorem 1.4. However, the proof of Theorem 1.4 is a bit simpler, since we can take advantage of an energy estimate like (1.7), which is known to hold for saddle solutions in R2m (see formula (1.15) in [7]) but, as already observed, was unknown for saddle-type solutions in the plane.

    Structure of the paper. In Section 2 we prove Theorem 1.1. In Section 3 we prove Theorem 1.4. In the appendix, we give an alternative proof with respect to [5] of the existence of saddle-type solutions for the scalar equation in the plane, yielding to the energy estimate (1.7).

    In this section we prove Theorem 1.1. The existence of a solution in the whole plane R2 will be obtained by approximation with solutions in BR.

    Throughout this section, the positive integer k (index of symmetry) will always be fixed, and hence the dependence of the quantities with respect to k will often be omitted.

    In the sector S=Sk, we define

    wk=min{M,αx1|x2|2},

    where α=αk=tan(π/(2k)). Notice that wk>0 in Sk and wk=0 on Sk. Thus, we can extend wk in the whole of R2 by iterated odd reflections with respect to the lines i. In this way, we obtain a function, still denoted by wk, defined in R2, with

    (i) MwkM in R2;

    (ii) wkTi=wk for every i=1,,k, and wk(x1,x2)=wk(x1,x2) in R2;

    (iii) wk>0 in Sk,

    that is, wk has the same symmetry properties of the saddle-type solutions in [5].

    Now, for any ΩR2 open, and for every (u,v)H1(Ω,R2), we introduce the functional

    J((u,v),Ω):=Ω(12|u|2+12|v|2+W(u,v)). (2.1)

    Moreover, for R>0, we let SR=SkBR and consider the set

    AR:={(u,v)H1(BR,R2)|(u,v)=(w+k,wk) on BR, 0u,vMin BRv=uTi for every i=1,,k,u(x1,x2)=u(x1,x2) in BR, uvin SR, }.

    Notice that AR, since for instance (w+k,wk)AR.

    Lemma 2.1. For every R>0, there exists a solution (uR,vR)AR to

    {Δu=f(u)Λ|u|p1u|v|p+1inBRΔv=f(v)Λ|u|p+1|v|p1vinBRu=w+k,v=wkon BR. (2.2)

    Proof. The proof of the lemma is inspired by [6,Theorem 4.1]. Since the weak convergence in H1 implies the almost everywhere convergence, up to a subsequence, the set AR is weakly closed in H1. Moreover, the functional J(,BR) is clearly bounded from below and weakly lower semi-continuous. Therefore, there exists a minimizer (uR,vR) of J(,BR) in AR. To show that such a minimizer is a solution to (3.2), we consider the auxiliary parabolic problem

    {tUΔU=˜f(U)Λ|U|p1U|V|p+1in (0,+)×BRtVΔV=˜f(V)Λ|U|p+1|V|p1Vin (0,+)×BRU=w+k,V=wkon (0,+)×BR(U(0,),V(0,))AR, (2.3)

    where ˜f:RR is a globally Lipschitz continuous odd function such that ˜f(s)=f(s) for s[M1,M+1]. The existence and uniqueness of a local solution, defined on a maximal time interval [0,T), follow by standard parabolic theory. Notice that

    tUΔU=c1(t,x)U,

    for

    c1(t,x)={Λ|U(t,x)|p1|V(t,x)|p+1+˜f(U(t,x))U(t,x)if U(t,x)00if U(t,x)=0.

    Since ˜f(0)=0, we have that c1 is bounded from above by the Lipschitz constant L of ˜f, and it is not difficult to check that U(t,)0 in BR for every t[0,T): indeed, taking into account the boundary conditions,

    ddt(12BR(U)2)=BRU(tU)=BRU(ΔU+c1(t,x)U)BR|U|2+LBR(U)2LBR(U)2,

    whence it follows that

    ddt(e2LtBR(U)2)0.

    Therefore, the non-negativity of U(t,) for t(0,T) follows from the non-negativity of U(0,). The same argument also shows that V(t,)0 for every such t. Using the positivity of U, it is not difficult to prove that U is also uniformly bounded from above: since ˜f(M)=0, we have

    t(MU)Δ(MU)c2(t,x)(MU),

    where c2 is the bounded function

    c2(t,x)={˜f(U(t,x))˜f(M)U(t,x)Mif U(t,x)00if U(t,x)=M,

    and the same argument used above implies that 0UM on (0,T)×BR. Similarly, 0VM. As a consequence, the solution (U,V) can be globally continued in time on (0,+). Furthermore, in (2.3) we can replace ˜f with f, since they coincide on [M1,M+1].

    We also observe that, since U is constant in time on BR, the energy of the solution is non-increasing:

    ddtJ((U(t,),V(t,));BR)=BRUUt+VVt+1W(U,V)Ut+2W(U,V)Vt=BR(ΔU+1W(U,V))Ut+(ΔV+2W(U,V))Vt=BRU2t+V2t0. (2.4)

    As in [6], we can now show that AR is positively invariant under the parabolic flow. Let (U,V) be a solution with initial datum in AR. By the symmetry of (2.3), we have that (V(t,Tix),U(t,Tix)) is still a solution. By the symmetry of initial and boundary data, and by uniqueness, such solution must coincide with (U(t,),V(t,)). This means in particular that V(t,x)=U(t,Tix). Likewise, U(t,x1,x2)=U(t,x1,x2). Notice that the symmetries imply that UV=0 on Sk. Thus, recalling that SR=SkBR, we have

    {t(UV)Δ(UV)=c(t,x)(UV)in (0,+)×SRUV0on (0,+)×SRUV0on {0}×SR, (2.5)

    where the bounded function c is defined by

    c(t,x)={f(U(t,x))f(V(t,x))U(t,x)V(t,x)+ΛUp(t,x)Vp(t,x)if U(t,x)V(t,x)ΛUp(t,x)Vp(t,x)if U(t,x)=V(t,x).

    The parabolic maximum principle implies that UV in SR globally in time, and, in turn, this gives the invariance of AR.

    At this point we consider the solution (UR,VR) to (2.3) with initial datum (uR,vR), minimizer of J(,BR) in AR. By minimality in AR and by (2.4), we have

    J((uR,vR);BR)J((UR(t,),VR(t,));BR)J((uR,vR);BR)U2t+V2t0,

    and hence URuR and VRvR. But then (uR(x),vR(x)) is a (stationary) solution of the parabolic problem (2.3), that is, it solves the stationary problem (2.2), and in addition (uR,vR)AR. This completes the proof.

    We are ready to complete the:

    Proof of Theorem 1.1. First, of all, we discuss the convergence of {(uR,vR):R>1}. Let ρ>1. Since 0uR,vRM, we have that

    |ΔuR(x)|maxs[0,M]|f(s)|+ΛM2p+1,|ΔvR(x)|maxs[0,M]|f(s)|+ΛM2p+1.

    Thus interior Lp estimates (see e.g. [10,Chapter 9]), applied in balls of radius 2 centered in points of ¯Bρ with p>N, and the Morrey embedding theorem, imply that there exists C>0 depending only on M and Λ (but independent of R and ρ) such that

    uRC1,α(¯Bρ)+vRC1,α(¯Bρ)Cin Bρ, for all R>ρ+2 (2.6)

    (for every 0<α<1). By the Ascoli-Arzelà theorem, up to a subsequence {(uR,vR)} converges in C1,α(¯Bρ) to a solution in Bρ, for every 0<α<1. Taking a sequence ρ+, a diagonal selection finally gives (uR,vR)(u,v) in C1,αloc(R2), up to a subsequence, with (u,v) solution to

    {Δu=f(u)Λupvp+1in R2Δv=f(v)Λup+1vpin R20u,vMin R2.

    Notice that, by convergence, (u,v) satisfies the symmetry property (ii) in Theorem 1.1, and moreover uv0 in Sk. As in (2.5), for any ρ>0

    {Δ(uv)=c(x)(uv)in Sρuv0in Sρ,

    for a bounded function c. Thus, the strong maximum principle implies that either u>v in Sρ, of uv in Sρ. Since ρ>0 is arbitrarily chosen, we have that either u>v in S, of uv in S. We claim that the latter alternative cannot take place. To prove this claim, we use a comparison argument similar as the one by Cabré and Terra in [7] for the construction of the saddle solution for scalar bystable equations. First of all, we observe that, by symmetry, any function in AR is determined only by its restriction on Sk. Thus the minimality of (uR,vR) can be read as

    J((uR,vR),SR)J((u,v),SR)(u,v)AR.

    Let 1<ρ<R2, and let ξ be a radial smooth cut-off function with ξ1 in Bρ1, ξ0 in Bcρ, 0ξ1. We define

    φR(x)=ξ(x)w+k(x)+(1ξ(x))uR(x)=ξ(x)min{M,αx1|x2|2}+(1ξ(x))uR(x),

    and

    ψR(x)=ξ(x)wk(x)+(1ξ(x))vR(x)=(1ξ(x))vR(x),

    where we recall that α=tan(π/(2k)). It is immediate to verify that (φR,ψR) is an admissible competitor for (uR,vR) on SR. Moreover, by (2.6), there exists C>0 such that

    φRW1,(Bρ)+ψRW1,(Bρ)CR>ρ+2. (2.7)

    By minimality

    J((uR,vR),SR)J((φR,ψR),SR),

    and since (φR,ψR)=(uR,vR) in SRSρ we deduce that

    J((uR,vR),Sρ)J((φR,ψR),Sρ)J((φR,0),Sρ1)+C|SρSρ1| (2.8)

    where we used the global boundedness of {(φR,ψR)} in W1,(Bρ), see (2.7). The last term can be easily computed as

    |SρSρ1|=πk(ρ2(ρ1)2)2πkρ.

    For the first term, recalling that F(M)=0, ξ1 in Bρ1, and wk>0 in Sk, we have

    Sρ1(12|φR|2+F(φR)+F(0))=Sρ1{αx1|x2|<2M}(12|wk|2+F(wk))+Sρ1F(0)C|Sρ1{αx1|x2|<2M}|+F(0)|Sρ1|.

    The set

    Sk{αx1|x2|<2M}

    is contained in the (non-disjoint) union of the two strips

    {αx12M<x2<αx1, x1>0}{αx1<x2<2Mαx1, x1>0}=S1S2.

    Therefore,

    |Sρ1{αx1|x2|<2M}||S1{0<x1<ρ}|+|S2{0<x1<ρ}|=2ρ0(αx12M+αx11dx2)dx1=22Mρ.

    Coming back to (2.8), we conclude that there exists a constant C>0 such that, for every ρ>1 and R>ρ+2,

    J((uR,vR),Sρ)Cρ+F(0)|Sρ1|

    for every 1<ρ<R2, where C>0 is a positive constant independent of both ρ and R. Passing to the limit as R+, we infer by C1loc-convergence that

    J((u,v),Sρ)Cρ+F(0)|Sρ1| (2.9)

    for every ρ>1. Notice that, in this estimate, the leading term as ρ+ is

    F(0)|Sρ1|πkF(0)ρ2.

    Suppose now by contradiction that uv in Sk. Recalling that 0u,vM, we have that

    J((u,v),Sρ)=Sρ|u|2+W(u,u)Sρmins[0,M]W(s,s)=mins[0,M]W(s,s)|Sρ|πkmins[0,M]W(s,s)ρ2

    as ρ+. Comparing with (2.9), we obtain a contradiction for large ρ, thanks to assumption (1.5). Therefore, u>v in Sk. Since u=v on Sk, we also infer that both u and v cannot be constant. The maximum principle implies then that u,v>0 in R2, and from this it is not difficult to deduce that u,v<M: indeed, if u(x0)=M, then x0 is a strict maximum point for u with

    Δu(x0)=f(M)+ΛMpv(x0)p+1=ΛMpv(x0)p+1>0,

    which is not possible. This completes the proof.

    The proof of Theorem 1.4 follows the same strategy as the one of Theorem 1.1, being actually a bit simpler. Let m2 be a positive integer. By [7,Theorem 1.3]*, under our assumption (1.4) on F the Allen-Cahn equation Δw+f(w)=0 in R2m admits a saddle solution wm, that is a solution satisfying:

    *For the existence and the energy estimate in the theorem, it is sufficient that f is locally Lipschitz, rather than C1

    (i) w depends only on the variables s and t defined in (1.8);

    (ii) wm(s,t)=wm(t,s);

    (iii) wm>0 in O={s>t}.

    In addition, |wm|<M in R2m, and

    BR12|wm|2+F(wm)CR2m1for all R>1, (3.1)

    Now, as in Section 2, we consider the energy functional J((u,v),Ω) defined in (2.1) (in this section ΩR2m), and the set

    AR:={(u,v)H1(BR,R2)|(u,v)=(w+m,wm) on BR,v(s,t)=u(t,s),uvin OR, 0u,vMin BR},

    where OR=OBR.

    Lemma 3.1. For every R>0, there exists a solution (uR,vR)AR to

    {Δu=f(u)Λ|u|p1u|v|p+1inBRΔv=f(v)Λ|u|p+1|v|p1vinBRu=w+m,v=wmon BR. (3.2)

    The proof is analogue to the one of Lemma 2.1, and is omitted.

    Proof of Theorem 1.4. As in the 2-dimensional case, we can prove that up to a subsequence (uR,vR)(u,v) in C1,αloc(R2) as R+, with (u,v) solution to

    {Δu=f(u)Λupvp+1Δv=f(v)Λup+1vp0u,vMin R2m.

    By convergence, v(s,t)=u(t,s), uv0 in O, and 0u,vM in R2m. Also, for every ρ>0

    {Δ(uv)=c(x)(uv)in Oρuv0in Oρ,

    for a bounded function c. Thus, the strong maximum principle implies that either u>v in O, of uv in O. We claim that the latter alternative cannot take place. Let 1<ρ<R2, and let ξ be a radial smooth cut-off function with ξ1 in Bρ1, ξ0 in Bcρ, 0ξ1. We define

    φR=ξw+m+(1ξ)uR,ψR=ξwm+(1ξ)vR.

    This is an admissible competitor in AR, which coincides with (uR,vR) on BRBρ. Therefore, by minimality and recalling (3.1), we have

    J((uR,vR),Bρ)J((w+m,wm),Bρ1)+C|BρBρ1|E(wm,Bρ1)+Bρ1F(0)+Cρ2m1Cρ2m1+F(0)|Bρ1|. (3.3)

    If, by contradiction, uv in O, then we have that

    J((u,v),Bρ)=Bρ|u|2+W(u,u)Bρminσ[0,M]W(σ,σ)=minσ[0,M]W(σ,σ)|Bρ|.

    Comparing with (2.9), we obtain a contradiction for large ρ, thanks to assumption (1.5). Thus, u>v in O, and the conclusion of the proof is straightforward.

    In this appendix we consider the scalar Allen-Cahn equation

    Δw=f(w)in R2, (A.1)

    and we prove the following result:

    Theorem A.1. Let fC0,α(R) be odd, and suppose that its anti-primitive F satisfies (1.4). Then, for every kN, there exists a solution wk having the following properties:

    (i) M<wk<M in R2;

    (ii) wkTi=wk for every i=1,,k, and wk(x1,x2)=wk(x1,x2) in R2;

    (iii) wk>0 in Sk.

    Moreover, there exists a constant C>0 (possibly depending on k) such that

    BR(12|w|2+F(w))CRfor every R>0. (A.2)

    Remark A.2. The existence of a solution wk with the properties (i)–(iii) was established by Alessio, Calamai and Montecchiari in [5]. In [5] the authors also obtained a more precise description of the asymptotic behavior of wk at infinity. On the other hand, the validity of the estimate (A.2) was unknown.

    In order to show that wk fulfills (A.2), we provide an alternative existence proof with respect to the one in [5]. It is tempting to conjecture that the solutions given by Theorem A.1, and those found in [5], coincide.

    Our alternative proof is strongly inspired by [7], where Cabré and Terra proved existence of solutions in R2m to (A.1) vanishing on the Simon's cone (when restricted to the case m=1 - i.e., when we consider (A.1) in the plane - their result establishes the existence of the solution w2). We first prove the existence of a solution wR=wk,R to (A.1) in the ball BR, for every R>0, by variational argument. Passing in a suitable way to the limit as R+, we shall obtain a solution in the whole plane R2 having the desired energy estimate.

    The main simplification with respect to the proof of Theorem 1.1 stays in the fact that, dealing with a single equation, we will not need an auxiliary parabolic problem, but we will be able to prove the existence of a solution in BR with the desired symmetry properties directly by variational methods.

    The proof of Theorem A.1 takes the rest of this appendix. Let us fix k. For any ΩR2 open, and for every wH1(Ω), we define

    E(w,Ω):=Ω(12|w|2+F(w)).

    For R>0, we consider SR:=BRSk and the set

    HR:={wH10(SR):w(x1,x2)=w(x1,x2) a.e. in SR}.

    Lemma A.3. For every R>0, problem

    {Δw=f(w)in BRw(x1,x2)=w(x1,x2)in BRw=0on BR, (A.3)

    has a solution wR, satisfying (ii) in Theorem A.1. Moreover, MwRM in BR, wR0 in SR, and

    E(wR,SR)=min{E(w,SR): wHR}.

    Proof. At first, we search a solution to the auxiliary problem

    {Δw=f(w)in SRwH10(SR),w0in SRw(x1,x2)=w(x1,x2)in SR, (A.4)

    by minimizing the function E(w,SR) in H. The existence of a minimizer follows easily by the direct method of the calculus of variations. Since E(w,SR)=E(|w|,SR), it is not restrictive to suppose that wR0. Also, since E(min{w,M},SR)E(w,SR) by assumption (1.4), we can suppose that wRM. Clearly, wR solves the first equation in (A.4) in the set SR{θ=0}. The fact that wR is also a solution across SR{θ=0} (thus a solution in SR) follows by the principle of symmetric criticality (see e.g., [14,Theorem 1.28] for a simple proof of this result, sufficient to our purposes).

    Notice that wRC1({0<r<R,π/2kθπ/2k}) by standard elliptic regularity. Thus, we can reflect wR 2k times in an odd way across 1,,k, obtaining a solution in BR{0}. To see that wR is in fact a solution in BR, we take a smooth function ηδC(¯BR) with ηδ0 in Bδ, ηδ1 in B2δBδ, and |ηδ|C/δ in BR. Then, for every φCc(BR), we have

    BRwR(φηδ)BRf(wR)φηδ=0,

    since φηδ is an admissible test function in BR{0}. Passing to the limit as δ0+, we deduce that

    BRwRφBRf(wR)φ=0φCc(BR),

    that is, wR is a weak solution to (A.1) in BR. This completes the proof.

    Proof of Theorem A.1. We wish to pass to the limit as R+ and obtain a solution in the whole plane R2 as limit of the family {wR}. As in the previous sections, by elliptic estimates we have that, up to a subsequence wRw in C1,αloc(R2) as R, for every α(0,1). The limit w inherits by wR the symmetry property (ii) in Theorem A.1. Moreover, w0 in the sector S=Sk, and |w|M in the whole plane R2. Actually, the strict inequality |w|<M holds, by the strong maximum principle. To complete the proof of the theorem, it remains then to show that w satisfies estimate (A.2), and that w0.

    As in the proof of Theorem 1.1, {wR} has a uniform gradient bound: there exists C>0 (independent of R) such that

    wRL(BR1)CR>1. (A.5)

    For an arbitrary ρ>1, let now R>ρ+2, and let ξCc(Bρ), with ξ1 in Bρ1. We consider the following competitor for wR:

    φR(x)=ξ(x)min{αx1|x2|2,M}+(1ξ(x))wR(x).

    Notice that this is the same type of competitor we used in Theorem 1.1. By minimality

    E(wR,SR)E(φR,SR),

    and since wR=φR in SRSρ we deduce that

    Sρ(12|wR|2+F(wR))Sρ(12|φR|2+F(φR))Sρ1(12|φR|2+F(φR))+C|SρSρ1|, (A.6)

    where we used the global boundedness of {φR} in W1,(Bρ), see (A.5). At this point we can proceed as in the conclusion of the proof of Theorem 1.1: the right hand side in (A.6) can be estimated by Cρ, with C independent of ρ. Thus, we conclude that there exists a constant C>0 such that, for every ρ>1 and R>ρ+2,

    E(wR,Sρ)=Sρ(12|wR|2+F(wR))Cρ,

    Passing to the limit as R+, we infer by C1loc-convergence that

    E(w,Sρ)Cρ,

    which implies, by symmetry, the estimate (A.2).

    Suppose finally that w0. Then the energy estimate (A.2) would give for every ρ>1

    πF(0)ρ2=E(0,Bρ)Cρ,

    which is not possible if ρ is sufficiently large. This proves that w0, and completes the proof of Theorem A.1.

    The author declares no conflict of interest.



    [1] Rahaman, M.S., Ahsan, M.M., Anjum, N., Rahman, M.M. and Rahman, M.N., The AI Race Is On! Google's Bard and Openai's Chatgpt Head to Head: An Opinion Article. SSRN Electronic Journal, 2023. https://doi.org/10.2139/ssrn.4351785 doi: 10.2139/ssrn.4351785
    [2] Teubner, T., Flath, C.M., Weinhardt, C., van der Aalst, W. and Hinz, O., Welcome to the Era of ChatGPT et al. the prospects of large language models. Business & Information Systems Engineering, 2023, 65(2): 95–101. https://doi.org/10.1007/s12599-023-00795-x doi: 10.1007/s12599-023-00795-x
    [3] Gilson, A., Safranek, C.W., Huang, T., Socrates, V., Chi, L., Taylor, R.A., et al., How Does ChatGPT Perform on the United States Medical Licensing Examination? The Implications of Large Language Models for Medical Education and Knowledge Assessment. JMIR Medical Education, 2023, 9(1): e45312. https://doi.org/10.2196/45312 doi: 10.2196/45312
    [4] Chan, C.K.Y. and Tsi, L.H.Y., The AI Revolution in Education: Will AI Replace or Assist Teachers in Higher Education? arXiv preprint arXiv: 2305.01185, 2023.
    [5] Dergaa, I., Chamari, K., Zmijewski, P. and Saad, H.B., From Human Writing to Artificial Intelligence Generated Text: Examining the Prospects and Potential Threats of ChatGPT in Academic Writing. Biology of Sport, 2013, 40(2): 615–622. https://doi.org/10.5114/biolsport.2023.125623 doi: 10.5114/biolsport.2023.125623
    [6] Haleem, A., Javaid, M. and Singh, R.P., An Era of ChatGPT as a Significant Futuristic Support Tool: A Study on Features, Abilities, and Challenges. BenchCouncil Transactions on Benchmarks, Standards and Evaluations, 2023, 2(4): 100089. https://doi.org/10.1016/j.tbench.2023.100089 doi: 10.1016/j.tbench.2023.100089
    [7] Chan, C.K.Y., Is AI Changing the Rules of Academic Misconduct? An In-Depth Look at Students' Perceptions of 'AI-Giarism.' arXiv preprint arXiv: 2306.03358, 2023.
    [8] Frosio, G., The Artificial Creatives: The Rise of Combinatorial Creativity from Dall-E to GPT-3. Handbook of Artificial Intelligence at Work: Interconnections and Policy Implications (Edward Elgar, Forthcoming), 2023. https://doi.org/10.2139/ssrn.4350802 doi: 10.2139/ssrn.4350802
    [9] Meskó, B. and Topol, E.J., The Imperative for Regulatory Oversight of Large Language Models (or Generative AI) in Healthcare. Npj Digital Medicine, 2023, 6(1): 1–6. https://doi.org/10.1038/s41746-023-00873-0 doi: 10.1038/s41746-023-00873-0
    [10] Ahmad, N., Murugesan, S. and Kshetri, N., Generative Artificial Intelligence and the Education Sector. Computer, 2023, 56(6): 72–76. https://doi.org/10.1109/mc.2023.3263576 doi: 10.1109/mc.2023.3263576
    [11] Murugesan, S. and Cherukuri, A.K., The Rise of Generative Artificial Intelligence and Its Impact on Education: The Promises and Perils. Computer, 2023, 56(5): 116–121. https://doi.org/10.1109/mc.2023.3253292 doi: 10.1109/mc.2023.3253292
    [12] Baidoo-Anu, D. and Ansah, L.O., Education in the Era of Generative Artificial Intelligence (AI): Understanding the Potential Benefits of ChatGPT in Promoting Teaching and Learning. Journal of AI, 2023, 7(1): 52–62. https://doi.org/10.61969/jai.1337500 doi: 10.61969/jai.1337500
    [13] Lodge, J.M., Thompson, K. and Corrin, L., Mapping out a Research Agenda for Generative Artificial Intelligence in Tertiary Education. Australasian Journal of Educational Technology, 2023, 39(1): 1–8. https://doi.org/10.14742/ajet.8695 doi: 10.14742/ajet.8695
    [14] Lim, W.M., Gunasekara, A., Pallant, J.L., Pallant, J.I. and Pechenkina, E., Generative AI and the Future of Education: Ragnarök or Reformation? A Paradoxical Perspective from Management Educators. The International Journal of Management Education, 2023, 21(2): 100790. https://doi.org/10.1016/j.ijme.2023.100790 doi: 10.1016/j.ijme.2023.100790
    [15] Eysenbach, G., The Role of ChatGPT, Generative Language Models and Artificial Intelligence in Medical Education: A Conversation with ChatGPT - and a Call for Papers (Preprint). JMIR Medical Education, 2023, 9(1): e46885. https://doi.org/10.2196/46885 doi: 10.2196/46885
    [16] Su, J. and Yang, W., Unlocking the Power of ChatGPT: A Framework for Applying Generative AI in Education. ECNU Review of Education, 2023, 6(3): 209653112311684. https://doi.org/10.1177/20965311231168423 doi: 10.1177/20965311231168423
    [17] Cooper, G., Examining Science Education in ChatGPT: An Exploratory Study of Generative Artificial Intelligence. Journal of Science Education and Technology, 2023, 32(3): 444–452. https://doi.org/10.1007/s10956-023-10039-y doi: 10.1007/s10956-023-10039-y
    [18] Chan, C.K.Y. and Lee, K.K.W., The AI Generation Gap: Are Gen Z Students More Interested in Adopting Generative AI such as ChatGPT in Teaching and Learning than Their Gen X and Millennial Generation Teachers? arXiv Preprint arXiv: 2305.02878, 2023.
    [19] Gupte, T., Watts, F.M., Schmidt-McCormack, J.A., Zaimi, I., Gere, A.R. and Shultz, G.V., Students' Meaningful Learning Experiences from Participating in Organic Chemistry Writing-To-Learn Activities. Chemistry Education Research and Practice, 2021, 22(2): 396–414. https://doi.org/10.1039/D0RP00266F doi: 10.1039/D0RP00266F
    [20] Lim, J. and Polio, C., Multimodal Assignments in Higher Education: Implications for Multimodal Writing Tasks for L2 Writers. Journal of Second Language Writing, 2020, 47: 100713. https://doi.org/10.1016/j.jslw.2020.100713 doi: 10.1016/j.jslw.2020.100713
    [21] Tavares, D., Lopes, A.I., Castro, C., Maia, G., Leite, L. and Quintas, M., The Intersection of Artificial Intelligence, Telemedicine, and Neurophysiology. Handbook of Research on Instructional Technologies in Health Education and Allied Disciplines, 2023,130–152. https://doi.org/10.4018/978-1-6684-7164-7.ch006 doi: 10.4018/978-1-6684-7164-7.ch006
    [22] Dao, X.Q., Performance Comparison of Large Language Models on VNHSGE English Dataset: OpenAI ChatGPT, Microsoft Bing Chat, and Google Bard. arXiv Preprint arXiv: 2307.02288, 2023.
    [23] Rahaman, M.S., Ahsan, M.M.T., Anjum, N., Terano, H.J.R. and Rahman, M.M., From ChatGPT-3 to GPT-4: A Significant Advancement in AI-Driven NLP Tools. Journal of Engineering and Emerging Technologies, 2023, 2(1): 1–11. https://doi.org/10.52631/jeet.v1i1.188 doi: 10.52631/jeet.v1i1.188
    [24] Ray, P.P., Web3: A Comprehensive Review on Background, Technologies, Applications, Zero-Trust Architectures, Challenges and Future Directions. Internet of Things and Cyber-Physical Systems, 2023. https://doi.org/10.1016/j.iotcps.2023.05.003 doi: 10.1016/j.iotcps.2023.05.003
    [25] Mondal, S., Das, S. and Vrana, V.G., How to Bell the Cat? A Theoretical Review of Generative Artificial Intelligence towards Digital Disruption in All Walks of Life. Technologies, 2023, 11(2): 44. https://doi.org/10.3390/technologies11020044 doi: 10.3390/technologies11020044
    [26] Chen, L., Chen, P. and Lin, Z., Artificial Intelligence in Education: A Review. IEEE Access, 2020, 8: 75264–75278. https://doi.org/10.1109/ACCESS.2020.2988510 doi: 10.1109/ACCESS.2020.2988510
    [27] Kumar, P., Chauhan, S. and Awasthi, L.K., Artificial Intelligence in Healthcare: Review, Ethics, Trust Challenges & Future Research Directions. Engineering Applications of Artificial Intelligence, 2023,120: 105894. https://doi.org/10.1016/j.engappai.2023.105894 doi: 10.1016/j.engappai.2023.105894
    [28] Zastudil, C., Rogalska, M., Kapp, C., Vaughn, J. and MacNeil, S., Generative AI in Computing Education: Perspectives of Students and Instructors. arXiv preprint arXiv: 2308.04309, 2023.
    [29] Jony, A.I., Rahman, M.S. and Islam, Y.M., ICT in Higher Education: Wiki-Based Reflection to Promote Deeper Thinking Levels. International Journal of Modern Education and Computer Science, 2017, 9(4): 43–49. https://doi.org/10.5815/ijmecs.2017.04.05 doi: 10.5815/ijmecs.2017.04.05
    [30] Alasadi, E.A. and Baiz, C.A., Generative AI in Education and Research: Opportunities, Concerns, and Solutions. Journal of Chemical Education, 2023,100(8): 2965–2971. https://doi.org/10.1021/acs.jchemed.3c00323 doi: 10.1021/acs.jchemed.3c00323
    [31] Macfarlane, B., Zhang, J. and Pun, A., Academic Integrity: A Review of the Literature. Studies in Higher Education, 2012, 39(2): 339–358. https://doi.org/10.1080/03075079.2012.709495 doi: 10.1080/03075079.2012.709495
    [32] Dalalah, D. and Dalalah, O.M.A., The False Positives and False Negatives of Generative AI Detection Tools in Education and Academic Research: The Case of ChatGPT. The International Journal of Management Education, 2023, 21(2): 100822. https://doi.org/10.1016/j.ijme.2023.100822 doi: 10.1016/j.ijme.2023.100822
    [33] Chaudhry, I.S., Sarwary, S.A.M., EI Refae, G.A. and Chabchoub, H., Time to Revisit Existing Student's Performance Evaluation Approach in Higher Education Sector in a New Era of ChatGPT — A Case Study. Cogent Education, 2023, 10(1): 2210461. https://doi.org/10.1080/2331186x.2023.2210461 doi: 10.1080/2331186x.2023.2210461
    [34] Humphry T. and Fuller, A.L., Potential ChatGPT Use in Undergraduate Chemistry Laboratories. Journal of Chemical Education, 2023,100: 1434–1436. https://doi.org/10.1021/acs.jchemed.3c00006 doi: 10.1021/acs.jchemed.3c00006
    [35] Konecki, M., Konecki, M. and Biškupić, I., Using Artificial Intelligence in Higher Education. Proceedings of the 15th International Conference on Computer Supported Education, 2023. https://doi.org/10.5220/0012039700003470 doi: 10.5220/0012039700003470
    [36] Dai, Y., Liu, A. and Lim, C.P., Reconceptualizing ChatGPT and generative AI as a student-driven innovation in higher education. 2023.
    [37] Dwivedi, Y.K., Kshetri, N., Hughes, L., Slade, E.L., Jeyaraj, A., Kar, A.K., et al., "So What If ChatGPT Wrote It?" Multidisciplinary Perspectives on Opportunities, Challenges and Implications of Generative Conversational AI for Research, Practice and Policy. International Journal of Information Management, 2023, 71: 102642. https://doi.org/10.1016/j.ijinfomgt.2023.102642 doi: 10.1016/j.ijinfomgt.2023.102642
    [38] Wach, K., Doanh, D.C., Ejdys, J., Kazlauskaitė, R., Korzynski, P., Mazurek, G., et al., The Dark Side of Generative Artificial Intelligence: A Critical Analysis of Controversies and Risks of ChatGPT. Entrepreneurial Business and Economics Review, 2023, 11(2): 7–30. https://doi.org/10.15678/eber.2023.110201 doi: 10.15678/eber.2023.110201
    [39] Ferrara, E., Should ChatGPT Be Biased? Challenges and Risks of Bias in Large Language Models. arXiv preprint arXiv: 2304.03738, 2023.
  • This article has been cited by:

    1. Zongzhang Huang, Qigu Yao, Jianping Zhu, Ying He, Yanghao Chen, Feng Wu, Teng Hua, Efficacy and safety of transjugular intrahepatic portosystemic shunt (TIPS) created using covered stents of different diameters: A systematic review and meta-analysis, 2020, 22115684, 10.1016/j.diii.2020.11.004
    2. Saba Mehrabanifar, Saeed Hesami-Tackallou, Salar Vaseghi, Mohammad Nasehi, The effect of crocin on cholestasis-induced spatial memory impairment with respect to the expression level of TFAM and PGC-1α and activity of catalase and superoxide dismutase in the hippocampus, 2023, 0885-7490, 10.1007/s11011-023-01176-9
    3. Rafaela Pinto Coelho Santos, Eliana Cristina de Brito Toscano, Milene Alvarenga Rachid, Anti-inflammatory strategies for hepatic encephalopathy: preclinical studies, 2023, 81, 0004-282X, 656, 10.1055/s-0043-1767819
    4. Sara A. Hosny, Alshaymaa M. Abdelmenem, Taha Azouz, Samaa S. Kamar, Asmaa M. ShamsEldeen, Asmaa A. El-Shafei, Beneficial Effect of Erythropoietin on Ameliorating Propionic Acid-Induced Autistic-Like Features in Young Rats, 2023, 56, 0044-5991, 77, 10.1267/ahc.23-00027
    5. Ali Sepehrinezhad, Ali Shahbazi, 2024, Chapter 5, 978-0-85466-392-7, 10.5772/intechopen.1004125
    6. Zeynab Pirmoradi, Mohsen Nakhaie, Hoda Ranjbar, Davood Kalantar-Neyestanaki, Kristi A. Kohlmeier, Majid Asadi-Shekaari, Amin Hassanshahi, Mohammad Shabani, Resveratrol and 1,25-dihydroxyvitamin D decrease Lingo-1 levels, and improve behavior in harmaline-induced Essential tremor, suggesting potential therapeutic benefits, 2024, 14, 2045-2322, 10.1038/s41598-024-60518-4
    7. Faezeh Kouhakan, Sepideh Ganjalikhan, Alireza Sarhadizadeh, Khadijeh Esmaeilpour, Khatereh Akbari, Leila Jafaripour, Majid Asadi-Shekaari, Oleuropein can Protect the Brain Against Deleterious Effects of Bile Duct Ligation in Male Mice, 2024, 08, 25734407, 1, 10.21926/obm.neurobiol.2402218
  • Author's biography Shakib Sadat Shanto is an undergraduate currently studying Bachelor of Science in Computer Science and Engineering at American International University-Bangladesh. He is extremely passionate about AI and Data Science domain. His current research interests include AI, Educational Technology, Natural Language Processing and Cybersecurity; Zishan Ahmed is an enthusiastic undergraduate pursuing a Bachelor of Science in Computer Science and Engineering. He is captivated by the potential of data to alter the world we live in. In data science, natural language processing, and machine learning, he sees the greatest potential for innovation and influence. His knack for mathematics and programming has been refined throughout his academic career. He is well-versed in programming languages and is always keen to acquire new tools and technologies. His current research interests include AI, Educational Technology, Natural Language Processing, and computer vision; Dr. Akinul Islam Jony is currently working as an Associate Professor of Computer Science at American International University-Bangladesh. His current research interests include AI, machine learning, e-Learning, educational technology, cybersecurity, and issues in software engineering
    Reader Comments
  • © 2023 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(4099) PDF downloads(248) Cited by(19)

Figures and Tables

Figures(3)  /  Tables(2)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog