258,248 research outputs found

    Permutation Pattern matching in (213, 231)-avoiding permutations

    No full text
    International audienceGiven permutations σ of size k and π of size n with k < n, the permutation pattern matching problem is to decide whether σ occurs in π as an order-isomorphic subsequence. We give a linear-time algorithm in case both π and σ avoid the two size-3 permutations 213 and 231. For the special case where only σ avoids 213 and 231, we present a O(max(kn², n² log log n)-time algorithm. We extend our research to bivincular patterns that avoid 213 and 231 and present a O(kn^4)-time algorithm. Finally we look at the related problem of the longest subsequence which avoids 213 and 231

    Guidelines for Measuring and Reporting Environmental Parameters for Experiments in Greenhouses

    No full text
    The importance of appropriate, accurate measurement and reporting of environmental parameters in plant sciences is a significant aspect of quality assurance for all researchers and their research. There is a clear need for ensuring research across the world can be compared, understood and where necessary replicated by fellow researchers. A common set of guidelines to educate, assist and encourage comparativeness is of great importance. On the other hand, the level of effort and attention to detail by an individual researcher should be commensurate with the particular research being conducted. For example, a researcher focusing on interactions of light and temperature should measure all relevant parameters and report a measurement summary that includes sufficient detail allowing for replication. Such detail may be less relevant when the impact of environmental parameters on plant growth and development is not the main research focus. However, it should be noted that the environmental experience of a plant during production can have significant impact when subsequent experiments investigate plants at a molecular, biochemical or genetic level or where species interactions are considered. Thus, researchers are encouraged to make a critical assessment of what parameters are of primary importance in their research and these parameters should be measured and reported.© 2015 Both et al. This article is distributed under terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons License, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0) applies to the data made available in this article, unless otherwise stated.Peer reviewe

    The vanishing author in computer-generated works: a critical analysis of recent Australian case law

    No full text
    Abstract The use of software is ubiquitous in the creation of many copyright works, yet the requirement in copyright law that every work have a human author who engages in independent intellectual effort means that its use may prevent copyright subsistence. Several recent Australian cases have refocused attention on authorship as an essential criterion of copyright subsistence, and these cases suggest that much computer-produced output may be authorless and thus lack copyright protection. This article, the first in a two-part series, analyses how each case deals with the question of authorship of computer-produced works and why the use of software diminishes copyright protection for a significant number of computer-generated works. The article critiques the application of conventional notions of human authorship developed in the pre-computer age to modern productions and suggests alternative approaches to authorship that satisfy both the major objectives of copyright policy and the need to adapt to the computer age. The article argues that, without a broader judicial approach to authorship of computer-generated works, Parliament must remedy the lacuna in protection for these ‘authorless’ works. Possible solutions for reform are suggested. In a forthcoming article, the author comprehensively examines those reform proposals

    Pattern Matching for Separable Permutations

    No full text
    International audienceGiven a permutation π (called the text) of size n and another permutation σ (called the pattern) of size k, the NP-complete permutation pattern matching problem asks whether σ occurs in π as an order-isomorphic subsequence. In this paper, we focus on separable permutations (those permutations that avoid both 2413 and 3142, or, equivalently, that admit a separating tree). The main contributions presented in this paper are as follows.We simplify the algorithm of Ibarra (Finding pattern matchings for permutations, Information Processing Letters 61 (1997), no. 6) to detect an occurrence of a separable permutation in a permutation and show how to reduce the space complexity from O(n3k) to O(n3logk) .In case both the text and the pattern are separable permutations, we give a more practicable O(n2k) time and O(nk) space algorithm. Furthermore, we show how to use this approach to decide in O(nk3ℓ2) time whether a separable permutation of size n is a disjoint union of two given permutations of size k and ℓ .Given a permutation of size n and a separable permutation of size k, we propose an O(n6k) time and O(n4log k) space algorithm to compute the largest common separable permutation that occurs in the two input permutations. This improves upon the existing O(n8) time algorithm by Rossin and Bouvel (The longest common pattern problem for two permutations, Pure Mathematics and Applications 17 (2006)).Finally, we give a O(n6k) time and space algorithm to detect an occurrence of a bivincular separable permutation in a permutation. (Bivincular patterns generalize classical permutations by requiring that positions and values involved in an occurrence may be forced to be adjacent)

    Recherche de motif dans les permutations

    No full text
    This thesis focuses on permutation pattern matching problem, which askswhether a pattern occurs in a text where both the pattern and text are permutations.In other words, we seek to determine whether there exist elements ofthe text such that they are sorted and appear in the same order as the elementsof the pattern. The problem is NP-complete. This thesis examines particularcases of the problem that are polynomial-time solvable.For this purpose, we study the problem by giving constraints on the permutationstext and/or pattern. In particular, the cases in which the text and/orpattern are permutations in which the patterns 2413 and 3142 do not occur(also known as separable permutations) and in which the text and/or patternare permutations in which the patterns 213 and 231 do not occur (also known aswedge permutations) are also considered. Some problems related to the patternmatching and the permutation pattern matching with bivincular pattern arealso studied.Cette thèse s'intéresse au problème de la recherche de motif dans les permutations, qui a pour objectif de savoir si un motif apparaît dans un texte, en prenant en compte que le motif et le texte sont des permutations. C'est-à-dire s'il existe des éléments du texte tel que ces éléments sont triés de la même manière et apparaissent dans le même ordre que les éléments du motif. Ce problème est NP complet. Cette thèse expose des cas particuliers de ce problème qui sont solvable en temps polynomial.Pour cela nous étudions le problème en donnant des contraintes sur le texte et/ou le motif. En particulier, le cas où le texte et/ou le motif sont des permutations qui ne contiennent pas les motifs 2413 et 3142 (appelé permutation séparable) et le cas où le texte et/ou le motif sont des permutations qui ne contiennent pas les motifs 213 et 231 sont considérés. Des problèmes dérivés de la recherche de motif et le problème de la recherche de motif bivinculaire sont aussi étudiés

    Recherche de motif dans les permutations

    No full text
    This thesis focuses on permutation pattern matching problem, which askswhether a pattern occurs in a text where both the pattern and text are permutations.In other words, we seek to determine whether there exist elements ofthe text such that they are sorted and appear in the same order as the elementsof the pattern. The problem is NP-complete. This thesis examines particularcases of the problem that are polynomial-time solvable.For this purpose, we study the problem by giving constraints on the permutationstext and/or pattern. In particular, the cases in which the text and/orpattern are permutations in which the patterns 2413 and 3142 do not occur(also known as separable permutations) and in which the text and/or patternare permutations in which the patterns 213 and 231 do not occur (also known aswedge permutations) are also considered. Some problems related to the patternmatching and the permutation pattern matching with bivincular pattern arealso studied.Cette thèse s'intéresse au problème de la recherche de motif dans les permutations, qui a pour objectif de savoir si un motif apparaît dans un texte, en prenant en compte que le motif et le texte sont des permutations. C'est-à-dire s'il existe des éléments du texte tel que ces éléments sont triés de la même manière et apparaissent dans le même ordre que les éléments du motif. Ce problème est NP complet. Cette thèse expose des cas particuliers de ce problème qui sont solvable en temps polynomial.Pour cela nous étudions le problème en donnant des contraintes sur le texte et/ou le motif. En particulier, le cas où le texte et/ou le motif sont des permutations qui ne contiennent pas les motifs 2413 et 3142 (appelé permutation séparable) et le cas où le texte et/ou le motif sont des permutations qui ne contiennent pas les motifs 213 et 231 sont considérés. Des problèmes dérivés de la recherche de motif et le problème de la recherche de motif bivinculaire sont aussi étudiés

    The fire resistance of composite steel-concrete slabs

    No full text
    Civil Engineering and Geoscience

    Author Under Sail The Imagination of Jack London, 1893-1902

    No full text
    In Author Under Sail, Jay Williams offers the first complete literary biography of Jack London as a professional writer engaged in the labor of writing. It examines the authorial imagination in London's work, the use of imagination in both his fiction and nonfiction, and the ways he defined imagination in the creative process in his business dealings with his publishers, editors, and agents. In this first volume of a two-volume biography, Williams traverses the years 1893 to 1902, from London's "Story of a Typhoon" to The People of the Abyss. The Jack London who emerges in the pages of Author Under Sail is a writer whose partnership with publishers, most notably his productive alliance with George Brett of Macmillan, was one of the most formative in American literary history. London pioneered many author models during the heyday of realism and naturalism, blurring the boundaries of these popular genres by focusing on absorption and theatricality and the representation of the seen and unseen. London created an impassioned, sincere, and extremely personal realism unlike that of other American writers of the time. Author Under Sail is a literary tour de force that reveals the full range of London as writer, creative citizen, and entrepreneur at the same time it sheds light on the maverick side of machine-age literature.Intro -- Title Page -- Copyright Page -- Dedication -- Contents -- Acknowledgments -- Introduction -- 1. Spirit Truth -- 2. From Absorption to Theatricality and Back Again -- 3. "I Will Build a New Present" -- 4. Sons as Authors -- 5. Fathers as Publishers -- 6. The Daughter as Author -- 7. Lovers as Authors -- 8. At Sea with the Family -- 9. Yellow News, Yellow Stories -- 10. The Return Home -- Notes -- Bibliography -- Index -- About Jay WilliamsIn Author Under Sail, Jay Williams offers the first complete literary biography of Jack London as a professional writer engaged in the labor of writing. It examines the authorial imagination in London's work, the use of imagination in both his fiction and nonfiction, and the ways he defined imagination in the creative process in his business dealings with his publishers, editors, and agents. In this first volume of a two-volume biography, Williams traverses the years 1893 to 1902, from London's "Story of a Typhoon" to The People of the Abyss. The Jack London who emerges in the pages of Author Under Sail is a writer whose partnership with publishers, most notably his productive alliance with George Brett of Macmillan, was one of the most formative in American literary history. London pioneered many author models during the heyday of realism and naturalism, blurring the boundaries of these popular genres by focusing on absorption and theatricality and the representation of the seen and unseen. London created an impassioned, sincere, and extremely personal realism unlike that of other American writers of the time. Author Under Sail is a literary tour de force that reveals the full range of London as writer, creative citizen, and entrepreneur at the same time it sheds light on the maverick side of machine-age literature.Description based on publisher supplied metadata and other sources.Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, YYYY. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries

    Danger in discharge summaries: abbreviations create confusion for both author and recipient

    No full text
    Background: The transition from hospital inpatient care to medical care in the community is a high-risk period for adverse events. Inadequate communication, including low-quality or unavailable discharge summaries, has been shown to impact patient care. Aims: To assess use of abbreviations in clinical handover documents from inpatient hospital teams to general practitioners (GP), and the interpretation of these abbreviations by GP and hospital-based junior doctors. Methods: This is a retrospective audit of 802 discharge summaries completed during a 1-week period in 2017 by a Queensland regional health service. GP and local junior doctors then attempted interpretation of 20 relevant abbreviations. Results: A total of 99% (794) discharge summaries included abbreviations. A total of 1612 different abbreviations was used on 16 327 occasions. The median number of abbreviations per discharge summary was 17 (range 0–86). A total of 254 GP and 62 junior doctors responded to a survey, which found that no abbreviation was interpreted the same by all respondents. GP and junior doctors were unable to offer any interpretation in 17.9% and 15.2% of cases respectively. GP offered a greater range of interpretations than junior doctors, with a median of 9 and 3 different interpretations per abbreviation respectively. A total of 94% (239) of GP felt that the use of abbreviations in discharge summaries had the potential to impact patient care. A total of 152 (60%) GP felt that time spent clarifying abbreviations in discharge summaries could be excessive. Conclusions: Abbreviations are often used in discharge summaries, yet poorly understood. This has the potential to impact patient care in the transition period after hospitalisation.No Full Tex

    Fire-exposed continuous span composite steel-concrete slabs

    No full text
    From experimental evidence, it was concluded that existing rules for the calculation of the behaviour of fire-exposed composite beams and slabs often lead to conservative solutions. Furthermore, the range of common applications had grown beyond the limits of existing calculation rules. It was felt that existing rules lacked a fundamental basis, in order to optimally design and evaluate fire-exposed composite beams and slabs. Therefore, a research project was started in 1989, in which CTICM (F), TNO (NL) and ARBED (L), together with both Delft and Eindhoven Universities of Technology, shared numerical and experimental research activities with respect to the behaviour of fire-exposed composite beams and slabs. The project aimed at gaining more insight into the behaviour -failure mechanisms in particular- of fireexposed composite beams and slabs by means of the development of numerical models and their validation based upon a limited number of full-scale well-instrumented fire tests. The final goal of this research project was to establish simple calculation rules, which would allow for easy and fast assessment of the fire-behaviour of composite beams and slabs. The project was co-sponsored by the ECSC; the part on composite slabs was conducted in the Netherlands, the part on composite beams in France. In the paper, the results of the Dutch part of the research project are described. After a brief introduction, the experimental programme is outlined. A total of 21 full-scale fire tests was performed on unloaded as well as loaded test specimens. These experiments have successfully been modelled using a general purpose finite element programme, with some pilot extensions. With the numerical model, a parameter study was performed. The results of this study were translated into a proposal for new simple calculation rules.Civil Engineering and Geoscience
    corecore