Results 61 to 70 of about 27,017 (285)

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

Prime labelings on planar grid graphs

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

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

Fast simulation of planar Clifford circuits [PDF]

open access: yesQuantum
A 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

Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2020
Two distinct crossings are independent if the end-vertices of the crossed pair of edges are mutually different. If a graph G has a drawing in the plane such that every two crossings are independent, then we call G a plane graph with independent crossings
Song Wen-Yao   +2 more
doaj   +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

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

1-Planar lexicographic products of graphs

open access: hybridApplied Mathematical Sciences, 2015
Józef Bućko, Július Czap
openalex   +2 more sources

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

Regularity and Planarity of Token Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2017
Let G = (V, E) be a graph of order n and let 1 ≤ k < n be an integer. The k-token graph of G is the graph whose vertices are all the k-subsets of V, two of which are adjacent whenever their symmetric difference is a pair of adjacent vertices in G.
Carballosa Walter   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy