Results 221 to 230 of about 96,047 (264)
Annals of Clinical and Translational Neurology, EarlyView.Epigenetic reprogramming in hematopoietic stem and progenitor cells (HSPCs) and downstream myeloid cells, mediated by H3.3 downregulation and endogenous retroelement (ERE) overexpression, contributes to the progression of multiple sclerosis (MS). ABSTRACT Background Skewed myelopoiesis in the bone marrow has been identified as a key driver of multiple ...
Li‐Mei Xiao +6 more
wiley +1 more source
On Shape Optimization with Large Magnetic Fields in Two Dimensions. [PDF]
J Geom AnalLotoreichik V, Morin L.
europepmc +1 more source
Context matters for the relationship between national identity and perceived democratic quality: National pride as a blind spot. [PDF]
Br J Soc PsycholHadarics M.
europepmc +1 more source
An adaptive extended radial basis function based interval analysis method for structural engineering solutions. [PDF]
PLoS OneJitang X, Jinli H, Qiang C.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Algorithms, 1997
Summary: We show lower bounds on the worst-case complexity of Shellsort. In particular, we give a fairly simple proof of an \(\Omega (n(\text{lg}^2n/(\text{lg lg } n)^2)\) lower bound for the size of Shellsort sorting networks for arbitrary increment sequences.
C. Greg Plaxton, Torsten Suel
openaire +2 more sources
Summary: We show lower bounds on the worst-case complexity of Shellsort. In particular, we give a fairly simple proof of an \(\Omega (n(\text{lg}^2n/(\text{lg lg } n)^2)\) lower bound for the size of Shellsort sorting networks for arbitrary increment sequences.
C. Greg Plaxton, Torsten Suel
openaire +2 more sources
Algebra Universalis, 2001
The authors study the hierarchy of properties that define lower bounded lattices within the class of all finite lattices. A lattice \(L\) is lower bounded if any homomorphism \(h\) from a finitely generated lattice \(K\) into \(L\) is lower bounded, i.e.\ if \(\{ x\in K\); \(a\leq h(x) \}\) is either empty or has a least element whenever \(a\in h(K)\).
Adaricheva, K. V., Gorbunov, V. A.
openaire +1 more source
The authors study the hierarchy of properties that define lower bounded lattices within the class of all finite lattices. A lattice \(L\) is lower bounded if any homomorphism \(h\) from a finitely generated lattice \(K\) into \(L\) is lower bounded, i.e.\ if \(\{ x\in K\); \(a\leq h(x) \}\) is either empty or has a least element whenever \(a\in h(K)\).
Adaricheva, K. V., Gorbunov, V. A.
openaire +1 more source