Land Surface Temperature with Land Cover Dynamics:Multi-Resolution, Spatio-Temporal Data Analysis of Greater Bangalore

Bangalore is experiencing unprecedented urbanisation in recent times due to concentrated developmental activities with impetus on IT (Information Technology) and BT (Biotechnology) sectors. The concentrated developmental activities has resulted in the increase in population and consequent pressure on infrastructure, natural resources, ultimately giving rise to a plethora of serious challenges such as urban flooding, climate change, etc. One of the perceived impact at local levels is the increase in sensible heat flux from the land surface to the atmosphere, which is also referred as heat island effect. In this communication, we report the changes in land surface temperature (LST) with respect to land cover changes during 1973 to 2007. A novel technique combining the information from sub-pixel class proportions with information from classified image (using signatures of the respective classes collected from the ground) has been used to achieve more reliable classification. The analysis showed positive correlation with the increase in paved surfaces and LST. 466% increase in paved surfaces (buildings, roads, etc.) has lead to the increase in LST by about 2 ºC during the last 2 decades, confirming urban heat island phenomenon. LSTs’ were relatively lower (~ 4 to 7 ºC) at land uses such as vegetation (parks/forests) and water bodies which act as heat sinks.

Processing of DNA double-stranded breaks and intermediates of recombination and repair by saccharomyces cerevisiae Mre11 and its stimulation by Rad50, Xrs2, and Sae2 proteins

Saccharomyces cerevisiae RAD50, MRE11, and XRS2 genes are essential for telomere length maintenance, cell cycle checkpoint signaling, meiotic recombination, and DNA double-stranded break (DSB) repair via nonhomologous end joining and homologous recombination. The DSB repair pathways that draw upon Mre11-Rad50-Xrs2 subunits are complex, so their mechanistic features remain poorly understood. Moreover, the molecular basis of DSB end resection in yeast mre11-nuclease deficient mutants and Mre11 nuclease-independent activation of ATM in mammals remains unknown and adds a new dimension to many unanswered questions about the mechanism of DSB repair. Here, we demonstrate that S. cerevisiae Mre11 (ScMre11) exhibits higher binding affinity for single-over double-stranded DNA and intermediates of recombination and repair and catalyzes robust unwinding of substrates possessing a 3' single-stranded DNA overhang but not of 5' overhangs or blunt-ended DNA fragments. Additional evidence disclosed that ScMre11 nuclease activity is dispensable for its DNA binding and unwinding activity, thus uncovering the molecular basis underlying DSB end processing in mre11 nuclease deficient mutants. Significantly, Rad50, Xrs2, and Sae2 potentiate the DNA unwinding activity of Mre11, thus underscoring functional interaction among the components of DSB end repair machinery. Our results also show that ScMre11 by itself binds to DSB ends, then promotes end bridging of duplex DNA, and directly interacts with Sae2. We discuss the implications of these results in the context of an alternative mechanism for DSB end processing and the generation of single-stranded DNA for DNA repair and homologous recombination.

Assay development for identifying inhibitors of the mycobacterial FadD32 activity

FadD32, a fatty acyl-AMP ligase (FAAL32) involved in the biosynthesis of mycolic acids, major and specific lipid components of the mycobacterial cell envelope, is essential for the survival of Mycobacterium tuberculosis, the causative agent of tuberculosis. The protein catalyzes the conversion of fatty acid to acyl-adenylate (acyl-AMP) in the presence of adenosine triphosphate and is conserved in all the mycobacterial species sequenced so far, thus representing a promising target for the development of novel antituberculous drugs. Here, we describe the optimization of the protein purification procedure and the development of a high-throughput screening assay for FadD32 activity. This spectrophotometric assay measuring the release of inorganic phosphate was optimized using the Mycobacterium smegmatis FadD32 as a surrogate enzyme. We describe the use of Tm (melting temperature) shift assay, which measures the modulation of FadD32 thermal stability, as a tool for the identification of potential ligands and for validation of compounds as inhibitors. Screening of a selected library of compounds led to the identification of five novel classes of inhibitors.

EXTENSIONS OF VECTOR BUNDLES WITH APPLICATION TO NOETHER-LEFSCHETZ THEOREMS

Given a smooth, projective variety Y over an algebraically closed field of characteristic zero, and a smooth, ample hyperplane section X subset of Y, we study the question of when a bundle E on X, extends to a bundle epsilon on a Zariski open set U subset of Y containing X. The main ingredients used are explicit descriptions of various obstruction classes in the deformation theory of bundles, together with Grothendieck-Lefschetz theory. As a consequence, we prove a Noether-Lefschetz theorem for higher rank bundles, which recovers and unifies the Noether-Lefschetz theorems of Joshi and Ravindra-Srinivas.

