Pub Date : 2023-09-21DOI: 10.1080/03081079.2023.2248359
M. R. Shokrollahi, A. K. Mousavi
AbstractIn this study, the issue of simultaneous fault detection and control (SFDC) for a class of switched linear systems with input and state delays is being addressed. A detector/controller unit (dynamic observer/observer-based controller) is suggested for a residual generation that simultaneously takes into account the control and fault detection objectives using specific performance indices. It is assumed that the delay will fluctuate within a range with a lower bound that is not zero. Based on a Lyapunov–Krasovskii functional (LKF), and thanks to the free-weighting matrix and projection lemma, a new sufficient condition for developing a new method is put forth in terms of a set of linear matrix inequalities (LMIs). To illustrate how well the suggested results work, the proposed method is applied to a vehicle roll dynamic.KEYWORDS: Fault detection and controltime delay systemsdynamic observerlinear matrix inequalitycar roll dynamic Disclosure statementNo potential conflict of interest was reported by the author(s).Data availability statementData sharing not applicable to this article as no datasets were generated or analyzed during the current study.
{"title":"Simultaneous fault detection and robust control for a dynamic observer-based switched time delay systems with car roll dynamic application","authors":"M. R. Shokrollahi, A. K. Mousavi","doi":"10.1080/03081079.2023.2248359","DOIUrl":"https://doi.org/10.1080/03081079.2023.2248359","url":null,"abstract":"AbstractIn this study, the issue of simultaneous fault detection and control (SFDC) for a class of switched linear systems with input and state delays is being addressed. A detector/controller unit (dynamic observer/observer-based controller) is suggested for a residual generation that simultaneously takes into account the control and fault detection objectives using specific performance indices. It is assumed that the delay will fluctuate within a range with a lower bound that is not zero. Based on a Lyapunov–Krasovskii functional (LKF), and thanks to the free-weighting matrix and projection lemma, a new sufficient condition for developing a new method is put forth in terms of a set of linear matrix inequalities (LMIs). To illustrate how well the suggested results work, the proposed method is applied to a vehicle roll dynamic.KEYWORDS: Fault detection and controltime delay systemsdynamic observerlinear matrix inequalitycar roll dynamic Disclosure statementNo potential conflict of interest was reported by the author(s).Data availability statementData sharing not applicable to this article as no datasets were generated or analyzed during the current study.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136129084","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 : 2023-09-14DOI: 10.1080/03081079.2023.2256462
Dali Wang, Qingyuan Xu, Jinjin Li, Yongfan Zhu
AbstractInstructional assessment and learning paths are essential for improving students' learning effectiveness. This paper explores enhancing learners' learning efficiency and quality from the perspective of the correlation between skills. Firstly, the concept of the skill hierarchy structure and valid skill combination is introduced, followed introducted the method of constructing a question bank based on the skill hierarchy structure. Secondly, the skill hierarchy structure is utilized to induce skill context and provide the competence base for the skill context. Finally, the method for assessing the skills mastered by the learner is provided in the case of a known knowledge state of learners, and the learning paths diagram suitable for the learner's personalized situation is constructed. Experimental results demonstrate that the competence structure derived from the induced skill context based on skill hierarchy structure meets the requirements of being well-graded. Furthermore, the proposed methods in this paper facilitate learners in effectively mastering and applying learned skills, thereby establishing a solid foundation and improving their learning efficiency.KEYWORDS: Skill hierarchy structurevalid skill combinationskill contextcompetence baseskill assessmentlearning paths Disclosure statementNo potential conflict of interest was reported by the author(s).
{"title":"Skill hierarchy structure based skill assessment and learning paths","authors":"Dali Wang, Qingyuan Xu, Jinjin Li, Yongfan Zhu","doi":"10.1080/03081079.2023.2256462","DOIUrl":"https://doi.org/10.1080/03081079.2023.2256462","url":null,"abstract":"AbstractInstructional assessment and learning paths are essential for improving students' learning effectiveness. This paper explores enhancing learners' learning efficiency and quality from the perspective of the correlation between skills. Firstly, the concept of the skill hierarchy structure and valid skill combination is introduced, followed introducted the method of constructing a question bank based on the skill hierarchy structure. Secondly, the skill hierarchy structure is utilized to induce skill context and provide the competence base for the skill context. Finally, the method for assessing the skills mastered by the learner is provided in the case of a known knowledge state of learners, and the learning paths diagram suitable for the learner's personalized situation is constructed. Experimental results demonstrate that the competence structure derived from the induced skill context based on skill hierarchy structure meets the requirements of being well-graded. Furthermore, the proposed methods in this paper facilitate learners in effectively mastering and applying learned skills, thereby establishing a solid foundation and improving their learning efficiency.KEYWORDS: Skill hierarchy structurevalid skill combinationskill contextcompetence baseskill assessmentlearning paths Disclosure statementNo potential conflict of interest was reported by the author(s).","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134912364","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 : 2023-09-12DOI: 10.1080/03081079.2023.2256464
Ran Li, Hongchang Chen, Shuxin Liu, Haocong Jiang, Biao Wang
In an era of data-based and information-centric Industry 4.0, extracting potential knowledge and valuable information from data is central to data mining tasks. Yet, the ambiguity, imprecision, incompleteness, and hybrid in real-world data pose tremendous challenges to critical information mining. Accordingly, we propose a new Max-Correlation Min-Redundant (MCMR) attribute reduction model from the uncertainty relation of attributes to avoid information loss in incomplete mixed data. Specifically, the neighbor relations are primarily developed based on the soft computing approach of the neighborhood information system, which divides the objects into neighborhood covers to maximize the utilization of the information in the incomplete mixed data. Then, we detailly analyze the internal and external consistency relationships of the four main uncertainty functions. Based on this, a new MCMR uncertain function is designed with maximum relevance and minimum redundancy. Experiments on nine real-world datasets validate the proposed model can improve data quality by mining critical information in classification tasks and achieving optimal performance with a minimum number of attributes.
{"title":"Attribute reduction for incomplete mixed data based on neighborhood information system","authors":"Ran Li, Hongchang Chen, Shuxin Liu, Haocong Jiang, Biao Wang","doi":"10.1080/03081079.2023.2256464","DOIUrl":"https://doi.org/10.1080/03081079.2023.2256464","url":null,"abstract":"In an era of data-based and information-centric Industry 4.0, extracting potential knowledge and valuable information from data is central to data mining tasks. Yet, the ambiguity, imprecision, incompleteness, and hybrid in real-world data pose tremendous challenges to critical information mining. Accordingly, we propose a new Max-Correlation Min-Redundant (MCMR) attribute reduction model from the uncertainty relation of attributes to avoid information loss in incomplete mixed data. Specifically, the neighbor relations are primarily developed based on the soft computing approach of the neighborhood information system, which divides the objects into neighborhood covers to maximize the utilization of the information in the incomplete mixed data. Then, we detailly analyze the internal and external consistency relationships of the four main uncertainty functions. Based on this, a new MCMR uncertain function is designed with maximum relevance and minimum redundancy. Experiments on nine real-world datasets validate the proposed model can improve data quality by mining critical information in classification tasks and achieving optimal performance with a minimum number of attributes.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135825694","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 : 2023-08-31DOI: 10.1080/03081079.2023.2232938
R. Belohlávek, Tomas Urbanec
In the second part of our paper, we explore antisymmetry of fuzzy orders. We provide a unifying definition of antisymmetry, which generalizes three existing variants of antisymmetry examined in the literature, along with the corresponding generalized definition of fuzzy order. We prove that all the particular instances of the generalized definition, which include the three basic ones, are mutually equivalent. We also examine distinctive properties of the three basic notions of fuzzy order.
{"title":"On the concept of fuzzy order II: Antisymmetry","authors":"R. Belohlávek, Tomas Urbanec","doi":"10.1080/03081079.2023.2232938","DOIUrl":"https://doi.org/10.1080/03081079.2023.2232938","url":null,"abstract":"In the second part of our paper, we explore antisymmetry of fuzzy orders. We provide a unifying definition of antisymmetry, which generalizes three existing variants of antisymmetry examined in the literature, along with the corresponding generalized definition of fuzzy order. We prove that all the particular instances of the generalized definition, which include the three basic ones, are mutually equivalent. We also examine distinctive properties of the three basic notions of fuzzy order.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"52 1","pages":"972 - 990"},"PeriodicalIF":2.0,"publicationDate":"2023-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42891698","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 : 2023-08-31DOI: 10.1080/03081079.2023.2232937
R. Belohlávek, Tomas Urbanec
We consider the concept of fuzzy order in which antisymmetry is intrinsically connected to a many-valued equality on the underlying universe. We examine the origins of this concept, provide remarks and observations on the existing studies, and prove new results. In part I, we scrutinize the existing approaches to the examined concept of fuzzy order and present remarks and results to elucidate the available notions and findings, as well as to provide a deeper insight into several issues. In part II, we explore antisymmetry.
{"title":"On the concept of fuzzy order I: Remarks and observations","authors":"R. Belohlávek, Tomas Urbanec","doi":"10.1080/03081079.2023.2232937","DOIUrl":"https://doi.org/10.1080/03081079.2023.2232937","url":null,"abstract":"We consider the concept of fuzzy order in which antisymmetry is intrinsically connected to a many-valued equality on the underlying universe. We examine the origins of this concept, provide remarks and observations on the existing studies, and prove new results. In part I, we scrutinize the existing approaches to the examined concept of fuzzy order and present remarks and results to elucidate the available notions and findings, as well as to provide a deeper insight into several issues. In part II, we explore antisymmetry.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"52 1","pages":"948 - 971"},"PeriodicalIF":2.0,"publicationDate":"2023-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42209138","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 : 2023-08-18DOI: 10.1080/03081079.2023.2241982
D. R. Sahu, N. Singh
{"title":"p-Accelerated normal S-iterative learning control algorithm for linear discrete singular time-delay systems","authors":"D. R. Sahu, N. Singh","doi":"10.1080/03081079.2023.2241982","DOIUrl":"https://doi.org/10.1080/03081079.2023.2241982","url":null,"abstract":"","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":" ","pages":""},"PeriodicalIF":2.0,"publicationDate":"2023-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47055824","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 : 2023-08-16DOI: 10.1080/03081079.2023.2245124
Fabian Dunke, S. Nickel
{"title":"Metamodel-based dynamic algorithm configuration using artificial neural networks","authors":"Fabian Dunke, S. Nickel","doi":"10.1080/03081079.2023.2245124","DOIUrl":"https://doi.org/10.1080/03081079.2023.2245124","url":null,"abstract":"","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":" ","pages":""},"PeriodicalIF":2.0,"publicationDate":"2023-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44377981","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 : 2023-08-02DOI: 10.1080/03081079.2023.2210742
R. Savaş, M. Gürdal
In 1951, the notion of statistical convergence was a more general concept than the idea of convergence as by presented by Fast. Since then statistical convergence has been was investigated by more and more researchers. On the other hand, in 2006 Li has began the survey of credibility theory and presented some convergence concepts in credibility theory. Because of the esoteric of both credibility and summability theory, the body of literature is limited. As such the only accessible notion to both theories is Pringsheim limits. The goal of this paper is to present a natural multidimensional extension of credibility theory via summability methods. To accomplish this, in this paper we present useful tools to generalize the well-known convergence definition to the concept of lacunary statistical convergence for double sequences in credibility theory. Additionally, some important results and examples will be examined.
{"title":"On lacunary statistical convergence of double sequences in credibility theory","authors":"R. Savaş, M. Gürdal","doi":"10.1080/03081079.2023.2210742","DOIUrl":"https://doi.org/10.1080/03081079.2023.2210742","url":null,"abstract":"In 1951, the notion of statistical convergence was a more general concept than the idea of convergence as by presented by Fast. Since then statistical convergence has been was investigated by more and more researchers. On the other hand, in 2006 Li has began the survey of credibility theory and presented some convergence concepts in credibility theory. Because of the esoteric of both credibility and summability theory, the body of literature is limited. As such the only accessible notion to both theories is Pringsheim limits. The goal of this paper is to present a natural multidimensional extension of credibility theory via summability methods. To accomplish this, in this paper we present useful tools to generalize the well-known convergence definition to the concept of lacunary statistical convergence for double sequences in credibility theory. Additionally, some important results and examples will be examined.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"52 1","pages":"802 - 819"},"PeriodicalIF":2.0,"publicationDate":"2023-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42141714","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 : 2023-07-19DOI: 10.1080/03081079.2023.2234076
Boyuan Li, Xiaoyang Li, Zhaoxing Tian, Xia Lu, Rui Kang
{"title":"General power laws of the causalities in the causal Bayesian networks","authors":"Boyuan Li, Xiaoyang Li, Zhaoxing Tian, Xia Lu, Rui Kang","doi":"10.1080/03081079.2023.2234076","DOIUrl":"https://doi.org/10.1080/03081079.2023.2234076","url":null,"abstract":"","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"1 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2023-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41516807","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 : 2023-07-16DOI: 10.1080/03081079.2023.2233050
Asgarali Bouyer, Maryam Sabavand Monfared, E. Nourani, Bahman Arasteh
This paper proposes a local diffusion-based approach to find overlapping communities in social networks based on label expansion using local depth first search and social influence information of nodes, called the LDLF algorithm. It is vital to start the diffusion process in local depth, traveling from specific core nodes based on their local topological features and strategic position for spreading community labels. Correspondingly, to avoid assigning excessive and unessential labels, the LDLF algorithm prudently removes redundant and less frequent labels for nodes with multiple labels. Finally, the proposed method finalizes the node's label based on the Hub Depressed index. Thanks to requiring only two iterations for label updating, the proposed LDLF algorithm runs in low time complexity while eliminating random behavior and achieving acceptable accuracy in finding overlapping communities for large-scale networks. The experiments on benchmark networks prove the effectiveness of the LDLF method compared to state-of-the-art approaches.
{"title":"Discovering overlapping communities using a new diffusion approach based on core expanding and local depth traveling in social networks","authors":"Asgarali Bouyer, Maryam Sabavand Monfared, E. Nourani, Bahman Arasteh","doi":"10.1080/03081079.2023.2233050","DOIUrl":"https://doi.org/10.1080/03081079.2023.2233050","url":null,"abstract":"This paper proposes a local diffusion-based approach to find overlapping communities in social networks based on label expansion using local depth first search and social influence information of nodes, called the LDLF algorithm. It is vital to start the diffusion process in local depth, traveling from specific core nodes based on their local topological features and strategic position for spreading community labels. Correspondingly, to avoid assigning excessive and unessential labels, the LDLF algorithm prudently removes redundant and less frequent labels for nodes with multiple labels. Finally, the proposed method finalizes the node's label based on the Hub Depressed index. Thanks to requiring only two iterations for label updating, the proposed LDLF algorithm runs in low time complexity while eliminating random behavior and achieving acceptable accuracy in finding overlapping communities for large-scale networks. The experiments on benchmark networks prove the effectiveness of the LDLF method compared to state-of-the-art approaches.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"52 1","pages":"991 - 1019"},"PeriodicalIF":2.0,"publicationDate":"2023-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47765783","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
扫码关注我们
求助内容：
应助结果提醒方式：