Results 71 to 80 of about 13,257,834 (322)
Lower Bound on the Overlattice-Based Sieve Algorithm
CryptographyLattice-based cryptography stands as one of the most pivotal candidates in post-quantum cryptography. To configure the parameters of lattice-based cryptographic schemes, a thorough comprehension of their concrete security is indispensable.
Tongchen Shen, Xiangxue Li, Licheng Wang
doaj +1 more source
Bayesian Cramér-Rao Lower Bound for Magnetic Field-Based Localization
IEEE Access, 2022 In this paper, we show how to analyze the achievable position accuracy of magnetic localization based on Bayesian Cramér-Rao lower bounds and how to account for deterministic inputs in the bound.
Benjamin Siebler +2 more
doaj +1 more source
Dietary Protein Intake and Peritoneal Protein Losses in Peritoneal Dialysis Patients
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Introduction Peritoneal dialysis (PD) patients lose protein in their waste dialysate, potentially increasing their risk for malnutrition. We wished to determine whether there was any association between losses and dietary protein intake (DPI). Methods DPI was assessed from 24‐h dietary recall using Nutrics software.
Haalah Shaaker, Andrew Davenport
wiley +1 more source
Blow-up phenomena for a pseudo-parabolic system with variable exponents
Electronic Journal of Qualitative Theory of Differential Equations, 2017 In this paper, we consider a pseudo-parabolic system with nonlinearities of variable exponent type \begin{align*} \begin{cases} u_t-\Delta u_t-\operatorname{div}(|\nabla u|^{m(x)-2}\nabla u)=|uv|^{p(x)-2}uv^2 & \mbox{in}\ \Omega\times(0,T),\\
Qi Qi, Yujuan Chen, Qingshan Wang
doaj +1 more source
A Column Generation-Based Lower Bound for the Minimum Sum Coloring Problem
IEEE Access, 2020 The objective of this paper is to derive a tight and efficient lower bound for the minimum sum coloring problem. This NP-hard problem is a variant of the classical graph coloring problem where the objective is to minimize the sum of the colors.
Mehdi Mrad +3 more
doaj +1 more source
A Shadow Rate without a Lower Bound Constraint
Social Science Research Network, 2018 We propose a shadow rate that measures the expansionary (contractionary) interest rate effects of unconventional monetary policies that are present when the lower bound is not binding.
R. D. Rezende, Annukka Ristiniemi
semanticscholar +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Introduction Pre‐dilution online hemodiafiltration (Pre‐HDF) is predominantly used in Japan, whereas post‐dilution online HDF (Post‐HDF) is more common in Europe. An asymmetric cellulose triacetate (ATA) membrane may improve biocompatibility.
Kenji Sakurai +4 more
wiley +1 more source
Revealing the structure of land plant photosystem II: the journey from negative‐stain EM to cryo‐EM
FEBS Letters, EarlyView.Advances in cryo‐EM have revealed the detailed structure of Photosystem II, a key protein complex driving photosynthesis. This review traces the journey from early low‐resolution images to high‐resolution models, highlighting how these discoveries deepen our understanding of light harvesting and energy conversion in plants.
Roman Kouřil
wiley +1 more source
Entropy, 2016 In this work, we propose a new approach of deriving the bounds between entropy and error from a joint distribution through an optimization means. The specific case study is given on binary classifications.
Bao-Gang Hu, Hong-Jie Xing
doaj +1 more source
Efficient optimization of the Held–Karp lower bound
Open Journal of Mathematical Optimization, 2021 Given a weighted undirected graph $G=(V,E)$, the Held–Karp lower bound for the Traveling Salesman Problem (TSP) is obtained by selecting an arbitrary vertex $\bar{p} \in V$, by computing a minimum cost tree spanning $V \backslash \lbrace \bar{p}\rbrace $
Righini, Giovanni
doaj +1 more source