Periodic solutions of Cohen-Grossberg-type Bi-directional associative memory neural networks with neutral delays and impulses

1.   Introduction

The computationally relative simple interval type-2 fuzzy sets (IT2 FSs) are currently the most commonly used T2 FSs. Therefore, interval type-2 fuzzy logic systems (IT2 FLSs ^[1,2,57]) based on IT2 FSs have superior ability to cope with uncertainties environments like power systems ^[3], permanent magnetic drive ^[4,5,6], intelligent controllers ^[7], medical systems ^[8], pattern recognition systems ^[9], database and information systems ^[10] and so on. The footprint of uncertainty (FOU) of an IT2 FS ^[11] make it own more design degrees of freedom compared with a T1 FS. Generally speaking, a T2 FLS (see Figure 1) is composed of fuzzifier, rules, inference, type-reducer and defuzzifier. Among which, the block of type-reduction plays the central role of transforming the T2 to the T1 FS. Finally the defuzzification changes the T1 FS to the crisp output.

In the past decades, many types of type-reduction (TR) were proposed gradually. Among which, the most famous one is the Karnik-Mendel (KM) algorithms ^[13]. This type of algorithms has the advantages of preserving the uncertainties flow between the upper and lower membership functions (MFs) of T2 FLSs. Then the continuous KM (CKM) algorithms ^[14] were put forward, in addition, the monotoncity and super convergence property of them were proved. For the sake of improving the calculation efficiency, Wu and Mendel proposed the enhanced KM (EKM) algorithms ^[15]. Extensive simulation experiments show that the EKM algorithms can save two iterations on average compared with the KM algorithms. Then Liu et al. gave the theoretical explanations for the initialization of EKM algorithms and extended the EKM algorithms to three different forms of weighted-based EKM (WEKM) algorithms ^[16,17] to calculate the more accurate centroids of type-2 fuzzy sets.

However, the iterative natures of KM types of algorithms make the applications of corresponding IT2 FLSs more challenge. Therefore, other types of noniterative algorithms ^[18] are proposed gradually, and they are Nagar-Bardini (NB) algorithms ^[19], Nie-Tan (NT) algorithms ^[20], Begian-Melek-Mendel (BMM) algorithms ^[21,22] and so on. Among which, IT2 FLSs based on the NB algorithms are proved to have superior performances to respond to the affect of uncertainties in systems’ parameters to the IT2 FLSs according to other algorithms like EKM, BMM, Greenfield-Chiclana Collapsing Defuzzifier (GCCD ^[24]) and Wu-Mendel Uncertainty Bound (UB ^[24]). Moreover, Nie-Tan (NT) algorithms have the simple closed form. Recent studies prove that the continuous NT (CNT) algorithms ^[20] to be accurate algorithms to calculate the centroid of IT2 FSs. In addition, BMM algorithms ^[18] are proved to be more generalized forms of NB and NT algorithms. All these works have laid theoretical foundations for studying the TR of T2 FLSs.

In order to obtain more accurate centroid TR of IT2 FLSs, this paper extends the NB, NT, and BMM algorithms to the corresponding WNB, WNT, and WBMM algorithms according to the Newton-Cotes quadrature formulas. The rest of this paper is organized as follows. Section 2 introduces the background of IT2 FLSs. Section 3 provides the Newton-Cotes formulas, the weighted-based noniterative algorithms, and how to adopt them to perform the centroid TR of IT2 FLSs. Section 4 gives four computer simulation examples to illustrate the performances of weighted-based noniterative algorithms. Finally Section 5 is the conclusions and expectations.

2.   IT2 FLSs

Definition 1. A T2 FS $\tilde{A}$ can be characterized by its T2 MF ${\mu }_{\tilde{A}}(x, u)$, i.e.,

where the primary variable $x\in X$, the secondary variable $u\in [0, 1]$, here Eq (1) is called as the point-value expression, whose compact form is as:

Definition 2. The secondary MF of $\tilde{A}$ is a vertical slice of ${\mu }_{\tilde{A}}(x, u)$, i.e.,

Definition 3. The two dimensional support of ${\mu }_{\tilde{A}}(x, u)$ is referred to as the footprint of uncertainty (FOU) of $\tilde{A}$, i.e.,

The upper and lower bounds of $\text{FOU}(\tilde{A})$ are called as the upper MF (UMF) and lower MF (LMF), respectively, i.e.,

