3,011 research outputs found

    Stability of Localized Wave Fronts in Bistable Systems

    Get PDF
    Localized wave fronts are a fundamental feature of biological systems from cell biology to ecology. Here, we study a broad class of bistable models subject to self-activation, degradation, and spatially inhomogeneous activating agents. We determine the conditions under which wave-front localization is possible and analyze the stability thereof with respect to extrinsic perturbations and internal noise. It is found that stability is enhanced upon regulating a positional signal and, surprisingly, also for a low degree of binding cooperativity. We further show a contrasting impact of self-activation to the stability of these two sources of destabilization. DOI: 10.1103/PhysRevLett.110.03810

    Nature connection, experience and policy encourage and maintain adaptation to drought in urban agriculture

    Get PDF
    Climate change is challenging the sustained delivery of ecosystem services from urban agriculture. Extreme, prolonged drought in combination with high heat events affect urban crop production due to limited water availability and affect environmental management and adaptation to environmental conditions. In this study, we use urban community gardens in central coast California as a system to investigate how people are adapting their management behaviors over three time periods—before, during and after the longest drought in California's recent history. We specifically ask how behavioral change is impacted by water policies and gardener characteristics (including gardening experience, formal education, drought concern, and relationship to nature). Through structural equation modeling and multivariate analyses, we show that nature relatedness and gardening experience impact drought concern which in turn impact behavioral change, and potentially gardener's ability to sustainably manage water and to adapt to drought conditions. Planting motivations are also important, influencing people's adoption and retention of practices over time. Yet where concern may be absent, water policies are able to promote and maintain behavioral change and conservation-based practice adoption. Thus, environmental awareness and experience in combination with policies are needed to promote and support proactive behavioral change and adaptation to create resilient urban food production systems under climate change.DFG, 414044773, Open Access Publizieren 2019 - 2020 / Technische Universität Berli

    Population growth in discrete time: a renewal equation oriented survey

    Full text link
    Traditionally, population models distinguish individuals on the basis of their current state. Given a distribution, a discrete time model then specifies (precisely in deterministic models, probabilistically in stochastic models) the population distribution at the next time point. The renewal equation alternative concentrates on newborn individuals and the model specifies the production of offspring as a function of age. This has two advantages: (i) as a rule, there are far fewer birth states than individual states in general, so the dimension is often low; (ii) it relates seamlessly to the next-generation matrix and the basic reproduction number. Here we start from the renewal equation for the births and use results of Feller and Thieme to characterise the asymptotic large time behaviour. Next we explicitly elaborate the relationship between the two bookkeeping schemes. This allows us to transfer the characterisation of the large time behaviour to traditional structured-population models

    Unconventional feeds for small ruminants in dry areas have a minor effect on manure nitrogen flow in the soil-plant system

    Get PDF
    In dry areas, unconventional feeds are increasingly used for mitigating feed shortages and rangeland degradation. We evaluated how feeding sheep diets containing olive leaves, saltbush leaves and olive cake affects manure quality compared to a barley straw based diet. Soil incubation and plant growth experiments were carried out to measure soil nitrogen (N) mineralization and N uptake by barley plants and to calculate N flow through the feed-animal-soil-plant system. Fresh feces, composts consisting of feces, urine and straw, and ammonium sulfate fertilizer were mixed with soil at rate of 90mgNkg−1 soil dry matter. Comparisons were made with non-amended soils (control) and soils amended with fresh olive cake applied at 90 and 22.5mgNkg−1 soil dry matter, respectively. The latter treatment enabled investigation of the effect of passage of olive cake through the digestive tract of sheep on N availability and phenol transformation. Applying fresh olive cake and feces, except the saltbush leaf derived feces, resulted in a net N immobilization. All composts resulted in net N mineralization, although not significantly different from the 0N control soil. Barley growing in soils with amendment that caused N immobilization took up less N than barley growing on the 0N treatment. Reduction in N uptake was most pronounced after amendment with fresh-olive cake. Treatments with net mineralization increased barley N uptake over the 0N treatment with 2-16% of N applied being taken up. Dietary composition had a minor effect on N fertilizer value of either feces or compost, but feces N alone was not an efficient N sourc

    Partitioning Complex Networks via Size-constrained Clustering

    Full text link
    The most commonly used method to tackle the graph partitioning problem in practice is the multilevel approach. During a coarsening phase, a multilevel graph partitioning algorithm reduces the graph size by iteratively contracting nodes and edges until the graph is small enough to be partitioned by some other algorithm. A partition of the input graph is then constructed by successively transferring the solution to the next finer graph and applying a local search algorithm to improve the current solution. In this paper, we describe a novel approach to partition graphs effectively especially if the networks have a highly irregular structure. More precisely, our algorithm provides graph coarsening by iteratively contracting size-constrained clusterings that are computed using a label propagation algorithm. The same algorithm that provides the size-constrained clusterings can also be used during uncoarsening as a fast and simple local search algorithm. Depending on the algorithm's configuration, we are able to compute partitions of very high quality outperforming all competitors, or partitions that are comparable to the best competitor in terms of quality, hMetis, while being nearly an order of magnitude faster on average. The fastest configuration partitions the largest graph available to us with 3.3 billion edges using a single machine in about ten minutes while cutting less than half of the edges than the fastest competitor, kMetis
    corecore