Results 61 to 70 of about 28,550 (268)
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
Fast simulation of planar Clifford circuits [PDF]
QuantumA general quantum circuit can be simulated classically in exponential time. If it has a planar layout, then a tensor-network contraction algorithm due to Markov and Shi has a runtime exponential in the square root of its size, or more generally ...
David Gosset +3 more
doaj +1 more source
Prime labelings on planar grid graphs
Theory and Applications of Graphs, 2022 It is known that for any prime p and any integer n such that 1≤n≤p there exists a prime labeling on the pxn planar grid graph PpxPn.
Stephen James Curran
doaj +1 more source
The Book Thickness of 1-Planar Graphs is Constant [PDF]
Algorithmica, 2016 In a book embedding, the vertices of a graph are placed on the spine of a book and the edges are assigned to pages, so that edges on the same page do not cross. In this paper, we prove that every $1$-planar graph (that is, a graph that can be drawn on the plane such that no edge is crossed more than once) admits an embedding in a book with constant ...
Michael A. Bekos +3 more
openaire +3 more sources
Towards Defect Phase Diagrams: From Research Data Management to Automated Workflows
Advanced Engineering Materials, EarlyView.A research data management infrastructure is presented for the systematic integration of heterogeneous experimental and simulation data required for defect phase diagrams. The approach combines openBIS with a companion application for large‐object storage, automated metadata extraction, provenance tracking and federated data access, thereby supporting ...
Khalil Rejiba +5 more
wiley +1 more source
Equitable coloring in 1-planar graphs
Discrete Mathematics9 ...
Daniel W. Cranston, Reem Mahmoud
openaire +2 more sources
On properties of maximal 1-planar graphs
Discussiones Mathematicae Graph Theory, 2012 Department of Mathematics, Faculty of ScienceNiigata University8050, Ikarashi 2-no-cho, Nishi-ku, Niigata, 950-2181, Japane-mail: y-suzuki@math.sc.niigata-u.ac.jpAbstractA graph is called 1-planar if there exists a drawing in the plane so thateach edge contains at most one crossing.
Dávid Hudák +2 more
openaire +1 more source
Tailoring Functional Properties of Ti–Ni–Cu Shape Memory Alloy Thin Films for MEMS Actuators
Advanced Engineering Materials, EarlyView.A comprehensive study of critical parameters required to develop well‐performing Ti–Ni–Cu thin film shape memory alloy microactuators is provided. Materials science and device integration aspects are integrated by addressing structural and physical relationships using complementary characterization techniques as well as a practical fabrication solution
Elaheh Akbarnejad +6 more
wiley +1 more source
Improvements on the density of maximal 1‐planar graphs [PDF]
Journal of Graph Theory, 2017 AbstractA graph is 1‐planar if it can be drawn in the plane such that each edge is crossed at most once. A graph, together with a 1‐planar drawing is called 1‐plane. A graph is maximal 1‐planar (1‐plane), if we cannot add any missing edge so that the resulting graph is still 1‐planar (1‐plane). Brandenburg et al.
János Barát, Géza Tóth 0001
openaire +4 more sources