Bacteria in shrimp pond sediments: their role in mineralizing nutrients and some suggested sampling strategies

Strategies for sampling sediment bacteria were examined in intensive shrimp, Penaeus monodon (Fabricius), ponds in tropical Australia. Stratified sampling of bacteria at the end of the production season showed that the pond centre, containing flocculated sludge, had significantly higher bacterial counts (15.5 X 10(9) g(-1) dw) than the pond periphery (8.1 X 10(9) g(-1) dw), where the action of aerators had swept the pond floor. The variation in bacterial counts between these two zones within a pond was higher than that between sites within each zone or between ponds. Therefore, sampling effort should be focused within these zones: for example, sampling two ponds at six locations within each of the two zones resulted in a coefficient of variation of approximate to 5%. Bacterial numbers in the sediment were highly correlated with sediment grain size, probably because eroded soil particles and organic waste both accumulated in the centre of the pond. Despite high inputs of organic matter added to the ponds, principally as pelleted feeds, the mean bacterial numbers and nutrient concentrations (i.e. organic carbon, nitrogen and phosphorus) in the sediment were similar to those found in mangrove sediments. This suggests that bacteria are rapidly remineralizing particulates into soluble compounds. Bacterial numbers were highly correlated with organic carbon and total kjeldahl nitrogen in the sediment, suggesting that these were limiting factors to bacterial growth.

A numerical study of large sparse matrix exponentials arising in Markov chains

Krylov subspace techniques have been shown to yield robust methods for the numerical computation of large sparse matrix exponentials and especially the transient solutions of Markov Chains. The attractiveness of these methods results from the fact that they allow us to compute the action of a matrix exponential operator on an operand vector without having to compute, explicitly, the matrix exponential in isolation. In this paper we compare a Krylov-based method with some of the current approaches used for computing transient solutions of Markov chains. After a brief synthesis of the features of the methods used, wide-ranging numerical comparisons are performed on a power challenge array supercomputer on three different models. (C) 1999 Elsevier Science B.V. All rights reserved.AMS Classification: 65F99; 65L05; 65U05.