{"title":"Descriptions of Some Boundary-Value Problems in the Semantic Library LibMeta","authors":"O. M. Ataeva, V. A. Serebryakov, N. P. Tuchkova","doi":"10.3103/S0005105525700050","DOIUrl":"10.3103/S0005105525700050","url":null,"abstract":"<p>An ontological approach to design approach was used to describe the semantics of some boundary value problems in the LibMeta digital library. To describe problems in the LibMeta library, connections of terms and concepts with classical definitions from the mathematical encyclopedia and other primary sources are established. Establishing links allows a dictionary and thesaurus to be formed for the applied subject area of new boundary value problems, placing the results in the semantic environment of the digital library. Examples of this approach are seen in terms of the capabilities of LibMeta semantic library, which contains a digitized version of the mathematical encyclopedia, encyclopedia of mathematical physics, classifiers, and applied mathematical thesauri and dictionaries. New terms, drawn from publications, after they are added to the content of the library, are reflected in links in the mathematical encyclopedia. A thesaurus for problems in domain of elasticity theory was created by integrating subject dictionaries, classifiers, metadata of specialized journal publications, and the encyclopedic content of the LibMeta library. The purpose of this research is to provide the user with additional services in the search for publications in the applied scientific field.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"58 1 supplement","pages":"S1 - S9"},"PeriodicalIF":0.5,"publicationDate":"2025-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676256","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}
{"title":"Image Classification Using Convolutional Neural Networks","authors":"S. A. Filippov","doi":"10.3103/S0005105525700219","DOIUrl":"10.3103/S0005105525700219","url":null,"abstract":"<p>At present, many different tools can be used to classify images, each of which is intended to solve tasks in a certain range. This article provides a brief overview of libraries and technologies with respect to image classification. The architecture of a simple convolutional neural network for image classification is built. Experiments on image recognition have been conducted with popular neural networks such as VGG 16 and ResNet 50. Both neural networks have shown good results. However, ResNet 50 overfitted due to the fact that the dataset contained the same type of images for training, as this neural network has more layers that allow reading the attributes of objects in the images. A comparative analysis of image recognition that was particularly prepared for this experiment was carried out using the trained models.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"58 3 supplement","pages":"S143 - S149"},"PeriodicalIF":0.5,"publicationDate":"2025-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676497","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}
{"title":"Dependence of the First Frequency of Natural Vibrations of a Beam Truss with a Triangular Lattice on the Number of Panels","authors":"M. N. Kirsanov, A. I. Munitsyn","doi":"10.3103/S000510552570013X","DOIUrl":"10.3103/S000510552570013X","url":null,"abstract":"<p>An algorithm is given for deriving the analytical dependence of the smallest natural frequency of oscillations of a plane of a statically determinate regular truss on the number of panels. The Dunkerley method and the simplified version Dunkerley method are used. It is shown that the simplified version gives not only a simpler, but also a more accurate formula. It is assumed that the mass of the truss is concentrated on its nodes, and the number of degrees of freedom of the structure coincides with the number of the nodes. For analytical transformations and to solve recurrent equations, the computer mathematics system Maple was used. Truss stiffness is calculated using the Maxwell–Mohr formula.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"58 2 supplement","pages":"S73 - S78"},"PeriodicalIF":0.5,"publicationDate":"2025-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676535","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}
{"title":"“Turklang” Linguistic Knowledge Graph for Creation of Tools for Teaching Turkic Languages","authors":"A. R. Gatiatullin, N. A. Prokopyev","doi":"10.3103/S0005105525700153","DOIUrl":"10.3103/S0005105525700153","url":null,"abstract":"<p>This article presents elements of the “Turklang” linguistic knowledge graph developed at the Institute of Applied Semiotics of the Academy of Sciences of Tatarstan and used as a basis for creating a number of linguistic resources and tools: the “Turkic Morpheme” portal, the “Tugan Tel” electronic corpus of the Tatar language, linguistic processors. Creating an educational environment requires subject-oriented knowledge graphs, for which methods of general and open graphs are not suitable. This paper describes linguistic knowledge graphs, which reflect, on the one hand, potential capabilities of Turkic languages, and on the other hand, examples of actual use in texts. Peculiarity of these knowledge graphs is that they contain linguistic units of different linguistic levels and concepts corresponding to meanings of these linguistic units, which are built into a single model of the linguistic knowledge graph. Structure of this knowledge graph allows to formulate the content of a training course, build an individual educational trajectory, as well as create tests and tools of automated answer grading as part of knowledge control when teaching Turkic languages. This makes it possible to subsequently develop, based on these graphs, training programs taking into account the structural and functional features of the Turkic languages and also contributes to the implementation of individual goals of students.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"58 3 supplement","pages":"S95 - S101"},"PeriodicalIF":0.5,"publicationDate":"2025-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676219","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}
{"title":"Multidimensional Geometry in Elective Courses for Secondary School and First-Year University Students","authors":"V. V. Shurygin, V. V. (Jr.) Shurygin","doi":"10.3103/S0005105525700220","DOIUrl":"10.3103/S0005105525700220","url":null,"abstract":"<p>Some approaches to teaching multidimensional geometry in elective courses aimed at developing multidimensional geometric intuition in school and university students are considered. Special attention is paid to using groups of transformations to study the geometry of regular polyhedra.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"58 3 supplement","pages":"S150 - S162"},"PeriodicalIF":0.5,"publicationDate":"2025-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676498","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}
{"title":"Automated System for Numerical Similarity Evaluation of Android Applications","authors":"V. V. Petrov","doi":"10.3103/S0005105525700207","DOIUrl":"10.3103/S0005105525700207","url":null,"abstract":"<p>This paper is devoted to the design and development of a system for automating numerical similarity assessment of Android applications. The task of the evaluation of application similarity is reduced to the similarity evaluation of sets of control flow graphs constructed based on code from classes.dex files of applications. The similarity value was calculated based on the similarity matrix. The algorithms of graph editing and Levenshtein distance were used to compare control flow graphs. The application similarity criteria were formulated, and their representation forms were investigated. Types of Android application models and methods of their construction are presented. A prototype of the system for automating the numerical evaluation of Android-applications similarity is developed. Optimization of the software solution is performed with the help of parallel programming tools. Experiments are carried out, and a conclusion is drawn concerning the ability of the developed system to detect similarities between Android applications.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"58 3 supplement","pages":"S131 - S142"},"PeriodicalIF":0.5,"publicationDate":"2025-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676496","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}
{"title":"On the Serious and the Funny in Science (Based on Materials of Digital Libraries)","authors":"Y. E. Polak","doi":"10.3103/S0005105525700141","DOIUrl":"10.3103/S0005105525700141","url":null,"abstract":"<p>Digital libraries (DLs) and archives accumulate gigantic volumes of information. The goal of this work is, without trying to cover this immensity, to attempt, using a relatively small number of striking examples, to trace how issues of scientific creativity are reflected in DLs; to discuss and dispel stereotypical ideas about scientists as unsociable, pedantic formalists or eccentric, absent-minded persons; and to show how the peculiarities of scientists’ thought processes combined with high intelligence can cause misunderstanding in everyday life. At the same time, these qualities combined with originality of thinking, sometimes becoming a paradox, are manifested in non-standard approaches to problems, non-trivial solutions, and an ironic attitude towards the surrounding reality. As a result, along with serious results, unexpected associations and analogies, jokes, witticisms, and anecdotes are born. The paper provides examples of the creativity of scientists in the professional field as well as works in genres such as science fiction, utopia, humor, and art song. Materials from more than 20 DLs were used.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"58 2 supplement","pages":"S79 - S93"},"PeriodicalIF":0.5,"publicationDate":"2025-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676537","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}
{"title":"Ontology of the Universal Subspace of Common Digital Space of Scientific Knowledge","authors":"S. A. Vlasova, N. E. Kalenov, A. N. Sotnikov","doi":"10.3103/S0005105525700062","DOIUrl":"10.3103/S0005105525700062","url":null,"abstract":"<p>The work develops research conducted by the authors in the field of creating a Common Digital Space for Scientific Knowledge (CDSSK). Previous research has proposed a unified structure for representing the ontology of CDSSK elements (subspaces, classes and attributes of objects, and relationships between objects or attributes). In the modeling of ontology using the example of the universal and a number of thematic subspaces of the CDSSK, the need for some adjustments to the structure of the ontology regarding CDSSK directories was identified to ensure the possibility of nested described data attributes. In addition, the concept of “data attribute value dictionary type” was introduced into the ontology, and two types of dictionaries were defined: “static” and “dynamic.” This information makes it possible to simplify formal–logical control algorithms when generating CDSSK content. An indication of the dictionary type has been introduced to the structure of object attribute directories. The presented work describes the modified structure of the ontology using the example of 11 auxiliaries and 10 subject classes of the CDSSK universal subspace. Examples of directories of each class, built in accordance with the ontology structure model, a list of object attributes and examples of static dictionaries are given.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"58 1 supplement","pages":"S10 - S16"},"PeriodicalIF":0.5,"publicationDate":"2025-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676533","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}
O. P. Shesternikova, E. F. Fabrikantova, D. V. Romanov
{"title":"On Reflection Causality in Medicine in JSM Method of Automated Research Support (Evidence from a Study of Establishing a Link between Negative Schizophrenia and Genetic Parameters)","authors":"O. P. Shesternikova, E. F. Fabrikantova, D. V. Romanov","doi":"10.3103/S0005105524700407","DOIUrl":"10.3103/S0005105524700407","url":null,"abstract":"<p>In this paper, we consider some approaches to causality in epistemology and their connection with JSM method of automated research support (JSM method ARS). The JSM method ARS is able to detect various types of cause-and-effect dependencies in data using appropriate strategies. Some approaches to causality in medicine (uniqueness of a cause, multiple causes, and independent causes) and their reflection in JSM method ARS are presented. Using a research of establishing a link between negative schizophrenia and genetic parameters as a case study, it is shown the choice of an appropriate type of causality determined in JSM method ARS using strategies. In the research under consideration, two strategies of JSM method ARS were used: one with the method of simple similarity with a ban on counterexample and the one with the generalized method. The application of the first method demonstrated a low rate of explainability of the initial data array by the generated hypotheses, which does not satisfy the criterion of abductive acceptance of hypotheses. The application of the generalized method improved the explanatory rates, which may indicate a more successful representation of the relationship between genetic parameters and the disease studied in the research. This representation is associated with the ternary similarity relation underlying the generalized method: “cause—set of brakes (blockers) of the cause—effect.”</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"58 6","pages":"461 - 466"},"PeriodicalIF":0.5,"publicationDate":"2025-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143430862","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}
{"title":"Structural and Functional Modeling in Event-Driven Process Methodology (EPM) Notation As a Tool for Generation of Program Code Simulating Process Activities","authors":"L. A. Mylnikov, A. D. Saltykova","doi":"10.3103/S0005105524700389","DOIUrl":"10.3103/S0005105524700389","url":null,"abstract":"<p>This paper addresses the problem of the objective assessment of information processing effectiveness based on digital twins. A method was designed to establish correspondence between structural and functional models in event-driven process methodology notation and a symbolic description that can be transformed to a programming language based on a group of rules is described. Based on a given structural and functional model, examples of symbolic description and the R programming language are given. The results of the information processing research using this statistical analysis technique are presented.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"58 6","pages":"393 - 400"},"PeriodicalIF":0.5,"publicationDate":"2025-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143430864","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}