scholarly journals Sci-Hub provides access to nearly all scholarly literature

2017 ◽  
Author(s):  
Daniel S Himmelstein ◽  
Ariel R Romero ◽  
Stephen R McLaughlin ◽  
Bastian Greshake Tzovaras ◽  
Casey S Greene
Keyword(s):  
Computer Science ◽  
Full Text ◽  
Overwhelming Majority ◽  
Scholarly Literature ◽  
Internet Connection ◽  
First Time

The website Sci-Hub provides access to scholarly literature via full text PDF downloads. The site enables users to access articles that would otherwise be paywalled. Since its creation in 2011, Sci-Hub has grown rapidly in popularity. However, until now, the extent of Sci-Hub's coverage was unclear. As of March 2017, we find that Sci-Hub's database contains 68.9% of all 81.6 million scholarly articles, which rises to 85.2% for those published in closed access journals. Furthermore, Sci-Hub contains 77.0% of the 5.2 million articles published by inactive journals. Coverage varies by discipline, with 92.8% coverage of articles in chemistry journals compared to 76.3% for computer science. Coverage also varies by publisher, with the coverage of the largest publisher, Elsevier, at 97.3%. Our interactive browser at https://greenelab.github.io/scihub allows users to explore these findings in more detail. Finally, we estimate that over a six-month period in 2015–2016, Sci-Hub provided access for 99.3% of valid incoming requests. Hence, the scope of this resource suggests the subscription publishing model is becoming unsustainable. For the first time, the overwhelming majority of scholarly literature is available gratis to anyone with an Internet connection.

scholarly journals Sci-Hub provides access to nearly all scholarly literature

2017 ◽  
Author(s):  
Daniel S Himmelstein ◽  
Ariel R Romero ◽  
Stephen R McLaughlin ◽  
Bastian Greshake Tzovaras ◽  
Casey S Greene
Keyword(s):  
Open Access ◽  
Computer Science ◽  
Full Text ◽  
Scholarly Literature ◽  
Internet Connection ◽  
First Time

The website Sci-Hub provides access to scholarly literature via full text PDF downloads. The site enables users to access articles that would otherwise be paywalled. Since its creation in 2011, Sci-Hub has grown rapidly in popularity. However, until now, the extent of Sci-Hub’s coverage was unclear. As of March 2017, we find that Sci-Hub’s database contains 68.9% of all 81.6 million scholarly articles, which rises to 85.2% for those published in toll access journals. Coverage varies by discipline, with 92.8% coverage of articles in chemistry journals compared to 76.3% for computer science. Coverage also varies by publisher, with the coverage of the largest publisher, Elsevier, at 97.3%. Our interactive browser at https://greenelab.github.io/scihub allows users to explore these findings in more detail. We find Sci-Hub preferentially covers popular, paywalled content, containing 96.2% of citations to toll access journals since 2015. For recently requested articles by Unpaywall users, oaDOI provided access to 48.8% whereas Sci-Hub contained 81.5%. Together, oaDOI and Sci-Hub covered 94.1%, demonstrating that gaps in Sci-Hub’s coverage, especially for open access articles, can be filled using licit services. For the first time, nearly all scholarly literature is available gratis to anyone with an Internet connection. Sci-Hub’s scope suggests the subscription publishing model is becoming unsustainable.

scholarly journals Sci-Hub provides access to nearly all scholarly literature

eLife ◽  
2018 ◽  
Vol 7 ◽  
Author(s):  
Daniel S Himmelstein ◽  
Ariel Rodriguez Romero ◽  
Jacob G Levernier ◽  
Thomas Anthony Munro ◽  
Stephen Reid McLaughlin ◽  
...  
Keyword(s):  
United States ◽  
Research University ◽  
The United States ◽  
The Other ◽  
University Of Pennsylvania ◽  
Major Research ◽  
Scholarly Literature ◽  
Internet Connection ◽  
The University ◽  
First Time

The website Sci-Hub enables users to download PDF versions of scholarly articles, including many articles that are paywalled at their journal’s site. Sci-Hub has grown rapidly since its creation in 2011, but the extent of its coverage has been unclear. Here we report that, as of March 2017, Sci-Hub’s database contains 68.9% of the 81.6 million scholarly articles registered with Crossref and 85.1% of articles published in toll access journals. We find that coverage varies by discipline and publisher, and that Sci-Hub preferentially covers popular, paywalled content. For toll access articles, we find that Sci-Hub provides greater coverage than the University of Pennsylvania, a major research university in the United States. Green open access to toll access articles via licit services, on the other hand, remains quite limited. Our interactive browser at https://greenelab.github.io/scihub allows users to explore these findings in more detail. For the first time, nearly all scholarly literature is available gratis to anyone with an Internet connection, suggesting the toll access business model may become unsustainable.

scholarly journals Sci-Hub provides access to nearly all scholarly literature

2018 ◽  
Author(s):  
Daniel S Himmelstein ◽  
Ariel R Romero ◽  
Jacob G Levernier ◽  
Thomas A Munro ◽  
Stephen R McLaughlin ◽  
...  
Keyword(s):  
Open Access ◽  
Business Model ◽  
Research University ◽  
Major Research ◽  
Scholarly Literature ◽  
Internet Connection ◽  
First Time

