Comparing conventional and improved organic vegetable rotations, yields and nitrogen husbandry

During 2005 to 2009 three approaches to organic vegetable rotations were compared to a conventional rotation in an interdisciplinary project. The organic rotations differed in their reliance on animal manure vs. cover crops and intercrops, but the rotation of main vegetable and cereal crops were identical in the four rotations. One organic rotation (O1) relied on import of manure for supply of nutrients, in another (O2) cover crops were used to replace most of the manure import, and in (O3) also intercrops were grown to improve natural pest regulation. The yearly import of nitrogen were on average 149, 94, 28, and 28 kg N.ha-1 in C, O1, O2, and O3 respectively. On average the yield in the O1 system was 83% of the yield in the conventional system. In the O2 rotation the yield was the same, though the nutrient import was much lower, whereas the intercrops in O3 reduced the yield to 70% of the conventional fotation. The effect on single crops varied with organic yields ranging from 60% (onion) to almost 100% (carrots, oats) of conventional yields. Crop root growth varied strongly among crops with rooting depths of less than 0.4 m (onions) to more than 2 m (cabbage, rye, fodder radish catch crop). Root growth was unaffected by cropping system, but the inclusion of deep rooted catch crops and green manures in O2 and O3 increased the total root exploitation of the soil strongly. Thus, while the O1 and O2 systems had almost identical yields and N uptake there were large differences in their effects on soil N; e.g. the subsoil (1-2.5 m) N content was on average 18 kg N.ha-1 in the O2 compared 61 and 53 kg N.ha-1 in the C and O1 respectively, indicating strongly reduced N leaching losses in O2

Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus, and Minor-Free Graphs

A (1 + eps)-approximate distance oracle for a graph is a data structure that supports approximate point-to-point shortest-path-distance queries. The most relevant measures for a distance-oracle construction are: space, query time, and preprocessing time. There are strong distance-oracle constructions known for planar graphs (Thorup, JACM'04) and, subsequently, minor-excluded graphs (Abraham and Gavoille, PODC'06). However, these require Omega(eps^{-1} n lg n) space for n-node graphs. We argue that a very low space requirement is essential. Since modern computer architectures involve hierarchical memory (caches, primary memory, secondary memory), a high memory requirement in effect may greatly increase the actual running time. Moreover, we would like data structures that can be deployed on small mobile devices, such as handhelds, which have relatively small primary memory. In this paper, for planar graphs, bounded-genus graphs, and minor-excluded graphs we give distance-oracle constructions that require only O(n) space. The big O hides only a fixed constant, independent of \epsilon and independent of genus or size of an excluded minor. The preprocessing times for our distance oracle are also faster than those for the previously known constructions. For planar graphs, the preprocessing time is O(n lg^2 n). However, our constructions have slower query times. For planar graphs, the query time is O(eps^{-2} lg^2 n). For our linear-space results, we can in fact ensure, for any delta > 0, that the space required is only 1 + delta times the space required just to represent the graph itself

Effects of vertical distribution of soil inorganic nitrogen on root growth and subsequent nitrogen uptake by field vegetable crops

Information is needed about root growth and N uptake of crops under different soil conditions to increase nitrogen use efficiency in horticultural production. The purpose of this study was to investigate if differences in vertical distribution of soil nitrogen (Ninorg) affected root growth and N uptake of a variety of horticultural crops. Two field experiments were performed each over 2 years with shallow or deep placement of soil Ninorg obtained by management of cover crops. Vegetable crops of leek, potato, Chinese cabbage, beetroot, summer squash and white cabbage reached root depths of 0.5, 0.7, 1.3, 1.9, 1.9 and more than 2.4 m, respectively, at harvest, and showed rates of root depth penetration from 0.2 to 1.5 mm day)1 C)1. Shallow placement of soil Ninorg resulted in greater N uptake in the shallow-rooted leek and potato. Deep placement of soil Ninorg resulted in greater rates of root depth penetration in the deep-rooted Chinese cabbage, summer squash and white cabbage, which increased their depth by 0.2–0.4 m. The root frequency was decreased in shallow soil layers (white cabbage) and increased in deep soil layers (Chinese cabbage, summer squash and white cabbage). The influence of vertical distribution of soil Ninorg on root distribution and capacity for depletion of soil Ninorg was much less than the effect of inherent differences between species. Thus, knowledge about differences in root growth between species should be used when designing crop rotations with high N use efficiency

