Results 101 to 110 of about 55,995 (279)

Polymorph‐Specific Electronic Transduction in WO3 during Molecular Sensing

Advanced Materials, EarlyView.
Metal‐oxide polymorphs with similar surface chemistry can nevertheless exhibit distinct sensing properties. In γ‐ and ε‐WO3, analyte adsorption appears comparable; yet, only ε‐WO3 induces a pronounced lattice electronic perturbation that accommodates charge in sub‐conduction band minimum states.
Matteo D'Andria, Meng Yin, Stefan Neuhauser, Vlasis G. Mavrantzas, Ying Chen, Ken Suzuki, Andreas T. Güntner   +6 more
wiley   +1 more source

Hydrogel‐Based Airway‐on‐Tube With Perfusable Endothelial Lumen and Outward Epithelialization

Advanced Materials, EarlyView.
A hydrogel‐based airway‐on‐tube platform featuring a perfusable endothelial lumen and outward epithelialization is presented. The system supports primary human bronchial epithelial and lung microvascular endothelial coculture under air‐liquid interface conditions.
Ali Doryab, Jack F. Murphy, Michael Bartolf‐Kopp, Jenny C‐C Hsin, Alice Chernaik, Frank McCaughan, Yan Yan Shery Huang, Tomasz Jungst, Jürgen Groll   +8 more
wiley   +1 more source

Representing Graphs as Bag of Vertices and Partitions for Graph Classification

Data Science and Engineering, 2018
Graph classification is a difficult task because finding a good feature representation for graphs is challenging. Existing methods use topological metrics or local subgraphs as features, but the time complexity for finding discriminatory subgraphs or ...
Mansurul Bhuiyan, Mohammad Al Hasan
doaj   +1 more source

A note on vertex partitions

, 2011
We prove a general lemma about partitioning the vertex set of a graph into subgraphs of bounded degree. This lemma extends a sequence of results of Lov sz, Catlin, Kostochka and Rabern.
openaire   +2 more sources

2K2 vertex-set partition into nonempty parts

Electronic Notes in Discrete Mathematics, 2008
Abstract A graph is 2K2-partitionable if its vertex set can be partitioned into four nonempty parts A, B, C, D such that each vertex of A is adjacent to each vertex of B, and each vertex of C is adjacent to each vertex of D. Determining whether an arbitrary graph is 2K2-partitionable is the only vertex-set partition problem into four nonempty parts ...
Simone Dantas, Elaine M. Eschen, Luerbio Faria, Celina M.H. de Figueiredo, Sulamita Klein   +4 more
openaire   +1 more source

Intrinsic Coordination Architecture Governing Selectivity Divergence Between Extended and Single‐Site Electrocatalysts

Advanced Materials, EarlyView.
Catalyst coordination acts as a loaded dice biasing reaction selectivity. Single‐atom site catalysts lock intermediates in exposed configurations, enabling continued hydrogenation and favoring oxygen‐retaining products. In contrast, extended metal surfaces fully coordinate and shield reactive centers, promoting deoxygenation pathways. This work reveals
Chengyi Zhang, Ziyun Wang
wiley   +1 more source

Granular computing in zero-divisor graphs of Zn

Kuwait Journal of Science
In this article, we study the zero-divisor graphs Γ(Zn) of rings of integers modulo n as information systems I(Γ(Zn)) using equivalence classes and rough sets.
Arshad H., Javaid I., Fahad A.
doaj   +1 more source

Molecular Inks for the Development of Complex 3D In‐Mold Electronics

Advanced Materials Technologies, EarlyView.
Molecular inks (MINKs) enable the fabrication of thermoformed 3D circuits by decoupling the forming and metallization steps. Following thermoforming, intense pulsed‑light or thermal processing converts the patterned MINKs into complex 3D conductive tracks with improved stretchability and electrical performance, advancing low‑cost, high‑performance in ...
Mehal P. Kushalkar, Hiroshi Fukutani, Olga Mozenson, Jianying Ouyang, Liliana Gaburici, Bhavana Deore, Dayna Bennett, Chantal Paquet, Paul Trudeau, Loleï Khoun, Nicolas Milliken, Olivier Ferrand, Julie Ferrigno, Xiangyang Liu, Arnold J. Kell   +14 more
wiley   +1 more source

HitSim: An Efficient Algorithm for Single-Source and Top-k SimRank Computation

Information
SimRank is a widely used metric for evaluating vertex similarity based on graph topology, with diverse applications such as large-scale graph mining and natural language processing. The objective of the single-source and top-k SimRank query problem is to
Jing Bai, Junfeng Zhou, Shuotong Chen, Ming Du, Ziyang Chen, Mengtao Min   +5 more
doaj   +1 more source

Distribution of crossings, nestings and alignments of two edges in matchings and partitions

, 2006
We construct an involution on set partitions which keeps track of the numbers of crossings, nestings and alignments of two edges. We derive then the symmetric distribution of the numbers of crossings and nestings in partitions, which generalizes Klazar'
Kasraoui, Anisse, Zeng, Jiang
core   +1 more source