Based on S-rough sets（singular rough sets）, this paper presents function S-rough sets （function singular rough sets）and its mathematical structures and features. Function S-rough sets has two forms： function one ...Based on S-rough sets（singular rough sets）, this paper presents function S-rough sets （function singular rough sets）and its mathematical structures and features. Function S-rough sets has two forms： function one direction S-rough sets （function one direction singular rough sets） and function two direction S-rough sets （function two direction singular rough sets）. This paper advances the relationship theorem of function S-rough sets and S-rough sets. Function S-rough sets is the general form of S-rough sets, and S-rough sets is the special ease of function S-rough sets. In this paper, applications of function S-rough sets in rough law mining-discovery of system are given. Function S-rough sets is a new research direction of rough sets and rough system.展开更多
Function S-rough sets （function singular rough sets） is defined on a -function equivalence class [u]. Function S-rough sets is the extension form of S-rough sets. By using the function S-rough sets, this paper gives...Function S-rough sets （function singular rough sets） is defined on a -function equivalence class [u]. Function S-rough sets is the extension form of S-rough sets. By using the function S-rough sets, this paper gives rough law generation model of a-function equivalence class, discussion on law mining and law discovery in systems, and application of law mining and law discovery in communication system. Function S-rough sets is a new theory and method in law mining research.展开更多
Function S-rough sets has the properties of dynamics, heredity, and memory. Function S-rough sets is penetrated and crossed with the issue of economic law forecast, then a new forecast model based on function S-rough ...Function S-rough sets has the properties of dynamics, heredity, and memory. Function S-rough sets is penetrated and crossed with the issue of economic law forecast, then a new forecast model based on function S-rough sets namely the two law forecast model is proposed, which includes upper law forecast model and lower law forecast model; and its＇ implement algorithm is given. Finally, the validity of the model is demonstrated by the forecast for region economic development of Hainan Province.展开更多
Function S-rough sets(Function Singular rough sets) are defined by R-function equivalence class which has dynamic characteristic, and a function is s law, function S-rough sets have law characteristic. Function S-roug...Function S-rough sets(Function Singular rough sets) are defined by R-function equivalence class which has dynamic characteristic, and a function is s law, function S-rough sets have law characteristic. Function S-rough sets has these forms: function one direction S-rough sets, function two direction S-rough sets and dual of function one direction S-rough sets. This paper presents the law characteristic of function one direction S-rough sets and puts forward the theorems of law-chain-attribute and law-belt. Function S-rough sets is s new research direction of the rough sets theory.展开更多
By introducing element equivalence class that proposes dynamic characteristic into Pawlak Z rough sets theory, the first author of this paper improved Pawlak Z rough sets and put forward S-rough sets （singular rough ...By introducing element equivalence class that proposes dynamic characteristic into Pawlak Z rough sets theory, the first author of this paper improved Pawlak Z rough sets and put forward S-rough sets （singular rough sets）. S-rough sets are defined by element equivalence class that proposes dynamic characteristic. S-rough sets have dynamic characteristic. By introducing the function equivalence class （law equivalence class） that proposes dynamic characteristic into S-rough sets, the first author improved S-rough sets and put forward function S-rough sets （function singular rough sets）. Function S-rough sets have dynamic characteristic and law characteristic, and a function is a law. By using function S-rough sets, this paper presents law identification, law identification theorem, and law identification criterion and applications. Function S-rough sets are a new research direction of rough sets theory, and it is also a new tool to the research of system law identification.展开更多
Function S-rbugh sets are defined by R-function equivalence class, which have dynamic characteristic. Function S-rough sets have dynamic characteristic, law characteristic and law-hiding characteristic. Function S-rou...Function S-rbugh sets are defined by R-function equivalence class, which have dynamic characteristic. Function S-rough sets have dynamic characteristic, law characteristic and law-hiding characteristic. Function S-rough sets can generate f-hiding law and f-hiding law. By engrafting, crossing, and penetrating between the information security theory and function S-rough sets, the security hiding and the authentication of f-hiding law and f-hiding law are given respectively in this paper. The fusion and share between function S-rough sets and information security theory is a new research direction of the application of information law in information system.展开更多
It is very important in the field of bioinformatics to apply computer to perform the function annotation for new sequenced bio-sequences. Based on GO database and BLAST program, a novel method for the function annotat...It is very important in the field of bioinformatics to apply computer to perform the function annotation for new sequenced bio-sequences. Based on GO database and BLAST program, a novel method for the function annotation of new biological sequences is presented by using the variable-precision rough set theory. The proposed method is applied to the real data in GO database to examine its effectiveness. Numerical results show that the proposed method has better precision, recall-rate and harmonic mean value compared with existing methods.展开更多
Singular rough sets （S-rough sets） have three classes of forms： one-directional S-rough sets, dual of onedirectional S-rough sets, and two-directional S-rough sets. Dynamic, hereditary, mnemonic, and hiding propert...Singular rough sets （S-rough sets） have three classes of forms： one-directional S-rough sets, dual of onedirectional S-rough sets, and two-directional S-rough sets. Dynamic, hereditary, mnemonic, and hiding properties are the basic characteristics of S-rough sets. By using the S-rough sets, the concepts of f-hiding knowledge, F-hiding knowledge, hiding degree, and hiding dependence degree are given. Then, both the hiding theorem and the hiding dependence theorem of hiding knowledge are proposed. Finally, an application of hiding knowledge is discussed.展开更多
In this paper, the uniqueness of meromorphic functions with common range sets and deficient values are studied. This result is related to a question of Gross.
We consider the topological behaviors of continuous maps with one topological attractor on compact metric space X.This kind of map is a generalization of maps such as topologically expansive Lorenz map,unimodal map wi...We consider the topological behaviors of continuous maps with one topological attractor on compact metric space X.This kind of map is a generalization of maps such as topologically expansive Lorenz map,unimodal map without homtervals and so on.Under the finiteness and basin conditions,we provide a leveled A-R pair decomposition for such maps,and characterize α-limit set of each point.Based on weak Morse decomposition of X,we construct a bounded Lyapunov function V(x),which gives a clear description of orbit behavior of each point in X except a meager set.展开更多
The concepts of the lower approximation integral,the upper approximation integral and rough integrals are given on the basis of function rough sets.Based on these concepts,the relation of the lower approximation integ...The concepts of the lower approximation integral,the upper approximation integral and rough integrals are given on the basis of function rough sets.Based on these concepts,the relation of the lower approximation integrals,the relation of the upper approximation integrals,the relation of rough integrals,and the double median theorem of rough integrals are discussed.Rough integrals have finite contraction characteristic and finite extension characteristic.展开更多
Let S1 = {∞} and S2 = {ω ： Ps（ω） = 0}, Ps（ω） being a uniqueness polynomial under some restricted conditions. Then, for any given nonconstant meromorphic function f, there exist at most finitely many nonconsta...Let S1 = {∞} and S2 = {ω ： Ps（ω） = 0}, Ps（ω） being a uniqueness polynomial under some restricted conditions. Then, for any given nonconstant meromorphic function f, there exist at most finitely many nonconstant meromorphic functions g such that f^-1 （Si） = g^-1 （Si） （i = 1, 2）, where f^-1 （Si） and g^-1 （Si） denote the pull-backs of Si considered as a divisor, namely, the inverse images of Si counted with multiplicities, by f and g respectively.展开更多
In this article, we deal with the uniqueness problems on meromorphic functions sharing two finite sets in an angular domain instead of the whole plane C. In particular, we investigate the uniqueness for meromorphic fu...In this article, we deal with the uniqueness problems on meromorphic functions sharing two finite sets in an angular domain instead of the whole plane C. In particular, we investigate the uniqueness for meromorphic functions of infinite order in an angular domain and obtain some results. Moreover, examples show that the conditions in theorems are necessary.展开更多
Multi-criteria decision-making(MCDM)is essential for handling complex decision problems under uncertainty,especially in fields such as criminal justice,healthcare,and environmental management.Traditional fuzzy MCDM te...Multi-criteria decision-making(MCDM)is essential for handling complex decision problems under uncertainty,especially in fields such as criminal justice,healthcare,and environmental management.Traditional fuzzy MCDM techniques have failed to deal with problems where uncertainty or vagueness is involved.To address this issue,we propose a novel framework that integrates group and overlap functions with Aczel-Alsina(AA)operational laws in the intuitionistic fuzzy set(IFS)environment.Overlap functions capture the degree to which two inputs share common features and are used to find how closely two values or criteria match in uncertain environments,while the Group functions are used to combine different expert opinions into a single collective result.This study introduces four new aggregation operators:Group Overlap function-based intuitionistic fuzzy Aczel-Alsina(GOF-IFAA)Weighted Averaging(GOF-IFAAWA)operator,intuitionistic fuzzy Aczel-Alsina(GOF-IFAA)Weighted Geometric(GOF-IFAAWG),intuitionistic fuzzy Aczel-Alsina(GOF-IFAA)OrderedWeighted Averaging(GOF-IFAAOWA),and intuitionistic fuzzy Aczel-Alsina(GOF-IFAA)Ordered Weighted Geometric(GOF-IFAAOWG),which are rigorously defined and mathematically analyzed and offer improved flexibility in managing overlapping,uncertain,and hesitant information.The properties of these operators are discussed in detail.Further,the effectiveness,validity,activeness,and ability to capture the uncertain information,the developed operators are applied to the AI-based Criminal Justice Policy Selection problem.At last,the comparison analysis between prior and proposed studies has been displayed,and then followed by the conclusion of the result.展开更多
Structural Reliability-Based Topology Optimization(RBTO),as an efficient design methodology,serves as a crucial means to ensure the development ofmodern engineering structures towards high performance,long service lif...Structural Reliability-Based Topology Optimization(RBTO),as an efficient design methodology,serves as a crucial means to ensure the development ofmodern engineering structures towards high performance,long service life,and high reliability.However,in practical design processes,topology optimization must not only account for the static performance of structures but also consider the impacts of various responses and uncertainties under complex dynamic conditions,which traditional methods often struggle accommodate.Therefore,this study proposes an RBTO framework based on a Kriging-assisted level set function and a novel Dynamic Hybrid Particle Swarm Optimization(DHPSO)algorithm.By leveraging the Kriging model as a surrogate,the high cost associated with repeatedly running finite element analysis processes is reduced,addressing the issue of minimizing structural compliance.Meanwhile,the DHPSO algorithm enables a better balance between the population’s developmental and exploratory capabilities,significantly accelerating convergence speed and enhancing global convergence performance.Finally,the proposed method is validated through three different structural examples,demonstrating its superior performance.Observed that the computational that,compared to the traditional Solid Isotropic Material with Penalization(SIMP)method,the proposed approach reduces the upper bound of structural compliance by approximately 30%.Additionally,the optimized results exhibit clear material interfaces without grayscale elements,and the stress concentration factor is reduced by approximately 42%.Consequently,the computational results fromdifferent examples verify the effectiveness and superiority of this study across various fields,achieving the goal of providing more precise optimization results within a shorter timeframe.展开更多
In this paper we establish sharp H/51der estimates of harmonic functions on a class of connected post critically finite （p.c.f.） self-similar sets, and show that functions in the domain of Laplacian enjoy the same p...In this paper we establish sharp H/51der estimates of harmonic functions on a class of connected post critically finite （p.c.f.） self-similar sets, and show that functions in the domain of Laplacian enjoy the same property. Some weU-known examples, such as the Sierpinski gasket, the unit interval, the level 3 Sierpinski gasket, the hexagasket, the 3-dimensional Sierpinski gasket, and the Vicsek set are also considered.展开更多
The purpose of this paper is to introduce and discuss the concept of topical functions on upward sets. We give characterizations of topical functions in terms of upward sets.
In this paper we establish the oscillation inequality of harmonic functions and HOlder estimate of the functions in the domain of the Laplacian on connected post critically finite （p.c.f.） self-similar sets.
In this paper we study the problem of meromorphic functions sharing three sets and obtain some theorems which are the extension and complement of some known relative results given by Yi Hongxun and others.
We propose a new approach to the investigation of deterministic self-similar networks by using contractive iterated multifunction systems (briefly IMSs). Our paper focuses on the generalized version of two graph model...We propose a new approach to the investigation of deterministic self-similar networks by using contractive iterated multifunction systems (briefly IMSs). Our paper focuses on the generalized version of two graph models introduced by Barabási, Ravasz and Vicsek ([1] [2]). We generalize the graph models using stars and cliques: both algorithm construct graph sequences such that the next iteration is always based on n replicas of the current iteration, where n is the size of the initial graph structure, being a star or a clique. We analyze these self-similar graph sequences using IMSs in function of the size of the initial star and clique, respectively. Our research uses the Cantor set for the description of the fixed set of these IMSs, which we interpret as the limit object of the analyzed self-similar networks.展开更多
基金This project was surpported by the Natural Science Foundation of Shandong Province of China (Y2004A94)
文摘Based on S-rough sets（singular rough sets）, this paper presents function S-rough sets （function singular rough sets）and its mathematical structures and features. Function S-rough sets has two forms： function one direction S-rough sets （function one direction singular rough sets） and function two direction S-rough sets （function two direction singular rough sets）. This paper advances the relationship theorem of function S-rough sets and S-rough sets. Function S-rough sets is the general form of S-rough sets, and S-rough sets is the special ease of function S-rough sets. In this paper, applications of function S-rough sets in rough law mining-discovery of system are given. Function S-rough sets is a new research direction of rough sets and rough system.
基金This project was supported by Natural Science Foundation of Shandong Province of China (Y2004A04), Natural ScienceFoundation of Fujian of China (Z051049) and Education Foundation of Fujian of China (JA04268),.
文摘Function S-rough sets （function singular rough sets） is defined on a -function equivalence class [u]. Function S-rough sets is the extension form of S-rough sets. By using the function S-rough sets, this paper gives rough law generation model of a-function equivalence class, discussion on law mining and law discovery in systems, and application of law mining and law discovery in communication system. Function S-rough sets is a new theory and method in law mining research.
基金supported by the National Natural Science Foundation of China (60364001, 70461004)the Hainan Provincial Natural Science Foundation of China (807054)Hainan Provincial Eduction Office Foundation (HJ2008-56).
文摘Function S-rough sets has the properties of dynamics, heredity, and memory. Function S-rough sets is penetrated and crossed with the issue of economic law forecast, then a new forecast model based on function S-rough sets namely the two law forecast model is proposed, which includes upper law forecast model and lower law forecast model; and its＇ implement algorithm is given. Finally, the validity of the model is demonstrated by the forecast for region economic development of Hainan Province.
基金Supported by the Nature Science Foundation of Henan Province(0511012700).
文摘Function S-rough sets(Function Singular rough sets) are defined by R-function equivalence class which has dynamic characteristic, and a function is s law, function S-rough sets have law characteristic. Function S-rough sets has these forms: function one direction S-rough sets, function two direction S-rough sets and dual of function one direction S-rough sets. This paper presents the law characteristic of function one direction S-rough sets and puts forward the theorems of law-chain-attribute and law-belt. Function S-rough sets is s new research direction of the rough sets theory.
基金the National Natural Science Foundation of China (Grant No. 60364001)the key Project of Chinese Ministry of Education (Grant No. 206089)the Natural Science Foundation of Shandong Province of China (Grant No. Y2007H02)
文摘By introducing element equivalence class that proposes dynamic characteristic into Pawlak Z rough sets theory, the first author of this paper improved Pawlak Z rough sets and put forward S-rough sets （singular rough sets）. S-rough sets are defined by element equivalence class that proposes dynamic characteristic. S-rough sets have dynamic characteristic. By introducing the function equivalence class （law equivalence class） that proposes dynamic characteristic into S-rough sets, the first author improved S-rough sets and put forward function S-rough sets （function singular rough sets）. Function S-rough sets have dynamic characteristic and law characteristic, and a function is a law. By using function S-rough sets, this paper presents law identification, law identification theorem, and law identification criterion and applications. Function S-rough sets are a new research direction of rough sets theory, and it is also a new tool to the research of system law identification.
基金the National Natural Science Foundation of China (Grant No.10771073)the Natural Science Foundation of Shandong Province (Grant No.Y2004A04)
文摘Function S-rbugh sets are defined by R-function equivalence class, which have dynamic characteristic. Function S-rough sets have dynamic characteristic, law characteristic and law-hiding characteristic. Function S-rough sets can generate f-hiding law and f-hiding law. By engrafting, crossing, and penetrating between the information security theory and function S-rough sets, the security hiding and the authentication of f-hiding law and f-hiding law are given respectively in this paper. The fusion and share between function S-rough sets and information security theory is a new research direction of the application of information law in information system.
基金the support of the National Natural Science Foundation of China under Grant No.60673023,60433020,10501017,3040016the European Commission for TH/Asia Link/010 under Grant No.111084.
文摘It is very important in the field of bioinformatics to apply computer to perform the function annotation for new sequenced bio-sequences. Based on GO database and BLAST program, a novel method for the function annotation of new biological sequences is presented by using the variable-precision rough set theory. The proposed method is applied to the real data in GO database to examine its effectiveness. Numerical results show that the proposed method has better precision, recall-rate and harmonic mean value compared with existing methods.
基金supported by the National Natural Science Foundation of China (60364001,70461001)the Hainan Provincial Natural Science Foundation of China (807054)Hainan Provincial Education Office Foundation (HJ 2008-56)
文摘Singular rough sets （S-rough sets） have three classes of forms： one-directional S-rough sets, dual of onedirectional S-rough sets, and two-directional S-rough sets. Dynamic, hereditary, mnemonic, and hiding properties are the basic characteristics of S-rough sets. By using the S-rough sets, the concepts of f-hiding knowledge, F-hiding knowledge, hiding degree, and hiding dependence degree are given. Then, both the hiding theorem and the hiding dependence theorem of hiding knowledge are proposed. Finally, an application of hiding knowledge is discussed.
文摘In this paper, the uniqueness of meromorphic functions with common range sets and deficient values are studied. This result is related to a question of Gross.
基金supported by the National Key Re-search and Development Program of China(2020YFA0714200)supported by the Excellent Dissertation Cultivation Funds of Wuhan University of Technology(2018-YS-077)。
文摘We consider the topological behaviors of continuous maps with one topological attractor on compact metric space X.This kind of map is a generalization of maps such as topologically expansive Lorenz map,unimodal map without homtervals and so on.Under the finiteness and basin conditions,we provide a leveled A-R pair decomposition for such maps,and characterize α-limit set of each point.Based on weak Morse decomposition of X,we construct a bounded Lyapunov function V(x),which gives a clear description of orbit behavior of each point in X except a meager set.
基金Supported by the Natural Science Foundation of Shandong Province（ZR2010AL019） Supported by the Education Science Foundation of Shandong Province（2010JZ123）
文摘The concepts of the lower approximation integral,the upper approximation integral and rough integrals are given on the basis of function rough sets.Based on these concepts,the relation of the lower approximation integrals,the relation of the upper approximation integrals,the relation of rough integrals,and the double median theorem of rough integrals are discussed.Rough integrals have finite contraction characteristic and finite extension characteristic.
基金This work was supported by the National Natural Science Foundation of China (10671109)Fujian Province Youth Science Technology Program(2003J006)the Doctoral Programme Foundation of Higher Education(20060422049)
文摘Let S1 = {∞} and S2 = {ω ： Ps（ω） = 0}, Ps（ω） being a uniqueness polynomial under some restricted conditions. Then, for any given nonconstant meromorphic function f, there exist at most finitely many nonconstant meromorphic functions g such that f^-1 （Si） = g^-1 （Si） （i = 1, 2）, where f^-1 （Si） and g^-1 （Si） denote the pull-backs of Si considered as a divisor, namely, the inverse images of Si counted with multiplicities, by f and g respectively.
基金Supported by the NNSFC (10671109)the NSFFC(2008J0190)+1 种基金the Research Fund for Talent Introduction of Ningde Teachers College (2009Y019)the Scitific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry
文摘In this article, we deal with the uniqueness problems on meromorphic functions sharing two finite sets in an angular domain instead of the whole plane C. In particular, we investigate the uniqueness for meromorphic functions of infinite order in an angular domain and obtain some results. Moreover, examples show that the conditions in theorems are necessary.
基金supported by“1 Decembrie 1918”University of Alba Iulia,510009 Alba Iuliasupported in part by the HEC-NRPU project,under the grant No.14566.
文摘Multi-criteria decision-making(MCDM)is essential for handling complex decision problems under uncertainty,especially in fields such as criminal justice,healthcare,and environmental management.Traditional fuzzy MCDM techniques have failed to deal with problems where uncertainty or vagueness is involved.To address this issue,we propose a novel framework that integrates group and overlap functions with Aczel-Alsina(AA)operational laws in the intuitionistic fuzzy set(IFS)environment.Overlap functions capture the degree to which two inputs share common features and are used to find how closely two values or criteria match in uncertain environments,while the Group functions are used to combine different expert opinions into a single collective result.This study introduces four new aggregation operators:Group Overlap function-based intuitionistic fuzzy Aczel-Alsina(GOF-IFAA)Weighted Averaging(GOF-IFAAWA)operator,intuitionistic fuzzy Aczel-Alsina(GOF-IFAA)Weighted Geometric(GOF-IFAAWG),intuitionistic fuzzy Aczel-Alsina(GOF-IFAA)OrderedWeighted Averaging(GOF-IFAAOWA),and intuitionistic fuzzy Aczel-Alsina(GOF-IFAA)Ordered Weighted Geometric(GOF-IFAAOWG),which are rigorously defined and mathematically analyzed and offer improved flexibility in managing overlapping,uncertain,and hesitant information.The properties of these operators are discussed in detail.Further,the effectiveness,validity,activeness,and ability to capture the uncertain information,the developed operators are applied to the AI-based Criminal Justice Policy Selection problem.At last,the comparison analysis between prior and proposed studies has been displayed,and then followed by the conclusion of the result.
基金fundings supported by Sichuan Science and Technology Program(2025YFHZ0065).
文摘Structural Reliability-Based Topology Optimization(RBTO),as an efficient design methodology,serves as a crucial means to ensure the development ofmodern engineering structures towards high performance,long service life,and high reliability.However,in practical design processes,topology optimization must not only account for the static performance of structures but also consider the impacts of various responses and uncertainties under complex dynamic conditions,which traditional methods often struggle accommodate.Therefore,this study proposes an RBTO framework based on a Kriging-assisted level set function and a novel Dynamic Hybrid Particle Swarm Optimization(DHPSO)algorithm.By leveraging the Kriging model as a surrogate,the high cost associated with repeatedly running finite element analysis processes is reduced,addressing the issue of minimizing structural compliance.Meanwhile,the DHPSO algorithm enables a better balance between the population’s developmental and exploratory capabilities,significantly accelerating convergence speed and enhancing global convergence performance.Finally,the proposed method is validated through three different structural examples,demonstrating its superior performance.Observed that the computational that,compared to the traditional Solid Isotropic Material with Penalization(SIMP)method,the proposed approach reduces the upper bound of structural compliance by approximately 30%.Additionally,the optimized results exhibit clear material interfaces without grayscale elements,and the stress concentration factor is reduced by approximately 42%.Consequently,the computational results fromdifferent examples verify the effectiveness and superiority of this study across various fields,achieving the goal of providing more precise optimization results within a shorter timeframe.
基金supported by the grants NSFC11201232, 12KJB110008Qing Lan Project, 13KJB110015, 12YJAZH096the Project-sponsored by SRF for ROCS, SEM
文摘In this paper we establish sharp H/51der estimates of harmonic functions on a class of connected post critically finite （p.c.f.） self-similar sets, and show that functions in the domain of Laplacian enjoy the same property. Some weU-known examples, such as the Sierpinski gasket, the unit interval, the level 3 Sierpinski gasket, the hexagasket, the 3-dimensional Sierpinski gasket, and the Vicsek set are also considered.
文摘The purpose of this paper is to introduce and discuss the concept of topical functions on upward sets. We give characterizations of topical functions in terms of upward sets.
基金supported by the National Natural Science Foundation of China(No.11201232)Qing Lan Project of Jiangsu Province
文摘In this paper we establish the oscillation inequality of harmonic functions and HOlder estimate of the functions in the domain of the Laplacian on connected post critically finite （p.c.f.） self-similar sets.
文摘In this paper we study the problem of meromorphic functions sharing three sets and obtain some theorems which are the extension and complement of some known relative results given by Yi Hongxun and others.
文摘We propose a new approach to the investigation of deterministic self-similar networks by using contractive iterated multifunction systems (briefly IMSs). Our paper focuses on the generalized version of two graph models introduced by Barabási, Ravasz and Vicsek ([1] [2]). We generalize the graph models using stars and cliques: both algorithm construct graph sequences such that the next iteration is always based on n replicas of the current iteration, where n is the size of the initial graph structure, being a star or a clique. We analyze these self-similar graph sequences using IMSs in function of the size of the initial star and clique, respectively. Our research uses the Cantor set for the description of the fixed set of these IMSs, which we interpret as the limit object of the analyzed self-similar networks.
