Fundamentals of a Fuzzy-Logic-Based Generalized Theory of Stability
Pourquoi ce travail est dans la base
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Notice bibliographique
Résumé
Stability is one of the fundamental concepts of complex dynamical systems including physical, economical, socioeconomical, and technical systems. In classical terms, the notion of stability inherently associates with any dynamical system and determines whether a system under consideration reaches equilibrium after being exposed to disturbances. Predominantly, this concept comes with a binary (Boolean) quantification (viz., we either quantify that systems are stable or not stable). While in some cases, this definition is well justifiable, with the growing complexity and diversity of systems one could seriously question the Boolean nature of the definition and its underlying semantics. This becomes predominantly visible in human-oriented quantification of stability in which we commonly encounter statements quantifying stability through some linguistic terms such as, e.g., absolutely unstable, highly unstable, ..., absolutely stable, and alike. To formulate human-oriented definitions of stability, we may resort ourselves to the use of a so-called Precisiated Natural Language, which comes as a subset of natural language and one of whose functions is redefining existing concepts, such as stability, optimality, and alike. Being prompted by the discrepancy of the definition of stability and the Boolean character of the concept itself, in this paper, we introduce and develop a Generalized Theory of Stability (GTS) for analysis of complex dynamical systems described by fuzzy differential equations. Different human-centric definitions of stability of dynamical systems are introduced. We also discuss and contrast several fundamental concepts of fuzzy stability, namely, fuzzy stability of systems, binary stability of fuzzy system, and binary stability of systems by showing that all of them arise as special cases of the proposed GTS. The introduced definitions offer an important ability to quantify the concept of stability using some continuous quantification (that is through the use of degrees of stability). In this manner, we radically depart from the previous binary character of the definition. We establish some criteria concerning generalized stability for a wide class of continuous dynamical systems. Next, we present a series of illustrative examples which demonstrate the essence of the concept, and at the same time, stress that the existing Boolean techniques are not capable of capturing the essence of linguistic stability. We also apply the obtained results to investigate the stability of an economical system and show its usefulness in the design of nonlinear fuzzy control systems given some predefined degree of stability.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,001 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,001 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle