Identification of nonlinear systems using generalized kernel models

Nonlinear system identification is considered using a generalized kernel regression model. Unlike the standard kernel model, which employs a fixed common variance for all the kernel regressors, each kernel regressor in the generalized kernel model has an individually tuned diagonal covariance matrix that is determined by maximizing the correlation between the training data and the regressor using a repeated guided random search based on boosting optimization. An efficient construction algorithm based on orthogonal forward regression with leave-one-out (LOO) test statistic and local regularization (LR) is then used to select a parsimonious generalized kernel regression model from the resulting full regression matrix. The proposed modeling algorithm is fully automatic and the user is not required to specify any criterion to terminate the construction procedure. Experimental results involving two real data sets demonstrate the effectiveness of the proposed nonlinear system identification approach.

Kernel classifier construction using orthogonal forward selection and boosting with Fisher ratio class separability measure

A greedy technique is proposed to construct parsimonious kernel classifiers using the orthogonal forward selection method and boosting based on Fisher ratio for class separability measure. Unlike most kernel classification methods, which restrict kernel means to the training input data and use a fixed common variance for all the kernel terms, the proposed technique can tune both the mean vector and diagonal covariance matrix of individual kernel by incrementally maximizing Fisher ratio for class separability measure. An efficient weighted optimization method is developed based on boosting to append kernels one by one in an orthogonal forward selection procedure. Experimental results obtained using this construction technique demonstrate that it offers a viable alternative to the existing state-of-the-art kernel modeling methods for constructing sparse Gaussian radial basis function network classifiers. that generalize well.

Fast kernel classifier construction using orthogonal forward selection to minimise leave-one-out misclassification rate

We propose a simple yet computationally efficient construction algorithm for two-class kernel classifiers. In order to optimise classifier's generalisation capability, an orthogonal forward selection procedure is used to select kernels one by one by minimising the leave-one-out (LOO) misclassification rate directly. It is shown that the computation of the LOO misclassification rate is very efficient owing to orthogonalisation. Examples are used to demonstrate that the proposed algorithm is a viable alternative to construct sparse two-class kernel classifiers in terms of performance and computational efficiency.

A kernel-based two-class classifier for imbalanced data sets

Many kernel classifier construction algorithms adopt classification accuracy as performance metrics in model evaluation. Moreover, equal weighting is often applied to each data sample in parameter estimation. These modeling practices often become problematic if the data sets are imbalanced. We present a kernel classifier construction algorithm using orthogonal forward selection (OFS) in order to optimize the model generalization for imbalanced two-class data sets. This kernel classifier identification algorithm is based on a new regularized orthogonal weighted least squares (ROWLS) estimator and the model selection criterion of maximal leave-one-out area under curve (LOO-AUC) of the receiver operating characteristics (ROCs). It is shown that, owing to the orthogonalization procedure, the LOO-AUC can be calculated via an analytic formula based on the new regularized orthogonal weighted least squares parameter estimator, without actually splitting the estimation data set. The proposed algorithm can achieve minimal computational expense via a set of forward recursive updating formula in searching model terms with maximal incremental LOO-AUC value. Numerical examples are used to demonstrate the efficacy of the algorithm.

A forward-constrained regression algorithm for sparse kernel density estimation

Using the classical Parzen window (PW) estimate as the target function, the sparse kernel density estimator is constructed in a forward-constrained regression (FCR) manner. The proposed algorithm selects significant kernels one at a time, while the leave-one-out (LOO) test score is minimized subject to a simple positivity constraint in each forward stage. The model parameter estimation in each forward stage is simply the solution of jackknife parameter estimator for a single parameter, subject to the same positivity constraint check. For each selected kernels, the associated kernel width is updated via the Gauss-Newton method with the model parameter estimate fixed. The proposed approach is simple to implement and the associated computational cost is very low. Numerical examples are employed to demonstrate the efficacy of the proposed approach.

Sparse kernel density estimation technique based on zero-norm constraint

