Search for: All records

Providing rich and useful information regarding spectrum activities and propagation channels, radiomaps characterize the detailed distribution of power spectral density (PSD) and are important tools for network planning in modern wireless systems. Generally, radiomaps are constructed from radio strength measurements by deployed sensors and user devices. However, not all areas are accessible for radio measurements due to physical constraints and security considerations, leading to non-uniformly spaced measurements and blanks on a radiomap. In this work, we explore distribution of radio spectrum strengths in view of surrounding environments, and propose two radiomap inpainting approaches for the reconstruction of radiomaps that cover missing areas. Specifically, we first define a propagation based priority before integrating exemplar-based inpainting with radio propagation model for fine-resolution small-size missing area reconstruction on a radiomap. We next introduce a novel radio depth map and propose a two-step template-perturbation approach for large-size restricted region inpainting. Our experimental results demonstrate the power of the proposed propagation priority and radio depth map in capturing PSD distribution, as well as their efficacy in radiomap reconstruction. 

We prove that the solutions to the discrete nonlinear Schrödinger equation with non-local algebraically decaying coupling converge strongly in$$L^2({\mathbb {R}}^2)$$$L^2\left(R^2\right)$to those of the continuum fractional nonlinear Schrödinger equation, as the discretization parameter tends to zero. The proof relies on sharp dispersive estimates that yield the Strichartz estimates that are uniform in the discretization parameter. An explicit computation of the leading term of the oscillatory integral asymptotics is used to show that the best constants of a family of dispersive estimates blow up as the non-locality parameter$$\alpha \in (1,2)$$$\alpha \in (1,2)$approaches the boundaries.

 

The advent of Persistent Memory (PM) devices enables systems to actively persist information at low costs, including program state traditionally in volatile memory. However, this trend poses a reliability challenge in which multiple classes of soft faults that go away after restart in traditional systems turn into hard (recurring) faults in PM systems. In this paper, we first characterize this rising problem with an empirical study of 28 real-world bugs. We analyze how they cause hard faults in PM systems. We then propose Arthas, a tool to effectively recover PM systems from hard faults. Arthas checkpoints PM states via fine-grained versioning and uses program slicing of fault instructions to revert problematic PM states to good versions. We evaluate Arthas on 12 real-world hard faults from five large PM systems. Arthas successfully recovers the systems for all cases while discarding 10× less data on average compared to state-of-the-art checkpoint-rollback solutions.