Yield gains of coffee plants from phosphorus fertilization may not be generalized for high density planting

Inconclusive responses of the adult coffee plant to phosphorus fertilization have been reported in the literature, especially when dealing with application of this nutrient in high density planting systems. Thus, this study was carried out for the purpose of assessing the response of adult coffee plants at high planting density in full production (in regard to yield and their biennial cycle/stability) to the addition of different sources and application rates of P in the Zona da Mata region of Minas Gerais, Brazil. The experiment with coffee plants of the Catucaí Amarelo 6/30 variety was carried out over four growing seasons. Treatments were arranged in a full factorial design [(4 × 3) + 1] consisting of four P sources (monoammonium phosphate, simple superphosphate, natural reactive rock phosphate from Algeria (Djebel-Onk), and FH 550®), three P rates (100, 200, and 400 kg ha-1 year-1 of P2O5), and an additional treatment without application of the nutrient (0 kg ha-¹ year-¹). A randomized block experimental design was used with three replicates. The four seasons were evaluated as subplots in a split plot experiment. The P contents in soil and leaves increased with increased rates of P application. However, there was no effect from P application on the yield and its biennial cycle/stability regardless of the source used over the four seasons assessed.

Generalized Weyl solutions

It was shown by Weyl that the general static axisymmetric solution of the vacuum Einstein equations in four dimensions is given in terms of a single axisymmetric solution of the Laplace equation in three-dimensional flat space. Weyls construction is generalized here to arbitrary dimension D>~4. The general solution of the D-dimensional vacuum Einstein equations that admits D-2 orthogonal commuting non-null Killing vector fields is given either in terms of D-3 independent axisymmetric solutions of Laplaces equation in three-dimensional flat space or by D-4 independent solutions of Laplaces equation in two-dimensional flat space. Explicit examples of new solutions are given. These include a five-dimensional asymptotically flat black ring with an event horizon of topology S1S2 held in equilibrium by a conical singularity in the form of a disk.

Generalized Onsager symmetry

Onsager's symmetry theorem for transport near equilibrium is extended in two directions. A corresponding symmetry is obtained for linear transport near nonequilibrium stationary states, and the class of transport laws is extended to include nonlocality in both space and time. The results are formally exact and independent of any specific model for the nonequilibrium state.

Generalized percolation in random directed networks

We develop a general theory for percolation in directed random networks with arbitrary two-point correlations and bidirectional edgesthat is, edges pointing in both directions simultaneously. These two ingredients alter the previously known scenario and open new views and perspectives on percolation phenomena. Equations for the percolation threshold and the sizes of the giant components are derived in the most general case. We also present simulation results for a particular example of uncorrelated network with bidirectional edges confirming the theoretical predictions.

Generalized Langevin equations: Anomalous diffusion and probability distributions

We study the motion of a particle governed by a generalized Langevin equation. We show that, when no fluctuation-dissipation relation holds, the long-time behavior of the particle may be from stationary to superdiffusive, along with subdiffusive and diffusive. When the random force is Gaussian, we derive the exact equations for the joint and marginal probability density functions for the position and velocity of the particle and find their solutions.

Generalized adiabatic invariance

In this paper we find the quantities that are adiabatic invariants of any desired order for a general slowly time-dependent Hamiltonian. In a preceding paper, we chose a quantity that was initially an adiabatic invariant to first order, and sought the conditions to be imposed upon the Hamiltonian so that the quantum mechanical adiabatic theorem would be valid to mth order. [We found that this occurs when the first (m - 1) time derivatives of the Hamiltonian at the initial and final time instants are equal to zero.] Here we look for a quantity that is an adiabatic invariant to mth order for any Hamiltonian that changes slowly in time, and that does not fulfill any special condition (its first time derivatives are not zero initially and finally).

Petrou type-D perfect-fluid solutions in generalized Kerr-Schild form.

Generalized KerrSchild space-times for a perfect-fluid source are investigated. New Petrov type D perfect fluid solutions are obtained starting from conformally flat perfect-fluid metrics.

Petrou types D and II perfect-fluid solutions in generalized Kerr-Schild form.

Petrov types D and II perfect-fluid solutions are obtained starting from conformally flat perfect-fluid metrics and by using a generalized KerrSchild ansatz. Most of the Petrov type D metrics obtained have the property that the velocity of the fluid does not lie in the two-space defined by the principal null directions of the Weyl tensor. The properties of the perfect-fluid sources are studied. Finally, a detailed analysis of a new class of spherically symmetric static perfect-fluid metrics is given.

Rgtsp: a generalized top scoring pairs package for class prediction.

SUMMARY: A top scoring pair (TSP) classifier consists of a pair of variables whose relative ordering can be used for accurately predicting the class label of a sample. This classification rule has the advantage of being easily interpretable and more robust against technical variations in data, as those due to different microarray platforms. Here we describe a parallel implementation of this classifier which significantly reduces the training time, and a number of extensions, including a multi-class approach, which has the potential of improving the classification performance. AVAILABILITY AND IMPLEMENTATION: Full C++ source code and R package Rgtsp are freely available from http://lausanne.isb-sib.ch/~vpopovic/research/. The implementation relies on existing OpenMP libraries.

Uniform-price assignment markets

Uniform-price assignment games are introduced as those assignment markets with the core reduced to a segment. In these games, for all active agents, competitive prices are uniform although products may be non-homogeneous. A characterization in terms of the assignment matrix is given. The only assignment markets where all submarkets are uniform are the Bohm-Bawerk horse markets. We prove that for uniform-price assignment games the kernel, or set of symmetrically-pairwise bargained allocations, either coincides with the core or reduces to the nucleolus

The extreme core allocations of the assignment game

Although assignment games are hardly ever convex, in this paper a characterization of their set or extreme points of the core is provided, which is also valid for the class of convex games. For each ordering in the player set, a payoff vector is defined where each player receives his marginal contribution to a certain reduced game played by his predecessors. We prove that the whole set of reduced marginal worth vectors, which for convex games coincide with the usual marginal worth vectors, is the set of extreme points of the core of the assignment game

All assignment games with the same core have the same nucleolus

There exist coalitional games with transferable utility which have the same core but different nucleoli. We show that this cannot happen in the case of assignment games. Whenever two assignment games have the same core, their nucleoli also coincide. To show this, we prove that the nucleolus of an assignment game coincides with that of its buyer-seller exact representative

On the dimension of the core of the assignment game

The set of optimal matchings in the assignment matrix allows to define a reflexive and symmetric binary relation on each side of the market, the equal-partner binary relation. The number of equivalence classes of the transitive closure of the equal-partner binary relation determines the dimension of the core of the assignment game. This result provides an easy procedure to determine the dimension of the core directly from the entries of the assignment matrix and shows that the dimension of the core is not as much determined by the number of optimal matchings as by their relative position in the assignment matrix.

Time of ruin in a risk model with generalized Erlang (n) interclaim times and a constant dividend barrier

In this paper we analyze the time of ruin in a risk process with the interclaim times being Erlang(n) distributed and a constant dividend barrier. We obtain an integro-differential equation for the Laplace Transform of the time of ruin. Explicit solutions for the moments of the time of ruin are presented when the individual claim amounts have a distribution with rational Laplace transform. Finally, some numerical results and a compare son with the classical risk model, with interclaim times following an exponential distribution, are given.