Modelirovanie i Analiz Informacionnyh Sistem最新文献

Application of the algorithm for finding the outer median of a graph in the problems of determining the reliability of technical systems 求图外中值算法在确定技术系统可靠性问题中的应用

Modelirovanie i Analiz Informacionnyh Sistem Pub Date : 2023-09-17 DOI: 10.18255/1818-1015-2023-3-258-263

Vladimir B. Tikhonov, Yuri A. Plaksa, Svetlana A. Kurochkina, Nataliya A. Prusova

引用次数: 0

Logic for reasoning about bugs in loops over data sequences (IFIL) 对数据序列(IFIL)循环中的错误进行推理的逻辑

Modelirovanie i Analiz Informacionnyh Sistem Pub Date : 2023-09-17 DOI: 10.18255/1818-1015-2023-3-214-233

Dmitry A. Kondratyev

{"title":"Logic for reasoning about bugs in loops over data sequences (IFIL)","authors":"Dmitry A. Kondratyev","doi":"10.18255/1818-1015-2023-3-214-233","DOIUrl":"https://doi.org/10.18255/1818-1015-2023-3-214-233","url":null,"abstract":"Classic deductive verification is not focused on reasoning about program incorrectness. Reasoning about program incorrectness using formal methods is an important problem nowadays. Special logics such as Incorrectness Logic, Adversarial Logic, Local Completeness Logic, Exact Separation Logic and Outcome Logic have recently been proposed to address it. However, these logics have two disadvantages. One is that they are based on under-approximation approaches, while classic deductive verification is based on the over-approximation approach. One the other hand, the use of the classic approach requires defining loop invariants in a general case. The second disadvantage is that the use of generalized inference rules from these logics results in having to prove too complex formulas in simple cases. Our contribution is a new logic for solving these problems in the case of loops over data sequences. These loops are referred to as finite iterations. We call the proposed logic the Incorrectness Finite Iteration Logic (IFIL). We avoid defining invariants of finite iterations using a symbolic replacement of these loops with recursive functions. Our logic is based on special inference rules for finite iterations. These rules allow generating formulas with recursive functions corresponding to finite iterations. The validity of these formulas may indicate the presence of bugs in the finite iterations. This logic has been implemented in a new version of the C-lightVer system for deductive verification of C programs.","PeriodicalId":31017,"journal":{"name":"Modelirovanie i Analiz Informacionnyh Sistem","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135304434","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}

引用次数: 0

Text classification by CEFR levels using machine learning methods and BERT language model 使用机器学习方法和BERT语言模型对CEFR水平进行文本分类

Modelirovanie i Analiz Informacionnyh Sistem Pub Date : 2023-09-17 DOI: 10.18255/1818-1015-2023-3-202-213

Nadezhda S. Lagutina, Ksenia V. Lagutina, Anastasya M. Brederman, Natalia N. Kasatkina

{"title":"Text classification by CEFR levels using machine learning methods and BERT language model","authors":"Nadezhda S. Lagutina, Ksenia V. Lagutina, Anastasya M. Brederman, Natalia N. Kasatkina","doi":"10.18255/1818-1015-2023-3-202-213","DOIUrl":"https://doi.org/10.18255/1818-1015-2023-3-202-213","url":null,"abstract":"This paper presents a study of the problem of automatic classification of short coherent texts (essays) in English according to the levels of the international CEFR scale. Determining the level of text in natural language is an important component of assessing students knowledge, including checking open tasks in e-learning systems. To solve this problem, vector text models were considered based on stylometric numerical features of the character, word, sentence structure levels. The classification of the obtained vectors was carried out by standard machine learning classifiers. The article presents the results of the three most successful ones: Support Vector Classifier, Stochastic Gradient Descent Classifier, LogisticRegression. Precision, recall and F-score served as quality measures. Two open text corpora, CEFR Levelled English Texts and BEA-2019, were chosen for the experiments. The best classification results for six CEFR levels and sublevels from A1 to C2 were shown by the Support Vector Classifier with F-score 67 % for the CEFR Levelled English Texts. This approach was compared with the application of the BERT language model (six different variants). The best model, bert-base-cased, provided the F-score value of 69 %. The analysis of classification errors showed that most of them are between neighboring levels, which is quite understandable from the point of view of the domain. In addition, the quality of classification strongly depended on the text corpus, that demonstrated a significant difference in F-scores during application of the same text models for different corpora. In general, the obtained results showed the effectiveness of automatic text level detection and the possibility of its practical application.","PeriodicalId":31017,"journal":{"name":"Modelirovanie i Analiz Informacionnyh Sistem","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135304433","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}

引用次数: 0

The Boltzmann distribution in the problem of rational choice by population of a patch under an imperfect information about its resources 在资源信息不完全的情况下，种群理性选择问题中的玻尔兹曼分布

Modelirovanie i Analiz Informacionnyh Sistem Pub Date : 2023-09-17 DOI: 10.18255/1818-1015-2023-3-234-245

Alexander N. Kirillov, Inna V. Danilova

{"title":"The Boltzmann distribution in the problem of rational choice by population of a patch under an imperfect information about its resources","authors":"Alexander N. Kirillov, Inna V. Danilova","doi":"10.18255/1818-1015-2023-3-234-245","DOIUrl":"https://doi.org/10.18255/1818-1015-2023-3-234-245","url":null,"abstract":"The problem of rational choice by the population of a patch containing energy (nutritive) resources is considered. This problem belongs to the theory of optimal foraging, which, in turn of, studies issues related to the behavior of the population when it leaves the patch or chooses the most suitable one. In order to define the optimal patch choice for population, a variational approach, based on the idea of the Boltzmann distribution is proposed. To construct the probability distribution the utility functions are used, that take into account factors that can influence the patch choice of a population: available information about the quality of patches, the energy utility of patches, the cost of moving to the patch, the cost of information about the quality of patches. The main goal of the paper is to investigate the influence of available information about the amount of resources, contained in patches, on a decision-making process generated by the foragers while a suitable patch choosing. The optimal rationality is determined in the cases taking into account the information cost, the average energy utility of all patches, the rationality depending on the patch. The conditions under which the population, with the lack of information, select the “poor” patch, in sense of its resources, are obtained. The latter provides a theoretical justification of experimental observations, according to which a population can choose a patch with worse quality. The obtained results have a general character and may be used not only in behavioral ecology but when constructing any decision making processes.","PeriodicalId":31017,"journal":{"name":"Modelirovanie i Analiz Informacionnyh Sistem","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135304436","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}

引用次数: 0

On a geometric approach to the estimation of interpolation projectors 插值投影估计的一种几何方法

Modelirovanie i Analiz Informacionnyh Sistem Pub Date : 2023-09-17 DOI: 10.18255/1818-1015-2023-3-246-257

Nevskii, Mikhail, Ukhalov, Alexey

{"title":"On a geometric approach to the estimation of interpolation projectors","authors":"Nevskii, Mikhail, Ukhalov, Alexey","doi":"10.18255/1818-1015-2023-3-246-257","DOIUrl":"https://doi.org/10.18255/1818-1015-2023-3-246-257","url":null,"abstract":"Suppose $Omega$ is a closed bounded subset of ${mathbb R}^n,$ $S$ is an $n$-dimensional non-degenerate simplex, $xi(Omega;S):=min left{sigmageq 1: , Omegasubset sigma Sright}$. Here $sigma S$ is the result of homothety of $S$ with respect to the center of gravity with coefficient $sigma$. Let $dgeq n+1,$ $varphi_1(x),ldots,varphi_d(x)$ be linearly independent monomials in $n$ variables, $varphi_1(x)equiv 1,$ $varphi_2(x)=x_1, ldots, varphi_{n+1}(x)=x_n.$ Put $Pi:={rm lin}(varphi_1,ldots,varphi_d).$ The interpolation projector $P: C(Omega)to Pi$ with a set of nodes $x^{(1)},ldots, x^{(d)}$ $ in Omega$ is defined by equalities $Pfleft(x^{(j)}right)=fleft(x^{(j)}right).$ Denote by $|P|_{Omega}$ the norm of $P$ as an operator from $C(Omega)$ to $C(Omega)$. Consider the mapping $T:{mathbb R}^nto {mathbb R}^{d-1}$ of the form $T(x):=(varphi_2(x),ldots,varphi_d(x)). $ We have the following inequalities: $ frac{1}{2}left(1+frac{1}{d-1}right)left(|P|_{Omega}-1right)+1$ $ leq xi(T(Omega);S)leq frac{d}{2}left(|P|_{Omega}-1right)+1. $ Here $S$ is the $(d-1)$-dimensional simplex with vertices $Tleft(x^{(j)}right).$ We discuss this and other relations for polynomial interpolation of functions continuous on a segment. The results of numerical analysis are presented.","PeriodicalId":31017,"journal":{"name":"Modelirovanie i Analiz Informacionnyh Sistem","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135257685","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}

引用次数: 0

The algorithms for the Eulerian cycle and Eulerian trail problems for a multiple graph 多图的欧拉循环和欧拉轨迹问题的算法

Modelirovanie i Analiz Informacionnyh Sistem Pub Date : 2023-09-17 DOI: 10.18255/1818-1015-2023-3-264-282

Alexander V. Smirnov

{"title":"The algorithms for the Eulerian cycle and Eulerian trail problems for a multiple graph","authors":"Alexander V. Smirnov","doi":"10.18255/1818-1015-2023-3-264-282","DOIUrl":"https://doi.org/10.18255/1818-1015-2023-3-264-282","url":null,"abstract":"In this paper, we study undirected multiple graphs of any natural multiplicity $k>1$. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of $k$ linked edges, which connect 2 or $(k+1)$ vertices, correspondingly. The linked edges should be used simultaneously. If a vertex is incident to a multiple edge, it can be also incident to other multiple edges and it can be the common end of $k$ linked edges of some multi-edge. If a vertex is the common end of some multi-edge, it cannot be the common end of another multi-edge. We set the problem of finding the eulerian walk (the cycle or the trail) in a multiple graph, which generalizes the classical problem for an ordinary graph. We formulate the necessary conditions for existence of an eulerian walk in a multiple graph and show that these conditions are not sufficient. Besides that, we show that the necessary conditions of existence of an eulerian cycle and eulerian trail are not mutually exclusive for an arbitrary multiple graph, that is why it is possible to construct a multiple graph where two types of eulerian walks exist simultaneously. Any multiple graph can be juxtaposed to the ordinary graph with quasi-vertices, which represents the structure of the initial graph in a simpler form. In particular, each eulerian walk in the multiple graph corresponds to the eulerian walk in the graph with quasi-vertices. The algorithm for getting such a graph is formulated. Also, the auxiliary problem of finding the covering trails with given endpoints in an ordinary graph is studied. Two algorithms are obtained for this problem. We elaborate the algorithm for finding the eulerian walk in a multiple graph, which has the exponential complexity. We suggest the polynomial algorithm for the special case of a multiple graph and show that the necessary conditions are sufficient for existence of an eulerian walk in this special case.","PeriodicalId":31017,"journal":{"name":"Modelirovanie i Analiz Informacionnyh Sistem","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135304435","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}

引用次数: 0

Generalization of typed include dependencies with null values in databases 泛化数据库中具有空值的类型化包括依赖项

Modelirovanie i Analiz Informacionnyh Sistem Pub Date : 2023-09-17 DOI: 10.18255/1818-1015-2023-3-192-201

Sergey V. Zykin

引用次数: 0

Лингвостатистический анализ терминологии для построения тезауруса предметной области 建立主题领域术语词库的语言学统计术语分析

Modelirovanie i Analiz Informacionnyh Sistem Pub Date : 2015-12-20 DOI: 10.18255/1818-1015-2015-6-834-851

Мария Сергеевна Каряева

引用次数: 3