Evaluation of algorithms used to order markers on genetic maps

When building genetic maps, it is necessary to choose from several marker ordering algorithms and criteria, and the choice is not always simple. In this study, we evaluate the efficiency of algorithms try (TRY), seriation (SER), rapid chain delineation (RCD), recombination counting and ordering (RECORD) and unidirectional growth (UG), as well as the criteria PARF (product of adjacent recombination fractions), SARF (sum of adjacent recombination fractions), SALOD (sum of adjacent LOD scores) and LHMC (likelihood through hidden Markov chains), used with the RIPPLE algorithm for error verification, in the construction of genetic linkage maps. A linkage map of a hypothetical diploid and monoecious plant species was simulated containing one linkage group and 21 markers with fixed distance of 3 cM between them. In all, 700 F(2) populations were randomly simulated with and 400 individuals with different combinations of dominant and co-dominant markers, as well as 10 and 20% of missing data. The simulations showed that, in the presence of co-dominant markers only, any combination of algorithm and criteria may be used, even for a reduced population size. In the case of a smaller proportion of dominant markers, any of the algorithms and criteria (except SALOD) investigated may be used. In the presence of high proportions of dominant markers and smaller samples (around 100), the probability of repulsion linkage increases between them and, in this case, use of the algorithms TRY and SER associated to RIPPLE with criterion LHMC would provide better results. Heredity (2009) 103, 494-502; doi:10.1038/hdy.2009.96; published online 29 July 2009

Bacterial soil community in a Brazilian sugarcane field

The assessment of bacterial communities in soil gives insight into microbial behavior under prevailing environmental conditions. In this context, we assessed the composition of soil bacterial communities in a Brazilian sugarcane experimental field. The experimental design encompassed plots containing common sugarcane (variety SP80-1842) and its transgenic form (IMI-1 - imazapyr herbicide resistant). Plants were grown in such field plots in a completely randomized design with three treatments, which addressed the factors transgene and imazapyr herbicide application. Soil samples were taken at three developmental stages during plant growth and analyzed using 16S ribosomal RNA (rRNA)-based PCR-denaturing gradient gel electrophoresis (PCR-DGGE) and clone libraries. PCR-DGGE fingerprints obtained for the total bacterial community and specific bacterial groups - Actinobacteria, Alphaproteobacteria and Betaproteobacteria - revealed that the structure of these assemblages did not differ over time and among treatments. Nevertheless, slight differences among 16S rRNA gene clone libraries constructed from each treatment could be observed at particular cut-off levels. Altogether, the libraries encompassed a total of eleven bacterial phyla and the candidate divisions TM7 and OP10. Clone sequences affiliated with the Proteobacteria, Actinobacteria, Firmicutes and Acidobacteria were, in this order, most abundant. Accurate phylogenetic analyses were performed for the phyla Acidobacteria and Verrucomicrobia, revealing the structures of these groups, which are still poorly understood as to their importance for soil functioning and sustainability under agricultural practices.

Using Imaging Spectroscopy to study soil properties

Imaging Spectroscopy (IS) is a promising tool for studying soil properties in large spatial domains. Going from point to image spectrometry is not only a journey from micro to macro scales, but also a long stage where problems such as dealing with data having a low signal-to-noise level, contamination of the atmosphere, large data sets, the BRDF effect and more are often encountered. In this paper we provide an up-to-date overview of some of the case studies that have used IS technology for soil science applications. Besides a brief discussion on the advantages and disadvantages of IS for studying soils, the following cases are comprehensively discussed: soil degradation (salinity, erosion, and deposition), soil mapping and classification, soil genesis and formation, soil contamination, soil water content, and soil swelling. We review these case studies and suggest that the 15 data be provided to the end-users as real reflectance and not as raw data and with better signal-to-noise ratios than presently exist. This is because converting the raw data into reflectance is a complicated stage that requires experience, knowledge, and specific infrastructures not available to many users, whereas quantitative spectral models require good quality data. These limitations serve as a barrier that impedes potential end-users, inhibiting researchers from trying this technique for their needs. The paper ends with a general call to the soil science audience to extend the utilization of the IS technique, and it provides some ideas on how to propel this technology forward to enable its widespread adoption in order to achieve a breakthrough in the field of soil science and remote sensing. (C) 2009 Elsevier Inc. All rights reserved.

Atomic Latin squares of order eleven

A Latin square is pan-Hamiltonian if the permutation which defines row i relative to row j consists of a single cycle for every i j. A Latin square is atomic if all of its conjugates are pan-Hamiltonian. We give a complete enumeration of atomic squares for order 11, the smallest order for which there are examples distinct from the cyclic group. We find that there are seven main classes, including the three that were previously known. A perfect 1-factorization of a graph is a decomposition of that graph into matchings such that the union of any two matchings is a Hamiltonian cycle. Each pan-Hamiltonian Latin square of order n describes a perfect 1-factorization of Kn,n, and vice versa. Perfect 1-factorizations of Kn,n can be constructed from a perfect 1-factorization of Kn+1. Six of the seven main classes of atomic squares of order 11 can be obtained in this way. For each atomic square of order 11, we find the largest set of Mutually Orthogonal Latin Squares (MOLS) involving that square. We discuss algorithms for counting orthogonal mates, and discover the number of orthogonal mates possessed by the cyclic squares of orders up to 11 and by Parker's famous turn-square. We find that the number of atomic orthogonal mates possessed by a Latin square is not a main class invariant. We also define a new sort of Latin square, called a pairing square, which is mapped to its transpose by an involution acting on the symbols. We show that pairing squares are often orthogonal mates for symmetric Latin squares. Finally, we discover connections between our atomic squares and Franklin's diagonally cyclic self-orthogonal squares, and we correct a theorem of Longyear which uses tactical representations to identify self-orthogonal Latin squares in the same main class as a given Latin square.

