Control of apple scab by curative applications of biocontrol agents

In organic apple growing protective applications with copper, sulphur or lime sulphur are used for apple scab control. Protective applications have to be repeated when new leaves unfold. The timing of protective sprays depends on the weather forecast. If forecasted infection conditions fail to appear, treatments were for nothing. With curative control agents available, the number of treatments could be reduced. In greenhouse trials we tested control agents for their protective and curative efficiency against apple scab after artificial inoculation of potted apple trees. Applications were done 2 hours before inoculation, 5 hours after inoculation on wet leaves, 5 hours after inoculation during simulated rainfall or 24 hours after inoculation on wet or dry leaves. The optimal time of application differed between the preparations tested. Vitisan and OmniProtect had their highest activity when sprayed curative 24 hours after inoculation. Combinations were found, which revealed a high efficiency against apple scab from 2h before to 24 hours after inoculation. In a field trial apple scab was effectively controlled by curative applications of OmniProtect

A principled approach to programming with nested types in Haskell

Initial algebra semantics is one of the cornerstones of the theory of modern functional programming languages. For each inductive data type, it provides a Church encoding for that type, a build combinator which constructs data of that type, a fold combinator which encapsulates structured recursion over data of that type, and a fold/build rule which optimises modular programs by eliminating from them data constructed using the buildcombinator, and immediately consumed using the foldcombinator, for that type. It has long been thought that initial algebra semantics is not expressive enough to provide a similar foundation for programming with nested types in Haskell. Specifically, the standard folds derived from initial algebra semantics have been considered too weak to capture commonly occurring patterns of recursion over data of nested types in Haskell, and no build combinators or fold/build rules have until now been defined for nested types. This paper shows that standard folds are, in fact, sufficiently expressive for programming with nested types in Haskell. It also defines buildcombinators and fold/build fusion rules for nested types. It thus shows how initial algebra semantics provides a principled, expressive, and elegant foundation for programming with nested types in Haskell

Utility of correlation techniques in gravity and magnetic interpretation

Two methods of quantitative combined analysis, internal correspondence and clustering, are presented. Model studies are used to illustrate implementation and interpretation procedures of these methods, particularly internal correspondence. Analysis of the results of applying these methods to data from the midcontinent and a transcontinental profile show they can be useful in identifying crustal provinces, providing information on horizontal and vertical variations of physical properties over province size zones, validating long wave-length anomalies, and isolating geomagnetic field removal problems. Thus, these techniques are useful in considering regional data acquired by satellites

Non-linear Pattern Matching with Backtracking for Non-free Data Types

Non-free data types are data types whose data have no canonical forms. For example, multisets are non-free data types because the multiset $\{a,b,b\}$ has two other equivalent but literally different forms $\{b,a,b\}$ and $\{b,b,a\}$. Pattern matching is known to provide a handy tool set to treat such data types. Although many studies on pattern matching and implementations for practical programming languages have been proposed so far, we observe that none of these studies satisfy all the criteria of practical pattern matching, which are as follows: i) efficiency of the backtracking algorithm for non-linear patterns, ii) extensibility of matching process, and iii) polymorphism in patterns. This paper aims to design a new pattern-matching-oriented programming language that satisfies all the above three criteria. The proposed language features clean Scheme-like syntax and efficient and extensible pattern matching semantics. This programming language is especially useful for the processing of complex non-free data types that not only include multisets and sets but also graphs and symbolic mathematical expressions. We discuss the importance of our criteria of practical pattern matching and how our language design naturally arises from the criteria. The proposed language has been already implemented and open-sourced as the Egison programming language

Mobile annotation of geo-locations in digital books

This demo paper introduces an editor for manual annotation of locations in digital books, using a crowd-sourcing approach. It is the first of its kind and allows book lovers and literary travel enthusiasts to annotate the locations in their digital books on-the-go. We show both a mobile and a desktop version, and briefly explain the linkage to the Digital Library that is holding the digital books

Inertial range scaling in numerical turbulence with hyperviscosity

Numerical turbulence with hyperviscosity is studied and compared with direct simulations using ordinary viscosity and data from wind tunnel experiments. It is shown that the inertial range scaling is similar in all three cases. Furthermore, the bottleneck effect is approximately equally broad (about one order of magnitude) in these cases and only its height is increased in the hyperviscous case--presumably as a consequence of the steeper decent of the spectrum in the hyperviscous subrange. The mean normalized dissipation rate is found to be in agreement with both wind tunnel experiments and direct simulations. The structure function exponents agree with the She-Leveque model. Decaying turbulence with hyperviscosity still gives the usual t^{-1.25} decay law for the kinetic energy, and also the bottleneck effect is still present and about equally strong.Comment: Final version (7 pages