N, P and K budgets for crop rotations on nine organic farms in the UK

On organic farms, where the importation of materials to build/maintain soil fertility is restricted, it is important that a balance between inputs and outputs of nutrients is achieved to ensure both short-term productivity and long-term sustainability. This paper considers different approaches to nutrient budgeting on organic farms and evaluates the sources of bias in the measurements and/or estimates of the nutrient inputs and outputs. The paper collates 88 nutrient budgets compiled at the farm scale in 9 temperate countries. All the nitrogen (N) budgets showed an N surplus (average 83.2 kg N ha-1 year-1). The efficiency of N use, defined as outputs/inputs, was highest (0.9) and lowest (0.2) in arable and beef systems respectively. The phosphorus (P) and potassium (K) budgets showed both surpluses and deficits (average 3.6 kg P ha-1 year-1, 14.2 kg K ha-1 year-1) with horticultural systems showing large surpluses resulting from purchased manure. The estimation of N fixation and quantities of nutrients in purchased manures may introduce significant errors in nutrient budgets. Overall, the data illustrate the diversity of management systems in place on organic farms, and suggest that used together with soil analysis, nutrient budgets are a useful tool for improving the long-term sustainability of organic systems

Double Charge Exchange And Configuration Mixing

The energy dependence of forward pion double charge exchange reactions on light nuclei is studied for both the Ground State transition and the Double-Isobaric-Analog-State transitions. A common characteristic of these double reactions is a resonance-like peak around 50 MeV pion lab energy. This peak arises naturally in a two-step process in the conventional pion-nucleon system with proper handling of nuclear structure and pion distortion. A comparison among the results of different nuclear structure models demonstrates the effects of configuration mixing. The angular distribution is used to fix the single particle wave function.Comment: Added 1 figure (now 8) corrected references and various other change

Characterization of the space shuttle reaction control system engine

A computer program was developed and written in FORTRAN 5 which predicts the transient and steady state performance and heat transfer characteristics of a pulsing GO2/GH2 rocket engine. This program predicts the dynamic flow and ignition characteristics which, when combined in a quasi-steady state manner with the combustion and mixing analysis program, will provide the thrust and specific impulse of the engine as a function of time. The program also predicts the transient and steady state heat transfer characteristics of the engine using various cooling concepts. The computer program, test case, and documentation are presented. The program is applicable to any system capable of utilizing the FORTRAN 4 or FORTRAN 5 language

Maximum Edge-Disjoint Paths in kk-sums of Graphs

We consider the approximability of the maximum edge-disjoint paths problem (MEDP) in undirected graphs, and in particular, the integrality gap of the natural multicommodity flow based relaxation for it. The integrality gap is known to be $\Omega(\sqrt{n})$ even for planar graphs due to a simple topological obstruction and a major focus, following earlier work, has been understanding the gap if some constant congestion is allowed. In this context, it is natural to ask for which classes of graphs does a constant-factor constant-congestion property hold. It is easy to deduce that for given constant bounds on the approximation and congestion, the class of "nice" graphs is nor-closed. Is the converse true? Does every proper minor-closed family of graphs exhibit a constant factor, constant congestion bound relative to the LP relaxation? We conjecture that the answer is yes. One stumbling block has been that such bounds were not known for bounded treewidth graphs (or even treewidth 3). In this paper we give a polytime algorithm which takes a fractional routing solution in a graph of bounded treewidth and is able to integrally route a constant fraction of the LP solution's value. Note that we do not incur any edge congestion. Previously this was not known even for series parallel graphs which have treewidth 2. The algorithm is based on a more general argument that applies to $k$-sums of graphs in some graph family, as long as the graph family has a constant factor, constant congestion bound. We then use this to show that such bounds hold for the class of $k$-sums of bounded genus graphs

On the pathwidth of almost semicomplete digraphs

