Comparative analysis of thermophilic and mesophilic proteins using Protein Energy Networks

Background: Thermophilic proteins sustain themselves and function at higher temperatures. Despite their structural and functional similarities with their mesophilic homologues, they show enhanced stability. Various comparative studies at genomic, protein sequence and structure levels, and experimental works highlight the different factors and dominant interacting forces contributing to this increased stability. Methods: In this comparative structure based study, we have used interaction energies between amino acids, to generate structure networks called as Protein Energy Networks (PENs). These PENs are used to compute network, sub-graph, and node specific parameters. These parameters are then compared between the thermophile-mesophile homologues. Results: The results show an increased number of clusters and low energy cliques in thermophiles as the main contributing factors for their enhanced stability. Further more, we see an increase in the number of hubs in thermophiles. We also observe no community of electrostatic cliques forming in PENs. Conclusion: In this study we were able to take an energy based network approach, to identify the factors responsible for enhanced stability of thermophiles, by comparative analysis. We were able to point out that the sub-graph parameters are the prominent contributing factors. The thermophiles have a better-packed hydrophobic core. We have also discussed how thermophiles, although increasing stability through higher connectivity retains conformational flexibility, from a cliques and communities perspective.

Reduction of Torque Ripple in Induction Motor Drives Using an AdvancedHybrid PWM Technique

A voltage source inverter-fed induction motor produces a pulsating torque due to application of nonsinusoidal voltages. Torque pulsation is strongly influenced by the pulsewidth modulation (PWM) method employed. Conventional space vector PWM (CSVPWM) is known to result in less torque ripple than sine-triangle PWM. This paper aims at further reduction in the pulsating torque by employing advanced bus-clamping switching sequences, which apply an active vector twice in a subcycle. This paper proposes a hybrid PWM technique which employs such advanced bus-clamping sequences in conjunction with a conventional switching sequence. The proposed hybrid PWM technique is shown to reduce the torque ripple considerably over CSVPWM along with a marginal reduction in current ripple.

Generic Routing Rules and a Scalable Access Enhancement for the Network-on-Chip RECONNECT

RECONNECT is a Network-on-Chip using a honeycomb topology. In this paper we focus on properties of general rules applicable to a variety of routing algorithms for the NoC which take into account the missing links of the honeycomb topology when compared to a mesh. We also extend the original proposal [5] and show a method to insert and extract data to and from the network. Access Routers at the boundary of the execution fabric establish connections to multiple periphery modules and create a torus to decrease the node distances. Our approach is scalable and ensures homogeneity among the compute elements in the NoC. We synthesized and evaluated the proposed enhancement in terms of power dissipation and area. Our results indicate that the impact of necessary alterations to the fabric is negligible and effects the data transfer between the fabric and the periphery only marginally.

Mycobacterium tuberculosis UvrD1 and UvrA Proteins Suppress DNA Strand Exchange Promoted by Cognate and Noncognate RecA Proteins

DNA helicases are present in all kingdoms of life and play crucial roles in processes of DNA metabolism such as replication, repair, recombination, and transcription. To date, however, the role of DNA helicases during homologous recombination in mycobacteria remains unknown. In this study, we show that Mycobacterium tuberculosis UvrD1 more efficiently inhibited the strand exchange promoted by its cognate RecA, compared to noncognate Mycobacterium smegmatis or Escherichia coli RecA proteins. The M. tuberculosis UvrD1(Q276R) mutant lacking the helicase and ATPase activities was able to block strand exchange promoted by mycobacterial RecA proteins but not of E. coil RecA. We observed that M. tuberculosis UvrA by itself has no discernible effect on strand exchange promoted by E. coli RecA but impedes the reaction catalyzed by the mycobacterial RecA proteins. Our data also show that M. tuberculosis UvrA and UvrD1 can act together to inhibit strand exchange promoted by mycobacterial RecA proteins. Taken together, these findings raise the possibility that UvrD1 and UvrA might act together in vivo to counter the deleterious effects of RecA nucleoprotein filaments and/or facilitate the dissolution of recombination intermediates. Finally, we provide direct experimental evidence for a physical interaction between M. tuberculosis UvrD1 and RecA on one hand and RecA and UvrA on the other hand. These observations are consistent with a molecular mechanism, whereby M. tuberculosis UvrA and UvrD1, acting together, block DNA strand exchange promoted by cognate and noncognate RecA proteins.

