Performance evaluation of a water/silicone oil two‐phase partitioning bioreactor using Rhodococcus erythropolis T902.1 to remove volatile organic compounds from gaseous effluents

BACKGROUND: In the framework of biological processes used for waste gas treatment, the impact of the inoculum size on the start‐up performance needs to be better evaluated. Moreover, only a few studies have investigated the behaviour of elimination capacity and biomass viability in a two‐phase partitioning bioreactor (TPPB) used for waste gas treatment. Lastly, the impact of ethanol as a co‐substrate remains misunderstood. RESULTS: Firstly, no benefit of inoculation with a high cellular density (>1.5 g L^?1) was observed in terms of start‐up performance. Secondly, the TPPB was monitored for 38 days to characterise its behaviour under several operational conditions. The removal efficiency remained above 63% for an inlet concentration of 7 g isopropylbenzene (IPB) m^?3 and at some time points reached 92% during an intermittent loading phase (10 h day^?1), corresponding to a mean elimination capacity of 4 × 10^?3 g L^?1 min^?1 (240 g m^?3 h^?1) for a mean IPB inlet load of 6.19 × 10^?3 g L^?1 min^?1 (390 g m^?3 h^?1). Under continuous IPB loading, the performance of the TPPB declined, but the period of biomass acclimatisation to this operational condition was shorter than 5 days. The biomass grew to approximately 10 g L^?1 but the cellular viability changed greatly during the experiment, suggesting an endorespiration phenomenon in the bioreactor. It was also shown that simultaneous degradation of IPB and ethanol occurred, suggesting that ethanol improves the biodegradation process without causing oxygen depletion. CONCLUSION: A water/silicone oil TPPB with ethanol as co‐substrate allowed the removal of a high inlet load of IPB during an experiment lasting 38 days. Copyright © 2008 Society of Chemical Industry     

The potential use of wetlands to reduce phosphorus export from agricultural catchments

Natural and artificial wetlands have the potential to reduce phosphorus (P) loads from dispersed agricultural runoff and from point sources in the Peel-Harvey catchment, Western Australia. Small experimental systems containing wetland plants and substrate have shown significant removal of P from inflowing water, the proportion of P removed being dependent on P concentration and flow rate of water through the system. The use of artificial wetlands to treat diffuse agricultural runoff is limited by the highly seasonal runoff typical of this Mediterranean climate, while use at point sources has so far been unsuccessful because compounds from the effluent clog the wetland filters. Treatment at point sources may well be feasible after further research.Natural wetlands in the catchment absorb P received in runoff from farmland and, in the absence of any outflow channels to the drainage system, confine this P within the boundaries of the wetland. Disturbance to wetlands may reduce their efficiency in absorbing nutrients and may release P stored in the vegetation and sediment to the water. The conservation of natural wetlands is recommended to maximise nutrient retention in the catchment.     

Managing nutrient losses from rural point sources and urban environments

Nutrient loss from rural point sources and urban environments need to be minimised as part of strategies to overcome declining water quality on the Swan Coastal Plain and in the Peel-Harvey estuary in Western Australia. This paper discusses the management of nutrient losses from domestic effluent, urban stormwater runoff, domestic gardens and public open space, intensive animal industries and intensive irrigated agriculture. Measures to minimise nutrient losses from these sources are outlined, using cooperative, technological and regulatory approaches.     

Laboratory study of soil acidification and leaching of nutrients from a soil amended with various surface-incorporated acidifying agents

Granular S, finely-ground S, iron sulphate and aluminium sulphate were added at two rates to the surface (0–6 cm) of a soil and acidification and leaching of nutrients were measured over 12 months in a laboratory study. Iron and aluminium sulphate both rapidly lowered soil pH in the top 0–6 cm of the soil. There was little difference in soil pH after 3 and 12 months reaction of these two amendments. In contrast, for granular S and finely-ground S there were clear decreases in soil pH between 3 and 12 months reaction with the soil. Finely-ground S was oxidized in the soil faster than granular S and therefore had a more acidifying effect. The top 0–6 cm of the soil was acidified by all the agents used but the deeper soil was less affected. The only treatments which lowered the pH of the 12–18 cm layer below pH 6 were the high rates of iron and aluminium sulphate. Soil acidification resulted in a decrease in exchangeable Ca, Mg and K, an increase in exchangeable Al and a decrease in effective CEC in the acidified soil layers.At both levels of addition, total ionic strength of percolates from the soil followed the order: aluminium sulphate = iron sulphate > finely gound S > granular S > control and was higher at the higher rate of addition. The pH values of percolates followed the order: control > granular S > finely ground S > iron sulphate = aluminium sulphate and were lower at the higher rate of addition. For the amended soils there was a very close relationship between the pattern and total amounts of SO ₄ ^2- and Ca²⁺ leached.It was concluded that granular S is not an effective acidifying agent since it is oxidized very slowly in the soil and that acidfying agents should be incorporated to the depth that acidification is required.     

