Results 91 to 100 of about 27,298 (312)

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

open access: yesPeerJ 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   +4 more
doaj   +2 more sources

Fast and robust distributed subgraph enumeration

open access: yes, 2019
We study the subgraph enumeration problem under distributed settings. Existing solutions either suffer from severe memory crisis or rely on large indexes, which makes them impractical for very large graphs.
Wang, J, Ren, X, Yu, JX, Han, WS
core   +1 more source

The Benjamin–Ono Equation in the Zero‐Dispersion Limit for Rational Initial Data: Generation of Dispersive Shock Waves

open access: yesCommunications on Pure and Applied Mathematics, EarlyView.
ABSTRACT The leading‐order asymptotic behavior of the solution of the Cauchy initial‐value problem for the Benjamin–Ono equation in L2(R)$L^2(\mathbb {R})$ is obtained explicitly for generic rational initial data u0$u_0$. An explicit asymptotic wave profile uZD(t,x;ε)$u^\mathrm{ZD}(t,x;\epsilon)$ is given, in terms of the branches of the multivalued ...
Elliot Blackstone   +3 more
wiley   +1 more source

Directed Subgraph Complexes [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2004
Let $G$ be a directed graph, and let $\Delta^{ACY}_G$ be the simplicial complex whose simplices are the edge sets of acyclic subgraphs of $G$. Similarly, we define $\Delta^{NSC}_G$ to be the simplicial complex with the edge sets of not strongly connected subgraphs of $G$ as simplices. We show that $\Delta^{ACY}_G$ is homotopy equivalent to the $(n-1-k)$
openaire   +2 more sources

Detecting induced subgraphs [PDF]

open access: yesDiscrete Applied Mathematics, 2007
arXiv admin note: text overlap with arXiv:1308 ...
Trotignon, Nicolas   +3 more
openaire   +7 more sources

Periodic subgraph mining in dynamic networks [PDF]

open access: yes, 2010
La tesi si prefigge di scoprire interazioni periodiche frequenti tra i membri di una popolazione il cui comportamento viene studiato in un certo arco di tempo.
Barbares, Manuel
core  

Front Propagation Through a Perforated Wall

open access: yesCommunications on Pure and Applied Mathematics, EarlyView.
ABSTRACT We consider a bistable reaction– diffusion equation ut=Δu+f(u)$u_t=\Delta u +f(u)$ on RN${\mathbb {R}}^N$ in the presence of an obstacle K$K$, which is a wall of infinite span with many holes. More precisely, K$K$ is a closed subset of RN${\mathbb {R}}^N$ with smooth boundary such that its projection onto the x1$x_1$‐axis is bounded and that ...
Henri Berestycki   +2 more
wiley   +1 more source

Decentralized Federated Learning for Wind Turbine Bearing Prognostics Under Data Scarcity and Statistical Heterogeneity

open access: yesEnergy Science &Engineering, EarlyView.
This paper proposes a decentralized peer‐to‐peer federated learning framework for wind turbine bearing remaining useful life prediction, introducing a virtual client paradigm in which statistical health indicators serve as independent feature‐level clients—enabling privacy‐preserving collaborative prognostics from a single physical asset under ...
Jihene Sidhom   +2 more
wiley   +1 more source

Polymer informatics: Integrating data‐driven strategies, advanced machine learning, and automated synthesis for next‐generation polymer design

open access: yesInfoScience, EarlyView.
Designing new polymers for applications such as sustainable plastics, biomaterials, and 3D printing has traditionally been slow and expensive, relying heavily on trial‐and‐error experiments. This review shows how polymer informatics—the integration of large polymer databases, machine‐learning models, and automated robotic synthesis—enables fast ...
Md. Saiful Islam   +6 more
wiley   +1 more source

End-to-End Verification for Subgraph Solving [Elektronisk resurs]

open access: yes
Modern subgraph-finding algorithm implementations consist of thousands of lines of highly optimized code, and this complexity raises questions about their trustworthiness.
Oertel, Andy,   +6 more
core   +1 more source

Home - About - Disclaimer - Privacy