Modular catalyst: from the tiling of a water plane to the design of a floating structure

La tesi nasce dalla volontà di agire sull’area della Darsena di Ravenna, strategica in quanto via d’acqua navigabile che congiunge il mare con il centro città ma dal potenziale ancora poco sfruttato. Il progetto è studiato per essere inserito come catalizzatore urbano, creando spazi di interazione attraverso elementi modulari galleggianti e riconfigurabili per adattarsi a programmi d’uso flessibili; tali elementi si aggregano formando un sistema che ristruttura lo spazio dell’attuale banchina, cambiandone la percezione da barriera a waterfront urbano. La necessità di ottenere una struttura con capacità di crescita e flessibilità programmatica sfocia in un approccio modulare seguendo il principio massima variazione/minimo numero di elementi i cui principi aggregativi si basano sulla tassellazione “Cairo”. Vengono studiate le possibilità di incorporare variazione ed eterogeneità all’interno del sistema senza comprometterne la modularità fino ad integrare percorsi multilivello. La definizione delle morfologie delle parti che compongono i moduli si basano sullo studio dei principi di galleggiamento, stabilità e yacht design: a partire dalla forma dello scafo adatta ai principi di tiling definiti in precedenza, tutte le parti che compongono le varie tipologie di modulo sono progettate cercando continuità e integrazione tettonica (geometrica, strutturale, funzionale e percettiva). Vengono proposte soluzioni integrate sia per le problematiche tipiche delle strutture galleggianti sia per l’inserimento di attività all’interno della soluzione architettonica. Vengono prototipati di una serie di moduli, scelti in modo da dimostrare i principi di ricombinazione, continuità, modularità e tiling.

Wide-field assessment of the human corneal subbasal nerve plexus in diabetic neuropathy using a novel mapping technique

To develop a rapid optimized technique of wide-field imaging of the human corneal subbasal nerve plexus. A dynamic fixation target was developed and, coupled with semiautomated tiling software, a rapid method of capturing and montaging multiple corneal confocal microscopy images was created. To illustrate the utility of this technique, wide-field maps of the subbasal nerve plexus were produced in 2 participants with diabetes, 1 with and 1 without neuropathy. The technique produced montages of the central 3 mm of the subbasal corneal nerve plexus. The maps seem to show a general reduction in the number of nerve fibers and branches in the diabetic participant with neuropathy compared with the individual without neuropathy. This novel technique will allow more routine and widespread use of subbasal nerve plexus mapping in clinical and research situations. The significant reduction in the time to image the corneal subbasal nerve plexus should expedite studies of larger groups of diabetic patients and those with other conditions affecting nerve fibers. The inferior whorl and the surrounding areas may show the greatest loss of nerve fibers in individuals with diabetic neuropathy, but this should be further investigated in a larger cohort.

Non-invasive techniques for imaging in-vivo human corneal sub basal nerve mapping and migration rate in diabetic neuropathy

Purpose Corneal confocal microscopy (CCM) is a rapid non-invasive ophthalmic technique, which has been shown to diagnose and stratify the severity of diabetic neuropathy. Current morphometric techniques assess individual static images of the subbasal nerve plexus; this work explores the potential for non-invasive assessment of the wide-field morphology and dynamic changes of this plexus in vivo. Methods In this pilot study, laser scanning CCM was used to acquire maps (using a dynamic fixation target and semi-automated tiling software) of the central corneal sub-basal nerve plexus in 4 diabetic patients with and 6 without neuropathy and in 2 control subjects. Nerve migration was measured in an additional 7 diabetic patients with neuropathy, 4 without neuropathy and in 2 control subjects by repeating a modified version of the mapping procedure within 2-8 weeks, thus facilitating re-identification of distinctive nerve landmarks in the 2 montages. The rate of nerve movement was determined from these data and normalised to a weekly rate (µm/week), using customised software. Results Wide-field corneal nerve fibre length correlated significantly with the Neuropathy Disability Score (r = -0.58, p < 0.05), vibration perception (r = -0.66, p < 0.05) and peroneal conduction velocity (r = 0.67, p < 0.05). Central corneal nerve fibre length did not correlate with any of these measures of neuropathy (p > 0.05 for all). The rate of corneal nerve migration was 14.3 ± 1.1 µm/week in diabetic patients with neuropathy, 19.7 ± 13.3µm/week in diabetic patients without neuropathy, and 24.4 ± 9.8µm/week in control subjects; however, these differences were not significantly different (p = 0.543). Conclusions Our data demonstrate that it is possible to capture wide-field images of the corneal nerve plexus, and to quantify the rate of corneal nerve migration by repeating this procedure over a number of weeks. Further studies on larger sample sizes are required to determine the utility of this approach for the diagnosis and monitoring of diabetic neuropathy.

