Results 121 to 130 of about 10,224 (168)

Accuracy of glomerular filtration rate estimation based on creatinine and cystatin C for monitoring moderate chronic kidney disease in adults: prospective, longitudinal cohort study.

BMJ
Scandrett K, Sitch AJ, Barratt J, Brettell EA, Cockwell P, Dalton RN, Deeks JJ, Eaglestone G, Kalra PA, Khunti K, Loud FC, Ottridge R, Pellatt-Higgins T, Potter A, Rowe C, Sharpe CC, Shinkins B, Smith A, Stevens PE, Sutton AJ, Taal MW, Lamb EJ.   +21 more
europepmc   +1 more source

Characterization of human Metaxin proteins reveals functional diversification of SAM37 homologs MTX1 and MTX3

Morf SEJ, Challis MP, Uthishtran S, Rowe CL, Sharpe AJ, Kapoor-Kaushik N, Arumugam S, Formosa LE, McArthur K, Ryan MT.   +9 more
europepmc   +1 more source

Operative vs Nonoperative Treatment of Acute Cholecystitis in Older Adults With Multimorbidity.

JAMA Surg
Acker RC, Ginzberg SP, Sharpe J, Keele L, Hwang J, Bakillah E, Goldberg D, Kaufman E, Kelz RR.   +8 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Sharp lower bounds on the sum-connectivity index of trees

Discrete Mathematics, Algorithms and Applications, 2021
The sum-connectivity index of a graph [Formula: see text] is defined as the sum of weights [Formula: see text] over all edges [Formula: see text] of [Formula: see text], where [Formula: see text] and [Formula: see text] are the degrees of the vertices [Formula: see text] and [Formula: see text] in [Formula: see text], respectively. In this paper, some
S. Alyar, R. Khoeilar
openaire   +1 more source

Sharp upper bounds of the F-index of unicyclic graphs

Asian-European Journal of Mathematics, 2021
The forgotten topological index ([Formula: see text]-index) of a graph [Formula: see text], denoted by [Formula: see text], is defined as the sum of cubes of the degrees of all the vertices in a graph. A connected graph with equal order and size is called unicyclic graph, where order is number of vertices and size is number of edges.
S. M. Sheikholeslami, J. Rada, A. Jahanbani, R. Khoeilar, L. Shahbazi   +4 more
openaire   +1 more source

Sharp bounds on the Arithmetic–geometric index of graphs and line graphs

Discrete Applied Mathematics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guohui Li, Minjie Zhang 0002
openaire   +2 more sources

Sharp bounds for the general Randić index of transformation graphs

Journal of Intelligent & Fuzzy Systems, 2020
Inequalities are a useful method to investigate and compare topological indices of graphs relatively. A large collection of graph associated numerical descriptors have been used to examine the whole structure of networks. In these analysis, degree related topological indices have a significant position in theoretical chemistry and ...
Muhammad Imran 0006, Shehnaz Akhter, Hani Shaker   +2 more
openaire   +1 more source

Sharpness index and its application to focus control

Applied Optics, 1976
A sharpness index function, derived from the intensity distribution in an image aberrated by a quadratic-curvature wavefront distortion, is shown to be very effective as a measure of the correctness of focus. The function is introduced and analyzed in the spatial frequency domain.
openaire   +2 more sources

Sharp Bounds for the Second Zagreb Index of Unicyclic Graphs

Journal of Mathematical Chemistry, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan, Zheng, Liu, Huiqing, Liu, Heguo
openaire   +1 more source

Depth of convergence of a sharpness index autofocus system

Applied Optics, 1977
The critical parameters in the selection of an autofocus cost functional are that it must have a high sensitivity and selectivity at and near the correct focus point and that it must be capable of converging to the correct focus from a large initial or preclosed loop defocus state. The largest initial focal range error an autofocus system is capable of
openaire   +2 more sources