Semiring | + | ⋅ | Semiring | + | ⋅ |
L2 | 0 1 1 1 |
0 0 1 1 |
R2 | 0 1 1 1 |
0 1 0 1 |
M2 | 0 1 1 1 |
0 1 1 1 |
D2 | 0 1 1 1 |
0 0 0 1 |
N2 | 0 1 1 1 |
0 0 0 0 |
T2 | 0 1 1 1 |
1 1 1 1 |
Z2 | 0 0 0 0 |
0 0 0 0 |
W2 | 0 0 0 0 |
0 0 0 1 |
This study is focused on the use of random forest (RF) to forecast the streamflow in the Kesinga River basin. A total of 169 data points were gathered monthly for the years 1991–2004 to create a model for streamflow prediction. The dataset was allotted into training and testing stages using various ratios, such as 50/50, 60/40, 70/30, and 80/20. The produced models were evaluated using three statistical indices: the root mean square error (RMSE), the mean absolute error (MAE), and the correlation coefficient (CC). The analysis of the models' performances revealed that the training and testing ratios had a substantial impact on the RF model's predictive abilities; models performed best when the ratio was 60/40. The findings demonstrated the right dataset ratios for precise streamflow prediction, which will be beneficial for hydraulic engineers during the water-related design and engineering stages of water projects.
Citation: Diksha Puri, Parveen Sihag, Mohindra Singh Thakur, Mohammed Jameel, Aaron Anil Chadee, Mohammad Azamathulla Hazi. Analysis of data splitting on streamflow prediction using random forest[J]. AIMS Environmental Science, 2024, 11(4): 593-609. doi: 10.3934/environsci.2024029
[1] | Sami Ul Haq, Saeed Ullah Jan, Syed Inayat Ali Shah, Ilyas Khan, Jagdev Singh . Heat and mass transfer of fractional second grade fluid with slippage and ramped wall temperature using Caputo-Fabrizio fractional derivative approach. AIMS Mathematics, 2020, 5(4): 3056-3088. doi: 10.3934/math.2020198 |
[2] | Kehong Zheng, Fuzhang Wang, Muhammad Kamran, Rewayat Khan, Ali Sikandar Khan, Sadique Rehman, Aamir Farooq . On rate type fluid flow induced by rectified sine pulses. AIMS Mathematics, 2022, 7(2): 1615-1627. doi: 10.3934/math.2022094 |
[3] | J. Kayalvizhi, A. G. Vijaya Kumar, Ndolane Sene, Ali Akgül, Mustafa Inc, Hanaa Abu-Zinadah, S. Abdel-Khalek . An exact solution of heat and mass transfer analysis on hydrodynamic magneto nanofluid over an infinite inclined plate using Caputo fractional derivative model. AIMS Mathematics, 2023, 8(2): 3542-3560. doi: 10.3934/math.2023180 |
[4] | Muhammad Imran Asjad, Muhammad Haris Butt, Muhammad Armaghan Sadiq, Muhammad Danish Ikram, Fahd Jarad . Unsteady Casson fluid flow over a vertical surface with fractional bioconvection. AIMS Mathematics, 2022, 7(5): 8112-8126. doi: 10.3934/math.2022451 |
[5] | Asifa, Poom Kumam, Talha Anwar, Zahir Shah, Wiboonsak Watthayu . Analysis and modeling of fractional electro-osmotic ramped flow of chemically reactive and heat absorptive/generative Walters'B fluid with ramped heat and mass transfer rates. AIMS Mathematics, 2021, 6(6): 5942-5976. doi: 10.3934/math.2021352 |
[6] | Ritu Agarwal, Mahaveer Prasad Yadav, Dumitru Baleanu, S. D. Purohit . Existence and uniqueness of miscible flow equation through porous media with a non singular fractional derivative. AIMS Mathematics, 2020, 5(2): 1062-1073. doi: 10.3934/math.2020074 |
[7] | Álvaro Abucide, Koldo Portal, Unai Fernandez-Gamiz, Ekaitz Zulueta, Iker Azurmendi . Unsteady-state turbulent flow field predictions with a convolutional autoencoder architecture. AIMS Mathematics, 2023, 8(12): 29734-29758. doi: 10.3934/math.20231522 |
[8] | Geetika Saini, B. N. Hanumagowda, S. V. K. Varma, Jasgurpreet Singh Chohan, Nehad Ali Shah, Yongseok Jeon . Impact of couple stress and variable viscosity on heat transfer and flow between two parallel plates in conducting field. AIMS Mathematics, 2023, 8(7): 16773-16789. doi: 10.3934/math.2023858 |
[9] | M. Hamid, T. Zubair, M. Usman, R. U. Haq . Numerical investigation of fractional-order unsteady natural convective radiating flow of nanofluid in a vertical channel. AIMS Mathematics, 2019, 4(5): 1416-1429. doi: 10.3934/math.2019.5.1416 |
[10] | Shabiha Naz, Tamizharasi Renganathan . An exact asymptotic solution for a non-Newtonian fluid in a generalized Couette flow subject to an inclined magnetic field and a first-order chemical reaction. AIMS Mathematics, 2024, 9(8): 20245-20270. doi: 10.3934/math.2024986 |
This study is focused on the use of random forest (RF) to forecast the streamflow in the Kesinga River basin. A total of 169 data points were gathered monthly for the years 1991–2004 to create a model for streamflow prediction. The dataset was allotted into training and testing stages using various ratios, such as 50/50, 60/40, 70/30, and 80/20. The produced models were evaluated using three statistical indices: the root mean square error (RMSE), the mean absolute error (MAE), and the correlation coefficient (CC). The analysis of the models' performances revealed that the training and testing ratios had a substantial impact on the RF model's predictive abilities; models performed best when the ratio was 60/40. The findings demonstrated the right dataset ratios for precise streamflow prediction, which will be beneficial for hydraulic engineers during the water-related design and engineering stages of water projects.
A semiring is an algebra with two associative binary operations +,⋅, in which + is commutative and ⋅ distributive over + from the left and right. Such an algebra is a common generalization of both rings and distributive lattices. It has broad applications in information science and theoretical computer science (see [5,6]). In this paper, we shall investigate some small-order semirings which will play a crucial role in subsequent follows.
The semiring A with addition and multiplication table (see [12])
+0a10000a0a01001⋅0a10000a01a10a1 |
The semiring B with addition and multiplication table (see [4])
+abcaabcbbbbccbc⋅abcaaaabbbbcabc |
Eight 2-element semirings with addition and multiplication table (see [2])
Semiring | + | ⋅ | Semiring | + | ⋅ |
L2 | 0 1 1 1 |
0 0 1 1 |
R2 | 0 1 1 1 |
0 1 0 1 |
M2 | 0 1 1 1 |
0 1 1 1 |
D2 | 0 1 1 1 |
0 0 0 1 |
N2 | 0 1 1 1 |
0 0 0 0 |
T2 | 0 1 1 1 |
1 1 1 1 |
Z2 | 0 0 0 0 |
0 0 0 0 |
W2 | 0 0 0 0 |
0 0 0 1 |
For any semiring S, we denote by S0 the semiring obtained from S by adding an extra element 0 and where a=0+a=a+0,0=0a=a0 for every a∈S. For any semiring S, S∗ will denote the (multiplicative) left-right dual of S. In 2005, Pastijn et al. [4,9,10] studied the semiring variety generated by B0 and (B0)∗ (Denoted by Sr(2,1)). They showed that the lattice of subvarieties of this variety is distributive and contains 78 varieties precisely. Moreover, each of these is finitely based. In 2016, Ren et al. [12,13] studied the variety generated by B0,(B0)∗ and A0 (Denoted by Sr(3,1)). They showed that the lattice of subvarieties of this variety is distributive and contains 179 varieties precisely. Moreover, each of these is finitely based. From [4,10], we have HSP(L2,R2,M2,D2)⫋HSP(B0,(B0)∗). So
HSP(L2,R2,M2,D2)⫋HSP(L2,R2,M2,D2,Z2,W2)⫋HSP(B0,(B0)∗,Z2,W2). |
In 2016, Shao and Ren [15] studied the variety HSP(L2,R2,M2,D2,Z2,W2) (Denoted by S6). They showed that the lattice of subvarieties of this variety is distributive and contains 64 varieties precisely. Moreover, each of these is finitely based. Recently, Ren and Zeng [14] studied the variety generated by B0,(B0)∗,N2,T2. They proved that the lattice of subvarieties of this variety is a distributive lattice of order 312 and that each of its subvarieties is finitely based. In [16], Wang, Wang and Li studied the variety generated by B0,(B0)∗,A0,N2,T2. They proved that the lattice of subvarieties of this variety is a distributive lattice of order 716 and that each of its subvarieties is finitely based. It is easy to check
HSP(B0,(B0)∗,A0,N2,T2)⫋HSP(B0,(B0)∗,A0,N2,T2,Z2,W2). |
So semiring variety HSP(B0,(B0)∗,A0,N2,T2) is a proper subvariety of the semiring variety HSP(B0,(B0)∗,A0,N2,T2,Z2,W2). The main purpose of this paper is to study the variety HSP(B0,(B0)∗, A0,N2,T2,Z2,W2). We show that the lattice of subvarieties of this variety is a distributive lattice of order 2327. Moreover, we show this variety is hereditarily finitely based.
By a variety we mean a class of algebras of the same type that is closed under subalgebras, homomorphic images and direct products (see [11]). Let W be a variety, let L(W) denote the lattice of subvarieties of W and let IdW(X) denote the set of all identities defining W. If W can be defined by finitely many identities, then we say that W is finitely based (see [14]). In other words, W is said to be finitely based if there exists a finite subset Σ of IdW(X) such that for any p≈q∈IdW(X), p≈q can be derived from Σ, i.e., Σ⊢p≈q. Otherwise, we say that W is nonfinitely based. Recall that W is said to be hereditarily finitely based if all members of L(W) are finitely based. If a variety W is finitely based and L(W) is a finite lattice, then W is hereditarily finitely based (see [14]).
A semiring is called an additively idempotent semiring (ai-semiring for short) if its additive reduct is a semilattice, i.e., a commutative idempotent semigroup. It is also called a semilattice-ordered semigroup (see [3,8,12]). The variety of all semirings (resp. all ai-semirings) is denoted by SR (resp. AI). Let X denote a fixed countably infinite set of variables and X+ the free semigroup on X (see [8]). A semiring identity (SR-identity for short) is an expression of the form u≈v, where u and v are terms with u=u1+⋯+uk, v=v1+⋯+vℓ, where ui,vj∈X+. Let k_ denote the set {1,2,…,k} for a positive integer k, Σ be a set of identities which include the identities determining AI (Each identity in Σ is called an AI-identity) and u≈v be an AI-identity. It is easy to check that the ai-semiring variety defined by u≈v coincides with the ai-semiring variety defined by the identities u≈u+vj,v≈v+ui,i∈k_,j∈ℓ_. Thus, in order to show that u≈v is derivable from Σ, we only need to show that u≈u+vj,v≈v+ui,i∈k_,j∈ℓ_ can be derived from Σ (see [9]).
To solve the word problem for the variety HSP(B0,(B0)∗,A0,N2,T2,Z2,W2), the following notions and notations are needed. Let q be an element of X+. Then
● the head of q, denoted by h(q), is the first variable occurring in q;
● the tail of q, denoted by t(q), is the last variable occurring in q;
● the content of q, denoted by c(q), is the set of variables occurring in q;
● the length of q, denoted by |q|, is the number of variables occurring in q counting multiplicities;
● the initial part of q, denoted by i(q), is the word obtained from q by retaining only the first occurrence of each variable;
● the final part of q, denoted by f(q), is the word obtained from q by retaining only the last occurrence of each variable;
● r(q) denotes set {x∈X|the number of occurrences of x in q is odd}.
By [13,Lemma 1.2], Sr(3,1) satisfies the identity p≈q if and only if (i(p),f(p),r(p))=(i(q),f(q), r(q)). This result will be used later without any further notice. The basis for each one of N2,T2,Z2,W2 can be found from [2] (See Table 1).
Semiring | Equational basis | Semiring | Equational basis |
N2 | xy≈zt,x+x2≈x | T2 | xy≈zt,x+x2≈x2 |
Z2 | x+y≈z+u,xy≈x+y | W2 | x+y≈z+u,x2≈x,xy≈yx |
By [15,Lemma 1.1] and the Table 1, we have
Lemma 2.1. Let u≈v be a nontrivial SR-identity, where u=u1+u2+⋯+um, v=v1+v2+⋯+vn, ui,vj∈X+, i∈m_,j∈n_. Then
(i) N2⊨u≈vifandonlyif{ui∈u||ui|=1}={vi∈v||vi|=1};
(ii) T2⊨u≈vifandonlyif{ui∈u||ui|≥2}≠ϕ,{vi∈v||vi|≥2}≠ϕ;
(iii) Z2⊨u≈vifandonlyif(∀x∈X)u≠x,v≠x;
(iv) W2⊨u≈vifandonlyifm=n=1,c(u1)=c(v1)orm,n≥2.
Suppose that u=u1+⋯+um,ui∈X+,i∈m_. Let 1 be a symbol which is not in X and Y an arbitrary subset of ⋃i=mi=1c(u1). For any ui in u, if c(ui)⊆Y, put hY(ui)=1. Otherwise, we shall denote by hY(ui) the first variable occurring in the word obtained from ui by deleting all variables in Y. The set {hY(ui)|ui∈u} is written HY(u). Dually, we have the notations tY(ui) and TY(ui). In particular, if Y=∅, then hY(ui)=h(ui) and tY(ui)=t(ui). Moreover, if c(ui)∩Y≠∅ for every ui in u, then we write DY(u)=∅. Otherwise, DY(u) is the sum of all terms ui in u such that c(ui)∩Y=∅. By [13,Lemma 2.3 and 2.11] and [4,Lemma 2.4 and its dual,Lemma 2.5 and 2.6], we have
Lemma 2.2. Let u≈u+q be an AI-identity, where u=u1+⋯+um,ui,q∈X+,i∈m_. If u≈u+q holds in Sr(3,1), then
(i) for every Z⊆⋃i=mi=1c(ui)∖c(q), there exists p1 in X+ with r(p1)=r(q) and c(q)⊆c(p1)⊆⋃i=ki=1c(ui) such that DZ(u)≈DZ(u)+p1 holds in Sr(3,1), where DZ(u)=u1+⋯+uk.
(ii) for every Y⊆Z=⋃i=mi=1c(ui)∖c(q), HY(DZ(u))=HY(DZ(u)+p1) and TY(DZ(u))=TY(DZ(u)+p1).
Throughout this paper, u(3.1),(3.2),⋯≈v denotes the identity u≈v can be derived from the identities (3.1),(3.2),⋯ and the identities determining SR. For other notations and terminology used in this paper, the reader is referred to [1,4,7,13,15].
In this section, we shall show that the variety HSP(B0,(B0)∗,A0,N2,T2,Z2,W2) is finitely based. Indeed, we have
Theorem 3.1. The semiring variety HSP(B0,(B0)∗,A0,N2,T2,Z2,W2) is determined by (3.1)–(3.12),
x3y≈xy; | (3.1) |
xy3≈xy; | (3.2) |
(xy)2≈x2y2; | (3.3) |
(xy)3≈xy; | (3.4) |
x2yx≈xyx2; | (3.5) |
xyzx≈xyx2zx; | (3.6) |
xy+z≈xy+z+xyz2; | (3.7) |
xy+z≈xy+z+z2xy; | (3.8) |
xy+z≈xy+z+xz2y; | (3.9) |
xy+z≈xy+z+z3; | (3.10) |
x+y+zt≈x+y+zt+xzty; | (3.11) |
x+y≈x+y+y. | (3.12) |
Proof. From [13] and Lemma 2.1, we know that both Sr(3,1) and HSP(N2,T2,Z2,W2) satisfy identities (3.1)–(3.12) and so does HSP(B0,(B0)∗,A0,N2,T2,Z2,W2).
Next, we shall show that every identity that holds in HSP(B0,(B0)∗,A0,N2,T2,Z2,W2) can be derived from (3.1)–(3.12) and the identities determining SR. Let u≈v be such an identity, where u=u1+u2+⋯+um, v=v1+v2+⋯+vn, ui,vj∈X+, 1≤i≤m,1≤j≤n. By Lemma 2.1 (ⅳ), we only need to consider the following two cases:
Case 1. m=n=1 and c(u1)=c(v1). From Sr(3,1),T2,Z2⊨u1≈v1, it follows that (i(u1),f(u1),r(u1))=(i(v1),f(v1),r(v1)), |u1|≥2 and |v1|≥2. Hence u1(3.1)∼(3.6)≈v1.
Case 2. m,n≥2. It is easy to verify that u≈v and the identity (3.12) imply the identities u≈u+vj, v≈v+ui for all i,j such that 1≤i≤m,1≤j≤n. Conversely, the latter m+n identities imply u≈u+v≈v. Thus, to show that u≈v is derivable from (3.1)–(3.12) and the identities determining SR, we need only show that the simpler identities u≈u+vj, v≈v+ui for all i,j such that 1≤i≤m,1≤j≤n. Hence we need to consider the following two cases:
Case 2.1. u≈u+q, where |q|=1. Since N2⊨u≈u+q, there exists us=q. Thus u+q≈u′+us+q≈u′+us+us(3.12)≈u′+us≈u.
Case 2.2. u≈u+q, where |q|≥2. Since u≈u+q holds in T2, it follows from Lemma 2.1 (ⅱ) that there exists ui in u such that ui>1. Put Z=(⋃i=mi=1c(ui))∖c(q). Assume that DZ(u)=u1+⋯+uk. Then ⋃i=ki=1c(ui)=c(q). By Lemma 2.2 (ⅰ), there exists p1∈X+ such that r(p1)=r(q) and c(q)⊆c(p1)⊆⋃i=ki=1c(ui). Moreover,
u≈u+ui+DZ(u)≈u+ui+p1+DZ(u)≈u+ui+p1+DZ(u)+p31(by (3.10))≈u+ui+p1+DZ(u)+p31+p31u21u22⋯u2k.(by (3.7)) |
Write p=p31u21u22⋯u2k. Thus c(p)=c(q), r(p)=r(q) and we have derived the identity
u≈u+p. | (3.13) |
Due to |p|>1, it follows that (3.4) implies the identity
p3≈p. | (3.14) |
Suppose that i(q)=x1x2⋯xℓ. We shall show by induction on j that for every 1≤j≤ℓ, u≈u+x21x22⋯x2ℓp is derivable from (3.1)–(3.11) and the identities defining SR.
From Lemma 2.1 (ⅱ), there exists ui1 in DZ(u) with c(ui1)⊆c(q) such that h(ui1)=h(q)=x1. Furthermore,
u≈u+ui1+p(by (3.13))≈u+ui1+p+u2i1p(by (3.8))≈u+ui1+p+x21u2i1p(by (3.1))≈u+ui1+p+x21u2i1p+x21p2u2iip(by (3.9))≈u+ui1+p+x21u2i1p+x21p.(by (3.6), (3.14)) |
Therefore
u≈u+x21p. | (3.15) |
Assume that for some 1<j≤ℓ,
u≈u+x21x22⋯x2j−1p | (3.16) |
is derivable from (3.1–3.12) and the identities defining SR. By Lemma 2.1 (ⅱ), there exists ui in DZ(u) with c(ui)⊆c(q) such that ui=ui1xjui2 and c(ui1)⊆{x1,x2,…,xj−1}. It follows that
u≈u+ui+p≈u+ui+p+u2ip(by (3.8))≈u+ui+p+u2i1x2ju2i2p(by (3.3))≈u+ui+p+u2i1x2ju2i2p+u2i1x2jp2u2i2p(by (3.9))≈u+ui+p+u2i1x2ju2i2p+u2i1x2jp.(by (3.6), (3.14)) |
Consequently
u≈u+u2i1x2jp. | (3.17) |
Moreover, we have
u≈u+x21x22⋯x2j−1p+u2i1x2jp(by (3.16), (3.17))≈u+x21x22⋯x2j−1p+u2i1x2jp+x21x22⋯x2j−1(u2i1x2jp)2p(by (3.9))≈u+x21x22⋯x2j−1p+u2i1x2jp+x21x22⋯x2j−1x2jp.(by (3.3), (3.6), (3.14))) |
Hence u≈u+x21x22⋯x2j−1x2jp. Using induction we have
u≈u+i2(q)p. | (3.18) |
Dually,
u≈u+pf2(q). | (3.19) |
Thus
u≈u+p+i2(q)p+pf2(q)(by (3.13), (3.18), (3.19))≈u+p+i2(q)p+pf2(q)+i2(q)pppf2(q)(by (3.11))≈u+p+i2(q)p+pf2(q)+i2(q)pf2(q)(by (3.14))≈u+p+i2(q)p+pf2(q)+q.(by (3.1)–(3.6)) |
It follows that u≈u+q.
In this section we characterize the lattice L(HSP(B0,(B0)∗,A0,N2,T2,Z2,W2)). Throughout this section, t(x1,…,xn) denotes the term t which contains no other variables than x1,…,xn (but not necessarily all of them). Let S∈HSP(B0,(B0)∗,A0,N2,T2,Z2,W2) and let E+(S) denote the set {a∈S|a+a=a}, where any element of E+(S) is said to be an additive idempotent of (S,+). Notice that HSP(B0,(B0)∗,A0,N2,T2,Z2,W2) satisfies the identities
(x+y)+(x+y)≈(x+x)+(y+y), | (4.1) |
xy+xy≈(x+x)(y+y). | (4.2) |
By (4.1) and (4.2), it is easy to verify that E+(S)={a+a|a∈S} forms a subsemiring of S. To characterize the lattice L(HSP(B0,(B0)∗,A0,N2,T2,Z2,W2)), we need to consider the following mapping
φ:L(HSP(B0,(B0)∗,A0,N2,T2,Z2,W2))→L(HSP(B0,(B0)∗,A0,N2,T2)),W↦W∩HSP(B0,(B0)∗,A0,N2,T2). | (4.3) |
It is easy to prove that φ(W)={E+(S)|S∈W} for each member W of L(HSP(B0,(B0)∗,A0,N2,T2, Z2,W2)). If W is the subvariety of HSP(B0,(B0)∗,A0,N2,T2) determined by the identities
ui(xi1,…,xin)≈vi(xi1,…,xin),i∈k_, |
then ˆW denotes the subvariety of HSP(B0,(B0)∗,A0,N2,T2,Z2,W2) determined by the identities
ui(xi1+xi1,…,xin+xin)≈vi(xi1+xi1,…,xin+xin),i∈k_. | (4.4) |
Lemma 4.1. [16] The ai-semiring variety HSP(B0,(B0)∗,A0,N2,T2) is determined by the identities (3.1)–(3.11) and L(HSP(B0,(B0)∗,A0,N2,T2)) is a distributive lattice of order 716.
Lemma 4.2. Let W be a member of L(HSP(B0,(B0)∗,A0,N2,T2)). Then, ˆW=W∨HSP(Z2,W2).
Proof. Since W satisfies the identities (4.4), it follows that W is a subvariety of ˆW. Both Z2 and W2 are members of ˆW and so W∨HSP(Z2,W2)⊆ˆW. To show the converse inclusion, it suffices to show that every identity that is satisfied by W∨HSP(Z2,W2) can be derived by the identities holding in HSP(B0,(B0)∗,A0,N2,T2,Z2,W2) and
ui(xi1+xi1,…,xin+xin)≈vi(xi1+xi1,…,xin+xin),i∈k_, |
if W is the subvariety of L(HSP(B0,(B0)∗,A0,N2,T2)) determined by ui(xi1,…,xin)≈vi(xi1,…,xin), i∈k_. Let u≈v be such an identity, where u=u1+u2+⋯+um,v=v1+v2+⋯+vn,ui,vj∈X+,1≤i≤m,1≤j≤n. By Lemma 2.1 (8), we only need to consider the following two cases.
Case 1. m,n≥2. By identity (3.12), HSP(B0,(B0)∗,A0,N2,T2,Z2,W2) satisfies the identities
u+u≈u, | (4.5) |
v+v≈v. | (4.6) |
Since u≈v holds in HSP(B0,(B0)∗,A0,N2,T2), we have that it is derivable from the collection Σ of ui≈vi,i∈k_ and the identities determining HSP(B0,(B0)∗,A0,N2,T2). From [1,Exercise Ⅱ.14.11], it follows that there exist t1,t2,…,tℓ∈Pf(X+) such that
● t1=u,tℓ=v;
● For any i=1,2,…,ℓ−1, there exist pi,qi,ri∈Pf(X+) (where pi, qi and ri may be empty words), a semiring substitution φi and an identity u′i≈v′i∈Σ such that
ti=piφi(wi)qi+ri,ti+1=piφi(si)qi+ri,where eitherwi=u′i,si=v′iorwi=v′i,si=u′i. |
Let Σ′ denote the set {u+u≈v+v|u≈v∈Σ}. For any i=1,2,…,ℓ−1, we shall show that ti+ti≈ti+1+ti+1 is derivable from Σ′ and the identities holding in HSP(B0,(B0)∗,A0,N2,T2,Z2,W2). Indeed, we have
ti+ti=piφi(wi)qi+ri+piφi(wi)qi+ri≈piφi(wi)qi+piφi(wi)qi+ri+ri≈pi(φi(wi+wi))qi+ri+ri≈pi(φi(si+si))qi+ri+ri(sincewi+wi≈si+si∈Σ′orsi+si≈wi+wi∈Σ′)≈piφi(si)qi+piφi(si)qi+ri+ri≈piφi(si)qi+ri+piφi(si)qi+ri=ti+1+ti+1. |
Further,
u+u=t1+t1≈t2+t2≈⋯≈tℓ+tℓ=v+v. |
This implies the identity
u+u≈v+v. | (4.7) |
We now have
u(4.6)≈u+u(4.7)≈v+v(4.6)≈v. | (4.8) |
Case 2. m=n=1 and c(u)=c(v). Since Z2⊨u1≈v1, u1≠x,v1≠x, for every x∈X. Since u1≈v1 holds in HSP(B0,(B0)∗,A0,N2,T2), we have that it is derivable from the collection Σ of ui≈vi,i∈k_ and the identities defining HSP(B0,(B0)∗,A0,N2,T2). From [1,Exercise Ⅱ.14.11], it follows that there exist t1,t2,…,tℓ∈Pf(X+) such that
● t1=u1,tℓ=v1;
● For any i=1,2,…,ℓ−1, there exist pi,qi∈Pf(X+) (where pi and qi may be empty words), a semiring substitution φi and an identity u′i≈v′i∈Σ (where u′i and v′i are words) such that
ti=piφi(wi)qi,ti+1=piφi(si)qi,where eitherwi=u′i,si=v′iorwi=v′i,si=u′i. |
By Lemma 4.1, we have that u1≈v1 can be derived from (3.1)–(3.6), so, by Theorem 3.1, it can be derived from monomial identities holding in HSP(B0,(B0)∗,A0,N2,T2,Z2,W2). This completes the proof.
Lemma 4.3. The following equality holds
L(HSP(B0,(B0)∗,A0,N2,T2,Z2,W2))=⋃W∈L(HSP(B0,(B0)∗,A0,N2,T2))[W,ˆW]. | (4.9) |
There are 716 intervals in L(HSP(B0,(B0)∗,A0,N2,T2,Z2,W2)), and each interval is a congruence class of the kernel of the complete epimorphism φ in (4.3).
Proof. Firstly, we shall show that equality (4.9) holds. It is easy to see that
L(HSP(B0,(B0)∗,A0,N2,T2,Z2,W2))=⋃W∈L(HSP(B0,(B0)∗,A0,N2,T2))φ−1(W). |
So it suffices to show that
φ−1(W)=[W,ˆW], | (4.10) |
for each member W of L(HSP(B0,(B0)∗,A0,N2,T2)). If W1 is a member of [W,ˆW], then it is routine to verify that W⊆{E+(S)|S∈W1}⊆W. This implies that {E+(S)|S∈W1}=W and so φ(W1)=W. Hence, W1 is a member of φ−1(W) and so [W,ˆW]⊆φ−1(W). Conversely, if W1 is a member of φ−1(W), then W=φ(W1)={E+(S)|S∈W1} and so φ−1(W)⊆[W,ˆW]. This shows that (4.9) holds.
From Lemma 4.1, we know that L(HSP(B0,(B0)∗,A0,N2,T2)) is a lattice of order 716. So there are 716 intervals in L(HSP(B0,(B0)∗,A0,N2,T2,Z2,W2)). Next, we show that φ a complete epimorphism. On one hand, it is easy to see that φ is a complete ∧-epimorphism. On the other hand, let (Wi)i∈I be a family of members of L(HSP(B0,(B0)∗,A0,N2,T2,Z2, W2)). Then, by (4.3), we have that φ(Wi)⊆Wi⊆^φ(Wi) for each i∈I. Further,
⋁i∈Iφ(Wi)⊆⋁i∈IWi⊆⋁i∈I^φ(Wi)⊆^⋁i∈Iφ(Wi). |
This implies that φ(⋁i∈IWi)=⋁i∈Iφ(Wi). Thus, φ is a complete ∨-homomorphism and so φ is a complete ∨-epimorphism. By (4.10), we deduce that each interval in (4.3) is a congruence class of the kernel of the complete epimorphism φ.
In order to characterize the lattice L(HSP(B0,(B0)∗,A0,N2,T2,Z2,W2)), by Lemma 4.3, we only need to describe the interval [W,ˆW] for each member W of L(HSP(B0, (B0)∗,A0,N2,T2)). Next, we have
Lemma 4.4. Let W be a member of L(HSP(B0,(B0)∗,A0,N2,T2)). Then, W∨HSP(Z2) is the subvariety of ˆW determined by the identity
x3≈x3+x3. | (4.11) |
Proof. It is easy to see that both, W and HSP(Z2) satisfy the identity (4.11) and so does W∨HSP(Z2). In the following we prove that every identity that is satisfied by W∨HSP(Z2) is derivable from (4.11) and the identities holding in ˆW. Let u≈v be such an identity, where u=u1+u2+⋯+um,v=v1+v2+⋯+vn,ui,vj∈X+,1≤i≤m,1≤j≤n. We only need to consider the following cases.
Case 1. m=n=1. Since Z2 satisfies u1≈v1, it follows that |u1|≠1 and |v1|≠1. By Lemma 4.2, ˆW satisfies the identity u31+u31≈v31+v31. Hence u1(3.4)≈u31(4.11)≈u31+u31≈v31+v31(4.11)≈v31(3.4)≈v1.
Case 2. m=1, n≥2. Since Z2 satisfies u1≈v, it follows that |u1|≠1. By Lemma 4.2, ˆW satisfies the identity u31+u31≈v+v. Hence u1(3.4)≈u31(4.11)≈u31+u31≈v+v(3.11)≈v.
Case 3. m≥2, n=1. Similar to Case 2.
Case 4. m,n≥2. By Lemma 4.2, ˆW satisfies the identity u+u≈v+v. Hence u(3.11)≈u+u≈v+v(3.11)≈v.
Lemma 4.5. Let W be a member of L(Sr(3,1)). Then W∨HSP(W2) is the subvariety of ˆW determined by the identities
x3≈x. | (4.12) |
Proof. It is easy to see that both, W and HSP(W2) satisfy the identity (4.12) and so does W∨HSP(W2). So it suffices to show that every identity that is satisfied by W∨HSP(W2) is derivable from (4.12) and the identities holding in ˆW. Let u≈v be such an identity, where u=u1+u2+⋯+um,v=v1+v2+⋯+vn,ui,vj∈X+,1≤i≤m,1≤j≤n. By Lemma 4.2, ˆW satisfies the identity u3≈v3. Hence, u(4.12)≈u3≈v3(4.12)≈v.
Lemma 4.6. Let W be a member of L(HSP(B0,(B0)∗,A0,N2,T2)). Then the interval [W,ˆW] of L(HSP(B0,(B0)∗,A0,N2,T2,Z2,W2)) is given in Figure 1.
Proof. Suppose that W1 is a member of [W,ˆW] such that W1≠ˆW and W1≠W. Then, there exists a nontrivial identity u≈v holding in W1 such that it is not satisfied by ˆW. Also, we have that W1 does not satisfy the identity x+x≈x. By Lemma 4.2, we only need to consider the following two cases.
Case 1. HSP(Z2)⊨u≈v,HSP(W2)⊭u≈v. Then, u≈v satisfies one of the following three cases:
● m=n=1, c(u1)≠c(v1), |u1|≠1 and |v1|≠1;
● m=1,n>1 and |u1|≠1;
● m>1,n=1 and |v1|≠1.
It is easy to see that, in each of the above cases, u≈v can imply the identity x3≈x3+x3. By Lemma 4.4, we have that W1 is a subvariety of W∨HSP(Z2). On the other hand, since W1⊨x3≈x3+x3 and W1⊭x+x≈x, it follows that Z2 is a member of W1 and so W∨HSP(Z2) is a subvariety of W1. Thus, W1=W∨HSP(Z2).
Case 2. HSP(Z2)⊭u≈v,HSP(W2)⊨u≈v. Then, u≈v satisfies one of the following two cases:
● m=n=1, c(u1)=c(v1) and |u1|=1;
● m=n=1, c(u1)=c(v1) and |v1|=1.
If N2,T2∉W, then, in each of the above cases, u≈v can imply the identity x≈x3. By Lemma 4.5, W1 is a subvariety of W∨HSP(W2). On the other hand, since W1⊨x≈x3 and W1⊭x≈x+x, it follows that W2 is a member of W1 and so W∨HSP(W2) is a subvariety of W1. Thus, W1=W∨HSP(W2).
If N2∈W, then, by Lemma 2.1 (ⅰ), |u1|=|v1|=1, a contradiction. Thus, V1=ˆV.
If T2∈W, then, by Lemma 2.1 (ⅱ), |u1|≥2,|v1|≥2, a contradiction. Thus, V1=ˆV.
By Lemma 4.3 and 4.6, we can show that the lattice L(HSP(B0,(B0)∗,A0,N2,T2,Z2, W2)) of subvarieties of the variety HSP(B0,(B0)∗,A0,N2,T2,Z2,W2) contains 2327 elements. In fact, we have
Theorem 4.7. L(HSP(B0,(B0)∗,A0,N2,T2,Z2,W2)) is a distributive lattice of order 2327.
Proof. We recall from [16] that Sr(3,1)∨T2 [Sr(3,1)∨N2] contains 358 subvarieties since Sr(3,1) contains 179 subvarieties. By Lemma 4.3 and 4.6, we can show that L(HSP(B0,(B0)∗,A0,N2,T2,Z2, W2)) has exactly 2327 (where 2327=179×4+358×3×2−179×3) elements. Suppose that W1,W2 and W3 are members of L(HSP(B0,(B0)∗,A0, N2,T2,Z2,W2)) such that W1∨W2=W1∨W3 and W1∧W2=W1∧W3. Then, by Lemma 4.3
φ(W1)∨φ(W2)=φ(W1)∨φ(W3) |
and
φ(W1)∧φ(W2)=φ(W1)∧φ(W3). |
Since L(HSP(B0,(B0)∗,A0,N2,T2) is distributive, it follows that φ(W2)=φ(W3). Write W for φ(W2). Then both W2,W3 are members of [W,ˆW]. Suppose that W2≠W3. Then, by Lemma 4.6, W1∨W2=W1∨W3 and W1∧W2=W1∧W3 can not hold at the same time. This implies that W2=W3.
By Theorem 4.1, 4.7 and [14,Corollary 1.2], we now immediately deduce
Corollary 4.8. HSP(B0,(B0)∗,A0,N2,T2,Z2,W2) is hereditarily finitely based.
This article considers a semiring variety generated by B0,(B0)∗,A0,N2,T2,Z2,W2. The finite basis problem for semirings is an interesting developing topic, with plenty of evidence of a high level of complexity along the lines of the more well-developed area of semigroup varieties. This article is primarily a contribution toward the property of being hereditarily finite based, meaning that all subvarieties are finitely based. This property is of course useful because it guarantees the finite basis property of a large number of examples.
This work was supported by the Natural Science Foundation of Chongqing (cstc2019jcyj-msxmX0156, cstc2020jcyj-msxmX0272, cstc2021jcyj-msxmX0436), the Scientific and Technological Research Program of Chongqing Municipal Education Commission (KJQN202001107, KJQN202101130) and the Scientific Research Starting Foundation of Chongqing University of Technology (2019ZD68).
The authors declare that they do not have any conflict of interests regarding this paper.
[1] |
Yang D, Yang Y, Xia, J (2021) Hydrological cycle and water resources in a changing world: A review. Geogr Sustain 2: 115–122. https://doi.org/10.1016/j.geosus.2021.05.003 doi: 10.1016/j.geosus.2021.05.003
![]() |
[2] |
Liang, S, Ge, S, Wan, L., & Zhang, J. (2010). Can climate change cause the Yellow River to dry up? Water Resour Res 46 https://doi.org/10.1029/2009WR007971 doi: 10.1029/2009WR007971
![]() |
[3] |
L Mampitiya, N Rathnayake, Y Hoshino et al. (2024). Forecasting PM10 Levels in Sri Lanka: A Comparative Analysis of Machine Learning Models. J Hazard Mater Adv 13: 1–10. https://doi.org/10.1016/j.hazadv.2023.100395 doi: 10.1016/j.hazadv.2023.100395
![]() |
[4] |
HI Tillekaratne, IMSP Jayawardena, V Basnayaka, et al. (2023) Hydro-meteorological disaster incidents and associated weather systems in Sri Lanka. J Environ Informatics Lett 10: 89–103. https://doi.org/10.3808/jeil.202300119 doi: 10.3808/jeil.202300119
![]() |
[5] | M Fuladipanah, A Shahhosseini, N Rathnayake, et al. (2024) In-depth simulation of rainfall-runoff relationships using machine learning methods. Water Pract Technol (In-Press). https://doi.org/10.2166/wpt.2024.147 |
[6] |
Palmer M, Ruhi A (2019) Linkages between flow regime, biota, and ecosystem processes: Implications for river restoration. Science 365: eaaw2087. https://doi.org/10.1126/science.aaw2087 doi: 10.1126/science.aaw2087
![]() |
[7] |
Bierkens, MF, Wada, Y (2019) Non-renewable groundwater use and groundwater depletion: a review. Environ Res Lett 14: 063002. https;//doi.org/10.1088/1748-9326/ab1a5f doi: 10.1088/1748-9326/ab1a5f
![]() |
[8] |
Zhou Y, Ma J, Zhang Y, et al. (2019) Influence of the three Gorges Reservoir on the shrinkage of China's two largest freshwater lakes. Global Planet Change 177: 45–55. https://doi.org/10.1016/j.gloplacha.2019.03.014 doi: 10.1016/j.gloplacha.2019.03.014
![]() |
[9] |
Adamowski J. F (2008) Development of a short-term river flood forecasting method for snowmelt driven floods based on wavelet and cross-wavelet analysis. J Hydrol 353: 247–266. https://doi.org/10.1016/j.jhydrol.2008.02.013 doi: 10.1016/j.jhydrol.2008.02.013
![]() |
[10] |
Vorosmarty CJ, Green P, Salisbury J, et al. (2000) Global water resources: vulnerability from climate change and population growth. Science 289: 284–288. https://doi.org/10.1126/science.289.5477.284 doi: 10.1126/science.289.5477.284
![]() |
[11] |
Hanson RT, Newhouse MW, Dettinger, MD (2004) A methodology to asess relations between climatic variability and variations in hydrologic time series in the southwestern United States. J Hydrol 287: 252–269. https://doi.org/10.1016/j.jhydrol.2003.10.006 doi: 10.1016/j.jhydrol.2003.10.006
![]() |
[12] |
Yang C, Lin Z, Yu Z, et al. (2010) Analysis and simulation of human activity impact on streamflow in the Huaihe River basin with a large-scale hydrologic model. J Hydrometeorol 11: 810–821. https://doi.org/10.1175/2009JHM1145.1 doi: 10.1175/2009JHM1145.1
![]() |
[13] | Makumbura RK, Rathnayake U (2022) Variation of Leaf Area Index (LAI) under changing climate: Kadolkele mangrove forest, Sri Lanka, Advances in Meteorology. https://doi.org/10.1155/2022/9693303 |
[14] |
Labat D, Ababou R, Mangin A (2000) Rainfall–runoff relations for karstic springs. Part Ⅱ: continuous wavelet and discrete orthogonal multiresolution analyses. J Hydrol 238: 149–178. https://doi.org/10.1016/S0022-1694(00)00322-X doi: 10.1016/S0022-1694(00)00322-X
![]() |
[15] |
Coulibaly P, Burn DH (2004) Wavelet analysis of variability in annual Canadian streamflows. Water Resour Res 40. https://doi.org/10.1029/2003WR002667 doi: 10.1029/2003WR002667
![]() |
[16] |
Guven A (2009) Linear genetic programming for time-series modelling of daily flow rate. J Earth Syst Sci 118: 137–146. https://doi.org/10.1007/s12040-009-0022-9 doi: 10.1007/s12040-009-0022-9
![]() |
[17] |
Yaseen ZM, El-Shafie A, Jaafar O, et al. (2015) Artificial intelligence-based models for stream-flow forecasting: 2000–2015. J Hydrol 530: 829–844. https://doi.org/10.1016/j.jhydrol.2015.10.038 doi: 10.1016/j.jhydrol.2015.10.038
![]() |
[18] |
SP Hemakumara, MB Gunathilake, U Rathnayake (2023) Flow alterations due a constructed reservoir in the Menik Ganga basin, Sri Lanka. Discover Water 3: 1–15. https://doi.org/10.1007/s43832-023-00049-7 doi: 10.1007/s43832-023-00049-7
![]() |
[19] |
Ghimire S, Yaseen ZM, Farooque AA, et al. (2021). Streamflow prediction using an integrated methodology based on convolutional neural network and long short-term memory networks. Sci Rep 11: 17497. https://doi.org/10.1038/s41598-021-96751-4 doi: 10.1038/s41598-021-96751-4
![]() |
[20] |
Liu D, Jiang W, Mu L, et al. (2020) Streamflow prediction using deep learning neural network: case study of Yangtze River. IEEE access 8: 90069–90086. https://doi.org/10.1109/ACCESS.2020.2993874 doi: 10.1109/ACCESS.2020.2993874
![]() |
[21] |
Arsenault R, Martel JL, Brunet F, et al. (2023) Continuous streamflow prediction in ungauged basins: long short-term memory neural networks clearly outperform traditional hydrological models. Hydrol Earth Syst Sci 27: 139–157. https://doi.org/10.5194/hess-27-139-2023 doi: 10.5194/hess-27-139-2023
![]() |
[22] |
Tabbussum R, Dar AQ (2021) Comparison of fuzzy inference algorithms for stream flow prediction. Neural Comput Appl 33: 1643–1653. https://doi.org/10.1007/s00521-020-05098-w doi: 10.1007/s00521-020-05098-w
![]() |
[23] |
Üneş F, Demirci M, Zelenakova M, et al. (2020) River flow estimation using artificial intelligence and fuzzy techniques. Water 12: 2427. https://doi.org/10.3390/w12092427 doi: 10.3390/w12092427
![]() |
[24] |
Mohammadi B, Linh NTT, Pham QB, et al. (2020) Adaptive neuro-fuzzy inference system coupled with shuffled frog leaping algorithm for predicting river streamflow time series. Hydrol Sci J 65: 1738–1751. https://doi.org/10.1080/02626667.2020.1758703 doi: 10.1080/02626667.2020.1758703
![]() |
[25] |
Di Nunno F, de Marinis G, Granata, F. (2023) Short-term forecasts of streamflow in the UK based on a novel hybrid artificial intelligence algorithm. Sci Rep 13: 7036. https://doi.org/10.1038/s41598-023-34316-3 doi: 10.1038/s41598-023-34316-3
![]() |
[26] |
Tikhamarine Y, Souag-Gamane D, Ahmed AN, et al. (2020) Improving artificial intelligence models accuracy for monthly streamflow forecasting using grey Wolf optimization (GWO) algorithm. J Hydrol 582: 124435. https://doi.org/10.1016/j.jhydrol.2019.124435 doi: 10.1016/j.jhydrol.2019.124435
![]() |
[27] |
Seidu J, Ewusi A, Kuma JSY, et al. (2023) Impact of data partitioning in groundwater level prediction using artificial neural network for multiple wells. Int J River Basin Ma 21: 639–650. https://doi.org/10.1080/15715124.2022.2079653 doi: 10.1080/15715124.2022.2079653
![]() |
[28] |
Jahanpanah E, Khosravinia P, Sanikhani H, et al. (2019) Estimation of discharge with free overfall in rectangular channel using artificial intelligence models. Flow Meas Instrum 67: 118–130. https://doi.org/10.1016/j.flowmeasinst.2019.04.005 doi: 10.1016/j.flowmeasinst.2019.04.005
![]() |
[29] |
Demir S, Sahin EK (2022) Comparison of tree-based machine learning algorithms for predicting liquefaction potential using canonical correlation forest, rotation forest, and random forest based on CPT data. Soil Dyn Earthq Eng 154: 107130. https://doi.org/10.1016/j.soildyn.2021.107130 doi: 10.1016/j.soildyn.2021.107130
![]() |
[30] |
Ebtehaj I, Bonakdari H, Safari MJS, et al. (2020) Combination of sensitivity and uncertainty analyses for sediment transport modeling in sewer pipes. Int J Sediment Res 35: 157–170. https://doi.org/10.1016/j.ijsrc.2019.08.005 doi: 10.1016/j.ijsrc.2019.08.005
![]() |
[31] |
Zhang W, Zhang R, Wu C, et al. (2020) State-of-the-art review of soft computing applications in underground excavations. Geosci Front 11: 1095–1106. https://doi.org/10.1016/j.gsf.2019.12.003 doi: 10.1016/j.gsf.2019.12.003
![]() |
[32] |
Xu Z, Sheykhahmad FR, Ghadimi N, et al. (2020) Computer-aided diagnosis of skin cancer based on soft computing techniques. Open Med 15: 860–871. https://doi.org/10.1515/med-2020-0131 doi: 10.1515/med-2020-0131
![]() |
[33] |
Al-Janabi S, Mohammad M, Al-Sultan A (2020) A new method for prediction of air pollution based on intelligent computation. Soft Comput 24: 661–680. https://doi.org/10.1007/s00500-019-04495-1 doi: 10.1007/s00500-019-04495-1
![]() |
[34] |
Wang F, Chun W, Cui, Y (2022) Urban water resources allocation and low-carbon economic development based on soft computing. Environ Technol Inno 28: 102292. https://doi.org/10.1016/j.eti.2022.102292 doi: 10.1016/j.eti.2022.102292
![]() |
[35] |
Luan C, Liu R, Peng S (2021) Land-use suitability assessment for urban development using a GIS-based soft computing approach: A case study of Ili Valley, China. Ecol Indic 123: 107333. https://doi.org/10.1016/j.ecolind.2020.107333 doi: 10.1016/j.ecolind.2020.107333
![]() |
[36] | Asteris PG, Apostolopoulou M, Armaghani DJ, et al. (2020). On the metaheuristic models for the prediction of cement-metakaolin mortars compressive strength. 1: 063. |
[37] |
Breiman L (2001) Random forests. Mach Learn 45: 5–32. https://doi.org/10.1023/A:1010933404324 doi: 10.1023/A:1010933404324
![]() |
[38] | Liaw A, Wiener M (2002) Classification and regression by randomForest. R News 2: 18–22. |
[39] | Scornet E, Biau G, Vert JP (2015). Consistency of random forests. https://doi.org/10.1214/15-AOS1321 |
[40] |
Mohanty S, Roy N, Singh SP, et al. (2019). Estimating the strength of stabilized dispersive soil with cement clinker and fly ash. Geotech Geol Eng 37: 2915–2926. https://doi.org/10.1007/s10706-019-00808-1 doi: 10.1007/s10706-019-00808-1
![]() |
[41] |
Breiman L (1996) Bagging predictors. Mach Learn 24: 123–140. https://doi.org/10.1007/BF00058655 doi: 10.1007/BF00058655
![]() |
[42] | Egawa, T, Suzuki K, Ichikawa Y, et al. (2011, July) A water flow forecasting for dam using neural networks and regression models. In 2011 IEEE Power and Energy Society General Meeting (1–6). IEEE. https://doi.org/10.1109/PES.2011.6038925 |
[43] |
AlOmar M. K, Khaleel F, AlSaadi A. A, et al. (2022) The influence of data length on the performance of artificial intelligence models in predicting air pollution. Adv Meteorol 2022. https://doi.org/10.1155/2022/5346647 doi: 10.1155/2022/5346647
![]() |
[44] |
Polat K, Akdemir B, Güneş S (2008) Computer aided diagnosis of ECG data on the least square support vector machine. Digit Signal Process 18: 25–32. https://doi.org/10.1016/j.dsp.2007.05.006 doi: 10.1016/j.dsp.2007.05.006
![]() |
[45] |
Bui D. T, Pradhan B, Lofman O, et al. (2012) Landslide susceptibility mapping at Hoa Binh province (Vietnam) using an adaptive neuro-fuzzy inference system and GIS. Comput Geosci 45: 199–211. https://doi.org/10.1016/j.cageo.2011.10.031 doi: 10.1016/j.cageo.2011.10.031
![]() |
[46] |
Huang F, Yin K, Huang J, et al. (2017) Landslide susceptibility mapping based on self-organizing-map network and extreme learning machine. Engineering Geology 223: 11–22. https://doi.org/10.1016/j.enggeo.2017.04.013 doi: 10.1016/j.enggeo.2017.04.013
![]() |
[47] |
Pham B. T, Tien Bui D, Pourghasemi H. R, et al. (2017) Landslide susceptibility assesssment in the Uttarakhand area (India) using GIS: a comparison study of prediction capability of naïve bayes, multilayer perceptron neural networks, and functional trees methods. Theor Appl Climatol 128: 255–273. https://doi.org/10.1007/s00704-015-1702-9 doi: 10.1007/s00704-015-1702-9
![]() |
[48] |
Khasawneh N, Fraiwan M, Fraiwan L. (2023) Detection of K-complexes in EEG signals using deep transfer learning and YOLOv3. Cluster Comput 26: 3985–3995. https://doi.org/10.1007/s10586-022-03802-0 doi: 10.1007/s10586-022-03802-0
![]() |
[49] |
Kaur R, Kumar R, Gupta, M (2022) Predicting risk of obesity and meal planning to reduce the obesity in adulthood using artificial intelligence. Endocrine 78: 458–469. https://doi.org/10.1007/s12020-022-03215-4 doi: 10.1007/s12020-022-03215-4
![]() |
[50] |
Ikram R. M. A, Dai H. L, Ewees A. A, et al. (2022) Application of improved version of multi verse optimizer algorithm for modeling solar radiation. Energy Rep 8: 12063–12080. https://doi.org/10.1016/j.egyr.2022.09.015 doi: 10.1016/j.egyr.2022.09.015
![]() |
[51] |
Shirzadi A, Solaimani K, Roshan M. H, et al. (2019) Uncertainties of prediction accuracy in shallow landslide modeling: Sample size and raster resolution. Catena 178: 172–188. https://doi.org/10.1016/j.catena.2019.03.017 doi: 10.1016/j.catena.2019.03.017
![]() |
[52] | Kulkarni S (2023, November) Impact of Various Data Splitting Ratios on the Performance of Machine Learning Models in the Classification of Lung Cancer. In Proceedings of the Second International Conference on Emerging Trends in Engineering (ICETE 2023) (223: 96). Springer Nature. https://doi.org/10.2991/978-94-6463-252-1_12 |
[53] |
Kisi O, Mirboluki A, Naganna S. R, et al. (2022) Comparative evaluation of deep learning and machine learning in modelling pan evaporation using limited inputs. Hydrol Sci J 67: 1309–1327. https://doi.org/10.1080/02626667.2022.2063724 doi: 10.1080/02626667.2022.2063724
![]() |
Semiring | + | ⋅ | Semiring | + | ⋅ |
L2 | 0 1 1 1 |
0 0 1 1 |
R2 | 0 1 1 1 |
0 1 0 1 |
M2 | 0 1 1 1 |
0 1 1 1 |
D2 | 0 1 1 1 |
0 0 0 1 |
N2 | 0 1 1 1 |
0 0 0 0 |
T2 | 0 1 1 1 |
1 1 1 1 |
Z2 | 0 0 0 0 |
0 0 0 0 |
W2 | 0 0 0 0 |
0 0 0 1 |
Semiring | Equational basis | Semiring | Equational basis |
N2 | xy≈zt,x+x2≈x | T2 | xy≈zt,x+x2≈x2 |
Z2 | x+y≈z+u,xy≈x+y | W2 | x+y≈z+u,x2≈x,xy≈yx |