Insertion in constructed normal numbers

Defined by Borel, a real number is normal to an integer base b ≥ 2 if in its base-b expansion every block of digits occurs with the same limiting frequency as every other block of the same length. We consider the problem of insertion in constructed base-b normal expansions to obtain normality to base (b + 1).Fil: Becher, Veronica Andrea. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentin

Irrationality exponent, Hausdorff dimension and effectivization

We generalize the classical theorem by Jarnik and Besicovitch on the irrationality exponents of real numbers and Hausdorff dimension and show that the two notions are independent. For any real number a greater than or equal to 2 and any non-negative real b be less than or equal to 2 / a, we show that there is a Cantor-like set with Hausdorff dimension equal to b such that, with respect to its uniform measure, almost all real numbers have irrationality exponent equal to a. We give an analogous result relating the irrationality exponent and the effective Hausdorff dimension of individual real numbers. We prove that there is a Cantor-like set such that, with respect to its uniform measure, almost all elements in the set have effective Hausdorff dimension equal to b and irrationality exponent equal to a. In each case, we obtain the desired set as a distinguished path in a tree of Cantor sets.Fil: Becher, Veronica Andrea. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; ArgentinaFil: Reimann, Jan. State University of Pennsylvania; Estados UnidosFil: Slaman, Theodore A.. University of California. Department of Mathematics; Estados Unido

A computable absolutely normal Liouville number

We give an algorithm that computes an absolutely normal Liouville number.Fil: Becher, Veronica Andrea. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Heiber, Pablo Ariel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Slaman, Theodore A.. University of California at Berkeley; Estados Unido

Normal numbers and finite automata

We give an elementary and direct proof of the following theorem: A real number is normal to a given integer base if, and only if, its expansion in that base is incompressible by lossless finite-state compressors (these are finite automata augmented with an output transition function such that the automata input–output behaviour is injective; they are also known as injective finite-state transducers). As a corollary we obtain V.N. Agafonov’s theorem on the preservation of normality on subsequences selected by finite automata.Fil: Becher, Veronica Andrea. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Heiber, Pablo Ariel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentin

Normal numbers and finite automata

We give an elementary and direct proof of the following theorem: A real number is normal to a given integer base if, and only if, its expansion in that base is incompressible by lossless finite-state compressors (these are finite automata augmented with an output transition function such that the automata input–output behaviour is injective; they are also known as injective finite-state transducers). As a corollary we obtain V.N. Agafonov’s theorem on the preservation of normality on subsequences selected by finite automata.Fil: Becher, Veronica Andrea. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Heiber, Pablo Ariel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentin

Protein Repeats from First Principles

Some natural proteins display recurrent structural patterns. Despite being highly similar at the tertiary structure level, repeating patterns within a single repeat protein can be extremely variable at the sequence level. We use a mathematical definition of a repetition and investigate the occurrences of these in sequences of different protein families. We found that long stretches of perfect repetitions are infrequent in individual natural proteins, even for those which are known to fold into structures of recurrent structural motifs. We found that natural repeat proteins are indeed repetitive in their families, exhibiting abundant stretches of 6 amino acids or longer that are perfect repetitions in the reference family. We provide a systematic quantification for this repetitiveness. We show that this form of repetitiveness is not exclusive of repeat proteins, but also occurs in globular domains. A by-product of this work is a fast quantification of the likelihood of a protein to belong to a family.Fil: Turjanski, Pablo Guillermo. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; ArgentinaFil: Parra, Rodrigo Gonzalo. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Química Biológica de la Facultad de Ciencias Exactas y Naturales. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Química Biológica de la Facultad de Ciencias Exactas y Naturales; ArgentinaFil: Espada, Rocío. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Química Biológica de la Facultad de Ciencias Exactas y Naturales. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Química Biológica de la Facultad de Ciencias Exactas y Naturales; ArgentinaFil: Becher, Veronica Andrea. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; ArgentinaFil: Ferreiro, Diego. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Química Biológica de la Facultad de Ciencias Exactas y Naturales. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Química Biológica de la Facultad de Ciencias Exactas y Naturales; Argentin

Efficient repeat finding in sets of strings via suffix arrays

