Relay
Jonathan Couldridge, Vasiliki Panagi, A P Rae · Zenodo (CERN European Organization for Nuclear Research) · 2025
Cited by 0Open access
Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “Relay”
Jonathan Couldridge, Vasiliki Panagi, A P Rae · Zenodo (CERN European Organization for Nuclear Research) · 2025
Cited by 0Open access
de Pont, Camille A.F. · TU/e Research Portal
Cited by 0
Dominykas Strazdas, Anna-Maria Felßberg · OSF Preprints (OSF Preprints)
Cited by 0
Min Chen, Student Member, Aylin Yener · 2011
Abstract—We consider a multiuser two-way relay network where multiple pairs of users exchange information with the assistance of a relay node, using orthogonal channels per pair. For a variety of two-way relaying mechanisms, such as decodeand-forward (DF), amplify-and-forward (AF) and compress-andforward (CF), we investigate the problem of optimally allocating relay’s power among the user pairs it assists such that an arbitrary weighted sum rate of all users is maximized, and solve the problem as one or a set of convex problems for each relaying scheme. Numerical results are presented to demonstrate the performance of the optimum relay power allocation as well as the comparison among different two-way relaying schemes. Index Terms—Two-way relaying, network coding, weighted sum-rate maximization, decode/amplify/compress-and-forward, power allocation.
Cited by 0
VINCS, R · Minerva Access (University of Melbourne) · 2014
Cited by 0
Strazdas, Dominykas, Felßberg, Anna-Maria · Open Science Framework · 2022
Robotic EyeLink AnalYsis of the EyeLink 1000
Cited by 0Open access
Ashish P, Chin Keong Ho · 2013
Cited by 0
Jan W. Voung, Ranjit Jhala, Sorin Lerner · 2007
Data races occur when multiple threads are about to access the same piece of memory, and at least one of those accesses is a write. Such races can lead to hard-to-reproduce bugs that are time consuming to debug and fix. We present RELAY, a static and scalable race detection analysis in which unsoundness is modularized to a few sources. We describe the analysis and results from our experiments using RELAY to find data races in the Linux kernel, which includes about 4.5 million lines of code.
Cited by 335
Jonathan Couldridge, Vasiliki Panagi, A P Rae · Zenodo (CERN European Organization for Nuclear Research) · 2025
Cited by 0Open access
Anna-Maria Felßberg, Dominykas Strazdas · OSF Preprints (OSF Preprints) · 2022
Robotic EyeLink AnalYsis of the EyeLink 1000
Cited by 0
Fan Sun, Tae Min Kim, Arogyaswami J. Paulraj et al. · 2013
Abstract—Carefully designed protocols can turn overheard interference into useful side information to allow simultaneous transmission of multiple communication flows and increase the spectral efficiency in interference-limited regime. We propose a novel scheme in a typical cell-edge scenario. By exploiting the overhearing link through proper relay precoding and adaptive receiver processing, rate performance can be significantly improved compared to the conventional transmission which does not utilize overhearing. Slot 1 and 2
Cited by 0
Rice, Hugh C. · The Portal to Texas History (University of North Texas) · 1909
Patent for an electric relay "which is normally actuated by weak currents, and adapted when abnormally energized by heavier currents to shift the local current from one connection to another in order to prevent the relay armature from sticking" (lines 10-15).
Cited by 0Open access
Nicola Varanese, Osvaldo Simeone, Yeheskel Bar-ness et al. · 2013
Abstract — In this paper 1, we consider a fading relay channel operating according to the amplify-and-forward protocol, where each node has full CSI and multiple-antennas are deployed at the relay node. Maximization of the achievable rate with respect to the linear processing at the relay and the power allocation at the source and relay is performed under an instantaneous sumpower constraint. In particular, it is assumed that the total power used by all the active nodes during each time slot is fixed. d
Cited by 0
Ramy H. Gohary, Halim Yanikomeroglu, Ρh Y X · 2014
Abstract—This paper considers the ergodic non-coherent capacity of a multiple-input multiple-output frequency-flat block Rayleigh fading relay channel. It is shown that for this channel restricting the input distribution to be isotropic on a compact Grassmann manifold maximizes an upper bound on the cutset bound at high signal-to-noise ratios (SNRs). Furthermore, Grassmannian signalling at the source achieves this bound within an SNR-independent gap. For moderate-to-high SNRs, a Grassmannian decode-and-forward (DF) relaying scheme is devised, and the optimal signalling dimensionality that minimizes the gap to the upper bound is obtained.
Cited by 0
Dyer, Sonya · Goldsmiths (University of London) · 2021
La Biennale di Venezia presents the RELAY performance, held on July 16th and 17th 2021 at the Teatro Piccolo Arsenale, as part of the Meetings on Architecture – Expanded Programme of the 17th International Architecture Exhibition titled How will we live together?, curated by Hashim Sarkis. \n \nRELAY was a global conversation-relay lasting 24 hours, conceived and conducted by Adam Kaasa, Thandi Loewenson and David Burns of the Fiction Feeling Frame research collective at the School of Architecture, Royal College of Art in London. \n \n“How can we speak to one other? How can we speak together?”: these are the questions raised by RELAY, in an experiment designed to activate conversations and connectedness, to create closeness and intimacy. The project involved over 50 architects, artists, curators and designers in a unique debate live online from every time zone across the world. It started in Venice at 12 noon (12:00 CET; UTC + 2), passing the ‘conversational baton’ westward moving around the globe. \n \nInspired by performances such as Artangel’s Long Player Assembly (2020) and Occupy Wall Street’s ‘people’s microphone’ (2011), RELAY was been made possible by the support of the School of Architecture at the Royal College of Art and WePresent. \n \nRELAY was streamed live on relay.fff.industries and screened in several satellite sites: from Accra, from the African Futures Institute to the Nubuke Foundation, from Filet Space in London to the Frontyard in Sydney.
Cited by 0
2014
Cited by 0
University of Nebraska Press eBooks · 2017
Cited by 0
Hossam Fattah · 2021
Cited by 0
Alex Olson
Cited by 0
Mohit Thakur, Gerhard Kramer · 2013
The relay positioning problem is addressed for low signal-to-noise ratio Gaussian multicast relay networks where the objective is to maximize the multicast flow. A network coding based decode-and-forward (DF) strategy is presented that achieves strictly larger rates than a previously-studied routing based DF strategy. Properties of the multicast flow function are analyzed and efficient solutions are presented.
Cited by 2