Network properties of decoys and CASP predicted models: a comparison with native protein structures

Protein structure space is believed to consist of a finite set of discrete folds, unlike the protein sequence space which is astronomically large, indicating that proteins from the available sequence space are likely to adopt one of the many folds already observed. In spite of extensive sequence-structure correlation data, protein structure prediction still remains an open question with researchers having tried different approaches (experimental as well as computational). One of the challenges of protein structure prediction is to identify the native protein structures from a milieu of decoys/models. In this work, a rigorous investigation of Protein Structure Networks (PSNs) has been performed to detect native structures from decoys/ models. Ninety four parameters obtained from network studies have been optimally combined with Support Vector Machines (SVM) to derive a general metric to distinguish decoys/models from the native protein structures with an accuracy of 94.11%. Recently, for the first time in the literature we had shown that PSN has the capability to distinguish native proteins from decoys. A major difference between the present work and the previous study is to explore the transition profiles at different strengths of non-covalent interactions and SVM has indeed identified this as an important parameter. Additionally, the SVM trained algorithm is also applied to the recent CASP10 predicted models. The novelty of the network approach is that it is based on general network properties of native protein structures and that a given model can be assessed independent of any reference structure. Thus, the approach presented in this paper can be valuable in validating the predicted structures. A web-server has been developed for this purpose and is freely available at http://vishgraph.mbu.iisc.ernet.in/GraProStr/PSN-QA.html.

Scalable sequential alternating proximal methods for sparse structural SVMs and CRFs

Structural Support Vector Machines (SSVMs) and Conditional Random Fields (CRFs) are popular discriminative methods used for classifying structured and complex objects like parse trees, image segments and part-of-speech tags. The datasets involved are very large dimensional, and the models designed using typical training algorithms for SSVMs and CRFs are non-sparse. This non-sparse nature of models results in slow inference. Thus, there is a need to devise new algorithms for sparse SSVM and CRF classifier design. Use of elastic net and L1-regularizer has already been explored for solving primal CRF and SSVM problems, respectively, to design sparse classifiers. In this work, we focus on dual elastic net regularized SSVM and CRF. By exploiting the weakly coupled structure of these convex programming problems, we propose a new sequential alternating proximal (SAP) algorithm to solve these dual problems. This algorithm works by sequentially visiting each training set example and solving a simple subproblem restricted to a small subset of variables associated with that example. Numerical experiments on various benchmark sequence labeling datasets demonstrate that the proposed algorithm scales well. Further, the classifiers designed are sparser than those designed by solving the respective primal problems and demonstrate comparable generalization performance. Thus, the proposed SAP algorithm is a useful alternative for sparse SSVM and CRF classifier design.

Large-Scale Elastic Net Regularized Linear Classification SVMs and Logistic Regression

Elastic Net Regularizers have shown much promise in designing sparse classifiers for linear classification. In this work, we propose an alternating optimization approach to solve the dual problems of elastic net regularized linear classification Support Vector Machines (SVMs) and logistic regression (LR). One of the sub-problems turns out to be a simple projection. The other sub-problem can be solved using dual coordinate descent methods developed for non-sparse L2-regularized linear SVMs and LR, without altering their iteration complexity and convergence properties. Experiments on very large datasets indicate that the proposed dual coordinate descent - projection (DCD-P) methods are fast and achieve comparable generalization performance after the first pass through the data, with extremely sparse models.

RAPID HUMAN ACTION RECOGNITION IN H.264/AVC COMPRESSED DOMAIN FOR VIDEO SURVEILLANCE

This paper discusses a novel high-speed approach for human action recognition in H. 264/AVC compressed domain. The proposed algorithm utilizes cues from quantization parameters and motion vectors extracted from the compressed video sequence for feature extraction and further classification using Support Vector Machines (SVM). The ultimate goal of our work is to portray a much faster algorithm than pixel domain counterparts, with comparable accuracy, utilizing only the sparse information from compressed video. Partial decoding rules out the complexity of full decoding, and minimizes computational load and memory usage, which can effect in reduced hardware utilization and fast recognition results. The proposed approach can handle illumination changes, scale, and appearance variations, and is robust in outdoor as well as indoor testing scenarios. We have tested our method on two benchmark action datasets and achieved more than 85% accuracy. The proposed algorithm classifies actions with speed (>2000 fps) approximately 100 times more than existing state-of-the-art pixel-domain algorithms.

Prediction of Queue Waiting Times for Metascheduling on Parallel Batch Systems

