نتایج جستجو برای: railway wheels

تعداد نتایج: 18956  

2017
Sarah Anne Galea Karen Walton Karen Charlton Anne McMahon

A letter to the editor. Meals on Wheels (MOW) is a community-based not-forprofit organisation that delivers nutritious meals to vulnerable clients in the community, to enable them to maintain their health and independence within their own home. MOW meals aim to provide at least one-third of the recommended dietary intake (RDI) for energy, fibre and calcium, and one-half of the RDI for protein, ...

Journal: :Science and Transport Progress. Bulletin of Dnipropetrovsk National University of Railway Transport 2016

Journal: :Tribology International 2021

An original multiscale friction analysis is developed to characterize the interfacial phenomena during hot forging contact conditions in manufacture of wheels for railway industry. Hot upsetting sliding tests and roll-on-disc are performed reproduce tribological at meso micro-scale. Crushed embedded oxides found be present on sample's surfaces. Stick-slip occur due accumulation crushed oxides. ...

2016
Yan Wang Neil T. Heffernan

..................................................................................................................................................... 1 Students vs. Skills: Partitioning Variance Explained in Learner Models ........................................... 2 The Opportunity Count Model: A Flexible Approach to Modeling Student Performance ............. 10 Enhancing the Efficiency and R...

Journal: :Graphs and Combinatorics 2015
Yali Wu Yongqi Sun Rui Zhang Stanislaw P. Radziszowski

Let ex(n,C4) denote the maximum size of a C4-free graph of order n. For an even integer or odd prime power q > 6, we prove that ex(q2 + q + 2, C4) < 1 2(q+1)(q 2+q+2), which leads to an improvement of the upper bounds on Ramsey numbers R(C4,Wq2+2), where Wn is a wheel of order n. By using a simple polarity graph Gq for a prime power q, we construct the graphs whose complements do not contain K1...

2015
Scott J. Moreland Scott Jared Moreland Scott Moreland

Journal: :Graphs and Combinatorics 2004
James G. Oxley Haidong Wu

An edge e of a simple 3-connected graph G is essential if neither the deletion G\e nor the contraction G/e is both simple and 3–connected. Tutte’s Wheels Theorem proves that the only simple 3–connected graphs with no non-essential edges are the wheels. In earlier work, as a corollary of a matroid result, the authors determined all simple 3-connected graphs with at most two non-essential edges. ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید