Results 81 to 90 of about 94,026 (313)
Surface‐host dialogue at the implant interface governs biological fate and osseointegration. Surface physicochemical properties of titanium (Ti) dental implants, including microgrooves, nanopatterns, nanotopography, roughness, and wettability, modulate the initial adsorption of proteins and the formation of a dynamic biointerface.
Daniela Moreira Cunha +9 more
wiley +1 more source
Bioinspired Adaptive Sensors: A Review on Current Developments in Theory and Application
This review comprehensively summarizes the recent progress in the design and fabrication of sensory‐adaptation‐inspired devices and highlights their valuable applications in electronic skin, wearable electronics, and machine vision. The existing challenges and future directions are addressed in aspects such as device performance optimization ...
Guodong Gong +12 more
wiley +1 more source
Additivity in cost spanning tree problems [PDF]
We characterize a rule in cost spanning tree problems using an additivity property and some basic properties. If the set of possible agents has at least three agents, these basic properties are symmetry and separability. If the set of possible agents has
Gustavo Bergantiños, Juan Vidal-Puga
core
On the SPANNING k-TREE problem
A \(k\)-tree \(T\) is defined recursively as being either a clique of size \(k\) or having a vertex \(x\) whose neighbourhood is a clique of size \(k\) and such that \(T-x\) is a \(k\)-tree. (Note that \(k\)-trees are not trees, if \(k>1\).) The following SPANNING \(k\)-TREE problem is known to be NP-complete: given a graph \(G\), does \(G\) possess a ...
Leizhen Cai, Frédéric Maffray
openaire +2 more sources
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
A fair rule in minimum cost spanning tree problems [PDF]
We study minimum cost spanning tree problems and define a cost sharing rule that satisfies many more properties than other rules in the literature.
Gustavo Bergantiños, Juan Vidal-Puga
core
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem [PDF]
Spanning tree congestion is a relatively new graph parameter, whichhas been studied intensively. This paper studies the complexity of the problemto determine the spanning tree congestion for non-sparse graph classes, while itwas investigated for some ...
Yota Otachi +7 more
core +1 more source
The Budgeted Labeled Minimum Spanning Tree Problem
In order to reduce complexity when designing multi-media communication networks, researchers often consider spanning tree problems defined on edge-labeled graphs.
Raffaele Cerulli +3 more
doaj +1 more source
The Strong Vertex Span of Trees
Abstract The strong vertex (edge) span of a given graph G is the maximum distance that two players can maintain at all times while visiting all vertices (edges) of G and moving either to an adjacent vertex or staying in the current ...
Mateja Grašič +2 more
openaire +3 more sources
2D α‐Co(OH)2 interleaved with Mo species displays an appealing dual functionality for the production and use of green hydrogen.Mo incorporation greatly benefits the electrochemical behaviour in Oxygen Evolution Reaction for H2 production, while the magnetocaloric response at liquid H2 temperature paves the way for alternative cryogenic refrigerants ...
Daniel Muñoz‐Gil +14 more
wiley +1 more source