Prediction of queue waiting times of jobs submitted to production parallel batch systems is important to provide overall estimates to users and can also help meta-schedulers make scheduling decisions. In this work, we have developed a framework for predicting ranges of queue waiting times for jobs by employing multi-class classification of similar jobs in history. Our hierarchical prediction strategy first predicts the point wait time of a job using dynamic k-Nearest Neighbor (kNN) method. It then performs a multi-class classification using Support Vector Machines (SVMs) among all the classes of the jobs. The probabilities given by the SVM for the class predicted using k-NN and its neighboring classes are used to provide a set of ranges of predicted wait times with probabilities. We have used these predictions and probabilities in a meta-scheduling strategy that distributes jobs to different queues/sites in a multi-queue/grid environment for minimizing wait times of the jobs. Experiments with different production supercomputer job traces show that our prediction strategies can give correct predictions for about 77-87% of the jobs, and also result in about 12% improved accuracy when compared to the next best existing method. Experiments with our meta-scheduling strategy using different production and synthetic job traces for various system sizes, partitioning schemes and different workloads, show that the meta-scheduling strategy gives much improved performance when compared to existing scheduling policies by reducing the overall average queue waiting times of the jobs by about 47%.

A Simple Label Switching Algorithm for Semisupervised Structural SVMs

In structured output learning, obtaining labeled data for real-world applications is usually costly, while unlabeled examples are available in abundance. Semisupervised structured classification deals with a small number of labeled examples and a large number of unlabeled structured data. In this work, we consider semisupervised structural support vector machines with domain constraints. The optimization problem, which in general is not convex, contains the loss terms associated with the labeled and unlabeled examples, along with the domain constraints. We propose a simple optimization approach that alternates between solving a supervised learning problem and a constraint matching problem. Solving the constraint matching problem is difficult for structured prediction, and we propose an efficient and effective label switching method to solve it. The alternating optimization is carried out within a deterministic annealing framework, which helps in effective constraint matching and avoiding poor local minima, which are not very useful. The algorithm is simple and easy to implement. Further, it is suitable for any structured output learning problem where exact inference is available. Experiments on benchmark sequence labeling data sets and a natural language parsing data set show that the proposed approach, though simple, achieves comparable generalization performance.

Compressed domain human action recognition in H.264/AVC video streams

This paper discusses a novel high-speed approach for human action recognition in H.264/AVC compressed domain. The proposed algorithm utilizes cues from quantization parameters and motion vectors extracted from the compressed video sequence for feature extraction and further classification using Support Vector Machines (SVM). The ultimate goal of the proposed work is to portray a much faster algorithm than pixel domain counterparts, with comparable accuracy, utilizing only the sparse information from compressed video. Partial decoding rules out the complexity of full decoding, and minimizes computational load and memory usage, which can result in reduced hardware utilization and faster recognition results. The proposed approach can handle illumination changes, scale, and appearance variations, and is robust to outdoor as well as indoor testing scenarios. We have evaluated the performance of the proposed method on two benchmark action datasets and achieved more than 85 % accuracy. The proposed algorithm classifies actions with speed (> 2,000 fps) approximately 100 times faster than existing state-of-the-art pixel-domain algorithms.

Hybrid Working Set Algorithm for SVM Learning With a Kernel Coprocessor on FPGA

Support vector machines (SVM) are a popular class of supervised models in machine learning. The associated compute intensive learning algorithm limits their use in real-time applications. This paper presents a fully scalable architecture of a coprocessor, which can compute multiple rows of the kernel matrix in parallel. Further, we propose an extended variant of the popular decomposition technique, sequential minimal optimization, which we call hybrid working set (HWS) algorithm, to effectively utilize the benefits of cached kernel columns and the parallel computational power of the coprocessor. The coprocessor is implemented on Xilinx Virtex 7 field-programmable gate array-based VC707 board and achieves a speedup of upto 25x for kernel computation over single threaded computation on Intel Core i5. An application speedup of upto 15x over software implementation of LIBSVM and speedup of upto 23x over SVMLight is achieved using the HWS algorithm in unison with the coprocessor. The reduction in the number of iterations and sensitivity of the optimization time to variation in cache size using the HWS algorithm are also shown.

PEDOT-PSSA as an alternative support for Pt electrodes in PEFCs

