A Gaussian-mixture ensemble transform filter

We generalize the popular ensemble Kalman filter to an ensemble transform filter, in which the prior distribution can take the form of a Gaussian mixture or a Gaussian kernel density estimator. The design of the filter is based on a continuous formulation of the Bayesian filter analysis step. We call the new filter algorithm the ensemble Gaussian-mixture filter (EGMF). The EGMF is implemented for three simple test problems (Brownian dynamics in one dimension, Langevin dynamics in two dimensions and the three-dimensional Lorenz-63 model). It is demonstrated that the EGMF is capable of tracking systems with non-Gaussian uni- and multimodal ensemble distributions. Copyright © 2011 Royal Meteorological Society

Developing a reliable strategy to infer the effective soil hydraulic properties from field evaporation experiments for agro-hydrological models

The Richards equation has been widely used for simulating soil water movement. However, the take-up of agro-hydrological models using the basic theory of soil water flow for optimizing irrigation, fertilizer and pesticide practices is still low. This is partly due to the difficulties in obtaining accurate values for soil hydraulic properties at a field scale. Here, we use an inverse technique to deduce the effective soil hydraulic properties, based on measuring the changes in the distribution of soil water with depth in a fallow field over a long period, subject to natural rainfall and evaporation using a robust micro Genetic Algorithm. A new optimized function was constructed from the soil water contents at different depths, and the soil water at field capacity. The deduced soil water retention curve was approximately parallel but higher than that derived from published pedo-tranfer functions for a given soil pressure head. The water contents calculated from the deduced soil hydraulic properties were in good agreement with the measured values. The reliability of the deduced soil hydraulic properties was tested in reproducing data measured from an independent experiment on the same soil cropped with leek. The calculation of root water uptake took account for both soil water potential and root density distribution. Results show that the predictions of soil water contents at various depths agree fairly well with the measurements, indicating that the inverse analysis is an effective and reliable approach to estimate soil hydraulic properties, and thus permits the simulation of soil water dynamics in both cropped and fallow soils in the field accurately. (C) 2009 Elsevier B.V. All rights reserved.

Reconstruction and prediction of variations in the open solar magnetic flux and interplanetary conditions

Historic geomagnetic activity observations have been used to reveal centennial variations in the open solar flux and the near-Earth heliospheric conditions (the interplanetary magnetic field and the solar wind speed). The various methods are in very good agreement for the past 135 years when there were sufficient reliable magnetic observatories in operation to eliminate problems due to site-specific errors and calibration drifts. This review underlines the physical principles that allow these reconstructions to be made, as well as the details of the various algorithms employed and the results obtained. Discussion is included of: the importance of the averaging timescale; the key differences between “range” and “interdiurnal variability” geomagnetic data; the need to distinguish source field sector structure from heliospherically-imposed field structure; the importance of ensuring that regressions used are statistically robust; and uncertainty analysis. The reconstructions are exceedingly useful as they provide calibration between the in-situ spacecraft measurements from the past five decades and the millennial records of heliospheric behaviour deduced from measured abundances of cosmogenic radionuclides found in terrestrial reservoirs. Continuity of open solar flux, using sunspot number to quantify the emergence rate, is the basis of a number of models that have been very successful in reproducing the variation derived from geomagnetic activity. These models allow us to extend the reconstructions back to before the development of the magnetometer and to cover the Maunder minimum. Allied to the radionuclide data, the models are revealing much about how the Sun and heliosphere behaved outside of grand solar maxima and are providing a means of predicting how solar activity is likely to evolve now that the recent grand maximum (that had prevailed throughout the space age) has come to an end.

A fast algorithm for sparse probability density function construction

A new sparse kernel density estimator is introduced. Our main contribution is to develop a recursive algorithm for the selection of significant kernels one at time using the minimum integrated square error (MISE) criterion for both kernel selection. The proposed approach is simple to implement and the associated computational cost is very low. Numerical examples are employed to demonstrate that the proposed approach is effective in constructing sparse kernel density estimators with competitive accuracy to existing kernel density estimators.

Eigenvalues of a one-dimensional Dirac operator pencil