The website Sci-Hub enables users to download PDF versions of scholarly articles, including many articles that are paywalled at their journal’s site. Sci-Hub has grown rapidly since its creation in 2011, but the extent of its coverage was unclear. Here we report that, as of March 2017, Sci-Hub’s database contains 68.9% of the 81.6 million scholarly articles registered with Crossref and 85.2% of articles published in toll access journals. We find that coverage varies by discipline and publisher and that Sci-Hub preferentially covers popular, paywalled content. For toll access articles, green open access via licit services is quite limited, while Sci-Hub provides greater coverage than a major research university. Our interactive browser at https://greenelab.github.io/scihub allows users to explore these findings in more detail. For the first time, nearly all scholarly literature is available gratis to anyone with an Internet connection, suggesting the toll access business model will become unsustainable.

scholarly journals Sci-Hub provides access to nearly all scholarly literature

2018 ◽  
Author(s):  
Daniel S Himmelstein ◽  
Ariel R Romero ◽  
Jacob G Levernier ◽  
Thomas A Munro ◽  
Stephen R McLaughlin ◽  
...  
Keyword(s):  
Open Access ◽  
Business Model ◽  
Research University ◽  
Major Research ◽  
Scholarly Literature ◽  
Internet Connection ◽  
First Time

The website Sci-Hub enables users to download PDF versions of scholarly articles, including many articles that are paywalled at their journal’s site. Sci-Hub has grown rapidly since its creation in 2011, but the extent of its coverage was unclear. Here we report that, as of March 2017, Sci-Hub’s database contains 68.9% of the 81.6 million scholarly articles registered with Crossref and 85.2% of articles published in toll access journals. We find that coverage varies by discipline and publisher and that Sci-Hub preferentially covers popular, paywalled content. For toll access articles, green open access via licit services is quite limited, while Sci-Hub provides greater coverage than a major research university. Our interactive browser at https://greenelab.github.io/scihub allows users to explore these findings in more detail. For the first time, nearly all scholarly literature is available gratis to anyone with an Internet connection, suggesting the toll access business model will become unsustainable.

Рукопись Д. С. Бембеева-Сальмина «Ойратские триады»

2020 ◽  
Vol 15 (3) ◽  
pp. 107-121
Author(s):  
Larisa Badmaevna Mandzhikova ◽  
Keyword(s):  
Material Culture ◽  
Everyday Life ◽  
Full Text ◽  
Scientific Center ◽  
Biographical Information ◽  
The World ◽  
Kinship Relations ◽  
Academy Of Sciences ◽  
First Time ◽  
Political Figure

Introduction.Dorje Soktunovich Bembeyev-Salmin is one of the famous representatives of the old Kalmyk intelligentsia, a linguist, orientalist, public and political figure. His scientific works and biographical information are preserved in the private archive of D. S. Bembeev-Salmin in the Scientific Archive of the Kalmyk Scientific Center of the Russian Academy of Sciences (F. 10). This archive contains 12 items of storage for 1959. Among them are translations of works by Russian writers to the Kalmyk language, manuscripts of the text «The Orthography of the Oirat-Mongolian writing», Kalmyk folk proverbs and sayings, triads, pentastichesrecorded by D. S. Bembeev-Salmin. Of particular interest are the triads ― «orchlngingurvnts»(‘that there are three in the world’), recorded by him in 1931, they are one of the varieties of Kalmyk riddles. The themes of the riddles of the triads are diverse: everyday life, house hold activities, material culture, nature, family and kinship relations, ethics. D. S. Bembeyev-Salmin translated some of the three verses himself. This determines the value of the materials collected by him and their introduction into scientific circulation. The full text of the manuscript materials is published for the first time in this article.

scholarly journals Engineering Augmented Suffix Sorting Algorithms

2018 ◽  
Author(s):  
Felipe A. Louza ◽  
Guilherme P. Telles ◽  
Simon Gog
Keyword(s):  
Computer Science ◽  
Full Text ◽  
Suffix Array ◽  
Optimal Time ◽  
Time And Space ◽  
Sorting Algorithms ◽  
Constant Size ◽  
Common Prefix ◽  
Efficient Processing ◽  
Burrows Wheeler Transform

Strings are prevalent in Computer Science and algorithms for their efficient processing are fundamental in various applications. The results introduced in this work contribute with theoretical improvements and practical advances in building full-text indexes. Our first contribution is an in-place algorithm that computes the Burrows-Wheeler transform and the longest common prefix (LCP) array. Our second contribution is the construction of the suffix array augmented with the LCP array in optimal time and space for strings from constant size alphabets. Our third contribution is a set of algorithms to construct full-text indexes for string collections in optimal theoretical bounds. This work is an extended abstract of the Ph.D. thesis of the first author.

scholarly journals V. Bryusov’s Letters to His Fiancée

