Pub Date : 2023-02-19DOI: 10.1080/03081079.2023.2173749
Olga Vovk, Gunnar Piho, P. Ross
Healthcare is a rapidly evolving field. Such development creates opportunities to provide better quality, evidence-based treatment, however, increasing privacy violations. Anonymization can be applied to share data safely. This paper is a literature review of methods and tools for anonymization that includes 1930 papers, 32 of which were selected for the final evaluation. This article is an updated and extended version of the research conducted by our team in 2020 (Vovk 2021a). We found that despite the variety of methods, there is no single method that fits all cases. Certain methods are more widely used and create a background for advanced and secure methods. Our research shows that anonymization methods are used in tools for simplification and automation. Among challenges related to the use of all anonymization methods, is the proper balance between risk and data utility and highlight that the anonymization process is not limited to only technical measures but interdisciplinary.
{"title":"Methods and tools for healthcare data anonymization: a literature review","authors":"Olga Vovk, Gunnar Piho, P. Ross","doi":"10.1080/03081079.2023.2173749","DOIUrl":"https://doi.org/10.1080/03081079.2023.2173749","url":null,"abstract":"Healthcare is a rapidly evolving field. Such development creates opportunities to provide better quality, evidence-based treatment, however, increasing privacy violations. Anonymization can be applied to share data safely. This paper is a literature review of methods and tools for anonymization that includes 1930 papers, 32 of which were selected for the final evaluation. This article is an updated and extended version of the research conducted by our team in 2020 (Vovk 2021a). We found that despite the variety of methods, there is no single method that fits all cases. Certain methods are more widely used and create a background for advanced and secure methods. Our research shows that anonymization methods are used in tools for simplification and automation. Among challenges related to the use of all anonymization methods, is the proper balance between risk and data utility and highlight that the anonymization process is not limited to only technical measures but interdisciplinary.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"52 1","pages":"326 - 342"},"PeriodicalIF":2.0,"publicationDate":"2023-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46743446","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-02-19DOI: 10.1080/03081079.2022.2162049
Michael Chirmeni Boujike, J. Lonlac, Norbert Tsopzé, E. Nguifo, L. P. Fotso
The traditional algorithms that extract the gradual patterns often face the problem of managing the quantity of mined patterns, and in many applications, the calculation of all these patterns can prove to be intractable for the user-defined frequency threshold. Moreover, the concept of gradualness is defined just as an increase or a decrease variation. Indeed, a gradualness is considered as soon as the values of the attribute on both objects are different. This does not take into account the level of variation. Then, the variation of is considered as the same way as that of . As a result, numerous quantities of patterns extracted by traditional algorithms can be presented to the user, although their gradualness (due to the small variation) could be only a noise in the data. To address this issue, this paper suggests introducing the gradualness threshold from which to consider an increase or a decrease variation. In contrast to the literature approaches, the proposed approach takes into account the user's preferences on the gradualness threshold. The user knowledge could be used to fix the value of gradualness threshold. The proposed algorithm makes it possible to extract gradual patterns on certain databases where state-of-the-art gradual patterns mining algorithms fail due to too large search space. Moreover, results from an experimental evaluation on real databases show that the proposed algorithm is scalable, efficient, and can eliminate numerous patterns that do not verify specific gradualness requirements to show a small set of patterns to the user.
{"title":"GRAPGT: GRAdual patterns with gradualness threshold","authors":"Michael Chirmeni Boujike, J. Lonlac, Norbert Tsopzé, E. Nguifo, L. P. Fotso","doi":"10.1080/03081079.2022.2162049","DOIUrl":"https://doi.org/10.1080/03081079.2022.2162049","url":null,"abstract":"The traditional algorithms that extract the gradual patterns often face the problem of managing the quantity of mined patterns, and in many applications, the calculation of all these patterns can prove to be intractable for the user-defined frequency threshold. Moreover, the concept of gradualness is defined just as an increase or a decrease variation. Indeed, a gradualness is considered as soon as the values of the attribute on both objects are different. This does not take into account the level of variation. Then, the variation of is considered as the same way as that of . As a result, numerous quantities of patterns extracted by traditional algorithms can be presented to the user, although their gradualness (due to the small variation) could be only a noise in the data. To address this issue, this paper suggests introducing the gradualness threshold from which to consider an increase or a decrease variation. In contrast to the literature approaches, the proposed approach takes into account the user's preferences on the gradualness threshold. The user knowledge could be used to fix the value of gradualness threshold. The proposed algorithm makes it possible to extract gradual patterns on certain databases where state-of-the-art gradual patterns mining algorithms fail due to too large search space. Moreover, results from an experimental evaluation on real databases show that the proposed algorithm is scalable, efficient, and can eliminate numerous patterns that do not verify specific gradualness requirements to show a small set of patterns to the user.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"52 1","pages":"525 - 545"},"PeriodicalIF":2.0,"publicationDate":"2023-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47068383","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-02-19DOI: 10.1080/03081079.2023.2173750
Francisco García-García, A. Corral, L. Iribarne, M. Vassilakopoulos
ABSTRACT Apache Sedona (formerly GeoSpark) is a new in-memory cluster computing system for processing large-scale spatial data, which extends the core of Apache Spark to support spatial datatypes, partitioning techniques, spatial indexes, and spatial operations (e.g. spatial range, nearest neighbor, and spatial join queries). Distance-based Join Queries (DJQs), like nearest neighbor join (kNNJQ) or closest pairs queries (kCPQ), are not supported by it. Therefore, in this paper, we investigate how to design and implement efficient DJQ distributed algorithms in Apache Sedona, using the most appropriate spatial partitioning and other optimization techniques. The results of an extensive set of experiments with real-world datasets are presented, demonstrating that the proposed kNNJQ and kCPQ distributed algorithms are efficient, scalable, and robust in Apache Sedona. Finally, Sedona is also compared to other similar cluster computing systems, showing the best performance for kCPQ and competitive results for kNNJQ.
{"title":"Efficient distributed algorithms for distance join queries in spark-based spatial analytics systems","authors":"Francisco García-García, A. Corral, L. Iribarne, M. Vassilakopoulos","doi":"10.1080/03081079.2023.2173750","DOIUrl":"https://doi.org/10.1080/03081079.2023.2173750","url":null,"abstract":"ABSTRACT Apache Sedona (formerly GeoSpark) is a new in-memory cluster computing system for processing large-scale spatial data, which extends the core of Apache Spark to support spatial datatypes, partitioning techniques, spatial indexes, and spatial operations (e.g. spatial range, nearest neighbor, and spatial join queries). Distance-based Join Queries (DJQs), like nearest neighbor join (kNNJQ) or closest pairs queries (kCPQ), are not supported by it. Therefore, in this paper, we investigate how to design and implement efficient DJQ distributed algorithms in Apache Sedona, using the most appropriate spatial partitioning and other optimization techniques. The results of an extensive set of experiments with real-world datasets are presented, demonstrating that the proposed kNNJQ and kCPQ distributed algorithms are efficient, scalable, and robust in Apache Sedona. Finally, Sedona is also compared to other similar cluster computing systems, showing the best performance for kCPQ and competitive results for kNNJQ.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"52 1","pages":"206 - 250"},"PeriodicalIF":2.0,"publicationDate":"2023-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42857038","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-02-19DOI: 10.1080/03081079.2022.2162048
Thomas Abel
Over a long and renowned career, HT Odum assembled an original body of ecological and energy systems science. Perhaps less well known are his ideas about information. Beginning in an era of information theory and cybernetics, Odum built upon and moved away from many of the trends in information, linking biodiversity and culture to his energy systems principles of maximum empower and hierarchy. What emerged was a unique understanding of what information IS and what it DOES. The first goal of this paper is to piece together Odum’s theory of information from his many writings. The second goal is to attempt to build on this body of ideas to extend its reach, and to build with his ideas in new directions, but in directions that he would recognize to be in his energy systems science tradition. The result will be two proposed corollaries to his Fifth Energy Law, a Hierarchy of Cultural Information, and a Hierarchy of Manufactured Objects.
{"title":"Building with/on Howard T. Odum’s theory of information","authors":"Thomas Abel","doi":"10.1080/03081079.2022.2162048","DOIUrl":"https://doi.org/10.1080/03081079.2022.2162048","url":null,"abstract":"Over a long and renowned career, HT Odum assembled an original body of ecological and energy systems science. Perhaps less well known are his ideas about information. Beginning in an era of information theory and cybernetics, Odum built upon and moved away from many of the trends in information, linking biodiversity and culture to his energy systems principles of maximum empower and hierarchy. What emerged was a unique understanding of what information IS and what it DOES. The first goal of this paper is to piece together Odum’s theory of information from his many writings. The second goal is to attempt to build on this body of ideas to extend its reach, and to build with his ideas in new directions, but in directions that he would recognize to be in his energy systems science tradition. The result will be two proposed corollaries to his Fifth Energy Law, a Hierarchy of Cultural Information, and a Hierarchy of Manufactured Objects.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"52 1","pages":"473 - 523"},"PeriodicalIF":2.0,"publicationDate":"2023-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42049095","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-12-01DOI: 10.1080/03081079.2022.2151006
Manpreet Kaur, Amit Kumar Srivastava
ABSTRACT Information fusion in uncertain and complex environments is highly challenging. Dempster–Shafer (D-S) evidence theory has been successfully applied by various researchers in multi-sensor data fusion. However, it yields counterintuitive results in case of highly conflicting evidence. In this paper, we have developed a new divergence measure for belief functions that is nonnegative, symmetric, and satisfies the triangle inequality. Using the developed divergence measure, an algorithm for combining distinct basic probability assignments (BPAs) has been discussed and applied in target recognition systems and classification problems.
{"title":"A new divergence measure for belief functions and its applications","authors":"Manpreet Kaur, Amit Kumar Srivastava","doi":"10.1080/03081079.2022.2151006","DOIUrl":"https://doi.org/10.1080/03081079.2022.2151006","url":null,"abstract":"ABSTRACT Information fusion in uncertain and complex environments is highly challenging. Dempster–Shafer (D-S) evidence theory has been successfully applied by various researchers in multi-sensor data fusion. However, it yields counterintuitive results in case of highly conflicting evidence. In this paper, we have developed a new divergence measure for belief functions that is nonnegative, symmetric, and satisfies the triangle inequality. Using the developed divergence measure, an algorithm for combining distinct basic probability assignments (BPAs) has been discussed and applied in target recognition systems and classification problems.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"52 1","pages":"455 - 472"},"PeriodicalIF":2.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45744561","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-11-17DOI: 10.1080/03081079.2022.2086241
Qinli Zhang, Lulu Li
It is more difficult to manipulate a set-valued decision information system (SVDIS) than common information system due to its strong uncertainty. D–S evidence theory can accurately express the unknowness and uncertainty of knowledge and information, so it has a strong ability to deal with uncertainty. This paper studies the measurement of uncertainty based on D–S evidence theory in an SVDIS. First, a novel pseudo-distance between two objects in an SVDIS considering decision attributes is proposed, Second, the tolerance relation based on the pseudo-distance is established. And then, the belief and plausibility are defined on the basis of the tolerance relation. Experimental and statistical analysis show that the defined belief and plausibility work well in measuring the uncertainty of an SVDIS. Furthermore, λ-belief, λ-belief significance, λ-plausibility and λ-plausibility significance reduction algorithms based on the defined belief and plausibility are proposed and the equivalence between λ-belief reduction algorithm and λ-plausibility reduction algorithm is proved. Experimental results and statistical tests on six data sets with missing values from UCI show that the proposed reduction algorithms are statistically superior to some state-of-the-art algorithms in classification accuracy. These findings will provide a wider perspective on the uncertainty of an SVDIS.
{"title":"Attribute reduction for set-valued data based on D–S evidence theory","authors":"Qinli Zhang, Lulu Li","doi":"10.1080/03081079.2022.2086241","DOIUrl":"https://doi.org/10.1080/03081079.2022.2086241","url":null,"abstract":"It is more difficult to manipulate a set-valued decision information system (SVDIS) than common information system due to its strong uncertainty. D–S evidence theory can accurately express the unknowness and uncertainty of knowledge and information, so it has a strong ability to deal with uncertainty. This paper studies the measurement of uncertainty based on D–S evidence theory in an SVDIS. First, a novel pseudo-distance between two objects in an SVDIS considering decision attributes is proposed, Second, the tolerance relation based on the pseudo-distance is established. And then, the belief and plausibility are defined on the basis of the tolerance relation. Experimental and statistical analysis show that the defined belief and plausibility work well in measuring the uncertainty of an SVDIS. Furthermore, λ-belief, λ-belief significance, λ-plausibility and λ-plausibility significance reduction algorithms based on the defined belief and plausibility are proposed and the equivalence between λ-belief reduction algorithm and λ-plausibility reduction algorithm is proved. Experimental results and statistical tests on six data sets with missing values from UCI show that the proposed reduction algorithms are statistically superior to some state-of-the-art algorithms in classification accuracy. These findings will provide a wider perspective on the uncertainty of an SVDIS.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"51 1","pages":"822 - 861"},"PeriodicalIF":2.0,"publicationDate":"2022-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43895999","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-11-17DOI: 10.1080/03081079.2022.2086541
Pekka Laitila, K. Virtanen
System models based on Bayesian networks (BNs) are widely applied in different areas. This paper facilitates the use of such models by advancing the ranked nodes method (RNM) for constructing conditional probability tables (CPTs) of BNs by expert elicitation. In RNM, the CPT of a child node is generated using a function known as the weight expression and weights of parent nodes that are elicited from the expert. However, there is a lack of exact guidelines for eliciting these parameters which complicates the use of RNM. To mitigate this issue, this paper introduces a novel framework for supporting the RNM parameter elicitation. First, the expert assesses the two most probable states of the child node in scenarios that correspond to extreme states of the parent nodes. Then, a feasible weight expression and a feasible weight set are computationally determined. Finally, the expert selects weight values from this set.
{"title":"Advancing construction of conditional probability tables of Bayesian networks with ranked nodes method","authors":"Pekka Laitila, K. Virtanen","doi":"10.1080/03081079.2022.2086541","DOIUrl":"https://doi.org/10.1080/03081079.2022.2086541","url":null,"abstract":"System models based on Bayesian networks (BNs) are widely applied in different areas. This paper facilitates the use of such models by advancing the ranked nodes method (RNM) for constructing conditional probability tables (CPTs) of BNs by expert elicitation. In RNM, the CPT of a child node is generated using a function known as the weight expression and weights of parent nodes that are elicited from the expert. However, there is a lack of exact guidelines for eliciting these parameters which complicates the use of RNM. To mitigate this issue, this paper introduces a novel framework for supporting the RNM parameter elicitation. First, the expert assesses the two most probable states of the child node in scenarios that correspond to extreme states of the parent nodes. Then, a feasible weight expression and a feasible weight set are computationally determined. Finally, the expert selects weight values from this set.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"51 1","pages":"758 - 790"},"PeriodicalIF":2.0,"publicationDate":"2022-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41610942","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-11-09DOI: 10.1080/03081079.2022.2142217
Lesheng Jin, R. Yager, Zhen-Song Chen, Jana Špirková, R. Mesiar
This study defines interval type basic uncertain information and BUI type basic uncertain information, which are two extensions of basic uncertain information and can model more types of uncertainties and uncertainty involved evaluation problems. Under rules based and linguistic decision making environments, we analyze and provide some classification rules with real values, interval values, BUI granules, interval type basic uncertain information and BUI type basic uncertain information. Using the proposed new concepts and decision making methods, an illustrative example in preference and uncertainty involved multi-source evaluation is presented.
{"title":"Interval and BUI type basic uncertain information in multi-sources evaluation and rules based decision making","authors":"Lesheng Jin, R. Yager, Zhen-Song Chen, Jana Špirková, R. Mesiar","doi":"10.1080/03081079.2022.2142217","DOIUrl":"https://doi.org/10.1080/03081079.2022.2142217","url":null,"abstract":"This study defines interval type basic uncertain information and BUI type basic uncertain information, which are two extensions of basic uncertain information and can model more types of uncertainties and uncertainty involved evaluation problems. Under rules based and linguistic decision making environments, we analyze and provide some classification rules with real values, interval values, BUI granules, interval type basic uncertain information and BUI type basic uncertain information. Using the proposed new concepts and decision making methods, an illustrative example in preference and uncertainty involved multi-source evaluation is presented.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"52 1","pages":"443 - 454"},"PeriodicalIF":2.0,"publicationDate":"2022-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48867123","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-11-06DOI: 10.1080/03081079.2022.2132488
Milad Shahvali, Ali Azarbahram, N. Pariz
This paper presents the distributed control design for a class of fractional-order strict-feedback nonlinear multi-agent systems in the presence of unknown dynamics by employing backstepping strategy. Considering that the information of followers’ states are not fully measurable for feedback design, the fractional-order infinite-dimension neural-network state observer is introduced to estimate the unavailable states. The infinite-dimension neuroadaptive laws are also proposed to eliminate the undesirable effects of the unknown nonlinear functions. Besides, based on the Lyapunov fractional-order stability approach and graph theory, unlike the existing results, a distributed neural adaptive observer-based control architecture is designed to ensure that all the closed-loop network signals are ultimately bounded. Finally, a simulation example is given to demonstrate the validity of the proposed control method.
{"title":"Adaptive output consensus of nonlinear fractional-order multi-agent systems: a fractional-order backstepping approach","authors":"Milad Shahvali, Ali Azarbahram, N. Pariz","doi":"10.1080/03081079.2022.2132488","DOIUrl":"https://doi.org/10.1080/03081079.2022.2132488","url":null,"abstract":"This paper presents the distributed control design for a class of fractional-order strict-feedback nonlinear multi-agent systems in the presence of unknown dynamics by employing backstepping strategy. Considering that the information of followers’ states are not fully measurable for feedback design, the fractional-order infinite-dimension neural-network state observer is introduced to estimate the unavailable states. The infinite-dimension neuroadaptive laws are also proposed to eliminate the undesirable effects of the unknown nonlinear functions. Besides, based on the Lyapunov fractional-order stability approach and graph theory, unlike the existing results, a distributed neural adaptive observer-based control architecture is designed to ensure that all the closed-loop network signals are ultimately bounded. Finally, a simulation example is given to demonstrate the validity of the proposed control method.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"52 1","pages":"147 - 168"},"PeriodicalIF":2.0,"publicationDate":"2022-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45193033","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}
ABSTRACT In this paper, the robust stability of fractional-order systems with fractional order and structured uncertain parameters is considered. Firstly, novel robust stability conditions of the above systems are presented based on the parameter-dependent polynomial functions. Secondly, the existence of the parameter-dependent polynomial functions is transformed into linear matrix inequalities via the generalized Kalman-Yakubovič-Popov lemma. In addition, the above methods can also be applied to solve the robust stability of fractional-order systems with structured uncertainties or polytopic uncertainties. Finally, numerical examples are presented to show the proposed methods are less conservative than the existing methods.
{"title":"Novel robust stability conditions of fractional-order systems with structured uncertain parameters based on parameter-dependent functions: the 0","authors":"Chenfei Kang, Jun‐Guo Lu, Xudong Qiu, Qing‐Hao Zhang","doi":"10.1080/03081079.2022.2132489","DOIUrl":"https://doi.org/10.1080/03081079.2022.2132489","url":null,"abstract":"ABSTRACT In this paper, the robust stability of fractional-order systems with fractional order and structured uncertain parameters is considered. Firstly, novel robust stability conditions of the above systems are presented based on the parameter-dependent polynomial functions. Secondly, the existence of the parameter-dependent polynomial functions is transformed into linear matrix inequalities via the generalized Kalman-Yakubovič-Popov lemma. In addition, the above methods can also be applied to solve the robust stability of fractional-order systems with structured uncertainties or polytopic uncertainties. Finally, numerical examples are presented to show the proposed methods are less conservative than the existing methods.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"52 1","pages":"169 - 190"},"PeriodicalIF":2.0,"publicationDate":"2022-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42478066","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
扫码关注我们
求助内容：
应助结果提醒方式：