Because the secondary membership grades of IT2 FSs are all uniformly equal to 1, i.e., ${f}_{x}(u)\equiv 1$, every IT2 FS can be completely described by its UMF and LMF. Then the vertical slices representation of $\tilde{A}$ can be as:

Here ${\mu }_{\tilde{A}}(x)$ can be denoted as $\tilde{A}(x)$ for simplicity.

Definition 4. An embedded T1 FS ${A}_{e}$ depends on ${\mu }_{\tilde{A}}(x, u)$, i.e.,

Definition 5. An IT2 FS can be considered as the union of all its embedded T2 FSs ${\tilde{A}}_{e}^{j}$, i.e.,

where $m$ denotes the number of embedded T2 FSs, ${\tilde{A}}_{e}^{j} = 1/{A}_{e}^{j}$, and Eq (8) is referred to as the wavy slices representation ^[28] of $\tilde{A}$.

From the aspect of inference structure, IT2 FLSs can usually be divided into two categories: Mamdani type ^{[3,6,12,18,25]} and Takagi-Sugeno-Kang type ^[4,25,26,27]. Without loss of generality, here we consider a Mamdani IT2 FLS with $n$ inputs ${x}_{1}\in {X}_{1}, \cdots {x}_{n}\in {X}_{n}$ and one output $y\in Y$. The IT2 FLS can be characterized by $M$ fuzzy rules, where the $sth$ fuzzy rule is of the form:

in which ${\tilde{F}}_{i}^{s}(i = 1, \cdots , n;s = 1, \cdots , M)$ is the antecedent IT2 FS, and ${\tilde{G}}^{s}(s = 1, \cdots , M)$ is the consequent IT2 FS.

For simplicity, here we use the singleton fuzzifier, i.e., the input measurements are modeled as crisp sets (type-0 FSs). As $x = {x}^{\prime }$, the firing interval of each fuzzy rule is computed as:

where $T$ denotes the minimum or product t-norm, and ${\underline {f}}^{s}({x}^{\prime })$ and ${\overline{f}}^{s}({x}^{\prime })$ are the left and right end points of the firing interval, respectively.

As for the centroid TR, we combine the firing interval of each rule with its consequent IT2 FS to obtain the fired-rule output FS ${\tilde{B}}^{l}$(which can be described by its FOU):

where $\ast$ represents the minimum or product t-norm.

Then the output IT2 FS $\tilde{B}$ can be obtained by agammaegating all the fired-rule output FSs as :

where $\vee$ denotes the maximum operation.

Finally the type-reduced set ${Y}_{C}({x}^{\prime })$ can be obtained by computing the centroid of $\tilde{B}$, i.e.,

where the two end points ${l}_{\tilde{B}}({x}^{\prime })$ and ${r}_{\tilde{B}}({x}^{\prime })$ can be calculated by different types of TR algorithms ^{[13,14,15,16,17,18,19,20,21,22,23,24,29]}.

3.   Weighted-based noniterative algorithms

Before introducing the weighted-based noniterative algorithms, we first give the preliminary knowledge: Newton-Cotes quadrature formulas ^[16,30].

3.1.   Newton-Cotes quadrature formulas

Generally speaking, the numerical integration is an approach that approximates the definite integral ${\displaystyle {\int }_{a}^{b}f(x)dx}$ according to the functional value $f({x}_{i})$ on some certain discrete points. Therefore, the calculation of definite integral can be ascribed to computing functional values.

Definition 6. (Quadrature formula ^{[16,17,46,47]}) Let the discrete points satisfy that $a = {x}_{0}<{x}_{1}<{x}_{2}<\cdots <{x}_{N} = b$, and the definite integral ${\displaystyle {\int }_{a}^{b}f(x)dx = Q(f)+E(f)}$with the property:

then Eq (14) is referred to as the numerical integration or quadrature formula, where $E(f)$ is called as the remainder or truncation error of integration, ${\left\{{w}_{i}\right\}}_{i = 0}^{N}$ is called as the weight coefficient, and ${\left\{{x}_{i}\right\}}_{i = 0}^{N}$ is the integration node.

Next, the composite trapezoidal rule, composite Simpson rule, and composite Simpson 3/8 rule to adopted to approximate $f(x)$ as the straight line, quadratic polynomial function, and cubic polynomial function, respectively.

