Complete absence of localization in a family of disordered lattices

We present analytically exact results to show that, certain quasi one-dimensional lattices where the building blocks are arranged in a random fashion, can have an absolutely continuous part in the energy spectrum when special correlations are introduced among some of the parameters describing the corresponding Hamiltonians. We explicitly work out two prototype cases, one being a disordered array of a simple diamond network and isolated dots, and the other an array of triangular plaquettes and dots. In the latter case, a magnetic flux threading each plaquette plays a crucial role in converting the energy spectrum into an absolutely continuous one. A flux controlled enhancement in the electronic transport is an interesting observation in the triangle-dot system that may be useful while considering prospective devices. The analytical findings are comprehensively supported by extensive numerical calculations of the density of states and transmission coefficient in each case.Comment: 6 pages, 6 figures, epl draf

LIG-CRIStAL System for the WMT17 Automatic Post-Editing Task

This paper presents the LIG-CRIStAL submission to the shared Automatic Post- Editing task of WMT 2017. We propose two neural post-editing models: a monosource model with a task-specific attention mechanism, which performs particularly well in a low-resource scenario; and a chained architecture which makes use of the source sentence to provide extra context. This latter architecture manages to slightly improve our results when more training data is available. We present and discuss our results on two datasets (en-de and de-en) that are made available for the task.Comment: keywords: neural post-edition, attention model

A Constant-Factor Approximation for Multi-Covering with Disks

We consider variants of the following multi-covering problem with disks. We are given two point sets $Y$ (servers) and $X$ (clients) in the plane, a coverage function $\kappa :X \rightarrow \mathcal{N}$, and a constant $\alpha \geq 1$. Centered at each server is a single disk whose radius we are free to set. The requirement is that each client $x \in X$ be covered by at least $\kappa(x)$ of the server disks. The objective function we wish to minimize is the sum of the $\alpha$-th powers of the disk radii. We present a polynomial time algorithm for this problem achieving an $O(1)$ approximation