Canonical Bose gas simulations with stochastic gauges

A technique to simulate the grand canonical ensembles of interacting Bose gases is presented. Results are generated for many temperatures by averaging over energy-weighted stochastic paths, each corresponding to a solution of coupled Gross-Pitaevskii equations with phase noise. The stochastic gauge method used relies on an off-diagonal coherent-state expansion, thus taking into account all quantum correlations. As an example, the second-order spatial correlation function and momentum distribution for an interacting 1D Bose gas are calculated.

Existence of Multiple Solutions for Second Order Boundary Value Problems

We give conditions on f involving pairs of lower and upper solutions which lead to the existence of at least three solutions of the two point boundary value problem y" + f(x, y, y') = 0, x epsilon [0, 1], y(0) = 0 = y(1). In the special case f(x, y, y') = f(y) greater than or equal to 0 we give growth conditions on f and apply our general result to show the existence of three positive solutions. We give an example showing this latter result is sharp. Our results extend those of Avery and of Lakshmikantham et al.

Fixed bed reactors with catalyst poisoning - first order kinetics.

The long performance of an isothermal fixed bed reactor undergoing catalyst poisoning is theoretically analyzed using the dispersion model. First order reaction with dth order deactivation is assumed and the model equations are solved by matched asymptotic expansions for large Peclet number. Simple closed-form solutions, uniformly valid in time, are obtained.

Subcycling first- and second-order generalizations of the trapezoidal rule

Subcycling algorithms which employ multiple timesteps have been previously proposed for explicit direct integration of first- and second-order systems of equations arising in finite element analysis, as well as for integration using explicit/implicit partitions of a model. The author has recently extended this work to implicit/implicit multi-timestep partitions of both first- and second-order systems. In this paper, improved algorithms for multi-timestep implicit integration are introduced, that overcome some weaknesses of those proposed previously. In particular, in the second-order case, improved stability is obtained. Some of the energy conservation properties of the Newmark family of algorithms are shown to be preserved in the new multi-timestep extensions of the Newmark method. In the first-order case, the generalized trapezoidal rule is extended to multiple timesteps, in a simple way that permits an implicit/implicit partition. Explicit special cases of the present algorithms exist. These are compared to algorithms proposed previously. (C) 1998 John Wiley & Sons, Ltd.

Truncation errors in finite difference models for solute transport equation with first-order reaction

The truncation errors associated with finite difference solutions of the advection-dispersion equation with first-order reaction are formulated from a Taylor analysis. The error expressions are based on a general form of the corresponding difference equation and a temporally and spatially weighted parametric approach is used for differentiating among the various finite difference schemes. The numerical truncation errors are defined using Peclet and Courant numbers and a new Sink/Source dimensionless number. It is shown that all of the finite difference schemes suffer from truncation errors. Tn particular it is shown that the Crank-Nicolson approximation scheme does not have second order accuracy for this case. The effects of these truncation errors on the solution of an advection-dispersion equation with a first order reaction term are demonstrated by comparison with an analytical solution. The results show that these errors are not negligible and that correcting the finite difference scheme for them results in a more accurate solution. (C) 1999 Elsevier Science B.V. All rights reserved.

Chaotic dynamics of cold atoms in far-off-resonant donut beams

We describe the classical two-dimensional nonlinear dynamics of cold atoms in far-off-resonant donut beams. We show that chaotic dynamics exists there for charge greater than unity, when the intensity of the beam is periodically modulated. The two-dimensional distributions of atoms in the (x,y) plant for charge 2 are simulated. We show that the atoms will accumulate on several ring regions when the system enters a regime of global chaos. [S1063-651X(99)03903-3].

Novel solitons in parametric amplifiers and atom lasers

We review recent developments in quantum and classical soliton theory, leading to the possibility of observing both classical and quantum parametric solitons in higher-dimensional environments. In particular, we consider the theory of three bosonic fields interacting via both parametric (cubic) and quartic couplings. In the case of photonic fields in a nonlinear optical medium this corresponds to the process of sum frequency generation (via chi((2)) nonlinearity) modified by the chi((3)) nonlinearity. Potential applications include an ultrafast photonic AND-gate. The simplest quantum solitons or energy eigenstates (bound-state solutions) of the interacting field Hamiltonian are obtained exactly in three space dimensions. They have a point-like structure-even though the corresponding classical theory is nonsingular. We show that the solutions can be regularized with the imposition of a momentum cut-off on the nonlinear couplings. The case of three-dimensional matter-wave solitons in coupled atomic/molecular Bose-Einstein condensates is discussed.

Quantum chaos in atom optics

I shall discuss the quantum and classical dynamics of a class of nonlinear Hamiltonian systems. The discussion will be restricted to systems with one degree of freedom. Such systems cannot exhibit chaos, unless the Hamiltonians are time dependent. Thus we shall consider systems with a potential function that has a higher than quadratic dependence on the position and, furthermore, we shall allow the potential function to be a periodic function of time. This is the simplest class of Hamiltonian system that can exhibit chaotic dynamics. I shall show how such systems can be realized in atom optics, where very cord atoms interact with optical dipole potentials of a far-off resonance laser. Such systems are ideal for quantum chaos studies as (i) the energy of the atom is small and action scales are of the order of Planck's constant, (ii) the systems are almost perfectly isolated from the decohering effects of the environment and (iii) optical methods enable exquisite time dependent control of the mechanical potentials seen by the atoms.