Results 51 to 60 of about 254,578 (267)

A light metric spanner

open access: yes, 2015
It has long been known that $d$-dimensional Euclidean point sets admit $(1+\epsilon)$-stretch spanners with lightness $W_E = \epsilon^{-O(d)}$, that is total edge weight at most $W_E$ times the weight of the minimum spaning tree of the set [DHN93 ...
Gottlieb, Lee-Ad
core   +1 more source

Riemannian simplices and triangulations [PDF]

open access: yes, 2014
We study a natural intrinsic definition of geometric simplices in Riemannian manifolds of arbitrary dimension $n$, and exploit these simplices to obtain criteria for triangulating compact Riemannian manifolds.
Dyer, Ramsay   +2 more
core   +5 more sources

Dietary Protein Intake and Peritoneal Protein Losses in Peritoneal Dialysis Patients

open access: yesTherapeutic 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

Honeycomb Rhombic Torus Vertex-Edge Based Resolvability Parameters and Its Application in Robot Navigation

open access: yesIEEE Access
In the aircraft sector, honeycomb composite materials are frequently employed. Recent research has demonstrated the benefits of honeycomb structures in applications involving nanohole arrays in anodized alumina, micro-porous arrays in polymer thin films,
Sidra Bukhari   +3 more
doaj   +1 more source

Metric Dimension of Amalgamation of Graphs [PDF]

open access: yes, 2013
A set of vertices $S$ resolves a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of $G$ is the minimum cardinality of a resolving set of $G$.
Saputro, Suhadi Wido   +2 more
core  

Phase Retrieval via Randomized Kaczmarz: Theoretical Guarantees

open access: yes, 2017
We consider the problem of phase retrieval, i.e. that of solving systems of quadratic equations. A simple variant of the randomized Kaczmarz method was recently proposed for phase retrieval, and it was shown numerically to have a computational edge over ...
Tan, Yan Shuo, Vershynin, Roman
core   +1 more source

Effects of the Fluid Replacement Method During Online Hemodiafiltration on the Solute Removal Performance and Biocompatibility Using the Asymmetric Cellulose Triacetate Membrane

open access: yesTherapeutic 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

Fault-Tolerant Edge Metric Dimension of Zero-Divisor Graphs of Commutative Rings

open access: yesAxioms
In recent years, the intersection of algebraic structures and graph-theoretic concepts has developed significant interest, particularly through the study of zero-divisor graphs derived from commutative rings.
Omaima Alshanquiti   +2 more
doaj   +1 more source

The newfound relationship between extrachromosomal DNAs and excised signal circles

open access: yesFEBS Letters, EarlyView.
Extrachromosomal DNAs (ecDNAs) contribute to the progression of many human cancers. In addition, circular DNA by‐products of V(D)J recombination, excised signal circles (ESCs), have roles in cancer progression but have largely been overlooked. In this Review, we explore the roles of ecDNAs and ESCs in cancer development, and highlight why these ...
Dylan Casey, Zeqian Gao, Joan Boyes
wiley   +1 more source

Maximum Scatter TSP in Doubling Metrics

open access: yes, 2016
We study the problem of finding a tour of $n$ points in which every edge is long. More precisely, we wish to find a tour that visits every point exactly once, maximizing the length of the shortest edge in the tour. The problem is known as Maximum Scatter
Kozma, László, Mömke, Tobias
core   +1 more source

Home - About - Disclaimer - Privacy