Theorem 1. (Composite trapezoidal rule ^{[16,17,46,47]}) Let $y = f\left( x \right)$ be a function defined on $[a,b]$. Divide the interval $[a,b]$ into $N$ subintervals $\left\{ {{x_{i = 1}},{x_i}} \right\}_{i = 1}^N$ with the equidistance $h = \frac{{b - a}}{N}$, where the equidistance node is as ${x_i} = {x_0} + ih\left( {i = 0,1, \cdots ,N} \right)$, then the numerical approximation of definite integral with the composite trapezoidal rule is as

Suppose that $f$ be second order continuous differentiable on $[a, b]$, then the remainder ${E}_{T}(f, h) = -\frac{(b-a){f}^{″}(\zeta )}{12}{h}^{2}$, where $\zeta \in (a, b)$.

Theorem 2. (Composite Simpson rule ^{[16,17,46,47]}) Let $y = f\left( x \right)$ be a function defined on $[a,b]$. Divide the interval $[a,b]$ into $2N$ subintervals $\left\{ {{x_{i = 1}},{x_i}} \right\}_{i = 1}^{2N}$ with the equidistance $h = \frac{{b - a}}{{2N}}$, where the equidistance node is as ${x_i} = {x_0} + ih\left( {i = 0,1, \cdots ,2N} \right)$, then the numerical approximation of definite integral with the composite Simpson rule is as

Suppose that $f$ be fourth order continuous differentiable on $[a, b]$, then the remainder ${E}_{S}(f, h) = -\frac{(b-a){f}^{(4)}(\zeta )}{180}{h}^{4}$, where $\zeta \in (a, b)$.

Theorem 3. (Composite Simpson 3/8 rule ^{[16,17,46,47]}) Let $y = f\left( x \right)$ be a function defined on $[a,b]$. Divide the interval $[a,b]$ into $3N$ subintervals $\left\{ {{x_{i = 1}},{x_i}} \right\}_{i = 1}^{3N}$ with the equidistance $h = \frac{{b - a}}{{3N}}$, where the equidistance node is as ${x_i} = {x_0} + ih\left( {i = 0,1, \cdots ,3N} \right)$, then the numerical approximation of definite integral with the composite Simpson 3/8 rule is as

Suppose that $f$ be fourth order continuous differentiable on $[a, b]$, then the remainder ${E}_{SC}(f, h) = -\frac{(b-a){f}^{(4)}(\zeta )}{80}{h}^{4}$, where $\zeta \in (a, b)$.

Here all the integrals are measured in the Lebesgue sense.

3.2.   Weighted-based noniterative algorithms

3.2.1.   Weighted Nagar-Bardini algorithms

IT2 FLSs based on the closed form of Nagar-Bardini (NB) algorithms ^[19,46,47] can make distinctly improvement on coping with uncertainties. For the centroid output IT2 FS $\tilde{B}$, suppose that the primary variable $y$ be equally discretized into $N$ points, i.e., ${y}_{1}<{y}_{2}<\cdots <{y}_{N}$, then the left and right centroid interval can be computed as:

Then the defuzzified output can be obtained as:

Similar to the continuous KM types of algorithms ^{[13,14,15,16,17,31]}, the continuous NB (CNB) algorithms can be adopted for studying the theoretical property of centroid TR and defuzzification of IT2 FLSs.

Let $a = {y}_{1}<y{}_{2}<\cdots <{y}_{N} = b$, where $a$ and $b$ are the left and right end point of $y$, respectively, then the CNB algorithms calculate the centroids as:

Here the output centroid two end points can be computed without iterations. Furthermore, the output is a linear combination of the output of two T1 FLSs: one constructed from the LMFs, and the other constructed from the UMFs.

In this section, we propose a type of weighted NB (WNB) algorithms, i.e.,

WNB algorithms can be considered as the numerical implementation of CNB algorithms. Comparing Eqs (18) and (20), it is found that the CNB and NB algorithms are very similar, i.e., the sum operations in the discrete version are transformed into the definite integral operations in the continuous version, i.e., the sum operations for the sampling points ${y}_{i}$ play the role of integrating for the integrand.

According to the quadrature formula (see Eq (14)), the corresponding weights ${w}_{i}$ for every MF of sampling points ${y}_{i}$ can be assigned appropriately, then the more accurate computational results may be obtained. Actually, many types of weights assignment method can be used. However, this paper only considers the numerical integration methods based on the Composite trapezoidal rule, Composite Simpson rule, and Composite Simpson 3/8 rule in Newton-Cotes quadrature formulas. And the corresponding WNB algorithms are referred to as the TWNB, SWNB, and S3/8WNB algorithms, respectively. Table 1 provides the weights assignment approach for the three types of weighted-based noniterative algorithms.

