Results 41 to 50 of about 11,854,671 (316)
Test-and-Set in Optimal Space [PDF]
The test-and-set object is a fundamental synchronization primitive for shared memory systems. This paper addresses the number of registers (supporting atomic reads and writes) required to implement a one-shot test-and-set object in the standard asynchronous shared memory model with n processes. The best lower bound is log n − 1 for obstruction-free and
Giakkoupis, George +3 more
openaire +2 more sources
ABSTRACT Background Fertility preservation (FP) is increasingly integrated into the care of pediatric patients exposed to gonadotoxic therapy or conditioning for hematopoietic stem cell transplantation (HSCT), yet perioperative data in infants and toddlers remain scarce.
Kerstin Saalabian +13 more
wiley +1 more source
Painlevé-Kuratowski convergence for set optimization solutions using improvement sets
This paper investigates the Painlevé-Kuratowski convergence of solution sets in set optimization problems under perturbations. By introducing the notion of [Formula: see text]-[Formula: see text]-Strictly quasiconvexity for set-valued mappings, we ...
Taiyong Li, Manli Yang
doaj +1 more source
ABSTRACT Background Central nervous system (CNS) neuroblastoma, FOXR2‐activated, is a recently recognized entity in the WHO CNS5 classification, defined by activation of the FOXR2 transcription factor and unique histopathological features. This review synthesizes available literature and pooled clinical data, providing insight into demographics ...
Sudarshawn Damodharan +1 more
wiley +1 more source
ABSTRACT Background Type 1 plasminogen deficiency (PLGD‐1) is an ultra‐rare autosomal recessive disorder caused by variants in the PLG gene and affects approximately 1.6 individuals per million. The condition is characterized by decreased plasminogen levels and impaired function, resulting in fibrin‐rich lesions on mucous membranes throughout the body.
Charles Nakar +7 more
wiley +1 more source
On the Optimal Compression of Sets in PSPACE [PDF]
We show that if DTIME[2^{O(n)}] is not included in DSPACE[2^{o(n)}], then, for every set B in PSPACE, all strings x in B of length n can be represented by a string compressed(x) of length at most log (|B^{=n}|) + O(log n), such that a polynomial-time algorithm, given compressed(x), can distinguish x from all the other strings in B^{=n}.
openaire +3 more sources
ABSTRACT Pediatric radiation therapy presents unique challenges compared to adult treatments, including those of immobilization, potential need for sedation, and the critical importance of accurate, reproducible positioning. Additionally, heightened attention to imaging doses is necessary to minimize long‐term toxicity in survivors.
Parham Alaei +17 more
wiley +1 more source
This paper provides a vector-valued level set-based topology optimization method for multiple materials. The proposed method is characterized by a perfectly symmetric representation of multi-material by a vector valued level set function, which lowers ...
Masaki NODA +2 more
doaj +1 more source
Early Impact of Childhood Opportunity on Neurocognitive Outcomes in Sickle Cell Disease
ABSTRACT Introduction Neurocognitive impairment is a well‐recognized complication of sickle cell disease (SCD) that begins early in childhood and persists across development. While cerebrovascular injury contributes substantially to risk, neurocognitive deficits are also observed in children without overt or silent cerebral infarctions, suggesting ...
Julia E. LaMotte +5 more
wiley +1 more source
In this paper, we introduce a second-order strong subdifferential of set-valued maps, and discuss some properties, such as convexity, sum rule and so on.
Yuwen Zhai, Qilin Wang, Tian Tang
doaj +1 more source

