A review of knowledge: inter-row hoeing & its associated agronomy in organic cereal & pulse crops

The aim of this project was to establish the “state of the art” for inter-row hoeing and its associated agronomic practices in organic cereal and pulse crops. To achieve this a detailed review of literature was undertaken. • To facilitate inter-row cultivation in cereal and pulse crops, some adjustment of row spacing may be required. For cereals, drilling crops in 25 cm rows can reduce yield compared with normal drilling practice, primarily due to greater intra-specific competition amongst the crop (i.e. competition between crop plants). • The yield penalty resulting from widely spaced crop rows can be minimised using a number of approaches, depending on the drill: 1. Reducing the seed rate in widely spaced crop rows can help to minimise excessive intra-specific competition. 2. Band sowing the crop in wide rows can also help to minimise intra-specific competition as the seed is distributed over a greater area. 3. Using a twin-row arrangement can completely overcome the yield penalty. • The recommended row spacing for peas (up to 20 cm) and beans (up to 35 cm) does not require any further adjustment for inter-row hoeing. • Recent developments in automated guidance of inter-row hoeing equipment mean that weeding operations can now be conducted a much higher speeds (10 km h-1). This has highlighted the limitations of some of the cultivators currently used (e.g. ‘A’ blades), as excessive soil throw can occur at this high speed. Rolling cultivators may prove to be the most suitable at high forward speeds. For manually guided hoes working at slower speeds (5 km h-1), ‘A’ and ‘L’ blades offer an effective low cost solution. • In terms of the timing of inter-row hoeing, it is suggested that weeding operations should be conducted at an early stage in the growing season, as the weeds that emerge with or shortly after the crop are the ones that pose the most significant threat for crop yield. Weeding on two occasions can provide better levels of weed control than weeding once, but weeding more frequently offered little additional benefit. Reductions of weed biomass of up to 99 % have been reported as a result of inter-row hoeing, although this has not always resulted in a positive crop yield response. This is probably due to crop damage resulting from inaccurate hoeing, a problem that can be overcome with automated guidance. • There is some evidence to suggest that mechanical weeding operations can mineralise soil bound nitrogen. • The impact of inter-row hoeing on ground nesting birds is uncertain. Early indications suggest that skylarks prefer to nest directly adjacent to or in the crop row rather than between rows. The information contained within this review should enable farmers to make best use of inter-row hoeing in their arable crops. There are a number of areas that require further research and development: • The interaction of seed rate and row spacing needs to be confirmed in organic systems. • Relatively little is known about the mechanisms of weed kill and the detailed interaction between the cultivator blade, the weed and the soil. This is particularly important with the new automated guidance equipment that allows weeding at high forward speeds. • The timing and frequency of inter-row hoeing has received very little attention. The optimum weed control timings are based on small-plot crop:weed competition studies and need to be verified under field scale management with inter-row hoeing equipment. • Finally, the impact of inter-row hoeing and widely spaced crop rows on ground-nesting birds has not been looked at directly, but is of importance. Please see the main report for a more detailed summary before the full text

Analysis of complete positivity conditions for quantum qutrit channels

We present an analysis of complete positivity (CP) constraints on qutrit quantum channels that have a form of affine transformations of generalized Bloch vector. For diagonal (damping) channels we derive conditions analogous to the ones that in qubit case produce tetrahedron structure in the channel parameter space.Comment: 12 pages, 8 figures (.eps), minor changes in the text and formula

On the fundamental group of the complement of a complex hyperplane arrangement

We construct two combinatorially equivalent line arrangements in the complex projective plane such that the fundamental groups of their complements are not isomorphic. The proof uses a new invariant of the fundamental group of the complement to a line arrangement of a given combinatorial type with respect to isomorphisms inducing the canonical isomorphism of the first homology groups.Comment: 12 pages, Latex2e with AMSLaTeX 1.2, no figures; this last version is almost the same as published in Functional Analysis and its Applications 45:2 (2011), 137-14

Homological Error Correction: Classical and Quantum Codes

