Results 1 to 10 of about 4,247 (48)
Introducing carsharing schemes in low‐density areas: The case of the outskirts of Le Mans (France)
Regional Science Policy &Practice, Volume 15, Issue 2, Page 239-255, April 2023., 2023 Abstract Nowadays, the issue of rural development has a central place on the agenda of policymakers, particularly in the field of transportation. In low‐density areas, there is a lack of alternatives to car use, but at the same time internal combustion vehicles are currently contested in Western societies for their impacts on global warming. As part of
Jean Leroy +2 more
wiley +1 more source
Capacity per Unit-Energy of Gaussian Random Many-Access Channels [PDF]
, 2020 We consider a Gaussian multiple-access channel with random user activity where the total number of users $\ell_n$ and the average number of active users $k_n$ may be unbounded.
Koch, Tobias, Ravi, Jithin
core +2 more sources
Fundamental Limits of Coded Caching: Improved Delivery Rate-Cache Capacity Trade-off [PDF]
, 2016 A centralized coded caching system, consisting of a server delivering N popular files, each of size F bits, to K users through an error-free shared link, is considered.
Amiri, Mohammad Mohammadi, Gunduz, Deniz
core +2 more sources
Journal of Nanomaterials, Volume 2014, Issue 1, 2014., 2014 For a long time the conservation of archaeological artefacts has been based on the principles of compatibility and minimal intervention. This involves a series of partially unsolved problems, concerning the products used for deteriorated structures consolidation.
Andrea Macchia +7 more
wiley +1 more source
Optimality of Gaussian Attacks in Continuous Variable Quantum Cryptography [PDF]
, 2006 We analyze the asymptotic security of the family of Gaussian modulated Quantum Key Distribution protocols for Continuous Variables systems. We prove that the Gaussian unitary attack is optimal for all the considered bounds on the key rate when the first ...
A. S. Holevo +8 more
core +4 more sources
Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff [PDF]
, 2014 Replicating or caching popular content in memories distributed across the network is a technique to reduce peak network loads. Conventionally, the main performance gain of this caching was thought to result from making part of the requested data ...
Maddah-Ali, Mohammad Ali, Niesen, Urs
core +1 more source
The Space of Solutions of Coupled XORSAT Formulae [PDF]
, 2013 The XOR-satisfiability (XORSAT) problem deals with a system of $n$ Boolean variables and $m$ clauses. Each clause is a linear Boolean equation (XOR) of a subset of the variables. A $K$-clause is a clause involving $K$ distinct variables. In the random $K$
Hassani, S. Hamed +2 more
core +1 more source
On privacy amplification, lossy compression, and their duality to channel coding
, 2018 We examine the task of privacy amplification from information-theoretic and coding-theoretic points of view. In the former, we give a one-shot characterization of the optimal rate of privacy amplification against classical adversaries in terms of the ...
Renes, Joseph M.
core +1 more source
Energy-Efficient Symbol-Level Precoding in Multiuser MISO Based on Relaxed Detection Region [PDF]
, 2015 This paper addresses the problem of exploiting interference among simultaneous multiuser transmissions in the downlink of multiple-antenna systems. Using symbol-level precoding, a new approach towards addressing the multiuser interference is discussed ...
Alodeh, Maha +2 more
core +2 more sources
Improving compressed sensing with the diamond norm
, 2016 In low-rank matrix recovery, one aims to reconstruct a low-rank matrix from a minimal number of linear measurements. Within the paradigm of compressed sensing, this is made computationally efficient by minimizing the nuclear norm as a convex surrogate ...
Eisert, Jens +3 more
core +1 more source