A Geometric Algorithm for Learning Oblique Decision Trees

In this paper we present a novel algorithm for learning oblique decision trees. Most of the current decision tree algorithms rely on impurity measures to assess goodness of hyperplanes at each node. These impurity measures do not properly capture the geometric structures in the data. Motivated by this, our algorithm uses a strategy, based on some recent variants of SVM, to assess the hyperplanes in such a way that the geometric structure in the data is taken into account. We show through empirical studies that our method is effective.

ErbB-2 expression and its association with other biological parameters of breast cancer among Indian women

Overexpression of the epidermal growth factor receptor family genes, which include ErbB-1, 2, 3 and 4, has been implicated in a number of cancers. We have studied the extent of ErbB-2 overexpression among Indian women with sporadic breast cancer. Methods: Immmunohistochemistry and genomic polymerase chain reaction (PCR) were used to study the ErbB2 overexpression. ErbB2 status was correlated with other clinico-pathological parameters, including patient survival. Results: ErbB-2 overexpression was detected in 43.2% (159/368) of the cases by immunohistochemistry. For a sub-set of patients (n = 55) for whom total DNA was available, ErbB-2 gene amplification was detected in 25.5% (14/55) of the cases by genomic PCR. While the ErbB2 overexpression was significantly higher in patients with lymphnode (χ2 = 12.06, P≤ 0.001), larger tumor size (χ2 = 8.22, P = 0.042) and ductal carcinoma (χ2 = 15.42, P ≤ 0.001), it was lower in patients with disease-free survival (χ2 = 22.13, P ≤ 0.001). Survival analysis on a sub-set of patients for whom survival data were available (n = 179) revealed that ErbB-2 status (χ2 =25.94, P ≤ 0.001), lymphnode status (χ2 = 12.68, P ≤ 0.001), distant metastasis (χ2 = 19.49, P ≤ 0.001) and stage of the disease (χ2 = 28.04, P ≤0.001) were markers of poor prognosis. Conclusions: ErbB-2 overexpression was significantly greater compared with the Western literature, but comparable to other Indian studies. Significant correlation was found between ErbB-2 status and lymphnode status, tumor size and ductal carcinoma. ErbB-2 status, lymph node status, distant metastasis and stage of the disease were found to be prognostic indicators.

Design of incentive compatible protocols for wireless networks: A game theoretic approach

In this thesis work, we design rigorous and efficient protocols/mechanisms for different types of wireless networks using a mechanism design [1] and game theoretic approach [2]. Our work can broadly be viewed in two parts. In the first part, we concentrate on ad hoc wireless networks [3] and [4]. In particular, we consider broadcast in these networks where each node is owned by independent and selfish users. Being selfish, these nodes do not forward the broadcast packets. All existing protocols for broadcast assume that nodes forward the transit packets. So, there is need for developing new broadcast protocols to overcome node selfishness. In our paper [5], we develop a strategy proof pricing mechanism which we call immediate predecessor node pricing mechanism (IPNPM) and an efficient new broadcast protocol based on IPNPM. We show the efficacy of our proposed broadcast protocol using simulation results.

An efficient pricing based protocol for broadcasting in wireless ad hoc networks

In many applications of wireless ad hoc networks, wireless nodes are owned by rational and intelligent users. In this paper, we call nodes selfish if they are owned by independent users and their only objective is to maximize their individual goals. In such situations, it may not be possible to use the existing protocols for wireless ad hoc networks as these protocols assume that nodes follow the prescribed protocol without deviation. Stimulating cooperation among these nodes is an interesting and challenging problem. Providing incentives and pricing the transactions are well known approaches to stimulate cooperation. In this paper, we present a game theoretic framework for truthful broadcast protocol and strategy proof pricing mechanism called Immediate Predecessor Node Pricing Mechanism (IPNPM). The phrase strategy proof here means that truth revelation of cost is a weakly dominant-strategy (in game theoretic terms) for each node. In order to steer our mechanism-design approach towards practical implementation, we compute the payments to nodes using a distributed algorithm. We also propose a new protocol for broadcast in wireless ad hoc network with selfish nodes based on IPNPM. The features of the proposed broadcast protocol are reliability and a significantly reduced number of packet forwards compared to the number of network nodes, which in turn leads to less system-wide power consumption to broadcast a single packet. Our simulation results show the efficacy of the proposed broadcast protocol.

