119 resultados para Graders (Earthmoving machinery)
Resumo:
The maintenance of ion channel homeostasis, or channelostasis, is a complex puzzle in neurons with extensive dendritic arborization, encompassing a combinatorial diversity of proteins that encode these channels and their auxiliary subunits, their localization profiles, and associated signaling machinery. Despite this, neurons exhibit amazingly stereotypic, topographically continuous maps of several functional properties along their active dendritic arbor. Here, we asked whether the membrane composition of neurons, at the level of individual ion channels, is constrained by this structural requirement of sustaining several functional maps along the same topograph. We performed global sensitivity analysis on morphologically realistic conductance-based models of hippocampal pyramidal neurons that coexpressed six well-characterized functional maps along their trunk. We generated randomized models by varying 32 underlying parameters and constrained these models with quantitative experimental measurements from the soma and dendrites of hippocampal pyramidal neurons. Analyzing valid models that satisfied experimental constraints on all six functional maps, we found topographically analogous functional maps to emerge from disparate model parameters with weak pairwise correlations between parameters. Finally, we derived a methodology to assess the contribution of individual channel conductances to the various functional measurements, using virtual knockout simulations on the valid model population. We found that the virtual knockout of individual channels resulted in variable, measurement and location-specific impacts across the population. Our results suggest collective channelostasis as a mechanism behind the robust emergence of analogous functional maps and have significant ramifications for the localization and targeting of ion channels and enzymes that regulate neural coding and homeostasis.
Resumo:
The malaria parasite experiences a significant amount of redox stress during its growth in human erythrocytes and heavily relies on secretory functions for pathogenesis. Most certainly, the parasite is equipped with machinery to tackle perturbations in the secretory pathway, like the unfolded protein response pathway in higher eukaryotes. Our bioinformatics analysis revealed the complete absence of genes involved in the canonical unfolded protein response pathway in Plasmodium falciparum. Accordingly, the parasite was unable to up-regulate endoplasmic reticulum (ER) chaperones or ER-associated degradation in response to DTT-mediated ER stress. Global profiling of gene expression upon DTT treatment revealed a network of AP2 transcription factors and their targets being activated. The overall outcome was up-regulation of genes involved in protein export and the sexual stage of the parasite life cycle culminating in gametocytogenesis. Our results suggest that the malaria parasite uses ER stress as a cue to switch to the transmissible sexual stages.
Resumo:
Cancer has always been a dreadful disease and continues to attract extensive research investigations. Various targets have been identified to restrain cancer. Among these DNA happens to be the most explored one. A wide variety of small molecules, often referred to as `ligands', has been synthesized to target numerous structural features of DNA. The sole purpose of such molecular design has been to interfere with the transcriptional machinery in order to drive the cancer cell toward apoptosis. The mode of action of the DNA targeting ligands focuses either on the sequence-specificity by groove binding and strand cleavage, or by identifying the morphologically distinct higher order structures like that of the G-quadruplex DNA. However, in spite of the extensive research, only a tiny fraction of the molecules have been able to reach clinical trials and only a handful are used in chemotherapy. This review attempts to record the journey of the DNA binding small molecules from its inception to cancer therapy via various modifications at the molecular level. Nevertheless, factors like limited bioavailability, severe toxicities, unfavorable pharmacokinetics etc. still prove to be the major impediments in the field which warrant considerable scope for further research investigations. (C) 2014 Published by Elsevier Ltd.
Resumo:
High temperature, high pressure transcritical condensing CO2 cycle (TC-CO2) is compared with transcritical steam (TC-steam) cycle. Performance indicators such as thermal efficiency, volumetric flow rates and entropy generation are used to analyze the power cycle wherein, irreversibilities in turbo-machinery and heat exchangers are taken into account. Although, both cycles yield comparable thermal efficiencies under identical operating conditions, TC-CO2 plant is significantly compact compared to a TC-steam plant. Large specific volume of steam is responsible for a bulky system. It is also found that the performance of a TC-CO2 cycle is less sensitive to source temperature variations, which is an important requirement of a solar thermal system. In addition, issues like wet expansion in turbine and vacuum in condenser are absent in case of a TC-CO2 cycle. External heat addition to working fluid is assumed to take place through a heat transfer fluid (HTF) which receives heat from a solar receiver. A TC-CO2 system receives heat though a single HTF loop, whereas, for TC-steam cycle two HTF loops in series are proposed to avoid high temperature differential between the steam and HTF. (C) 2013 P. Garg. Published by Elsevier Ltd.
Resumo:
Redox imbalance generates multiple cellular damages leading to oxidative stress-mediated pathological conditions such as neurodegenerative diseases and cancer progression. Therefore, maintenance of reactive oxygen species (ROS) homeostasis is most important that involves well-defined antioxidant machinery. In the present study, we have identified for the first time a component of mammalian protein translocation machinery Magmas to perform a critical ROS regulatory function. Magmas overexpression has been reported in highly metabolically active tissues and cancer cells that are prone to oxidative damage. We found that Magmas regulates cellular ROS levels by controlling its production as well as scavenging. Magmas promotes cellular tolerance toward oxidative stress by enhancing antioxidant enzyme activity, thus preventing induction of apoptosis and damage to cellular components. Magmas enhances the activity of electron transport chain (ETC) complexes, causing reduced ROS production. Our results suggest that J-like domain of Magmas is essential for maintenance of redox balance. The function of Magmas as a ROS sensor was found to be independent of its role in protein import. The unique ROS modulatory role of Magmas is highlighted by its ability to increase cell tolerance to oxidative stress even in yeast model organism. The cytoprotective capability of Magmas against oxidative damage makes it an important candidate for future investigation in therapeutics of oxidative stress-related diseases.
Resumo:
We apply the objective method of Aldous to the problem of finding the minimum-cost edge cover of the complete graph with random independent and identically distributed edge costs. The limit, as the number of vertices goes to infinity, of the expected minimum cost for this problem is known via a combinatorial approach of Hessler and Wastlund. We provide a proof of this result using the machinery of the objective method and local weak convergence, which was used to prove the (2) limit of the random assignment problem. A proof via the objective method is useful because it provides us with more information on the nature of the edge's incident on a typical root in the minimum-cost edge cover. We further show that a belief propagation algorithm converges asymptotically to the optimal solution. This can be applied in a computational linguistics problem of semantic projection. The belief propagation algorithm yields a near optimal solution with lesser complexity than the known best algorithms designed for optimality in worst-case settings.
Resumo:
Programming environments for smartphones expose a concurrency model that combines multi-threading and asynchronous event-based dispatch. While this enables the development of efficient and feature-rich applications, unforeseen thread interleavings coupled with non-deterministic reorderings of asynchronous tasks can lead to subtle concurrency errors in the applications. In this paper, we formalize the concurrency semantics of the Android programming model. We further define the happens-before relation for Android applications, and develop a dynamic race detection technique based on this relation. Our relation generalizes the so far independently studied happens-before relations for multi-threaded programs and single-threaded event-driven programs. Additionally, our race detection technique uses a model of the Android runtime environment to reduce false positives. We have implemented a tool called DROIDRACER. It generates execution traces by systematically testing Android applications and detects data races by computing the happens-before relation on the traces. We analyzed 1 5 Android applications including popular applications such as Facebook, Twitter and K-9 Mail. Our results indicate that data races are prevalent in Android applications, and that DROIDRACER is an effective tool to identify data races.
Resumo:
Task-parallel languages are increasingly popular. Many of them provide expressive mechanisms for intertask synchronization. For example, OpenMP 4.0 will integrate data-driven execution semantics derived from the StarSs research language. Compared to the more restrictive data-parallel and fork-join concurrency models, the advanced features being introduced into task-parallelmodels in turn enable improved scalability through load balancing, memory latency hiding, mitigation of the pressure on memory bandwidth, and, as a side effect, reduced power consumption. In this article, we develop a systematic approach to compile loop nests into concurrent, dynamically constructed graphs of dependent tasks. We propose a simple and effective heuristic that selects the most profitable parallelization idiom for every dependence type and communication pattern. This heuristic enables the extraction of interband parallelism (cross-barrier parallelism) in a number of numerical computations that range from linear algebra to structured grids and image processing. The proposed static analysis and code generation alleviates the burden of a full-blown dependence resolver to track the readiness of tasks at runtime. We evaluate our approach and algorithms in the PPCG compiler, targeting OpenStream, a representative dataflow task-parallel language with explicit intertask dependences and a lightweight runtime. Experimental results demonstrate the effectiveness of the approach.
Resumo:
Designing and implementing thread-safe multithreaded libraries can be a daunting task as developers of these libraries need to ensure that their implementations are free from concurrency bugs, including deadlocks. The usual practice involves employing software testing and/or dynamic analysis to detect. deadlocks. Their effectiveness is dependent on well-designed multithreaded test cases. Unsurprisingly, developing multithreaded tests is significantly harder than developing sequential tests for obvious reasons. In this paper, we address the problem of automatically synthesizing multithreaded tests that can induce deadlocks. The key insight to our approach is that a subset of the properties observed when a deadlock manifests in a concurrent execution can also be observed in a single threaded execution. We design a novel, automatic, scalable and directed approach that identifies these properties and synthesizes a deadlock revealing multithreaded test. The input to our approach is the library implementation under consideration and the output is a set of deadlock revealing multithreaded tests. We have implemented our approach as part of a tool, named OMEN1. OMEN is able to synthesize multithreaded tests on many multithreaded Java libraries. Applying a dynamic deadlock detector on the execution of the synthesized tests results in the detection of a number of deadlocks, including 35 real deadlocks in classes documented as thread-safe. Moreover, our experimental results show that dynamic analysis on multithreaded tests that are either synthesized randomly or developed by third-party programmers are ineffective in detecting the deadlocks.
Resumo:
Dynamic analysis techniques have been proposed to detect potential deadlocks. Analyzing and comprehending each potential deadlock to determine whether the deadlock is feasible in a real execution requires significant programmer effort. Moreover, empirical evidence shows that existing analyses are quite imprecise. This imprecision of the analyses further void the manual effort invested in reasoning about non-existent defects. In this paper, we address the problems of imprecision of existing analyses and the subsequent manual effort necessary to reason about deadlocks. We propose a novel approach for deadlock detection by designing a dynamic analysis that intelligently leverages execution traces. To reduce the manual effort, we replay the program by making the execution follow a schedule derived based on the observed trace. For a real deadlock, its feasibility is automatically verified if the replay causes the execution to deadlock. We have implemented our approach as part of WOLF and have analyzed many large (upto 160KLoC) Java programs. Our experimental results show that we are able to identify 74% of the reported defects as true (or false) positives automatically leaving very few defects for manual analysis. The overhead of our approach is negligible making it a compelling tool for practical adoption.
Resumo:
Nonhomologous DNA end joining (NHEJ) is one of the major double-strand break (DSB) repair pathways in higher eukaryotes. Recently, it has been shown that alternative NHEJ (A-NHEJ) occurs in the absence of classical NHEJ and is implicated in chromosomal translocations leading to cancer. In the present study, we have developed a novel biochemical assay system utilizing DSBs flanked by varying lengths of microhomology to study microhomology-mediated alternative end joining (MMEJ). We show that MMEJ can operate in normal cells, when microhomology is present, irrespective of occurrence of robust classical NHEJ. Length of the microhomology determines the efficiency of MMEJ, 5 nt being obligatory. Using this biochemical approach, we show that products obtained are due to MMEJ, which is dependent on MRE11, NBS1, LIGASE III, XRCC1, FEN1 and PARP1. Thus, we define the enzymatic machinery and microhomology requirements of alternative NHEJ using a well-defined biochemical system.
Resumo:
Mycobacteria are endowed with rich and diverse machinery for the synthesis, utilization, and degradation of cAMP. The actions of cyclic nucleotides are generally mediated by binding of cAMP to conserved and well characterized cyclic nucleotide binding domains or structurally distinct cGMP-specific and -regulated cyclic nucleotide phosphodiesterase, adenylyl cyclase, and E. coli transcription factor FhlA (GAF) domain-containing proteins. Proteins with cyclic nucleotide binding and GAF domains can be identified in the genome of mycobacterial species, and some of them have been characterized. Here, we show that a significant fraction of intracellular cAMP is bound to protein in mycobacterial species, and by using affinity chromatography techniques, we identify specific universal stress proteins (USP) as abundantly expressed cAMP-binding proteins in slow growing as well as fast growing mycobacteria. We have characterized the biochemical and thermodynamic parameters for binding of cAMP, and we show that these USPs bind cAMP with a higher affinity than ATP, an established ligand for other USPs. We determined the structure of the USP MSMEG_3811 bound to cAMP, and we confirmed through structure-guided mutagenesis, the residues important for cAMP binding. This family of USPs is conserved in all mycobacteria, and we suggest that they serve as ``sinks'' for cAMP, making this second messenger available for downstream effectors as and when ATP levels are altered in the cell.
Resumo:
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.
Resumo:
Plant viruses exploit the host machinery for targeting the viral genome-movement protein complex to plasmodesmata (PD). The mechanism by which the non-structural protein m (NSm) of Groundnut bud necrosis virus (GBNV) is targeted to PD was investigated using Agrobacterium mediated transient expression of NSm and its fusion proteins in Nicotiana benthamiana. GFP:NSm formed punctuate structures that colocalized with mCherry:plasmodesmata localized protein la (PDLP la) confirming that GBNV NSm localizes to PD. Unlike in other movement proteins, the C-terminal coiled coil domain of GBNV NSm was shown to be involved in the localization of NSm to PD, as deletion of this domain resulted in the cytoplasmic localization of NSm. Treatment with Brefeldin A demonstrated the role of ER in targeting GFP NSm to PD. Furthermore, mCherry:NSm co-localized with ER-GFP (endoplasmic reticulum targeting peptide (HDEL peptide fused with GFP). Co-expression of NSm with ER-GFP showed that the ER-network was transformed into vesicles indicating that NSm interacts with ER and remodels it. Mutations in the conserved hydrophobic region of NSm (residues 130-138) did not abolish the formation of vesicles. Additionally, the conserved prolines at positions 140 and 142 were found to be essential for targeting the vesicles to the cell membrane. Further, systematic deletion of amino acid residues from N- and C-terminus demonstrated that N-terminal 203 amino acids are dispensable for the vesicle formation. On the other hand, the C-terminal coiled coil domain when expressed alone could also form vesicles. These results suggest that GBNV NSm remodels the ER network by forming vesicles via its interaction through the C-terminal coiled coil domain. Interestingly, NSm interacts with NP in vitro and coexpression of these two proteins in planta resulted in the relocalization of NP to PD and this relocalization was abolished when the N-terminal unfolded region of NSm was deleted. Thus, the NSm interacts with NP via its N-terminal unfolded region and the NSm-NP complex could in turn interact with the ER membrane via the C-terminal coiled coil domain of NSm to form vesicles that are targeted to PD and there by assist the cell to cell movement of the viral genome complex. (C) 2015 Elsevier Inc. All rights reserved.
Resumo:
The Lattice-Boltzmann method (LBM), a promising new particle-based simulation technique for complex and multiscale fluid flows, has seen tremendous adoption in recent years in computational fluid dynamics. Even with a state-of-the-art LBM solver such as Palabos, a user has to still manually write the program using library-supplied primitives. We propose an automated code generator for a class of LBM computations with the objective to achieve high performance on modern architectures. Few studies have looked at time tiling for LBM codes. We exploit a key similarity between stencils and LBM to enable polyhedral optimizations and in turn time tiling for LBM. We also characterize the performance of LBM with the Roofline performance model. Experimental results for standard LBM simulations like Lid Driven Cavity, Flow Past Cylinder, and Poiseuille Flow show that our scheme consistently outperforms Palabos-on average by up to 3x while running on 16 cores of an Intel Xeon (Sandybridge). We also obtain an improvement of 2.47x on the SPEC LBM benchmark.