Results 61 to 70 of about 56,293 (261)
The Cycle Structure of Random Permutations
The Annals of Probability, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arratia, Richard, Tavare, Simon
openaire +3 more sources
Molecular Oncology, EarlyView.Loss of the miR‐214/199a cluster is associated with recurrence in ovarian cancer. Engineered small extracellular vesicles (m214‐sEVs) elevate miR‐214‐3p/miR‐199a‐5p in tumor cells, suppress β‐catenin, TLR4, and YKT6 signaling, reprogram tumor‐derived sEV cargo, reduce chemoresistance and migration, and enhance carboplatin efficacy and survival in ...
Weida Wang +12 more
wiley +1 more source
A Chinese restaurant process for multiset permutations
Modern Stochastics: Theory and ApplicationsMultisets are like sets, except that they can contain multiple copies of their elements. If there are ${n_{i}}$ copies of i, $1\le i\le t$, in multiset ${M_{t}}$, then there are $\left(\genfrac{}{}{0.0pt}{}{{n_{1}}+\cdots +{n_{t}}}{{n_{1}},\dots ,{n_{t}}}
Dudley Stark
doaj +1 more source
Computational Linguistics, 2022 The syntactic structure of a sentence is often represented using syntactic dependency trees. The sum of the distances between syntactically related words has been in the limelight for the past decades.
Lluís Alemany-Puig +1 more
doaj +1 more source
Molecular Oncology, EarlyView.Keratin 19 (KRT19) is overexpressed in high‐grade serous ovarian cancer with high levels of Kallikrein‐related peptidases (KLK) 4–7 and is associated with poor survival. In vivo analyses demonstrate that elevated KRT19 increases peritoneal tumour burden.
Sophia Bielesch +13 more
wiley +1 more source
Uniform estimates for smooth polynomials over finite fields
Discrete Analysis, 2023 Uniform estimates for smooth polynomials over finite fields, Discrete Analysis 2023:16, 31 pp. A positive integer $n$ is called $m$-_smooth_ if its largest prime factor has size at most $m$.
Ofir Gorodetsky
doaj +1 more source
On the XOR of Multiple Random Permutations [PDF]
, 2015 A straightforward way of constructing an n-bit pseudorandom function is to XOR two or more pseudorandom permutations: \(p_1\oplus \ldots \oplus p_k\). This XOR construction has gained broad attention over the last two decades. In this work, we revisit the security of this well-established construction.
Mennink, Bart, Preneel, Bart
openaire +2 more sources
Molecular Oncology, EarlyView.Dormant cancer cells can hide in distant organs for years, evading treatment and the immune system. This review highlights how signals from the surrounding tissue and immune environment keep these cells inactive or trigger their reawakening. Understanding these mechanisms may help develop therapies to eliminate or control dormant cells and prevent ...
Kanishka Tiwary +1 more
wiley +1 more source
The expected variation of random bounded integer sequences of finite length
International Journal of Mathematics and Mathematical Sciences, 2005 From the enumerative generating function of an abstract adjacency statistic, we deduce the mean and variance of the variation on random permutations, rearrangements, compositions, and bounded integer sequences of finite length.
Rudolfo Angeles +3 more
doaj +1 more source