Crystallographic studies of the extracytoplasmic function sigma factor sigma(J) from Mycobacterium tuberculosis

Mycobacterium tuberculosis has multiple sigma factors which enable the bacterium to reprogram its transcriptional machinery under diverse environmental conditions. sigma(J), an extracytoplasmic function sigma factor, is upregulated in late stationary phase cultures and during human macrophage infection. sigma(J) governs the cellular response to hydrogen peroxide-mediated oxidative stress. sigma(J) differs from other canonical sigma factors owing to the presence of a SnoaL_2 domain at the C-terminus. sigma(J) crystals belonged to the tetragonal space group I422, with unit-cell parameters a = b = 133.85, c = 75.08 angstrom. Diffraction data were collected to 2.16 angstrom resolution on the BM14 beamline at the European Synchrotron Radiation Facility (ESRF).

Intramolecular hydrogen bond: Can it be part of the basis set of valence internal coordinates in normal mode analysis?

It has been shown earlier1] that the relaxed force constants (RFCs) could be used as a measure of bond strength only when the bonds form a part of the complete valence internal coordinates (VIC) basis. However, if the bond is not a part of the complete VIC basis, its RFC is not necessarily a measure of bond strength. Sometimes, it is possible to have a complete VIC basis that does not contain the intramolecular hydrogen bond (IMHB) as part of the basis. This means the RFC of IMHB is not necessarily a measure of bond strength. However, we know that IMHB is a weak bond and hence its RFC has to be a measure of bond strength. We resolve this problem of IMHB not being part of the complete basis by postulating `equivalent' basis sets where IMHB is part of the basis at least in one of the equivalent sets of VIC. As long as a given IMHB appears in one of the equivalent complete VIC basis sets, its RFC could be used as a measure of bond strength parameter.

Glioblastoma-derived Macrophage Colony-stimulating Factor (MCSF) Induces Microglial Release of Insulin-like Growth Factor-binding Protein 1 (IGFBP1) to Promote Angiogenesis

Glioblastoma (grade IV glioma/GBM) is the most common primary adult malignant brain tumor with poor prognosis. To characterize molecular determinants of tumor-stroma interaction in GBM, we profiled 48 serum cytokines and identified macrophage colony-stimulating factor (MCSF) as one of the elevated cytokines in sera from GBM patients. Both MCSF transcript and protein were up-regulated in GBM tissue samples through a spleen tyrosine kinase (SYK)-dependent activation of the PI3K-NF kappa B pathway. Ectopic overexpression and silencing experiments revealed that glioma-secreted MCSF has no role in autocrine functions and M2 polarization of macrophages. In contrast, silencing expression of MCSF in glioma cells prevented tube formation of human umbilical vein endothelial cells elicited by the supernatant from monocytes/microglial cells treated with conditioned medium from glioma cells. Quantitative proteomics based on stable isotope labeling by amino acids in cell culture showed that glioma-derived MCSF induces changes in microglial secretome and identified insulin-like growth factor-binding protein 1 (IGFBP1) as one of the MCSF-regulated proteins secreted by microglia. Silencing IGFBP1 expression in microglial cells or its neutralization by an antibody reduced the ability of supernatants derived from microglial cells treated with glioma cell-conditioned medium to induce angiogenesis. In conclusion, this study shows up-regulation of MCSF in GBM via a SYK-PI3K-NF kappa B-dependent mechanism and identifies IGFBP1 released by microglial cells as a novel mediator of MCSF-induced angiogenesis, of potential interest for developing targeted therapy to prevent GBM progression.

Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints

The 3-Hitting Set problem involves a family of subsets F of size at most three over an universe U. The goal is to find a subset of U of the smallest possible size that intersects every set in F. The version of the problem with parity constraints asks for a subset S of size at most k that, in addition to being a hitting set, also satisfies certain parity constraints on the sizes of the intersections of S with each set in the family F. In particular, an odd (even) set is a hitting set that hits every set at either one or three (two) elements, and a perfect code is a hitting set that intersects every set at exactly one element. These questions are of fundamental interest in many contexts for general set systems. Just as for Hitting Set, we find these questions to be interesting for the case of families consisting of sets of size at most three. In this work, we initiate an algorithmic study of these problems in this special case, focusing on a parameterized analysis. We show, for each problem, efficient fixed-parameter tractable algorithms using search trees that are tailor-made to the constraints in question, and also polynomial kernels using sunflower-like arguments in a manner that accounts for equivalence under the additional parity constraints.

QEP Based Solution for Power Allocation in Amplify and Forward Networks

The problem of cooperative beamforming for maximizing the achievable data rate of an energy constrained two-hop amplify-and-forward (AF) network is considered. Assuming perfect channel state information (CSI) of all the nodes, we evaluate the optimal scaling factor for the relay nodes. Along with individual power constraint on each of the relay nodes, we consider a weighted sum power constraint. The proposed iterative algorithm initially solves a set of relaxed problems with weighted sum power constraint and then updates the solution to accommodate individual constraints. These relaxed problems in turn are solved using a sequence of Quadratic Eigenvalue Problems (QEP). The key contribution of this letter is the generalization of cooperative beamforming to incorporate both the individual and weighted sum constraint. Furthermore, we have proposed a novel algorithm based on Quadratic Eigenvalue Problem (QEP) and discussed its convergence.

Interplay of vector-like top partner multiplets in a realistic mixing set-up

The ATLAS and CMS collaborations at the LHC have performed analyses on the existing data sets, studying the case of one vector-like fermion or multiplet coupling to the standard model Yukawa sector. In the near future, with more data available, these experimental collaborations will start to investigate more realistic cases. The presence of more than one extra vector-like multiplet is indeed a common situation in many extensions of the standard model. The interplay of these vector-like multiplet between precision electroweak bounds, flavour and collider phenomenology is a important question in view of establishing bounds or for the discovery of physics beyond the standard model. In this work we study the phenomenological consequences of the presence of two vector-like multiplets. We analyse the constraints on such scenarios from tree-level data and oblique corrections for the case of mixing to each of the SM generations. In the present work, we limit to scenarios with two top-like partners and no mixing in the down-sector.

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.

Ac2PIM-responsive miR-150 and miR-143 Target Receptor-interacting Protein Kinase 2 and Transforming Growth Factor Beta-activated Kinase 1 to Suppress NOD2-induced Immunomodulators

Specific and coordinated regulation of innate immune receptor-driven signaling networks often determines the net outcome of the immune responses. Here, we investigated the cross-regulation of toll-like receptor (TLR)2 and nucleotide-binding oligomerization domain (NOD)2 pathways mediated by Ac2PIM, a tetra-acylated form of mycobacterial cell wall component and muramyl dipeptide (MDP), a peptidoglycan derivative respectively. While Ac2PIM treatment of macrophages compromised their ability to induce NOD2-dependent immunomodulators like cyclooxygenase (COX)-2, suppressor of cytokine signaling (SOCS)-3, and matrix metalloproteinase (MMP)-9, no change in the NOD2-responsive NO, TNF-alpha, VEGF-A, and IL-12 levels was observed. Further, genome-wide microRNA expression profiling identified Ac2PIM-responsive miR-150 and miR-143 to target NOD2 signaling adaptors, RIP2 and TAK1, respectively. Interestingly, Ac2PIM was found to activate the SRC-FAK-PYK2-CREB cascade via TLR2 to recruit CBP/P300 at the promoters of miR-150 and miR-143 and epigenetically induce their expression. Loss-of-function studies utilizing specific miRNA inhibitors establish that Ac2PIM, via the miRNAs, abrogate NOD2-induced PI3K-PKC delta-MAPK pathway to suppress beta-catenin-mediated expression of COX-2, SOCS-3, and MMP-9. Our investigation has thus underscored the negative regulatory role of Ac2PIM-TLR2 signaling on NOD2 pathway which could broaden our understanding on vaccine potential or adjuvant utilities of Ac2PIM and/or MDP.

QoS Constrained Optimal Sink and Relay Placement in Planned Wireless Sensor Networks

We are given a set of sensors at given locations, a set of potential locations for placing base stations (BSs, or sinks), and another set of potential locations for placing wireless relay nodes. There is a cost for placing a BS and a cost for placing a relay. The problem we consider is to select a set of BS locations, a set of relay locations, and an association of sensor nodes with the selected BS locations, so that the number of hops in the path from each sensor to its BS is bounded by h(max), and among all such feasible networks, the cost of the selected network is the minimum. The hop count bound suffices to ensure a certain probability of the data being delivered to the BS within a given maximum delay under a light traffic model. We observe that the problem is NP-Hard, and is hard to even approximate within a constant factor. For this problem, we propose a polynomial time approximation algorithm (SmartSelect) based on a relay placement algorithm proposed in our earlier work, along with a modification of the greedy algorithm for weighted set cover. We have analyzed the worst case approximation guarantee for this algorithm. We have also proposed a polynomial time heuristic to improve upon the solution provided by SmartSelect. Our numerical results demonstrate that the algorithms provide good quality solutions using very little computation time in various randomly generated network scenarios.

Design and implementation of spectrum sensing for cognitive radios with a frequency-hopping primary system

In this work, spectrum sensing for cognitive radios is considered in the presence of multiple Primary Users (PU) using frequency-hopping communication over a set of frequency bands. The detection performance of the Fast Fourier Transform (FFT) Average Ratio (FAR) algorithm is obtained in closed-form, for a given FFT size and number of PUs. The effective throughput of the Secondary Users (SU) is formulated as an optimization problem with a constraint on the maximum allowable interference on the primary network. Given the hopping period of the PUs, the sensing duration that maximizes the SU throughput is derived. The results are validated using Monte Carlo simulations. Further, an implementation of the FAR algorithm on the Lyrtech (now, Nutaq) small form factor software defined radio development platform is presented, and the performance recorded through the hardware is observed to corroborate well with that obtained through simulations, allowing for implementation losses. (C) 2015 Elsevier B.V. All rights reserved.

In-situ flexural OPV measurements on flexible glass substrate

In-situ dark and light IV characteristics of inverted P3HT-PCBM devices on flexible glass substrates were measured while bending. Bending set up was simple and home built with servo controlled 2 parallel plate movements. ITO was sputter coated onto the thin flexible glass sheets of 25mmx25mm size in the lab. OPV devices were fabricated inside the glove box and conversion efficiency measured was about 2.8%. Bending of the device substrates and simultaneous PV measurements were carried out in ambient conditions. It was observed that the J(SC) and efficiency increased until the substrate breaking point but the V-OC and fill factor remained unchanged.

Sound radiation from a perforated panel set in a baffle with a different perforation ratio

A finite flexible perforated panel set in a differently perforated rigid baffle is considered. The radiation efficiency from such a panel is derived using a 2-D wavenumber domain formulation. This generalization is later used to represent a more practical case of a perforated panel fixed in an unperforated baffle. The perforations are in the form of an array of uniformly distributed circular holes. A complex impedance model for the holes available in the literature is used. An averaged fluid particle velocity is derived using the continuity equation and the surface pressure is derived using an appropriate momentum equation. The discontinuity in the perforate impedance (due to different hole dimensions or perforation ratio) at the panel-baffle interface is carefully taken into account. It is found that there exists a `coupling' of different wavenumbers of the spatially mean fluid particle velocity field. The change in the resonance frequencies and the modeshapes of the panel due to the perforations is taken into account using the Receptance method. Analytical expressions for the radiated power and radiation efficiency are derived in an integral form and numerical results are presented. Several comparisons are made to understand the radiation efficiency curves. Since both the resistive and reactive components of the hole impedance are taken into account, the model is directly applicable to micro-perforated panels also. (C) 2016 Elsevier Ltd. All rights reserved.

