On Walkup's class K (d) and a minimal triangulation of (S-3 (sic) S-1)(#3)

For d >= 2, Walkup's class K (d) consists of the d-dimensional simplicial complexes all whose vertex-links are stacked (d - 1)-spheres. Kalai showed that for d >= 4, all connected members of K (d) are obtained from stacked d-spheres by finitely many elementary handle additions. According to a result of Walkup, the face vector of any triangulated 4-manifold X with Euler characteristic chi satisfies f(1) >= 5f(0) - 15/2 chi, with equality only for X is an element of K(4). Kuhnel observed that this implies f(0)(f(0) - 11) >= -15 chi, with equality only for 2-neighborly members of K(4). Kuhnel also asked if there is a triangulated 4-manifold with f(0) = 15, chi = -4 (attaining equality in his lower bound). In this paper, guided by Kalai's theorem, we show that indeed there is such a triangulation. It triangulates the connected sum of three copies of the twisted sphere product S-3 (sic) S-1. Because of Kuhnel's inequality, the given triangulation of this manifold is a vertex-minimal triangulation. By a recent result of Effenberger, the triangulation constructed here is tight. Apart from the neighborly 2-manifolds and the infinite family of (2d + 3)-vertex sphere products Sd-1 X S-1 (twisted for d odd), only fourteen tight triangulated manifolds were known so far. The present construction yields a new member of this sporadic family. We also present a self-contained proof of Kalai's result. (C) 2011 Elsevier B.V. All rights reserved.

Functional Significance of an Evolutionarily Conserved Alanine (GCA) Resume Codon in tmRNA in Escherichia coli

Occasionally, ribosomes stall on mRNAs prior to the completion of the polypeptide chain. In Escherichia coli and other eubacteria, tmRNA-mediated trans-translation is a major mechanism that recycles the stalled ribosomes. The tmRNA possesses a tRNA-like domain and a short mRNA region encoding a short peptide (ANDENYALAA in E. coli) followed by a termination codon. The first amino acid (Ala) of this peptide encoded by the resume codon (GCN) is highly conserved in tmRNAs in different species. However, reasons for the high evolutionary conservation of the resume codon identity have remained unclear. In this study, we show that changing the E. coli tmRNA resume codon to other efficiently translatable codons retains efficient functioning of the tmRNA. However, when the resume codon was replaced with the low-usage codons, its function was adversely affected. Interestingly, expression of tRNAs decoding the low-usage codon from plasmid-borne gene copies restored efficient utilization of tmRNA. We discuss why in E. coli, the GCA (Ala) is one of the best codons and why all codons in the short mRNA of the tmRNA are decoded by the abundant tRNAs.

Improving web server performance by network aware data buffering and caching

In this paper we propose a new method of data handling for web servers. We call this method Network Aware Buffering and Caching (NABC for short). NABC facilitates reduction of data copies in web server's data sending path, by doing three things: (1) Layout the data in main memory in a way that protocol processing can be done without data copies (2) Keep a unified cache of data in kernel and ensure safe access to it by various processes and kernel and (3) Pass only the necessary meta data between processes so that bulk data handling time spent during IPC can be reduced. We realize NABC by implementing a set of system calls and an user library. The end product of the implementation is a set of APIs specifically designed for use by the web servers. We port an in house web server called SWEET, to NABC APIs and evaluate performance using a range of workloads both simulated and real. The results show a very impressive gain of 12% to 21% in throughput for static file serving and 1.6 to 4 times gain in throughput for lightweight dynamic content serving for a server using NABC APIs over the one using UNIX APIs.

The beta-glucoside genes of Klebsiella aerogenes: conservation and divergence in relation to the cryptic bgl genes of Escherichia coli

The ability to metabolize aromatic beta-glucosides such as salicin and arbutin varies among members of the Enterobacteriaceae. The ability of Escherichia coli to degrade salicin and arbutin appears to be cryptic, subject to activation of the bgl genes, whereas many members of the Klebsiella genus can metabolize these sugars. We have examined the genetic basis for beta-glucoside utilization in Klebsiella aerogenes. The Klebsiella equivalents of bglG, bglB and bglR have been cloned using the genome sequence database of Klebsiella pneumoniae. Nucleotide sequencing shows that the K. aerogenes bgl genes show substantial similarities to the E. coli counterparts. The K. aerogenes bgl genes in multiple copies can also complement E. coli mutants deficient in bglG encoding the antiterminator and bglB encoding the phospho-beta-glucosidase, suggesting that they are functional homologues. The regulatory region bglR of K aerogenes shows a high degree of similarity of the sequences involved in BglG-mediated regulation. Interestingly, the regions corresponding to the negative elements present in the E. coli regulatory region show substantial divergence in K aerogenes. The possible evolutionary implications of the results are discussed. (C) 2003 Federation of European Microbiological Societies. Published by Elsevier Science B.v. All rights reserved.

