Electrochemical studies of polyaniline in a gel polymer electrolyte - High energy and high power characteristics of a solid-state redox supercapacitor

Studies on redox supercapacitors employing electronically conducting polymers are of great importance for hybrid power sources and pulse power applications. In the present study, polyaniline (PANI) has been potentiodynamically deposited on stainless steel substrate and characterized in a gel polymer electrolyte (GPE). Use of the GPE facilitates a voltage limit of the capacitor to 1 V, instead of 0.75 V in aqueous electrolytes. From charge-discharge studies of the solid-state PANI capacitors, a specific capacitance of 250 F g(-1) has been obtained at a specific power of 7.5 kW kg(-1) of PANI. The values of specific capacitance and specific power are considerably higher than those reported in the literature. High energy and high power characteristics of the PANI are presented. (C) 2002 The Electrochemical Society.

Quantum heat engines: A thermodynamic analysis of power and efficiency

We show that the operation and the output power of a quantum heat engine that converts incoherent thermal energy into coherent cavity photons can be optimized by manipulating quantum coherences. The gain or loss in the efficiency at maximum power depends on the details of the output power optimization. Quantum effects tend to enhance the output power and the efficiency as the photon occupation in the cavity is decreased.

Duty cycling and power management with a network of energy harvesting sensors

In this paper, we study duty cycling and power management in a network of energy harvesting sensor (EHS) nodes. We consider a one-hop network, where K EHS nodes send data to a destination over a wireless fading channel. The goal is to find the optimum duty cycling and power scheduling across the nodes that maximizes the average sum data rate, subject to energy neutrality at each node. We adopt a two-stage approach to simplify the problem. In the inner stage, we solve the problem of optimal duty cycling of the nodes, subject to the short-term power constraint set by the outer stage. The outer stage sets the short-term power constraints on the inner stage to maximize the long-term expected sum data rate, subject to long-term energy neutrality at each node. Albeit suboptimal, our solutions turn out to have a surprisingly simple form: the duty cycle allotted to each node by the inner stage is simply the fractional allotted power of that node relative to the total allotted power. The sum power allotted is a clipped version of the sum harvested power across all the nodes. The average sum throughput thus ultimately depends only on the sum harvested power and its statistics. We illustrate the performance improvement offered by the proposed solution compared to other naive schemes via Monte-Carlo simulations.

Tethering preferences of domain families co-occurring in multi-domain proteins

Genomic data of several organisms have revealed the presence of a vast repertoire of multi-domain proteins. The role played by individual domains in a multi-domain protein has a profound influence on the overall function of the protein. In the present analysis an attempt has been made to better understand the tethering preferences of domain families that occur in multi-domain proteins. The analysis has been carried out on an exhaustive dataset of 2 961 898 sequences of proteins from 930 organisms, where 741 274 proteins are comprised of at least two domain families. For every domain family, the number of other domain families with which it co-occurs within a protein in this dataset has been enumerated and is referred to as the tethering number of the domain family. It was found that, in the general dataset, the AAA ATPase family and the family of Ser/Thr kinases have the highest tethering numbers of 450 and 444 respectively. Further analysis reveals significant correlation between the number of members in a family and its tethering number. Positive correlation was also observed for the extent of a sequence and functional diversity within a family and the tethering numbers of domain families. Domain families that are present ubiquitously in diverse organisms tend to have large tethering numbers, while organism/kingdom-specific families have low tethering numbers. Thus, the analysis uncovers how domain families recombine and evolve to give rise to multi-domain proteins.

Understanding the role of domain-domain linkers in the spatial orientation of domains in multi-domain proteins

Inter-domain linkers (IDLs)' bridge flanking domains and support inter-domain communication in multi-domain proteins. Their sequence and conformational preferences enable them to carry out varied functions. They also provide sufficient flexibility to facilitate domain motions and, in conjunction with the interacting interfaces, they also regulate the inter-domain geometry (IDG). In spite of the basic intuitive understanding of the inter-domain orientations with respect to linker conformations and interfaces, we still do not entirely understand the precise relationship among the three. We show that IDG is evolutionarily well conserved and is constrained by the domain-domain interface interactions. The IDLs modulate the interactions by varying their lengths, conformations and local structure, thereby affecting the overall IDG. Results of our analysis provide guidelines in modelling of multi-domain proteins from the tertiary structures of constituent domain components.

Accurate prediction of interfacial residues in two-domain proteins using evolutionary information: Implications for three-dimensional modeling

With the preponderance of multidomain proteins in eukaryotic genomes, it is essential to recognize the constituent domains and their functions. Often function involves communications across the domain interfaces, and the knowledge of the interacting sites is essential to our understanding of the structure-function relationship. Using evolutionary information extracted from homologous domains in at least two diverse domain architectures (single and multidomain), we predict the interface residues corresponding to domains from the two-domain proteins. We also use information from the three-dimensional structures of individual domains of two-domain proteins to train naive Bayes classifier model to predict the interfacial residues. Our predictions are highly accurate (approximate to 85%) and specific (approximate to 95%) to the domain-domain interfaces. This method is specific to multidomain proteins which contain domains in at least more than one protein architectural context. Using predicted residues to constrain domain-domain interaction, rigid-body docking was able to provide us with accurate full-length protein structures with correct orientation of domains. We believe that these results can be of considerable interest toward rational protein and interaction design, apart from providing us with valuable information on the nature of interactions. Proteins 2014; 82:1219-1234. (c) 2013 Wiley Periodicals, Inc.