A Closer Look at Multiple Forking: Leveraging (In)Dependence for a Tighter Bound

Boldyreva, Palacio and Warinschi introduced a multiple forking game as an extension of general forking. The notion of (multiple) forking is a useful abstraction from the actual simulation of cryptographic scheme to the adversary in a security reduction, and is achieved through the intermediary of a so-called wrapper algorithm. Multiple forking has turned out to be a useful tool in the security argument of several cryptographic protocols. However, a reduction employing multiple forking incurs a significant degradation of , where denotes the upper bound on the underlying random oracle calls and , the number of forkings. In this work we take a closer look at the reasons for the degradation with a tighter security bound in mind. We nail down the exact set of conditions for success in the multiple forking game. A careful analysis of the cryptographic schemes and corresponding security reduction employing multiple forking leads to the formulation of `dependence' and `independence' conditions pertaining to the output of the wrapper in different rounds. Based on the (in)dependence conditions we propose a general framework of multiple forking and a General Multiple Forking Lemma. Leveraging (in)dependence to the full allows us to improve the degradation factor in the multiple forking game by a factor of . By implication, the cost of a single forking involving two random oracles (augmented forking) matches that involving a single random oracle (elementary forking). Finally, we study the effect of these observations on the concrete security of existing schemes employing multiple forking. We conclude that by careful design of the protocol (and the wrapper in the security reduction) it is possible to harness our observations to the full extent.

LEVEL SET输运方程的求解方法及其对气-液两相流运动界面数值模拟的影响

用数值模拟方法来研究气-液两相流动与传热现象是当今多相流领域的一个热门课题.由于两相流固有的复杂性,气-液两相流界面迁移现象的数值模拟一直是两相流研究中的一大难点.本文介绍了捕捉气-液两相流相界面运动的水平集方法(Level Set)及其研究进展,介绍了求解Level Set输运方程的3种方法,即一般差分格式、Superbee-TVD格式和Runge-Kutta法-5阶WENO组合格式.结合主流场的求解,分别用这3种方法对4种典型相界面在5种流场中的迁移特性进行了模拟计算,并对计算结果进行了比较和分析.结果表明,Runge-Kutta法-5阶WENO组合格式求解Level Set输运方程的效果最好,在以后的计算中将主要采用这种组合格式来进行气-液相界面输运方程的求解.