![]() Heimböckel, Dieter ![]() Article for general public (2012) Detailed reference viewed: 94 (0 UL)![]() Carr, Constance ![]() Presentation (2019) Detailed reference viewed: 69 (0 UL)![]() Schommer, Christoph ![]() in Operational Database Management Systems (2017) Interviews with Data Scientists; see: http://www.odbms.org/2017/01/qa-with-data-scientists-christopher-schommer/ Detailed reference viewed: 167 (9 UL)![]() Duflo, Gabriel ![]() ![]() ![]() in Intelligent Information and Database Systems - 13th Asian Conference ACIIDS 2021, Phuket, Thailand, April 7-10, 2021, Proceedings (2021) Detailed reference viewed: 111 (30 UL)![]() Duflo, Gabriel ![]() ![]() ![]() Scientific Conference (2020) Detailed reference viewed: 160 (37 UL)![]() Tran, Duc Dung ![]() ![]() in Proceedings of 2021 IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE PIMRC 2021) (2021, September) In massive machine-type communications (mMTC) networks, the ever-growing number of MTC devices and the limited radio resources have caused a severe problem of random access channel (RACH) congestion. To ... [more ▼] In massive machine-type communications (mMTC) networks, the ever-growing number of MTC devices and the limited radio resources have caused a severe problem of random access channel (RACH) congestion. To mitigate this issue, several potential multiple access (MA) mechanisms including sparse code MA (SCMA) have been proposed. Besides, the short-packet transmission feature of MTC devices requires the design of new transmission and congestion avoidance techniques as the existing techniques based on the assumption of infinite data-packet length may not be suitable for mMTC networks. Therefore, it is important to find novel solutions to address RACH congestion in mMTC networks while considering SCMA and short-packet communications (SPC). In this paper, we propose an SCMA-based random access (RA) method, in which Q-learning is utilized to dynamically allocate the SCMA codebooks and time-slot groups to MTC devices with the aim of minimizing the RACH congestion in SPC-based mMTC networks. To clarify the benefits of our proposed method, we compare its performance with those of the conventional RA methods with/without Q-learning in terms of RA efficiency and evaluate its convergence. Our simulation results show that the proposed method outperforms the existing methods in overloaded systems, i.e., the number of devices is higher than the number of available RA slots. Moreover, we illustrate the sum rate comparison between SPC and long-packet communications (LPC) when applying the proposed method to achieve more insights on SPC. [less ▲] Detailed reference viewed: 103 (9 UL)![]() ; Vlassis, Nikos ![]() in Proc Int. Joint Conf. on Autonomous Agents and Multi-Agent Systems (2007) Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by dynamic programming, and ... [more ▼] Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by dynamic programming, and then a policy is extracted from this value function. In this paper we study whether similar Q-value functions can be defined in decentralized POMDP models (Dec-POMDPs), what the cost of computing such value functions is, and how policies can be extracted from such value functions. Using the framework of Bayesian games, we argue that searching for the optimal Q-value function may be as costly as exhaustive policy search. Then we analyze various approximate Q-value functions that allow efficient computation. Finally, we describe a family of algorithms for extracting policies from such Q-value functions. [less ▲] Detailed reference viewed: 104 (0 UL)![]() ![]() ; Vlassis, Nikos ![]() in Proc. AAAI Spring Symp. on Game Theoretic and Decision Theoretic Agents (2007) Detailed reference viewed: 56 (0 UL)![]() Kayhan, Farbod ![]() in 8th Advanced Satellite Multimedia Systems Conference (ASMS/SPSC), Palma de Mallorca, Spain, 2016 (2016, September) Employing high order constellations is inevitable in order to achieve higher spectral efficiency in satellite communication systems. In DVB-S2X standard, constellations with up to 256 points have been ... [more ▼] Employing high order constellations is inevitable in order to achieve higher spectral efficiency in satellite communication systems. In DVB-S2X standard, constellations with up to 256 points have been included. However, optimizing such high order constellations is a difficult task. In this paper we propose a very simple constellation design based on the radial map from QAM constellations to non-uniform APSK constellations. Our method provides a systematic way to generate a family of optimized high order constellations. We show that gains larger than 0.5 dB can be obtained with respect to the DVB-S2X constellations with 256 points. Even though the proposed constellations are essentially sub-optimal (in terms of maximizing the mutual information), they provide a very competitive test benchmark for the performance of high order constellations. Moreover, the proposed construction potentially allows for an efficient one-dimensional soft detection by an inverse mapping to the QAM. Finally, further optimization techniques are discussed. [less ▲] Detailed reference viewed: 215 (8 UL)![]() Bianculli, Domenico ![]() Book published by ACM (2011) Detailed reference viewed: 77 (1 UL)![]() Bianculli, Domenico ![]() Book published by ACM (2013) Detailed reference viewed: 96 (6 UL)![]() Fahner, Johannes Hendrik ![]() Presentation (2017, December 13) Detailed reference viewed: 170 (0 UL)![]() Ostrev, Dimiter ![]() in Quantum (2021) This paper proposes and proves security of a QKD protocol which uses two-universal hashing instead of random sampling to estimate the number of bit flip and phase flip errors. This protocol dramatically ... [more ▼] This paper proposes and proves security of a QKD protocol which uses two-universal hashing instead of random sampling to estimate the number of bit flip and phase flip errors. This protocol dramatically outperforms previous QKD protocols for small block sizes. More generally, for the two-universal hashing QKD protocol, the difference between asymptotic and finite key rate decreases with the number $n$ of qubits as $cn^{-1}$, where $c$ depends on the security parameter. For comparison, the same difference decreases no faster than $c'n^{-1/3}$ for an optimized protocol that uses random sampling and has the same asymptotic rate, where $c'$ depends on the security parameter and the error rate. [less ▲] Detailed reference viewed: 82 (9 UL)![]() Atashpendar, Arash ![]() Software (2014) QKD simulator © is a web application aimed at simulating and analyzing Quantum Key Distribution protocols. The online simulator is powered by the QKD Simulation Toolkit, which has been designed and ... [more ▼] QKD simulator © is a web application aimed at simulating and analyzing Quantum Key Distribution protocols. The online simulator is powered by the QKD Simulation Toolkit, which has been designed and implemented to support customizing a wide range of parameters for individual components and sub-protocols, e.g., the quantum channel, sifting, error estimation, information reconciliation and privacy amplification. Each simulation run provides detailed information about the intermediate and final stages of the protocol. [less ▲] Detailed reference viewed: 307 (27 UL)![]() Hoja, Johannes ![]() ![]() in Scientific Data (2021), 8(43), We introduce QM7-X, a comprehensive dataset of 42 physicochemical properties for ≈4.2 million equilibrium and non-equilibrium structures of small organic molecules with up to seven non-hydrogen (C, N, O ... [more ▼] We introduce QM7-X, a comprehensive dataset of 42 physicochemical properties for ≈4.2 million equilibrium and non-equilibrium structures of small organic molecules with up to seven non-hydrogen (C, N, O, S, Cl) atoms. To span this fundamentally important region of chemical compound space (CCS), QM7-X includes an exhaustive sampling of (meta-)stable equilibrium structures—comprised of constitutional/structural isomers and stereoisomers, e.g., enantiomers and diastereomers (including cis-/trans- and conformational isomers)—as well as 100 non-equilibrium structural variations thereof to reach a total of ≈4.2 million molecular structures. Computed at the tightly converged quantum-mechanical PBE0+MBD level of theory, QM7-X contains global (molecular) and local (atom-in-a-molecule) properties ranging from ground state quantities (such as atomization energies and dipole moments) to response quantities (such as polarizability tensors and dispersion coefficients). By providing a systematic, extensive, and tightly-converged dataset of quantum-mechanically computed physicochemical properties, we expect that QM7-X will play a critical role in the development of next-generation machine-learning based models for exploring greater swaths of CCS and performing in silico design of molecules with targeted properties. [less ▲] Detailed reference viewed: 217 (14 UL)![]() Alodeh, Maha ![]() in IEEE International Conference on Communications (2012) Detailed reference viewed: 95 (7 UL)![]() Kebedew, Teweldebrhan Mezgebo ![]() ![]() ![]() in IEEE 96st Vehicular Technology Conference, London-Beijing, Sept. 2022 (2022) Detailed reference viewed: 45 (11 UL)![]() ![]() ; ; Ottersten, Björn ![]() in Proceedings IEEE Vehicular Technology Conference, Fall (2004) Detailed reference viewed: 66 (1 UL)![]() Gautam, Sumit ![]() ![]() ![]() Scientific Conference (2018, December) We investigate the performances of the time-switching (TS) and power-splitting (PS) based energy harvesting models in a two-hop relay assisted network where the end-users are capable of decoding ... [more ▼] We investigate the performances of the time-switching (TS) and power-splitting (PS) based energy harvesting models in a two-hop relay assisted network where the end-users are capable of decoding information and harvesting energy concurrently. In particular, we consider joint resource allocation and relay selection to realize Simultaneous Wireless Transmission of Information and Energy (Wi-TIE) in a multi-carrier multi-user cooperative system where the relays employ the amplify-and-forward (AF) protocol. First, we formulate based on the TS and PS Wi-TIE architectures an optimization problem to maximize the sum of energy harvested at the end-users, taking into consideration each user's quality-of-service (QoS) requirement as well as power constraints at the transmit and relaying nodes. We then solve the formulated problem to optimize the users' Wi-TIE splitting factors along with relay-user coupling, sub-carrier-user assignment, sub-carrier pairing, and power allocation. Finally, we demonstrate the benefits of the proposed framework via numerical results. [less ▲] Detailed reference viewed: 183 (9 UL)![]() ; ; Navet, Nicolas ![]() Scientific Conference (2021, February 09) This work is about the design and configuration of service-oriented communication on top of Ethernet TSN. The first objective is to present takeaways from the design and implementation of the Renault E/E ... [more ▼] This work is about the design and configuration of service-oriented communication on top of Ethernet TSN. The first objective is to present takeaways from the design and implementation of the Renault E/E Service-Oriented Architecture (SOA) called FACE. In particular, we discuss technological, design and configuration choices made for the SOA, such as how to segment messages (UDP with multiple events, TCP, SOME/IP TP), and the technical possibilities to shape the transmission of the packets on the Ethernet network. The second objective is to study how to ensure the Quality of Service (QoS) required by services. Indeed, services introduce specific challenges, be it only the sheer amount of traffic they generate and if there is a growing body of experiences in the use of TSN QoS mechanisms most of what has been learned so far is mostly about meeting the requirements of individual streams. Less is known for services that involve the transmission of several, possibly segmented, messages with more complex transmission patterns. We show on the FACE architecture how SOME/IP messages were mapped to TSN QoS mechanisms in a manual then automated manner so as to meet the individual requirements of the services in terms of timing, and the system’s requirements in terms of memory usage. [less ▲] Detailed reference viewed: 294 (9 UL) |
||