36 resultados para Japanese language.
Resumo:
Flaviviral RNA-dependent RNA polymerases (RdRps) initiate replication of the single-stranded RNA genome in the absence of a primer. The template sequence 5'-CU-3' at the 3'-end of the flaviviral genome is highly conserved. Surprisingly, flaviviral RdRps require high concentrations of the second incoming nucleotide GTP to catalyze de novo template-dependent RNA synthesis. We show that GTP stimulates de novo RNA synthesis by RdRp from Japanese encephalitis virus (jRdRp) also. Crystal structures of jRdRp complexed with GTP and ATP provide a basis for specific recognition of GTP. Comparison of the jRdRp(GTP) structure with other viral RdRp-GTP structures shows that GTP binds jRdRp in a novel conformation. Apo-jRdRp structure suggests that the conserved motif F of jRdRp occupies multiple conformations in absence of GTP. Motif F becomes ordered on GTP binding and occludes the nucleotide triphosphate entry tunnel. Mutational analysis of key residues that interact with GTP evinces that the jRdRp(GTP) structure represents a novel pre-initiation state. Also, binding studies show that GTP binding reduces affinity of RdRp for RNA, but the presence of the catalytic Mn2+ ion abolishes this inhibition. Collectively, these observations suggest that the observed pre-initiation state may serve as a check-point to prevent erroneous template-independent RNA synthesis by jRdRp during initiation.
Resumo:
Polyhedral techniques for program transformation are now used in several proprietary and open source compilers. However, most of the research on polyhedral compilation has focused on imperative languages such as C, where the computation is specified in terms of statements with zero or more nested loops and other control structures around them. Graphical dataflow languages, where there is no notion of statements or a schedule specifying their relative execution order, have so far not been studied using a powerful transformation or optimization approach. The execution semantics and referential transparency of dataflow languages impose a different set of challenges. In this paper, we attempt to bridge this gap by presenting techniques that can be used to extract polyhedral representation from dataflow programs and to synthesize them from their equivalent polyhedral representation. We then describe PolyGLoT, a framework for automatic transformation of dataflow programs which we built using our techniques and other popular research tools such as Clan and Pluto. For the purpose of experimental evaluation, we used our tools to compile LabVIEW, one of the most widely used dataflow programming languages. Results show that dataflow programs transformed using our framework are able to outperform those compiled otherwise by up to a factor of seventeen, with a mean speed-up of 2.30x while running on an 8-core Intel system.
Resumo:
Productive infection of human amniotic and endothelial cell lines with Japanese encephalitis virus (JEV) was established leading to the induction of NF kappa B and HLA-F, a non-classical MHC molecule. Induction of the HLA-F gene and protein in JEV-infected cells was shown to be NF kappa B dependent since it was blocked by inhibitors of NF kappa B activation. ShRNA targeting lentivirus-mediated stable knockdown of the p65 subunit of NF kappa B inhibited JEV-mediated induction of HLA-F both in the amniotic cell line, AV-3 as well as the human brain microendothelial cell line, HBMEC. The induction of HLA-F by treatment of AV-3 with TNF-alpha was also inhibited by ShRNA mediated knockdown of NF kappa B. TNF-alpha treatment of HEK293T cells that were transfected with reporter plasmids under the control of HLA-F enhancer A elements resulted in significant transactivation of the luciferase reporter gene. NF kappa B-mediated induction of HLA-F following JEV infection and TNF-alpha exposure is being suggested for the first time. (C) 2014 Elsevier Inc. All rights reserved.
Resumo:
Productive infection of human endothelial cells with Japanese encephalitis virus (JEV), a single stranded RNA virus induces shedding of sHLA-E. We show here that sHLA-E that is released upon infection with this flavivirus can inhibit IL-2 and PMA mediated ERK 1/2 phosphorylation in two NK cell lines, Nishi and NKL. Virus infected or IFN-gamma treated cell culture supernatants containing sHLA-E were found to partially inhibit IL-2 mediated induction of CD25 molecules on NKL cells. It was also found that sHLA-E could inhibit IL-2 induced H-3]-thymidine incorporation suggesting that, similar to cell surface expressed HLA-E, sHLA-E could also inhibit NK cell responses. Hence JEV-induced shedding of sHLA-E needs further investigation to better understand immune responses in JEV infections since it may have a role in viral evasion of NK cell responses. (C) 2014 Elsevier B.V. All rights reserved.
Resumo:
Identifying translations from comparable corpora is a well-known problem with several applications, e.g. dictionary creation in resource-scarce languages. Scarcity of high quality corpora, especially in Indian languages, makes this problem hard, e.g. state-of-the-art techniques achieve a mean reciprocal rank (MRR) of 0.66 for English-Italian, and a mere 0.187 for Telugu-Kannada. There exist comparable corpora in many Indian languages with other ``auxiliary'' languages. We observe that translations have many topically related words in common in the auxiliary language. To model this, we define the notion of a translingual theme, a set of topically related words from auxiliary language corpora, and present a probabilistic framework for translation induction. Extensive experiments on 35 comparable corpora using English and French as auxiliary languages show that this approach can yield dramatic improvements in performance (e.g. MRR improves by 124% to 0.419 for Telugu-Kannada). A user study on WikiTSu, a system for cross-lingual Wikipedia title suggestion that uses our approach, shows a 20% improvement in the quality of titles suggested.
Resumo:
Graph algorithms have been shown to possess enough parallelism to keep several computing resources busy-even hundreds of cores on a GPU. Unfortunately, tuning their implementation for efficient execution on a particular hardware configuration of heterogeneous systems consisting of multicore CPUs and GPUs is challenging, time consuming, and error prone. To address these issues, we propose a domain-specific language (DSL), Falcon, for implementing graph algorithms that (i) abstracts the hardware, (ii) provides constructs to write explicitly parallel programs at a higher level, and (iii) can work with general algorithms that may change the graph structure (morph algorithms). We illustrate the usage of our DSL to implement local computation algorithms (that do not change the graph structure) and morph algorithms such as Delaunay mesh refinement, survey propagation, and dynamic SSSP on GPU and multicore CPUs. Using a set of benchmark graphs, we illustrate that the generated code performs close to the state-of-the-art hand-tuned implementations.