Pub Date : 2022-11-22DOI: 10.1057/s41293-022-00222-x
Neil Carter, Mitya Pearson
This article outlines the Conservative Party's approach to climate change from 2015 to 2022; focusing on its governing policy record and the wider political considerations that shaped it. During this time, the Conservatives' mixed performance reflected competing political incentives for its leaders and internal party division on the issue. A detailed exploration of Conservative climate policies allows for two broader contributions. European centre-right parties often face common strategic challenges, such as competition from the radical right, but the UK Conservative Party case study shows that responding to these challenges does not necessarily demand the abandonment of climate commitments. We also find evidence that in this period climate change embodied characteristics of both a positional and a valence issues.
{"title":"From green crap to net zero: Conservative climate policy 2015-2022.","authors":"Neil Carter, Mitya Pearson","doi":"10.1057/s41293-022-00222-x","DOIUrl":"10.1057/s41293-022-00222-x","url":null,"abstract":"<p><p>This article outlines the Conservative Party's approach to climate change from 2015 to 2022; focusing on its governing policy record and the wider political considerations that shaped it. During this time, the Conservatives' mixed performance reflected competing political incentives for its leaders and internal party division on the issue. A detailed exploration of Conservative climate policies allows for two broader contributions. European centre-right parties often face common strategic challenges, such as competition from the radical right, but the UK Conservative Party case study shows that responding to these challenges does not necessarily demand the abandonment of climate commitments. We also find evidence that in this period climate change embodied characteristics of both a positional and a valence issues.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"57 1","pages":"1-21"},"PeriodicalIF":1.1,"publicationDate":"2022-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9684876/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"58583857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-10-04DOI: 10.3103/S0005105522040033
R. S. Gilyarevskii, A. N. Libkind, I. A. Libkind
Abstract—
The article presents the results of the first statistical analysis of an array of references (about 30 million) from Russian research articles, reviews, conference proceedings, and monograph chapters published in 1980–2020. The references are processed (restructured and identified) to make them machine-readable and to match them to cited publications. It is found that the content of the bibliographic description fields is not uniform. Methods for eliminating this ambiguity are proposed. Changes in the length of reference lists over time, the completeness of data in fields containing bibliographic descriptions of references, the dependence of successful identification of references on the database and the time of publication of the citing publication, and cross-identification of source publications and references are discussed.
{"title":"A Study of References in Russian Citing Publications (Sources) on Data from the Web of Science Core Collection","authors":"R. S. Gilyarevskii, A. N. Libkind, I. A. Libkind","doi":"10.3103/S0005105522040033","DOIUrl":"10.3103/S0005105522040033","url":null,"abstract":"<div><div><h3>\u0000 <b>Abstract</b>—</h3><p>The article presents the results of the first statistical analysis of an array of references (about 30 million) from Russian research articles, reviews, conference proceedings, and monograph chapters published in 1980–2020. The references are processed (restructured and identified) to make them machine-readable and to match them to cited publications. It is found that the content of the bibliographic description fields is not uniform. Methods for eliminating this ambiguity are proposed. Changes in the length of reference lists over time, the completeness of data in fields containing bibliographic descriptions of references, the dependence of successful identification of references on the database and the time of publication of the citing publication, and cross-identification of source publications and references are discussed.</p></div></div>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"56 4","pages":"187 - 196"},"PeriodicalIF":0.5,"publicationDate":"2022-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48361022","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 : 2022-10-04DOI: 10.3103/S0005105522040021
V. N. Betin, V. A. Ivashchenko, A. P. Suprun
Methods of increasing the efficiency of systems working with knowledge bases and built in the formalism of functional neural networks are described. The occurrence of regular structures in the FN network in the context of substitutions from the knowledge base during the correction of the FN network in the search for a solution is considered. An economical way of presenting them is proposed, taking into account possible heterogeneity outside the context of substitution, as well as methods for reducing the volume of expansions of the FN network when searching for a solution using information about the identified regular structures. An algorithm is proposed that identifies permutations and allows, without costly manipulations with the knowledge base, to identify useful substitutions, operating with information about the positions of elements in a regular structure.
{"title":"Eliciting and the Use of Information Concerning Regular Structures in the Formalism of Functional Neural Networks in Decision-Support Systems","authors":"V. N. Betin, V. A. Ivashchenko, A. P. Suprun","doi":"10.3103/S0005105522040021","DOIUrl":"10.3103/S0005105522040021","url":null,"abstract":"<div><p>Methods of increasing the efficiency of systems working with knowledge bases and built in the formalism of functional neural networks are described. The occurrence of regular structures in the FN network in the context of substitutions from the knowledge base during the correction of the FN network in the search for a solution is considered. An economical way of presenting them is proposed, taking into account possible heterogeneity outside the context of substitution, as well as methods for reducing the volume of expansions of the FN network when searching for a solution using information about the identified regular structures. An algorithm is proposed that identifies permutations and allows, without costly manipulations with the knowledge base, to identify useful substitutions, operating with information about the positions of elements in a regular structure.</p></div>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"56 4","pages":"179 - 186"},"PeriodicalIF":0.5,"publicationDate":"2022-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44186135","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 : 2022-10-04DOI: 10.3103/S0005105522040057
A. A. Lebedev, A. S. Gavrilkina, N. V. Maksimov, O. L. Golitsina, K. V. Monankov
In human-machine document retrieval frameworks focused on information support for main activity cognitive processes, onto-graph-based mechanisms for deep semantic search are discussed. The mechanisms of the application of examples corresponding to users’ cognitive states are given on graphs constructed from full texts. The paper gives a comparative evaluation of graph search mechanisms effectiveness in retrieval tasks, as applied to text reading processes.
{"title":"Onto-Graphic Mechanisms for Deep Semantic Search","authors":"A. A. Lebedev, A. S. Gavrilkina, N. V. Maksimov, O. L. Golitsina, K. V. Monankov","doi":"10.3103/S0005105522040057","DOIUrl":"10.3103/S0005105522040057","url":null,"abstract":"<p>In human-machine document retrieval frameworks focused on information support for main activity cognitive processes, onto-graph-based mechanisms for deep semantic search are discussed. The mechanisms of the application of examples corresponding to users’ cognitive states are given on graphs constructed from full texts. The paper gives a comparative evaluation of graph search mechanisms effectiveness in retrieval tasks, as applied to text reading processes.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"56 4","pages":"163 - 178"},"PeriodicalIF":0.5,"publicationDate":"2022-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43642960","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 : 2022-10-04DOI: 10.3103/S0005105522040070
P. Yu. Blinov, D. V. Kosyakov, A. V. Malysheva, A. E. Guskov
Abstract
As has been noted on numerous occasions, between 2012 and 2021, the pace of publications by Russian researchers rapidly increased; however, this growth was uneven in both quantitative and qualitative terms. Moreover, some research organizations had zero or even negative publication activity growth. To achieve a full understanding of the real development processes of the research sector requires analysis of the dynamics of dozens of indicators for hundreds of organizations. However, the question remains: how can these numerous data series be studied? To address this problem, this article proposes a method of classifying trends in time series based on a combination of three statistical tests of randomness against trend: the Cox-Stuart test, the inversion test of randomness, and the Mann–Kendall test. The method is used to classify a series of scientometric parameters that characterize various aspects of the publication activity of 701 leading Russian research organizations and universities, including a comprehensive publication score (an analogue of the official Composite Score for Publication Performance (CSPP)), the average quality level of publications, and the share of articles in conference proceedings. The differences trends of organizations of different types and performance categories are identified. This information is used to formulate new questions for further research into the causes of the observed trends in the development of Russian science.
{"title":"Trends in the Publication Activity of Russian Organizations from 2000 to 2019","authors":"P. Yu. Blinov, D. V. Kosyakov, A. V. Malysheva, A. E. Guskov","doi":"10.3103/S0005105522040070","DOIUrl":"10.3103/S0005105522040070","url":null,"abstract":"<div><div><h3>\u0000 <b>Abstract</b>\u0000 </h3><p>As has been noted on numerous occasions, between 2012 and 2021, the pace of publications by Russian researchers rapidly increased; however, this growth was uneven in both quantitative and qualitative terms. Moreover, some research organizations had zero or even negative publication activity growth. To achieve a full understanding of the real development processes of the research sector requires analysis of the dynamics of dozens of indicators for hundreds of organizations. However, the question remains: how can these numerous data series be studied? To address this problem, this article proposes a method of classifying trends in time series based on a combination of three statistical tests of randomness against trend: the Cox-Stuart test, the inversion test of randomness, and the Mann–Kendall test. The method is used to classify a series of scientometric parameters that characterize various aspects of the publication activity of 701 leading Russian research organizations and universities, including a comprehensive publication score (an analogue of the official Composite Score for Publication Performance (CSPP)), the average quality level of publications, and the share of articles in conference proceedings. The differences trends of organizations of different types and performance categories are identified. This information is used to formulate new questions for further research into the causes of the observed trends in the development of Russian science.</p></div></div>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"56 4","pages":"203 - 215"},"PeriodicalIF":0.5,"publicationDate":"2022-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42712198","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 : 2022-10-04DOI: 10.3103/S0005105522040082
P. A. Kalachikhin
The key features of goal-setting in the fields of economics and management of the development of science are considered. The levels of the vertical management of scientific activity are highlighted. The requirements for the scientific strategy are formulated. The importance of the role of forecasting in the goal-setting of science is shown. Based on the analysis of strategic documents, the weak points of the methods and indicators used in the goal-setting of domestic science are discussed. Liberal and directive schemes for the decomposition of goals in the transition from one level of the vertical management of science to another are proposed. Considerations are made to optimize the selection of indicators for the goal-setting of scientific research. The complementarity of targets and priorities in science management is argued.
{"title":"Methodology of Goal-Setting of Scientific Research","authors":"P. A. Kalachikhin","doi":"10.3103/S0005105522040082","DOIUrl":"10.3103/S0005105522040082","url":null,"abstract":"<p>The key features of goal-setting in the fields of economics and management of the development of science are considered. The levels of the vertical management of scientific activity are highlighted. The requirements for the scientific strategy are formulated. The importance of the role of forecasting in the goal-setting of science is shown. Based on the analysis of strategic documents, the weak points of the methods and indicators used in the goal-setting of domestic science are discussed. Liberal and directive schemes for the decomposition of goals in the transition from one level of the vertical management of science to another are proposed. Considerations are made to optimize the selection of indicators for the goal-setting of scientific research. The complementarity of targets and priorities in science management is argued.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"56 4","pages":"216 - 222"},"PeriodicalIF":0.5,"publicationDate":"2022-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41927764","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 : 2022-10-04DOI: 10.3103/S0005105522040045
V. N. Komaritsa
An assessment of the impact of open access (OA) on bibliometric indicators and the altmetrics of scientific publications is presented. The object of the study was the metadata of articles placed in the RSCI bibliographic database, selected according to the following conditions: (1) the article must correspond to the subject area “pipeline transport” (according to the SRNTI classification); (2) article metadata should contain 5–7 keywords among terms from the subject area; and (3) more than three years must pass from the date of publication of the article. The results of the study confirm to some extent that the use of open access increases the number of views of articles, expands the readership and contributes to the dissemination of knowledge. However, the long-term impact of OA does not show obvious improvements in terms of bibliometric growth. It has been established that the citation of articles published on the terms of OA and non-OA levels out after 3 years, and, over time, the type of publication will not significantly affect the bibliometric indicators.
{"title":"Benefits of Using Open Access: Citation Analysis","authors":"V. N. Komaritsa","doi":"10.3103/S0005105522040045","DOIUrl":"10.3103/S0005105522040045","url":null,"abstract":"<div><p>An assessment of the impact of open access (OA) on bibliometric indicators and the altmetrics of scientific publications is presented. The object of the study was the metadata of articles placed in the RSCI bibliographic database, selected according to the following conditions: (1) the article must correspond to the subject area “pipeline transport” (according to the SRNTI classification); (2) article metadata should contain 5–7 keywords among terms from the subject area; and (3) more than three years must pass from the date of publication of the article. The results of the study confirm to some extent that the use of open access increases the number of views of articles, expands the readership and contributes to the dissemination of knowledge. However, the long-term impact of OA does not show obvious improvements in terms of bibliometric growth. It has been established that the citation of articles published on the terms of OA and non-OA levels out after 3 years, and, over time, the type of publication will not significantly affect the bibliometric indicators.</p></div>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"56 4","pages":"197 - 202"},"PeriodicalIF":0.5,"publicationDate":"2022-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48022935","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 : 2022-08-15DOI: 10.3103/S0005105522030098
D. Vinogradov
The paper presents an estimation of overfitting probability for VKF-method of algebraic machine learning in the simplest case of Boolean algebra without counter-examples. The model uses the Vapnik—Chervonenkis proposal to minimize the empirical risk. Asymptotically the probability of overfitting errors for a fixed fraction of test examples tends to zero faster than exponentially decrease if the description length and the number of requested hypotheses go to infinity.
{"title":"Estimation of Overfitting Degree of Algebraic Machine Learning in Boolean Algebra","authors":"D. Vinogradov","doi":"10.3103/S0005105522030098","DOIUrl":"10.3103/S0005105522030098","url":null,"abstract":"<div><p>The paper presents an estimation of overfitting probability for VKF-method of algebraic machine learning in the simplest case of Boolean algebra without counter-examples. The model uses the Vapnik—Chervonenkis proposal to minimize the empirical risk. Asymptotically the probability of overfitting errors for a fixed fraction of test examples tends to zero faster than exponentially decrease if the description length and the number of requested hypotheses go to infinity.</p></div>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"56 3","pages":"160 - 162"},"PeriodicalIF":0.5,"publicationDate":"2022-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50482622","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 : 2022-08-15DOI: 10.3103/S0005105522030049
V. A. Yatsko
Abstract—
This article describes three identifying characteristics of stop words—statistical, semantic, and morphological—and postulates new principles for the creation of stop word lists based on these characteristics. The application of the principles is demonstrated by creating a Russian-language general stop word list based on the analysis of existing sources and frequency distributions in the Russian National Corpus. The resulting list contains 535 stop words.
{"title":"Creation of a Russian Stop Word List","authors":"V. A. Yatsko","doi":"10.3103/S0005105522030049","DOIUrl":"10.3103/S0005105522030049","url":null,"abstract":"<div><div><h3>\u0000 <b>Abstract</b>—</h3><p>This article describes three identifying characteristics of stop words—statistical, semantic, and morphological—and postulates new principles for the creation of stop word lists based on these characteristics. The application of the principles is demonstrated by creating a Russian-language general stop word list based on the analysis of existing sources and frequency distributions in the Russian National Corpus. The resulting list contains 535 stop words.</p></div></div>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"56 3","pages":"138 - 144"},"PeriodicalIF":0.5,"publicationDate":"2022-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50482621","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 : 2022-08-15DOI: 10.3103/S0005105522030062
L. V. Astakhova, N. V. Kalyazin
The article represents the current state of the use of non-fungible tokens as blockchain-enabled cryptographic assets that represent proof of ownership of digital objects. Their great potential is substantiated as a means of protecting various types of information, capable of ensuring its confidentiality, integrity and availability. The problems of ensuring the security of non-fungible tokens are highlighted and ways to solve them are proposed.
{"title":"Non-Fungible Tokens (NFT) as a Means and Object of Ensuring Information Security","authors":"L. V. Astakhova, N. V. Kalyazin","doi":"10.3103/S0005105522030062","DOIUrl":"10.3103/S0005105522030062","url":null,"abstract":"<div><p>The article represents the current state of the use of non-fungible tokens as blockchain-enabled cryptographic assets that represent proof of ownership of digital objects. Their great potential is substantiated as a means of protecting various types of information, capable of ensuring its confidentiality, integrity and availability. The problems of ensuring the security of non-fungible tokens are highlighted and ways to solve them are proposed.</p></div>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"56 3","pages":"116 - 121"},"PeriodicalIF":0.5,"publicationDate":"2022-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44678250","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}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号