3.2.2.   Weighted Nie-Tan algorithms

The closed form of discrete Nie-Tan (NT) algorithms can compute the centroid output of $\tilde{B}$ straightly as:

Most recent studies prove the continuous NT (CNT) algorithms ^[20] to be an accurate method for computing the centroids of IT2 FSs, i.e.,

This section proposes a type of weighted NT (WNT) algorithms, i.e.,

WNT algorithms can be viewed as the numerical implementation of CNT algorithms. The sum operations in the discrete NT algorithms are transformed into the definite integral operations in the continuous NT (CNT) algorithms, i.e., the sum operations for the sampling points ${y}_{i}$ act as integrating for the integrand. Therefore, we can assign weights for every MF of sampling points ${y}_{i}$ to try to obtain more accurate computational results. Here the corresponding WNT algorithms are referred to as the TWNT, SWNT, and S3/8WNT algorithms, respectively.

3.2.3.   Weighted Begian-Melek-Mendel algorithms

Begian-Melek-Mendel (BMM) algorithms can also obtain the output of IT2 FLSs directly, i.e.,

where $\alpha$ and $\beta$ are two adjustable coefficients.

IT2 FLSs based on BMM algorithms ^[13,21,22] are superior to T1 FLSs counterparts on both robustness and stability. In addition, the BMM algorithms are more generalized form of NB and NT algorithms. Observing the Eqs (19) and (25), it can be found that BMM and NB algorithms are exactly the same while $\alpha = {\alpha }_{NB} = \frac{1}{2}$, and $\beta = {\beta }_{NB} = \frac{1}{2}$. For the NT algorithms, the Eq (22) can be simply transformed to:

in which

Comparing the Eqs (25) and (26), it can be found that, as $\alpha = {\alpha }_{NT}$ and $\beta = {\beta }_{NT}$, BMM and NT algorithms become the same.

Continuous BMM (CBMM) algorithms can also be used for studying the theoretical properties of TR of IT2 FLSs, i.e.,

Based on the quadrature formula, this section gives a type of weighted BMM (WBMM) algorithms, i.e.,

Here WBMM algorithms can be considered as the numerical implementation of CBMM algorithms. Comparing Eqs (25) and (28), it is found that the CBMM and BMM algorithms are very similar, i.e., the sum operations in the discrete version are transformed into the definite integral operations in the continuous version, i.e., the sum operations for the sampling points ${y}_{i}$ play the role of integrating for the integrand. This paper considers the numerical integration methods based on the Composite trapezoidal rule, Composite Simpson rule, and Composite Simpson 3/8 rule in Newton-Cotes quadrature formulas. And the corresponding WBMM algorithms are referred to as the TWBMM, SWBMM, and S3/8WBMM algorithms, respectively.

For the above three types of weighed-based noniterative algorithms (see Table 1), suppose that the primary variable be the letter $x$, and $x$ is uniformly sampled on$[a, b]$, i.e., ${x}_{i} = a+\frac{i-1}{N-1}(b-a)$, $i = 1, \cdots , N$, and mod represents the modular arithmetic.

Next we can make conclusions about assigning weights for three types of weighted-based noniterative algorithms as:

1) Substitute ${x}_{i}(i = 0, 1, \cdots , N)$, ${x}_{0} = a$, ${x}_{N} = b$ in Eq (15), ${x}_{i}(i = 0, 1, \cdots , 2N)$, ${x}_{0} = a$, ${x}_{2N} = b$ in Eq (16), and ${x}_{i}(i = 0, 1, \cdots , 3N)$, ${x}_{0} = a$, ${x}_{3N} = b$ in Eq (17) all by ${x}_{i}(i = 1, \cdots , N)$, ${x}_{1} = a$, ${x}_{N} = b$.

2) The coefficients $h/2$，$h/3$，$3h/8$ in Eqs (15)-(17) can be cancelled straightly by the quotient of two definite integrals.

3) In Tables 1–3, for the TWNB, TWNT, TWBMM, and SWNB, SWNT, SWBMM algorithms, the weights are assigned as $1/2$ of the right of Eqs (15) and (16); while for the S3/8WNB, S3/8WNT, and S3/8WBMM algorithms, the weighted are assigned as $1/3$ of the right of Eq (17).

