Results 51 to 60 of about 1,085,519 (269)
Lower Bounds of Copson Type for Hausdorff Matrices on Weighted Sequence Spaces [PDF]
Journal of Sciences, Islamic Republic of Iran, 2011 Let = be a non-negative matrix. Denote by the supremum of those , satisfying the following inequality: where , , and also is increasing, non-negative sequence of real numbers.
R. Lashkaripour
doaj
A Bibliometric Analysis of Publications in Uremic Toxins From 1991 to 2024
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Uremic toxins are a growing area of research in nephrology, with significant implications in the progression and treatment of chronic kidney disease (CKD) and the management of end‐stage kidney disease (ESKD). This bibliometric analysis aims to evaluate the global research trends, key contributors, and the impact of publications in ...
Yuh‐Shan Ho +7 more
wiley +1 more source
Lower bounds on systolic gossip
Proceedings 11th International Parallel Processing Symposium, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
FLAMMINI, MICHELE, PERENNES S.
openaire +4 more sources
Lower bounds for the bandwidth problem
Computers & Operations Research, 2021 The Bandwidth Problem seeks for a simultaneous permutation of the rows and columns of the adjacency matrix of a graph such that all nonzero entries are as close as possible to the main diagonal. This work focuses on investigating novel approaches to obtain lower bounds for the bandwidth problem.
Franz Rendl +2 more
openaire +4 more sources
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Chronic micro‐inflammation in patients with end‐stage renal disease (ESRD) is a significant driver of cardiovascular complications and diminished quality of life. While standard hemodialysis (SHD) effectively manages small‐molecule clearance, its ability to remove medium‐to‐large uremic toxins—the primary catalysts of systemic ...
Hongwei Zuo +5 more
wiley +1 more source
Shellings and the Lower Bound Theorem [PDF]
Discrete & Computational Geometry, 1999 A stacked \(d\)-polytope \(P_s\) is a simplicial polytope obtained from a simplex by successive addition of pyramids over facets. The number of \(k\)-faces \((1\leq k\leq d-1)\) of \(P_s\) is some function \(\varphi_k(n,d),\) where \(n\) is the vertex number of \(P_s.\) The lower bound theorem (LBT) asserts that for a simplicial \(d\)-polytope \(P ...
Gerd Blind, Roswitha Blind
openaire +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
FEBS Letters, EarlyView.Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi +5 more
wiley +1 more source
FEBS Letters, EarlyView.We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source