A sparse kernel density estimator is derived based on the zero-norm constraint, in which the zero-norm of the kernel weights is incorporated to enhance model sparsity. The classical Parzen window estimate is adopted as the desired response for density estimation, and an approximate function of the zero-norm is used for achieving mathemtical tractability and algorithmic efficiency. Under the mild condition of the positive definite design matrix, the kernel weights of the proposed density estimator based on the zero-norm approximation can be obtained using the multiplicative nonnegative quadratic programming algorithm. Using the -optimality based selection algorithm as the preprocessing to select a small significant subset design matrix, the proposed zero-norm based approach offers an effective means for constructing very sparse kernel density estimates with excellent generalisation performance.

Regression based D-optimality experimental design for sparse kernel density estimation

This paper derives an efficient algorithm for constructing sparse kernel density (SKD) estimates. The algorithm first selects a very small subset of significant kernels using an orthogonal forward regression (OFR) procedure based on the D-optimality experimental design criterion. The weights of the resulting sparse kernel model are then calculated using a modified multiplicative nonnegative quadratic programming algorithm. Unlike most of the SKD estimators, the proposed D-optimality regression approach is an unsupervised construction algorithm and it does not require an empirical desired response for the kernel selection task. The strength of the D-optimality OFR is owing to the fact that the algorithm automatically selects a small subset of the most significant kernels related to the largest eigenvalues of the kernel design matrix, which counts for the most energy of the kernel training data, and this also guarantees the most accurate kernel weight estimate. The proposed method is also computationally attractive, in comparison with many existing SKD construction algorithms. Extensive numerical investigation demonstrates the ability of this regression-based approach to efficiently construct a very sparse kernel density estimate with excellent test accuracy, and our results show that the proposed method compares favourably with other existing sparse methods, in terms of test accuracy, model sparsity and complexity, for constructing kernel density estimates.

Diallyl disulphide, a beneficial component of garlic oil, causes a redistribution of cell-cycle growth phases, induces apoptosis and enhances butyrate-induced apoptosis in colorectal adenocarcinoma cells (HT-29)

Colon cancer is a leading and expanding cause of death worldwide. A major contributory factor to this disease is diet composition; some components are beneficial (e.g. dietary fibre) whilst others are detrimental (e.g. alcohol). Garlic oil is a prominent dietary constituent that prevents the development of colorectal cancer. This effect is believed to be mainly due to diallyl disulphide (DADS), which selectively induces redox stress in cancerous (rather than normal) cells which leads to apoptotic cell death. However, the detailed mechanism by which DADS causes apoptosis remains unclear. We show that DADS-treatment of colonic adenocarcinoma cells (HT-29) initiates a cascade of molecular events characteristic of apoptosis. These include a decrease in cellular proliferation, translocation of phosphatidylserine to the plasma-membrane outer-layer, activation of caspase-3, genomic-DNA fragmentation and G2/M phase cell-cycle arrest. Short-chain fatty acids (SCFAs), particularly butyrate (abundantly produced in the gut by bacterial fermentation of dietary polysaccharides), enhance colonic cell integrity but, in contrast, inhibit colonic-cancer cell growth. Combining DADS with butyrate augmented the effect of butyrate on HT-29 cells. These results suggest that the anti-cancerous properties of DADS afford greater benefit when supplied with other favourable dietary factors (SCFA/polysaccharides) that likewise reduce colonic tumour development.

New direct payments scheme: targeting and redistribution in the future CAP

The Commission has proposed that a revised version of the present regime of direct payments should be rolled forward into the post-2013 CAP. There would be a limited redistribution of funds between Member States. Thirty per cent of the budget would be allocated to a new greening component, which would be problematic in the WTO. Non-active farmers would not qualify for aid; and payments would be capped. Special schemes would be introduced for small farmers, for young new entrants, and for disadvantaged regions.

Heat kernel smoothing via Laplace-Beltrami eigenfunctions and its application to subcortical structure modeling

