Pub Date : 2024-12-16DOI: 10.3103/S0005105524700286
E. A. Efimova
An algebraic point of view on the description of abstract data types is applied to JSM reasoning: names of sorts and types of algebraic operations are presented together with equations that can determine their meaning. These equations form a convergent system of term rewriting. The Wolfram language is used for the equation definitions. The algebraic specification could be used both to create an ontology and to program an implementation of plausible reasoning.
{"title":"Algebraic Specification of Plausible Reasoning","authors":"E. A. Efimova","doi":"10.3103/S0005105524700286","DOIUrl":"10.3103/S0005105524700286","url":null,"abstract":"<p>An algebraic point of view on the description of abstract data types is applied to JSM reasoning: names of sorts and types of algebraic operations are presented together with equations that can determine their meaning. These equations form a convergent system of term rewriting. The Wolfram language is used for the equation definitions. The algebraic specification could be used both to create an ontology and to program an implementation of plausible reasoning.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"58 5","pages":"364 - 374"},"PeriodicalIF":0.5,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142826441","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-16DOI: 10.3103/S0005105524700250
K. S. Sarin, R. E. Kolomnikov, M. O. Svetlakov, I. A. Hodashinsky
A modified fuzzy min-max classifier is presented that differs from the original in the way that the hyperbox expansion operation is performed. The classifier has been tested on the solution of cybersecurity problems, such as detecting spam, phishing sites and attacks on network connections. The results of experiments results showed an improvement in the accuracy relative to the original fuzzy min-max classifier. Comparisons with six alternative incremental learning classifiers showed competitive results on the false acceptance rate, the false reject rate, and the F1-score values.
本文介绍了一种改进的模糊最小最大分类器,它与原始分类器的不同之处在于执行超箱扩展操作的方式。该分类器已在解决网络安全问题(如检测垃圾邮件、钓鱼网站和网络连接攻击)方面进行了测试。实验结果表明,相对于原始的模糊最小最大分类器,该分类器的准确率有所提高。与其他六种增量学习分类器的比较结果显示,在错误接受率、错误拒绝率和 F1 分数值方面,该分类器都具有竞争力。
{"title":"Fuzzy Min-Max Classifier in Cybersecurity Applications","authors":"K. S. Sarin, R. E. Kolomnikov, M. O. Svetlakov, I. A. Hodashinsky","doi":"10.3103/S0005105524700250","DOIUrl":"10.3103/S0005105524700250","url":null,"abstract":"<p>A modified fuzzy min-max classifier is presented that differs from the original in the way that the hyperbox expansion operation is performed. The classifier has been tested on the solution of cybersecurity problems, such as detecting spam, phishing sites and attacks on network connections. The results of experiments results showed an improvement in the accuracy relative to the original fuzzy min-max classifier. Comparisons with six alternative incremental learning classifiers showed competitive results on the false acceptance rate, the false reject rate, and the F1-score values.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"58 5","pages":"299 - 309"},"PeriodicalIF":0.5,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142826277","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-16DOI: 10.3103/S0005105524700274
T. I. Buldakova, J. A. Vishnevskaya, A. Sh. Dzhalolov, S. I. Suyatinov
Using the synergetic model proposed by G. Haken, the problem of assessing the socio-economic state of the region from a lot of unstructured data is considered. The intelligent model implemented allows us to assess the state of the region based on a set of data characterizing its economic, financial, social, and technological processes. Reference feature vectors are proposed to represent four different states. Examples of using the developed model to assess the current state of regions are given.
利用 G. Haken 提出的协同模型,考虑了从大量非结构化数据中评估地区社会经济状况的问题。所实施的智能模型允许我们根据一组描述其经济、金融、社会和技术进程的数据来评估该地区的状况。我们提出了代表四种不同状态的参考特征向量。文中举例说明了如何使用所开发的模型来评估地区的现状。
{"title":"Assessment of the Socio-Economic State of a Region Based on the Haken Model","authors":"T. I. Buldakova, J. A. Vishnevskaya, A. Sh. Dzhalolov, S. I. Suyatinov","doi":"10.3103/S0005105524700274","DOIUrl":"10.3103/S0005105524700274","url":null,"abstract":"<p>Using the synergetic model proposed by G. Haken, the problem of assessing the socio-economic state of the region from a lot of unstructured data is considered. The intelligent model implemented allows us to assess the state of the region based on a set of data characterizing its economic, financial, social, and technological processes. Reference feature vectors are proposed to represent four different states. Examples of using the developed model to assess the current state of regions are given.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"58 5","pages":"351 - 358"},"PeriodicalIF":0.5,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142826440","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-16DOI: 10.3103/S0005105524700304
L. A. Mylnikov, A. D. Saltykova
The article describes a statistical analysis technique for information infrastructure performance based on processes modeling and simulation in an event-driven process methodology notation. The concepts of sustainability and survivability of the information infrastructure are introduced. A definition of marginal performance is proposed that allows the information infrastructure to be in a stable state.
{"title":"Information Processing and Performance Research in Event-Driven Process Metodology (EPM) Notation","authors":"L. A. Mylnikov, A. D. Saltykova","doi":"10.3103/S0005105524700304","DOIUrl":"10.3103/S0005105524700304","url":null,"abstract":"<p>The article describes a statistical analysis technique for information infrastructure performance based on processes modeling and simulation in an event-driven process methodology notation. The concepts of sustainability and survivability of the information infrastructure are introduced. A definition of marginal performance is proposed that allows the information infrastructure to be in a stable state.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"58 5","pages":"333 - 338"},"PeriodicalIF":0.5,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142826282","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-16DOI: 10.3103/S0005105524700316
A. N. Rodionov
It is quite difficult to abandon well-ordered formal constructions, even if they are of little use in practice. The normalization method which, with the emergence and development of an alternative semantic direction, has gradually faded into the background has today found itself in such a situation in data modeling. Nevertheless, the practical potential of normalization has not been exhausted. Removing the restriction on the mandatory decomposition of factographic relations (FRs) with join dependencies and expanding the range of compositional dependencies that can objectively be present in such relations significantly expand the boundaries of the method’s suitability, including allowing one to fill in the gaps in the incompleteness of information concerning the organization and functioning of the domain being modeled. This paper focuses on identifying and considering new classes of dependencies: projection, Cartesian product, intersection, union, and difference, as well as on deriving a formula for an arbitrary FR that comprehensively takes into account the influence of all compositional dependencies found in the relation on its possible content.
{"title":"Compositional Dependencies and High-Order Relations Formulas at Relational Data Models","authors":"A. N. Rodionov","doi":"10.3103/S0005105524700316","DOIUrl":"10.3103/S0005105524700316","url":null,"abstract":"<p>It is quite difficult to abandon well-ordered formal constructions, even if they are of little use in practice. The normalization method which, with the emergence and development of an alternative semantic direction, has gradually faded into the background has today found itself in such a situation in data modeling. Nevertheless, the practical potential of normalization has not been exhausted. Removing the restriction on the mandatory decomposition of factographic relations (FRs) with join dependencies and expanding the range of compositional dependencies that can objectively be present in such relations significantly expand the boundaries of the method’s suitability, including allowing one to fill in the gaps in the incompleteness of information concerning the organization and functioning of the domain being modeled. This paper focuses on identifying and considering new classes of dependencies: projection, Cartesian product, intersection, union, and difference, as well as on deriving a formula for an arbitrary FR that comprehensively takes into account the influence of all compositional dependencies found in the relation on its possible content.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"58 5","pages":"320 - 332"},"PeriodicalIF":0.5,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142826280","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-16DOI: 10.3103/S0005105524700262
V. V. Shvedenko
This paper adopts a method of homeostatic support of a complex system using a swarm algorithms. It is proposed to use information objects that are represented in the form of invariant structures as swarm agents. This provides the possibility of classifying information objects by one or a number of homogeneous properties, as well as applied methods of data collection and processing. This approach allows the grouping of objects of any nature into a swarm structure. The invariant structure of information objects also provides the possibility of conversion of stored data without losses and distortions into different services of information systems. The system representation of swarm management of the homeostasis of complex systems by means of interaction of different swarm groups that differ in terms of behavioral models is given in accordance with the given target reference points. Classification of swarm groups is considered. The description of invariant swarm structures is given.
{"title":"Use of the Swarm Control Method to Maintain the Homeostasis of a Complex System Based on Interacting Information Objects","authors":"V. V. Shvedenko","doi":"10.3103/S0005105524700262","DOIUrl":"10.3103/S0005105524700262","url":null,"abstract":"<p>This paper adopts a method of homeostatic support of a complex system using a swarm algorithms. It is proposed to use information objects that are represented in the form of invariant structures as swarm agents. This provides the possibility of classifying information objects by one or a number of homogeneous properties, as well as applied methods of data collection and processing. This approach allows the grouping of objects of any nature into a swarm structure. The invariant structure of information objects also provides the possibility of conversion of stored data without losses and distortions into different services of information systems. The system representation of swarm management of the homeostasis of complex systems by means of interaction of different swarm groups that differ in terms of behavioral models is given in accordance with the given target reference points. Classification of swarm groups is considered. The description of invariant swarm structures is given.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"58 5","pages":"310 - 319"},"PeriodicalIF":0.5,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142826281","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-16DOI: 10.3103/S0005105524700237
A. S. Kuznetsova, O. R. Shefer, T. N. Lebedeva
The role of computer modeling in the study of physical and astronomical processes and phenomena is difficult to overestimate. Today, computer modeling is in demand in various scientific fields and, in comparison with noncomputer modeling methods and full-scale testing, allows the creation of prototypes for the studied objects, processes, or systems that function in a given specific environment. Taking into account the complexity of the models being created and conducting experiments in real conditions, computer modeling allows, depending on the factors and conditions of the functioning of objects in a virtual environment, analysis, making various forecasts for the future, studying the interaction between objects, and presenting the results obtained in a convenient graphic, textual, or tabular forms. The article discusses particular mathematical solutions to the three-body problem proposed by mathematicians from different countries from the 18th to the 21st centuries. The presented project allows us to touch on knowledge from various fields (physics, astronomy, mathematics, and history) and implement a mathematical model of the system using the state vector of three bodies and integrating a system of differential equations using a program based on the explicit Runge–Kutta method of the eighth order of accuracy.
{"title":"Computer Simulation of Stable Orbits in the Three-Body Problem","authors":"A. S. Kuznetsova, O. R. Shefer, T. N. Lebedeva","doi":"10.3103/S0005105524700237","DOIUrl":"10.3103/S0005105524700237","url":null,"abstract":"<p>The role of computer modeling in the study of physical and astronomical processes and phenomena is difficult to overestimate. Today, computer modeling is in demand in various scientific fields and, in comparison with noncomputer modeling methods and full-scale testing, allows the creation of prototypes for the studied objects, processes, or systems that function in a given specific environment. Taking into account the complexity of the models being created and conducting experiments in real conditions, computer modeling allows, depending on the factors and conditions of the functioning of objects in a virtual environment, analysis, making various forecasts for the future, studying the interaction between objects, and presenting the results obtained in a convenient graphic, textual, or tabular forms. The article discusses particular mathematical solutions to the three-body problem proposed by mathematicians from different countries from the 18th to the 21st centuries. The presented project allows us to touch on knowledge from various fields (physics, astronomy, mathematics, and history) and implement a mathematical model of the system using the state vector of three bodies and integrating a system of differential equations using a program based on the explicit Runge–Kutta method of the eighth order of accuracy.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"58 5","pages":"339 - 350"},"PeriodicalIF":0.5,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142826439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-16DOI: 10.3103/S0005105524700249
M. A. Mikheyenkova
The paper investigates the problems of formalizing the heuristics used to generate various types of typologies, in relation to the functional role of the types generated. Data analysis methods that study interpreted and causal models are basis for constructing explanatory typologies. This paper proposes an approach that implements plausible reasoning by logical means to inductively generate cause-and-effect relationships in limited (but potentially replenished) datasets. Some results of empirical typologization are presented that are useful for the formation of theoretical concepts and the development of applied recommendations in social policy.
{"title":"Formalized Heuristic for Generation an Explanatory Typology","authors":"M. A. Mikheyenkova","doi":"10.3103/S0005105524700249","DOIUrl":"10.3103/S0005105524700249","url":null,"abstract":"<div><p>The paper investigates the problems of formalizing the heuristics used to generate various types of typologies, in relation to the functional role of the types generated. Data analysis methods that study interpreted and causal models are basis for constructing explanatory typologies. This paper proposes an approach that implements plausible reasoning by logical means to inductively generate cause-and-effect relationships in limited (but potentially replenished) datasets. Some results of empirical typologization are presented that are useful for the formation of theoretical concepts and the development of applied recommendations in social policy.</p></div>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"58 5","pages":"291 - 298"},"PeriodicalIF":0.5,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142826278","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-16DOI: 10.3103/S0005105524700298
V. A. Zhebit
The problem of the possibility of the manifestation of machine consciousness cannot be solved until there is a sufficient understanding of what human consciousness is. Only this will make it possible to use comparative analysis as a tool within the framework of the current paradigm. However, there are already methodological approaches that allow us to solve such problems. A new methodology is proposed based on the synthesis of physical and psychological approaches, as well as assessments of the systemic properties of material objects recognized as subjects of action. The presence of mental properties of systems is considered to be derivative of their homeostasis, which implies the recognition of the presence of mentality in any material structures.
{"title":"On the Way to Machine Consciousness: On the Mentality of Physical Systems","authors":"V. A. Zhebit","doi":"10.3103/S0005105524700298","DOIUrl":"10.3103/S0005105524700298","url":null,"abstract":"<p>The problem of the possibility of the manifestation of machine consciousness cannot be solved until there is a sufficient understanding of what human consciousness is. Only this will make it possible to use comparative analysis as a tool within the framework of the current paradigm. However, there are already methodological approaches that allow us to solve such problems. A new methodology is proposed based on the synthesis of physical and psychological approaches, as well as assessments of the systemic properties of material objects recognized as subjects of action. The presence of mental properties of systems is considered to be derivative of their homeostasis, which implies the recognition of the presence of mentality in any material structures.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"58 5","pages":"359 - 363"},"PeriodicalIF":0.5,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142826442","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-25DOI: 10.3103/S0005105524700225
Yu. I. Butenko
The article proposes a method for the alignment of multicomponent terminological units in scientific and technical texts placed in English-Russian parallel corpus. The approaches, methods, software, and levels of text alignment in parallel corpora are analyzed. The linguistic peculiarities of English- and Russian-language terminology influencing the process of alignment of special lexicon, as well as the peculiarities of SimAlign package operation in parallel text processing, are investigated. Two approaches to the alignment of multicomponent terms in a parallel corpus are analyzed. The influence of peculiarities of languages with different grammatical characteristics is shown.
{"title":"Multicomponent English and Russian Terms Alignment in a Parallel Corpus Based on a SimAlign Package","authors":"Yu. I. Butenko","doi":"10.3103/S0005105524700225","DOIUrl":"10.3103/S0005105524700225","url":null,"abstract":"<p>The article proposes a method for the alignment of multicomponent terminological units in scientific and technical texts placed in English-Russian parallel corpus. The approaches, methods, software, and levels of text alignment in parallel corpora are analyzed. The linguistic peculiarities of English- and Russian-language terminology influencing the process of alignment of special lexicon, as well as the peculiarities of SimAlign package operation in parallel text processing, are investigated. Two approaches to the alignment of multicomponent terms in a parallel corpus are analyzed. The influence of peculiarities of languages with different grammatical characteristics is shown.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"58 4","pages":"280 - 289"},"PeriodicalIF":0.5,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142413693","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}