Chaperoning mitochondrial permeability transition: regulation of transition pore complex by a J-protein, DnaJC15

Mitochondria have a central role in the intrinsic pathway of apoptosis and involve activation of several transmembrane channels leading to release of death factors. Reduced expression of a mitochondrial J-protein DnaJC15 was associated with the development of chemoresistance in ovarian cancer cells. DnaJC15 was found to be a part of mitochondrial protein-transport machinery, though its connection with cell death mechanisms is still unclear. In the present study, we have provided evidence towards a novel function of DnaJC15 in regulation of mitochondrial permeability transition pore (MPTP) complex in normal and cancer cells. Overexpression of DnaJC15 resulted in MPTP opening and induction of apoptosis, whereas reduced amount of protein suppressed MPTP activation, upon cisplatin treatment. DnaJC15 was found to exert its proapoptotic function through the essential component of MPTP, cyclophilin D (CypD). Our results reveal a specific role of DnaJC15 in recruitment and coupling of CypD with mitochondrial permeability transition. In summary, our analysis provides first-time insights on the functional connection between mitochondrial inner membrane protein translocation machinery-associated J-protein DnaJC15 and regulation of cell death pathways.

Structural diversity and ligand specificity of lectins. The Bangalore effort

Structural studies in this laboratory encompass four of the five major classes of plant lectins, including the one discovered by us. In addition to addressing issues specific to individual lectins, the work provided insights into protein folding, quaternary association and generation of ligand specificity. Legume and beta-prism fold lectins constitute families of proteins in which small alterations in essentially the same tertiary structure lead to large variations in quaternary structure, including that involving an open structure. Strategies for generating ligand specificity include water bridges, variation in loop length, post translational modification and oligomerization. Three of the structural classes investigated have subunits with three-fold symmetry. The symmetry in the structure is reflected in the sequence to different extents in different subclasses. The evolutionary implications of this observation have been explored. The work on lectins has now been extended to those from mycobacteria.

Direct regulation of topoisomerase activity by a nucleoid-associated protein

The topological homeostasis of bacterial chromosomes is maintained by the balance between compaction and the topological organization of genomes. Two classes of proteins play major roles in chromosome organization: the nucleoid-associated proteins (NAPs) and topoisomerases. The NAPs bind DNA to compact the chromosome, whereas topoisomerases catalytically remove or introduce supercoils into the genome. We demonstrate that HU, a major NAP of Mycobacterium tuberculosis specifically stimulates the DNA relaxation ability of mycobacterial topoisomerase I (TopoI) at lower concentrations but interferes at higher concentrations. A direct physical interaction between M. tuberculosis HU (MtHU) and TopoI is necessary for enhancing enzyme activity both in vitro and in vivo. The interaction is between the amino terminal domain of MtHU and the carboxyl terminal domain of TopoI. Binding of MtHU did not affect the two catalytic trans-esterification steps but enhanced the DNA strand passage, requisite for the completion of DNA relaxation, a new mechanism for the regulation of topoisomerase activity. An interaction-deficient mutant of MtHU was compromised in enhancing the strand passage activity. The species-specific physical and functional cooperation between MtHU and TopoI may be the key to achieve the DNA relaxation levels needed to maintain the optimal superhelical density of mycobacterial genomes.

Relay Selection with Channel Probing in Sleep-Wake Cycling Wireless Sensor Networks

In geographical forwarding of packets in a large wireless sensor network (WSN) with sleep-wake cycling nodes, we are interested in the local decision problem faced by a node that has ``custody'' of a packet and has to choose one among a set of next-hop relay nodes to forward the packet toward the sink. Each relay is associated with a ``reward'' that summarizes the benefit of forwarding the packet through that relay. We seek a solution to this local problem, the idea being that such a solution, if adopted by every node, could provide a reasonable heuristic for the end-to-end forwarding problem. Toward this end, we propose a local relay selection problem consisting of a forwarding node and a collection of relay nodes, with the relays waking up sequentially at random times. At each relay wake-up instant, the forwarder can choose to probe a relay to learn its reward value, based on which the forwarder can then decide whether to stop (and forward its packet to the chosen relay) or to continue to wait for further relays to wake up. The forwarder's objective is to select a relay so as to minimize a combination of waiting delay, reward, and probing cost. The local decision problem can be considered as a variant of the asset selling problem studied in the operations research literature. We formulate the local problem as a Markov decision process (MDP) and characterize the solution in terms of stopping sets and probing sets. We provide results illustrating the structure of the stopping sets, namely, the (lower bound) threshold and the stage independence properties. Regarding the probing sets, we make an interesting conjecture that these sets are characterized by upper bounds. Through simulation experiments, we provide valuable insights into the performance of the optimal local forwarding and its use as an end-to-end forwarding heuristic.