Federated Search Service for OAI-compliant, Open-Access Repositories in India

Many of the research institutions and universities across the world are facilitating open-access (OA) to their intellectual outputs through their respective OA institutional repositories (IRs) or through the centralized subject-based repositories. The registry of open access repositories (ROAR) lists more than 2850 such repositories across the world. The awareness about the benefits of OA to scholarly literature and OA publishing is picking up in India, too. As per the ROAR statistics, to date, there are more than 90 OA repositories in the country. India is doing particularly well in publishing open-access journals (OAJ). As per the directory of open-access journals (DOAJ), to date, India with 390 OAJs, is ranked 5th in the world in terms of numbers of OAJs being published. Much of the research done in India is reported in the journals published from India. These journals have limited readership and many of them are not being indexed by Web of Science, Scopus or other leading international abstracting and indexing databases. Consequently, research done in the country gets hidden not only from the fellow countrymen, but also from the international community. This situation can be easily overcome if all the researchers facilitate OA to their publications. One of the easiest ways to facilitate OA to scientific literature is through the institutional repositories. If every research institution and university in India set up an open-access IR and ensure that copies of the final accepted versions of all the research publications are uploaded in the IRs, then the research done in India will get far better visibility. The federation of metadata from all the distributed, interoperable OA repositories in the country will serve as a window to the research done across the country. Federation of metadata from the distributed OAI-compliant repositories can be easily achieved by setting up harvesting software like the PKP Harvester. In this paper, we share our experience in setting up a prototype metadata harvesting service using the PKP harvesting software for the OAI-compliant repositories in India.

Efficient Runtime Detection and Toleration of Asymmetric Races

We introduce ToleRace, a runtime system that allows programs to detect and even tolerate asymmetric data races. Asymmetric races are race conditions where one thread correctly acquires and releases a lock for a shared variable while another thread improperly accesses the same variable. ToleRace provides approximate isolation in the critical sections of lock-based parallel programs by creating a local copy of each shared variable when entering a critical section, operating on the local copies, and propagating the appropriate copies upon leaving the critical section. We start by characterizing all possible interleavings that can cause races and precisely describe the effect of ToleRace in each case. Then, we study the theoretical aspects of an oracle that knows exactly what type of interleaving has occurred. Finally, we present software implementations of ToleRace and evaluate them on multithreaded applications from the SPLASH2 and PARSEC suites.

Boxicity and Poset Dimension

Let G be a simple, undirected, finite graph with vertex set V (G) and edge set E(G). A k-dimensional box is a Cartesian product of closed intervals [a(1), b(1)] x [a(2), b(2)] x ... x [a(k), b(k)]. The boxicity of G, box(G), is the minimum integer k such that G can be represented as the intersection graph of k-dimensional boxes; i.e., each vertex is mapped to a k-dimensional box and two vertices are adjacent in G if and only if their corresponding boxes intersect. Let P = (S, P) be a poset, where S is the ground set and P is a reflexive, antisymmetric and transitive binary relation on S. The dimension of P, dim(P), is the minimum integer t such that P can be expressed as the intersection of t total orders. Let G(P) be the underlying comparability graph of P; i.e., S is the vertex set and two vertices are adjacent if and only if they are comparable in P. It is a well-known fact that posets with the same underlying comparability graph have the same dimension. The first result of this paper links the dimension of a poset to the boxicity of its underlying comparability graph. In particular, we show that for any poset P, box(G(P))/(chi(G(P)) - 1) <= dim(P) <= 2box(G(P)), where chi(G(P)) is the chromatic number of G(P) and chi(G(P)) not equal 1. It immediately follows that if P is a height-2 poset, then box(G(P)) <= dim(P) <= 2box(G(P)) since the underlying comparability graph of a height-2 poset is a bipartite graph. The second result of the paper relates the boxicity of a graph G with a natural partial order associated with the extended double cover of G, denoted as G(c): Note that G(c) is a bipartite graph with partite sets A and B which are copies of V (G) such that, corresponding to every u is an element of V (G), there are two vertices u(A) is an element of A and u(B) is an element of B and {u(A), v(B)} is an edge in G(c) if and only if either u = v or u is adjacent to v in G. Let P(c) be the natural height-2 poset associated with G(c) by making A the set of minimal elements and B the set of maximal elements. We show that box(G)/2 <= dim(P(c)) <= 2box(G) + 4. These results have some immediate and significant consequences. The upper bound dim(P) <= 2box(G(P)) allows us to derive hitherto unknown upper bounds for poset dimension such as dim(P) = 2 tree width (G(P)) + 4, since boxicity of any graph is known to be at most its tree width + 2. In the other direction, using the already known bounds for partial order dimension we get the following: (1) The boxicity of any graph with maximum degree Delta is O(Delta log(2) Delta), which is an improvement over the best-known upper bound of Delta(2) + 2. (2) There exist graphs with boxicity Omega(Delta log Delta). This disproves a conjecture that the boxicity of a graph is O(Delta). (3) There exists no polynomial-time algorithm to approximate the boxicity of a bipartite graph on n vertices with a factor of O(n(0.5-is an element of)) for any is an element of > 0 unless NP = ZPP.