RAM-Efficient External Memory Sorting

In recent years a large number of problems have been considered in external memory models of computation, where the complexity measure is the number of blocks of data that are moved between slow external memory and fast internal memory (also called I/Os). In practice, however, internal memory time often dominates the total running time once I/O-efficiency has been obtained. In this paper we study algorithms for fundamental problems that are simultaneously I/O-efficient and internal memory efficient in the RAM model of computation.Comment: To appear in Proceedings of ISAAC 2013, getting the Best Paper Awar

Vegetable quality in a conventional and three organic cropping systems

Differences in nutrient availability and methods of pest management may affect crop growth and product quality. The question is if conventional and organic cropping systems, which differ clearly in strategies for nutrient and pest management, influence the harvest and sensory quality of the products? Lettuce and onion were grown in a conventional and three organic vegetable cropping systems with different levels of external inputs and use of cover- and inter-crops for nutrient re-cycling and natural pest management in the period of 2007-2009 (VegQure project). The crop rotation consisted of 8 fields of vegetables and cereals. Onion was grown after a year of oat and iceberg lettuce after winter rye. There were 3 replicates of each cropping system each year. Sensory analysis of samples of iceberg lettuce was performed as quantitative descriptive analysis by a trained sensory panel of 10 assessors. A sensory profile of 9 attributes was evaluated on a 15-cm non-structured continuous scale. Harvest and sensory quality were not affected by the clear differences in nutrient and pest management between the four cropping systems

Horizontal activites. QLIF subproject 7: Horizontal activities

QLIF subproject 7 represents four horizontal activities common to the project, namely: • Environmental and sustainability audits • Cost-benefit analyses and socio-economic impact assessments • Dissemination and technology transfer • Training of graduate and postgraduate researchers Activities in the horizontal research have shown that organic crop production systems generally are more energy-efficient and have lower greenhouse gas emissions than the conventional production. In terms of dissemination the QLIF website has been central and the QLIF newsletter has attracted more than 1000 subscribers. Coupling of the website with the open access database Organic Eprints provides a prospective source of project information that can be accessed also by future stakeholders in organic and low-input systems. Training events arranged annually for students have contributed to proliferation of skills and knowledge gained in QLIF. Also, these events have served to mediate the attitude needed for research in organic and low-input farming

Modelling diverse root density dynamics and deep nitrogen uptake — a simple approach

We present a 2-D model for simulation of root density and plant nitrogen (N) uptake for crops grown in agricultural systems, based on a modification of the root density equation originally proposed by Gerwitz and Page in J Appl Ecol 11:773–781, (1974). A root system form parameter was introduced to describe the distribution of root length vertically and horizontally in the soil profile. The form parameter can vary from 0 where root density is evenly distributed through the soil profile, to 8 where practically all roots are found near the surface. The root model has other components describing root features, such as specific root length and plant N uptake kinetics. The same approach is used to distribute root length horizontally, allowing simulation of root growth and plant N uptake in row crops. The rooting depth penetration rate and depth distribution of root density were found to be the most important parameters controlling crop N uptake from deeper soil layers. The validity of the root distribution model was tested with field data for white cabbage, red beet, and leek. The model was able to simulate very different root distributions, but it was not able to simulate increasing root density with depth as seen in the experimental results for white cabbage. The model was able to simulate N depletion in different soil layers in two field studies. One included vegetable crops with very different rooting depths and the other compared effects of spring wheat and winter wheat. In both experiments variation in spring soil N availability and depth distribution was varied by the use of cover crops. This shows the model sensitivity to the form parameter value and the ability of the model to reproduce N depletion in soil layers. This work shows that the relatively simple root model developed, driven by degree days and simulated crop growth, can be used to simulate crop soil N uptake and depletion appropriately in low N input crop production systems, with a requirement of few measured parameters