We study the spectrum of a one-dimensional Dirac operator pencil, with a coupling constant in front of the potential considered as the spectral parameter. Motivated by recent investigations of graphene waveguides, we focus on the values of the coupling constant for which the kernel of the Dirac operator contains a square integrable function. In physics literature such a function is called a confined zero mode. Several results on the asymptotic distribution of coupling constants giving rise to zero modes are obtained. In particular, we show that this distribution depends in a subtle way on the sign variation and the presence of gaps in the potential. Surprisingly, it also depends on the arithmetic properties of certain quantities determined by the potential. We further observe that variable sign potentials may produce complex eigenvalues of the operator pencil. Some examples and numerical calculations illustrating these phenomena are presented.

Pollen-based reconstructions of biome distributions for Australia, Southeast Asia and the Pacific (SEAPAC region) at 0,6000 and 18,000 14C yr B.P.

Aim  This paper documents reconstructions of the vegetation patterns in Australia, Southeast Asia and the Pacific (SEAPAC region) in the mid-Holocene and at the last glacial maximum (LGM). Methods  Vegetation patterns were reconstructed from pollen data using an objective biomization scheme based on plant functional types. The biomization scheme was first tested using 535 modern pollen samples from 377 sites, and then applied unchanged to fossil pollen samples dating to 6000 ± 500 or 18,000 ± 1000 14C yr bp. Results  1. Tests using surface pollen sample sites showed that the biomization scheme is capable of reproducing the modern broad-scale patterns of vegetation distribution. The north–south gradient in temperature, reflected in transitions from cool evergreen needleleaf forest in the extreme south through temperate rain forest or wet sclerophyll forest (WSFW) and into tropical forests, is well reconstructed. The transitions from xerophytic through sclerophyll woodlands and open forests to closed-canopy forests, which reflect the gradient in plant available moisture from the continental interior towards the coast, are reconstructed with less geographical precision but nevertheless the broad-scale pattern emerges. 2. Differences between the modern and mid-Holocene vegetation patterns in mainland Australia are comparatively small and reflect changes in moisture availability rather than temperature. In south-eastern Australia some sites show a shift towards more moisture-stressed vegetation in the mid-Holocene with xerophytic woods/scrub and temperate sclerophyll woodland and shrubland at sites characterized today by WSFW or warm-temperate rain forest (WTRF). However, sites in the Snowy Mountains, on the Southern Tablelands and east of the Great Dividing Range have more moisture-demanding vegetation in the mid-Holocene than today. South-western Australia was slightly drier than today. The single site in north-western Australia also shows conditions drier than today in the mid-Holocene. Changes in the tropics are also comparatively small, but the presence of WTRF and tropical deciduous broadleaf forest and woodland in the mid-Holocene, in sites occupied today by cool-temperate rain forest, indicate warmer conditions. 3. Expansion of xerophytic vegetation in the south and tropical deciduous broadleaf forest and woodland in the north indicate drier conditions across mainland Australia at the LGM. None of these changes are informative about the degree of cooling. However the evidence from the tropics, showing lowering of the treeline and forest belts, indicates that conditions were between 1 and 9 °C (depending on elevation) colder. The encroachment of tropical deciduous broadleaf forest and woodland into lowland evergreen broadleaf forest implies greater aridity. Main conclusions  This study provides the first continental-scale reconstruction of mid-Holocene and LGM vegetation patterns from Australia, Southeast Asia and the Pacific (SEAPAC region) using an objective biomization scheme. These data will provide a benchmark for evaluation of palaeoclimate simulations within the framework of the Palaeoclimate Modelling Intercomparison Project.

Fast identification algorithms for Gaussian process model

A class identification algorithms is introduced for Gaussian process(GP)models.The fundamental approach is to propose a new kernel function which leads to a covariance matrix with low rank,a property that is consequently exploited for computational efficiency for both model parameter estimation and model predictions.The objective of either maximizing the marginal likelihood or the Kullback–Leibler (K–L) divergence between the estimated output probability density function(pdf)and the true pdf has been used as respective cost functions.For each cost function,an efficient coordinate descent algorithm is proposed to estimate the kernel parameters using a one dimensional derivative free search, and noise variance using a fast gradient descent algorithm. Numerical examples are included to demonstrate the effectiveness of the new identification approaches.

PDFOS: PDF estimation based over-sampling for imbalanced two-class problems

This contribution proposes a novel probability density function (PDF) estimation based over-sampling (PDFOS) approach for two-class imbalanced classification problems. The classical Parzen-window kernel function is adopted to estimate the PDF of the positive class. Then according to the estimated PDF, synthetic instances are generated as the additional training data. The essential concept is to re-balance the class distribution of the original imbalanced data set under the principle that synthetic data sample follows the same statistical properties. Based on the over-sampled training data, the radial basis function (RBF) classifier is constructed by applying the orthogonal forward selection procedure, in which the classifier’s structure and the parameters of RBF kernels are determined using a particle swarm optimisation algorithm based on the criterion of minimising the leave-one-out misclassification rate. The effectiveness of the proposed PDFOS approach is demonstrated by the empirical study on several imbalanced data sets.