Coordination of Reactive Power in Grid-Connected Wind Farms for Voltage Stability Enhancement

This paper studies the feasibility of utilizing the reactive power of grid-connected variable-speed wind generators to enhance the steady-state voltage stability margin of the system. Allowing wind generators to work at maximum reactive power limit may cause the system to operate near the steady-state stability limit, which is undesirable. This necessitates proper coordination of reactive power output of wind generators with other reactive power controllers in the grid. This paper presents a trust region framework for coordinating reactive output of wind generators-with other reactive sources for voltage stability enhancement. Case studies on 418-bus equivalent system of Indian southern grid indicates the effectiveness of proposed methodology in enhancing the steady-state voltage stability margin.

Rainbow Connection Number of Graph Power and Graph Products

Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same (note that the coloring need not be proper). In this paper we study the rainbow connection number with respect to three important graph product operations (namely the Cartesian product, the lexicographic product and the strong product) and the operation of taking the power of a graph. In this direction, we show that if G is a graph obtained by applying any of the operations mentioned above on non-trivial graphs, then rc(G) a parts per thousand currency sign 2r(G) + c, where r(G) denotes the radius of G and . In general the rainbow connection number of a bridgeless graph can be as high as the square of its radius 1]. This is an attempt to identify some graph classes which have rainbow connection number very close to the obvious lower bound of diameter (and thus the radius). The bounds reported are tight up to additive constants. The proofs are constructive and hence yield polynomial time -factor approximation algorithms.

CLAP: A web-server for automatic classification of proteins with special reference to multi-domain proteins

Background: The function of a protein can be deciphered with higher accuracy from its structure than from its amino acid sequence. Due to the huge gap in the available protein sequence and structural space, tools that can generate functionally homogeneous clusters using only the sequence information, hold great importance. For this, traditional alignment-based tools work well in most cases and clustering is performed on the basis of sequence similarity. But, in the case of multi-domain proteins, the alignment quality might be poor due to varied lengths of the proteins, domain shuffling or circular permutations. Multi-domain proteins are ubiquitous in nature, hence alignment-free tools, which overcome the shortcomings of alignment-based protein comparison methods, are required. Further, existing tools classify proteins using only domain-level information and hence miss out on the information encoded in the tethered regions or accessory domains. Our method, on the other hand, takes into account the full-length sequence of a protein, consolidating the complete sequence information to understand a given protein better. Results: Our web-server, CLAP (Classification of Proteins), is one such alignment-free software for automatic classification of protein sequences. It utilizes a pattern-matching algorithm that assigns local matching scores (LMS) to residues that are a part of the matched patterns between two sequences being compared. CLAP works on full-length sequences and does not require prior domain definitions. Pilot studies undertaken previously on protein kinases and immunoglobulins have shown that CLAP yields clusters, which have high functional and domain architectural similarity. Moreover, parsing at a statistically determined cut-off resulted in clusters that corroborated with the sub-family level classification of that particular domain family. Conclusions: CLAP is a useful protein-clustering tool, independent of domain assignment, domain order, sequence length and domain diversity. Our method can be used for any set of protein sequences, yielding functionally relevant clusters with high domain architectural homogeneity. The CLAP web server is freely available for academic use at http://nslab.mbu.iisc.ernet.in/clap/.

Optimal Binary Power Control for Underlay CR With Different Interference Constraints and Impact of Channel Estimation Errors

Adapting the power of secondary users (SUs) while adhering to constraints on the interference caused to primary receivers (PRxs) is a critical issue in underlay cognitive radio (CR). This adaptation is driven by the interference and transmit power constraints imposed on the secondary transmitter (STx). Its performance also depends on the quality of channel state information (CSI) available at the STx of the links from the STx to the secondary receiver and to the PRxs. For a system in which an STx is subject to an average interference constraint or an interference outage probability constraint at each of the PRxs, we derive novel symbol error probability (SEP)-optimal, practically motivated binary transmit power control policies. As a reference, we also present the corresponding SEP-optimal continuous transmit power control policies for one PRx. We then analyze the robustness of the optimal policies when the STx knows noisy channel estimates of the links between the SU and the PRxs. Altogether, our work develops a holistic understanding of the critical role played by different transmit and interference constraints in driving power control in underlay CR and the impact of CSI on its performance.

Faster computation of the Karhunen-Loeve expansion using its domain independence property