Poly (3,4-ethylenedioxythiophene) (PEDOT) and poly (styrene sulphonic acid) (PSSA) supported platinum (Pt) electrodes for application in polymer electrolyte fuel cells (PEFCs) are reported. PEDOT-PSSA support helps Pt particles to be uniformly distributed on to the electrodes, and facilitates mixed electronic and ionic (H+-ion) conduction within the catalyst, ameliorating Pt utilization. The inherent proton conductivity of PEDOT-PSSA composite also helps reducing Nation content in PEFC electrodes. During prolonged operation of PEFCs, Pt electrodes supported onto PEDOT-PSSA composite exhibit lower corrosion in relation to Pt electrodes supported onto commercially available Vulcan XC-72R carbon. Physical properties of PEDOT-PSSA composite have been characterized by X-ray diffraction, Fourier transform infrared spectroscopy, scanning electron microscopy and transmission electron microscopy. PEFCs with PEDOT-PSSA-supported Pt catalyst electrodes offer a peak power-density of 810 mW cm(-2) at a load current-density of 1800 mA cm(-2) with Nation content as low as 5 wt.% in the catalyst layer. Accordingly, the present study provides a novel alternative support for platinized PEFC electrodes.

PEDOT-PSSA as an alternative support for Pt electrodes in PEFCs

Poly (3,4-ethylenedioxythiophene) (PEDOT) and poly (styrene sulphonic acid) (PSSA) supported platinum (Pt) electrodes for application in polymer electrolyte fuel cells (PEFCs) are reported. PEDOT-PSSA support helps Pt particles to be uniformly distributed on to the electrodes, and facilitates mixed electronic and ionic (H+-ion) conduction within the catalyst, ameliorating Pt utilization. The inherent proton conductivity of PEDOT-PSSA composite also helps reducing Nation content in PEFC electrodes. During prolonged operation of PEFCs, Pt electrodes supported onto PEDOT-PSSA composite exhibit lower corrosion in relation to Pt electrodes supported onto commercially available Vulcan XC-72R carbon. Physical properties of PEDOT-PSSA composite have been characterized by X-ray diffraction, Fourier transform infrared spectroscopy, scanning electron microscopy and transmission electron microscopy. PEFCs with PEDOT-PSSA-supported Pt catalyst electrodes offer a peak power-density of 810 mW cm(-2) at a load current-density of 1800 mA cm(-2) with Nation content as low as 5 wt.% in the catalyst layer. Accordingly, the present study provides a novel alternative support for platinized PEFC electrodes

1, 2-Bis (diphenylphosphino) etane bridged dinuclear copper (I) complexes: Investigations of solid state and solution structures by CP/MAS31P NMR spectroscopy, X-ray crystallography, IR spectroscopy and solution 31P NMR and 63Cu NMR spectroscopy

Three different complexes of copper (I) with bridging 1, 2-bis(diphenylphosphino)ethane (dppe), namely [Cu2 (mu-dppe) (CH3CN)6] (ClO4)2 (1), [Cu2 (mu-dppe)2 (CH3 CN)2] (ClO4)2 (2), and [Cu2 (mu-dppe) (dppe)2 (CH3CN)2] (ClO4)2 (3) have been prepared. The structure of [Cu2 (mu-dppe) (dPPe)2 (CH3CH)2] (ClO4)2 has been determined by X-ray crystallography. It crystallizes in the space group PT with a=12.984(6) angstrom, b=13.180(6) angstrom, c=14.001(3) angstrom, alpha=105.23(3), beta=105.60(2), gamma=112.53 (4), V=1944 (3) angstrom3, and Z=1. The structure was refined by least-squares method with R=0.0365; R(w)=0.0451 for 6321 reflections with F0 greater-than-or-equal-to 3 sigma (F0). The CP/MAS P-31 and IR spectra of the complexes have been analysed in the light of available crystallographic data. IR spectroscopy is particularly helpful in identifying the presence of chelating dppe. P-31 chemical shifts observed in solid state are very different from those observed in solution, and change significantly with slight changes in structure. In solution, complex 1 remains undissociated but complexes 2 and 3 undergo extensive dissociation. With a combination of room temperature H-1, Cu-63, and variable temperature P-31 NMR spectra, it is possible to understand the various processes occurring in solution.

Concise row-pruning algorithm to invert a matrix

