522 research outputs found
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
Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles
Plotkin, Rao, and Smith (SODA'97) showed that any graph with edges and
vertices that excludes as a depth -minor has a
separator of size and that such a separator can be
found in time. A time bound of for
any constant 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 and .
If for an arbitrarily small chosen constant
, 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 ) and running time O(\mbox{poly}(h)(\sqrt\ell
n^{1+\epsilon} + n^{2+\epsilon}/\ell^{3/2})) when . Our third algorithm has running time
O(\mbox{poly}(h)\sqrt\ell n^{1+\epsilon}) when . 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
is fixed and . 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
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
Catch Crops in Organic Farming Systems without Livestock Husbandry - Model Simulations
During the last years, an increasing number of stockless farms in Europe converted to organic farming practice without re-establishing a livestock. Due to the lack of animal manure as a nutrient input, the relocation and the external input of nutrients is limited in those organic cropping systems. The introduction of a one-year green manure fallow in a 4-year crop rotation, including clover-grass mixtures as a green manure crop is the classical strategy to solve at least some of the problems related to the missing livestock. The development of new crop rotations, including an extended use of catch crops and annual green manure (legumes) may be another possibility avoiding the economical loss during the fallow year.
Modelling of the C and N turnover in the soil-plant-atmosphere system using the soil-plant-atmosphere model DAISY is one of the tools used for the development of new organic crop rotations. In this paper, we will present simulations based on a field experiment with incorporation of different catch crops.
An important factor for the development of new crop rotations for stockless organic farming systems is the expected N mineralisation and immobilisation after incorporation of the plant materials. Therefore, special emphasise will be put on the simulation of N-mineralisation/-immobilisation and of soil microbial biomass N. Furthermore, particulate organic matter C and N as an indicator of remaining plant material under decomposition will be investigated
On Counting Triangles through Edge Sampling in Large Dynamic Graphs
Traditional frameworks for dynamic graphs have relied on processing only the
stream of edges added into or deleted from an evolving graph, but not any
additional related information such as the degrees or neighbor lists of nodes
incident to the edges. In this paper, we propose a new edge sampling framework
for big-graph analytics in dynamic graphs which enhances the traditional model
by enabling the use of additional related information. To demonstrate the
advantages of this framework, we present a new sampling algorithm, called Edge
Sample and Discard (ESD). It generates an unbiased estimate of the total number
of triangles, which can be continuously updated in response to both edge
additions and deletions. We provide a comparative analysis of the performance
of ESD against two current state-of-the-art algorithms in terms of accuracy and
complexity. The results of the experiments performed on real graphs show that,
with the help of the neighborhood information of the sampled edges, the
accuracy achieved by our algorithm is substantially better. We also
characterize the impact of properties of the graph on the performance of our
algorithm by testing on several Barabasi-Albert graphs.Comment: A short version of this article appeared in Proceedings of the 2017
IEEE/ACM International Conference on Advances in Social Networks Analysis and
Mining (ASONAM 2017
Evaluation of a method for determining binaural sensitivity to temporal fine structure (TFS-AF test) for older listeners with normal and impaired low-frequency hearing
The ability to process binaural temporal fine structure (TFS) information was assessed using the TFS-AF test (where AF stands for adaptive frequency) for 26 listeners aged 60 years or more with normal or elevated low-frequency audiometric thresholds. The test estimates the highest frequency at which a fixed interaural phase difference (IPD) of ϕ (varied here between 30° and 180°) can be discriminated from an IPD of 0°, with higher thresholds indicating better performance. A sensation level of 30 dB was used. All listeners were able to perform the task reliably, giving thresholds well above the lowest allowed frequency of 30 Hz. The duration of a run averaged 5 min. Repeated testing of the normal-hearing listeners showed no significant practice effects. Thresholds varied markedly across listeners, but their ranking was fairly consistent across values of ϕ. Thresholds decreased (worsened) with decreasing ϕ and were lower than for a group of young listeners tested in an earlier study. There were weak to moderate, negative correlations between TFS-AF thresholds and audiometric thresholds at low frequencies (125–1000 Hz) but not at high frequencies (4000–8000 Hz). In conclusion, the TFS-AF test yielded a graded measure of binaural TFS sensitivity for all listeners. This contrasts with the TFS-LF (low-frequency) test, which measures the smallest detectable shift in IPD for a fixed frequency. The absence of practice effects and a reasonably short administration time make the TFS-AF test a good candidate for the assessment of sensitivity to changes in binaural TFS for older listeners without or with hearing loss
Limitations to Frechet's Metric Embedding Method
Frechet's classical isometric embedding argument has evolved to become a
major tool in the study of metric spaces. An important example of a Frechet
embedding is Bourgain's embedding. The authors have recently shown that for
every e>0 any n-point metric space contains a subset of size at least n^(1-e)
which embeds into l_2 with distortion O(\log(2/e) /e). The embedding we used is
non-Frechet, and the purpose of this note is to show that this is not
coincidental. Specifically, for every e>0, we construct arbitrarily large
n-point metric spaces, such that the distortion of any Frechet embedding into
l_p on subsets of size at least n^{1/2 + e} is \Omega((\log n)^{1/p}).Comment: 10 pages, 1 figur
Search in Complex Networks : a New Method of Naming
We suggest a method for routing when the source does not posses full
information about the shortest path to the destination. The method is
particularly useful for scale-free networks, and exploits its unique
characteristics. By assigning new (short) names to nodes (aka labelling) we are
able to reduce significantly the memory requirement at the routers, yet we
succeed in routing with high probability through paths very close in distance
to the shortest ones.Comment: 5 pages, 4 figure
Juvenile Songbirds Compensate for Displacement to Oceanic Islands during Autumn Migration
To what degree juvenile migrant birds are able to correct for orientation errors
or wind drift is still largely unknown. We studied the orientation of passerines
on the Faroe Islands far off the normal migration routes of European migrants.
The ability to compensate for displacement was tested in naturally occurring
vagrants presumably displaced by wind and in birds experimentally displaced 1100
km from Denmark to the Faroes. The orientation was studied in orientation cages
as well as in the free-flying birds after release by tracking departures using
small radio transmitters. Both the naturally displaced and the experimentally
displaced birds oriented in more easterly directions on the Faroes than was
observed in Denmark prior to displacement. This pattern was even more pronounced
in departure directions, perhaps because of wind influence. The clear
directional compensation found even in experimentally displaced birds indicates
that first-year birds can also possess the ability to correct for displacement
in some circumstances, possibly involving either some primitive form of true
navigation, or ‘sign posts’, but the cues used for this are highly
speculative. We also found some indications of differences between species in
the reaction to displacement. Such differences might be involved in the
diversity of results reported in displacement studies so far
- …