We present a new subcortical structure shape modeling framework using heat kernel smoothing constructed with the Laplace-Beltrami eigenfunctions. The cotan discretization is used to numerically obtain the eigenfunctions of the Laplace-Beltrami operator along the surface of subcortical structures of the brain. The eigenfunctions are then used to construct the heat kernel and used in smoothing out measurements noise along the surface. The proposed framework is applied in investigating the influence of age (38-79 years) and gender on amygdala and hippocampus shape. We detected a significant age effect on hippocampus in accordance with the previous studies. In addition, we also detected a significant gender effect on amygdala. Since we did not find any such differences in the traditional volumetric methods, our results demonstrate the benefit of the current framework over traditional volumetric methods.

Is DARTEL-based voxel-based morphometry affected by width of smoothing kernel and group size? A study using simulated atrophy

Purpose: To quantify to what extent the new registration method, DARTEL (Diffeomorphic Anatomical Registration Through Exponentiated Lie Algebra), may reduce the smoothing kernel width required and investigate the minimum group size necessary for voxel-based morphometry (VBM) studies. Materials and Methods: A simulated atrophy approach was employed to explore the role of smoothing kernel, group size, and their interactions on VBM detection accuracy. Group sizes of 10, 15, 25, and 50 were compared for kernels between 0–12 mm. Results: A smoothing kernel of 6 mm achieved the highest atrophy detection accuracy for groups with 50 participants and 8–10 mm for the groups of 25 at P < 0.05 with familywise correction. The results further demonstrated that a group size of 25 was the lower limit when two different groups of participants were compared, whereas a group size of 15 was the minimum for longitudinal comparisons but at P < 0.05 with false discovery rate correction. Conclusion: Our data confirmed DARTEL-based VBM generally benefits from smaller kernels and different kernels perform best for different group sizes with a tendency of smaller kernels for larger groups. Importantly, the kernel selection was also affected by the threshold applied. This highlighted that the choice of kernel in relation to group size should be considered with care.

Mode-specificity and transition state-specific energy redistribution in the chemisorption of CH4 on Ni{100}

We have investigated methane (CH4) dissociative chemisorption on the Ni{100} surface by first-principles molecular dynamics (MD) simulations. Our results show that this reaction is mode-specific, with the n1 state being the most strongly coupled to efficient energy flow into the reaction coordinate when the molecule reaches the transition state. By performing MD simulations for two different transition state (TS) structures we provide evidence of TS structure-specific energy redistribution in methane chemisorption. Our results are compared with recently reported state-resolved measurement of methane adsorption probability on nickel surfaces, and we find that a strong correlation exists between the highest vibrational efficacy measured on Ni{100} for the n1 state and the calculated highest fractional vibrational energy content in this mode.

Bond-selective energy redistribution in the chemisorption of CH3D and CD3H on Pt{1 1 0}-(1 2): a first-principles molecular dynamics study

We have investigated the chemisorption of CH3D and CD3H on Pt{11 0}-(1 2) by performing first-principles molecular dynamics simulations of the recombinative desorption of CH3D (from adsorbed methyl and deuterium) and of CD3H (from adsorbed trideuteromethyl and hydrogen). Vibrational analysis of the symmetry adapted internal coordinates of the desorbing molecules shows that excitation of the single C– D (C–H) bond in the parent molecule is strongly correlated with energy excess in the reaction coordinate. The results of the molecular dynamics simulations are consistent with observed mode- and bond-specific reactivity measurements for chemisorption of methane and its isotopomers on platinum and nickel surfaces.

Fast three dimensional r-adaptive mesh redistribution

This paper describes a fast and reliable method for redistributing a computational mesh in three dimensions which can generate a complex three dimensional mesh without any problems due to mesh tangling. The method relies on a three dimensional implementation of the parabolic Monge–Ampère (PMA) technique, for finding an optimally transported mesh. The method for implementing PMA is described in detail and applied to both static and dynamic mesh redistribution problems, studying both the convergence and the computational cost of the algorithm. The algorithm is applied to a series of problems of increasing complexity. In particular very regular meshes are generated to resolve real meteorological features (derived from a weather forecasting model covering the UK area) in grids with over 2×107 degrees of freedom. The PMA method computes these grids in times commensurate with those required for operational weather forecasting.