Pub Date : 2023-09-01DOI: 10.3103/S0005105523030081
V. N. Shvedenko, O. V. Shchekochikhin, Y. A. Sinkevich, A. A. Volkov
The development of a new methodology for the search and use of scientific and technical information from a wide class of electronic resources to improve the design efficiency of new models, modifications, and implementations of technical products is proposed. Verification of the possibilities for achieving the tactical and technical characteristics of scientific and technical products is conducted through virtual experiments as recommended in the scientific and technical literature and the documentation of innovations. To implement effective search, it is proposed to create an information system for the continuous monitoring of scientific journals, patents, sites of manufacturers of components, materials, and so on. A schematic diagram of the information system for searching for scientific and technical information is presented. A fragment of an information and search system based on a microservice architecture is shown.
{"title":"Features of Automation of Information Search in the Design of Technical Objects Using Their Digital Twins","authors":"V. N. Shvedenko, O. V. Shchekochikhin, Y. A. Sinkevich, A. A. Volkov","doi":"10.3103/S0005105523030081","DOIUrl":"10.3103/S0005105523030081","url":null,"abstract":"<div><p>The development of a new methodology for the search and use of scientific and technical information from a wide class of electronic resources to improve the design efficiency of new models, modifications, and implementations of technical products is proposed. Verification of the possibilities for achieving the tactical and technical characteristics of scientific and technical products is conducted through virtual experiments as recommended in the scientific and technical literature and the documentation of innovations. To implement effective search, it is proposed to create an information system for the continuous monitoring of scientific journals, patents, sites of manufacturers of components, materials, and so on. A schematic diagram of the information system for searching for scientific and technical information is presented. A fragment of an information and search system based on a microservice architecture is shown.</p></div>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"57 3","pages":"145 - 155"},"PeriodicalIF":0.5,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49043684","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 : 2023-09-01DOI: 10.3103/S0005105523030068
E. A. Efimova
Features of the representation of a plausible reasoning in various implementations of the logical programming language Prolog are considered. A number of computer applications developed in Prolog are described, which contain examples of practical use of the JSM method of automatic research support.
{"title":"Implementation of a Plausible Reasoning in the Prolog Programming Language","authors":"E. A. Efimova","doi":"10.3103/S0005105523030068","DOIUrl":"10.3103/S0005105523030068","url":null,"abstract":"<div><p>Features of the representation of a plausible reasoning in various implementations of the logical programming language Prolog are considered. A number of computer applications developed in Prolog are described, which contain examples of practical use of the JSM method of automatic research support.</p></div>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"57 3","pages":"166 - 171"},"PeriodicalIF":0.5,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48962434","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 : 2023-06-13DOI: 10.3103/S0005105523020061
R. S. Gilyarevskii, A. N. Libkind, I. A. Libkind
This paper discusses the structure of the list of the thematic categories of the Web of Science in connection with the incorrectness of calculations of the number of profiling publications contained in them, as well as a possible way out of the situation using bibliographic references. It is established that the comparison of citations between large sections of science confirms the strengthening of the mutual influence of the natural and social sciences and the humanities in interdisciplinarity of research.
{"title":"Classification of Bibliographic References to Determine the Mutual Influence of Large Areas of Knowledge","authors":"R. S. Gilyarevskii, A. N. Libkind, I. A. Libkind","doi":"10.3103/S0005105523020061","DOIUrl":"10.3103/S0005105523020061","url":null,"abstract":"<p>This paper discusses the structure of the list of the thematic categories of the Web of Science in connection with the incorrectness of calculations of the number of profiling publications contained in them, as well as a possible way out of the situation using bibliographic references. It is established that the comparison of citations between large sections of science confirms the strengthening of the mutual influence of the natural and social sciences and the humanities in interdisciplinarity of research.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"57 2","pages":"111 - 126"},"PeriodicalIF":0.5,"publicationDate":"2023-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41252901","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 : 2023-06-13DOI: 10.3103/S0005105523020097
D. Vinogradov
Algebraic machine learning has emerged as a way to overcome the need to generate a (potentially exponential) lattice of all candidates (as, for example, in the case of Boolean algebra). In this paper, it is proven that for a random training sample generated by the Bernoulli sequence, the probability that a large sublattice will arise in the lattice of candidates isomorphic to Boolean algebra will tend to unity as the sample size increases.
{"title":"Existence of Large Sublattices Isomorphic to Boolean Algebra in a Candidate Lattice","authors":"D. Vinogradov","doi":"10.3103/S0005105523020097","DOIUrl":"10.3103/S0005105523020097","url":null,"abstract":"<p>Algebraic machine learning has emerged as a way to overcome the need to generate a (potentially exponential) lattice of all candidates (as, for example, in the case of Boolean algebra). In this paper, it is proven that for a random training sample generated by the Bernoulli sequence, the probability that a large sublattice will arise in the lattice of candidates isomorphic to Boolean algebra will tend to unity as the sample size increases.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"57 2","pages":"101 - 103"},"PeriodicalIF":0.5,"publicationDate":"2023-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41274609","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 : 2023-06-13DOI: 10.3103/S0005105523020085
O. P. Shesternikova, V. K. Finn, K. A. Lesko, L. V. Vinokurova
The article describes the application of algorithmic tools for finding empirical regularities using the JSM method of automated research support to an array of patients for studying type 3c (pancreatogenic) diabetes mellitus. A generalized method, representing the ternary predicate of causality (cause–set of brakes for the cause–effect), is used to find empirical regularities for the first time.
{"title":"Application of the JSM Method of Automated Research Support to Predict Diabetes Development in Patients with Chronic Pancreatitis","authors":"O. P. Shesternikova, V. K. Finn, K. A. Lesko, L. V. Vinokurova","doi":"10.3103/S0005105523020085","DOIUrl":"10.3103/S0005105523020085","url":null,"abstract":"<p>The article describes the application of algorithmic tools for finding empirical regularities using the JSM method of automated research support to an array of patients for studying type 3c (pancreatogenic) diabetes mellitus. A generalized method, representing the ternary predicate of causality (cause–set of brakes for the cause–effect), is used to find empirical regularities for the first time.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"57 2","pages":"91 - 100"},"PeriodicalIF":0.5,"publicationDate":"2023-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48228351","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}