Results 241 to 250 of about 1,238,778 (293)
Gender difference in the authorship of top anesthesiology and pain journals: a protocol for retrospective bibliometric study. [PDF]
Front Med (Lausanne)Jiao B, Deng L, Chen M.
europepmc +1 more source
Seasonal ecological quality in China: concurrent and lagged drought responses and dominant factors. [PDF]
Front Plant SciPei W +5 more
europepmc +1 more source
Longitudinal modelling of microbiome subcommunities reveals parity-dependent dynamics during pregnancy and postpartum. [PDF]
Gut MicrobesKennedy KM +5 more
europepmc +1 more source
Maternal diet and fatty acids in human milk: results of the MELK study. [PDF]
Eur J NutrPetersohn I +4 more
europepmc +1 more source
Study on the relationship between disease progression and changes in Th17/Treg levels in patients with relapsing-remitting multiple sclerosis. [PDF]
Front NeurolYang J, Xue Q, Wang X, Song A.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proportion: Learning Proportional Reasoning Together
2012Proportional reasoning is a broadly applicable skill that is fundamental to mathematical understanding. While the cognitive development of proportional reasoning is well understood, traditional learning methods are often ineffective. They provide neither real-time feedback nor sophisticated tools to scaffold learning.
Jochen Rick +3 more
openaire +2 more sources
Random Structures & Algorithms, 1991
AbstractLet S be a finite set of graphs and t a real number, 0 < t < 1. A (deterministic) graph G is (t, 5)‐proportional if for every H ∈ S, the number of induced subgraphs of G isomorphic to H equals the expected number of induced copies of H in the random graph Gn, t where n = |V(G)|. Let Sk = {all graphs on k vertices}, in particular S3 = {K3,
Svante Janson, Jan Kratochvíl
openaire +2 more sources
AbstractLet S be a finite set of graphs and t a real number, 0 < t < 1. A (deterministic) graph G is (t, 5)‐proportional if for every H ∈ S, the number of induced subgraphs of G isomorphic to H equals the expected number of induced copies of H in the random graph Gn, t where n = |V(G)|. Let Sk = {all graphs on k vertices}, in particular S3 = {K3,
Svante Janson, Jan Kratochvíl
openaire +2 more sources
Mathematical Geosciences, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Manchuk, J. G. +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Manchuk, J. G. +2 more
openaire +2 more sources