Entwicklung und Darstellung von Strategieoptionen zur Behandlung von Saatgut im ökologischen Landbau

Zur Erzeugung gesunden Saatgutes steht im Öko-Landbau neben präventiven Maßnahmen eine Reihe verschiedener Saatgutbehandlungsverfahren zur Verfügung (physikalische Methoden, Pflanzenextrakte, Naturstoffe und Mikroorganismenpräparate), die jedoch für die zahlreichen, wichtigen Wirt/Pathogen-Kombinationen nicht hinreichend untersucht waren. Inhalt und Ziel dieses Verbundvorhabens war es, Erfolg versprechende, aber hinsichtlich Handhabbarkeit und Wirksamkeit bislang nicht ausreichend untersuchte Varianten zu überprüfen sowie Schwellenwerte zu ermitteln, die eine Saatgutbehandlung indizieren. Um eine schnelle Übertragbarkeit wirksamer Verfahren in die Praxis zu ermöglichen, wurden neben den physikalischen Verfahren überwiegend gelistete Pflanzenstärkungsmittel untersucht. Im ersten Untersuchungsschritt wurden Klimakammer- und Gewächshausversuche angelegt. Ansätze, die sich unter diesen Modellbedingungen für die Praxistestung als geeignet erwiesen, wurden in Feldversuchen (Projekt 03OE127/2) überprüft. Für wichtige Wirt/Pathogen-Kombinationen konnten unter Modellbedingungen Behandlungsvarianten mit guten Wirkungen ausgewählt werden, die keine bis geringe negative Auswirkungen auf die Keimfähigkeit hatten. Bei Sommergerste mit Netzflecken oder Streifenkrankheit sowie bei Haferflugbrand konnten nach Behandlung mit Heißwasser, LEBERMOOSER, Ethanol, Milsana flüssig, Serenade und/oder Cedomon gute bis sehr gute Wirkungen erreicht werden. An Winterweizen mit Fusarium spp., Stagonospora nodorum bzw. Schneeschimmel sowie Winterroggen mit Schneeschimmel wurde eine Wirkung vor allem durch FZB 53, Warm- oder Heißwasserbehandlung und LEBERMOOSER erreicht. Von den besonders schwer zu bekämpfenden Krankheiten wurden Anthraknose an Lupine und Ascochyta pisi an Erbse mit Feuchtheißluft reduziert, jedoch war die Wirkung nicht ausreichend

D-4F, an apoA-1 mimetic, decreases airway hyperresponsiveness, inflammation, and oxidative stress in a murine model of asthma

Asthma is characterized by oxidative stress and inflammation of the airways. Although proinflammatory lipids are involved in asthma, therapies targeting them remain lacking. Ac-DWFKAFYDKVAEKFKEAFNH2 (4F) is an apolipoprotein (apo)A-I mimetic that has been shown to preferentially bind oxidized lipids and improve HDL function. The objective of the present study was to determine the effects of 4F on oxidative stress, inflammation, and airway resistance in an established murine model of asthma. We show here that ovalbumin (OVA) -sensitization increased airway hyperresponsiveness, eosinophil recruitment, and collagen deposition in lungs of C57BL/6J mice by a mechanism that could be reduced by 4F. OVA sensitization induced marked increases in transforming growth factor (TGF)β-1, fibroblast specific protein (FSP)-1, anti-T15 autoantibody staining, and modest increases in 4-hydroxynonenal (4-HNE) Michael\u27s adducts in lungs of OVA-sensitized mice. 4F decreased TGFβ-1, FSP-1, anti-T15 autoantibody, and 4-HNE adducts in the lungs of the OVA-sensitized mice. Eosinophil peroxidase (EPO) activity in bronchial alveolar lavage fluid (BALF), peripheral eosinophil counts, total IgE, and proinflammatory HDL (p-HDL) were all increased in OVA-sensitized mice. 4F decreased BALF EPO activity, eosinophil counts, total IgE, and p-HDL in these mice. These data indicate that 4F reduces pulmonary inflammation and airway resistance in an experimental murine model of asthma by decreasing oxidative stress

A CDCL-style calculus for solving non-linear constraints

In this paper we propose a novel approach for checking satisfiability of non-linear constraints over the reals, called ksmt. The procedure is based on conflict resolution in CDCL style calculus, using a composition of symbolical and numerical methods. To deal with the non-linear components in case of conflicts we use numerically constructed restricted linearisations. This approach covers a large number of computable non-linear real functions such as polynomials, rational or trigonometrical functions and beyond. A prototypical implementation has been evaluated on several non-linear SMT-LIB examples and the results have been compared with state-of-the-art SMT solvers.Comment: 17 pages, 3 figures; accepted at FroCoS 2019; software available at <http://informatik.uni-trier.de/~brausse/ksmt/

Computing domains of attraction for planar dynamics

In this note we investigate the problem of computing the domain of attraction of a ow on R2 for a given attractor. We consider an operator that takes two inputs, the description of the ow and a cover of the attractors, and outputs the domain of attraction for the given attractor. We show that: (i) if we consider only (structurally) stable systems, the operator is (strictly semi-)computable; (ii) if we allow all systems de ned by C1-functions, the operator is not (semi-)computable. We also address the problem of computing limit cycles on these systems