A systolic evaluator for linear, quadratic, and cubic expressions

High-speed evaluation of a large number of linear, quadratic, and cubic expressions is very important for the modeling and real-time display of objects in computer graphics. Using VLSI techniques, chips called pixel planes have actually been built by H. Fuchs and his group to evaluate linear expressions. In this paper, we describe a topological variant of Fuchs' pixel planes which can evaluate linear, quadratic, cubic, and higher-order polynomials. In our design, we make use of local interconnections only, i.e., interconnections between neighboring processing cells. This leads to the concept of tiling the processing cells for VLSI implementation.

Non-periodic tilings in 2-dimensions: 4- and 7-fold symmetries

By inflating basic rhombuses, with a self-similarity principle, non-periodic tiling of 2-d planes is possible with 4, 5, 6, 7, 8, … -fold symmetries. As examples, non-periodic tilings with crystallographically allowed 4-fold symmetry and crystallographically forbidden 7-fold symmetry are presented in detail. The computed diffraction patterns of these tilings are also discussed.

Analysing local algorithms in location-aware quasi-unit-disk graphs

A local algorithm with local horizon r is a distributed algorithm that runs in r synchronous communication rounds; here r is a constant that does not depend on the size of the network. As a consequence, the output of a node in a local algorithm only depends on the input within r hops from the node. We give tight bounds on the local horizon for a class of local algorithms for combinatorial problems on unit-disk graphs (UDGs). Most of our bounds are due to a refined analysis of existing approaches, while others are obtained by suggesting new algorithms. The algorithms we consider are based on network decompositions guided by a rectangular tiling of the plane. The algorithms are applied to matching, independent set, graph colouring, vertex cover, and dominating set. We also study local algorithms on quasi-UDGs, which are a popular generalisation of UDGs, aimed at more realistic modelling of communication between the network nodes. Analysing the local algorithms on quasi-UDGs allows one to assume that the nodes know their coordinates only approximately, up to an additive error. Despite the localisation error, the quality of the solution to problems on quasi-UDGs remains the same as for the case of UDGs with perfect location awareness. We analyse the increase in the local horizon that comes along with moving from UDGs to quasi-UDGs.

An automatic parallelization framework for multicomputers

Several researchers have looked into various issues related to automatic parallelization of sequential programs for multicomputers. But there is a need for a coherent framework which encompasses all these issues. In this paper we present a such a framework which takes best advantage of the multicomputer architecture. We resort to tiling transformation for iteration space partitioning and propose a scheme of automatic data partitioning and dynamic data distribution. We have tried a simple implementation of our scheme on a transputer based multicomputer [1] and the results are encouraging.

Quasicrystals:Indian research accomplishments and imperatives

: Within two months of the first report on quasicrystals in PRL in November 1984, Indian research which had a 'premature discovery' in 1978 in this area got under way, In the past nine years these efforts have led to original discoveries relating to new types of quasicrystalline phases as well as extensive investigations involving tiling theory, hyperspace, positron annihilation and electrical properties, These researches have been multi-institutional and multi-disciplinary. Enlightened and generous funding was extended by DST from 1986 by recognizing it as a thrust area in basic research via SERC and US-India Funds. International recognition, subjective though it is, in the form of citation of Indian papers, invited lectures and reviews, books as well as the membership of International Advisory Committee has followed and is among the highest in the fields of condensed matter science covered at the Bangalore meeting, Future directions pertaining to the exploration of mechanical and electronic properties as well as structures beyond the quasicrystalline order will be pointed out.

