Results 51 to 60 of about 233 (151)
On the convergence of a bounded amart and a conjecture of Chatterji
Through the decomposition theorem of Lebesgue and Darst it is possible to define a generalized Radon-Nikodym derivative of a bounded additive set function with respect to a bounded countably additive set function.
Schmidt, Klaus D.
core
Adaptive Smoothness Constraint Ionospheric Tomography Algorithm. [PDF]
Sensors (Basel), 2020 Wen D, Mei D, Du Y.
europepmc +1 more source
Speech enhancement in non-stationary noise using compressive sensing
, 2016 This paper addresses the problem of single channel speech enhancement algorithm in non-stationary noise environment which is rather difficult compared to the stationary noise.
Sulong, Amart +7 more
core +1 more source
The Role of Trabectedin in Soft Tissue Sarcoma. [PDF]
Front Pharmacol, 2022 Nakamura T, Sudo A.
europepmc +1 more source
T-cell exhaustion and stemness in antitumor immunity: Characteristics, mechanisms, and implications. [PDF]
Front Immunol, 2023 Chi X +6 more
europepmc +1 more source
Amarts: A class of asymptotic martingales a. Discrete parameter
A sequence (Xn) of random variables adapted to an ascending (asc.) sequence n of [sigma]-algebras is an amart iff EX[tau] converges as [tau] runs over the set T of bounded stopping times. An analogous definition is given for a descending (desc.) sequence
Sucheston, Louis, Edgar, Gerald A.
core
أسلوب مقترح لهندسة برمجیات نظم الوکلاء
Al-Rafidain Journal of Computer Sciences and Mathematics, 2012 Asmaa Yaseen Hammo, Maher Talal Alasaady
doaj +1 more source
The Riesz decomposition for vector-valued amarts [PDF]
Bulletin of the American Mathematical Society, 1976 Edgar, G. A., Sucheston, L.
openaire +4 more sources
Relational binding and holistic retrieval in ageing. [PDF]
Memory, 2021 Ngo CT, Newcombe NS.
europepmc +1 more source
Amarts: A class of asymptotic martingales B. Continuous parameter
A continuous-parameter ascending amart is a stochastic process (Xt)t[set membership, variant]+ such that E[X[tau]n] converges for every ascending sequence ([tau]n) of optional times taking finitely many values.
Sucheston, Louis, Edgar, Gerald A.
core