@unpublished{12076, abstract = {We find an asymptotic formula for the number of primitive vectors $(z_1,\ldots,z_4)\in (\mathbb{Z}_{\neq 0})^4$ such that $z_1,\ldots, z_4$ are all squareful and bounded by $B$, and $z_1+\cdots + z_4 = 0$. Our result agrees in the power of $B$ and $\log B$ with the Campana-Manin conjecture of Pieropan, Smeets, Tanimoto and V\'{a}rilly-Alvarado.}, author = {Shute, Alec L}, booktitle = {arXiv}, title = {{Sums of four squareful numbers}}, doi = {10.48550/arXiv.2104.06966}, year = {2021}, } @article{9260, abstract = {We study the density of rational points on a higher-dimensional orbifold (Pn−1,Δ) when Δ is a Q-divisor involving hyperplanes. This allows us to address a question of Tanimoto about whether the set of rational points on such an orbifold constitutes a thin set. Our approach relies on the Hardy–Littlewood circle method to first study an asymptotic version of Waring’s problem for mixed powers. In doing so we make crucial use of the recent resolution of the main conjecture in Vinogradov’s mean value theorem, due to Bourgain–Demeter–Guth and Wooley.}, author = {Browning, Timothy D and Yamagishi, Shuntaro}, issn = {1432-1823}, journal = {Mathematische Zeitschrift}, pages = {1071–1101}, publisher = {Springer Nature}, title = {{Arithmetic of higher-dimensional orbifolds and a mixed Waring problem}}, doi = {10.1007/s00209-021-02695-w}, volume = {299}, year = {2021}, } @article{10711, abstract = {In this paper, we investigate the distribution of the maximum of partial sums of families of m -periodic complex-valued functions satisfying certain conditions. We obtain precise uniform estimates for the distribution function of this maximum in a near-optimal range. Our results apply to partial sums of Kloosterman sums and other families of ℓ -adic trace functions, and are as strong as those obtained by Bober, Goldmakher, Granville and Koukoulopoulos for character sums. In particular, we improve on the recent work of the third author for Birch sums. However, unlike character sums, we are able to construct families of m -periodic complex-valued functions which satisfy our conditions, but for which the Pólya–Vinogradov inequality is sharp.}, author = {Autissier, Pascal and Bonolis, Dante and Lamzouri, Youness}, issn = {1570-5846}, journal = {Compositio Mathematica}, keywords = {Algebra and Number Theory}, number = {7}, pages = {1610--1651}, publisher = {Cambridge University Press}, title = {{The distribution of the maximum of partial sums of Kloosterman sums and other trace functions}}, doi = {10.1112/s0010437x21007351}, volume = {157}, year = {2021}, } @article{22506, abstract = {Alpine grasslands sustain local economy by providing fodder for livestock. Intensive fertilization is common to enhance their yields, thus creating negative externalities on water quality that are difficult to evaluate without reliable estimates of nutrient fluxes. We apply a mechanistic ecosystem model, seamlessly integrating land-surface energy balance, soil hydrology, vegetation dynamics, and soil biogeochemistry, aiming at assessing the grassland response to fertilization. We simulate the major water, carbon, nutrient, and energy fluxes of nine grassland plots across the broad European Alpine region. We provide an interdisciplinary model evaluation by confirming its performance against observed variables from different datasets. Subsequently, we apply the model to test the influence of fertilization practices on grassland yields and nitrate (NO3) losses through leaching under both current and modified climate scenarios. Despite the generally low NO3 concentration in groundwater recharge, the variability across sites is remarkable, which is mostly (but not exclusively) dictated by elevation. In high-Alpine sites, short growing seasons lead to less efficient nitrogen (N) uptake for biomass production. This combined with lower evapotranspiration rates results in higher amounts of drainage and NO3 leaching to groundwater. Scenarios with increased temperature lead to a longer growing season characterized by higher biomass production and, consequently, to a reduction of water leakage and N leaching. While the intersite variability is maintained, climate change impacts are stronger on sites at higher elevations. The local soil hydrology has a crucial role in driving the NO3 use efficiency. The commonly applied fixed threshold limit on fertilizer N input is suboptimal. We suggest that major hydrological and soil property differences across sites should be considered in the delineation of best practices or regulations for management. Using distributed maps informed with key soil and climatic attributes or systematically implementing integrated ecosystem models as shown here can contribute to achieving more sustainable practices.}, author = {Botter, Martina and Zeeman, Matthias and Burlando, Paolo and Fatichi, Simone}, issn = {1726-4189}, journal = {Biogeosciences}, number = {6}, pages = {1917--1939}, publisher = {Copernicus Publications}, title = {{Impacts of fertilization on grassland productivity and water quality across the European Alps under current and warming climate: insights from a mechanistic model}}, doi = {10.5194/bg-18-1917-2021}, volume = {18}, year = {2021}, } @article{22529, abstract = {Mountainous catchments cover a broad range of elevations and their response to a warming climate is expected to vary significantly in space. Nevertheless, studies on climate change impacts typically examine the changes in flow statistics only at the catchment outlet. In this study, we instead demonstrate the high variability of the hydrological response to climate change at the sub-catchment scale, investigating in detail the contribution of all components of the hydrological cycle in two mountainous catchments (Thur and Kleine Emme) in the Swiss Alps. The analysis was conducted with a two-dimensional weather generator model that simulated gridded climate variables at an hourly and 2-km resolution until the end of the 21st century for the RCP8.5 emission scenario. The climate ensemble was used as input into a distributed hydrological model to estimate the changes in hydrological processes at 100-m and hourly resolutions. Climate models show that precipitation intensifies during winter but weakens during summer in the order of ± 5–10% toward the end of the century. Temperature will rise by up to 4°C, leading to a 50% reduction in snowmelt, 10% increase in evapotranspiration, and shift in precipitation type from snowfall to rainfall. As a result, streamflow is projected to increase by 40% in winter but decrease by 20% to 40% during summer, with winter floods becoming more frequent. The changes to streamflow (mean and extreme low and high flows) at the sub-catchments show a strong dependency with elevation. In contrast to the small changes projected at the outlet of the catchments, streamflow shows a reduction at higher elevations (up to −20% change in mean streamflow for sub-catchments at elevations exceeding 1400 m) and an increase at lower elevations (up to +5% for Kleine Emme and +20% for the Thur at elevations below 600 m). These impacts are tied to the changes in precipitation, as well as changes in snowmelt (at high elevation) and evapotranspiration (at low elevation). The results reveal the causes and diversity of hydrological response to climate change, emphasizing the importance of investigating the distributed impacts of climate change in mountainous environments.}, author = {Moraga, Jorge Sebastián and Peleg, Nadav and Fatichi, Simone and Molnar, Peter and Burlando, Paolo}, issn = {1879-2707}, journal = {Journal of Hydrology}, keywords = {Catchment modelling, Climate change impacts, Weather generator, Distributed hydrological model, Streamflow extremes, Hydrological response}, publisher = {Elsevier}, title = {{Revealing the impacts of climate change on mountainous catchments through high-resolution modelling}}, doi = {10.1016/j.jhydrol.2021.126806}, volume = {603}, year = {2021}, } @article{22497, abstract = {This study evaluates the simulation of water balance components at half-hourly time steps from the Canadian Land Surface Scheme (CLASS) when driven by a 500-year stochastic meteorological data set produced by the Advanced WEather GENerator (AWE-GEN) at two boreal sites with contrasting water availability. The CLASS was driven by ERA5 reanalysis data (CLASS-CTL) over 39 years and its output was used as a surrogate for land surface observations. At both sites, the mean monthly and annual values of all meteorological variables used to drive CLASS, including precipitation, are well captured by AWE-GEN, but their variability is, sometimes, biased. In general, CLASS driven by stochastic data (CLASS-WG) tends to produce higher evapotranspiration compared to values simulated by CLASS-CTL, especially during spring and summer at the wet site. The interannual evapotranspiration-precipitation and runoff-precipitation relationships derived from CLASS-WG and those derived from CLASS-CTL were very similar to each other at the dry site; they both indicate that evapotranspiration and runoff are limited by water availability. At the wet site, however, CLASS-WG only captured well the interannual runoff-precipitation relationship. The sensitivity analysis shows that CLASS water fluxes are particularly affected by the replacement of physically consistent input time series of incoming short-wave radiation, precipitation, temperature, and specific humidity. In conclusion, the results show that even though a weather generator can produce coherent climate time series, the use of this synthetic data as meteorological forcing in a physically based land surface model does not necessarily reproduce the complex surface processes, such as the surface water fluxes. More studies are encouraged to further analyze the constraints of this framework.}, author = {Alves, Marco and Nadeau, Daniel F. and Music, Biljana and Anctil, François and Fatichi, Simone}, issn = {1434-4483}, journal = {Theoretical and Applied Climatology}, pages = {215--244}, publisher = {Springer Nature}, title = {{Can we replace observed forcing with weather generator in land surface modeling? Insights from long-term simulations at two contrasting boreal sites}}, doi = {10.1007/s00704-021-03615-y}, volume = {145}, year = {2021}, } @article{22535, abstract = {Flooding impacts are on the rise globally, and concentrated in urban areas. Currently, there are no operational systems to forecast flooding at spatial resolutions that can facilitate emergency preparedness and response actions mitigating flood impacts. We present a framework for real-time flood modeling and uncertainty quantification that combines the physics of fluid motion with advances in probabilistic methods. The framework overcomes the prohibitive computational demands of high-fidelity modeling in real-time by using a probabilistic learning method relying on surrogate models that are trained prior to a flood event. This shifts the overwhelming burden of computation to the trivial problem of data storage, and enables forecasting of both flood hazard and its uncertainty at scales that are vital for time-critical decision-making before and during extreme events. The framework has the potential to improve flood prediction and analysis and can be extended to other hazard assessments requiring intense high-fidelity computations in real-time.}, author = {Ivanov, Valeriy Y. and Xu, Donghui and Dwelle, M. Chase and Sargsyan, Khachik and Wright, Daniel B. and Katopodes, Nikolaos and Kim, Jongho and Tran, Vinh Ngoc and Warnock, April and Fatichi, Simone and Burlando, Paolo and Caporali, Enrica and Restrepo, Pedro and Sanders, Brett F. and Chaney, Molly M. and Nunes, Ana M. B. and Nardi, Fernando and Vivoni, Enrique R. and Istanbulluoglu, Erkan and Bisht, Gautam and Bras, Rafael L.}, issn = {1944-8007}, journal = {Geophysical Research Letters}, number = {20}, publisher = {American Geophysical Union}, title = {{Breaking down the computational barriers to real‐time urban flood forecasting}}, doi = {10.1029/2021gl093585}, volume = {48}, year = {2021}, } @article{22566, abstract = {Peruvian glaciers are important contributors to dry season runoff for agriculture and hydropower, but they are at risk of disappearing due to climate change. We applied a physically based, energy balance melt model at five on‐glacier sites within the Peruvian Cordilleras Blanca and Vilcanota. Net shortwave radiation dominates the energy balance, and despite this flux being higher in the dry season, melt rates are lower due to losses from net longwave radiation and the latent heat flux. The sensible heat flux is a relatively small contributor to melt energy. At three of the sites the wet season snowpack was discontinuous, forming and melting within a daily to weekly timescale, and resulting in highly variable melt rates closely related to precipitation dynamics. Cold air temperatures due to a strong La Niña year at Shallap Glacier (Cordillera Blanca) resulted in a continuous wet season snowpack, significantly reducing wet season ablation. Sublimation was most important at the highest site in the accumulation zone of the Quelccaya Ice Cap (Cordillera Vilcanota), accounting for 81% of ablation, compared to 2%–4% for the other sites. Air temperature and precipitation inputs were perturbed to investigate the climate sensitivity of the five glaciers. At the lower sites warmer air temperatures resulted in a switch from snowfall to rain, so that ablation was increased via the decrease in albedo and increase in net shortwave radiation. At the top of Quelccaya Ice Cap warming caused melting to replace sublimation so that ablation increased nonlinearly with air temperature.}, author = {Fyffe, Catriona L. and Potter, Emily and Fugger, Stefan and Orr, Andrew and Fatichi, Simone and Loarte, Edwin and Medina, Katy and Hellström, Robert Å. and Bernat, Maud and Aubry‐Wake, Caroline and Gurgiser, Wolfgang and Perry, L. Baker and Suarez, Wilson and Quincey, Duncan J. and Pellicciotti, Francesca}, issn = {2169-8996}, journal = {Journal of Geophysical Research: Atmospheres}, number = {23}, publisher = {American Geophysical Union}, title = {{The energy and mass balance of peruvian glaciers}}, doi = {10.1029/2021jd034911}, volume = {126}, year = {2021}, } @article{22516, abstract = {Defining plant hydraulic traits is central to the quantification of ecohydrological processes ranging from land-atmosphere interactions, to tree mortality and water-carbon budgets. A key plant trait is the xylem specific hydraulic conductivity (Kx), that describes the plant's vascular system capacity to transport water. While xylem's vessels and tracheids are dead upon maturity, the xylem is neither inert nor deadwood, various components of the sapwood and surrounding tissue remaining alive and functional. Moreover, the established definition of Kx assumes linear relations between water flux and pressure gradient by tacitly considering the xylem as a “passive conduit”. Here, we re-examine this notion of an inert xylem by systematically characterizing xylem flow in several woody plants using Kx measurements under constant and cyclic pressure gradients. Results show a temporal and pressure gradient dependence of Kx. Additionally, microscopic features in “living branches” are irreversibly modified upon drying of the xylem, thus differentiating the macroscopic definition of Kx for living and dead xylem. The findings highlight the picture of the xylem as a complex and delicate conductive system whose hydraulic behaviour transcends a passive gradient-based flow. The study sheds new light on xylem conceptualization, conductivity measurement protocols, in situ long-distance water transport and ecosystem modelling.}, author = {Bonetti, Sara and Breitenstein, Daniel and Fatichi, Simone and Domec, Jean‐Christophe and Or, Dani}, issn = {1365-3040}, journal = {Plant, Cell & Environment}, keywords = {Plant hydraulic traits, Plant vascular system, Sapflow, Xylem conductivity measurements}, number = {2}, pages = {371--386}, publisher = {Wiley}, title = {{Persistent decay of fresh xylem hydraulic conductivity varies with pressure gradient and marks plant responses to injury}}, doi = {10.1111/pce.13893}, volume = {44}, year = {2021}, } @article{22498, abstract = {Climate change impacts on sediment production and transfer processes on hillslopes and through channels are governed by possible changes in precipitation, runoff, and air temperature. These hydrological and geomorphological impacts are difficult to predict in temperature‐sensitive Alpine environments. In this study, we combined a stochastic weather generator model with the most current climate change projections to feed a hillslope‐channel sediment cascade model for a major debris‐flow system in the Swiss Alps (the Illgraben). This allowed us to quantify climate change impacts and their uncertainties on sediment yield and the number of debris flows at hourly temporal resolution. We show that projected changes in precipitation and air temperature lead to a reduction in both sediment yield (−48%) and debris‐flow occurrence (−23%). This change is caused by a decrease in sediment supply from hillslopes, which is driven by frost‐weathering. Additionally, we conduct model experiments that show the sensitivity of projected changes in sediment yield and debris‐flow hazard to basin elevation, with important implications for assessing natural hazards and risks in mountain environments. Future changes in hydrological and sediment fluxes are characterized by high uncertainty, mainly due to irreducible internal climate variability. Therefore, this stochastic uncertainty needs to be considered in climate change impact assessments for geomorphic systems.}, author = {Hirschberg, Jacob and Fatichi, Simone and Bennett, Georgina L. and McArdell, Brian W. and Peleg, Nadav and Lane, Stuart N. and Schlunegger, Fritz and Molnar, Peter}, issn = {2169-9011}, journal = {Journal of Geophysical Research: Earth Surface}, number = {1}, publisher = {American Geophysical Union}, title = {{Climate change impacts on sediment yield and debris‐flow activity in an alpine catchment}}, doi = {10.1029/2020jf005739}, volume = {126}, year = {2021}, } @inproceedings{10325, abstract = {Since the inception of Bitcoin, a plethora of distributed ledgers differing in design and purpose has been created. While by design, blockchains provide no means to securely communicate with external systems, numerous attempts towards trustless cross-chain communication have been proposed over the years. Today, cross-chain communication (CCC) plays a fundamental role in cryptocurrency exchanges, scalability efforts via sharding, extension of existing systems through sidechains, and bootstrapping of new blockchains. Unfortunately, existing proposals are designed ad-hoc for specific use-cases, making it hard to gain confidence in their correctness and composability. We provide the first systematic exposition of cross-chain communication protocols. We formalize the underlying research problem and show that CCC is impossible without a trusted third party, contrary to common beliefs in the blockchain community. With this result in mind, we develop a framework to design new and evaluate existing CCC protocols, focusing on the inherent trust assumptions thereof, and derive a classification covering the field of cross-chain communication to date. We conclude by discussing open challenges for CCC research and the implications of interoperability on the security and privacy of blockchains.}, author = {Zamyatin, Alexei and Al-Bassam, Mustafa and Zindros, Dionysis and Kokoris Kogias, Eleftherios and Moreno-Sanchez, Pedro and Kiayias, Aggelos and Knottenbelt, William J.}, booktitle = {25th International Conference on Financial Cryptography and Data Security}, isbn = {9-783-6626-4330-3}, issn = {1611-3349}, location = {Virtual}, pages = {3--36}, publisher = {Springer Nature}, title = {{SoK: Communication across distributed ledgers}}, doi = {10.1007/978-3-662-64331-0_1}, volume = {12675 }, year = {2021}, } @inproceedings{10599, abstract = {A two-part successive syndrome-check decoding of polar codes is proposed with the first part successively refining the received codeword and the second part checking its syndrome. A new formulation of the successive-cancellation (SC) decoding algorithm is presented that allows for successively refining the received codeword by comparing the log-likelihood ratio value of a frozen bit with its predefined value. The syndrome of the refined received codeword is then checked for possible errors. In case there are no errors, the decoding process is terminated. Otherwise, the decoder continues to refine the received codeword. The proposed method is extended to the case of SC list (SCL) decoding by terminating the decoding process when the syndrome of the best candidate in the list indicates no errors. Simulation results show that the proposed method reduces the time-complexity of SC and SCL decoders and their fast variants, especially at high signal-to-noise ratios.}, author = {Hashemi, Seyyed Ali and Mondelli, Marco and Cioffi, John and Goldsmith, Andrea}, booktitle = {Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers}, isbn = {9781665458283}, issn = {1058-6393}, location = {Virtual, Pacific Grove, CA, United States}, pages = {943--947}, publisher = {IEEE}, title = {{Successive syndrome-check decoding of polar codes}}, doi = {10.1109/IEEECONF53345.2021.9723394}, volume = {2021-October}, year = {2021}, } @inproceedings{10597, abstract = {We thank Emmanuel Abbe and Min Ye for providing us the implementation of RPA decoding. D. Fathollahi and M. Mondelli are partially supported by the 2019 Lopez-Loreta Prize. N. Farsad is supported by Discovery Grant from the Natural Sciences and Engineering Research Council of Canada (NSERC) and Canada Foundation for Innovation (CFI), John R. Evans Leader Fund. S. A. Hashemi is supported by a Postdoctoral Fellowship from NSERC.}, author = {Fathollahi, Dorsa and Farsad, Nariman and Hashemi, Seyyed Ali and Mondelli, Marco}, booktitle = {2021 IEEE International Symposium on Information Theory}, isbn = {978-1-5386-8210-4}, location = {Virtual, Melbourne, Australia}, pages = {1082--1087}, publisher = {IEEE}, title = {{Sparse multi-decoder recursive projection aggregation for Reed-Muller codes}}, doi = {10.1109/isit45174.2021.9517887}, year = {2021}, } @inproceedings{10002, abstract = {We present a faster symbolic algorithm for the following central problem in probabilistic verification: Compute the maximal end-component (MEC) decomposition of Markov decision processes (MDPs). This problem generalizes the SCC decomposition problem of graphs and closed recurrent sets of Markov chains. The model of symbolic algorithms is widely used in formal verification and model-checking, where access to the input model is restricted to only symbolic operations (e.g., basic set operations and computation of one-step neighborhood). For an input MDP with n vertices and m edges, the classical symbolic algorithm from the 1990s for the MEC decomposition requires O(n2) symbolic operations and O(1) symbolic space. The only other symbolic algorithm for the MEC decomposition requires O(nm−−√) symbolic operations and O(m−−√) symbolic space. A main open question is whether the worst-case O(n2) bound for symbolic operations can be beaten. We present a symbolic algorithm that requires O˜(n1.5) symbolic operations and O˜(n−−√) symbolic space. Moreover, the parametrization of our algorithm provides a trade-off between symbolic operations and symbolic space: for all 0<ϵ≤1/2 the symbolic algorithm requires O˜(n2−ϵ) symbolic operations and O˜(nϵ) symbolic space ( O˜ hides poly-logarithmic factors). Using our techniques we present faster algorithms for computing the almost-sure winning regions of ω -regular objectives for MDPs. We consider the canonical parity objectives for ω -regular objectives, and for parity objectives with d -priorities we present an algorithm that computes the almost-sure winning region with O˜(n2−ϵ) symbolic operations and O˜(nϵ) symbolic space, for all 0<ϵ≤1/2 .}, author = {Chatterjee, Krishnendu and Dvorak, Wolfgang and Henzinger, Monika H and Svozil, Alexander}, booktitle = {Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science}, isbn = {978-1-6654-4896-3}, issn = {1043-6871}, keywords = {Computer science, Computational modeling, Markov processes, Probabilistic logic, Formal verification, Game Theory}, location = {Rome, Italy}, pages = {1--13}, publisher = {IEEE}, title = {{Symbolic time and space tradeoffs for probabilistic verification}}, doi = {10.1109/LICS52264.2021.9470739}, year = {2021}, } @inproceedings{9356, abstract = {In runtime verification, a monitor watches a trace of a system and, if possible, decides after observing each finite prefix whether or not the unknown infinite trace satisfies a given specification. We generalize the theory of runtime verification to monitors that attempt to estimate numerical values of quantitative trace properties (instead of attempting to conclude boolean values of trace specifications), such as maximal or average response time along a trace. Quantitative monitors are approximate: with every finite prefix, they can improve their estimate of the infinite trace's unknown property value. Consequently, quantitative monitors can be compared with regard to a precision-cost trade-off: better approximations of the property value require more monitor resources, such as states (in the case of finite-state monitors) or registers, and additional resources yield better approximations. We introduce a formal framework for quantitative and approximate monitoring, show how it conservatively generalizes the classical boolean setting for monitoring, and give several precision-cost trade-offs for monitors. For example, we prove that there are quantitative properties for which every additional register improves monitoring precision.}, author = {Henzinger, Thomas A and Sarac, Naci E}, booktitle = {Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science}, location = {Online}, publisher = {IEEE}, title = {{Quantitative and approximate monitoring}}, doi = {10.1109/LICS52264.2021.9470547}, year = {2021}, } @inproceedings{10004, abstract = {Markov chains are the de facto finite-state model for stochastic dynamical systems, and Markov decision processes (MDPs) extend Markov chains by incorporating non-deterministic behaviors. Given an MDP and rewards on states, a classical optimization criterion is the maximal expected total reward where the MDP stops after T steps, which can be computed by a simple dynamic programming algorithm. We consider a natural generalization of the problem where the stopping times can be chosen according to a probability distribution, such that the expected stopping time is T, to optimize the expected total reward. Quite surprisingly we establish inter-reducibility of the expected stopping-time problem for Markov chains with the Positivity problem (which is related to the well-known Skolem problem), for which establishing either decidability or undecidability would be a major breakthrough. Given the hardness of the exact problem, we consider the approximate version of the problem: we show that it can be solved in exponential time for Markov chains and in exponential space for MDPs.}, author = {Chatterjee, Krishnendu and Doyen, Laurent}, booktitle = {Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science}, isbn = {978-1-6654-4896-3}, issn = {1043-6871}, keywords = {Computer science, Heuristic algorithms, Memory management, Automata, Markov processes, Probability distribution, Complexity theory}, location = {Rome, Italy}, pages = {1--13}, publisher = {IEEE}, title = {{Stochastic processes with expected stopping time}}, doi = {10.1109/LICS52264.2021.9470595}, year = {2021}, } @article{9828, abstract = {Amplitude demodulation is a classical operation used in signal processing. For a long time, its effective applications in practice have been limited to narrowband signals. In this work, we generalize amplitude demodulation to wideband signals. We pose demodulation as a recovery problem of an oversampled corrupted signal and introduce special iterative schemes belonging to the family of alternating projection algorithms to solve it. Sensibly chosen structural assumptions on the demodulation outputs allow us to reveal the high inferential accuracy of the method over a rich set of relevant signals. This new approach surpasses current state-of-the-art demodulation techniques apt to wideband signals in computational efficiency by up to many orders of magnitude with no sacrifice in quality. Such performance opens the door for applications of the amplitude demodulation procedure in new contexts. In particular, the new method makes online and large-scale offline data processing feasible, including the calculation of modulator-carrier pairs in higher dimensions and poor sampling conditions, independent of the signal bandwidth. We illustrate the utility and specifics of applications of the new method in practice by using natural speech and synthetic signals.}, author = {Gabrielaitis, Mantas}, issn = {1941-0476}, journal = {IEEE Transactions on Signal Processing}, pages = {4039 -- 4054}, publisher = {IEEE}, title = {{Fast and accurate amplitude demodulation of wideband signals}}, doi = {10.1109/TSP.2021.3087899}, volume = {69}, year = {2021}, } @inproceedings{10053, abstract = {This paper characterizes the latency of the simplified successive-cancellation (SSC) decoding scheme for polar codes under hardware resource constraints. In particular, when the number of processing elements P that can perform SSC decoding operations in parallel is limited, as is the case in practice, the latency of SSC decoding is O(N1−1 μ+NPlog2log2NP), where N is the block length of the code and μ is the scaling exponent of polar codes for the channel. Three direct consequences of this bound are presented. First, in a fully-parallel implementation where P=N2 , the latency of SSC decoding is O(N1−1/μ) , which is sublinear in the block length. This recovers a result from an earlier work. Second, in a fully-serial implementation where P=1 , the latency of SSC decoding scales as O(Nlog2log2N) . The multiplicative constant is also calculated: we show that the latency of SSC decoding when P=1 is given by (2+o(1))Nlog2log2N . Third, in a semi-parallel implementation, the smallest P that gives the same latency as that of the fully-parallel implementation is P=N1/μ . The tightness of our bound on SSC decoding latency and the applicability of the foregoing results is validated through extensive simulations.}, author = {Hashemi, Seyyed Ali and Mondelli, Marco and Fazeli, Arman and Vardy, Alexander and Cioffi, John and Goldsmith, Andrea}, booktitle = {2021 IEEE International Symposium on Information Theory}, isbn = {978-1-5386-8210-4}, issn = {2157-8095}, location = {Melbourne, Australia}, pages = {2369--2374}, publisher = {IEEE}, title = {{Parallelism versus latency in simplified successive-cancellation decoding of polar codes}}, doi = {10.1109/ISIT45174.2021.9518153}, year = {2021}, } @article{22584, abstract = {Higher temperatures in urban areas expose a large fraction of the human population to potentially dangerous heat stress. Green spaces are promoted worldwide as local and city-scale cooling strategies but the amount, type, and functioning of vegetation in cities lack quantification and their interaction with urban climate in different settings remains a matter of debate. Here we use state-of-the-art remote sensing data from 145 city clusters to disentangle the drivers of surface urban heat islands (SUHI) intensity and quantify urban-rural differences in vegetation cover, species composition, and evaporative cooling. We show that nighttime SUHIs are affected mostly by abiotic factors, while daytime SUHIs are highly correlated with vegetation characteristics and the wetness of the background climate. Magnitude and seasonality of daytime SUHIs are controlled by urban-rural differences in plant transpiration and leaf area, which explain the dependence of SUHIs on wetness conditions. Leaf area differences are caused primarily by changes in vegetation type and a loss of in-city forested areas, highlighting the importance of maintaining “natural reserves” as a sustainable heat mitigation policy.}, author = {Paschalis, Athanasios and Chakraborty, TC and Fatichi, Simone and Meili, Naika and Manoli, Gabriele}, issn = {2576-604X}, journal = {AGU Advances}, number = {2}, publisher = {American Geophysical Union}, title = {{Urban forests as main regulator of the evaporative cooling effect in cities}}, doi = {10.1029/2020av000303}, volume = {2}, year = {2021}, } @article{10738, abstract = {We prove an adiabatic theorem for the Landau–Pekar equations. This allows us to derive new results on the accuracy of their use as effective equations for the time evolution generated by the Fröhlich Hamiltonian with large coupling constant α. In particular, we show that the time evolution of Pekar product states with coherent phonon field and the electron being trapped by the phonons is well approximated by the Landau–Pekar equations until times short compared to α2.}, author = {Leopold, Nikolai K and Rademacher, Simone Anna Elvira and Schlein, Benjamin and Seiringer, Robert}, issn = {1948-206X}, journal = {Analysis and PDE}, number = {7}, pages = {2079--2100}, publisher = {Mathematical Sciences Publishers}, title = {{The Landau–Pekar equations: Adiabatic theorem and accuracy}}, doi = {10.2140/APDE.2021.14.2079}, volume = {14}, year = {2021}, }