A full-length bifunctional protein involved in c-di-GMP turnover is required for long-term survival under nutrient starvation in Mycobacterium smegmatis

The bacterial second messenger cyclic diguanosine monophosphate (c-di-GMP) plays an important role in a variety of cellular functions, including biofilm formation, alterations in the cell surface, host colonization and regulation of bacterial flagellar motility, which enable bacteria to survive changing environmental conditions. The cellular level of c-di-GMP is regulated by a balance between opposing activities of diguanylate cyclases (DGCs) and cognate phosphodiesterases (PDE-As). Here, we report the presence and importance of a protein, MSDGC-1 (an orthologue of Rv1354c in Mycobacterium tuberculosis), involved in c-di-GMP turnover in Mycobacterium smegmatis. MSDGC-1 is a multidomain protein, having GAF, GGDEF and EAL domains arranged in tandem, and exhibits both c-di-GMP synthesis and degradation activities. Most other proteins containing GGDEF and EAL domains have been demonstrated to have either DGC or PDE-A activity. Unlike other bacteria, which harbour several copies of the protein involved in c-di-GMP turnover, M. smegmatis has a single genomic copy, deletion of which severely affects long-term survival under conditions of nutrient starvation. Overexpression of MSDGC-1 alters the colony morphology and growth profile of M. smegmatis. In order to gain insights into the regulation of the c-di-GMP level, we cloned individual domains and tested their activities. We observed a loss of activity in the separated domains, indicating the importance of full-length MSDGC-1 for controlling bifunctionality.

Multiple molecular alterations in phosphodegrons 1-3 within AAV2 capsid demonstrates higher hepatic gene transfer efficiency

