Statistical deconvolution of enthalpic energetic contributions to MHC-peptide binding affinity

Background: MHC Class I molecules present antigenic peptides to cytotoxic T cells, which forms an integral part of the adaptive immune response. Peptides are bound within a groove formed by the MHC heavy chain. Previous approaches to MHC Class I-peptide binding prediction have largely concentrated on the peptide anchor residues located at the P2 and C-terminus positions. Results: A large dataset comprising MHC-peptide structural complexes was created by remodelling pre-determined x-ray crystallographic structures. Static energetic analysis, following energy minimisation, was performed on the dataset in order to characterise interactions between bound peptides and the MHC Class I molecule, partitioning the interactions within the groove into van der Waals, electrostatic and total non-bonded energy contributions. Conclusion: The QSAR techniques of Genetic Function Approximation (GFA) and Genetic Partial Least Squares (G/PLS) algorithms were used to identify key interactions between the two molecules by comparing the calculated energy values with experimentally-determined BL50 data. Although the peptide termini binding interactions help ensure the stability of the MHC Class I-peptide complex, the central region of the peptide is also important in defining the specificity of the interaction. As thermodynamic studies indicate that peptide association and dissociation may be driven entropically, it may be necessary to incorporate entropic contributions into future calculations.

Correlation-type structure activity relationships for the kinetics of gas-phase RO2 self-reactions and reaction with HO2

Structure activity relationships (SARs) are presented for the gas-phase reactions of RO2 with HO2, and the self- and cross-reactions of RO2. For RO2+HO2 the SAR is based upon a correlation between the logarithm of the measured rate coefficient and a calculated ionisation potential for the molecule R-CH=CH2, R being the same group in both the radical and molecular analogue. The correlation observed is strong and only for one RO2 species does the measured rate coefficient deviate by more than a factor of two from the linear least-squares regression line. For the self- and cross-reactions of RO2 radicals, the SAR is based upon a correlation between the logarithm of the measured rate coefficient and the calculated electrostatic potential (ESP) at the equivalent carbon atom in the RH molecule to which oxygen is attached in RO2, again R being the same group in the molecule and the radical. For cases where R is a simple alkyl-group, a strong linear correlation observed. For RO2 radicals which contain lone pair-bearing substituents and for which the calculated ESP<-0.05 self-reaction rate coefficients appear to be insensitive to the value of the ESP. For RO2 of this type with ESP>-0.05 a linear relationship between log k and the ESP is again observed. Using the relationships, 84 out of the 85 rate coefficients used to develop the SARs are predicted to within a factor of three of their measured values. A relationship is also presented that allows the prediction of the Arrhenius parameters for the self-reactions of simple alkyl RO2 radicals. On the basis of the correlations, predictions of room-temperature rate coefficients are made for a number of atmospherically important peroxyl-peroxyl radical reactions. (C) 2003 Elsevier Ltd. All rights reserved.

Quantitative pulsed phase thermography applied to steel plates

Pulsed Phase Thermography (PPT) has been proven effective on depth retrieval of flat-bottomed holes in different materials such as plastics and aluminum. In PPT, amplitude and phase delay signatures are available following data acquisition (carried out in a similar way as in classical Pulsed Thermography), by applying a transformation algorithm such as the Fourier Transform (FT) on thermal profiles. The authors have recently presented an extended review on PPT theory, including a new inversion technique for depth retrieval by correlating the depth with the blind frequency fb (frequency at which a defect produce enough phase contrast to be detected). An automatic defect depth retrieval algorithm had also been proposed, evidencing PPT capabilities as a practical inversion technique. In addition, the use of normalized parameters to account for defect size variation as well as depth retrieval from complex shape composites (GFRP and CFRP) are currently under investigation. In this paper, steel plates containing flat-bottomed holes at different depths (from 1 to 4.5 mm) are tested by quantitative PPT. Least squares regression results show excellent agreement between depth and the inverse square root blind frequency, which can be used for depth inversion. Experimental results on steel plates with simulated corrosion are presented as well. It is worth noting that results are improved by performing PPT on reconstructed (synthetic) rather than on raw thermal data.

Relationships between gluten rheological properties and hearth loaf characteristics

