Pub Date : 2026-01-22DOI: 10.1016/j.fss.2026.109794
Paulo Vitor de Campos Souza
This study presents the pseudo-FNN, a fuzzy neural network model that integrates the pseudo-unineuron, a novel neuron type leveraging pseudo-uninorms to enhance non-commutative operations and knowledge extraction. The pseudo-FNN employs a three-layer architecture with Gaussian fuzzy neurons, where weights are derived from kernel density estimation and rule consequents are optimized using multiple algorithms. Experimental evaluations on four datasets (Iris, Haberman, Transfusion, and Mammographic Masses) demonstrate the model’s competitive performance. The pseudo-FNN outperformed traditional fuzzy neural networks such as ANFIS and showed comparable results with optimization-enhanced FNNs. Among the optimization techniques, models using SGD, Adam, and RMSProp achieved the most consistent and high accuracies across datasets with pseudo-FNN models often aligning with these trends. Statistical analysis confirmed significant improvements over non-optimized models, and the pseudo-FNN demonstrated robustness in addressing varying classification complexities. These results highlight the effectiveness of the pseudo-unineuron in advancing fuzzy neural network architectures.
{"title":"pseudo-FNN: Advancing fuzzy neural networks with pseudo-Unineurons and kernel density-based weights","authors":"Paulo Vitor de Campos Souza","doi":"10.1016/j.fss.2026.109794","DOIUrl":"10.1016/j.fss.2026.109794","url":null,"abstract":"<div><div>This study presents the pseudo-FNN, a fuzzy neural network model that integrates the pseudo-unineuron, a novel neuron type leveraging pseudo-uninorms to enhance non-commutative operations and knowledge extraction. The pseudo-FNN employs a three-layer architecture with Gaussian fuzzy neurons, where weights are derived from kernel density estimation and rule consequents are optimized using multiple algorithms. Experimental evaluations on four datasets (Iris, Haberman, Transfusion, and Mammographic Masses) demonstrate the model’s competitive performance. The pseudo-FNN outperformed traditional fuzzy neural networks such as ANFIS and showed comparable results with optimization-enhanced FNNs. Among the optimization techniques, models using SGD, Adam, and RMSProp achieved the most consistent and high accuracies across datasets with pseudo-FNN models often aligning with these trends. Statistical analysis confirmed significant improvements over non-optimized models, and the pseudo-FNN demonstrated robustness in addressing varying classification complexities. These results highlight the effectiveness of the pseudo-unineuron in advancing fuzzy neural network architectures.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"532 ","pages":"Article 109794"},"PeriodicalIF":2.7,"publicationDate":"2026-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146081386","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-22DOI: 10.1016/j.fss.2026.109790
Jaime Cesar dos Santos
Building upon specific compatibility conditions, we establish fundamental structural results concerning ordering relations for triangular fuzzy numbers. We demonstrate that orders satisfying compatibility with arithmetic operations, MIN-MAX operators, and the Weak Law of Trichotomy (WLT) are completely determined on the fibers of the natural projection to real numbers. Furthermore, such orders naturally induce — in analogy with real numbers — well-defined notions of fuzzy absolute value and fuzzy distance that preserve the essential properties of their classical counterparts. These results enable us to characterize open and closed balls through interval representations, providing a robust theoretical framework for future studies regarding metric properties of fuzzy numbers.
{"title":"Regular orders for triangular fuzzy numbers and the weak law of trichotomy","authors":"Jaime Cesar dos Santos","doi":"10.1016/j.fss.2026.109790","DOIUrl":"10.1016/j.fss.2026.109790","url":null,"abstract":"<div><div>Building upon specific compatibility conditions, we establish fundamental structural results concerning ordering relations for triangular fuzzy numbers. We demonstrate that orders satisfying compatibility with arithmetic operations, <em>MIN-MAX</em> operators, and the Weak Law of Trichotomy (WLT) are completely determined on the fibers of the natural projection to real numbers. Furthermore, such orders naturally induce — in analogy with real numbers — well-defined notions of fuzzy absolute value and fuzzy distance that preserve the essential properties of their classical counterparts. These results enable us to characterize open and closed balls through interval representations, providing a robust theoretical framework for future studies regarding metric properties of fuzzy numbers.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"532 ","pages":"Article 109790"},"PeriodicalIF":2.7,"publicationDate":"2026-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146081372","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-20DOI: 10.1016/j.fss.2026.109789
Dong Qiu , Nianxi Huang , Yandan Jiang
In this paper, by using the properties of their endpoint-valued functions, we gave characterizations of various generalized differentiabilities of interval-valued functions and fuzzy number-valued functions, which provide more convenient calculating and discriminating formulas than directly according to the definitions. By comparing these characterizations, we revealed the complete and detailed connection between the different types of differentiabilities. In addition, for n-fold interval-valued functions, we proposed two new definitions: combined gH-differentiability of coordinate components and metric-based differentiability in coordinates, to generalize existing differentiabilities; for fuzzy number-valued functions, we introduced gH⁎⁎-differentiability to improve the existing gH*-differentiability. The obtained results extend and improve the ones in the literature.
{"title":"Characterizations and relation of generalized differentiabilities of interval-valued functions and fuzzy number-valued functions","authors":"Dong Qiu , Nianxi Huang , Yandan Jiang","doi":"10.1016/j.fss.2026.109789","DOIUrl":"10.1016/j.fss.2026.109789","url":null,"abstract":"<div><div>In this paper, by using the properties of their endpoint-valued functions, we gave characterizations of various generalized differentiabilities of interval-valued functions and fuzzy number-valued functions, which provide more convenient calculating and discriminating formulas than directly according to the definitions. By comparing these characterizations, we revealed the complete and detailed connection between the different types of differentiabilities. In addition, for <em>n</em>-fold interval-valued functions, we proposed two new definitions: combined <em>gH</em>-differentiability of coordinate components and metric-based differentiability in coordinates, to generalize existing differentiabilities; for fuzzy number-valued functions, we introduced <em>gH</em><sup>⁎⁎</sup>-differentiability to improve the existing <em>gH</em>*-differentiability. The obtained results extend and improve the ones in the literature.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"531 ","pages":"Article 109789"},"PeriodicalIF":2.7,"publicationDate":"2026-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-20DOI: 10.1016/j.fss.2026.109791
Taras Banakh , Krzysztof Caban , Filip Strobin
In the paper we unify two extensions of the classical Hutchinson–Barnsley theory - the topological and the fuzzy-set approaches. We show that a fuzzy iterated function system (fuzzy IFS) on a Tychonoff space X which is contracting w.r.t. some admissible multimetric, generates a natural fuzzy attractor in the hyperspace of all compact fuzzy sets. As a consequence, we prove that a fuzzy IFS on a Hausdorff topological space which is topologically contracting admits a fuzzy attractor in a bit weaker sense. Our discussion involves investigations on topologies on the hyperspace which are suitable for establishing convergence of sequences of iterations of a fuzzy Hutchinson operator.
{"title":"A topological approach to fuzzy iterated function systems","authors":"Taras Banakh , Krzysztof Caban , Filip Strobin","doi":"10.1016/j.fss.2026.109791","DOIUrl":"10.1016/j.fss.2026.109791","url":null,"abstract":"<div><div>In the paper we unify two extensions of the classical Hutchinson–Barnsley theory - the topological and the fuzzy-set approaches. We show that a fuzzy iterated function system (fuzzy IFS) on a Tychonoff space <em>X</em> which is contracting w.r.t. some admissible multimetric, generates a natural fuzzy attractor in the hyperspace <span><math><mrow><msub><mi>K</mi><mi>F</mi></msub><mrow><mo>(</mo><mi>X</mi><mo>)</mo></mrow></mrow></math></span> of all compact fuzzy sets. As a consequence, we prove that a fuzzy IFS on a Hausdorff topological space which is topologically contracting admits a fuzzy attractor in a bit weaker sense. Our discussion involves investigations on topologies on the hyperspace <span><math><mrow><msub><mi>K</mi><mi>F</mi></msub><mrow><mo>(</mo><mi>X</mi><mo>)</mo></mrow></mrow></math></span> which are suitable for establishing convergence of sequences of iterations of a fuzzy Hutchinson operator.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"532 ","pages":"Article 109791"},"PeriodicalIF":2.7,"publicationDate":"2026-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146049215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this work, we introduce the concept of Ω-vector spaces, extending the framework of Ω-algebras by incorporating a vector space structure over a field. These structures are defined over a complete lattice and equipped with an Ω-valued equality, which replaces the classical relation of being equal. We provide an equivalent characterization of Ω-vector spaces via cut-quotient structures and prove that each cut induces a classical vector space. Furthermore, we introduce the notion of Ω-vector subspaces and investigate the lattice-theoretic properties of their collection, including intersections and sums. Finally, we show an application for approximately solving systems of linear equations in this context. Several examples illustrate the theory, highlighting the algebraic richness and structural consistency of Ω-vector spaces.
{"title":"Ω-vector spaces","authors":"Patricia Ferrero , Jorge Jiménez , María Luisa Serrano , Branimir Šešelja , Andreja Tepavčević","doi":"10.1016/j.fss.2026.109776","DOIUrl":"10.1016/j.fss.2026.109776","url":null,"abstract":"<div><div>In this work, we introduce the concept of Ω-vector spaces, extending the framework of Ω-algebras by incorporating a vector space structure over a field. These structures are defined over a complete lattice and equipped with an Ω-valued equality, which replaces the classical relation of being equal. We provide an equivalent characterization of Ω-vector spaces via cut-quotient structures and prove that each cut induces a classical vector space. Furthermore, we introduce the notion of Ω-vector subspaces and investigate the lattice-theoretic properties of their collection, including intersections and sums. Finally, we show an application for approximately solving systems of linear equations in this context. Several examples illustrate the theory, highlighting the algebraic richness and structural consistency of Ω-vector spaces.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"531 ","pages":"Article 109776"},"PeriodicalIF":2.7,"publicationDate":"2026-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-16DOI: 10.1016/j.fss.2026.109777
Jieqiong Shi , Bin Zhao , Bernard De Baets
It is well known that the distributivity of one aggregation function over another is a desirable interaction between aggregation functions and has been continuously studied in the literature both for theoretical and practical reasons. Among the many classes of aggregation functions introduced over the past decades, the classes of uninorms and nullnorms stand out because of their potential applications in a broad variety of fields. Similarly, the classes of overlap and grouping functions have received ample attention. In this paper, on the one hand, we focus on the class of S-uninorms, a common generalization of nullnorms and conjunctive uninorms. On the other hand, we consider other more general classes of general overlap and general grouping functions. We continue and wrap up the investigation of the distributivity equation for the above-mentioned classes. In particular, we discuss the distributivity of S-uninorms (with an underlying uninorm belonging to ) over general overlap or general grouping functions, and vice versa. In both cases, we fully characterize the solutions by providing necessary and sufficient conditions.
{"title":"Distributivity between S-uninorms and general overlap or general grouping functions","authors":"Jieqiong Shi , Bin Zhao , Bernard De Baets","doi":"10.1016/j.fss.2026.109777","DOIUrl":"10.1016/j.fss.2026.109777","url":null,"abstract":"<div><div>It is well known that the distributivity of one aggregation function over another is a desirable interaction between aggregation functions and has been continuously studied in the literature both for theoretical and practical reasons. Among the many classes of aggregation functions introduced over the past decades, the classes of uninorms and nullnorms stand out because of their potential applications in a broad variety of fields. Similarly, the classes of overlap and grouping functions have received ample attention. In this paper, on the one hand, we focus on the class of S-uninorms, a common generalization of nullnorms and conjunctive uninorms. On the other hand, we consider other more general classes of general overlap and general grouping functions. We continue and wrap up the investigation of the distributivity equation for the above-mentioned classes. In particular, we discuss the distributivity of S-uninorms (with an underlying uninorm belonging to <span><math><msub><mi>U</mi><mi>min</mi></msub></math></span>) over general overlap or general grouping functions, and vice versa. In both cases, we fully characterize the solutions by providing necessary and sufficient conditions.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"531 ","pages":"Article 109777"},"PeriodicalIF":2.7,"publicationDate":"2026-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039543","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper investigates a dynamic event-triggered practically predefined-time control (PPTC) scheme for stochastic nonlinear systems (SNSs) under state constraints and input dead zones. A nonlinear state-dependent function (NSDF) is introduced to enforce state constraints. To address input dead-zone nonlinearities and mitigate the complexity growth inherent in backstepping, novel predefined-time compensating filters (PTCFs) and predefined-time filters (PTFs) are designed. These filters guarantee the convergence of filter states within a predefined time and effectively suppress the influence of dead zones. Building on this, a semiglobal predefined-time adaptive fuzzy tracking control algorithm is developed, where a fuzzy logic system (FLS) approximates unknown nonlinear dynamics. Furthermore, a dynamic event-triggered mechanism (DETM) is incorporated into the framework to reduce communication load. The present control scheme ensures tracking error convergence within a predefined time and uniform boundedness of all closed-loop signals in the pth moment. Finally, a simulation example is conducted to demonstrate the effectiveness of the proposed strategy.
{"title":"Practically predefined-time adaptive fuzzy control for stochastic nonlinear systems with full state constraints and dead zones","authors":"Mengqing Cheng , Shuo Shan , Junsheng Zhao , Shixiong Fang , Haikun Wei , Kanjian Zhang","doi":"10.1016/j.fss.2026.109779","DOIUrl":"10.1016/j.fss.2026.109779","url":null,"abstract":"<div><div>This paper investigates a dynamic event-triggered practically predefined-time control (PPTC) scheme for stochastic nonlinear systems (SNSs) under state constraints and input dead zones. A nonlinear state-dependent function (NSDF) is introduced to enforce state constraints. To address input dead-zone nonlinearities and mitigate the complexity growth inherent in backstepping, novel predefined-time compensating filters (PTCFs) and predefined-time filters (PTFs) are designed. These filters guarantee the convergence of filter states within a predefined time and effectively suppress the influence of dead zones. Building on this, a semiglobal predefined-time adaptive fuzzy tracking control algorithm is developed, where a fuzzy logic system (FLS) approximates unknown nonlinear dynamics. Furthermore, a dynamic event-triggered mechanism (DETM) is incorporated into the framework to reduce communication load. The present control scheme ensures tracking error convergence within a predefined time and uniform boundedness of all closed-loop signals in the <em>p</em>th moment. Finally, a simulation example is conducted to demonstrate the effectiveness of the proposed strategy.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"531 ","pages":"Article 109779"},"PeriodicalIF":2.7,"publicationDate":"2026-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-14DOI: 10.1016/j.fss.2026.109774
M. Svistula, T. Sribnaya, R. Uzbekov
In the present paper we propose such an abstract setting, which allows us to obtain as consequences both known and new results on the coincidence of the Choquet integral and the pan-integral. For example: in the case of a measurable space we derive a well-known theorem that the weak (M)-property of a monotone measure is necessary and sufficient for the coincidence of the integrals under consideration for all nonnegative measurable integrands; in the case of a topological space we use the integrals with respect to a regular monotone measure and establish some new results, in particular, that the Choquet integral and the pan-integral with respect to a topological measure coincide for all nonnegative lower semicontinuous integrands.
Next, in the case of a measurable space we give an example to show that the weak (M)-property is weaker than the middle (M)-property, and thus we solve an open problem of the relationship between these properties.
{"title":"On the coincidence of the Choquet integral and the pan-integral: An abstract setting and examples","authors":"M. Svistula, T. Sribnaya, R. Uzbekov","doi":"10.1016/j.fss.2026.109774","DOIUrl":"10.1016/j.fss.2026.109774","url":null,"abstract":"<div><div>In the present paper we propose such an abstract setting, which allows us to obtain as consequences both known and new results on the coincidence of the Choquet integral and the pan-integral. For example: in the case of a measurable space we derive a well-known theorem that the weak (M)-property of a monotone measure is necessary and sufficient for the coincidence of the integrals under consideration for all nonnegative measurable integrands; in the case of a topological space we use the integrals with respect to a regular monotone measure and establish some new results, in particular, that the Choquet integral and the pan-integral with respect to a topological measure coincide for all nonnegative lower semicontinuous integrands.</div><div>Next, in the case of a measurable space we give an example to show that the weak (M)-property is weaker than the middle (M)-property, and thus we solve an open problem of the relationship between these properties.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"532 ","pages":"Article 109774"},"PeriodicalIF":2.7,"publicationDate":"2026-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146049214","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-14DOI: 10.1016/j.fss.2026.109772
Chuang Zheng
<div><div>In this paper, we solve the fuzzy linear systems in a fuzzy number space <span><math><mi>X</mi></math></span>, namely the Gaussian probability density membership function (Gaussian-PDMF) space. The fuzzy linear systems include two types: the semi-fuzzy linear system (SFLS) and the fully-fuzzy linear system (FFLS). First, we solve the SFLS <span><math><mrow><mi>A</mi><mrow><mover><mi>x</mi><mo>˜</mo></mover></mrow><mo>=</mo><mrow><mover><mi>b</mi><mo>˜</mo></mover></mrow></mrow></math></span>, where <span><math><mrow><mi>A</mi><mo>∈</mo><msup><mi>R</mi><mrow><mi>m</mi><mo>×</mo><mi>n</mi></mrow></msup></mrow></math></span> is a real-valued matrix, <span><math><mrow><mover><mi>b</mi><mo>˜</mo></mover></mrow></math></span> is a fuzzy number vector, and <span><math><mrow><mover><mi>x</mi><mo>˜</mo></mover></mrow></math></span> is the unknown fuzzy number vector. The elements of both <span><math><mrow><mover><mi>b</mi><mo>˜</mo></mover></mrow></math></span> and <span><math><mrow><mover><mi>x</mi><mo>˜</mo></mover></mrow></math></span> belong to <span><math><mi>X</mi></math></span>. We present the Cramer’s rule to calculate the solution with square matrix <em>A</em> and find out that its solution set is a <span><math><mrow><mn>5</mn><mo>(</mo><mi>n</mi><mo>−</mo><mi>R</mi><mo>(</mo><mi>A</mi><mo>)</mo><mo>)</mo></mrow></math></span> dimensional affine space with <span><math><mrow><mi>A</mi><mo>∈</mo><msup><mi>R</mi><mrow><mi>m</mi><mo>×</mo><mi>n</mi></mrow></msup></mrow></math></span> and <em>R</em>(<em>A</em>) being the rank of <em>A</em>. The explicit form of the solution for RREF matrix <em>A</em> is stated to ensure usability for modeling. Secondly, we solve the FFLS <span><math><mrow><mrow><mover><mi>A</mi><mo>˜</mo></mover></mrow><mrow><mover><mi>x</mi><mo>˜</mo></mover></mrow><mo>=</mo><mrow><mover><mi>b</mi><mo>˜</mo></mover></mrow></mrow></math></span>, where <span><math><mrow><mover><mi>A</mi><mo>˜</mo></mover></mrow></math></span> is a fuzzy matrix with all components in <span><math><mi>X</mi></math></span>. We analyze its solution set and present the parametric form of solutions under the fuzzy RREF matrix. We then adapt Gaussian elimination method to fuzzy matrices and systems by restricting it to the unit group of ring <span><math><mi>X</mi></math></span>, proving the equivalence of solution sets after elementary row operations. We also establish the connection between FFLS and SFLS by confining elements of <span><math><mrow><mover><mi>A</mi><mo>˜</mo></mover></mrow></math></span> to a subset of <span><math><mi>X</mi></math></span> that forms a field. In the third part, two numerical examples are given to illustrated our method. All results in this paper are explicit since the Gaussian-PDMF space <span><math><mi>X</mi></math></span>, to which the membership function of the fuzzy number belongs, possesses a complete algebraic structure. The proposed framework offers a feasible and systematical tool for solving the mathematical m
本文在模糊数空间X,即高斯概率密度隶属函数(Gaussian- pdmf)空间中求解模糊线性系统。模糊线性系统包括半模糊线性系统和全模糊线性系统两种类型。首先,我们求解SFLS Ax ~ =b ~,其中A∈Rm×n为实值矩阵,b ~为模糊数向量,x ~为未知模糊数向量。我们提出了计算具有方阵A的解的Cramer规则,并发现其解集是一个5(n−R(A))维仿射空间,其中A∈Rm×n, R(A)为A的秩。为了保证建模的可用性,我们给出了RREF矩阵A解的显式形式。其次,我们求解了FFLS A ~ x ~ =b ~,其中A ~是一个所有成分都在x中的模糊矩阵,我们分析了它的解集,并给出了模糊RREF矩阵下解的参数形式。然后将高斯消去法限定在环X的单位群上,将其应用于模糊矩阵和系统,证明了初等行运算后解集的等价性。我们还通过将A ~的元素限定为X的一个子集来建立FFLS和SFLS之间的联系。在第三部分中,给出了两个数值例子来说明我们的方法。由于模糊数的隶属函数所在的高斯- pdmf空间X具有完备的代数结构,所以本文的所有结果都是显式的。该框架为求解具有不确定性和模糊性的模糊线性系统的数学模型提供了一种可行的系统工具。
{"title":"Solving fuzzy linear systems in Gaussian PDMF space","authors":"Chuang Zheng","doi":"10.1016/j.fss.2026.109772","DOIUrl":"10.1016/j.fss.2026.109772","url":null,"abstract":"<div><div>In this paper, we solve the fuzzy linear systems in a fuzzy number space <span><math><mi>X</mi></math></span>, namely the Gaussian probability density membership function (Gaussian-PDMF) space. The fuzzy linear systems include two types: the semi-fuzzy linear system (SFLS) and the fully-fuzzy linear system (FFLS). First, we solve the SFLS <span><math><mrow><mi>A</mi><mrow><mover><mi>x</mi><mo>˜</mo></mover></mrow><mo>=</mo><mrow><mover><mi>b</mi><mo>˜</mo></mover></mrow></mrow></math></span>, where <span><math><mrow><mi>A</mi><mo>∈</mo><msup><mi>R</mi><mrow><mi>m</mi><mo>×</mo><mi>n</mi></mrow></msup></mrow></math></span> is a real-valued matrix, <span><math><mrow><mover><mi>b</mi><mo>˜</mo></mover></mrow></math></span> is a fuzzy number vector, and <span><math><mrow><mover><mi>x</mi><mo>˜</mo></mover></mrow></math></span> is the unknown fuzzy number vector. The elements of both <span><math><mrow><mover><mi>b</mi><mo>˜</mo></mover></mrow></math></span> and <span><math><mrow><mover><mi>x</mi><mo>˜</mo></mover></mrow></math></span> belong to <span><math><mi>X</mi></math></span>. We present the Cramer’s rule to calculate the solution with square matrix <em>A</em> and find out that its solution set is a <span><math><mrow><mn>5</mn><mo>(</mo><mi>n</mi><mo>−</mo><mi>R</mi><mo>(</mo><mi>A</mi><mo>)</mo><mo>)</mo></mrow></math></span> dimensional affine space with <span><math><mrow><mi>A</mi><mo>∈</mo><msup><mi>R</mi><mrow><mi>m</mi><mo>×</mo><mi>n</mi></mrow></msup></mrow></math></span> and <em>R</em>(<em>A</em>) being the rank of <em>A</em>. The explicit form of the solution for RREF matrix <em>A</em> is stated to ensure usability for modeling. Secondly, we solve the FFLS <span><math><mrow><mrow><mover><mi>A</mi><mo>˜</mo></mover></mrow><mrow><mover><mi>x</mi><mo>˜</mo></mover></mrow><mo>=</mo><mrow><mover><mi>b</mi><mo>˜</mo></mover></mrow></mrow></math></span>, where <span><math><mrow><mover><mi>A</mi><mo>˜</mo></mover></mrow></math></span> is a fuzzy matrix with all components in <span><math><mi>X</mi></math></span>. We analyze its solution set and present the parametric form of solutions under the fuzzy RREF matrix. We then adapt Gaussian elimination method to fuzzy matrices and systems by restricting it to the unit group of ring <span><math><mi>X</mi></math></span>, proving the equivalence of solution sets after elementary row operations. We also establish the connection between FFLS and SFLS by confining elements of <span><math><mrow><mover><mi>A</mi><mo>˜</mo></mover></mrow></math></span> to a subset of <span><math><mi>X</mi></math></span> that forms a field. In the third part, two numerical examples are given to illustrated our method. All results in this paper are explicit since the Gaussian-PDMF space <span><math><mi>X</mi></math></span>, to which the membership function of the fuzzy number belongs, possesses a complete algebraic structure. The proposed framework offers a feasible and systematical tool for solving the mathematical m","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"531 ","pages":"Article 109772"},"PeriodicalIF":2.7,"publicationDate":"2026-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039481","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-14DOI: 10.1016/j.fss.2026.109773
Hao Qiu , Huamin Wang , Likui Wang , Shiping Wen
In practical industrial systems, we often encounter nonlinear uncertainties, parameter jumps, or time-delay phenomena that easily destroy the stability of the system. To stabilize these disturbances, we construct a more general closed-loop interval type-2 fuzzy delayed semi-Markov jump system (IT-2FD S-MJS) and investigate its stochastic stability in this article. Firstly, to optimize the performance of computational resources and data transmission, we introduce quantization techniques and novel adaptive dynamic data sampling-based event-triggered mechanisms, greatly reducing the number of triggers and improving the flexibility of adjustment. The framework’s discrete sampling nature inherently prevents Zeno behavior by eliminating the possibility of infinite triggers within finite time intervals. Then, by constructing boundary/general uncertain transition rates (BUTR/GUTR) and slack matrices, we derive sufficient conditions with less conservatism of stochastic stability for IT-2FD S-MJS. It should be noticed that the unknown transition information is modeled by BUTR/GUTR, and the conservatism of mismatched membership functions is reduced by introducing the slack matrices. Meanwhile, we obtain the corresponding gain parameters of the adaptive dynamic event-triggered quantization controller using linear matrix inequality (LMI) technology, with implementation details specified in Algorithms 1 and 2. Finally, we take the robotic arm and tunnel diode circuit as examples to verify the validity of the theorems.
{"title":"Adaptive dynamic event-triggered control for IT-2 fuzzy delayed semi-Markov jump systems with different uncertain transition rates","authors":"Hao Qiu , Huamin Wang , Likui Wang , Shiping Wen","doi":"10.1016/j.fss.2026.109773","DOIUrl":"10.1016/j.fss.2026.109773","url":null,"abstract":"<div><div>In practical industrial systems, we often encounter nonlinear uncertainties, parameter jumps, or time-delay phenomena that easily destroy the stability of the system. To stabilize these disturbances, we construct a more general closed-loop interval type-2 fuzzy delayed semi-Markov jump system (IT-2FD S-MJS) and investigate its stochastic stability in this article. Firstly, to optimize the performance of computational resources and data transmission, we introduce quantization techniques and novel adaptive dynamic data sampling-based event-triggered mechanisms, greatly reducing the number of triggers and improving the flexibility of adjustment. The framework’s discrete sampling nature inherently prevents Zeno behavior by eliminating the possibility of infinite triggers within finite time intervals. Then, by constructing boundary/general uncertain transition rates (BUTR/GUTR) and slack matrices, we derive sufficient conditions with less conservatism of stochastic stability for IT-2FD S-MJS. It should be noticed that the unknown transition information is modeled by BUTR/GUTR, and the conservatism of mismatched membership functions is reduced by introducing the slack matrices. Meanwhile, we obtain the corresponding gain parameters of the adaptive dynamic event-triggered quantization controller using linear matrix inequality (LMI) technology, with implementation details specified in Algorithms 1 and 2. Finally, we take the robotic arm and tunnel diode circuit as examples to verify the validity of the theorems.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"531 ","pages":"Article 109773"},"PeriodicalIF":2.7,"publicationDate":"2026-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039542","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}