Epigenetics and miRNA during bacteria-induced host immune responses

Various cellular processes including the pathogen-specific immune responses, host-pathogen interactions and the related evasion mechanisms rely on the ability of the immune cells to be reprogrammed accurately and in many cases instantaneously. In this context, the exact functions of epigenetic and miRNA-mediated regulation of genes, coupled with recent advent in techniques that aid such studies, make it an attractive field for research. Here, we review examples that involve the epigenetic and miRNA control of the host immune system during infection with bacteria. Interestingly, many pathogens utilize the epigenetic and miRNA machinery to modify and evade the host immune responses. Thus, we believe that global epigenetic and miRNA mapping of such host-pathogen interactions would provide key insights into their cellular functions and help to identify various determinants for therapeutic value.

PLUTO plus : Near-Complete Modeling of Affine Transformations for Parallelism and Locality

Affine transformations have proven to be very powerful for loop restructuring due to their ability to model a very wide range of transformations. A single multi-dimensional affine function can represent a long and complex sequence of simpler transformations. Existing affine transformation frameworks like the Pluto algorithm, that include a cost function for modern multicore architectures where coarse-grained parallelism and locality are crucial, consider only a sub-space of transformations to avoid a combinatorial explosion in finding the transformations. The ensuing practical tradeoffs lead to the exclusion of certain useful transformations, in particular, transformation compositions involving loop reversals and loop skewing by negative factors. In this paper, we propose an approach to address this limitation by modeling a much larger space of affine transformations in conjunction with the Pluto algorithm's cost function. We perform an experimental evaluation of both, the effect on compilation time, and performance of generated codes. The evaluation shows that our new framework, Pluto+, provides no degradation in performance in any of the Polybench benchmarks. For Lattice Boltzmann Method (LBM) codes with periodic boundary conditions, it provides a mean speedup of 1.33x over Pluto. We also show that Pluto+ does not increase compile times significantly. Experimental results on Polybench show that Pluto+ increases overall polyhedral source-to-source optimization time only by 15%. In cases where it improves execution time significantly, it increased polyhedral optimization time only by 2.04x.

Falcon: A Graph Manipulation Language for Heterogeneous Systems

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.

On the Capacity and Performance of Generalized Spatial Modulation

Generalized spatial modulation (GSM) uses N antenna elements but fewer radio frequency (RF) chains (R) at the transmitter. In GSM, apart from conveying information bits through R modulation symbols, information bits are also conveyed through the indices of the R active transmit antennas. In this letter, we derive lower and upper bounds on the the capacity of a (N, M, R)-GSM MIMO system, where M is the number of receive antennas. Further, we propose a computationally efficient GSM encoding method and a message passing-based low-complexity detection algorithm suited for large-scale GSM-MIMO systems.

PolyMage: Automatic Optimization for Image Processing Pipelines

This paper presents the design and implementation of PolyMage, a domain-specific language and compiler for image processing pipelines. An image processing pipeline can be viewed as a graph of interconnected stages which process images successively. Each stage typically performs one of point-wise, stencil, reduction or data-dependent operations on image pixels. Individual stages in a pipeline typically exhibit abundant data parallelism that can be exploited with relative ease. However, the stages also require high memory bandwidth preventing effective utilization of parallelism available on modern architectures. For applications that demand high performance, the traditional options are to use optimized libraries like OpenCV or to optimize manually. While using libraries precludes optimization across library routines, manual optimization accounting for both parallelism and locality is very tedious. The focus of our system, PolyMage, is on automatically generating high-performance implementations of image processing pipelines expressed in a high-level declarative language. Our optimization approach primarily relies on the transformation and code generation capabilities of the polyhedral compiler framework. To the best of our knowledge, this is the first model-driven compiler for image processing pipelines that performs complex fusion, tiling, and storage optimization automatically. Experimental results on a modern multicore system show that the performance achieved by our automatic approach is up to 1.81x better than that achieved through manual tuning in Halide, a state-of-the-art language and compiler for image processing pipelines. For a camera raw image processing pipeline, our performance is comparable to that of a hand-tuned implementation.

SMO: An Integrated Approach to Intra-array and Inter-array Storage Optimization

The polyhedral model provides an expressive intermediate representation that is convenient for the analysis and subsequent transformation of affine loop nests. Several heuristics exist for achieving complex program transformations in this model. However, there is also considerable scope to utilize this model to tackle the problem of automatic memory footprint optimization. In this paper, we present a new automatic storage optimization technique which can be used to achieve both intra-array as well as inter-array storage reuse with a pre-determined schedule for the computation. Our approach works by finding statement-wise storage partitioning hyper planes that partition a unified global array space so that values with overlapping live ranges are not mapped to the same partition. Our heuristic is driven by a fourfold objective function which not only minimizes the dimensionality and storage requirements of arrays required for each high-level statement, but also maximizes inter statement storage reuse. The storage mappings obtained using our heuristic can be asymptotically better than those obtained by any existing technique. We implement our technique and demonstrate its practical impact by evaluating its effectiveness on several benchmarks chosen from the domains of image processing, stencil computations, and high-performance computing.

