Results 61 to 70 of about 151,154 (334)

Recent Advancements in Bulk Processing of Rare‐Earth‐Free Hard Magnetic Materials and Related Multiscale Simulations

open access: yesAdvanced Engineering Materials, EarlyView.
This article provides an overview of recent advancements in bulk processing of rare‐earth‐free hard magnetic materials. It also addresses related simulation approaches at different scales. The research on rare‐earth‐free magnetic materials has increased significantly in recent years, driven by supply chain issues, environmental and social concerns, and
Daniel Scheiber, Andrea Bachmaier
wiley   +1 more source

On the Complexity of Planar Covering of Small Graphs

open access: yes, 2011
The problem Cover(H) asks whether an input graph G covers a fixed graph H (i.e., whether there exists a homomorphism G to H which locally preserves the structure of the graphs). Complexity of this problem has been intensively studied.
Bílka, Ondřej   +4 more
core   +1 more source

Challenges during Flash Lamp Annealing of Aerosol‐Deposited Barium Titanate Films

open access: yesAdvanced Engineering Materials, EarlyView.
Aerosol deposition is used to rapidly deposit barium titanate films with thicknesses ranging from 2 to 16 μm at room temperature, eliminating the need for further densification. However, to recover the electromechanical properties, annealing is required, which limits the usage of temperature‐sensitive substrates.
Michel Kuhfuß   +7 more
wiley   +1 more source

About Structure of Graph Obstructions for Klein Surface with 9 Vertices

open access: yesКібернетика та комп'ютерні технології, 2020
The structure of the 9 vertex obstructive graphs for the nonorientable surface of the genus 2 is established by the method of (-transformations of the graphs.
V.I. Petrenjuk, D.A. Petrenjuk
doaj   +1 more source

Statistics of Feynman amplitudes in ϕ 4-theory

open access: yesJournal of High Energy Physics, 2023
The amplitude of subdivergence-free logarithmically divergent Feynman graphs in ϕ 4-theory in 4 spacetime dimensions is given by a single number, the Feynman period. We numerically compute the periods of 1.3 million completed graphs, this represents more
Paul-Hermann Balduf
doaj   +1 more source

On the Total Number of Bends for Planar Octilinear Drawings

open access: yes, 2015
An octilinear drawing of a planar graph is one in which each edge is drawn as a sequence of horizontal, vertical and diagonal at 45 degrees line-segments. For such drawings to be readable, special care is needed in order to keep the number of bends small.
Bekos, Michael A.   +2 more
core   +1 more source

A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions

open access: yesAdvanced 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

On the Synthesis of Planar Graphs with Given Properties

open access: yesКібернетика та комп'ютерні технології
The problem of studying the structural properties of planar subgraphs G\v, where v is an arbitrary vertex of a graph G of undirected genus, is considered, using cell chains that connect limit cycles with points of a given set M of the graph G\v.
Volodymyr Petrenjuk, Dmytro Petreniuk
doaj   +1 more source

Microstructural Evolution and Mechanical Performance of Plasma‐Assisted Hybrid Friction Stir Welded Dissimilar Aluminum–Copper Joints

open access: yesAdvanced Engineering Materials, EarlyView.
Plasma‐assisted hybrid friction stir welding of dissimilar AlCu joints employs localized plasma preheating to balance heat input and enhance plastic flow. The optimized process reduces axial force by up to 35%, refines the microstructure, and achieves ≈96% joint efficiency.
Deepak Kumar Yaduwanshi   +3 more
wiley   +1 more source

Recognizing and Drawing IC-planar Graphs

open access: yes, 2015
IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs.
C Auer   +27 more
core   +1 more source

Home - About - Disclaimer - Privacy