We consider two repeat finding problems relative to sets of strings: (a) Find the largest substrings that occur in every string of a given set; (b) Find the maximal repeats in a given string that occur in no string of a given set. Our solutions are based on the suffix array construction, requiring O(m) memory, where m is the length of the longest input string, and O(n &log;m) time, where n is the the whole input size (the sum of the length of each string in the input). The most expensive part of our algorithms is the computation of several suffix arrays. We give an implementation and experimental results that evidence the efficiency of our algorithms in practice, even for very large inputs.Fil: Barenbaum, Pablo. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina;Fil: Becher, Veronica Andrea. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina; Consejo Nacional de Investigaciones Cientificas y Tecnicas. Oficina de Coordinacion Administrativa Ciudad Universitaria; Argentina;Fil: Deymonnaz, Alejandro. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina;Fil: Halsband, Melisa. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina;Fil: Heiber, Pablo Ariel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina; Consejo Nacional de Investigaciones Cientificas y Tecnicas. Oficina de Coordinacion Administrativa Ciudad Universitaria; Argentina

ECLAIRE: Effects of Climate Change on Air Pollution Impacts and Response Strategies for European Ecosystems. Project final report

The central goal of ECLAIRE is to assess how climate change will alter the extent to which air pollutants threaten terrestrial ecosystems. Particular attention has been given to nitrogen compounds, especially nitrogen oxides (NOx) and ammonia (NH3), as well as Biogenic Volatile Organic Compounds (BVOCs) in relation to tropospheric ozone (O3) formation, including their interactions with aerosol components. ECLAIRE has combined a broad program of field and laboratory experimentation and modelling of pollution fluxes and ecosystem impacts, advancing both mechanistic understanding and providing support to European policy makers. The central finding of ECLAIRE is that future climate change is expected to worsen the threat of air pollutants on Europe’s ecosystems. Firstly, climate warming is expected to increase the emissions of many trace gases, such as agricultural NH3, the soil component of NOx emissions and key BVOCs. Experimental data and numerical models show how these effects will tend to increase atmospheric N deposition in future. By contrast, the net effect on tropospheric O3 is less clear. This is because parallel increases in atmospheric CO2 concentrations will offset the temperature-driven increase for some BVOCs, such as isoprene. By contrast, there is currently insufficient evidence to be confident that CO2 will offset anticipated climate increases in monoterpene emissions. Secondly, climate warming is found to be likely to increase the vulnerability of ecosystems towards air pollutant exposure or atmospheric deposition. Such effects may occur as a consequence of combined perturbation, as well as through specific interactions, such as between drought, O3, N and aerosol exposure. These combined effects of climate change are expected to offset part of the benefit of current emissions control policies. Unless decisive mitigation actions are taken, it is anticipated that ongoing climate warming will increase agricultural and other biogenic emissions, posing a challenge for national emissions ceilings and air quality objectives related to nitrogen and ozone pollution. The O3 effects will be further worsened if progress is not made to curb increases in methane (CH4) emissions in the northern hemisphere. Other key findings of ECLAIRE are that: 1) N deposition and O3 have adverse synergistic effects. Exposure to ambient O3 concentrations was shown to reduce the Nitrogen Use Efficiency of plants, both decreasing agricultural production and posing an increased risk of other forms of nitrogen pollution, such as nitrate leaching (NO3-) and the greenhouse gas nitrous oxide (N2O); 2) within-canopy dynamics for volatile aerosol can increase dry deposition and shorten atmospheric lifetimes; 3) ambient aerosol levels reduce the ability of plants to conserve water under drought conditions; 4) low-resolution mapping studies tend to underestimate the extent of local critical loads exceedance; 5) new dose-response functions can be used to improve the assessment of costs, including estimation of the value of damage due to air pollution effects on ecosystems, 6) scenarios can be constructed that combine technical mitigation measures with dietary change options (reducing livestock products in food down to recommended levels for health criteria), with the balance between the two strategies being a matter for future societal discussion. ECLAIRE has supported the revision process for the National Emissions Ceilings Directive and will continue to deliver scientific underpinning into the future for the UNECE Convention on Long-range Transboundary Air Pollution

ECLAIRE third periodic report

The ÉCLAIRE project (Effects of Climate Change on Air Pollution Impacts and Response Strategies for European Ecosystems) is a four year (2011-2015) project funded by the EU's Seventh Framework Programme for Research and Technological Development (FP7)