Literary Fact ◽  
2021 ◽  
pp. 8-30
Author(s):  
Monika V. Orlova
Keyword(s):  
Young People ◽  
Full Text ◽  
Terminally Ill ◽  
The Past ◽  
The Future ◽  
State Of Mind ◽  
First Time ◽  
The Village ◽  
The Relationship

The publication includes V.Ya. Bryusov’s letters to his fiancée I.M. Runt (1876 –1965) from June 9 to September 9, 1897. 11 correspondences, including the final telegram sent from Kursk, were written and sent from Aachen (Germany), Moscow and several Ukrainian localities. The letter 10 is accompanied by the full text of I.M. Runt’s only surviving letter to Bryusov, sent from Moscow to the village of Bolshye Sorochintsy and received by the poet a few months later at home. The relationship between the young people before the wedding were complicated. While the poet was preparing for the wedding in Moscow, he summed up the past contacts with “mes amantes”, and his state of mind was painful. Shortly before meeting his future wife, Bryusov broke up with the former governess of his family E.I. Pavlovskaya, who was terminally ill. A few days before the wedding he decided to go to say goodbye to Pavlovskaya to her homeland, Ukraine. In his letters to the future wife the poet tried to smooth out the tension of the situation, perhaps anticipating that he would be bounded with I.M. Runt 30 Литературный факт. 2021. № 2 (20) by a long-term relationship, where life and literature are closely interconnected. The letters are published for the first time.

LOGIC OF COMPUTATIONAL COMPLEXITY

2018 ◽  
pp. 94-109
Author(s):  
I. Petik
Keyword(s):  
Computational Complexity ◽  
Modal Logic ◽  
Computer Science ◽  
Complexity Theory ◽  
Methodological Approach ◽  
Philosophy Of Mathematics ◽  
Algorithmic Complexity ◽  
Science Philosophy ◽  
Methodological Approaches ◽  
First Time

The paper centers on building the semantics of the modal metatheory for studying the classes of algorithmic complexity. Further the effectiveness of this calculus is studied on the example of researching the famous problem of computational complexity theory – the question of equality of the classes P and NP. The new theoretical and methodological approach to the problem is provided. The original semantics was developed that can be used for description of relations between classes of algorithmic complexity from the complexity theory. On the basis of this semantics the complete calculus of the logic of the computational complexity can be developed in future. It is the first time when modal logic is used for studying the relations between classes of algorithmic complexity. New theoretical and methodological approaches to the classical problems of the complexity theory are proposed. Paper matters for computer science, philosophy of mathematics, logic and theory of algorithms, cryptography.

scholarly journals Introducing the Open Access Digital Theological Library (OADTL)

2018 ◽  
Vol 11 (2) ◽  
pp. 1-3
Author(s):  
Thomas E. Phillips ◽  
Drew Baker ◽  
Ann Hidalgo
Keyword(s):  
Open Access ◽  
Digital Library ◽  
Full Text ◽  
Public Domain ◽  
Religious Studies ◽  
Institutional Repositories ◽  
For Profit ◽  
Not For Profit ◽  
Open Access Journals ◽  
First Time

This article introduces the Open Access Digital Theological Library (OADTL), a new, fully open access digital library for religious studies. The OADTL, curated by professional librarians and employing OCLC's integrated library system, seeks to apply the principles of professional librarianship to make all open access content in religious studies fully discoverable to a global audience. The initial collections contain over 100,000 ebooks and over 200,000 full text, peer-reviewed, articles. The project is funded by a not-for-profit corporation, the Digital Theological Library, a 501c3 charity. Collections include recently published OA content, dissertations, public domain documents, and books from institutional repositories--as well content for Open Access journals. Much of the content is cataloged as e-content for the first time in this library. There are no fees of any kind for use.

scholarly journals “…Undeniably FInest Choice of Frame” ( on the Question of PIcture Framing by I. E. Repin)

Secreta Artis ◽  
2021 ◽  
Vol 4 (3) ◽  
pp. 62-81
Author(s):  
Oksana Aleksandrovna Lysenko
Keyword(s):  
Art Exhibitions ◽  
Scholarly Literature ◽  
Decorative Art ◽  
Critical Commentary ◽  
First Time

Numerous paintings by I. E. Repin in the collections of the Russian Museum, Tretyakov Gallery, Ateneum are distinguished by interesting, richly decorated, at times unique frames. The vast majority of these decorative art pieces have not been studied. Not only the creator of the sketch and the framemaker are left undisclosed, but also those who stood behind the choice of the frame – the artist himself or, rather, the buyer, customer. The contemporary ideas regarding Repin’s frames have largely been influenced by a highly critical commentary of Y. D. Minchenkov, which he recorded in his memoirs dedicated to artists – members of the Association of Traveling Art Exhibitions. Yet, the frames of Repin, which we have successfully identified and attributed, make us doubt the objectivity of Minchenkov's words. The question of Repin's contribution to the art of picture framing has not yet been considered in the works of specialists. Nonetheless, the original decor of the frames for such paintings as “Sadko” give grounds to assume that they were created according to the artist's drawings. Remarkably, a number of the artworks considered in the article have been introduced into scholarly literature for the first time.

Sign in / Sign up

Export Citation Format

Share Document