Coalescence of particles by differential sedimentation

We consider a three dimensional system consisting of a large number of small spherical particles, distributed in a range of sizes and heights (with uniform distribution in the horizontal direction). Particles move vertically at a size-dependent terminal velocity. They are either allowed to merge whenever they cross or there is a size ratio criterion enforced to account for collision efficiency. Such a system may be described, in mean field approximation, by the Smoluchowski kinetic equation with a differential sedimentation kernel. We obtain self-similar steady-state and time-dependent solutions to the kinetic equation, using methods borrowed from weak turbulence theory. Analytical results are compared with direct numerical simulations (DNS) of moving and merging particles, and a good agreement is found.

Instantaneous gelation in Smoluchowski’s coagulation equation revisited

We study the solutions of the Smoluchowski coagulation equation with a regularization term which removes clusters from the system when their mass exceeds a specified cutoff size, M. We focus primarily on collision kernels which would exhibit an instantaneous gelation transition in the absence of any regularization. Numerical simulations demonstrate that for such kernels with monodisperse initial data, the regularized gelation time decreasesas M increases, consistent with the expectation that the gelation time is zero in the unregularized system. This decrease appears to be a logarithmically slow function of M, indicating that instantaneously gelling kernels may still be justifiable as physical models despite the fact that they are highly singular in the absence of a cutoff. We also study the case when a source of monomers is introduced in the regularized system. In this case a stationary state is reached. We present a complete analytic description of this regularized stationary state for the model kernel, K(m1,m2)=max{m1,m2}ν, which gels instantaneously when M→∞ if ν>1. The stationary cluster size distribution decays as a stretched exponential for small cluster sizes and crosses over to a power law decay with exponent ν for large cluster sizes. The total particle density in the stationary state slowly vanishes as [(ν−1)logM]−1/2 when M→∞. The approach to the stationary state is nontrivial: Oscillations about the stationary state emerge from the interplay between the monomer injection and the cutoff, M, which decay very slowly when M is large. A quantitative analysis of these oscillations is provided for the addition model which describes the situation in which clusters can only grow by absorbing monomers.

Noisy Monte Carlo: convergence of Markov chains with approximate transition kernels

Monte Carlo algorithms often aim to draw from a distribution π by simulating a Markov chain with transition kernel P such that π is invariant under P. However, there are many situations for which it is impractical or impossible to draw from the transition kernel P. For instance, this is the case with massive datasets, where is it prohibitively expensive to calculate the likelihood and is also the case for intractable likelihood models arising from, for example, Gibbs random fields, such as those found in spatial statistics and network analysis. A natural approach in these cases is to replace P by an approximation Pˆ. Using theory from the stability of Markov chains we explore a variety of situations where it is possible to quantify how ’close’ the chain given by the transition kernel Pˆ is to the chain given by P . We apply these results to several examples from spatial statistics and network analysis.

Towards (more) integrity in academia: transcending neo-liberal assumption of research and knowledge creation and the “rules” supressing academic freedom

European researchers across heterogeneous disciplines voice concerns and argue for new paths towards a brighter future regarding scientific and knowledge creation and communication. Recently, in biological and natural sciences concerns have been expressed that major threats are intentionally ignored. These threats are challenging Europe’s future sustainability towards creating knowledge that effectively deals with emerging social, environmental, health, and economic problems of a planetary scope. Within social science circles however, the root cause regarding the above challenges, have been linked with macro level forces of neo-liberal ways of valuing and relevant rules in academia and beyond which we take for granted. These concerns raised by heterogeneous scholars in natural and the applied social sciences concern the ethics of today’s research and academic integrity. Applying Bourdieu’s sociology may not allow an optimistic lens if change is possible. Rather than attributing the replication of neo-liberal habitus in intentional agent and institutional choices, Bourdieu’s work raises the importance of thoughtlessly internalised habits in human and social action. Accordingly, most action within a given paradigm (in this case, neo-liberalism) is understood as habituated, i.e. unconsciously reproducing external social fields, even ill-defined ways of valuing. This essay analyses these and how they may help critically analyse the current habitus surrounding research and knowledge production, evaluation, and communication and related aspects of academic freedom. Although it is acknowledged that transformation is not easy, the essay presents arguments and recent theory paths to suggest that change nevertheless may be a realistic hope once certain action logics are encouraged.