4) In Tables 1–3, for the SWNB, SWNT, and SWBMM, and S3/8WNB, S3/8WNT, and S3/8WBMM algorithms, the number of sampling $N$ is not only restricted to $N = 2n+1$ and $N = 3n+1$(as the requirements of $N = 1\mathrm{mod}(2)$and $N = 1\mathrm{mod}(3)$ in Eqs (16) and (17), where $n$ is an integer).

Finally the inner relations between weighted-based noniterative algorithms and continuous noniterative algorithms for performing the centroid TR of IT2 FLSs can be made as:

1) Weighted-based noniterative algorithms calculate the type-reduced set ${Y}_{WNontierative}$ based on the linear combinations of functional values on sampling points. While the benchmark continuous noniterative algorithms compute according to the integral operations. In theory, the solutions of weighted-based noniterative algorithms will approach to the continuous noniterative algorithms as the number of sampling $N\to \infty$.

2) As the number of sampling increases, weighted-based noniterative algorithms may obtain more accurate computational results.

3) Weighted-based noniterative algorithms perform the numerical calculations according to the sum operation, whereas the continuous noniterative algorithms perform the calculations symbolically by means of the integral operations. On the whole, weighted-based noniterative algorithms can be viewed as the numerical implementation of continuous noniterative algorithms according to the numerical integration approaches.

4.   Simulations

Four computer simulation examples are provided in this section. Here we suppose that the centroid output IT2 FS ^{[16,18,29,32]} has been obtained by merging or weighting fuzzy rules under the guidance the inference before the TR and defuzzification. For the first example, the FOU is bounded by the piece-wise linear functions. For the second example, the FOU is bounded by both the piece-wise linear functions and Gaussian functions. For the third example, the FOU is bounded by the Gaussian functions. For the last example, the FOU is defined as the symmetric Gaussian primary MF with uncertainty derivations. Then Figure 2 and Table 2 show the defined FOUs for four examples. In examples 1, 3 and 4, here we choose the primary variable $x\in [0, 10]$ for tests. In example 2, the primary variable is selected as $x\in [-5, 15]$ for test.

Firstly, the CNB, CNT, and CBMM algorithms are considered the benchmarks to compute the centroid defuzzified values for four examples. And they are provided in Table 3. Here the adjustable coefficient $\alpha$ for CBMM algorithms is chosen as the average of 1000 random numbers distributed on [0, 1], and the other adjustable coefficient is defined as$\beta = 1-\alpha$.

Next, we study the performances of proposed three types of weighted-based noniteraitve algorithms, respectively. Here the number of sampling is chosen as $N = 50:50:4000$ for tests, then the graphs of centroid defuzzified values computed by weighted-based noniterative algorithms are shown in Figures 3–5, respectively. Furthermore, the functional graphs of absolute errors between the continuous noniteraive algorithms and weighted-based noniteraive algorithms are shown in Figures 6–8.

Next, let’s quantitatively measure the calculation accuracies of proposed weighted-based noniterative algorithms. For the number of sampling $N = 50:50:4000$, we compute the defined average relative errors $|{y}_{WNoniterivei}-{y}_{CNoniterativei}^{\ast }|/\left|{y}_{CNoniterativei}^{\ast }\right|(i = 1, \cdots , 4)$. Then Tables 4–6 provide the values of average of relative errors with respect to $N$, in which the last line represents the total averages for four examples.

Then we study the specific computation times of weighted-based noniterative algorithms for better applications. The number of sampling is still chosen as $N = 50:50:4000$. Here the unrepeatable computation times depend on the hardware and software environments. The simulations are performed by a dual-core CPU dell desktop with E5300@2.60GHz and 2.00 GB memory. The programs are operated by Matlab 2013a on Windows XP. Figures 9–11 provide the comparisons of computation times of weighted-based noniteraitve algorithms for these four examples.

Considering the Figures 3–8, Tables 4–6, and Figures 9–11 comprehensively, the following conclusions can be obtained:

1) In these four examples, the absolute errors of three types of weighted-based noniterative algorithms all converge as the number of sampling increases. In example 1, NB, TWNB, NT, TWNT, and BMM, TWBMM algorithms can obtain the smallest absolute errors and errors amplitudes of variation, while SNB, SNT, and SBMM algorithms get the largest absolute errors and errors amplitude of variation. In both examples 2 and 3, the proposed weighted-based noniterative can obtain the values of absolute errors and errors amplitudes of variation that are obviously less than their corresponding original noniterative algorithms. In the last example, the first three types of weighted-based noniterative algorithms can get almost the same absolute errors and errors amplitudes of variation, while the last type of weighted-based noniterative algorithms obtain the larger ones.