Local weather, food resources and breeding stage influence Thrush Nightingale movement

Insectivorous migrants breeding at northern latitudes often time the breeding period with the seasonal peak of food resources. Whether this general pattern transfers to movement behaviour during the breeding season requires detailed study from a local perspective. We investigated fine-scale environmental correlates of movements by six actively-breeding adult Thrush Nightingales (Luscinia luscinia) at a breeding site in Denmark, using radio tracking and multiple regression models. Overall, the chick-rearing period coincided with the peak of vegetation greenness at the site. Adults flew further from nesting areas during stable weather and as vegetation greenness decreased. Adults were more active at higher environmental temperatures and when fledglings were older but still dependent on adults. These changes in local movements likely reflect adjustments to chick developmental needs and to specific local environmental conditions, including resource availability

An ETH-Tight Exact Algorithm for Euclidean TSP

We study exact algorithms for {\sc Euclidean TSP} in $\mathbb{R}^d$. In the early 1990s algorithms with $n^{O(\sqrt{n})}$ running time were presented for the planar case, and some years later an algorithm with $n^{O(n^{1-1/d})}$ running time was presented for any $d\geq 2$. Despite significant interest in subexponential exact algorithms over the past decade, there has been no progress on {\sc Euclidean TSP}, except for a lower bound stating that the problem admits no $2^{O(n^{1-1/d-\epsilon})}$ algorithm unless ETH fails. Up to constant factors in the exponent, we settle the complexity of {\sc Euclidean TSP} by giving a $2^{O(n^{1-1/d})}$ algorithm and by showing that a $2^{o(n^{1-1/d})}$ algorithm does not exist unless ETH fails.Comment: To appear in FOCS 201

Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles

Plotkin, Rao, and Smith (SODA'97) showed that any graph with $m$ edges and $n$ vertices that excludes $K_h$ as a depth $O(\ell\log n)$-minor has a separator of size $O(n/\ell + \ell h^2\log n)$ and that such a separator can be found in $O(mn/\ell)$ time. A time bound of $O(m + n^{2+\epsilon}/\ell)$ for any constant $\epsilon > 0$ was later given (W., FOCS'11) which is an improvement for non-sparse graphs. We give three new algorithms. The first has the same separator size and running time O(\mbox{poly}(h)\ell m^{1+\epsilon}). This is a significant improvement for small $h$ and $\ell$. If $\ell = \Omega(n^{\epsilon'})$ for an arbitrarily small chosen constant $\epsilon' > 0$, we get a time bound of O(\mbox{poly}(h)\ell n^{1+\epsilon}). The second algorithm achieves the same separator size (with a slightly larger polynomial dependency on $h$) and running time O(\mbox{poly}(h)(\sqrt\ell n^{1+\epsilon} + n^{2+\epsilon}/\ell^{3/2})) when $\ell = \Omega(n^{\epsilon'})$. Our third algorithm has running time O(\mbox{poly}(h)\sqrt\ell n^{1+\epsilon}) when $\ell = \Omega(n^{\epsilon'})$. It finds a separator of size O(n/\ell) + \tilde O(\mbox{poly}(h)\ell\sqrt n) which is no worse than previous bounds when $h$ is fixed and $\ell = \tilde O(n^{1/4})$. A main tool in obtaining our results is a novel application of a decremental approximate distance oracle of Roditty and Zwick.Comment: 16 pages. Full version of the paper that appeared at ICALP'14. Minor fixes regarding the time bounds such that these bounds hold also for non-sparse graph