Results 91 to 100 of about 29,853 (260)
Advanced Healthcare Materials, EarlyView.Gonzalez Martinez and collaborators develop a strategy to formulate high performance GelMA‐based bioinks with low solids contents. The resulting bioinks enable 3D bioprinting at 37 °C of high‐fidelity structures with tunable mechanical properties that support high cell viability and function.
David A. González‐Martínez +8 more
wiley +1 more source
Cancer ImagingObjectives This study aimed to investigate the intra- and inter-observer consistency of the Visually Accessible Rembrandt Images (VASARI) feature set before and after dichotomization, and the association between dichotomous VASARI features and the ...
Yu Han +6 more
doaj +1 more source
Advanced Materials, EarlyView.AI‐Assisted Workflow for (Scanning) Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling. Abstract (Scanning) transmission electron microscopy ((S)TEM) has significantly advanced materials science but faces challenges in correlating precise atomic structure information with the functional properties of ...
Marc Botifoll +19 more
wiley +1 more source
Advanced Materials, EarlyView.Transition metal oxy/carbo‐nitrides show great promise as catalysts for sustainable processes. A Mn‐Mo mixed‐metal oxynitride attains remarkable performance for the direct synthesis of acetonitrile, an important commodity chemical, via sequential C─N and C─C coupling from syngas (C1) and ammonia (N1) feedstocks.
M. Elena Martínez‐Monje +7 more
wiley +1 more source
Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching
We design efficient deterministic algorithms for finding short edge-disjoint paths in expanders. Specifically, given an $n$-vertex $m$-edge expander $G$ of conductance $ϕ$ and minimum degree $δ$, and a set of pairs $\{(s_i,t_i)\}_i$ such that each vertex appears in at most $k$ pairs, our algorithm deterministically computes a set of edge-disjoint paths
Matija Bucic +3 more
openaire +2 more sources
Advanced Materials, EarlyView.Metal‐free carbon catalysts enable the sustainable synthesis of hydrogen peroxide via two‐electron oxygen reduction; however, active site complexity continues to hinder reliable interpretation. This review critiques correlation‐based approaches and highlights the importance of orthogonal experimental designs, standardized catalyst passports ...
Dayu Zhu +3 more
wiley +1 more source
Perfect matchings in uniform hypergraphs with large minimum degree
, 2006 A perfect matching in a k-uniform hypergraph on n vertices, n divisible by k, is a set of n/k disjoint edges. In this paper we give a sufficient condition for the existence of a perfect matching in terms of a variant of the minimum degree.
Rödl, Vojtech +2 more
core +1 more source
Independence and matching number for some token graphs [PDF]
, 2020 Let G be a graph of order n and let k ∈ {1, . . . , n−1}. The k-token graph Fk(G) of G is the graph whose vertices are the k-subsets of V (G), where two vertices are adjacent in Fk(G) whenever their symmetric difference is an edge of G.
de Alba, Hernán +3 more
core
Spin and Charge Control of Topological End States in Chiral Graphene Nanoribbons on a 2D Ferromagnet
Advanced Materials, EarlyView.Chiral graphene nanoribbons on a ferromagnetic gadolinium‐gold surface alloy display tunable spin and charge states at their termini. Atomic work function variations and exchange fields enabe transitions between singlet, doublet, and triplet configurations.
Leonard Edens +8 more
wiley +1 more source
Resolving the Structural Duality of Graphene Grain Boundaries
Advanced Materials, EarlyView.Cantilever ncAFM resolves the atomic structure of grain boundaries in graphene, revealing coexisting stable and metastable types. Both contain pentagon/heptagon defects, but metastable GBs show irregular geometries. Modeling shows metastable GBs form under compression, exhibiting vertical corrugation, while stable GBs are flat.
Haojie Guo +11 more
wiley +1 more source