Results 31 to 40 of about 139 (132)
Coloring the hypergraph of maximal cliques of a graph with no long path
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sylvain Gravier +2 more
openaire +1 more source
A Universal Meta‐Heuristic Framework for Influence Maximisation in Hypergraphs
ABSTRACT Influence maximisation (IM) aims to select a small number of nodes that are able to maximise their influence in a network and covers a wide range of applications. Despite numerous attempts to provide effective solutions in simple networks, higher‐order interactions between entities in various real‐world systems are usually not taken into ...
Ming Xie +5 more
wiley +1 more source
Hypergraphs with arbitrarily small codegree Turán density
Abstract The codegree Turán density γ(F)$\gamma (F)$ of a k$k$‐graph F$F$ is the smallest γ∈[0,1)$\gamma \in [0,1)$ such that every k$k$‐graph H$H$ with δk−1(H)⩾(γ+o(1))|V(H)|$\delta _{k-1}(H)\geqslant (\gamma +o(1))\vert V(H)\vert$ contains a copy of F$F$. In this work, we show that for every ε>0$\varepsilon >0$, there is a k$k$‐uniform hypergraph F$F$
Simón Piga, Bjarne Schülke
wiley +1 more source
Cognitive Networks for Knowledge Modeling: A Gentle Introduction for Data‐ and Cognitive Scientists
Cognitive network science helps organize associative knowledge—that is, the connections between concepts. These connections play a key role in cognitive processes such as language understanding and context interpretation, even though they are not obvious in language use.
Edith Haim, Massimo Stella
wiley +1 more source
Lightweight Hybrid Wafer Defect Pattern Network Based on Feedforward Efficient Attention
ABSTRACT With the increase of semiconductor integration density, in order to cope with the increase of wafer defect complexity and types, especially the low recognition accuracy of overlapping mixed defects and unknown wafer defects, this study proposes a lightweight model for wafer defect detection called LightWMNet.
Zhiqiang Hu, Yiquan Wu
wiley +1 more source
This work tackles the unresolved stability problem of heterogeneous quaternion‐valued BAM neural networks plagued by unknown parameters, time‐varying delays, and impulses. By synergizing Lyapunov theory with inequality techniques, we establish rigorous, yet practical, global stability conditions.
Xi Long, Yaqin Li
wiley +1 more source
Color-critical graphs and hypergraphs with few edges and no short cycles
An \(r\)-coloring of a hypergraph \((V, {\mathcal G})\) with vertex set \(V\) and edge set \({\mathcal G}\) is a coloring of its vertices with at most \(r\) colors such that each edge is incident with at least two vertices of different colors. \((V, {\mathcal G})\) is \(r\)-chromatic if \(r\) is the smallest integer for which \((V, {\mathcal G})\) is \(
H. L. Abbott +2 more
openaire +1 more source
Steiner Triple Systems With High Discrepancy
ABSTRACT In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed r ≥ 3 and n ≡ 1 , 3 ( mod 6 ), any r‐colouring of the triples on [ n ] admits a Steiner triple system of order n with discrepancy Ω ( n 2 ).
Lior Gishboliner +2 more
wiley +1 more source
Intelligent fault diagnosis (IFD) of rotating machinery is critical for ensuring industrial safety and reliability. However, existing deep learning‐based IFD methods face three core challenges: suboptimal feature discrimination of single attention mechanisms, high computational cost limiting edge deployment, and class imbalance bias leading to ...
Chuanyan Wu +9 more
wiley +1 more source
Temporal knowledge graph reasoning (TKGR) excels at inferring missing event‐centric facts within a timeline, thereby mitigating the inherent incompleteness of real‐world data. Existing TKGR methods predominantly exploit intrasnapshot structural patterns and intersnapshot temporal dependencies.
Fei Chen +7 more
wiley +1 more source

