Boundaries of Disk-like Self-affine Tiles

Let $T:= T(A, {\mathcal D})$ be a disk-like self-affine tile generated by an integral expanding matrix $A$ and a consecutive collinear digit set ${\mathcal D}$, and let $f(x)=x^{2}+px+q$ be the characteristic polynomial of $A$. In the paper, we identify the boundary $\partial T$ with a sofic system by constructing a neighbor graph and derive equivalent conditions for the pair $(A,{\mathcal D})$ to be a number system. Moreover, by using the graph-directed construction and a device of pseudo-norm $\omega$, we find the generalized Hausdorff dimension $\dim_H^{\omega} (\partial T)=2\log \rho(M)/\log |q|$ where $\rho(M)$ is the spectral radius of certain contact matrix $M$. Especially, when $A$ is a similarity, we obtain the standard Hausdorff dimension $\dim_H (\partial T)=2\log \rho/\log |q|$ where $\rho$ is the largest positive zero of the cubic polynomial $x^{3}-(|p|-1)x^{2}-(|q|-|p|)x-|q|$, which is simpler than the known result.Comment: 26 pages, 11 figure

Unanticipated regulatory roles for Arabidopsis phytochromes revealed by null mutant analysis

In view of the extensive literature on phytochrome mutants in the Ler accession of Arabidopsis, we sought to secure a phytochrome-null line in the same genetic background for comparative studies. Here we report the isolation and phenotypic characterization of phyABCDE quintuple and phyABDE quadruple mutants in the Ler background. Unlike earlier studies, these lines possess a functional allele of FT permitting measurements of photoperiod-dependent flowering behavior. Comparative studies of both classes of mutants establish that phytochromes are dispensable for completion of the Arabidopsis life cycle under red light, despite the lack of a transcriptomic response, and also indicate that phyC is nonfunctional in the absence of other phytochromes. Phytochrome-less plants can produce chlorophyll for photosynthesis under continuous red light, yet require elevated fluence rates for survival. Unexpectedly, our analyses reveal both light-dependent and -independent roles for phytochromes to regulate the Arabidopsis circadian clock. The rapid transition of these mutants from vegetative to reproductive growth, as well as their insensitivity to photoperiod, establish a dual role for phytochromes to arrest and to promote progression of plant development in response to the prevailing light environment

Recurrence in 2D Inviscid Channel Flow

I will prove a recurrence theorem which says that any $H^s$ ($s>2$) solution to the 2D inviscid channel flow returns repeatedly to an arbitrarily small $H^0$ neighborhood. Periodic boundary condition is imposed along the stream-wise direction. The result is an extension of an early result of the author [Li, 09] on 2D Euler equation under periodic boundary conditions along both directions

Chosen-ciphertext security from subset sum