Design of conjugate, conjoined shapes and tilings using topology optimization

We present a method for obtaining conjugate, conjoined shapes and tilings in the context of the design of structures using topology optimization. Optimal material distribution is achieved in topology optimization by setting up a selection field in the design domain to determine the presence/absence of material there. We generalize this approach in this paper by presenting a paradigm in which the material left out by the selection field is also utilised. We obtain conjugate shapes when the region chosen and the region left-out are solutions for two problems, each with a different functionality. On the other hand, if the left-out region is connected to the selected region in some pre-determined fashion for achieving a single functionality, then we get conjoined shapes. The utilization of the left-out material, gives the notion of material economy in both cases. Thus, material wastage is avoided in the practical realization of these designs using many manufacturing techniques. This is in contrast to the wastage of left-out material during manufacture of traditional topology-optimized designs. We illustrate such shapes in the case of stiff structures and compliant mechanisms. When such designs are suitably made on domains of the unit cell of a tiling, this leads to the formation of new tilings which are functionally useful. Such shapes are not only useful for their functionality and economy of material and manufacturing, but also for their aesthetic value.

LDPC Code Designs Based on root I Matrices

LDPC codes can be constructed by tiling permutation matrices that belong to the square root of identity type and similar algebraic structures. We investigate into the properties of such codes. We also present code structures that are amenable for efficient encoding.

An Optimizing Code Generator for a Class of Lattice-Boltzmann Computations

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.

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.

拼接光栅的偏差对光束空间特性的影响

用拼接小尺寸多层介质膜衍射介质膜衍射光栅的办法制作大口径的高破坏阈值光栅成为解决拍瓦激光系统输出能量的关键技术——光栅拼接技术。拼接的每个光栅都存在五维自由度的偏差，对激光脉冲的空间特性和时间特性产生影响。用夫琅禾费衍射的方法分析了拼接光栅的偏差对光束空间特性的影响，建立了偏差和远场强度分布之间的函数关系并用数值方法进行模拟，得出角度偏差对光束远场分布的影响可以忽略，而位移偏差：光栅间拼缝和前后位移偏差是影响光束远场分布的关键因素。

Genome-wide high-resolution mapping and functional analysis of DNA methylation in arabidopsis.

Cytosine methylation is important for transposon silencing and epigenetic regulation of endogenous genes, although the extent to which this DNA modification functions to regulate the genome is still unknown. Here we report the first comprehensive DNA methylation map of an entire genome, at 35 base pair resolution, using the flowering plant Arabidopsis thaliana as a model. We find that pericentromeric heterochromatin, repetitive sequences, and regions producing small interfering RNAs are heavily methylated. Unexpectedly, over one-third of expressed genes contain methylation within transcribed regions, whereas only approximately 5% of genes show methylation within promoter regions. Interestingly, genes methylated in transcribed regions are highly expressed and constitutively active, whereas promoter-methylated genes show a greater degree of tissue-specific expression. Whole-genome tiling-array transcriptional profiling of DNA methyltransferase null mutants identified hundreds of genes and intergenic noncoding RNAs with altered expression levels, many of which may be epigenetically controlled by DNA methylation.

Implementation of shading effect for reconstruction of smooth layerbased 3D holographic images

A holographic rendering algorithm using a layer-based structure with angular tiling supports view-dependent shading and accommodation cues. This approach also has the advantages of rapid computation speed and visual reduction of layer gap artefacts compared to other approaches. Holograms rendered with this algorithm are displayed using an SLM to demonstrate view-dependent shading and occlusion. © 2013 SPIE-IS&T.