Limited Alpine Climatic Warming and Modeled Phenology Advancement for Three Alpine Species in the Northeast United States

Premise of the study: Most alpine plants in the Northeast United States are perennial and flower early in the growing season, extending their limitedgrowing season. Concurrently, they risk the loss of reproductive efforts to late frosts. Quantifying long-term trends in northeastern alpine flower phenology and late-spring/early-summer frost risk is limited by a dearth of phenology and climate data, except for Mount Washington, New Hampshire (1916 m a.s.l.). Methods: Logistic phenology models for three northeastern US alpinespecies (Diapensia lapponica, Carex bigelowii and Vaccinium vitis-idaea) were developed from 4 yr (2008–2011) of phenology and air temperature measurements from 12 plots proximate to Mount Washington’s long-term summit meteorological station. Plot-level air temperature, the logistic phenology models, and Mount Washington’s climate data were used to hindcast model yearly (1935–2011) floral phenology and frost damage risk for the focal species. Key results: Day of year and air growing degree-days with threshold temperatures of −4°C (D. lapponica and C. bigelowii) and −2°C (V. vitis-idaea) best predicted flowering. Modeled historic flowering dates trended significantly earlier but the 77-yr change was small (1.2–2.1 d) and did not significantly increase early-flowering risk from late-spring/early-summer frost damage. Conclusions: Modeled trends in phenological advancement and sensitivity for three northeastern alpine species are less pronounced compared with lower elevations in the region, and this small shift in flower timing did not increase risk of frost damage. Potential reasons for limited earlier phenological advancement at higher elevations include a slower warming trend and increased cloud exposure with elevation and/or inadequate chilling requirements

Recent Advances in Σ-definability over Continuous Data Types

The purpose of this paper is to survey our recent research in computability and definability over continuous data types such as the real numbers, real-valued functions and functionals. We investigate the expressive power and algorithmic properties of the language of Sigma-formulas intended to represent computability over the real numbers. In order to adequately represent computability we extend the reals by the structure of hereditarily finite sets. In this setting it is crucial to consider the real numbers without equality since the equality test is undecidable over the reals. We prove Engeler's Lemma for Sigma-definability over the reals without the equality test which relates Sigma-definability with definability in the constructive infinitary language L_{omega_1 omega}. Thus, a relation over the real numbers is Sigma-definable if and only if it is definable by a disjunction of a recursively enumerable set of quantifier free formulas. This result reveals computational aspects of Sigma-definability and also gives topological characterisation of Sigma-definable relations over the reals without the equality test. We also illustrate how computability over the real numbers can be expressed in the language of Sigma-formulas

Solving analytic differential equations in polynomial time over unbounded domains

In this paper we consider the computational complexity of solving initial-value problems de ned with analytic ordinary diferential equations (ODEs) over unbounded domains of Rn and Cn, under the Computable Analysis setting. We show that the solution can be computed in polynomial time over its maximal interval of de nition, provided it satis es a very generous bound on its growth, and that the function admits an analytic extension to the complex plane

Medical theses as part of the scientific training in basic medical and dental education: experiences from Finland

<p>Abstract</p> <p>Background</p> <p>Teaching the principles of scientific research in a comprehensive way is important at medical and dental schools. In many countries medical and dental training is not complete until the candidate has presented a diploma thesis. The objective of this study was to evaluate the nature, quality, publication pattern and visibility of Finnish medical diploma theses.</p> <p>Methods</p> <p>A total of 256 diploma theses presented at the University of Oulu from 2001 to 2003 were analysed. Using a standardised questionnaire, we extracted several characteristics from each thesis. We used the name of the student to assess whether the thesis resulted in a scientific publication indexed in medical article databases. The number of citations received by each published thesis was also recorded.</p> <p>Results</p> <p>A high proportion of the theses (69.5%) were essentially statistical in character, often combined with an extensive literature review or the development of a laboratory method. Most of them were supervised by clinical departments (55.9%). Only 61 theses (23.8%) had been published in indexed scientific journals. Theses in the fields of biomedicine and diagnostics were published in more widely cited journals. The median number of citations received per year was 2.7 and the range from 0 to 14.7.</p> <p>Conclusion</p> <p>The theses were seldom written according to the principles of scientific communication and the proportion of actually published was small. The visibility of these theses and their dissemination to the scientific community should be improved.</p

Robust computations with dynamical systems

In this paper we discuss the computational power of Lipschitz dynamical systems which are robust to in nitesimal perturbations. Whereas the study in [1] was done only for not-so-natural systems from a classical mathematical point of view (discontinuous di erential equation systems, discontinuous piecewise a ne maps, or perturbed Turing machines), we prove that the results presented there can be generalized to Lipschitz and computable dynamical systems. In other words, we prove that the perturbed reachability problem (i.e. the reachability problem for systems which are subjected to in nitesimal perturbations) is co-recursively enumerable for this kind of systems. Using this result we show that if robustness to in nitesimal perturbations is also required, the reachability problem becomes decidable. This result can be interpreted in the following manner: undecidability of veri cation doesn't hold for Lipschitz, computable and robust systems. We also show that the perturbed reachability problem is co-r.e. complete even for C1-systems