The success of AAV2 mediated hepatic gene transfer in human trials for diseases such as hemophilia has been hampered by a combination of low transduction efficiency and a robust immune response directed against these vectors. We have previously shown that AAV2 is targeted for destruction in the cytoplasm by the host-cellular kinase/ubiquitination/proteasomal degradation machinery and modification of the serine(S)/threonine(T) kinase and lysine(K) targets on AAV capsid is beneficial. Thus targeted single mutations of S/T>A(S489A, S498A, T251A) and K>R (K532R) improved the efficiency of gene transfer in vivo as compared to wild type (WT)-AAV2 vectors (∼6-14 fold). In the present study, we evaluated if combined alteration of the phosphodegrons (PD), which are the phosphorylation sites recognized as degradation signals by ubiquitin ligases, improves further the gene transfer efficiency. Thus, we generated four multiple mutant vectors (PD: 1+3, S489A+K532R, PD: 1+3, S489A+K532R together with T251 residue which did not lie in any of the phosphodegrons but had shown increased transduction efficiency compared to the WT-AAV2 vector (∼6 fold) and was also conserved in 9 out of 10 AAV serotypes (AAV 1 to 10), PD: 1+3, S489A+K532R+S498A and a fourth combination of PD: 3, K532R+T251. We then evaluated them in vitro and in vivo and compared their gene transfer efficiency with either the WT-AAV2 or the best single mutant S489A-AAV2 vector. The novel multiple mutations on the AAV2 capsid did not affect the overall vector packaging efficiency. All the multiple AAV2 mutants showed superior transduction efficiency in HeLa cells in vitro when compared to either the WT (62-72% Vs 21%) or the single mutant S489A (62-72% Vs 50%) AAV2 vectors as demonstrated by FACS analysis (Fig. 1A). On hepatic gene transfer with 5x10^10 vgs per animal in C57BL/6 mice, all the multiple mutants showed increased transgene expression compared to either the WT-AAV2 (∼15-23 fold) or the S489A single mutant vector (∼2-3 fold) (Fig.1B and C). These novel multiple mutant AAV2 vectors also showed higher vector copy number in murine hepatocytes 4 weeks post transduction, as compared to the WT-AAV2 (∼5-6 Vs 1.4 vector copies/diploid genome) and further higher when compared to the single mutant S489A(∼5-6 fold Vs 3.8 fold) (Fig.1D). Further ongoing studies will demonstrate the therapeutic benefit of one or more of the multiple mutants vectors in preclinical models of hemophilia.

How Many Initiator tRNA Genes Does Escherichia coli Need?

Multiple copies of a gene require enhanced investment on the part of the cell and, as such, call for an explanation. The observation that Escherichia coli has four copies of initiator tRNA (tRNA(i)) genes, encoding a special tRNA (tRNA(fMet)) required to start protein synthesis, is puzzling particularly because the cell appears to be unaffected by the removal of one copy. However, the fitness of an organism has both absolute and relative connotations. Thus, we carried out growth competition experiments between E. coli strains that differ in the number of tRNA(i) genes they contain. This has enabled us to uncover an unexpected link between the number of tRNA(i) genes and protein synthesis, nutritional status, and fitness. Wild-type strains with the canonical four tRNA(i) genes are favored in nutrient-rich environments, and those carrying fewer are favored in nutrient-poor environments. Auxotrophs behave as if they have a nutritionally poor internal environment. A heuristic model that links tRNA(i) gene copy number, genetic stress, and growth rate accounts for the findings. Our observations provide strong evidence that natural selection can work through seemingly minor quantitative variations in gene copy number and thereby impact organismal fitness.

Efficient generation of diffraction-limited multi-sheet pattern for biological imaging

We demonstrate a new technique to generate multiple light-sheets for fluorescence microscopy. This is possible by illuminating the cylindrical lens using multiple copies of Gaussian beams. A diffraction grating placed just before the cylindrical lens splits the incident Gaussian beam into multiple beams traveling at different angles. Subsequently, this gives rise to diffraction-limited light-sheets after the Gaussian beams pass through the combined cylindrical lens-objective sub-system. Direct measurement of field at and around the focus of objective lens shows multi-sheet pattern with an average thickness of 7.5 mu m and inter-sheet separation of 380 mu m. Employing an independent orthogonal detection sub-system, we successfully imaged fluorescently-coated yeast cells (approximate to 4 mu m) encaged in agarose gel-matrix. Such a diffraction-limited sheet-pattern equipped with dedicated detection system may find immediate applications in the field of optical microscopy and fluorescence imaging. (C) 2015 Optical Society of America

3D Macroporous Solids from Chemically Cross-linked Carbon Nanotubes

We demonstrate a new technique to generate multiple light-sheets for fluorescence microscopy. This is possible by illuminating the cylindrical lens using multiple copies of Gaussian beams. A diffraction grating placed just before the cylindrical lens splits the incident Gaussian beam into multiple beams traveling at different angles. Subsequently, this gives rise to diffraction-limited light-sheets after the Gaussian beams pass through the combined cylindrical lens-objective sub-system. Direct measurement of field at and around the focus of objective lens shows multi-sheet pattern with an average thickness of 7.5 μm and inter-sheet separation of 380 μm. Employing an independent orthogonal detection sub-system, we successfully imaged fluorescently-coated yeast cells (≈4 μm) encaged in agarose gel-matrix. Such a diffraction-limited sheet-pattern equipped with dedicated detection system may find immediate applications in the field of optical microscopy and fluorescence imaging. © 2015 Optical Society of America

Targeted Modifications in Adeno-Associated Virus Serotype 8 Capsid Improves Its Hepatic Gene Transfer Efficiency In Vivo

Recombinant adeno-associated virus vectors based on serotype 8 (AAV8) have shown significant promise for liver-directed gene therapy. However, to overcome the vector dose dependent immunotoxicity seen with AAV8 vectors, it is important to develop better AAV8 vectors that provide enhanced gene expression at significantly low vector doses. Since it is known that AAV vectors during intracellular trafficking are targeted for destruction in the cytoplasm by the host-cellular kinase/ubiquitination/proteasomal machinery, we modified specific serine/threonine kinase or ubiquitination targets on the AAV8 capsid to augment its transduction efficiency. Point mutations at specific serine (S)/threonine (T)/lysine (K) residues were introduced in the AAV8 capsid at the positions equivalent to that of the effective AAV2 mutants, generated successfully earlier. Extensive structure analysis was carried out subsequently to evaluate the structural equivalence between the two serotypes. scAAV8 vectors with the wild-type (WT) and each one of the S/T -> Alanine (A) or K-Arginine (R) mutant capsids were evaluated for their liver transduction efficiency in C57BL/6 mice in vivo. Two of the AAV8-S -> A mutants (S279A and S671A), and a K137R mutant vector, demonstrated significantly higher enhanced green fluorescent protein (EGFP) transcript levels (similar to 9- to 46-fold) in the liver compared to animals that received WT-AAV8 vectors alone. The best performing AAV8 mutant (K137R) vector also had significantly reduced ubiquitination of the viral capsid, reduced activation of markers of innate immune response, and a concomitant two-fold reduction in the levels of neutralizing antibody formation in comparison to WT-AAV8 vectors. Vector bio-distribution studies revealed that the K137R mutant had a significantly higher and preferential transduction of the liver (106 vs. 7.7 vector copies/mouse diploid genome) when compared to WT-AAV8 vectors. To further study the utility of the K137R-AAV8 mutant in therapeutic gene transfer, we delivered human coagulation factor IX (h. FIX) under the control of liver-specific promoters (LP1 or hAAT) into C57BL/6 mice. The circulating levels of h. FIX: Ag were higher in all the K137R-AAV8 treated groups up to 8 weeks post-hepatic gene transfer. These studies demonstrate the feasibility of the use of this novel AAV8 vectors for potential gene therapy of hemophilia B.

Structural studies on tobacco streak virus coat protein: Insights into the pleomorphic nature of ilarviruses

Tobacco streak virus (TSV), the type member of Ilarvirus genus, is a major plant pathogen. TSV purified from infected plants consists of a ss-RNA genome encapsidated in spheroidal particles with diameters of 27, 30 and 33 nm constructed from multiple copies of a single species of coat protein (CP) subunits. Apart from protecting the viral genome, CPs of ilarviruses play several key roles in the life cycle of these viruses. Unlike the related bromo and cucumoviruses, ilarvirus particles are labile and pleomorphic, which has posed difficulties in their crystallization and structure determination. In the current study, a truncated TSV-CP was crystallized in two distinct forms and their structures were determined at resolutions of 2.4 angstrom and 2.1 angstrom, respectively. The core of TSV CP was found to possess the canonical beta-barrel jelly roll tertiary structure observed in several other viruses. Dimers of CP with swapped C-terminal arms (C-arm) were observed in both the crystal forms. The C-arm was found to be flexible and is likely to be responsible for the polymorphic and pleomorphic nature of TSV capsids. Consistent with this observation, mutations in the hinge region of the C-arm that reduce the flexibility resulted in the formation of more uniform particles. TSV CP was found to be structurally similar to that of Alfalfa mosaic virus (AMV) accounting for similar mechanism of genome activation in alfamo and ilar viruses. This communication represents the first report on the structure of the CP from an ilarvirus. (C) 2015 Elsevier Inc. All rights reserved.

Social optimum in social groups with give-and-take criterion

We consider a Social Group' of networked nodes, seeking a universe' of segments. Each node has a subset of the universe and access to an expensive resource for downloading data. Nodes can also acquire the universe by exchanging copies of segments among themselves, at low cost, using inter-node links. While exchanges over inter-node links ensure minimum cost, some nodes in the group try to exploit the system. We term such nodes as non-reciprocating nodes' and prohibit such behavior by proposing the give-and-take' criterion, where exchange is allowed if each node has segments unavailable with the other. Under this criterion, we consider the problem of maximizing the number of nodes with the universe at the end of local exchanges. First, we present a randomized algorithm that is shown to be optimal in the asymptotic regime. Then, we present greedy links algorithm, which performs well for most of the scenarios and yields an optimal result when the number of nodes is four. The polygon algorithm is proposed, which yields an optimal result when each of the nodes has a unique segment. After presenting some intuitive algorithms (e.g., greedy incremental algorithm and rarest first algorithm), we compare the performances of all proposed algorithms with the optimal. Copyright (c) 2015 John Wiley & Sons, Ltd.