A benchmark-driven modelling approach for evaluating deployment choices on a multi-core architecture

The complexity of current and emerging architectures provides users with options about how best to use the available resources, but makes predicting performance challenging. In this work a benchmark-driven model is developed for a simple shallow water code on a Cray XE6 system, to explore how deployment choices such as domain decomposition and core affinity affect performance. The resource sharing present in modern multi-core architectures adds various levels of heterogeneity to the system. Shared resources often includes cache, memory, network controllers and in some cases floating point units (as in the AMD Bulldozer), which mean that the access time depends on the mapping of application tasks, and the core's location within the system. Heterogeneity further increases with the use of hardware-accelerators such as GPUs and the Intel Xeon Phi, where many specialist cores are attached to general-purpose cores. This trend for shared resources and non-uniform cores is expected to continue into the exascale era. The complexity of these systems means that various runtime scenarios are possible, and it has been found that under-populating nodes, altering the domain decomposition and non-standard task to core mappings can dramatically alter performance. To find this out, however, is often a process of trial and error. To better inform this process, a performance model was developed for a simple regular grid-based kernel code, shallow. The code comprises two distinct types of work, loop-based array updates and nearest-neighbour halo-exchanges. Separate performance models were developed for each part, both based on a similar methodology. Application specific benchmarks were run to measure performance for different problem sizes under different execution scenarios. These results were then fed into a performance model that derives resource usage for a given deployment scenario, with interpolation between results as necessary.

Rainfall estimation by rain gauge-radar combination: a concurrent multiplicative-additive approach

A procedure (concurrent multiplicative-additive objective analysis scheme [CMA-OAS]) is proposed for operational rainfall estimation using rain gauges and radar data. On the basis of a concurrent multiplicative-additive (CMA) decomposition of the spatially nonuniform radar bias, within-storm variability of rainfall and fractional coverage of rainfall are taken into account. Thus both spatially nonuniform radar bias, given that rainfall is detected, and bias in radar detection of rainfall are handled. The interpolation procedure of CMA-OAS is built on Barnes' objective analysis scheme (OAS), whose purpose is to estimate a filtered spatial field of the variable of interest through a successive correction of residuals resulting from a Gaussian kernel smoother applied on spatial samples. The CMA-OAS, first, poses an optimization problem at each gauge-radar support point to obtain both a local multiplicative-additive radar bias decomposition and a regionalization parameter. Second, local biases and regionalization parameters are integrated into an OAS to estimate the multisensor rainfall at the ground level. The procedure is suited to relatively sparse rain gauge networks. To show the procedure, six storms are analyzed at hourly steps over 10,663 km2. Results generally indicated an improved quality with respect to other methods evaluated: a standard mean-field bias adjustment, a spatially variable adjustment with multiplicative factors, and ordinary cokriging.

Nonlinear identification using orthogonal forward regression with nested optimal regularization

An efficient data based-modeling algorithm for nonlinear system identification is introduced for radial basis function (RBF) neural networks with the aim of maximizing generalization capability based on the concept of leave-one-out (LOO) cross validation. Each of the RBF kernels has its own kernel width parameter and the basic idea is to optimize the multiple pairs of regularization parameters and kernel widths, each of which is associated with a kernel, one at a time within the orthogonal forward regression (OFR) procedure. Thus, each OFR step consists of one model term selection based on the LOO mean square error (LOOMSE), followed by the optimization of the associated kernel width and regularization parameter, also based on the LOOMSE. Since like our previous state-of-the-art local regularization assisted orthogonal least squares (LROLS) algorithm, the same LOOMSE is adopted for model selection, our proposed new OFR algorithm is also capable of producing a very sparse RBF model with excellent generalization performance. Unlike our previous LROLS algorithm which requires an additional iterative loop to optimize the regularization parameters as well as an additional procedure to optimize the kernel width, the proposed new OFR algorithm optimizes both the kernel widths and regularization parameters within the single OFR procedure, and consequently the required computational complexity is dramatically reduced. Nonlinear system identification examples are included to demonstrate the effectiveness of this new approach in comparison to the well-known approaches of support vector machine and least absolute shrinkage and selection operator as well as the LROLS algorithm.