Crystal structures of open and closed forms of D-serine deaminase from Salmonella typhimurium - implications on substrate specificity and catalysis

Metabolism of D-amino acids is of considerable interest due to their key importance in cell structure and function. Salmonella typhimurium D-serine deaminase (StDSD) is a pyridoxal 5' phosphate (PLP) dependent enzyme that catalyses degradation of D-Ser to pyruvate and ammonia. The first crystal structure of D-serine deaminase described here reveals a typical Foldtype II or tryptophan synthase beta subunit fold of PLP-dependent enzymes. Although holoenzyme was used for crystallization of both wild-type StDSD (WtDSD) and selenomethionine labelled StDSD (SeMetDSD), significant electron density was not observed for the cofactor, indicating that the enzyme has a low affinity for the cofactor under crystallization conditions. Interestingly, unexpected conformational differences were observed between the two structures. The WtDSD was in an open conformation while SeMetDSD, crystallized in the presence of isoserine, was in a closed conformation suggesting that the enzyme is likely to undergo conformational changes upon binding of substrate as observed in other Foldtype II PLP-dependent enzymes. Electron density corresponding to a plausible sodium ion was found near the active site of the closed but not in the open state of the enzyme. Examination of the active site and substrate modelling suggests that Thr166 may be involved in abstraction of proton from the C alpha atom of the substrate. Apart from the physiological reaction, StDSD catalyses a, b elimination of D-Thr, D-Allothr and L-Ser to the corresponding alpha-keto acids and ammonia. The structure of StDSD provides a molecular framework necessary for understanding differences in the rate of reaction with these substrates.

Processing of EEG Signals for Study of Coupling in Brain Regions for Eyes Open and Eyes Closed Conditions

This paper deals with processing the EEG signals obtained from 16 spatially arranged electrodes to measure coupling or synchrony between the frontal, parietal, occipital and temporal lobes of the cerebrum under the eyes open and eyes closed conditions. This synchrony was measured using magnitude squared coherence, Short Time Fourier Transform and wavelet based coherences. We found a pattern in the time-frequency coherence as we moved from the nasion to the inion of the subject's head. The coherence pattern obtained from the wavelet approach was found to be far more capable of picking up peaks in coherence with respect to frequency when compared to the regular Fourier based coherence. We detected high synchrony between frontal polar electrodes that is missing in coherence plots between other electrode pairs. The study has potential applications in healthcare.

A coupled discriminative dictionary and transformation learning approach with applications to cross domain matching

Cross domain and cross-modal matching has many applications in the field of computer vision and pattern recognition. A few examples are heterogeneous face recognition, cross view action recognition, etc. This is a very challenging task since the data in two domains can differ significantly. In this work, we propose a coupled dictionary and transformation learning approach that models the relationship between the data in both domains. The approach learns a pair of transformation matrices that map the data in the two domains in such a manner that they share common sparse representations with respect to their own dictionaries in the transformed space. The dictionaries for the two domains are learnt in a coupled manner with an additional discriminative term to ensure improved recognition performance. The dictionaries and the transformation matrices are jointly updated in an iterative manner. The applicability of the proposed approach is illustrated by evaluating its performance on different challenging tasks: face recognition across pose, illumination and resolution, heterogeneous face recognition and cross view action recognition. Extensive experiments on five datasets namely, CMU-PIE, Multi-PIE, ChokePoint, HFB and IXMAS datasets and comparisons with several state-of-the-art approaches show the effectiveness of the proposed approach. (C) 2015 Elsevier B.V. All rights reserved.

A coupled discriminative dictionary and transformation learning approach with applications to cross domain matching

Cross domain and cross-modal matching has many applications in the field of computer vision and pattern recognition. A few examples are heterogeneous face recognition, cross view action recognition, etc. This is a very challenging task since the data in two domains can differ significantly. In this work, we propose a coupled dictionary and transformation learning approach that models the relationship between the data in both domains. The approach learns a pair of transformation matrices that map the data in the two domains in such a manner that they share common sparse representations with respect to their own dictionaries in the transformed space. The dictionaries for the two domains are learnt in a coupled manner with an additional discriminative term to ensure improved recognition performance. The dictionaries and the transformation matrices are jointly updated in an iterative manner. The applicability of the proposed approach is illustrated by evaluating its performance on different challenging tasks: face recognition across pose, illumination and resolution, heterogeneous face recognition and cross view action recognition. Extensive experiments on five datasets namely, CMU-PIE, Multi-PIE, ChokePoint, HFB and IXMAS datasets and comparisons with several state-of-the-art approaches show the effectiveness of the proposed approach. (C) 2015 Elsevier B.V. All rights reserved.

Single-machine scheduling with past-sequence-dependent setup times and learning effects: a parametric analysis

In this article, we consider the single-machine scheduling problem with past-sequence-dependent (p-s-d) setup times and a learning effect. The setup times are proportional to the length of jobs that are already scheduled; i.e. p-s-d setup times. The learning effect reduces the actual processing time of a job because the workers are involved in doing the same job or activity repeatedly. Hence, the processing time of a job depends on its position in the sequence. In this study, we consider the total absolute difference in completion times (TADC) as the objective function. This problem is denoted as 1/LE, (Spsd)/TADC in Kuo and Yang (2007) ('Single Machine Scheduling with Past-sequence-dependent Setup Times and Learning Effects', Information Processing Letters, 102, 22-26). There are two parameters a and b denoting constant learning index and normalising index, respectively. A parametric analysis of b on the 1/LE, (Spsd)/TADC problem for a given value of a is applied in this study. In addition, a computational algorithm is also developed to obtain the number of optimal sequences and the range of b in which each of the sequences is optimal, for a given value of a. We derive two bounds b* for the normalising constant b and a* for the learning index a. We also show that, when a < a* or b > b*, the optimal sequence is obtained by arranging the longest job in the first position and the rest of the jobs in short processing time order.