Results 131 to 140 of about 5,825,526 (293)
Super Zero Forcing in Some Graphs.
Let G=(V(G), E(G)) be a simple and undirected graph. Then I \subseteq V(G) is called a Super Zero Forcing Set of G, if I satisfies (i). I is a zero forcing set of G, and (ii).
Adzrimar Isul +3 more
core +1 more source
Deep Reinforcement Learning for Minimum Zero-Forcing Sets
This paper explores the problem of finding the minimum zero-forcing set on undirected graphs and proposes an adapted machine-learning framework to solve the problem. The minimum zero-forcing set problem is a graph coloring problem where the color of an initial set of nodes propagates throughout a network.
Halley, Steve, Gruppi, Maurício
openaire +2 more sources
Functionally graded metal–ceramic femoral stems are engineered through continuous UMAT‐based stiffness tailoring, eliminating discrete material interfaces while enhancing biomechanical compatibility. Low‐index power‐law gradation optimizes load transfer, reduces stress shielding, and controls implant–bone micromotion, highlighting a materials‐design ...
Rihem Nouira, Sameh Elleuch, Hanen Jrad
wiley +1 more source
Comparison of Libration- and Precession-Driven Flows: From Linear Responses to Broadband Dynamics
Libration and precession are different body forces that are ubiquitous in many rapidly rotating systems, particularly in geophysical and astrophysical flows.
Ke Wu, Bruno D. Welfert, Juan M. Lopez
doaj +1 more source
Multilayer Self‐Limiting Electrospray Deposition via Stepped Voltage Bias
Self‐limiting electrospray deposition (SLED) uses a high voltage to generate and deposit a charged payload on a target surface. The coating retains its charge, repelling newly arriving material. SLED thickness can be decreased by applying a secondary bias to the target.
Madhuri Deb +3 more
wiley +1 more source
The Post‐2020 Surge in Global Atmospheric Methane Observed in Ground‐Based Observations
Methane (CH4) is a potent greenhouse gas with high radiative forcing and a relatively short atmospheric lifetime of around a decade. We used a decade‐long data set (2011–2022) from the Fourier transform spectrometer at the California Laboratory for ...
Jennifer Wu +23 more
doaj +1 more source
IP Models for Minimum Zero Forcing Sets, Forts, and Related Graph Parameters
Zero forcing is a binary coloring game on a graph where a set of filled vertices can force non-filled vertices to become filled following a color change rule. In 2008, the zero forcing number of a graph was shown to be an upper bound on its maximum nullity.
Thomas R. Cameron, Jonad Pulaj
openaire +3 more sources
Residual adhesive after electrode loading in adhesive‐assisted resistance spot welding is quantified through a traceable experimental‐to‐digital workflow. Chromatic confocal topography provides calibrated surface‐height data, while OpenCV detects the electrode imprint and integrates adhesive height into comparable volume metrics.
Sung‐Min Wi, Jiangdong Zhao
wiley +1 more source
Efficient Verifiable Credential Aggregation With Blockchain Anchoring and zk-SNARKs
Traditional digital identity systems struggle with centralization, vulnerability to manipulation, and a lack of transparency. In distributed identity, different cryptographic methods are used for issuing credentials, which create challenges during ...
Istiaque Ahmed +3 more
doaj +1 more source
We apply a foundational machine‐learning interatomic potential based on the graph atomic cluster expansion (GRACE) to simulate the commercial Ni‐based single‐crystal superalloy CMSX‐4. Hybrid Monte‐Carlo/molecular dynamics sampling resolves short‐range order in the γ phase and L12 sublattice occupancies in the γ’ phase and connects them to stacking ...
Aditya Vishwakarma +4 more
wiley +1 more source