Fuzzy-expert approach for voltage-reactive power dispatch

The voltage stability control problem has become an important concern for utilities transmitting power over long distances. This paper presents an approach using fuzzy set theory for reactive power control with the purpose of improving the voltage stability of a power system. To minimize the voltage deviations from pre-desired values of all the load buses, using the sensitivities with respect to reactive power control variables form the basis of the proposed fuzzy logic control (FLC). Control variables considered are switchable VAR compensators, On Load Tap Changing (OLTC) transformers and generator excitations. Voltage deviations and controlling variables are translated into fuzzy set notations to formulate the relation between voltage deviations and controlling ability of controlling devices. The developed fuzzy system is tested on a few simulated practical Indian power systems and some IEEE standard test systems. The performance of the fuzzy system is compared with conventional optimization technique and results obtained are encouraging. Results obtained for a 24 - node equivalent EHV system of part of Indian southern grid and IEEE New England 39-bus system are presented for illustration purposes. The proposed Fuzzy-Expert technique is found suitable for on-line applications in energy control centre as the solution is obtained fast with significant speedups.

Neural network approach for fault location in unbalanced distribution networks with limited measurements

This paper presents an Artificial Neural Network (ANN) approach for locating faults in distribution systems. Different from the traditional Fault Section Estimation methods, the proposed approach uses only limited measurements. Faults are located according to the impedances of their path using a Feed Forward Neural Networks (FFNN). Various practical situations in distribution systems, such as protective devices placed only at the substation, limited measurements available, various types of faults viz., three-phase, line (a, b, c) to ground, line to line (a-b, b-c, c-a) and line to line to ground (a-b-g, b-c-g, c-a-g) faults and a wide range of varying short circuit levels at substation, are considered for studies. A typical IEEE 34 bus practical distribution system with unbalanced loads and with three- and single- phase laterals and a 69 node test feeder with different configurations are considered for studies. The results presented show that the proposed approach of fault location gives close to accurate results in terms of the estimated fault location.

An auction algorithm for procuring wireless channel in a heterogenous wireless network

In this paper, we develop a novel auction algorithm for procuring wireless channel by a wireless node in a heterogeneous wireless network. We assume that the service providers of the heterogeneous wireless network are selfish and non-cooperative in the sense that they are only interested in maximizing their own utilities. The wireless user needs to procure wireless channels to execute multiple tasks. To solve the problem of the wireless user, we propose a reverse optimal (REVOPT) auction and derive an expression for the expected payment by the wireless user. The proposed auction mechanism REVOPT satisfies important game theoretic properties such as Bayesian incentive compatibility and individual rationality.

A generalized Linear Programming based approach to optimal divisible load scheduling

In this paper we propose a general Linear Programming (LP) based formulation and solution methodology for obtaining optimal solution to the load distribution problem in divisible load scheduling. We exploit the power of the versatile LP formulation to propose algorithms that yield exact solutions to several very general load distribution problems for which either no solutions or only heuristic solutions were available. We consider both star (single-level tree) networks and linear daisy chain networks, having processors equipped with front-ends, that form the generic models for several important network topologies. We consider arbitrary processing node availability or release times and general models for communication delays and computation time that account for constant overheads such as start up times in communication and computation. The optimality of the LP based algorithms is proved rigorously.

A new scheme for establishing pairwise keys for wireless sensor networks

This paper addresses the problem of secure path key establishment in wireless sensor networks that uses the random key predistribution technique. Inspired by the recent proxy-based scheme in [1] and [2], we introduce a fiiend-based scheme for establishing pairwise keys securely. We show that the chances of finding friends in a neighbourhood are considerably more than that of finding proxies, leading to lower communication overhead. Further, we prove that the friendbased scheme performs better than the proxy-based scheme in terms of resilience against node capture.

Analysis of network architectures for zigbee sensor clusters

We provide a comparative performance analysis of network architectures for beacon enabled Zigbee sensor clusters using the CSMA/CA MAC defined in the IEEE 802.15.4 standard, and organised as (i) a star topology, and (ii) a two-hop topology. We provide analytical models for obtaining performance measures such as mean network delay, and mean node lifetime. We find that the star topology is substantially superior both in delay performance and lifetime performance than the two-hop topology.