We construct a public-key encryption (PKE) scheme whose security is polynomial-time equivalent to the hardness of the Subset Sum problem. Our scheme achieves the standard notion of indistinguishability against chosen-ciphertext attacks (IND-CCA) and can be used to encrypt messages of arbitrary polynomial length, improving upon a previous construction by Lyubashevsky, Palacio, and Segev (TCC 2010) which achieved only the weaker notion of semantic security (IND-CPA) and whose concrete security decreases with the length of the message being encrypted. At the core of our construction is a trapdoor technique which originates in the work of Micciancio and Peikert (Eurocrypt 2012

An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices

In this paper, we study the Learning With Errors problem and its binary variant, where secrets and errors are binary or taken in a small interval. We introduce a new variant of the Blum, Kalai and Wasserman algorithm, relying on a quantization step that generalizes and fine-tunes modulus switching. In general this new technique yields a significant gain in the constant in front of the exponent in the overall complexity. We illustrate this by solving p within half a day a LWE instance with dimension n = 128, modulus $q = n^2$, Gaussian noise $\alpha = 1/(\sqrt{n/\pi} \log^2 n)$ and binary secret, using $2^{28}$ samples, while the previous best result based on BKW claims a time complexity of $2^{74}$ with $2^{60}$ samples for the same parameters. We then introduce variants of BDD, GapSVP and UniqueSVP, where the target point is required to lie in the fundamental parallelepiped, and show how the previous algorithm is able to solve these variants in subexponential time. Moreover, we also show how the previous algorithm can be used to solve the BinaryLWE problem with n samples in subexponential time $2^{(\ln 2/2+o(1))n/\log \log n}$. This analysis does not require any heuristic assumption, contrary to other algebraic approaches; instead, it uses a variant of an idea by Lyubashevsky to generate many samples from a small number of samples. This makes it possible to asymptotically and heuristically break the NTRU cryptosystem in subexponential time (without contradicting its security assumption). We are also able to solve subset sum problems in subexponential time for density $o(1)$, which is of independent interest: for such density, the previous best algorithm requires exponential time. As a direct application, we can solve in subexponential time the parameters of a cryptosystem based on this problem proposed at TCC 2010.Comment: CRYPTO 201

Relative blocking in posets

Poset-theoretic generalizations of set-theoretic committee constructions are presented. The structure of the corresponding subposets is described. Sequences of irreducible fractions associated to the principal order ideals of finite bounded posets are considered and those related to the Boolean lattices are explored; it is shown that such sequences inherit all the familiar properties of the Farey sequences.Comment: 29 pages. Corrected version of original publication which is available at http://www.springerlink.com, see Corrigendu

Damage imaging post processing for delamination size assessment of CFRP aeronautic structures

Thanks to their high strength to mass ratio, composite materials are now widespread in the aerospace industry. Nevertheless, this type of material is sub- ject to internal damages like delamination. In order to detect and localize these damages, robust and precise Structural Health Monitoring algorithms exist for this purpose and have been validated experimentally. However, in order to avoid struc- tures catastrophic failures and to estimate their residual life, there is still a huge need of reliable damage size assessment methods. In this paper, a damage quanti cation method is proposed. This strategy is based on the extraction of a damage size sen- sitive feature computed from damage imaging results. Here damage imaging stands for methods that use ultrasonic Lamb waves-based map of damage localization like- lihood index. This feature is extracted from each labelled example of a training set in order to infer a mathematical model used to predict the area of a delamination of unknown damages. The proposed method is successfully validated on experimental data carried out on CFRP plate samples equipped with a piezoelectric transducers network.This work has received funding from the European Union's Horizon 2020 research and innovation program under the REMAP project (grant agreement number 769288). https://h2020-remap.eu

Preventing type 2 diabetes mellitus in Qatar by reducing obesity, smoking, and physical inactivity: mathematical modeling analyses.

BACKGROUND: The aim of this study was to estimate the impact of reducing the prevalence of obesity, smoking, and physical inactivity, and introducing physical activity as an explicit intervention, on the burden of type 2 diabetes mellitus (T2DM), using Qatar as an example. METHODS: A population-level mathematical model was adapted and expanded. The model was stratified by sex, age group, risk factor status, T2DM status, and intervention status, and parameterized by nationally representative data. Modeled interventions were introduced in 2016, reached targeted level by 2031, and then maintained up to 2050. Diverse intervention scenarios were assessed and compared with a counter-factual no intervention baseline scenario. RESULTS: T2DM prevalence increased from 16.7% in 2016 to 24.0% in 2050 in the baseline scenario. By 2050, through halting the rise or reducing obesity prevalence by 10-50%, T2DM prevalence was reduced by 7.8-33.7%, incidence by 8.4-38.9%, and related deaths by 2.1-13.2%. For smoking, through halting the rise or reducing smoking prevalence by 10-50%, T2DM prevalence was reduced by 0.5-2.8%, incidence by 0.5-3.2%, and related deaths by 0.1-0.7%. For physical inactivity, through halting the rise or reducing physical inactivity prevalence by 10-50%, T2DM prevalence was reduced by 0.5-6.9%, incidence by 0.5-7.9%, and related deaths by 0.2-2.8%. Introduction of physical activity with varying intensity at 25% coverage reduced T2DM prevalence by 3.3-9.2%, incidence by 4.2-11.5%, and related deaths by 1.9-5.2%. CONCLUSIONS: Major reductions in T2DM incidence could be accomplished by reducing obesity, while modest reductions could be accomplished by reducing smoking and physical inactivity, or by introducing physical activity as an intervention

Information transfer fidelity in spin networks and ring-based quantum routers

Spin networks are endowed with an Information Transfer Fidelity (ITF), which defines an absolute upper bound on the probability of transmission of an excitation from one spin to another. The ITF is easily computable but the bound can be reached asymptotically in time only under certain conditions. General conditions for attainability of the bound are established and the process of achieving the maximum transfer probability is given a dynamical model, the translation on the torus. The time to reach the maximum probability is estimated using the simultaneous Diophantine approximation, implemented using a variant of the Lenstra-Lenstra-Lov\'asz (LLL) algorithm. For a ring with uniform couplings, the network can be made a metric space by defining a distance (satisfying the triangle inequality) that quantifies the lack of transmission fidelity between two nodes. It is shown that transfer fidelities and transfer times can be improved significantly by means of simple controls taking the form of non-dynamic, spatially localized bias fields, opening up the possibility for intelligent design of spin networks and dynamic routing of information encoded in them, while being more flexible than engineering fixed couplings to favor some transfers, and less demanding than control schemes requiring fast dynamic controls