Results 61 to 70 of about 390,323 (304)
On the broadcast independence number of circulant graphs
An independent broadcast on a graph [Formula: see text] is a function [Formula: see text] such that (i) [Formula: see text] for every vertex [Formula: see text], where [Formula: see text] denotes the diameter of [Formula: see text] and [Formula: see text] the eccentricity of vertex [Formula: see text], and (ii) [Formula: see text] for every two ...
Abdelamin Laouar +2 more
openaire +2 more sources
ABSTRACT Background Neuromyelitis optica spectrum disorder (NMOSD) is a relapsing autoimmune disease of the central nervous system. High‐dose intravenous methylprednisolone (IVMP) is the standard first‐line therapy for acute attacks, although some patients remain refractory.
Wataru Horiguchi +5 more
wiley +1 more source
Looseness and Independence Number of Triangulations on Closed Surfaces
The looseness of a triangulation G on a closed surface F2, denoted by ξ (G), is defined as the minimum number k such that for any surjection c : V (G) → {1, 2, . . . , k + 3}, there is a face uvw of G with c(u), c(v) and c(w) all distinct. We shall bound
Nakamoto Atsuhiro +3 more
doaj +1 more source
Dietary Protein Intake and Peritoneal Protein Losses in Peritoneal Dialysis Patients
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
Rainbow Connection Number and Independence Number of a Graph [PDF]
Let $G$ be an edge-colored connected graph. A path of $G$ is called rainbow if its every edge is colored by a distinct color. $G$ is called rainbow connected if there exists a rainbow path between every two vertices of $G$. The minimum number of colors that are needed to make $G$ rainbow connected is called the rainbow connection number of $G$, denoted
Jiuying Dong, Xueliang Li 0001
openaire +3 more sources
ABSTRACT Background Therapeutic apheresis (TA) is an established treatment modality for hematologic, neurologic, and immunologic disorders, yet access remains severely limited in sub‐Saharan Africa. Donor apheresis, including platelet apheresis collection from healthy donors, represents an important complementary modality supporting blood product ...
Nosa Bazuaye +33 more
wiley +1 more source
ABSTRACT Introduction Patients requiring long‐term continuous renal replacement therapy (CRRT) generally have poor prognoses. This study evaluated whether adding continuous intravenous sodium infusion (cIVNa) is associated with improved hemodynamics and outcomes in patients undergoing long‐term CRRT for ≥ 7 days.
Akinori Yamaguchi +6 more
wiley +1 more source
Measuring the independence of aircraft accident investigation authorities in ICAO Member States [PDF]
This project examines the safety management of civil aircraft accident investigation authorities in International Civil Aviation Organization (ICAO) Member States, with particular emphasis on the independence of the investigations.
Alsrisari, Sami Mohammed
core
The independence number of a graph [PDF]
In the master's thesis we are dealing with the independence number of a graph. We show, that the well-known problem 3-SAT is reducible to the corresponding decision problem, the so-called independent set problem, which proves that the independent set ...
Šere, Nina
core
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

