Results 11 to 20 of about 8,048,933 (339)
A beta-beta achievability bound with applications [PDF]
International Symposium on Information Theory, 2016 A channel coding achievability bound expressed in terms of the ratio between two Neyman-Pearson β functions is proposed. This bound is the dual of a converse bound established earlier by Polyanskiy and Verdú (2014).
Wei Yang +4 more
semanticscholar +2 more sources
THE ACHIEVABILITY OF TARGET CONVECTION VOLUMES IN ON-LINE HEMODIAFILTRATION
Вестник трансплантологии и искусственных органов, 2016 Aim. To evaluate the achievability of recommended convection volumes in hemodiafiltration (HDF) and impeding factors. Materials and methods. In short interventional one-center study among 67 stable prevalent dialysis patients we succeeded in achieving ...
A. B. Sabodash +6 more
doaj +3 more sources
RMD Open, 2020 Objectives Although current treatment guidelines for rheumatoid arthritis (RA) suggest tapering disease-modifying anti-rheumatic drugs (DMARDs), it is unclear whether DMARD-free remission (DFR) is an achievable and sustainable outcome.
M Verstappen +3 more
doaj +2 more sources
Degree of Achievability of Omnidirectional Motion in Various Mobile Robot Designs: A Review
IEEE International Conference on Robotics and Automation, 2016 In the current field of robotics, many new robots are being developed based on different working principles. Each robot has its own strengths and weaknesses.
A. R. Justus
semanticscholar +3 more sources
On the Achievability of Simulation-Based Security for Functional Encryption [PDF]
Annual International Cryptology Conference, 2013 peer reviewedThis work attempts to clarify to what extent simulation-based security (SIM-security) is achievable for functional encryption (FE) and its relation to the weaker indistinguishability-based security (IND-security).
Angelo De Caro +5 more
semanticscholar +2 more sources
On achievability of linear source coding over finite rings
2013 IEEE International Symposium on Information Theory, 2013 We propose using linear mappings over finite rings as encoders in the Slepian-Wolf and the source coding for computing problems. It is known that the arithmetic of many finite rings is substantially easier to implement than the one of finite fields ...
Sheng Huang, M. Skoglund
semanticscholar +2 more sources
Achievability of asymptotic minimax regret by horizon-dependent and horizon-independent strategies
Journal of machine learning research, 2015 The normalized maximum likelihood distribution achieves minimax coding (log-loss) regret given a fixed sample size, or horizon, n. It generally requires that n be known in advance.
Kazuho Watanabe, Teemu Roos
semanticscholar +2 more sources
The underappreciated role of transboundary pollution in future air quality and health improvements in China [PDF]
Atmospheric Chemistry and Physics, 2023 Studies assessing the achievability of future air quality goals in China have focused on the role of reducing China's domestic emissions, yet the influence of transboundary pollution of foreign origins has been largely underappreciated.
J.-W. Xu, J. Lin, D. Tong, L. Chen
doaj +1 more source
Achievement and Enhancement [PDF]
Canadian Journal of Philosophy, 2019 AbstractWe engage with the nature and the value of achievement through a critical examination of an argument according to which biomedical “enhancement” of our capacities is impermissible because enhancing ourselves in this way would threaten our achievements. We call this the argument against enhancement from achievement.
Lisa Forsberg, Anthony Skelton
openaire +2 more sources
A Unified Framework for One-Shot Achievability via the Poisson Matching Lemma [PDF]
IEEE Transactions on Information Theory, 2018 We introduce a fundamental lemma called the Poisson matching lemma, and apply it to prove one-shot achievability results for various settings, namely channels with state information at the encoder, lossy source coding with side information at the decoder,
Cheuk Ting Li, V. Anantharam
semanticscholar +1 more source