We prove several theorems characterizing the existence of homological error correction codes both classically and quantumly. Not every classical code is homological, but we find a family of classical homological codes saturating the Hamming bound. In the quantum case, we show that for non-orientable surfaces it is impossible to construct homological codes based on qudits of dimension $D>2$, while for orientable surfaces with boundaries it is possible to construct them for arbitrary dimension $D$. We give a method to obtain planar homological codes based on the construction of quantum codes on compact surfaces without boundaries. We show how the original Shor's 9-qubit code can be visualized as a homological quantum code. We study the problem of constructing quantum codes with optimal encoding rate. In the particular case of toric codes we construct an optimal family and give an explicit proof of its optimality. For homological quantum codes on surfaces of arbitrary genus we also construct a family of codes asymptotically attaining the maximum possible encoding rate. We provide the tools of homology group theory for graphs embedded on surfaces in a self-contained manner.Comment: Revtex4 fil

Error Avoiding Quantum Codes and Dynamical Stabilization of Grover's Algorithm

An error avoiding quantum code is presented which is capable of stabilizing Grover's quantum search algorithm against a particular class of coherent errors. This error avoiding code consists of states only which are factorizable in the computational basis. Furthermore, its redundancy is smaller than the one which is achievable with a general error correcting quantum code saturating the quantum Hamming bound. The fact that this code consists of factorizable states only may offer advantages for the implementation of quantum gates in the error free subspace

What is the probability of connecting two points ?

The two-terminal reliability, known as the pair connectedness or connectivity function in percolation theory, may actually be expressed as a product of transfer matrices in which the probability of operation of each link and site is exactly taken into account. When link and site probabilities are $p$ and $\rho$, it obeys an asymptotic power-law behavior, for which the scaling factor is the transfer matrix's eigenvalue of largest modulus. The location of the complex zeros of the two-terminal reliability polynomial exhibits structural transitions as $0 \leq \rho \leq 1$.Comment: a few critical polynomials are at the end of the .tex source fil

Implementation and the Governance Problem: A Pressure Participant Perspective

This article has two aims: to qualify the UK government's ‘problem' of governance in a comparison with Scotland and Wales, and to use implementation studies (the ancestors of the new governance literature) to explore policy developments since devolution in Britain. It presents a puzzling finding from extensive interview research: that while we may expect UK government policy to suffer a bigger ‘implementation gap' based on distinctive governance problems (such as greater service delivery fragmentation and the unintended consequences of top-down policy styles), pressure participants in Scotland and Wales are more likely to report implementation failures. Using a ‘top-down' framework, it explores three main explanations for this finding: that the size of the implementation gap in England is exaggerated by a focus on particular governance problems; that pressure participant dissatisfaction follows unrealistic expectations in the devolved territories; and that the UK government undermines devolved policy implementation, by retaining control of key policy instruments and setting the agenda on measures of implementation success

On the Reliability of Cross Correlation Function Lag Determinations in Active Galactic Nuclei

Many AGN exhibit a highly variable luminosity. Some AGN also show a pronounced time delay between variations seen in their optical continuum and in their emission lines. In effect, the emission lines are light echoes of the continuum. This light travel-time delay provides a characteristic radius of the region producing the emission lines. The cross correlation function (CCF) is the standard tool used to measure the time lag between the continuum and line variations. For the few well-sampled AGN, the lag ranges from 1-100 days, depending upon which line is used and the luminosity of the AGN. In the best sampled AGN, NGC 5548, the H_beta lag shows year-to-year changes, ranging from about 8.7 days to about 22.9 days over a span of 8 years. In this paper it is demonstrated that, in the context of AGN variability studies, the lag estimate using the CCF is biased too low and subject to a large variance. Thus the year-to-year changes of the measured lag in NGC 5548 do not necessarily imply changes in the AGN structure. The bias and large variance are consequences of finite duration sampling and the dominance of long timescale trends in the light curves, not due to noise or irregular sampling. Lag estimates can be substantially improved by removing low frequency power from the light curves prior to computing the CCF.Comment: To appear in the PASP, vol 111, 1999 Nov; 37 pages; 10 figure

New path description for the M(k+1,2k+3) models and the dual Z_k graded parafermions

We present a new path description for the states of the non-unitary M(k+1,2k+3) models. This description differs from the one induced by the Forrester-Baxter solution, in terms of configuration sums, of their restricted-solid-on-solid model. The proposed path representation is actually very similar to the one underlying the unitary minimal models M(k+1,k+2), with an analogous Fermi-gas interpretation. This interpretation leads to fermionic expressions for the finitized M(k+1,2k+3) characters, whose infinite-length limit represent new fermionic characters for the irreducible modules. The M(k+1,2k+3) models are also shown to be related to the Z_k graded parafermions via a (q to 1/q) duality transformation.Comment: 43 pages (minor typo corrected and minor rewording in the introduction