A new graph cut-based multiple active contour algorithm without initial contours and seed points

This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of multiple active contours is framed as a partitioning problem by assuming that image data are generated from a finite mixture model with unknown number of components. Then, the partitioning problem is solved within a divisive graph cut framework where multi-way minimum cuts for multiple contours are efficiently computed in a top-down way through a swap move of binary labels. A split move is integrated into the swap move within that framework to estimate the model parameters associated with regions without the use of initial contours and seed points. The number of regions is also estimated as a part of the algorithm. Experimental results of boundary and region detection of natural images are presented and analyzed with precision and recall measures to demonstrate the effectiveness of the proposed algorithm.     

Volt-VAR control for distribution networks with high penetration of DGs: An overview

Continuously improving the ability to accept distributed renewable energies is the trend of future grid development, and a large number of papers have been published in recent years to study the problem of Volt-VAR control (VVC) for distribution networks with high penetration of distributed generations. This paper summarizes the relevant modeling and solution methods for VVC problems, mainly including VVC based on multiple time scales, hierarchical partitioning, multi-stage and network reconstruction, in conjunction with the operational characteristics of distribution networks containing distributed renewable energies; meanwhile, it analyzes the advantages and disadvantages of traditional optimization methods, heuristic intelligent algorithms and random variable processing methods used to solve VVC problems, and then introduces the application of model-free deep reinforcement learning as a latest decision method in VVC of distribution networks. Most of the models and methods compiled in this article are from the research results of the last three years and have some reference value.     

On a class of optimal abstractions of finite-state machines

Anabstraction A of an fsmM consists in partitioning its states, inputs, and outputs into groups, thus turning it into a non-deterministic fsmM _A. For fixed sets of states, inputs, and outputs, and abstraction generally maps a number of machinesM defined on these sets into the sameM _A. We would like to find anoptimal abstractionA ^* which minimizes this number, while lumping the states, inputs, and outputs into a specified number of classes. We extend these ideas to an fsmM operating in a random environment, and show that the abstraction results in a probabilistic fsm . Thinking of changes inM's output map as resulting in machinesM≠MM, we want to find anA ^* that minimizes the number ofMM which are such that the transition probabilities of their abstracted version are identical to those of the specification machine . SuchMM arise from statistically-undetectable output faults inM. Abstractions are directly applicable to the monitoring of a complex system by an observer for deviations from correct behavior (faults). Complex systems are usually accessible through restricted interfaces, which do not allow the observer to distinguish among all states, inputs, and outputs, thus rendering some faulty transitions undetectable. An optimal interface design will minimize the number of such undetectable faults. Assuming that only single-transition output faults occur inM, we show that each of the classes into which the abstraction lumps the outputs contributes a number of undetectable output faults. We then show that the problem of partitioning the outputs into a given number of classes that minimizes the maximum of these numbers is NP-complete. However, we give (a) an approximate minimization algorithm, running in time linear in the number of classes and quadratic in the number ofM's outputs, and (b) a lower bound on the minimum, computable in the same amount of time. The concept of optimal abstractions is illustrated by numerical results on combinational logic circuits that perform arithmetical operations. The results shed light on the trade-off between model simplification and the ability to detect erroneous behaviors in complex systems.     

Delay‐dependent robust H∞ control for uncertain stochastic time‐delay systems

This paper investigates the robust H_∞ control problem for stochastic systems with a delay in the state. Sufficient delay‐dependent conditions for the existence of state‐feedback controllers are proposed to guarantee mean‐square asymptotic stability as well as the prescribed H_∞ performance for the closed‐loop systems. Moreover, the results are further extended to the stochastic time‐delay systems with parameter uncertainties, which are assumed to be time‐varying norm‐bounded appearing in both the state and the input matrices. The appealing idea is to partition the delay, which differs greatly from the most existing results and reduces conservatism by thinning the delay partitioning. Numerical examples are provided to show the advantages of the proposed techniques. Copyright © 2009 John Wiley & Sons, Ltd.