The goal of this work is to reduce the cost of computing the coefficients in the Karhunen-Loeve (KL) expansion. The KL expansion serves as a useful and efficient tool for discretizing second-order stochastic processes with known covariance function. Its applications in engineering mechanics include discretizing random field models for elastic moduli, fluid properties, and structural response. The main computational cost of finding the coefficients of this expansion arises from numerically solving an integral eigenvalue problem with the covariance function as the integration kernel. Mathematically this is a homogeneous Fredholm equation of second type. One widely used method for solving this integral eigenvalue problem is to use finite element (FE) bases for discretizing the eigenfunctions, followed by a Galerkin projection. This method is computationally expensive. In the current work it is first shown that the shape of the physical domain in a random field does not affect the realizations of the field estimated using KL expansion, although the individual KL terms are affected. Based on this domain independence property, a numerical integration based scheme accompanied by a modification of the domain, is proposed. In addition to presenting mathematical arguments to establish the domain independence, numerical studies are also conducted to demonstrate and test the proposed method. Numerically it is demonstrated that compared to the Galerkin method the computational speed gain in the proposed method is of three to four orders of magnitude for a two dimensional example, and of one to two orders of magnitude for a three dimensional example, while retaining the same level of accuracy. It is also shown that for separable covariance kernels a further cost reduction of three to four orders of magnitude can be achieved. Both normal and lognormal fields are considered in the numerical studies. (c) 2014 Elsevier B.V. All rights reserved.

Functional characterization of heat-shock protein 90 from Oryza sativa and crystal structure of its N-terminal domain

Heat-shock protein 90 (Hsp90) is an ATP-dependent molecular chaperone that is essential for the normal functioning of eukaryotic cells. It plays crucial roles in cell signalling, cell-cycle control and in maintaining proteome integrity and protein homeostasis. In plants, Hsp90s are required for normal plant growth and development. Hsp90s are observed to be upregulated in response to various abiotic and biotic stresses and are also involved in immune responses in plants. Although there are several studies elucidating the physiological role of Hsp90s in plants, their molecular mechanism of action is still unclear. In this study, biochemical characterization of an Hsp90 protein from rice (Oryza sativa; OsHsp90) has been performed and the crystal structure of its N-terminal domain (OsHsp90-NTD) was determined. The binding of OsHsp90 to its substrate ATP and the inhibitor 17-AAG was studied by fluorescence spectroscopy. The protein also exhibited a weak ATPase activity. The crystal structure of OsHsp90-NTD was solved in complex with the nonhydrolyzable ATP analogue AMPPCP at 3.1 angstrom resolution. The domain was crystallized by cross-seeding with crystals of the N-terminal domain of Hsp90 from Dictyostelium discoideum, which shares 70% sequence identity with OsHsp90-NTD. This is the second reported structure of a domain of Hsp90 from a plant source.

The nuclease activities of both the Smr domain and an additional LDLK motif are required for an efficient anti-recombination function of Helicobacter pyloriMutS2

Helicobacter pylori, a human pathogen, is a naturally and constitutively competent bacteria, displaying a high rate of intergenomic recombination. While recombination events are essential for evolution and adaptation of H.pylori to dynamic gastric niches and new hosts, such events should be regulated tightly to maintain genomic integrity. Here, we analyze the role of the nuclease activity of MutS2, a protein that limits recombination during transformation in H.pylori. In previously studied MutS2 proteins, the C-terminal Smr domain was mapped as the region responsible for its nuclease activity. We report here that deletion of Smr domain does not completely abolish the nuclease activity of HpMutS2. Using bioinformatics analysis and mutagenesis, we identified an additional and novel nuclease motif (LDLK) at the N-terminus of HpMutS2 unique to Helicobacter and related epsilon-proteobacterial species. A single point mutation (D30A) in the LDLK motif and the deletion of Smr domain resulted in approximate to 5-10-fold loss of DNA cleavage ability of HpMutS2. Interestingly, the mutant forms of HpMutS2 wherein the LDLK motif was mutated or the Smr domain was deleted were unable to complement the hyper-recombination phenotype of a mutS2(-) strain, suggesting that both nuclease sites are indispensable for an efficient anti-recombinase activity of HpMutS2.

Biochemical Characterization of Nonamer Binding Domain of RAG1 Reveals its Thymine Preference with Respect to Length and Position

RAG complex consisting of RAG1 and RAG2 is a site-specific endonuclease responsible for the generation of antigen receptor diversity. It cleaves recombination signal sequence (RSS), comprising of conserved heptamer and nonamer. Nonamer binding domain (NBD) of RAG1 plays a central role in the recognition of RSS. To investigate the DNA binding properties of the domain, NBD of murine RAG1 was cloned, expressed and purified. Electrophoretic mobility shift assays showed that NBD binds with high affinity to nonamer in the context of 12/23 RSS or heteroduplex DNA. NBD binding was specific to thymines when single stranded DNA containing poly A, C, G or T were used. Biolayer interferometry studies showed that poly T binding to NBD was robust and comparable to that of 12RSS. More than 23 nt was essential for NBD binding at homothymidine stretches. On a double-stranded DNA, NBD could bind to A:T stretches, but not G:C or random sequences. Although NBD is indispensable for sequence specific activity of RAGs, external supplementation of purified nonamer binding domain to NBD deleted cRAG1/cRAG2 did not restore its activity, suggesting that the overall domain architecture of RAG1 is important. Therefore, we define the sequence requirements of NBD binding to DNA.