Results 121 to 130 of about 5,940,643 (309)

Approximation Error Bounds via Rademacher's Complexity [PDF]

open access: yes, 2008
Approximation properties of some connectionistic models, commonly used to construct approximation schemes for optimization problems with multivariable functions as admissible solutions, are investigated.
Gnecco, Giorgio, Sanguineti, Marcello
core  

The Impact of Tenapanor on Body Composition and Blood Pressure in Peritoneal Dialysis Patients: A Pilot Study

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Instruction Tenapanor potentially affects fluid volume and blood pressure. This study explored its effects on these parameters in patients undergoing peritoneal dialysis (PD). Methods We conducted a single‐arm, prospective observational study that enrolled 10 patients on PD with hyperphosphatemia who were newly initiated on tenapanor.
Shun Yoshida   +11 more
wiley   +1 more source

Trigonometric approximation by Nörlund type means in $L^p$-norm [PDF]

open access: yes, 2002
summary:We show that the same degree of approximation as in the theorems proved by L. Leindler [Trigonometric approximation in $L^p$-norm, J. Math. Anal. Appl. 302 (2005), 129--136] and P.
Szal, Bogdan, Prem Chandra
core   +1 more source

On the lower semi-continuity of the set valued metric projection

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1992
The lower semi-continuity of best approximation operators from Banach lattices on to closed ideals is investigated. Also the existence of best approximation to sub-function modules of function modules is proved. The order intersection properties of cells
Fowzi Ahmad Sejeeni
doaj   +1 more source

A Lower Bound for Approximating Grundy Numbering.

open access: yesDiscret. Math. Theor. Comput. Sci., 2007
The grundy numbering of a graph is the maximum number of colors used by on-line first-fit coloring, under the worst order of arrival of vertices. The grundy numbering problem is to find this ordering. We prove that there is a constant c>1 so that approximating the grundy numbering problem within c is not possible, unless NP ...
openaire   +2 more sources

Diversity and complexity in neural organoids

open access: yesFEBS Letters, EarlyView.
Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley   +1 more source

The human gut microbiome across the life course

open access: yesFEBS Letters, EarlyView.
Despite significant individual variation and continuous change throughout life, the human gut microbiome follows some life stage‐specific trends. This article provides a brief overview of how gut microbiome composition shifts across different phases of life. Created in BioRender. Özkurt, E. (2026) https://BioRender.com/8q4nrnc.
Alise J. Ponsero   +4 more
wiley   +1 more source

Degradation mechanism of the von Willebrand factor A2 domain by nattokinase

open access: yesFEBS Letters, EarlyView.
Nattokinase, a natto‐derived protease, exhibits potent antithrombotic effects. This study demonstrates that nattokinase directly cleaves the von Willebrand factor (vWF) A2 domain in vitro. Unlike the native regulator ADAMTS13, nattokinase degrades folded vWF independently of shear stress.
Ryuichi Hyakumoto   +3 more
wiley   +1 more source

A Tight 4/3 Approximation for Capacitated Vehicle Routing in Trees [PDF]

open access: yes, 2018
Given a set of clients with demands, the Capacitated Vehicle Routing problem is to find a set of tours that collectively cover all client demand, such that the capacity of each vehicle is not exceeded and such that the sum of the tour lengths is ...
Becker, Amariah
core   +1 more source

A lower bound in asymptotic diophantine approximations

open access: yesDuke Mathematical Journal, 1968
Let \(\alpha\) be a real irrational number. Define for all real numbers \(B\ge 1\), \(\lambda(B,\alpha)\) to be the number of solutions in integers \(q\), \(p\) of the inequalities \(\vert q\alpha - p\vert < 1/q\), \(1\le q\le B\). It is known [\textit{W. Schmidt}, Can. J. Math.
openaire   +3 more sources

Home - About - Disclaimer - Privacy