Results 41 to 50 of about 29,288 (268)
Gravity‐Dependent Modulation of Downbeat Nystagmus: Insights From Velocity‐Storage Dysfunction
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Downbeat nystagmus varies with head position, a phenomenon termed gravity‐dependent modulation. We aimed to clarify its mechanism using a velocity‐storage model. Methods In 10 patients with downbeat nystagmus due to cerebellar disorders, we recorded eye movements at different pitch‐ and roll‐axis head positions.
Ji‐Hyung Park +5 more
wiley +1 more source
Multilayer Drawings of Clustered Graphs
Journal of Graph Algorithms and Applications, 2014 The cluster adjacency graph of a flat clustered graph C(G,T) is the graph A whose vertices are the clusters in T and whose edges connect clusters containing vertices that are adjacent in G.
Fabrizio Frati
doaj +1 more source
Planar lattices and planar graphs
Journal of Combinatorial Theory, Series B, 1976 AbstractIt is shown that a finite lattice is planar if and only if the (undirected) graph obtained from its (Hasse) diagram by adding an edge between its least and greatest elements is a planar graph.
openaire +2 more sources
Advanced Engineering Materials, Volume 27, Issue 6, March 2025.ErB4 and NdB4 nanostructured powders are produced by mechanochemical synthesis. 5 h mechanical alloying and 4 M HCl acid leaching are used in the production. ErB4 and NdB4 powders exhibit maximum magnetization of 0.4726 emu g−1 accompanied with an antiferromagnetic‐to‐paramagnetic phase transition at about TN = 18 K and 0.132 emu g−1 with a maximum at ...
Burçak Boztemur +5 more
wiley +1 more source
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
Journal of Graph Algorithms and Applications, 2014 A graph is called a strong (resp. weak) bar 1-visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp.
William Evans +4 more
doaj +1 more source
The Complexity of Drawing a Graph in a Polygonal Region
Journal of Graph Algorithms and Applications, 2022 We prove that the following problem is complete for the existential theory of the reals: Given a planar graph and a polygonal region, with some vertices of the graph assigned to points on the boundary of the region, place the remaining vertices to ...
Anna Lubiw +2 more
doaj +1 more source
Computing Planarity in Computable Planar Graphs
Graphs and Combinatorics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oscar Levin, Taylor McMillan
openaire +2 more sources
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
Advanced Engineering Materials, EarlyView.This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice +2 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.A numerical–experimental framework is developed for characterizing multi‐matrix fiber‐reinforced polymers (MM‐FRPs) combining epoxy and polyurethane matrices. Harmonic bending tests are integrated with finite element model updating (FEMU) to simultaneously identify elastic and viscoelastic material parameters.
Rodrigo M. Dartora +4 more
wiley +1 more source
On random planar graphs, the number of planar graphs and their triangulations
Journal of Combinatorial Theory, Series B, 2003 This paper investigates random planar graphs---the number of planar graphs and their triangulations. A random planar graph \(P_n\) is selected uniformly from \(\alpha_n\) where \(\alpha_n\) is the set of labelled planar graphs with \(\{1,2,3,\dots, n\}\) as vertex set. The following are the main results: (1) \(|\alpha_n|\leq n!(37.3)^{n+o(n)}\).
Deryk Osthus +2 more
openaire +1 more source