Results 81 to 90 of about 23,418,736 (380)
European Journal of Remote Sensing, 2020 This article proposes the tracking algorithm based on density clustering of time scale and mesoscale eddy of Kalman filtering using the fused SLA data of altimeter.
Ji-Tao Li, Yong-Quan Liang
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Ongoing evidence indicates increased risk of sarcopenic obesity among children and young people (CYP) with acute lymphoblastic leukemia (ALL), often beginning early in treatment, persisting into survivorship. This review evaluates current literature on body composition in CYP with ALL during and after treatment.
Lina A. Zahed +5 more
wiley +1 more source
Quantum Linear System Algorithm for General Matrices in System Identification
Entropy, 2022 Solving linear systems of equations is one of the most common and basic problems in classical identification systems. Given a coefficient matrix A and a vector b, the ultimate task is to find the solution x such that Ax=b.
Kai Li +6 more
doaj +1 more source
Parent‐to‐Child Information Disclosure in Pediatric Oncology
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Despite professional consensus regarding the importance of open communication with pediatric cancer patients about their disease, actual practice patterns of disclosure are understudied. Extant literature suggests a significant proportion of children are not told about their diagnosis/prognosis, which is purported to negatively ...
Rachel A. Kentor +12 more
wiley +1 more source
Hybrid Fuzzy C-Means Clustering Algorithm Oriented to Big Data Realms
Axioms, 2022 A hybrid variant of the Fuzzy C-Means and K-Means algorithms is proposed to solve large datasets such as those presented in Big Data. The Fuzzy C-Means algorithm is sensitive to the initial values of the membership matrix.
Joaquín Pérez-Ortega +6 more
doaj +1 more source
Review of: "Unpacking the Complexities of Bitcoin Volatility: A Time Series Data with Long-term Memory or Long-range Dependence" [PDF]
, 2023 Juan Gabriel Brida
openalex +1 more source
How Long It Takes for an Ordinary Node with an Ordinary ID to Output?
, 2017 In the context of distributed synchronous computing, processors perform in rounds, and the time-complexity of a distributed algorithm is classically defined as the number of rounds before all computing nodes have output.
A Korman +13 more
core +1 more source
Time complexity of concurrent programs [PDF]
International Workshop on Formal Aspects of Component Software, 2015 We study the problem of automatically computing the time complexity of concurrent object-oriented programs. To determine this complexity we use intermediate abstract descriptions that record relevant information for the time analysis cost of statements ...
Elena Giachino +3 more
semanticscholar +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Cyclophosphamide (CY) is associated with potentially fatal cardiotoxicity, yet no electrocardiographic indices have been established for early detection of CY‐induced cardiomyopathy. This study aimed to determine whether corrected QT interval (QTc) prolongation can predict early onset of CY‐related cardiac dysfunction in pediatric ...
Junpei Kawamura +5 more
wiley +1 more source
The complex-time Segal–Bargmann transform
Journal of Functional Analysis, 2020 We introduce a new form of the Segal--Bargmann transform for a Lie group $K$ of compact type. We show that the heat kernel $( _{t}(x))_{t>0,x\in K}$ has a space-time analytic continuation to a holomorphic function \[ ( _{\mathbb{C}}( ,z))_{\mathrm{Re}\, >0,z\in K_{\mathbb{C}}} \] where $K_{\mathbb{C}}$ is the complexification of $K$.
Bruce K. Driver +2 more
openaire +4 more sources