Results 91 to 100 of about 2,710,086 (272)
Spectral Matching through Data Compression [PDF]
, 2011 This paper proposes to use compression-based similarity measures to cluster spectral signatures on the basis of their similarities. Such universal distances estimate the shared information between two objects by comparing their compression factors ...
Avbelj, Janja +4 more
core
Advanced Functional Materials, EarlyView.A systematic review is conducted to assess the influence of electrode architecture across micro‐ to mesoscopic length scales on electron‐transfer pathways in electrocatalysis. We discuss the structure‐activity relationships in electrocatalytic applications, including resource recovery and environmental remediation, and provide cost‐effective, efficient
Manshu Zhao +6 more
wiley +1 more source
Distance signless Laplacian eigenvalues, diameter, and clique number [PDF]
Discrete Mathematics Letters, 2022 Saleem Khan, Shariefuddin Pirzada
doaj +1 more source
Advanced Functional Materials, EarlyView.A new class of sulfur‐free, oxygen‐bridged dibenzofuran‐based polymers is developed for ultrahigh‐refractive‐index applications. The rigid π‐extended architecture and enhanced molecular polarizability enable exceptional optical performance, combining refractive indices up to 1.848 with high Abbe numbers and full visible transparency. This work offers a
Hend A. Hegazy +5 more
wiley +1 more source
Coordinated Architectural and Chemical Reinforcement in the Crushing Mandible of a Soldier Termite
Advanced Functional Materials, EarlyView.The crushing mandible of a soldier termite withstands substantial biting loads despite lacking mineral. Its cuticle is partitioned: convex teeth pair hardness and zinc enrichment with aligned chitin fibers for contact durability, while stiffer concave regions between teeth carry bending loads.
Andrew Tran Nguyen +16 more
wiley +1 more source
The distance Seidel matrix of connected graphs
AKCE International Journal of Graphs and CombinatoricsFor a connected graph G, we present the concept of a new graph matrix related to its distance and Seidel matrix, called distance Seidel matrix [Formula: see text]. Suppose that the eigenvalues of [Formula: see text] be [Formula: see text] In this article,
T. Haritha, A. V. Chithra
doaj +1 more source
Advanced Functional Materials, EarlyView.We present a scalable EC/TC hybrid smart window using a DCPE that enables tunable solar modulation (ΔTsol:15–43%), fast electrochromic switching (<90 s), and strong thermal blocking (10–14°C reduction). HPMC improves thermal stability, while an optimized ISL enhances EC performance.
Soyeon Kim +4 more
wiley +1 more source
The distance spectral radius of graphs with given number of odd vertices [PDF]
, 2016 The graphs with smallest, respectively largest, distance spectral radius among the connected graphs, respectively trees with a given number of odd vertices, are determined. Also, the graphs with the largest distance spectral radius among the trees with a
Zhou, Bo, Lin, Hongying
core +1 more source
Advanced Functional Materials, EarlyView.Aberrant glycosylation in the glioblastoma tumor microenvironment drives therapeutic resistance. Here, a 3D bioprinted model was engineered by incorporating α‐NeuNAc‐(2→3)‐β‐D‐Gal‐ and chondroitin sulfate. Combined multiplex immunofluorescence and synchrotron‐based nanoCT analysis revealed that glycan‐matrix interactions dictate specific drug‐escape ...
Francesca Cadamuro +25 more
wiley +1 more source
Connectivity, diameter, independence number and the distance spectral radius of graphs
, 2017 © 2017 Elsevier Inc. The distance spectral radius of a graph is the largest eigenvalue of its distance matrix. X.L. Zhang (2012) [31] determined the n-vertex graphs of given diameter with the minimum distance spectral radius. In this paper, we generalize
Zhang M., Gutman, Ivan, Li A.
core +1 more source