La vegetazione per le chiusure verticali. Il percorso evolutivo del verde parietale quale elemento di rinaturalizzazione urbana e dispositivo tecnologico passivo per il controllo del microclima ambientale

Topic of green walls is important for contemporary architectonical experimentation and R&D: it express an expansion of designer’s possibilities. The use of vegetation like a functional element in the project is may be found for a long time, but only recently, thanks to the attention for environmental conditions and the consequent cultural moving towards a sustainability development, the architectonical use of plants like collaborative components is increasing. This research shoots for a detailed analysis, with the aim to understand the features of these particular typologies (green façades, living walls, etc.), which ask a collaboration between technological components and living system represented by plants. Technical and functional development characterizing these envelope systems were the target of all methodological research’s choices, with the aim to draw up some planning instruments for the architect

Two-Bit Bit Flipping Decoding of LDPC Codes

In this paper, we propose a new class of bit flipping algorithms for low-density parity-check (LDPC) codes over the binary symmetric channel (BSC). Compared to the regular (parallel or serial) bit flipping algorithms, the proposed algorithms employ one additional bit at a variable node to represent its "strength." The introduction of this additional bit increases the guaranteed error correction capability by a factor of at least 2. An additional bit can also be employed at a check node to capture information which is beneficial to decoding. A framework for failure analysis of the proposed algorithms is described. These algorithms outperform the Gallager A/B algorithm and the min-sum algorithm at much lower complexity. Concatenation of two-bit bit flipping algorithms show a potential to approach the performance of belief propagation (BP) decoding in the error floor region, also at lower complexity.Comment: 6 pages. Submitted to IEEE International Symposium on Information Theory 201

One-Bit ExpanderSketch for One-Bit Compressed Sensing

Is it possible to obliviously construct a set of hyperplanes H such that you can approximate a unit vector x when you are given the side on which the vector lies with respect to every h in H? In the sparse recovery literature, where x is approximately k-sparse, this problem is called one-bit compressed sensing and has received a fair amount of attention the last decade. In this paper we obtain the first scheme that achieves almost optimal measurements and sublinear decoding time for one-bit compressed sensing in the non-uniform case. For a large range of parameters, we improve the state of the art in both the number of measurements and the decoding time