
Citation: Qing Wu, Chunjiang Zhang, Mengya Zhang, Fajun Yang, Liang Gao. A modified comprehensive learning particle swarm optimizer and its application in cylindricity error evaluation problem[J]. Mathematical Biosciences and Engineering, 2019, 16(3): 1190-1209. doi: 10.3934/mbe.2019057
[1] | Yuxin Li, Jizheng Yi, Huanyu Chen, Duanxiang Peng . Theory and application of artificial intelligence in financial industry. Data Science in Finance and Economics, 2021, 1(2): 96-116. doi: 10.3934/DSFE.2021006 |
[2] | Yueh-Hsia Huang, Lan Sun, Tyng-Bin Ger . An analysis of enterprise resource planning systems and key determinants using the Delphi method and an analytic hierarchy process. Data Science in Finance and Economics, 2023, 3(2): 166-183. doi: 10.3934/DSFE.2023010 |
[3] | Sami Mestiri . Credit scoring using machine learning and deep Learning-Based models. Data Science in Finance and Economics, 2024, 4(2): 236-248. doi: 10.3934/DSFE.2024009 |
[4] | Cui Yin Huang, Hong Liang Dai . Learning from class-imbalanced data: review of data driven methods and algorithm driven methods. Data Science in Finance and Economics, 2021, 1(1): 21-36. doi: 10.3934/DSFE.2021002 |
[5] | Kazuo Sano . Intelligence and global bias in the stock market. Data Science in Finance and Economics, 2023, 3(2): 184-195. doi: 10.3934/DSFE.2023011 |
[6] | Dachen Sheng, Opale Guyot . Market power, internal and external monitoring, and firm distress in the Chinese market. Data Science in Finance and Economics, 2024, 4(2): 285-308. doi: 10.3934/DSFE.2024012 |
[7] | Habib Zouaoui, Meryem-Nadjat Naas . Option pricing using deep learning approach based on LSTM-GRU neural networks: Case of London stock exchange. Data Science in Finance and Economics, 2023, 3(3): 267-284. doi: 10.3934/DSFE.2023016 |
[8] | Lindani Dube, Tanja Verster . Enhancing classification performance in imbalanced datasets: A comparative analysis of machine learning models. Data Science in Finance and Economics, 2023, 3(4): 354-379. doi: 10.3934/DSFE.2023021 |
[9] | Ming Li, Ying Li . Research on crude oil price forecasting based on computational intelligence. Data Science in Finance and Economics, 2023, 3(3): 251-266. doi: 10.3934/DSFE.2023015 |
[10] | Ehsan Ahmadi, Parastoo Mohammadi, Farimah Mokhatab Rafei, Shib Sankar Sana . Behavioral factors and capital structure: identification and prioritization of influential factors. Data Science in Finance and Economics, 2025, 5(1): 76-104. doi: 10.3934/DSFE.2025005 |
The construction of discrete fractional sums and differences from the knowledge of samples of their corresponding continuous integrals and derivatives arises in the context of discrete fractional calculus; see [1,2,3,4,5,6] for more details. Recently, discrete fractional operators with more general forms of their kernels and properties have gathered attention in both areas of physics and mathematics; see [7,8,9,10].
In discrete fractional calculus theory, we say that F is monotonically increasing at a time step t if the nabla of F is non-negative, i.e., (∇F)(t):=F(t)−F(t−1)≥0 for each t in the time scale set Nc0+1:={c0+1,c0+2,…}. Moreover, the function F is θ−monotonically increasing (or decreasing) on Nc0 if F(t+1)>θF(t)(orF(t+1)<θF(t)) for each t∈Na). In [11,12] the authors considered 1−monotonicity analysis for standard discrete Riemann-Liouville fractional differences defined on N0 and in [13] the authors generalized the above by introducing θ−monotonicity increasing and decreasing functions and then obtained some θ−monotonicity analysis results for discrete Riemann-Liouville fractional differences defined on N0. In [14,15,16], the authors considered monotonicity and positivity analysis for discrete Caputo, Caputo-Fabrizio and Attangana-Baleanu fractional differences and in [17,18] the authors considered monotonicity and positivity results for abstract convolution equations that could be specialized to yield new insights into qualitative properties of fractional difference operators. In [19], the authors presented positivity and monotonicity results for discrete Caputo-Fabrizo fractional operators which cover both the sequential and non-sequential cases, and showed both similarities and dissimilarities between the exponential kernel case (that is included in Caputo-Fabrizo fractional operators) and fractional differences with other types of kernels. Also in [20] the authors extended the results in [19] to discrete Attangana-Baleanu fractional differences with Mittag-Leffler kernels. The main theoretical developments of monotonicity and positivity analysis in discrete fractional calculus can be found in [21,22,23,24] for nabla differences, and in [25,26,27,28] for delta differences.
The main idea in this article is to analyse discrete Caputo-Fabrizo fractional differences with exponential kernels in the Riemann-Liouville sense. The results are based on a notable lemma combined with summation techniques. The purpose of this article is two-fold. First we show the positiveness of discrete fractional operators from a theoretical point of view. Second we shall complement the theoretical results numerically and graphically based on the standard plots and heat map plots.
The plan of the article is as follows. In Section 2 we present discrete fractional operators and the main lemma. Section 3 analyses the discrete fractional operator in a theoretical sense. In Section 4 we discuss our theoretical strategy on standard plots (Subsection 4.1) and heat map plots (Subsection 4.2). Finally, in Section 5 we summarize our findings.
First we recall the definitions in discrete fractional calculus; see [2,3,5] for more information.
Definition 2.1. (see [2,Definition 2.24]). Let c0∈R, 0<θ≤1, F be defined on Nc0 and Λ(θ)>0 be a normalization constant. Then the following operator
(CFRc0∇θF)(t):=Λ(θ)∇tt∑r=c0+1F(r)(1−θ)t−r{t∈Nc0+1}, |
is called the discrete Caputo-Fabrizio fractional operator with exponential kernels in the Riemann-Liouville sense CFR, and the following operator
(CFCc0∇θF)(t):=Λ(θ)t∑r=c0+1(∇rF)(r)(1−θ)t−r{t∈Nc0+1}, |
is called the discrete Caputo-Fabrizo fractional operator with exponential kernels in the Caputo sense CFC.
Definition 2.2 (see [3]). For F:Nc0−κ→R with κ<θ≤κ+1 and κ∈N0, the discrete nabla CFC and CFR fractional differences can be expressed as follows:
(CFCc0∇θF)(t)=(CFCc0∇θ−κ∇κF)(t), |
and
(CFRc0∇θF)(t)=(CFRc0∇θ−κ∇κF)(t), |
respectively, for each t∈Nc0+1.
The following lemma is essential later.
Lemma 2.1. Assume that F is defined on Nc0 and 1<θ<2. Then the CFR fractional difference is
(CFRc0∇θF)(t)=Λ(θ−1){(∇F)(t)+(1−θ)(2−θ)t−c0−2(∇F)(c0+1)+(1−θ)t−1∑r=c0+2(∇rF)(r)(2−θ)t−r−1}, |
for each t∈Nc0+2.
Proof. From Definitions 2.1 and 2.2, the following can be deduced for 1<θ<2:
(CFRc0∇θF)(t)=Λ(θ−1){t∑r=c0+1(∇rF)(r)(2−θ)t−r−t−1∑r=c0+1(∇rF)(r)(2−θ)t−r−1}=Λ(θ−1){(∇F)(t)+t−1∑r=c0+1(∇rF)(r)[(2−θ)t−r−(2−θ)t−r−1]}=Λ(θ−1){(∇F)(t)+(1−θ)(2−θ)t−c0−2(∇F)(c0+1)+(1−θ)t−1∑r=c0+2(∇rF)(r)(2−θ)t−r−1}, |
for each t∈Nc0+2.
In the following theorem, we will show that F is monotonically increasing at two time steps even if (CFRc0∇θF)(t) is negative at the two time steps.
Theorem 3.1. Let the function F be defined on Nc0+1, and let 1<θ<2 and ϵ>0. Assume that
(CFRc0∇θF)(t)>−ϵΛ(θ−1)(∇F)(c0+1)fort∈{c0+2,c0+3}s.t.(∇F)(c0+1)≥0. | (3.1) |
If (1−θ)(2−θ)<−ϵ, then (∇F)(c0+2) and (∇F)(c0+3) are both nonnegative.
Proof. From Lemma 2.1 and condition (3.1) we have
(∇F)(t)≥−(∇F)(c0+1)[(1−θ)(2−θ)t−c0−2+ϵ]−(1−θ)t−1∑r=c0+2(∇rF)(r)(2−θ)t−r−1, | (3.2) |
for each t∈Nc0+2. At t=c0+2, we have
(∇F)(c0+2)≥−(∇F)(c0+1)[(1−θ)+ϵ]−(1−θ)c0+1∑r=c0+2(∇rF)(r)(2−θ)c0+1−r⏟=0≥0, |
where we have used (1−θ)<(1−θ)(2−θ)<−ϵ and (∇F)(c0+1)≥0 by assumption. At t=c0+3, it follows from (3.2) that
(∇F)(c0+3)=−(∇F)(c0+1)[(1−θ)(2−θ)+ϵ]−(1−θ)c0+2∑r=c0+2(∇rF)(r)(2−θ)c0+2−r=−(∇F)(c0+1)⏟≥0[(1−θ)(2−θ)+ϵ]⏟<0−(1−θ)⏟<0(∇F)(c0+2)⏟≥0≥0, | (3.3) |
as required. Hence the proof is completed.
Remark 3.1. It worth mentioning that Figure 1 shows the graph of θ↦(1−θ)(2−θ) for θ∈(1,2).
In order for Theorem 3.1 to be applicable, the allowable range of ϵ is ϵ∈(0,−(2−θ)(1−θ)) for a fixed θ∈(1,2)
Now, we can define the set Hκ,ϵ as follows
Hκ,ϵ:={θ∈(1,2):(1−θ)(2−θ)κ−c0−2<−ϵ}⊆(1,2),∀κ∈Nc0+3. |
The following lemma shows that the collection {Hκ,ϵ}∞κ=c0+1 forms a nested collection of decreasing sets for each ϵ>0.
Lemma 3.1. Let 1<θ<2. Then, for each ϵ>0 and κ∈Nc0+3 we have that Hκ+1,ϵ⊆Hκ,ϵ.
Proof. Let θ∈Hκ+1,ϵ for some fixed but arbitrary κ∈Nc0+3 and ϵ>0. Then we have
(1−θ)(2−θ)κ−c0−1=(1−θ)(2−θ)(2−θ)κ−c0−2<−ϵ. |
Considering 1<θ<2 and κ∈Nc0+3, we have 0<2−θ<1. Consequently, we have
(1−θ)(2−θ)κ−c0−2<−ϵ⋅ 12−θ⏟>1<−ϵ. |
This implies that θ∈Hκ,ϵ, and thus Hκ+1,ϵ⊆Hκ,ϵ.
Now, Theorem 3.1 and Lemma 3.1 lead to the following corollary.
Corollary 3.1. Let F be a function defined on Nc0+1, θ∈(1,2) and
(CFRc0∇θF)(t)>−ϵΛ(θ−1)(∇F)(c0+1)suchthat(∇F)(c0+1)≥0, | (3.4) |
for each t∈Nsc0+3:={c0+3,c0+4,…,s} and some s∈Nc0+3. If θ∈Hs,ϵ, then we have (∇F)(t)≥0 for each t∈Nsc0+1.
Proof. From the assumption θ∈Hs,ϵ and Lemma 3.1, we have
θ∈Hs,ϵ=Hs,ϵ∩s−1⋂κ=c0+3Hκ,ϵ. |
This leads to
(1−θ)(2−θ)t−c0−2<−ϵ, | (3.5) |
for each t∈Nsc0+3.
Now we use the induction process. First for t=c0+3 we obtain (∇F)(c0+3)≥0 directly as in Theorem 3.1 by considering inequalities (Eq 3.4) and (Eq 3.5) together with the given assumption (∇F)(c0+1)≥0. As a result, we can inductively iterate inequality (Eq 3.2) to get
(∇F)(t)≥0, |
for each t∈Nsc0+2. Moreover, (∇F)(c0+1)≥0 by assumption. Thus, (∇F)(t)≥0 for each t∈Nsc0+1 as desired.
In this section, we consider the methodology for the positivity of ∇F based on previous observations in Theorem 3.1 and Corollary 3.1 in such a way that the initial conditions are known. Later, we will illustrate other parts of our article via standard plots and heat maps for different values of θ and ϵ. The computations in this section were performed with MATLAB software.
Example 4.1. Considering Lemma 1 with t:=c0+3:
(CFRc0∇θF)(c0+3)=Λ(θ−1){(∇F)(c0+3)+(1−θ)(2−θ)(∇F)(c0+1)+(1−θ)c0+2∑r=c0+2(∇rF)(r)(2−θ)c0+2−r}. |
For c0=0, it follows that
(CFR0∇θF)(3)=Λ(θ−1){(∇F)(3)+(1−θ)(2−θ)(∇F)(1)+(1−θ)2∑r=2(∇rF)(r)(2−θ)2−r}=Λ(θ−1){(∇F)(3)+(1−θ)(2−θ)(∇F)(1)+(1−θ)(∇F)(2)}=Λ(θ−1){F(3)−F(2)+(1−θ)(2−θ)[F(1)−F(0)]+(1−θ)[F(2)−F(1)]}. |
If we take θ=1.99,F(0)=0,F(1)=1,F(2)=1.001,F(3)=1.005, and ϵ=0.007, we have
(CFR0∇1.99F)(3)=Λ(0.99){0.004+(−0.99)(0.01)(0)+(−0.99)(0.001)}=−0.0069Λ(0.99)>−0.007Λ(0.99)=−ϵΛ(0.99)(∇F)(1). |
In addition, we see that (1−θ)(2−θ)=−0.0099<−0.007=−ϵ. Since the required conditions are satisfied, Theorem 3.1 ensures that (∇F)(3)>0.
In Figure 2, the sets Hκ,0.008 and Hκ,0.004 are shown for different values of κ, respectively in Figure 2a, b. It is noted that Hκ,0.008 and Hκ,0.004 decrease by increasing the values of κ. Moreover, in Figure 2a, the set Hκ,0.008 becomes empty for κ≥45; however, in Figure 2b, we observe the non-emptiness of the set Hκ,0.004 for many larger values of κ up to 90. We think that the measures of Hκ,0.008 and Hκ,0.004 are not symmetrically distributed when κ increases (see Figure 2a, b). We do not have a good conceptual explanation for why this symmetric behavior is observed. In fact, it is not clear why the discrete nabla fractional difference CFRc0∇θ seems to give monotonically when θ→1 rather than for θ→2, specifically, it gives a maximal information when θ is very close to 1 as ϵ→0+.
In the next figure (Figure 3), we have chosen a smaller ϵ (ϵ=0.001), we see that the set Hκ,0.001 is non-empty for κ>320. This tells us that small choices in ϵ give us a more widely applicable result.
In this part, we introduce the set Hκ:={κ:θ∈Hκ,ϵ} to simulate our main theoretical findings for the cardinality of the set Hκ via heat maps in Figure 4a–d. In these figures: we mean the warm colors such as red ones and the cool colors such as blue ones. Moreover, the θ values are on the x−axis and ϵ values are on the y−axis. We choose ϵ in the interval [0.00001, 0.0001]. Then, the conclusion of these figures are as follows:
● In Figure 4a when θ∈(1,2) and Figure 4b when θ∈(1,1.5), we observe that the warmer colors are somewhat skewed toward θ very close to 1, and the cooler colors cover the rest of the figures for θ above 1.05.
● In Figure 4c, d, the warmest colors move strongly towards the lower values of θ, especially, when θ∈(1,1.05). Furthermore, when as θ increases to up to 1.0368, it drops sharply from magenta to cyan, which implies a sharp decrease in the cardinality of Hκ for a small values of ϵ as in the interval [0.00001, 0.0001].
On the other hand, for larger values of ϵ, the set Hκ will tend to be empty even if we select a smaller θ in such an interval (1,1.05). See the following Figure 5a, b for more.
In conclusion, from Figures 4 and 5, we see that: For a smaller value of ϵ, the set Hκ,ϵ tends to remain non-empty (see Figure 4), unlike for a larger value of ϵ (see Figure 5). Furthermore, these verify that Corollary 3.1 will be more applicable for 1<θ<1.05 and 0.01<ϵ<0.1 as shown in Figure 4d.
Although, our numerical data strongly note the sensitivity of the set Hκ when slight increasing in ϵ is observed for θ close to 2 compares with θ close to 1.
In this paper we developed a positivity method for analysing discrete fractional operators of Riemann-Liouville type based on exponential kernels. In our work we have found that (∇F)(3)≥0 when (CFRc0∇θF)(t)>−ϵΛ(θ−1)(∇F)(c0+1) such that (∇F)(c0+1)≥0 and ϵ>0. We continue to extend this result for each value of t in Nsc0+1 as we have done in Corollary 3.1.
In addition we presented standard plots and heat map plots for the discrete problem that is solved numerically. Two of the graphs are standard plots for Hκ,ϵ for different values of κ and ϵ (see Figure 2), and the other six graphs consider the cardinality of Hκ for different values of ϵ and θ (see Figures 4 and 5). These graphs ensure the validity of our theoretical results.
In the future we hope to apply our method to other types of discrete fractional operators which include Mittag-Leffler and their extensions in kernels; see for example [5,6].
This work was supported by the Taif University Researchers Supporting Project Number (TURSP-2020/86), Taif University, Taif, Saudi Arabia.
The authors declare there is no conflict of interest.
[1] | S. Krikpatrick, C. D. Gelatt and M. Vecchi, Optimization by simulated annealing, Science., 220 (1983), 671–680. |
[2] | J. H. Holland, Genetic algorithms and the optimal allocation of trials, Siam. J. Comput., 2 (1973), 88–105. |
[3] | R. Eberhart and J. Kennedy, A new optimizer using particle swarm theory, In: Micro Machine and Human Science, 1995. MHS'95., Proceedings of the Sixth International Symposium on IEEE, 39–43. |
[4] | R. Storn and K. Price, Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces, J. Global. Optim., 11 (1997), 341–359. |
[5] | Y. Z. Zhou, W. C. Yi and L. Gao, et al., Adaptive differential evolution with sorting crossover rate for continuous optimization problems, IEEE T. Cy., 47 (2017), 2742–2753. |
[6] | M. Dorigo, M. Birattari and T. Stutzle, Ant colony optimization: artificial ants as a computational intelligence technique, IEEE. Comput. Intell. Mag., 1 (2006), 28–39. |
[7] | S. Birbil and S. C. Fang, An electromagnetism-like mechanism for global optimization, J. Global. Optim., 25 (2003), 263–282. |
[8] | W. Gong, Z. Cai and D. Liang, Engineering optimization by means of an improved constrained differential evolution, Comput. Method. Appl. M., 268 (2014), 884–904. |
[9] | Q. Wu, L. Gao and X. Y. Li, et al., Applying an electromagnetism-like mechanism algorithm on parameters optimization of a multi-pass milling process, Int. J. Prod. Res., 51 (2012), 1777–1788. |
[10] | C. Zhang, Q. Lin and L. Gao, et al., Backtracking Search Algorithm with three constraint handling methods for constrained optimization problems, Expert. Syst. Appl., 42 (2015), 7831–7845. |
[11] | X. Y. Li, L. Gao and Q. K. Pan, et al., An effective hybrid genetic algorithm and variable neighborhood search for integrated process planning and scheduling in a packaging machine workshop, IEEE. T. Syst. Man. Cy. A. |
[12] | X. Y. Li, C. Lu and L. Gao, et al., An Effective Multi-Objective Algorithm for Energy Efficient Scheduling in a Real-Life Welding Shop, IEEE T. Ind. Inform., 14 (2018), 5400–5409. |
[13] | X. Y. Li and L. Gao, An Effective Hybrid Genetic Algorithm and Tabu Search for Flexible Job Shop Scheduling Problem, Int. J. Prod. Econ., 174 (2016), 93–110. |
[14] | V. Vassiliadis and G. Dounias, Nature–inspired intelligence: a review of selected methods and applications. Int. J. Artif. Intell. T., 18 (2009), 487–516. |
[15] | Shi Y, Eberhart R, A modified particle swarm optimizer, In: Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence., 69–73. |
[16] | J. Kennedy and R. Mendes, Population structure and particle swarm performance, In: Evolutionary Computation, 2002. CEC'02. Proceedings of the 2002 Congress on IEEE, 2 (2002) 1671–1676. |
[17] | R. Mendes, J. Kennedy and J. Neves, The fully informed particle swarm: Simpler, maybe better, IEEE T. Evolut. Comput., 8 (2004), 204–210. |
[18] | Parsopoulos K E, Vrahatis M N, UPSO – a unified particle swarm optimization scheme, Lecture Series on Computational Sciences, 1 (2004), 868–873. |
[19] | J. J. Liang, A. K. Qin and P. N. Suganthan, et al., Comprehensive learning particle swarm optimizer for global optimization of multimodal functions, IEEE T. Evolut. Comput., 10 (2006), 281–295. |
[20] | Y. Shi, H. Liu and L. Gao, et al., Cellular particle swarm optimization, Inform. Sci., 181 (2011), 4460–4493. |
[21] | W. H. Lim and N. A. M. Isa., Adaptive division of labor particle swarm optimization, Expert. Syst. Appl., 42 (2015), 5887–5903. |
[22] | Y. Peng and B. Lu, A hierarchical particle swarm optimizer with latin sampling based memetic algorithm for numerical optimization, Appl. Soft. Comput., 13 (2013), 2823–2836. |
[23] | Ş. Gülcü and H. Kodaz, A novel parallel multi-swarm algorithm based on comprehensive learning particle swarm optimization, Eng. Appl. Artif. Intel., 45 (2015), 33–45. |
[24] | Y. Bao, Z. Hu and T. Xiong, A PSO and pattern search based memetic algorithm for SVMs parameters optimization, Neurocomputing, 117 (2013), 98–106. |
[25] | Y. G. Petalas, K. E. Parsopoulos and M. N. Vrahatis, Memetic particle swarm optimization, Ann. Oper. Res., 156 (2007), 99–127. |
[26] | D. Jia, G. Zheng and B. Qu, et al., A hybrid particle swarm optimization algorithm for high-dimensional problems, Comput. Ind. Eng., 61 (2011), 1117–1122. |
[27] | G. Wu, D. Qiu and Y. Yu, et al., Superior solution guided particle swarm optimization combined with local search techniques, Expert. Syst. Appl., 41 (2014), 7536–7548. |
[28] | M. D. McKay, R. J. Beckman and W. J. Conover, Comparison of three methods for selecting values of input variables in the analysis of output from a computer code, Technometrics, 21 (1979), 239–245. |
[29] | Z. Zhao, J. Yang and Z. Hu, et al., A differential evolution algorithm with self-adaptive strategy and control parameters based on symmetric Latin hypercube design for unconstrained optimization problems, Eur. J. Oper. Res., 250 (2016), 30–45. |
[30] | R. Ferrari, D. Froio and E. Rizzi, et al., Model updating of a historic concrete bridge by sensitivity- and global optimization-based Latin Hypercube Sampling, Eng. Struct., 179 (2019), 139–160. |
[31] | X. Zhang, X. Jiang and P. J. Scott, A reliable method of minimum zone evaluation of cylindricity and conicity from coordinate measurement data, Precis. Eng., 35 (2011), 484–489. |
[32] | H. Lin and Y. Peng, Evaluation of cylindricity error based on an improved GA with uniform initial population, In: Control, Automation and Systems Engineering, 2009. CASE 2009. IITA International Conference on IEEE, 311–314. |
[33] | J. Mao, Y. Cao and J. Yang, Implementation uncertainty evaluation of cylindricity errors based on geometrical product specification (GPS), Measurement, 42 (2009), 742–747. |
[34] | M. Clerc and J. Kennedy, The particle swarm-explosion, stability, and convergence in a multidimensional complex space, IEEE T. Evolut. Comput., 6 (2002), 58–73. |
[35] | T. Peram, K. Veeramachaneni and C. K. Mohan, Fitness-distance-ratio based particle swarm optimization, In: Proceedings of Swarm Intelligence Symposium, (2003), 174–181. |
[36] | F. Van den Bergh and A. P. Engelbrecht, A cooperative approach to particle swarm optimization, IEEE T. Evolut. Comput., 8 (2004), 225–239. |
[37] | K. Carr and P. Ferreira, Verification of form tolerances part II: Cylindricity and straightness of a median line, Precis. Eng., 17 (1995), 144–156. |
[38] | X. Wen and A. Song, An improved genetic algorithm for planar and spatial straightness error evaluation, Int. J. Mach. Tool. Manu., 43 (2003), 1157–1162. |
1. | Jinhong Wang, Yanting Xu, Factors influencing the transition of China's economic growth momentum, 2024, 6, 2689-3010, 220, 10.3934/NAR.2024010 | |
2. | Barış Armutcu, Ahmet Tan, Shirie Pui Shan Ho, Matthew Yau Choi Chow, Kimberly C. Gleason, The effect of bank artificial intelligence on consumer purchase intentions, 2024, 0368-492X, 10.1108/K-01-2024-0145 | |
3. | Ayse Basak Cinar, Stephane Bilodeau, Incorporating AI into the Inner Circle of Emotional Intelligence for Sustainability, 2024, 16, 2071-1050, 6648, 10.3390/su16156648 | |
4. | Murali Mohana Kumara Varma Mantena, Giri Murugan, 2025, 3281, 0094-243X, 020031, 10.1063/5.0247131 | |
5. | Ahuod Hameed Alsubhi, Emad Sami Jaha, Front-to-Side Hard and Soft Biometrics for Augmented Zero-Shot Side Face Recognition, 2025, 25, 1424-8220, 1638, 10.3390/s25061638 | |
6. | Hui Qi, Yue Liu, Hanzi Chen, Pierre Failler, The Impact of Enterprise Digitalization on Green Total Factor Productivity: Evidence from Chinese Provinces, 2025, 17, 2071-1050, 3707, 10.3390/su17083707 |