2) For the NB algorithms, the largest average of relative error is 3.84%. While the largest average of relative error of proposed WNB algorithms is only 0.169%. For the NT algorithms, the largest average of relative error is 6.761%. The largest average of relative error of proposed WNT algorithms is only 0.243%. For the BMM algorithms, the largest average of relative error is 3.965%. The largest average of relative error of proposed WBMM algorithms is only 0.159%.

3) The total mean of average of relative error of NB algorithms is 1.611%. While the largest total mean of average of relative error of proposed WNB algorithms is only 0.137%. The total mean of average of relative error of NT algorithms is 2.714%. While the largest total mean of average of relative error of proposed WNT algorithms is only 0.187%. The total mean of average of relative error of BMM algorithms is 1.646%. While the largest total mean of average of relative error of proposed WBMM algorithms is only 0.132%.

4) In general, see Figures 9–11, the computational speeds of original noniteraive algorithms are faster than their corresponding weighted-based noniterative algorithms. However, the computational speeds first two types on weighted-based noniterative algorithms are almost completely the same. As the number of sampling is fixed, the size relation of computation times is as: S3/8WNoiteraive > SWNoiteraive > TWNoniterative > Noniterative. It may just because the weights of proposed weighted-based noniterative algorithms are more complex than the noniterative algorithms. In other words, the convergence speeds of proposed weighted-based noniteraive algorithms are faster than the original noniterative algorithms.

5) From the above analysis, it can be found that, by choosing the proposed weighted-based noniteraive algorithms appropriately, which can improve both the calculation accuracies and convergence speeds.

The proposed weighted-based noniteraive algorithms can be used to investigate the TR and defuzzification of IT2 FLSs. If only the computational accuracy were considered, the proposed three types of weighted-based noniteraive algorithms outperformed the original noniteraive algorithms, in which the second type of weighed-based noniteraive algorithms were the best. Moreover, the computation time of proposed weighted-based noniteraive algorithms were not much different from the original noniteraive algorithms. Considering the above analysis comprehensively, we advise to use the second or third types of weighted-based noniterative algorithms for the TR and defuzzification of IT2 FLSs with the combination of linear functions and nonlinear functions as in examples 1 and 4, and adopt the first or second types of weighted-based noniteraive algorithms for the TR and defuzzification of IT2 FLSs with the combination of linear and nonlinear functions and nonlinear functions as in examples 2 and 3.

Finally, it is important to point out that, we only focus on the experimental performances of weighted-based noniteraive algorithms. It can be obtained from the simulation examples that, compare with the noniteraive algorithms, the proposed weighted-based noniteraive algorithms can improve the computational accuracies. However, if the requirements of computational accuracy were not high, the weighted-based noniteraive algorithms can not show their advantages, as the simplest noniteraive algorithms could attain well results.

5.   Conclusions and expectations

This paper compares the operations between three types of discrete noniterative algorithms with their corresponding continuous versions. According to the Newton-Cotes quadrature formulas in the numerical integration technique, three types of noniterative algorithms are extended to the weighted-based noniterative algorithms. The continuous noniterative algorithms are considered as the benchmarks for performing the centroid TR and defuzzification of IT2 FLSs. Four simulation examples illustrate and analyze the computational accuracies and computation times of the proposed algorithms. Compared with the original noniterative algorithms, the proposed weighted-based noniteraive algorithms can obtain both higher calculation accuracies and faster convergence speeds.

In the future work, we will concentrate on designing the centroid TR of T2 FLSs ^{[13,14,15,16,17,18,19,20,21,22,23,24,29,31,33,56]} with weighted-based reasonable initialization enhanced Karnik-Mendel algorithms, the center-of-sets TR ^{[12,13,34,45,46,47,48,49]} of T2 FLSs, and seeking for global optimization algorithms ^{[3,4,5,6,25,26,27,35,36,37,38,39,40,41,42,43,44,52,53]} for designing and applying IT2 or GT2 FLSs in real world problems like forecasting, control ^{[50,51,54,55]} and so on.

Acknowledgments

The paper is supported by the National Natural Science Foundation of China (No. 61973146, No. 61773188, No. 61903167, No. 61803189), the Liaoning Province Natural Science Foundation Guidance Project (No. 20180550056), and Talent Fund Project of Liaoning University of Technology (No. xr2020002). The author is very thankful to Professor Jerry Mendel, who has given the author some important advices.

Conflict of interest

The authors declare that they have no conflict of interest.