Results 61 to 70 of about 2,522,495 (283)
Self-stabilizing Connected Components
For the problem of computing the connected components of a graph, this paper considers the design of algorithms that are resilient to transient hardware faults, like bit flips. More specifically, it applies the technique of \emph{self-stabilization}. A system is self-stabilizing if, when starting from a valid or invalid state, it is guaranteed to reach
Piyush Sao +4 more
openaire +2 more sources
ABSTRACT End‐of‐life conversations with adolescents and young adults (AYAs) with cancer rarely occur without the guidance of healthcare professionals. As a part of the ‘Difficult Discussions’ study, focused on palliative care and advance care planning discussions with AYAs with cancer, we investigated the factors that healthcare professionals identify ...
Justine Lee +9 more
wiley +1 more source
Reversed S-shaped connected component for a fourth-order boundary value problem
In this paper, we investigate the existence of a reversed S-shaped component in the positive solutions set of the fourth-order boundary value problem { u ′′′′ ( x ) = λ h ( x ) f ( u ( x ) ) , x ∈ ( 0 , 1 ) , u ( 0 ) = u ( 1 ) = u ″ ( 0 ) = u ″ ( 1 ) = 0
Jinxiang Wang, Ruyun Ma
doaj +1 more source
On chemical distances and shape theorems in percolation models with long-range correlations
In this paper we provide general conditions on a one parameter family of random infinite subsets of Z^d to contain a unique infinite connected component for which the chemical distances are comparable to the Euclidean distances, focusing primarily on ...
Drewitz, Alexander +2 more
core +1 more source
Defining Roles in Pediatric Palliative Care: Perspectives From Oncology and Palliative Care Teams
ABSTRACT Background Early integration of pediatric palliative care (PPC) is associated with improved symptom management, quality of life, and healthcare utilization for children with cancer. Despite this, variation persists in how PPC is understood, operationalized, and integrated within pediatric oncology programs. In particular, ambiguity surrounding
Leeat Granek +13 more
wiley +1 more source
On the Connected Safe Number of Some Classes of Graphs
For a connected simple graph G, a nonempty subset S of VG is a connected safe set if the induced subgraph GS is connected and the inequality S≥D satisfies for each connected component D of G∖S whenever an edge of G exists between S and D.
Rakib Iqbal +4 more
doaj +1 more source
This research work plays a significant role in finding information from the scene images to fulfill the demand of real life applications like detection of license plate, navigation of robot and helping the visually impaired persons. Here, a new algorithm
Rashedul Islam +2 more
doaj +1 more source
Fast connected component labeling algorithm: a non voxel-based approach [PDF]
This paper presents a new approach to achieve connected component labeling on both binary images and volumes by using the Extreme Vertices Model (EVM), a representation model for orthogonal polyhedra, applied to digital images and volume datasets ...
Aguilera, A +2 more
core +1 more source
On the size of a finite vacant cluster of random interlacements with small intensity
In this paper we establish some properties of percolation for the vacant set of random interlacements, for d at least 5 and small intensity u. The model of random interlacements was first introduced by A.S. Sznitman in arXiv:0704.2560.
Teixeira, Augusto
core +1 more source
ABSTRACT In pediatric patients, T‐cell lymphoblastic lymphoma (T‐LBL) survival exceeds 80%. Relapse remains associated with limited curative options. Frontline treatment is largely extrapolated from T‐cell acute lymphoblastic leukemia (T‐ALL) treatment, reflecting the ongoing debate, whether both entities represent distinct diseases or variants within ...
Marie C. Heider +4 more
wiley +1 more source

