Quasiperiodicity and non-computability in tilings

We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the fixed point construction; we improve this general technique and make it enforce the property of local regularity of tilings needed for quasiperiodicity. We prove also a stronger result: any effectively closed set can be recursively transformed into a tile set so that the Turing degrees of the resulted tilings consists exactly of the upper cone based on the Turing degrees of the later.Comment: v3: the version accepted to MFCS 201

Optimal Color Range Reporting in One Dimension

Color (or categorical) range reporting is a variant of the orthogonal range reporting problem in which every point in the input is assigned a \emph{color}. While the answer to an orthogonal point reporting query contains all points in the query range $Q$, the answer to a color reporting query contains only distinct colors of points in $Q$. In this paper we describe an O(N)-space data structure that answers one-dimensional color reporting queries in optimal $O(k+1)$ time, where $k$ is the number of colors in the answer and $N$ is the number of points in the data structure. Our result can be also dynamized and extended to the external memory model

Ground-based imaging remote sensing of ice clouds : uncertainties caused by sensor, method and atmosphere

In this study a method is introduced for the retrieval of optical thickness and effective particle size of ice clouds over a wide range of optical thickness from ground-based transmitted radiance measurements. Low optical thickness of cirrus clouds and their complex microphysics present a challenge for cloud remote sensing. In transmittance, the relationship between optical depth and radiance is ambiguous. To resolve this ambiguity the retrieval utilizes the spectral slope of radiance between 485 and 560 nm in addition to the commonly employed combination of a visible and a short-wave infrared wavelength. An extensive test of retrieval sensitivity was conducted using synthetic test spectra in which all parameters introducing uncertainty into the retrieval were varied systematically: ice crystal habit and aerosol properties, instrument noise, calibration uncertainty and the interpolation in the lookup table required by the retrieval process. The most important source of errors identified are uncertainties due to habit assumption: Averaged over all test spectra, systematic biases in the effective radius retrieval of several micrometre can arise. The statistical uncertainties of any individual retrieval can easily exceed 10 µm. Optical thickness biases are mostly below 1, while statistical uncertainties are in the range of 1 to 2.5. For demonstration and comparison to satellite data the retrieval is applied to observations by the Munich hyperspectral imager specMACS (spectrometer of the Munich Aerosol and Cloud Scanner) at the Schneefernerhaus observatory (2650 m a.s.l.) during the ACRIDICON-Zugspitze campaign in September and October 2012. Results are compared to MODIS and SEVIRI satellite-based cirrus retrievals (ACRIDICON – Aerosol, Cloud, Precipitation, and Radiation Interactions and Dynamics of Convective Cloud Systems; MODIS – Moderate Resolution Imaging Spectroradiometer; SEVIRI – Spinning Enhanced Visible and Infrared Imager). Considering the identified uncertainties for our ground-based approach and for the satellite retrievals, the comparison shows good agreement within the range of natural variability of the cloud situation in the direct surrounding

A dynamic approach to three-dimensional radiative transfer in subkilometer-scale numerical weather prediction models: the dynamic TenStream solver v1.0

The increasing resolution of numerical weather prediction models makes inter-column three-dimensional (3D) radiative transport more and more important. However, 3D radiative-transfer solvers are still computationally expensive, largely preventing their use in operational weather forecasting. To address this issue, Jakub and Mayer (2015) developed the TenStream solver. It extends the well-established two-stream method to three dimensions by using 10 instead of 2 streams to describe the transport of radiative energy through Earth's atmosphere. Building upon this method, this paper presents the dynamic TenStream solver, which provides a further acceleration of the original TenStream model. Compared to traditional solvers, this speedup is achieved by utilizing two main concepts. First, radiation is not calculated from scratch every time the model is called. Instead, a time-stepping scheme is introduced to update the radiation field, based on the result from the previous radiation time step. Secondly, the model is based on incomplete solves, with just the first few steps of an iterative scheme towards convergence performed every time it is called. Essentially, the model thereby just uses the ingoing fluxes of a grid box to update its outgoing fluxes. Combined, these two approaches move radiative transfer much closer to the way advection is handled in the dynamical core of a numerical weather prediction (NWP) model, as both use previously calculated results to update their variables and thereby just require access to the neighboring values of an individual grid box, facilitating model parallelization. To demonstrate the feasibility of this new solver, we apply it to a precomputed shallow-cumulus-cloud time series and test its performance in terms of both speed and accuracy. In terms of speed, the dynamic TenStream solver is shown to be about 3 times slower than a traditional 1D δ-Eddington approximation but noticeably faster than currently available 3D solvers. To evaluate the accuracy of the dynamic TenStream solver, we compare its results as well as calculations carried out using a 1D δ-Eddington approximation and the original TenStream solver, to benchmark calculations performed with the 3D Monte Carlo solver MYSTIC. We demonstrate that at the grid box level, dynamic TenStream is able to calculate heating rates and net irradiances at domain boundaries that are very close to those obtained by the original TenStream solver, thus offering a much better representation of the MYSTIC benchmark than the 1D δ-Eddington results. By calling the dynamic TenStream solver less frequently than the δ-Eddington approximation, we furthermore show that our new solver produces significantly better results than a 1D δ-Eddington approximation carried out with a similar computational demand. At these lower calling frequencies, however, the incomplete solves in the dynamic TenStream solver also lead to a buildup of bias with time, which becomes larger the lower the calling frequency is.</p