Results 41 to 50 of about 96,071 (258)
We have established a humanized orthotopic patient‐derived xenograft (Hu‐oPDX) mouse model of high‐grade serous ovarian cancer (HGSOC) that recapitulates human tumor–immune interactions. Using combined anti‐PD‐L1/anti‐CD73 immunotherapy, we demonstrate the model's improved biological relevance and enhanced translational value for preclinical ...
Luka Tandaric +10 more
wiley +1 more source
Wind power generation datasets are widely encountered in renewable energy systems because of their inherent periodicity, non-stationarity, and substantial noise.
Xufei Zhang +4 more
doaj +1 more source
Graph-Enhanced Prompt Tuning for Evidence-Grounded HFACS Classification in Power-System Safety
Power-system safety is fundamental to protecting lives and ensuring reliable grid operation. Yet, hierarchical text classification (HTC) methods struggle with domain-dense accident narratives that require cross-sentence reasoning, often yielding limited ...
Wenhua Zeng +5 more
doaj +1 more source
CCDC80 suppresses high‐grade serous ovarian cancer migration via negative regulation of B7‐H3
PAX8 is a lineage‐specific master regulator of transcription in high‐grade serous ovarian cancer (HGSC) progression. We show for the first time that PAX8 facilitates proliferation and metastasis by repressing the cell autonomous tumor suppressor CCDC80 and inducing B7‐H3 expression.
Aya Saleh +12 more
wiley +1 more source
This study presents a graph-based framework for improving predictive maintenance in nuclear power plants (NPPs), integrating data balancing techniques with a proposed Graph Attention Network (GAT) with a Mutual k-Nearest Neighbor (Mk-NN) strategy, named ...
Stefano Frizzo Stefenon +2 more
doaj +1 more source
ON NEIGHBOURHOODS IN THE ENHANCED POWER GRAPH ASSOCIATED WITH A FINITE GROUP
AbstractWe investigate neighbourhood sizes in the enhanced power graph (also known as the cyclic graph) associated with a finite group. In particular, we characterise finite p-groups with the smallest maximum size for neighbourhoods of a nontrivial element in its enhanced power graph.
MARK L. LEWIS, CARMINE MONETTA
openaire +2 more sources
On some properties of enhanced power graph
Given a group $G$, the enhanced power graph of $G$ denoted by $\mathcal{G}_e(G)$, is the graph with vertex set $G$ and two distinct vertices $x, y$ are edge connected in $\mathcal{G}_e(G)$ if there exists $z\in G $ such that $x=z^m$ and $ y=z^n $, for some $m, n\in \mathbb{N}$. In this article, we characterize the enhanced power graph $\mathcal{G}_e(G)$
Bera, Sudip, Bhuniya, A. K.
openaire +2 more sources
Dormant cancer cells can hide in distant organs for years, evading treatment and the immune system. This review highlights how signals from the surrounding tissue and immune environment keep these cells inactive or trigger their reawakening. Understanding these mechanisms may help develop therapies to eliminate or control dormant cells and prevent ...
Kanishka Tiwary +1 more
wiley +1 more source
The modern power system is becoming increasingly complex, and the uncertainty in the operation of each link has intensified the possibility of risks emerging.
Zhixin Suo +7 more
doaj +1 more source
Enhanced power graph from the power graph of a group
The power graph of a group $G$ is a graph with vertex set $G$, where two distinct vertices $a$ and $b$ are adjacent if one of $a$ and $b$ is a power of the other. Similarly, the enhanced power graph of $G$ is a graph with vertex set $G$, where two distinct vertices are adjacent if they belong to the same cyclic subgroup.
Pote, Amar S., Kadu, Ganesh S.
openaire +2 more sources