The rheological properties of fresh gluten in small amplitude oscillation in shear (SAOS) and creep recovery after short application of stress was related to the hearth breadbaking performance of wheat flours using the multivariate statistics partial least squares (PLS) regression. The picture was completed by dough mixing and extensional properties, flour protein size distribution determined by SE-HPLC, and high molecular weight glutenin subunit (HMW-GS) composition. The sample set comprised 20 wheat cultivars grown at two different levels of nitrogen fertilizer in one location. Flours yielding stiffer and more elastic glutens, with higher elastic and viscous moduli (G' and G") and lower tan 8 values in SAOS, gave doughs that were better able to retain their shape during proving and baking, resulting in breads of high form ratios. Creep recovery measurements after short application of stress showed that glutens from flours of good breadmaking quality had high relative elastic recovery. The nitrogen fertilizer level affected the protein size distribution by an increase in monomeric proteins (gliadins), which gave glutens of higher tan delta and flatter bread loaves (lower form ratio).

Wheat protein quality in relation to baking performance evaluated by the Chorleywood bread process and a hearth bread baking test

The relationships between wheat protein quality and baking properties of 20 flour samples were studied for two breadmaking processes; a hearth bread test and the Chorleywood Bread Process (CBP). The strain hardening index obtained from dough inflation measurements, the proportion of unextractable polymeric protein, and mixing properties were among the variables found to be good indicators of protein quality and suitable for predicting potential baking quality of wheat flours. By partial least squares regression, flour and dough test variables were able to account for 71-93% of the variation in crumb texture, form ratio and volume of hearth loaves made using optimal mixing and fixed proving times. These protein quality variables were, however, not related to the volume of loaves produced by the CBP using mixing to constant work input and proving to constant height. On the other hand, variation in crumb texture of CBP loaves (54-55%) could be explained by protein quality. The results underline that the choice of baking procedure and loaf characteristics is vital in assessing the protein quality of flours. (C) 2003 Elsevier Ltd. All rights reserved.

Cytenamide acetic acid solvate

In the crystal structure of the title compound (systematic name: 5H-dibenzo[a,d]cycloheptatriene-5-carboxamide ethanoic acid solvate), C16H13NO center dot C2H4O2, the cytenamide and solvent molecules form a hydrogen-bonded R-2(2)(8) dimer motif, which is further connected to form a centrosymmetric double ring motif arrangement. The cycloheptene ring adopts a boat conformation and the dihedral angle between the least-squares planes through the two aromatic rings is 54.7 (2)degrees.

Texture segmentation in Williams syndrome

Williams syndrome (WS) is a developmental disorder in which visuo-spatial cognition is poor relative to verbal ability. At the level of visuo-spatial perception, individuals with WS can perceive both the local and global aspects of an image. However, the manner in which local elements are integrated into a global whole is atypical, with relative strengths in integration by luminance, closure, and alignment compared to shape, orientation and proximity. The present study investigated the manner in which global images are segmented into local parts. Segmentation by seven gestalt principles was investigated: proximity, shape, luminance, orientation, closure, size (and alignment: Experiment I only). Participants were presented with uniform texture squares and asked to detect the presence of a discrepant patch (Experiment 1) or to identify the form of a discrepant patch as a capital E or H (Experiment 2). In Experiment 1, the pattern and level of performance of the WS group did not differ from that of typically developing controls, and was commensurate with the general level of non-verbal ability observed in WS. These results were replicated in Experiment 2, with the exception of segmentation by proximity, where individuals with WS demonstrated superior performance relative to the remaining segmentation types. Overall, the results suggest that, despite some atypical aspects of visuo-spatial perception in WS, the ability to segment a global form into parts is broadly typical in this population. In turn, this informs predictions of brain function in WS, particularly areas V1 and V4. (c) 2006 Elsevier Ltd. All rights reserved.

Robust identification for linear-in-the-parameters models

In this paper new robust nonlinear model construction algorithms for a large class of linear-in-the-parameters models are introduced to enhance model robustness, including three algorithms using combined A- or D-optimality or PRESS statistic (Predicted REsidual Sum of Squares) with regularised orthogonal least squares algorithm respectively. A common characteristic of these algorithms is that the inherent computation efficiency associated with the orthogonalisation scheme in orthogonal least squares or regularised orthogonal least squares has been extended such that the new algorithms are computationally efficient. A numerical example is included to demonstrate effectiveness of the algorithms. Copyright (C) 2003 IFAC.

An on-line algorithm of uncertain time delay estimation in a continuous system

In this paper, we present an on-line estimation algorithm for an uncertain time delay in a continuous system based on the observational input-output data, subject to observational noise. The first order Pade approximation is used to approximate the time delay. At each time step, the algorithm combines the well known Kalman filter algorithm and the recursive instrumental variable least squares (RIVLS) algorithm in cascade form. The instrumental variable least squares algorithm is used in order to achieve the consistency of the delay parameter estimate, since an error-in-the-variable model is involved. An illustrative example is utilized to demonstrate the efficacy of the proposed approach.

Sparse kernel modelling: a unified approach

A unified approach is proposed for sparse kernel data modelling that includes regression and classification as well as probability density function estimation. The orthogonal-least-squares forward selection method based on the leave-one-out test criteria is presented within this unified data-modelling framework to construct sparse kernel models that generalise well. Examples from regression, classification and density estimation applications are used to illustrate the effectiveness of this generic sparse kernel data modelling approach.

Grey-box radial basis function modelling: the art of incorporating prior knowledge

A basic principle in data modelling is to incorporate available a priori information regarding the underlying data generating mechanism into the modelling process. We adopt this principle and consider grey-box radial basis function (RBF) modelling capable of incorporating prior knowledge. Specifically, we show how to explicitly incorporate the two types of prior knowledge: the underlying data generating mechanism exhibits known symmetric property and the underlying process obeys a set of given boundary value constraints. The class of orthogonal least squares regression algorithms can readily be applied to construct parsimonious grey-box RBF models with enhanced generalisation capability.

A tunable radial basis function model for nonlinear system identification using particle swarm optimisation

A tunable radial basis function (RBF) network model is proposed for nonlinear system identification using particle swarm optimisation (PSO). At each stage of orthogonal forward regression (OFR) model construction, PSO optimises one RBF unit's centre vector and diagonal covariance matrix by minimising the leave-one-out (LOO) mean square error (MSE). This PSO aided OFR automatically determines how many tunable RBF nodes are sufficient for modelling. Compared with the-state-of-the-art local regularisation assisted orthogonal least squares algorithm based on the LOO MSE criterion for constructing fixed-node RBF network models, the PSO tuned RBF model construction produces more parsimonious RBF models with better generalisation performance and is computationally more efficient.

Nonlinear system identification using particle swarm optimisation tuned radial basis function models

A novel particle swarm optimisation (PSO) tuned radial basis function (RBF) network model is proposed for identification of non-linear systems. At each stage of orthogonal forward regression (OFR) model construction process, PSO is adopted to tune one RBF unit's centre vector and diagonal covariance matrix by minimising the leave-one-out (LOO) mean square error (MSE). This PSO aided OFR automatically determines how many tunable RBF nodes are sufficient for modelling. Compared with the-state-of-the-art local regularisation assisted orthogonal least squares algorithm based on the LOO MSE criterion for constructing fixed-node RBF network models, the PSO tuned RBF model construction produces more parsimonious RBF models with better generalisation performance and is often more efficient in model construction. The effectiveness of the proposed PSO aided OFR algorithm for constructing tunable node RBF models is demonstrated using three real data sets.

Sparse multioutput radial basis function network construction using combined locally regularised orthogonal least square and D-optimality experimental design

A construction algorithm for multioutput radial basis function (RBF) network modelling is introduced by combining a locally regularised orthogonal least squares (LROLS) model selection with a D-optimality experimental design. The proposed algorithm aims to achieve maximised model robustness and sparsity via two effective and complementary approaches. The LROLS method alone is capable of producing a very parsimonious RBF network model with excellent generalisation performance. The D-optimality design criterion enhances the model efficiency and robustness. A further advantage of the combined approach is that the user only needs to specify a weighting for the D-optimality cost in the combined RBF model selecting criterion and the entire model construction procedure becomes automatic. The value of this weighting does not influence the model selection procedure critically and it can be chosen with ease from a wide range of values.

Sparse modeling using orthogonal forward regression with PRESS statistic and regularization

The paper introduces an efficient construction algorithm for obtaining sparse linear-in-the-weights regression models based on an approach of directly optimizing model generalization capability. This is achieved by utilizing the delete-1 cross validation concept and the associated leave-one-out test error also known as the predicted residual sums of squares (PRESS) statistic, without resorting to any other validation data set for model evaluation in the model construction process. Computational efficiency is ensured using an orthogonal forward regression, but the algorithm incrementally minimizes the PRESS statistic instead of the usual sum of the squared training errors. A local regularization method can naturally be incorporated into the model selection procedure to further enforce model sparsity. The proposed algorithm is fully automatic, and the user is not required to specify any criterion to terminate the model construction procedure. Comparisons with some of the existing state-of-art modeling methods are given, and several examples are included to demonstrate the ability of the proposed algorithm to effectively construct sparse models that generalize well.