A Nanomechanical Device Based on Light-Driven Proton Pumps

In this paper, a hybrid device based on a microcantilever interfaced with bacteriorhodopsin (bR) is constructed. The microcantilever, on which the highly oriented bR film is self-assembled, undergoes controllable and reversible bending when the light-driven proton pump protein, bR, on the microcantilever surface is activated by visible light. Several control experiments are carried out to preclude the influence of heat and photothermal effects. It is shown that the nanomechanical motion is induced by the resulting gradient of protons, which are transported from the KCl solution on the cytoplasmic side of the bR film towards the extracellular side of the bR film. Along with a simple physical interpretation, the microfabricated cantilever interfaced with the organized molecular film of bR can simulate the natural machinery in converting solar energy to mechanical energy.

An evaluation of space time cube representation of spatiotemporal patterns.

Space time cube representation is an information visualization technique where spatiotemporal data points are mapped into a cube. Information visualization researchers have previously argued that space time cube representation is beneficial in revealing complex spatiotemporal patterns in a data set to users. The argument is based on the fact that both time and spatial information are displayed simultaneously to users, an effect difficult to achieve in other representations. However, to our knowledge the actual usefulness of space time cube representation in conveying complex spatiotemporal patterns to users has not been empirically validated. To fill this gap, we report on a between-subjects experiment comparing novice users' error rates and response times when answering a set of questions using either space time cube or a baseline 2D representation. For some simple questions, the error rates were lower when using the baseline representation. For complex questions where the participants needed an overall understanding of the spatiotemporal structure of the data set, the space time cube representation resulted in on average twice as fast response times with no difference in error rates compared to the baseline. These results provide an empirical foundation for the hypothesis that space time cube representation benefits users analyzing complex spatiotemporal patterns.

The Trade-offs with Space Time Cube Representation of Spatiotemporal Patterns

Space time cube representation is an information visualization technique where spatiotemporal data points are mapped into a cube. Fast and correct analysis of such information is important in for instance geospatial and social visualization applications. Information visualization researchers have previously argued that space time cube representation is beneficial in revealing complex spatiotemporal patterns in a dataset to users. The argument is based on the fact that both time and spatial information are displayed simultaneously to users, an effect difficult to achieve in other representations. However, to our knowledge the actual usefulness of space time cube representation in conveying complex spatiotemporal patterns to users has not been empirically validated. To fill this gap we report on a between-subjects experiment comparing novice users error rates and response times when answering a set of questions using either space time cube or a baseline 2D representation. For some simple questions the error rates were lower when using the baseline representation. For complex questions where the participants needed an overall understanding of the spatiotemporal structure of the dataset, the space time cube representation resulted in on average twice as fast response times with no difference in error rates compared to the baseline. These results provide an empirical foundation for the hypothesis that space time cube representation benefits users when analyzing complex spatiotemporal patterns.

Una mirada a Egipto desde la Biblia Hebraica

Resumen: ¿Qué imágenes de Egipto encontramos en la Biblia Hebrea, además del éxodo? Los textos bíblicos miran a su vecina Egipto como país de refugio (del hambre o la persecución). Pero por ser grande y fuerte, Egipto es también proveedor de armamento militar. Puede tornarse una falsa seguridad para un pueblo que debe confiar solo en Yavé. La literatura sapiencial es más benévola. En la descripción de la cama lujosa a la que una mujer descarada atrae a su amante, Proverbios 7 ofrece un homenaje indirecto a la riqueza egipcia.

La influencia de Diego Abad de Santillán en la conformación de una red intelectual libertaria latinoamericana, 1920-1930

Resumen: El anarquismo encontró en el internacionalismo un elemento esencial para la unión del movimiento libertario, pues consideraba que una alianza universal se lograría sólo atravesando las fronteras. Fueron numerosos los pensadores ácratas que buscaron cumplir este objetivo y que, desde su papel de teóricos-militantes, no sólo contribuyeron a la conformación del universo intelectual anarquista en Buenos Aires en las primeras décadas del siglo XX sino que, a través de su rol de agentes activos en el proceso de gestación, recepción y circulación de ideas, intentaron relacionar el anarquismo local con el latinoamericano y el europeo. Dentro de este grupo se destacó, entre los años 1920 y 1930, Diego Abad de Santillán quien, tanto en su papel de teórico como de militante, periodista, escritor, editor y traductor, constituyó una pieza fundamental para el engranaje intelectual libertario desplegado entre Europa y América Latina, e integró el conjunto de pensadores que lideraron el anarquismo argentino. Al cruzar ambos movimientos, no sólo actuó como nexo sino que también buscó representar, y dar respuestas, a los múltiples y variados intereses de la clase trabajadora.