TL;DR: The first volume of the journal was published in 2019 as discussed by the authors , with 120 articles and reviews in 1337 pages, published in advance and assigned to 2023, starting with this volume, article numbers instead of the traditional method of continuous pagination will be used.
Abstract: Dear Readers, Authors, Reviewers, and Editorial Board Members, Gratitude to all of you involved in the development of Letters in Applied NanoBioSciece. Volume 11 of 2022 was a great success, consisting of 120 articles and reviews in 1337 pages, published in advance. In January 2022, editorial staff started Volume 12, assigned to 2023. Starting with this volume, article numbers instead of the traditional method of continuous pagination will be used. This approach allows a faster production process. Even if the financial efforts for publications increased in the last few years, the platinum open-access policy is still supported by the journal staff. Letters in Applied NanoBioscience is pleased to invite contributors to submit their recent results and ideas for publication.
TL;DR: In this paper , Eve explores the history of digital pagination and argues that the progress was not a linear move from physicality to digital page space, but a gradual one, and that the road taken would fork many times.
Abstract: New Leaves:Riffling the History of Digital Pagination Martin Paul Eve (bio) Introduction: Against the Page Page space isn't a given, an a priori static entity. Johanna Drucker1 NLS files were described as early as 1962 as 'scrolls.' Thierry Bardini2 Physical metaphor and analogy saturate contemporary computing.3 We have a virtual "space" of web "sites," "windows," "menus," "icons," and "pointers." Our internet resources, though, are pages, our word processors open onto A4 sheets, and Portable Document Format (PDF) files mirror the rectangular form of the common printed page.4 There is an apparently clear reason for such prevalence of metaphors in digital-textual production and reception: to allow users to transpose what they know about the world at large to computer interfaces. However, it is too easy to assume that digital interfaces are transparent and obvious.5 Metaphors are supposed to help us to understand. Yet explaining why a computer window is called a "window" is actually very difficult. That it can "open" is about as far as you will get. There is almost certainly no food on a computer "menu." Nonetheless, such assumptions about familiarity lead to the well-known paradigm of supposedly intuitive interface designs, when really what is meant by intuitive (or, more correctly, intuitable) is learned behavioral patterns. Intuitive, as Jeff Raskin puts it, means familiar.6 This is why computer interfaces become "more intuitive" the more we use them; metaphor pertains to a familiar relationship strengthened through repetitious encounters.7 This trope of relation provides a way for new users to imagine how a digital interface might work with respect to its physical correlate, even when the parallels are poor. Such relationality has been as prevalent in the digital reading world as [End Page 479] in other digital user interfaces.8 Hence, through digital metaphor, we have virtual pages. Digital pages, we are told, serve as descendants of physical familiarity, habituating users to the electronic reading environment, bearing their real-world affordances of easeful, random, and sequential access. However, this story is more complicated than it appears. Existing histories have overlooked the fact that proposals for computational pages were neither well received nor prioritized in the early days of display unit development. The most striking example of this aversion is that Adobe attempted to cancel the development of PDF, which is perhaps now the most widely-used, paginated document format on the planet. Of course, since the early 1990s, the digital page has come to dominate the digital landscape. As such, commentators have frequently stated that the visual metaphor of the page is damaging and that we must overcome the physical page's metaphorical mastership, seeking to undo this presumed historical lineage. Digital formats, we are told, have a persistent yet frustrating (and even unnecessary) "need to acknowledge the historical priority of books and to invoke a link with their established cultural identity."9 At the same time, we assume that "electronic 'books' will 'supersede the limitations' and overcome the 'drawbacks' of their paper-based forebears," as Johanna Drucker has it.10 The "Beyond the PDF" conference and subsequent series of events demonstrate this frustration at how physical pagination is artificially sustained in the digital world.11 Yet, as I will show, this history and the ascendance of the digital page were far from certain. The progress was not a linear move from physicality to digital pagination that must now be unpicked and reversed. Instead, the road taken would fork many times. Certainly, for as long as pages have existed, even in the physical world of print, there has been a prevalent counter-discourse that has sought their demise. Pages, asserts Alberto Manguel, exert a "tyranny" of format over the text they contain, a tyranny that we must resist: "the shape of a page," he writes, "seems to cry out for counter-action."12 Perhaps showing disdain for the very "idea of the book" being "the presentation of material in relation to a fixed sequence which provides access to its contents (or ideas) through some stable arrangement,"13 Henry Burton, in 1636, wrote to his reader of the problem with pages, which forced a layout that distanced his plates from their...
TL;DR: A fully polynomial time approximation scheme (FPTAS) is presented to solve the pagination problem, where the authors have exactly two pages for which the capacity must be minimized and the conducted numerical experiments show its practical eectiveness.
Abstract: The pagination problem is described as follows. We have a set of symbols, a collection of subsets over these symbols (we call these subsets the tiles) and an integer capacity C. The objective is to find the minimal number of pages (a type of container) on which we can schedule all the tiles while following two fundamental rules. We cannot assign more than C symbols on each page and a tile cannot be broken into several pieces, all of its symbols must be assigned to at least one of the pages. The dierence from the Bin Packing Problem is that tiles can merge. If two tiles share a subset of symbols and if they are assigned to the same page, this subset will be assign only once to the page (and not several times). In this paper, as this problem is NP-complete, we are going to look at a particular case of the dual problem, where we have exactly two pages for which the capacity must be minimized. We are going to present a fully polynomial time approximation scheme (FPTAS) to solve it. This approximation scheme is based on the simplification of a dynamic programming algorithm and it has a strongly polynomial time complexity. The conducted numerical experiments show its practical eectiveness.
TL;DR: In this article , a more powerful, easily reusable widget base based on the class inheritance of Python and richly functional components of PyQt5 is presented, which can design forwards, backwards, records per page and other pagination functions in the widget, and then use the promote function of PYQT5 to apply in their own code with simple modification only.
Abstract: The Model-View framework of PyQt5 has no pagination function to display the data well, this paper separates the pagination work from the whole project, but also use the “signals and slot” to keep the parameters synchronization. So we can design forwards, backwards, records per page and other pagination functions in the widget, and then we can use “promote” function of PYQT5 to apply in our own code with simple modification only. we constructed a more powerful, easily reusable widget base on the class inheritance of Python and richly functional components of PyQt5.
TL;DR: In this article , the authors present the relevant aspects of server-side data pagination, together with the calculation of simple and matrix totals, from the perspective of the resources used (mainly the execution time), existing solutions but also variants.
Abstract: This paper presents the relevant aspects of server-side data pagination, together with the calculation of simple and matrix totals, from the perspective of the resources used (mainly the execution time), existing solutions but also variants, respectively new solutions proposed by the authors. Different scenarios were investigated: Oracle rownum pseudocolumn and ANSI SQL ROW_NUMBER analytical function in different query configurations, different ways of expressing the necessary joins and the place where the respective joins are used, different ways of calculating the total number of records, numerical fields totals (simple and matrix) and corroboration of this calculation with pagination. To our knowledge, the calculation of totals (especially matrix totals) simultaneously with the extraction of the data required for pagination represents a novel approach. The authors designed several experiments, and the processed results show that, on the pagination side, an improved version that uses the rownum pseudocolumn allows obtaining shorter execution times in most cases. The total number of lines as well as the simple totals are best obtained with distinct queries, combined with those from the pagination. For matrix calculation, the DENSE_RANK function used in a CTE (Common Table Expression) leads to the best results.
TL;DR: In this article , a peer-reviewed version of this article has been accepted for publication and undergone full peer review but has not been through the copyediting, typesetting, pagination and proofreading process, which may lead to differences between this version and the Version of Record.
Abstract: Pediatric PulmonologyAccepted Articles AUTHOR INDEX AUTHOR INDEX First published: 20 May 2022 https://doi.org/10.1002/ppul.25964 This article has been accepted for publication and undergone full peer review but has not been through the copyediting, typesetting, pagination and proofreading process, which may lead to differences between this version and the Version of Record. Please cite this article as doi: 10.1002/ppul.25964 AboutPDF ToolsExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onFacebookTwitterLinked InRedditWechat No abstract is available for this article. Accepted ArticlesAccepted, unedited articles published online and citable. The final edited and typeset version of record will appear in the future. RelatedInformation
TL;DR: In this paper , a new history of the development of digital pagination through a re-interrogation of three interrelated phenomena is presented, namely, that digital pages do not behave as do their physical correlates but instead mimic earlier historical forms of print that fused pagination, scrolling, and the tablet form.
Abstract: Virtual pagination works very differently from its print correlate. Despite this, encapsulated and paginated formats have gained a solid digital foothold. Nonetheless, many commentators have argued that we must overcome such a reliance on and continuity with print in the digital space. This article charts a new history of the development of digital pagination through a re-interrogation of three interrelated phenomena:
1.) That digital pages do not behave as do their physical correlates but instead mimic earlier historical forms of print that fused pagination, scrolling, and the tablet form.
2.) That the relatively late development of PDF, now the most widespread trans-media digital pagination format, was almost abandoned by Adobe’s board of directors, who could see no audience for it.
3.) That there are other more robust lineages of constraint for digital pages from cinema and television.
Drawing on new correspondence with the creators of the PDF format, the argument that emerges from these historical tracings is that nothing was sure about the development of textual pagination in the digital space and that the digital page almost never came to the prominence and dominance now presumed in discussions of digital reading.
TL;DR: In this paper , the authors discuss the problem of common approaches to pagination in RESTful web services, as well as the ways of overcoming it by using a method that fuses usual approaches while covering their weaknesses.
Abstract: In this paper on the basis of analyzed resources and accumulated IT-industry discuss the problem of the common approaches to pagination in RESTful web services, as well as the ways of overcoming it by using a method that fuses usual approaches while covering their weaknesses.