Pub Date : 2022-10-24DOI: 10.1080/03081079.2022.2132492
G. Çayli, Ümit Ertuğrul, Funda Karaçal
In this paper, we propose new construction methods to obtain uninorms on a bounded lattice L with the fixed neutral element e using the presence of a t-norm (t-conorm) and a uninorm defined on a subinterval of L. Some properties related to these construction methods are investigated. Additionally, some illustrative examples are added for clarity.
{"title":"Some further construction methods for uninorms on bounded lattices","authors":"G. Çayli, Ümit Ertuğrul, Funda Karaçal","doi":"10.1080/03081079.2022.2132492","DOIUrl":"https://doi.org/10.1080/03081079.2022.2132492","url":null,"abstract":"In this paper, we propose new construction methods to obtain uninorms on a bounded lattice L with the fixed neutral element e using the presence of a t-norm (t-conorm) and a uninorm defined on a subinterval of L. Some properties related to these construction methods are investigated. Additionally, some illustrative examples are added for clarity.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"52 1","pages":"414 - 442"},"PeriodicalIF":2.0,"publicationDate":"2022-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45312209","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-10-17DOI: 10.1080/03081079.2022.2132491
Hai Lin, Zhaowen Li
Outlier detection has been broadly used in industrial practices such as public security and fraud detection, etc. Outlier detection from various perspectives against different backgrounds has been proposed. However, most of outlier detection consider categorical or numerical data. There are few researches on outlier detection for set-valued data, and a set-valued information system (SVIS) is a proper way of tackling the problem of missing values in data sets. This paper investigates outlier detection for set-valued data based on rough set theory (RST) and granular computing (GrC). First, the similarity between two information values in an SVIS is introduced and a variable parameter to control the similarity is given. Then, the tolerance relations on the object set are defined, and based on this tolerance relation, θ-lower and θ-upper approximations in an SVIS are put forward. Next, the outlier factor in an SVIS is presented and applied to various data sets. Finally, outlier detection method for set-valued data based on RST and GrC is proposed, and the corresponding algorithms are designed. Through numerical experiments based on UCI, the designed algorithm is compared with six other detection algorithms. The experimental results show the designed algorithm is arguably the best choice under the context of an SVIS. It is worth mentioning that for a comprehensive comparison, we use two criteria: AUC value and F-1 measure, to show the superiority of the designed algorithm.
{"title":"Outlier detection for set-valued data based on rough set theory and granular computing","authors":"Hai Lin, Zhaowen Li","doi":"10.1080/03081079.2022.2132491","DOIUrl":"https://doi.org/10.1080/03081079.2022.2132491","url":null,"abstract":"Outlier detection has been broadly used in industrial practices such as public security and fraud detection, etc. Outlier detection from various perspectives against different backgrounds has been proposed. However, most of outlier detection consider categorical or numerical data. There are few researches on outlier detection for set-valued data, and a set-valued information system (SVIS) is a proper way of tackling the problem of missing values in data sets. This paper investigates outlier detection for set-valued data based on rough set theory (RST) and granular computing (GrC). First, the similarity between two information values in an SVIS is introduced and a variable parameter to control the similarity is given. Then, the tolerance relations on the object set are defined, and based on this tolerance relation, θ-lower and θ-upper approximations in an SVIS are put forward. Next, the outlier factor in an SVIS is presented and applied to various data sets. Finally, outlier detection method for set-valued data based on RST and GrC is proposed, and the corresponding algorithms are designed. Through numerical experiments based on UCI, the designed algorithm is compared with six other detection algorithms. The experimental results show the designed algorithm is arguably the best choice under the context of an SVIS. It is worth mentioning that for a comprehensive comparison, we use two criteria: AUC value and F-1 measure, to show the superiority of the designed algorithm.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"52 1","pages":"385 - 413"},"PeriodicalIF":2.0,"publicationDate":"2022-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45411969","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-08-28DOI: 10.1080/03081079.2022.2108029
A. Sheikhi, R. Mesiar, M. Holeňa
In prediction analysis, there may exist some nonlinear relations between the exploratory variables, which are not captured by traditional correlation-based linear models such as multiple regression, principal component regression, and so on. In this work, we employ a copula matrix to extract principal components of a set of variables which are pair-wisely associated with a copula. By estimating the pairwise copula and its corresponding parameter(s), we suggest an optimization method to extract principal components from a matrix which contains some pairwise measures of association. We use these components as inputs of an artificial neural network to make a more accurate prediction. We test our proposed method using a simulation study and use it to carry out a more accurate prediction in an AIDS as well as a COVID-19 dataset. To increase the reliability of results, we employ a cross-validation technique.
{"title":"A dimension reduction in neural network using copula matrix","authors":"A. Sheikhi, R. Mesiar, M. Holeňa","doi":"10.1080/03081079.2022.2108029","DOIUrl":"https://doi.org/10.1080/03081079.2022.2108029","url":null,"abstract":"In prediction analysis, there may exist some nonlinear relations between the exploratory variables, which are not captured by traditional correlation-based linear models such as multiple regression, principal component regression, and so on. In this work, we employ a copula matrix to extract principal components of a set of variables which are pair-wisely associated with a copula. By estimating the pairwise copula and its corresponding parameter(s), we suggest an optimization method to extract principal components from a matrix which contains some pairwise measures of association. We use these components as inputs of an artificial neural network to make a more accurate prediction. We test our proposed method using a simulation study and use it to carry out a more accurate prediction in an AIDS as well as a COVID-19 dataset. To increase the reliability of results, we employ a cross-validation technique.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"52 1","pages":"131 - 146"},"PeriodicalIF":2.0,"publicationDate":"2022-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42347762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-08-22DOI: 10.1080/03081079.2022.2104269
Ziqian Liu
ABSTRACT Based on differential minimax control, this paper develops a novel theoretic design to achieve chaotic synchronization of neuronet-type stochastic complex networks that are heavily influenced by noise signals. According to robust inverse optimality, the proposed method is mathematically formulated by using stochastic Lyapunov technique and the associated Hamilton-Jacobi-Isaacs (HJI) equation, which ensures that the system accomplishes the best rational synchronization in probability, meanwhile, to reduce noises to a predefined level with stability margins. To verify analytical results, a numerical example is given to show the effectiveness of the proposed technique.
{"title":"Chaotic synchronization of neuronet-type stochastic complex networks using decentralized differential minimax controllers","authors":"Ziqian Liu","doi":"10.1080/03081079.2022.2104269","DOIUrl":"https://doi.org/10.1080/03081079.2022.2104269","url":null,"abstract":"ABSTRACT Based on differential minimax control, this paper develops a novel theoretic design to achieve chaotic synchronization of neuronet-type stochastic complex networks that are heavily influenced by noise signals. According to robust inverse optimality, the proposed method is mathematically formulated by using stochastic Lyapunov technique and the associated Hamilton-Jacobi-Isaacs (HJI) equation, which ensures that the system accomplishes the best rational synchronization in probability, meanwhile, to reduce noises to a predefined level with stability margins. To verify analytical results, a numerical example is given to show the effectiveness of the proposed technique.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"52 1","pages":"86 - 111"},"PeriodicalIF":2.0,"publicationDate":"2022-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42020521","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-08-19DOI: 10.1080/03081079.2022.2104270
Marianne Synnes Emblemsvåg, J. Emblemsvåg
Gresham’s law popularly states that “bad money drives out good”. It originates from monetary policy involving coinage, but it has for years been applied in a number of areas with various degrees of thoroughness and thoughtfulness. Although most applications are paraphrasing, and not scientific usage of analogy, Gresham’s law fits remarkably well in many cases, and therefore deserves study. Analogies are used extensively throughout the history of science, but it requires a deep understanding of a phenomenon and a subsequent generic description that can be transferred to other domains. We believe that Gresham’s law can be described using systems theory since most real-life systems fit within systems theory. We therefore review of Gresham’s law to develop a simple, generic model. Through a simple simulation, to ascertain whether it makes sense or not, we find the generic model useful and we people that it can serve well in system-related, qualitative research.
{"title":"Developing a generic model of Gresham’s law for qualitative analyses","authors":"Marianne Synnes Emblemsvåg, J. Emblemsvåg","doi":"10.1080/03081079.2022.2104270","DOIUrl":"https://doi.org/10.1080/03081079.2022.2104270","url":null,"abstract":"Gresham’s law popularly states that “bad money drives out good”. It originates from monetary policy involving coinage, but it has for years been applied in a number of areas with various degrees of thoroughness and thoughtfulness. Although most applications are paraphrasing, and not scientific usage of analogy, Gresham’s law fits remarkably well in many cases, and therefore deserves study. Analogies are used extensively throughout the history of science, but it requires a deep understanding of a phenomenon and a subsequent generic description that can be transferred to other domains. We believe that Gresham’s law can be described using systems theory since most real-life systems fit within systems theory. We therefore review of Gresham’s law to develop a simple, generic model. Through a simple simulation, to ascertain whether it makes sense or not, we find the generic model useful and we people that it can serve well in system-related, qualitative research.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"52 1","pages":"113 - 130"},"PeriodicalIF":2.0,"publicationDate":"2022-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43513064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-08-11DOI: 10.1080/03081079.2022.2104268
Lesheng Jin, R. Mesiar, R. Yager, M. Kalina, Jana Špirková, S. Borkotokey
Basic Uncertain Information (BUI) as a newly introduced concept generalized a wide range of uncertain information. We discuss and compare some methods to derive efficacy from given BUI collection, which is helpful in decision aid. With BUI collection, we also discuss the technique of using Choquet Integral to aggregate those BUI and return closed intervals as final aggregation results, and the whole aggregation is then called Uncertain Choquet Integral. We also discuss Uncertain Choquet Integral with preference, which considers all the information about optimistic/pessimistic preferences of decision makers and in given fuzzy measure. Uncertain Choquet Integral with preference returns real value result instead of closed interval, and it is a type of generalization of Choquet Integral (when all value information are certain) which can be well used in uncertain information environments.
{"title":"Deriving efficacy from basic uncertain information and uncertain Choquet Integral","authors":"Lesheng Jin, R. Mesiar, R. Yager, M. Kalina, Jana Špirková, S. Borkotokey","doi":"10.1080/03081079.2022.2104268","DOIUrl":"https://doi.org/10.1080/03081079.2022.2104268","url":null,"abstract":"Basic Uncertain Information (BUI) as a newly introduced concept generalized a wide range of uncertain information. We discuss and compare some methods to derive efficacy from given BUI collection, which is helpful in decision aid. With BUI collection, we also discuss the technique of using Choquet Integral to aggregate those BUI and return closed intervals as final aggregation results, and the whole aggregation is then called Uncertain Choquet Integral. We also discuss Uncertain Choquet Integral with preference, which considers all the information about optimistic/pessimistic preferences of decision makers and in given fuzzy measure. Uncertain Choquet Integral with preference returns real value result instead of closed interval, and it is a type of generalization of Choquet Integral (when all value information are certain) which can be well used in uncertain information environments.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"52 1","pages":"72 - 85"},"PeriodicalIF":2.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46756610","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-31DOI: 10.1080/03081079.2022.2084728
Amira Mouakher, Andrea Kő
Formal concept analysis (FCA) is a mathematical tool for analyzing data and formally representing conceptual knowledge. Under this formalism, the concept stability metric can be used in many applications: community detection, pattern selection in noisy data, patient care trajectories, and biclusters of similar objects, etc. However, computing the stability is a #P-complete problem. Therefore, most existing studies have focused either on estimating this metric using some heuristics or by proposing recursive approaches to assess the exact value of the stability. In this paper, we introduce an algorithm called the Exact Stability Computing for Galois Lattice Esc-Gl for computing the stability of a formal concept given the underlying partial relation. Based on the lower cover of a given concept, the algorithm can improve scalability and reduce computational complexity. Our experiments performed on large benchmark datasets from the FCA field show that our contributions sharply outperform all the pioneering approaches of the dedicated literature.
{"title":"Efficient assessment of formal concept stability in the Galois lattice","authors":"Amira Mouakher, Andrea Kő","doi":"10.1080/03081079.2022.2084728","DOIUrl":"https://doi.org/10.1080/03081079.2022.2084728","url":null,"abstract":"Formal concept analysis (FCA) is a mathematical tool for analyzing data and formally representing conceptual knowledge. Under this formalism, the concept stability metric can be used in many applications: community detection, pattern selection in noisy data, patient care trajectories, and biclusters of similar objects, etc. However, computing the stability is a #P-complete problem. Therefore, most existing studies have focused either on estimating this metric using some heuristics or by proposing recursive approaches to assess the exact value of the stability. In this paper, we introduce an algorithm called the Exact Stability Computing for Galois Lattice Esc-Gl for computing the stability of a formal concept given the underlying partial relation. Based on the lower cover of a given concept, the algorithm can improve scalability and reduce computational complexity. Our experiments performed on large benchmark datasets from the FCA field show that our contributions sharply outperform all the pioneering approaches of the dedicated literature.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"51 1","pages":"791 - 821"},"PeriodicalIF":2.0,"publicationDate":"2022-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46791369","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-26DOI: 10.1080/03081079.2022.2086542
M. Brezovan, R. Precup, D. Selișteanu, L. Stanescu
ABSTRACT An approach to the Colored Petri Nets (CPN)-based control is proposed in this paper. CPN are used for modeling the dynamics of both the controller and the controlled process in the control system structure. The mathematical model of the controlled process is discretized in order to use CPN in modeling the controlled process and the control system as well. The proposed controller implements a Moore automaton. The theoretical aspects of the controller design are presented in the paper, as well as aspects of the system controllability. The level control of three-tank systems is considered to validate the proposed controller. Extensive simulations are performed using the CPN Tools tool and experimental results on laboratory equipment are included.
{"title":"Colored Petri nets-based control and experimental validation on three-tank system level control","authors":"M. Brezovan, R. Precup, D. Selișteanu, L. Stanescu","doi":"10.1080/03081079.2022.2086542","DOIUrl":"https://doi.org/10.1080/03081079.2022.2086542","url":null,"abstract":"ABSTRACT An approach to the Colored Petri Nets (CPN)-based control is proposed in this paper. CPN are used for modeling the dynamics of both the controller and the controlled process in the control system structure. The mathematical model of the controlled process is discretized in order to use CPN in modeling the controlled process and the control system as well. The proposed controller implements a Moore automaton. The theoretical aspects of the controller design are presented in the paper, as well as aspects of the system controllability. The level control of three-tank systems is considered to validate the proposed controller. Extensive simulations are performed using the CPN Tools tool and experimental results on laboratory equipment are included.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"52 1","pages":"1 - 47"},"PeriodicalIF":2.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43537615","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-20DOI: 10.1080/03081079.2022.2086869
R. Cayssials, E. Ferro
Cyber-Physical Systems (CPSs) require the interfacing of two different time domains: (1) the physical time-continuous domain and (2) the computational time-discrete domain. The Nyquist-Shannon sampling theorem allows transitions from one domain to the other. To preserve the informational signal between both domains, strictly periodic sampling, also known as uniform spaced sampling, is required. CPSs utilise real-time systems to meet temporal constraints. However, real-time systems introduce jitter when several tasks are executed; consequently, the uniform spaced sampling is jeopardized. The Paley-Wiener-Levinson theorem should be used for non-uniform spaced sampling, but its complexity makes it unsuitable for runtime execution in CPSs. Jitter in real-time systems may cause perturbations in CPS applications. In this paper, frequency domain methodologies are proposed to analyse the perturbations introduced by real-time systems in physical applications. It is shown that jitter may introduce frequency components with the potential to jeopardize the dynamics of the physical application. In this paper, it is proposed that jitter should be related to the period of the fundamental frequency to sample, instead of to the period of the real-time task. The frequency domain methodology proposed should be used to analyse the real-time system behaviour from a CPS application point of view.
{"title":"Analysis of real-time jitter in cyber-physical applications using frequency domain perturbation","authors":"R. Cayssials, E. Ferro","doi":"10.1080/03081079.2022.2086869","DOIUrl":"https://doi.org/10.1080/03081079.2022.2086869","url":null,"abstract":"Cyber-Physical Systems (CPSs) require the interfacing of two different time domains: (1) the physical time-continuous domain and (2) the computational time-discrete domain. The Nyquist-Shannon sampling theorem allows transitions from one domain to the other. To preserve the informational signal between both domains, strictly periodic sampling, also known as uniform spaced sampling, is required. CPSs utilise real-time systems to meet temporal constraints. However, real-time systems introduce jitter when several tasks are executed; consequently, the uniform spaced sampling is jeopardized. The Paley-Wiener-Levinson theorem should be used for non-uniform spaced sampling, but its complexity makes it unsuitable for runtime execution in CPSs. Jitter in real-time systems may cause perturbations in CPS applications. In this paper, frequency domain methodologies are proposed to analyse the perturbations introduced by real-time systems in physical applications. It is shown that jitter may introduce frequency components with the potential to jeopardize the dynamics of the physical application. In this paper, it is proposed that jitter should be related to the period of the fundamental frequency to sample, instead of to the period of the real-time task. The frequency domain methodology proposed should be used to analyse the real-time system behaviour from a CPS application point of view.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"52 1","pages":"48 - 60"},"PeriodicalIF":2.0,"publicationDate":"2022-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47465215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-19DOI: 10.1080/03081079.2022.2086240
A. Bodaghi
In the current article, we define the multicubic–quartic mappings and describe them as an equation. We also study n-variable mappings, which are mixed type cubic–quartic in each variable and then give a characterization of such mappings. Indeed, we unify the general system of cubic–quartic functional equations defining a multimixed cubic–quartic mapping to a single equation, say, the multimixed cubic–quartic functional equation. Furthermore, we show under what conditions every multimixed cubic–quartic mapping can be multicubic, multiquartic and multicubic–quartic. In addition, by means of a known fixed-point result, we prove the Găvrua stability of multimixed cubic–quartic functional equations in the setting of quasi-β-normed spaces. One of the important results is that every multimixed cubic–quartic functional equation on a quasi-β-normed space is the Hyers–Ulam stable. Lastly, we investigate the hyperstability of multicubic -derivations on -algebras.
{"title":"General system of cubic–quartic functional equations in quasi-β-normed spaces","authors":"A. Bodaghi","doi":"10.1080/03081079.2022.2086240","DOIUrl":"https://doi.org/10.1080/03081079.2022.2086240","url":null,"abstract":"In the current article, we define the multicubic–quartic mappings and describe them as an equation. We also study n-variable mappings, which are mixed type cubic–quartic in each variable and then give a characterization of such mappings. Indeed, we unify the general system of cubic–quartic functional equations defining a multimixed cubic–quartic mapping to a single equation, say, the multimixed cubic–quartic functional equation. Furthermore, we show under what conditions every multimixed cubic–quartic mapping can be multicubic, multiquartic and multicubic–quartic. In addition, by means of a known fixed-point result, we prove the Găvrua stability of multimixed cubic–quartic functional equations in the setting of quasi-β-normed spaces. One of the important results is that every multimixed cubic–quartic functional equation on a quasi-β-normed space is the Hyers–Ulam stable. Lastly, we investigate the hyperstability of multicubic -derivations on -algebras.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"51 1","pages":"735 - 757"},"PeriodicalIF":2.0,"publicationDate":"2022-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45476004","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：