Presented here, in a vector formulation, is an O(mn2) direct concise algorithm that prunes/identifies the linearly dependent (ld) rows of an arbitrary m X n matrix A and computes its reflexive type minimum norm inverse A(mr)-, which will be the true inverse A-1 if A is nonsingular and the Moore-Penrose inverse A+ if A is full row-rank. The algorithm, without any additional computation, produces the projection operator P = (I - A(mr)- A) that provides a means to compute any of the solutions of the consistent linear equation Ax = b since the general solution may be expressed as x = A(mr)+b + Pz, where z is an arbitrary vector. The rank r of A will also be produced in the process. Some of the salient features of this algorithm are that (i) the algorithm is concise, (ii) the minimum norm least squares solution for consistent/inconsistent equations is readily computable when A is full row-rank (else, a minimum norm solution for consistent equations is obtainable), (iii) the algorithm identifies ld rows, if any, and reduces concerned computation and improves accuracy of the result, (iv) error-bounds for the inverse as well as the solution x for Ax = b are readily computable, (v) error-free computation of the inverse, solution vector, rank, and projection operator and its inherent parallel implementation are straightforward, (vi) it is suitable for vector (pipeline) machines, and (vii) the inverse produced by the algorithm can be used to solve under-/overdetermined linear systems.

Anomalous X-ray scattering study of local structures in the superionic conducting class (CuI)(0.3)(Cu2O)(0.35)(MoO3)(0.35)

The anomalous X-ray scattering (AXS) method using Cu and Mo K absorption edges has been employed for obtaining the local structural information of superionic conducting glass having the composition (CuI)(0.3)(Cu2O)(0.35)(MoO3)(0.35). The possible atomic arrangements in near-neighbor region of this glass were estimated by coupling the results with the least-squares analysis so as to reproduce two differential intensity profiles for Cu and Mo as well as the ordinary scattering profile. The coordination number of oxygen around Mo is found to be 6.1 at the distance of 0.187 nm. This implies that the MoO6 octahedral unit is a more probable structural entity in the glass rather than MoO4 tetrahedra which has been proposed based on infrared spectroscopy. The pre-peak shoulder observed at about 10 nm(-1) may be attributed to density fluctuation originating from the MoO6 octahedral units connected with the corner sharing linkage, in which the correlation length is about 0.8 nm. The value of the coordination number of I- around Cu+ is estimated as 4.3 at 0.261 nm, suggesting an arrangement similar to that in molten CuI.

Local environmental structures of Mo in the superionic conducting glass (AgI)(0.6)(Ag2MoO4)(0.4) by anomalous X-ray scattering

The anomalous X-ray scattering (AXS) method using Mo K absorption edges has been employed for obtaining the local structural information of superionic conducting glass having the composition (AgI)(0.6)(Ag2MoO4)(0.4). The possible atomic arrangements in the near-neighbor region of this glass were estimated by coupling the results with the least-squares variational analysis so as to reproduce the differential intensity profile for Mo as well as the ordinary scattering profile. The coordination number of oxygen around Mo is found to be about 4 at the distance of 0.180 mn. This implies that the most probable structural entity in the glass is the MoO4 tetrahedral unit which has been proposed based on infrared spectroscopy. The value of the coordination number of I- around Ag+ is estimated as 4.4 at 0.287 nm, suggesting an arrangement similar to that of crystalline or molten AgI.

Non-covalent C-Cl center dot center dot center dot pi interaction in acetylene-carbon tetrachloride adducts: Matrix isolation infrared and ab initio computational studies

Non-covalent halogen-bonding interactions between n cloud of acetylene (C2H2) and chlorine atom of carbon tetrachloride (CCl4) have been investigated using matrix isolation infrared spectroscopy and quantum chemical computations. The structure and the energies of the 1:1 C2H2-CCl4 adducts were computed at the B3LYP, MP2 and M05-2X levels of theory using 6-311++G(d,p) basis set. The computations indicated two minima for the 1:1 C2H2-CCl4 adducts; with the C-Cl center dot center dot center dot pi adduct being the global minimum, where pi cloud of C2H2 is the electron donor. The second minimum corresponded to a C-H...Cl adduct, in which C2H2 is the proton donor. The interaction energies for the adducts A and B were found to be nearly identical. Experimentally, both C-Cl center dot center dot center dot pi and C-H center dot center dot center dot Cl adducts were generated in Ar and N2 matrixes and characterized using infrared spectroscopy. This is the first report on halogen bonded adduct, stabilized through C-Cl center dot center dot center dot pi interaction being identified at low temperatures using matrix isolation infrared spectroscopy. Atoms in Molecules (AIM) and Natural Bond Orbital (NBO) analyses were performed to support the experimental results. The structures of 2:1 ((C2H2)(2)-CCl4) and 1:2 (C2H2-(CCl4)(2)) multimers and their identification in the low temperature matrixes were also discussed. (C) 2015 Elsevier B.V. All rights reserved.