Results 41 to 50 of about 10,447 (245)

Data‐Driven Materials Science for Energy‐Sustainable Applications

Advanced Materials, EarlyView.
Data‐driven approaches powered by artificial intelligence are transforming materials discovery for energy sustainability. This review examines how auto‐generated high‐quality materials databases and domain‐specific language models accelerate research in photovoltaics, thermoelectrics, batteries and magnetic materials. Applications involve extraction of
Jacqueline M. Cole
wiley   +1 more source

Minimum k-critical-bipartite graphs: the irregular case [PDF]

Opuscula Mathematica
We study the problem of finding a minimum \(k\)-critical-bipartite graph of order \((n,m)\): a bipartite graph \(G=(U,V;E)\), with \(|U|=n\), \(|V|=m\), and \(n\gt m\gt 1\), which is \(k\)-critical-bipartite, and the tuple \((|E|, \Delta_U, \Delta_V ...
Sylwia Cichacz, Agnieszka Görlich, Karol Suchan   +2 more
doaj   +1 more source

A Phase‐Resolved Geometric Deep Learning Framework Maps Structural Determinants of Disease‐Associated Protein Aggregation and Guides Suppressor Design

Advanced Science, EarlyView.
SKALE 2.0 maps disease‐associated protein aggregation as a phase‐resolved structural process, linking mutation‐induced geometric perturbations to nucleation, elongation, and suppressor design. Across neurodegenerative proteins, the framework reveals cryptic aggregation vulnerabilities, separates phase‐concordant and phase‐switching mutations, and ...
Jia Shen Sio, Wei Xuan Wilson Loo, Yan Shan Loo, Wen Xin Tan, Hui Xuan Lim, Huitao Liu, Chen Seng Ng   +6 more
wiley   +1 more source

Antifactors of regular bipartite graphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2020
Let $G=(X,Y;E)$ be a bipartite graph, where $X$ and $Y$ are color classes and $E$ is the set of edges of $G$. Lov\'asz and Plummer \cite{LoPl86} asked whether one can decide in polynomial time that a given bipartite graph $G=(X,Y; E)$ admits a 1-anti ...
Hongliang Lu, Wei Wang, Juan Yan
doaj   +1 more source

Computationally Evidence‐Grounded Sequence‐First Design of Peptide Binders

Advanced Science, EarlyView.
BOND‐PEP enables controllable, sequence‐first peptide binder design by grounding generation in binding evidence retrieved for each target. It uses topology‐conditioned message passing to integrate relevant peptide examples with the target protein sequence, forming a residue‐level representation that guides the generation of diverse, target‐specific ...
Wenze Ding
wiley   +1 more source

Packing bipartite graphs

Discrete Mathematics, 1997
Consider two bipartite graphs \(G=\{L,R,E\}\) and \(G'=\{L',R',E'\}\). A bijection \(f:L\cup R\to L'\cup R'\) such that \(f(L)=L'\) and \(f(u)f(v)\not\in E'\) for every edge \(uv\in E\) is called a bi-placement of \(G\) and \(G'\). The graphs \(G\) and \(G'\) are called bi-placeable if there exists a bi-placement of \(G\) and \(G'\).
A. Pawel Wojda, Paul Vaderlind
openaire   +1 more source

BIPARTITE STEINHAUS GRAPHS [PDF]

Taiwanese Journal of Mathematics, 1999
A Steinhaus matrix is a symmetric 0-1 matrix \([a_{i,j}]_{n\times n}\) such that \(a_{i,j}= 0\) for \(0\leq i\leq n-1\) and \(a_{i,j}\equiv (a_{i- 1,j-1}+ a_{i-1,j})\pmod 2\) for \(1\leq i\leq n-1\). A Steinhaus graph is a graph whose adjacency matrix is a Steinhaus matrix. In this paper Lee and Chang prove that if \(G\) is a Steinhaus graph of order \(
Lee, Yueh-Shin, Chang, G. J.
openaire   +3 more sources

Semantic Web Service Discovery Based on Clustering and Bipartite Graph Matching [PDF]

Jisuanji gongcheng, 2016
In order to efficiently and accurately locate semantic Web service,a new semantic Web service discovery method is proposed based on clustering and bipartite graph matching.In this method,services are clustered according to the service description ...
LIU Yisong,ZHU Dan
doaj   +1 more source

Materials Representation Learning Based on a Material–Motif Network and Heterogeneous Graphs

Advanced Intelligent Discovery, EarlyView.
Structure motifs in materials are used to construct a bipartite material–motif network that links each material to its constituent motifs and establishes connectivity among materials sharing common motifs. Network analysis reveals material clusters associated with different functional applications and supports motif‐guided screening of materials.
Anoj Aryal, Weiyi Gong, Huta Banjade, Qimin Yan   +3 more
wiley   +1 more source

Crowns in bipartite graphs

Electronic Notes in Discrete Mathematics, 2016
Abstract A set S ⊆ V ( G ) is stable (or independent) if no two vertices from S are adjacent. Let Ψ ( G ) be the family of all local maximum stable sets [V. E. Levit, E. Mandrescu, A new greedoid: the family of local maximum stable sets of a forest, Discr. Appl. Math.
Vadim E. Levit, Eugen Mandrescu
openaire   +1 more source