Results 121 to 130 of about 49,235 (305)
Physics‐Embedded Neural Network: A Novel Approach to Design Polymeric Materials
Advanced Science, EarlyView.Traditional black‐box models for polymer mechanics rely solely on data and lack physical interpretability. This work presents a physics‐embedded neural network (PENN) that integrates constitutive equations into machine learning. The approach ensures reliable stress predictions, provides interpretable parameters, and enables performance‐driven, inverse ...
Siqi Zhan +8 more
wiley +1 more source
Realizing efficient outcomes in cost spanning problems [PDF]
We propose a simple non-cooperative mechanism of network formation in cost spanning tree problems. The only subgame equilibrium payoff is efficient. Moreover, we extend the result to the case of budget restrictions.
Gustavo Bergantiños, Juan Vidal-Puga
core
Advanced Science, EarlyView.Whole‐genome analysis of 1,054 chickens reveals three ancestral sources (NWC, SYA, and SHF) with distinct temporal entry patterns into the Tibetan Plateau. Route‐specific selection scans, calibrated against a demographic null, suggest complementary functional enrichments—vascular homeostasis (NWC), calcium signaling and cardiac adaptation (SYA), and ...
Zongyi Zhao +7 more
wiley +1 more source
Counting spanning trees in graphs [PDF]
, 2012 The history of counting the number of spanning trees dates back into the year 1842 in which the German mathematician Gustav Kirchhoff derived a relation between the number of spanning trees of a graph G (τ(G)) and the determinant of a specific submatrix
Azarija, Jernej, Anema, Jason
core
Completely Independent Spanning Trees in Line Graphs
, 2022 Completely independent spanning trees in a graph $G$ are spanning trees of $G$ such that for any two distinct vertices of $G$, the paths between them in the spanning trees are pairwise edge-disjoint and internally vertex-disjoint.
Hasunuma, Toru
core
UHD Journal of Science and TechnologyThis paper examines the concepts and practical applications of the spanning tree protocol (STP). It also covers per-VLAN spanning tree (PVST), multiple spanning tree (MST), and rapid STP (RSTP). Moreover, practical scenarios are presented to help the reader understand the concepts and implementations of these protocols.
Dana Faiq Abd +3 more
openaire +2 more sources
Personalized Network‐Guided Neuromodulation Enhances Human Working Memory
Advanced Science, EarlyView.A personalized neuromodulation framework combining individualized functional brain network targeting with real‐time neural decoding is introduced. Using concurrent TMS–fMRI, participant‐specific stimulation targets and optimal frequencies are identified. Only optimal‐frequency stimulation improves working memory across sessions.
Ahsan Khan +13 more
wiley +1 more source
Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation [PDF]
This paper presents a robust branch-cut-and-price algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to q-arbs, a structure that arises from a relaxation of the capacitated prize-collecting arbores- cence ...
Pessoa, Artur +5 more
core
Leafy spanning trees in hypercubes
, 2001 We prove that the d-dimensional hypercube, Qd, with n = 2d vertices, contains a spanning tree with at least leaves. This improves upon the bound implied by a more general result on spanning trees in graphs with minimum degree δ, which gives (1 − O(log ...
Dunne, P E +7 more
core +1 more source
ML Workflows for Screening Degradation‐Relevant Properties of Forever Chemicals
Advanced Science, EarlyView.The environmental persistence of per‐ and polyfluoroalkyl substances (PFAS) necessitates efficient remediation strategies. This study presents physics‐informed machine learning workflows that accurately predict critical degradation properties, including bond dissociation energies and polarizability.
Pranoy Ray +3 more
wiley +1 more source