We call a digraph {\em $h$-semicomplete} if each vertex of the digraph has at most $h$ non-neighbors, where a non-neighbor of a vertex $v$ is a vertex $u \neq v$ such that there is no edge between $u$ and $v$ in either direction. This notion generalizes that of semicomplete digraphs which are $0$-semicomplete and tournaments which are semicomplete and have no anti-parallel pairs of edges. Our results in this paper are as follows. (1) We give an algorithm which, given an $h$-semicomplete digraph $G$ on $n$ vertices and a positive integer $k$, in $(h + 2k + 1)^{2k} n^{O(1)}$ time either constructs a path-decomposition of $G$ of width at most $k$ or concludes correctly that the pathwidth of $G$ is larger than $k$. (2) We show that there is a function $f(k, h)$ such that every $h$-semicomplete digraph of pathwidth at least $f(k, h)$ has a semicomplete subgraph of pathwidth at least $k$. One consequence of these results is that the problem of deciding if a fixed digraph $H$ is topologically contained in a given $h$-semicomplete digraph $G$ admits a polynomial-time algorithm for fixed $h$.Comment: 33pages, a shorter version to appear in ESA 201

Feedback Control as a Framework for Understanding Tradeoffs in Biology

Control theory arose from a need to control synthetic systems. From regulating steam engines to tuning radios to devices capable of autonomous movement, it provided a formal mathematical basis for understanding the role of feedback in the stability (or change) of dynamical systems. It provides a framework for understanding any system with feedback regulation, including biological ones such as regulatory gene networks, cellular metabolic systems, sensorimotor dynamics of moving animals, and even ecological or evolutionary dynamics of organisms and populations. Here we focus on four case studies of the sensorimotor dynamics of animals, each of which involves the application of principles from control theory to probe stability and feedback in an organism's response to perturbations. We use examples from aquatic (electric fish station keeping and jamming avoidance), terrestrial (cockroach wall following) and aerial environments (flight control in moths) to highlight how one can use control theory to understand how feedback mechanisms interact with the physical dynamics of animals to determine their stability and response to sensory inputs and perturbations. Each case study is cast as a control problem with sensory input, neural processing, and motor dynamics, the output of which feeds back to the sensory inputs. Collectively, the interaction of these systems in a closed loop determines the behavior of the entire system.Comment: Submitted to Integr Comp Bio

The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes

We study the never-worse relation (NWR) for Markov decision processes with an infinite-horizon reachability objective. A state q is never worse than a state p if the maximal probability of reaching the target set of states from p is at most the same value from q, regard- less of the probabilities labelling the transitions. Extremal-probability states, end components, and essential states are all special cases of the equivalence relation induced by the NWR. Using the NWR, states in the same equivalence class can be collapsed. Then, actions leading to sub- optimal states can be removed. We show the natural decision problem associated to computing the NWR is coNP-complete. Finally, we ex- tend a previously known incomplete polynomial-time iterative algorithm to under-approximate the NWR

Charge Ordering in alpha-(BEDT-TTF)2I3 by synchrotron x-ray diffraction

The spatial charge arrangement of a typical quasi-two-dimensional organic conductor alpha-(BEDT-TTF)2I3 is revealed by single crystal structure analysis using synchrotron radiation. The results show that the horizontal stripe type structure, which was suggested by mean field theory, is established. We also find the charge disproportion above the metal-insulator transition temperature and a significant change in transfer integrals caused by the phase transition. Our result elucidates the insulating phase of this material as a 2k_F charge density localization.Comment: 8 pages, 5 figures, 1 tabl

Theory of Thermodynamic Magnetic Oscillations in Quasi-One-Dimensional Conductors

The second order correction to free energy due to the interaction between electrons is calculated for a quasi-one-dimensional conductor exposed to a magnetic field perpendicular to the chains. It is found that specific heat, magnetization and torque oscillate when the magnetic field is rotated in the plane perpendicular to the chains or when the magnitude of magnetic filed is changed. This new mechanism of thermodynamic magnetic oscillations in metals, which is not related to the presence of any closed electron orbits, is applied to explain behavior of the organic conductor (TMTSF)$_2$ClO$_4$.Comment: 11 pages + 5 figures (included