High rate locally-correctable and locally-testable codes with sub-polynomial query complexity

In this work, we construct the first locally-correctable codes (LCCs), and locally-testable codes (LTCs) with constant rate, constant relative distance, and sub-polynomial query complexity. Specifically, we show that there exist binary LCCs and LTCs with block length $n$, constant rate (which can even be taken arbitrarily close to 1), constant relative distance, and query complexity $\exp(\tilde{O}(\sqrt{\log n}))$. Previously such codes were known to exist only with $\Omega(n^{\beta})$ query complexity (for constant $\beta > 0$), and there were several, quite different, constructions known. Our codes are based on a general distance-amplification method of Alon and Luby~\cite{AL96_codes}. We show that this method interacts well with local correctors and testers, and obtain our main results by applying it to suitably constructed LCCs and LTCs in the non-standard regime of \emph{sub-constant relative distance}. Along the way, we also construct LCCs and LTCs over large alphabets, with the same query complexity $\exp(\tilde{O}(\sqrt{\log n}))$, which additionally have the property of approaching the Singleton bound: they have almost the best-possible relationship between their rate and distance. This has the surprising consequence that asking for a large alphabet error-correcting code to further be an LCC or LTC with $\exp(\tilde{O}(\sqrt{\log n}))$ query complexity does not require any sacrifice in terms of rate and distance! Such a result was previously not known for any $o(n)$ query complexity. Our results on LCCs also immediately give locally-decodable codes (LDCs) with the same parameters

Electron molecule collisions calculations using the R-matrix method

The R-matrix method provides a complete theoretical framework for the treatment of low energy electron collisions. Recent results obtained with the UK R-matrix codes are presented focusing on electron impact electronic excitation of water and the CF radical, electron impact dissociation of molecular hydrogen and its isotopomers, and the dissociative recombination of the CO2+ dication. Examples of other processes, studied in recent calculations are also given. (C) 2003 Elsevier Science Ltd. All rights reserved

UV-B perceived by the UVR8 photoreceptor inhibits plant thermomorphogenesis

Small increases in ambient temperature can elicit striking effects on plant architecture, collectively termed thermomorphogenesis [1]. In Arabidopsis thaliana, these include marked stem elongation and leaf elevation, responses that have been predicted to enhance leaf cooling [ 2, 3, 4 and 5]. Thermomorphogenesis requires increased auxin biosynthesis, mediated by the bHLH transcription factor PHYTOCHROME-INTERACTING FACTOR 4 (PIF4) [ 6, 7 and 8], and enhanced stability of the auxin co-receptor TIR1, involving HEAT SHOCK PROTEIN 90 (HSP90) [9]. High-temperature-mediated hypocotyl elongation additionally involves localized changes in auxin metabolism, mediated by the indole-3-acetic acid (IAA)-amido synthetase Gretchen Hagen 3 (GH3).17 [10]. Here we show that ultraviolet-B light (UV-B) perceived by the photoreceptor UV RESISTANCE LOCUS 8 (UVR8) [11] strongly attenuates thermomorphogenesis via multiple mechanisms inhibiting PIF4 activity. Suppression of thermomorphogenesis involves UVR8 and CONSTITUTIVELY PHOTOMORPHOGENIC 1 (COP1)-mediated repression of PIF4 transcript accumulation, reducing PIF4 abundance. UV-B also stabilizes the bHLH protein LONG HYPOCOTYL IN FAR RED (HFR1), which can bind to and inhibit PIF4 function. Collectively, our results demonstrate complex crosstalk between UV-B and high-temperature signaling. As plants grown in sunlight would most likely experience concomitant elevations in UV-B and ambient temperature, elucidating how these pathways are integrated is of key importance to the understanding of plant development in natural environments

Intranasal dexmedetomidine and intravenous ketamine for procedural sedation in a child with alpha-mannosidosis: A magic bullet?

Background: Procedural sedation is increasingly needed in pediatrics. Although different drugs or drugs association are available, which is the safest and most efficient has yet to be defined, especially in syndromic children with increased sedation-related risk factors. Case report: we report the case of a five-year-old child affected by alpha-mannosidosis who required procedural sedation for an MRI scan and a lumbar puncture. We administered intranasal dexmedetomidine (4 \u3bcg/kg) 45 min before intravenous cannulation, followed by one bolus of ketamine (1 mg/kg) for each procedure. The patient maintained spontaneous breathing and no desaturation or any complication occurred. Conclusion: intranasal dexmedetomidine and intravenous ketamine could be a feasible option for MRI and lumbar puncture in children with alpha-mannosidosis needing sedation

THE PALLADIOLIBRARY GEO-MODELS: AN OPEN 3D ARCHIVE TO MANAGE AND VISUALIZE INFORMATION-COMMUNICATION RESOURCES ABOUT PALLADIO

Abstract. The paper describes objectives, methods, procedures and outcomes of the development of the digital archive of Palladio works and documentation: the PALLADIOLibrary of Centro Internazionale di Studi di Architettura Andrea Palladio di Vicenza (CISAAP). The core of the application consists of fifty-one reality-based 3D models usable and navigable within a system grounded on GoogleEarth. This information system, a collaboration of four universities bearers of specific skills returns a comprehensive, structured and coherent semantic interpretation of Palladian landscape through shapes realistically reconstructed from historical sources and surveys and treated for GE with Ambient Occlusion techniques, overcoming the traditional display mode

Rank deficiency of Kalman error covariance matrices in linear time-varying system with deterministic evolution

We prove that for-linear, discrete, time-varying, deterministic system (perfect-model) with noisy outputs, the Riccati transformation in the Kalman filter asymptotically bounds the rank of the forecast and the analysis error covariance matrices to be less than or equal to the number of nonnegative Lyapunov exponents of the system. Further, the support of these error covariance matrices is shown to be confined to the space spanned by the unstable-neutral backward Lyapunov vectors, providing the theoretical justification for the methodology of the algorithms that perform assimilation only in the unstable-neutral subspace. The equivalent property of the autonomous system is investigated as a special case

Travelling on Graphs with Small Highway Dimension

We study the Travelling Salesperson (TSP) and the Steiner Tree problem (STP) in graphs of low highway dimension. This graph parameter was introduced by Abraham et al. [SODA 2010] as a model for transportation networks, on which TSP and STP naturally occur for various applications in logistics. It was previously shown [Feldmann et al. ICALP 2015] that these problems admit a quasi-polynomial time approximation scheme (QPTAS) on graphs of constant highway dimension. We demonstrate that a significant improvement is possible in the special case when the highway dimension is 1, for which we present a fully-polynomial time approximation scheme (FPTAS). We also prove that STP is weakly NP-hard for these restricted graphs. For TSP we show NP-hardness for graphs of highway dimension 6, which answers an open problem posed in [Feldmann et al. ICALP 2015]