Results 61 to 70 of about 11,781 (210)

High-Conductivity Electrolytes Screened Using Fragment- and Composition-Aware Deep Learning. [PDF]

Adv Sci (Weinh)
We present a new deep learning framework that hierarchically links molecular and functional unit attributions to predict electrolyte conductivity. By integrating molecular composition, ratios, and physicochemical descriptors, it achieves accurate, interpretable predictions and large‐scale virtual screening, offering chemically meaningful insights for ...
Wang X, Chen M, Bao G, Lai Y, Cao J, Liu X, Tan R.   +6 more
europepmc   +2 more sources

A goodness‐of‐fit test for regression models with discrete outcomes

Canadian Journal of Statistics, EarlyView.
Abstract Regression models are often used to analyze discrete outcomes, but classical goodness‐of‐fit tests such as those based on the deviance or Pearson's statistic can be misleading or have little power in this context. To address this issue, we propose a new test, inspired by the work of Czado et al.
Lu Yang, Christian Genest, Johanna G. Nešlehová   +2 more
wiley   +1 more source

Relation semantic fusion in subgraph for inductive link prediction in knowledge graphs [PDF]

PeerJ Computer Science
Inductive link prediction (ILP) in knowledge graphs (KGs) aims to predict missing links between entities that were not seen during the training phase. Recent some subgraph-based methods have shown some advancements, but they all overlook the relational ...
Hongbo Liu, Jicang Lu, Tianzhi Zhang, Xuemei Hou, Peng An   +4 more
doaj   +2 more sources

The Largest Subgraph Without A Forbidden Induced Subgraph

Combinatorica
20 ...
Fox, Jacob, Nenadov, Rajko, Pham, Huy Tuan   +2 more
openaire   +2 more sources

Functionally complementary bacterial inoculant coordinates arbuscular mycorrhizal fungi to improve Angelica sinensis root yield and quality

iMetaOmics, EarlyView.
Comprehensive understanding of how diverse PGPR strains enhance the rhizosphere microenvironment remains a considerable challenge. Here, we provide experimental evidence that a functionally synergistic composite microbial formulation can markedly enhance growth performance and improve the quality attributes in Angelica sinensis.
Zongyu Zhang, Yun Wang, Jiecai Zhao, Gaofeng Chen, Andéole Niyongabo Turatsinze, Liang Yue, Yuan Tian, Xiaofan Xie, Ailing Ye, Meilan Zhang, Lingling Wu, Zengxiang Guo, Yubao Zhang, Ruoyu Wang   +13 more
wiley   +1 more source

Properly Colored Cycles in Edge‐Colored Balanced Bipartite Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT Let G n , n c ${G}_{n,n}^{c}$ denote a (not necessarily properly) edge‐colored balanced bipartite graph on 2 n $2n$ vertices, that is, in which every edge is assigned a color. A cycle C $C$ in G n , n c ${G}_{n,n}^{c}$ is called properly colored if any two consecutive edges of C $C$ have distinct colors. A properly colored cycle‐factor of G n ,
Tingting Han, Hajo Broersma, Shenggui Zhang, Yandong Bai   +3 more
wiley   +1 more source

Domination in 4‐Regular Graphs With No Induced 4‐Cycles

Journal of Graph Theory, EarlyView.
ABSTRACT A set S $S$ of vertices in a graph G $G$ is a dominating set of G $G$ if every vertex not in S $S$ is adjacent to a vertex in S $S$. The domination number of G $G$, denoted by γ ( G ) $\gamma (G)$, is the minimum cardinality of a dominating set in G $G$.
Michael A. Henning, Anders Yeo
wiley   +1 more source

The Index-based Subgraph Matching Algorithm with General Symmetries (ISMAGS): exploiting symmetry for faster subgraph enumeration. [PDF]

PLoS ONE, 2014
Subgraph matching algorithms are used to find and enumerate specific interconnection structures in networks. By enumerating these specific structures/subgraphs, the fundamental properties of the network can be derived.
Maarten Houbraken, Sofie Demeyer, Tom Michoel, Pieter Audenaert, Didier Colle, Mario Pickavet   +5 more
doaj   +1 more source

Another Proof of the Generalized Tutte—Berge Formula for f $f$‐Bounded Subgraphs

Journal of Graph Theory, EarlyView.
ABSTRACT Given a nonnegative integer weight f ( v ) $f(v)$ for each vertex v $v$ in a multigraph G $G$, an f $f$‐bounded subgraph of G $G$ is a multigraph H $H$ contained in G $G$ such that d H ( v ) ≤ f ( v ) ${d}_{H}(v)\le f(v)$ for all v ∈ V ( G ) $v\in V(G)$.
Zishen Qu, Douglas B. West
wiley   +1 more source

The Independence Ratio of 4‐Cycle‐Free Planar Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT We prove that every n $n$‐vertex planar graph G $G$ with no triangle sharing an edge with a 4‐cycle has independence ratio n ∕ α ( G ) ≤ 4 − ε $n\unicode{x02215}\alpha (G)\le 4-\varepsilon $ for ε = 1 ∕ 30 $\varepsilon =1\unicode{x02215}30$. This result implies that the same bound holds for 4‐cycle‐free planar graphs and planar graphs with no ...
Tom Kelly, Sid Kolichala, Caleb McFarland, Jatong Su   +3 more
wiley   +1 more source