Arabidopsis thaliana J-class heat shock proteins: cellular stress sensors

Plants are sessile organisms that have evolved a variety of mechanisms to maintain their cellular homeostasis under stressful environmental conditions. Survival of plants under abiotic stress conditions requires specialized group of heat shock protein machinery, belonging to Hsp70:J-protein family. These heat shock proteins are most ubiquitous types of chaperone machineries involved in diverse cellular processes including protein folding, translocation across cell membranes, and protein degradation. They play a crucial role in maintaining the protein homeostasis by reestablishing functional native conformations under environmental stress conditions, thus providing protection to the cell. J-proteins are co-chaperones of Hsp70 machine, which play a critical role by stimulating Hsp70s ATPase activity, thereby stabilizing its interaction with client proteins. Using genome-wide analysis of Arabidopsis thaliana, here we have outlined identification and systematic classification of J-protein co-chaperones which are key regulators of Hsp70s function. In comparison with Saccharomyces cerevisiae model system, a comprehensive domain structural organization, cellular localization, and functional diversity of A. thaliana J-proteins have also been summarized. Electronic supplementary material The online version of this article (doi:10.1007/s10142-009-0132-0) contains supplementary material, which is available to authorized users.

Algebraic distributed space-time codes with low ML decoding complexity

"Extended Clifford algebras" are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two specific classes of extended Clifford algebras, two systematic algebraic constructions of full diversity Distributed Space-Time Codes (DSTCs) are provided for any power of two number of relays. The left regular matrix representation has been shown to naturally result in space-time codes meeting the additional constraints required for DSTCs. The DSTCs so constructed have the salient feature of reduced Maximum Likelihood (ML) decoding complexity. In particular, the ML decoding of these codes can be performed by applying the lattice decoder algorithm on a lattice of four times lesser dimension than what is required in general. Moreover these codes have a uniform distribution of power among the relays and in time, thus leading to a low Peak to Average Power Ratio at the relays.

Optimized Policies for the Retransmission Probabilities in Slotted Aloha

In this paper, we study the behaviour of the slotted Aloha multiple access scheme with a finite number of users under different traffic loads and optimize the retransmission probability q(r) for various settings, cost objectives and policies. First, we formulate the problem as a parameter optimization problem and use certain efficient smoothed functional algorithms for finding the optimal retransmission probability parameter. Next, we propose two classes of multi-level closed-loop feedback policies (for finding in each case the retransmission probability qr that now depends on the current system state) and apply the above algorithms for finding an optimal policy within each class of policies. While one of the policy classes depends on the number of backlogged nodes in the system, the other depends on the number of time slots since the last successful transmission. The latter policies are more realistic as it is difficult to keep track of the number of backlogged nodes at each instant. We investigate the effect of increasing the number of levels in the feedback policies. Wen also investigate the effects of using different cost functions (withn and without penalization) in our algorithms and the corresponding change in the throughput and delay using these. Both of our algorithms use two-timescale stochastic approximation. One of the algorithms uses one simulation while the other uses two simulations of the system. The two-simulation algorithm is seen to perform better than the other algorithm. Optimal multi-level closed-loop policies are seen to perform better than optimal open-loop policies. The performance further improves when more levels are used in the feedback policies.

A Multi-layer Perceptron based Non-linear Mixture Model to estimate class abundance from mixed pixels

Sub-pixel classification is essential for the successful description of many land cover (LC) features with spatial resolution less than the size of the image pixels. A commonly used approach for sub-pixel classification is linear mixture models (LMM). Even though, LMM have shown acceptable results, pragmatically, linear mixtures do not exist. A non-linear mixture model, therefore, may better describe the resultant mixture spectra for endmember (pure pixel) distribution. In this paper, we propose a new methodology for inferring LC fractions by a process called automatic linear-nonlinear mixture model (AL-NLMM). AL-NLMM is a three step process where the endmembers are first derived from an automated algorithm. These endmembers are used by the LMM in the second step that provides abundance estimation in a linear fashion. Finally, the abundance values along with the training samples representing the actual proportions are fed to multi-layer perceptron (MLP) architecture as input to train the neurons which further refines the abundance estimates to account for the non-linear nature of the mixing classes of interest. AL-NLMM is validated on computer simulated hyperspectral data of 200 bands. Validation of the output showed overall RMSE of 0.0089±0.0022 with LMM and 0.0030±0.0001 with the MLP based AL-NLMM, when compared to actual class proportions indicating that individual class abundances obtained from AL-NLMM are very close to the real observations.

