Results 81 to 90 of about 1,603,518 (234)
First-return maps of Birkhoff sections of the geodesic flow
, 2020 This paper compares different pseudo-Anosov maps coming from different Birkhoff sections of a given flow. More precisely, given a hyperbolic surface and a collection of periodic geodesics on it, we study those Birkhoff sections for the geodesic flow on ...
Marty, Théo
core
A note on forbidding clique immersions [PDF]
, 2012 Robertson and Seymour proved that the relation of graph immersion is well-quasi-ordered for finite graphs. Their proof uses the results of graph minors theory.
DeVos, Matt +3 more
core
Quarterly Journal of the Royal Meteorological Society, EarlyView.The predictability of western and eastern North Pacific blocking events is assessed using analogue‐based diagnostics. Eastern blocks exhibit lower predictability, characterized by faster error growth and higher mean logarithmic divergence rates. The study highlights geographical contrasts in blocking stability.
Anupama K. Xavier +3 more
wiley +1 more source
Cavitation and erosion effects on hydraulic performances of a submersible drainage pump
Alexandria Engineering JournalHydraulic performance and operational stability of submersible drainage pumps can be affected by cavitation and erosion when used for draining water from buildings.
Md Rakibuzzaman +5 more
doaj +1 more source
Numerical Analysis of Erosion Caused by Biomimetic Axial Fan Blade
Advances in Materials Science and Engineering, 2013 Damage caused by erosion has been reported in several industries for a wide range of situations. In the present work, a new method is presented to improve the erosion resistance of machine components by biomimetic method.
Jun-Qiu Zhang +5 more
doaj +1 more source
Decomposing 8-regular graphs into paths of length 4
, 2016 A $T$-decomposition of a graph $G$ is a set of edge-disjoint copies of $T$ in $G$ that cover the edge set of $G$. Graham and H\"aggkvist (1989) conjectured that any $2\ell$-regular graph $G$ admits a $T$-decomposition if $T$ is a tree with $\ell$ edges ...
Botler, Fábio, Talon, Alexandre
core +1 more source
steel research international, EarlyView.Uncertainties exist in computational fluid dynamics (CFD) modeling of complex metallurgical processes, even when partly validated by laboratory experiments. rCFD enables computationally efficient prediction of long‐term RH degassing and can be adapted to vary flow conditions.
Xiaomeng Zhang +3 more
wiley +1 more source
On disjoint paths in acyclic planar graphs [PDF]
, 2010 We give an algorithm with complexity $O(f(R)^{k^2} k^3 n)$ for the integer multiflow problem on instances $(G,H,r,c)$ with $G$ an acyclic planar digraph and $r+c$ Eulerian.
Naves, Guyslain
core
On the digraph of a unitary matrix
, 2003 Given a matrix M of size n, a digraph D on n vertices is said to be the digraph of M, when M_{ij} is different from 0 if and only if (v_{i},v_{j}) is an arc of D.
Grössing Gerhard +5 more
core +2 more sources
Trial‐Based Hemolysis Modeling to Investigate Operating Modes of Continuous‐Flow LVADs
Artificial Organs, EarlyView.This work presents a methodology for determining online‐capable hemolysis models for continuous‐flow LVADs, derived from in vitro trials. The models are based on fitting a modified power law and applying the Lagrangian approach. They assist clinicians in selecting treatment strategies that minimize hemolysis, as demonstrated with the Sputnik1 LVAD ...
Patrick Borchers +2 more
wiley +1 more source