Prototype learning methods for online handwriting recognition

In this paper, we study different methods for prototype selection for recognizing handwritten characters of Tamil script. In the first method, cumulative pairwise- distances of the training samples of a given class are used to select prototypes. In the second method, cumulative distance to allographs of different orientation is used as a criterion to decide if the sample is representative of the group. The latter method is presumed to offset the possible orientation effect. This method still uses fixed number of prototypes for each of the classes. Finally, a prototype set growing algorithm is proposed, with a view to better model the differences in complexity of different character classes. The proposed algorithms are tested and compared for both writer independent and writer adaptation scenarios.

Relay Selection for Geographical Forwarding in Sleep-Wake Cycling Wireless Sensor Networks

Our work is motivated by geographical forwarding of sporadic alarm packets to a base station in a wireless sensor network (WSN), where the nodes are sleep-wake cycling periodically and asynchronously. We seek to develop local forwarding algorithms that can be tuned so as to tradeoff the end-to-end delay against a total cost, such as the hop count or total energy. Our approach is to solve, at each forwarding node enroute to the sink, the local forwarding problem of minimizing one-hop waiting delay subject to a lower bound constraint on a suitable reward offered by the next-hop relay; the constraint serves to tune the tradeoff. The reward metric used for the local problem is based on the end-to-end total cost objective (for instance, when the total cost is hop count, we choose to use the progress toward sink made by a relay as the reward). The forwarding node, to begin with, is uncertain about the number of relays, their wake-up times, and the reward values, but knows the probability distributions of these quantities. At each relay wake-up instant, when a relay reveals its reward value, the forwarding node's problem is to forward the packet or to wait for further relays to wake-up. In terms of the operations research literature, our work can be considered as a variant of the asset selling problem. We formulate our local forwarding problem as a partially observable Markov decision process (POMDP) and obtain inner and outer bounds for the optimal policy. Motivated by the computational complexity involved in the policies derived out of these bounds, we formulate an alternate simplified model, the optimal policy for which is a simple threshold rule. We provide simulation results to compare the performance of the inner and outer bound policies against the simple policy, and also against the optimal policy when the source knows the exact number of relays. Observing the good performance and the ease of implementation of the simple policy, we apply it to our motivating problem, i.e., local geographical routing of sporadic alarm packets in a large WSN. We compare the end-to-end performance (i.e., average total delay and average total cost) obtained by the simple policy, when used for local geographical forwarding, against that obtained by the globally optimal forwarding algorithm proposed by Kim et al. 1].

Capacity bounds for the Gaussian X channel

We consider bounds for the capacity region of the Gaussian X channel (XC), a system consisting of two transmit-receive pairs, where each transmitter communicates with both the receivers. We first classify the XC into two classes, the strong XC and the mixed XC. In the strong XC, either the direct channels are stronger than the cross channels or vice-versa, whereas in the mixed XC, one of the direct channels is stronger than the corresponding cross channel and vice-versa. After this classification, we give outer bounds on the capacity region for each of the two classes. This is based on the idea that when one of the messages is eliminated from the XC, the rate region of the remaining three messages are enlarged. We make use of the Z channel, a system obtained by eliminating one message and its corresponding channel from the X channel, to bound the rate region of the remaining messages. The outer bound to the rate region of the remaining messages defines a subspace in R-+(4) and forms an outer bound to the capacity region of the XC. Thus, the outer bound to the capacity region of the XC is obtained as the intersection of the outer bounds to the four combinations of the rate triplets of the XC. Using these outer bounds on the capacity region of the XC, we derive new sum-rate outer bounds for both strong and mixed Gaussian XCs and compare them with those existing in literature. We show that the sum-rate outer bound for strong XC gives the sum-rate capacity in three out of the four sub-regions of the strong Gaussian XC capacity region. In case of mixed Gaussian XC, we recover the recent results in 11] which showed that the sum-rate capacity is achieved in two out of the three sub-regions of the mixed XC capacity region and give a simple alternate proof of the same.