Blow-up for p-Laplacian parabolic equations
In this article we give a complete picture of the blow-up criteria for weak solutions of the Dirichlet problem $$ u_t= abla(| abla u|^{p-2} abla u)+lambda |u|^{q-2}u,quad hbox{in } Omega_T, $$ where $p>1$.
Yuxiang Li, Chunhong Xie
doaj
Periodic solutions for prescribed mean curvature p-Laplacian equations with a singularity of repulsive type and a time-varying delay [PDF]
Wenbin Chen, Fanchao Kong
openalex +1 more source
Location‐Assisted Graph‐Based User Scheduling in Multi‐User MIMO LEO NTN Systems
ABSTRACT This paper addresses user clustering and scheduling for multi‐user MIMO low Earth orbit nonterrestrial network systems in full frequency reuse. Since the number of on‐ground user terminals is usually much higher than the number of on‐board LEO satellite antennas, user scheduling becomes a fundamental task.
Bilal Ahmad +4 more
wiley +1 more source
Characterization of the Carbonyl Metalates [Mn2(CO)8]2− and [W2(CO)8]4− Featuring M=M Double Bonds
The novel homoleptic carbonyl metalate anions [Mn2(CO)8]2− and [W2(CO)8]4− featuring M=M double bonds are structurally characterized and investigated using quantum chemical calculations and QTAIM methods. The crystal structures of [Rb[2.2.2]crypt]2[Mn2(CO)8] ⋅ 4NH3 and [K[18]crown‐6]2K2[W2(CO)8] ⋅ 14NH3 are reported, containing the first homoleptic ...
Michael Witzmann +2 more
wiley +1 more source
Maximum and anti-maximum principles for the p-Laplacian with a nonlinear boundary condition
In this paper we study the maximum and the anti-maximum principles for the problem $Delta _{p}u=|u|^{p-2}u$ in the bounded smooth domain $Omega subset mathbb{R}^{N}$, with $|abla u|^{p-2}frac{partial u}{partial u }=lambda |u|^{p-2}u+h$ as a non linear ...
Aomar Anane, Omar Chakrone, Najat Moradi
doaj
Abstract Graph neural networks (GNNs) have revolutionised the processing of information by facilitating the transmission of messages between graph nodes. Graph neural networks operate on graph‐structured data, which makes them suitable for a wide variety of computer vision problems, such as link prediction, node classification, and graph classification.
Amit Sharma +4 more
wiley +1 more source
Asymptotic Dirichlet problem for the $p$-Laplacian on Cartan-Hadamard manifolds [PDF]
Ilkka Holopainen
openalex +1 more source
Enhancing generalized spectral clustering with embedding Laplacian graph regularization
Abstract An enhanced generalised spectral clustering framework that addresses the limitations of existing methods by incorporating the Laplacian graph and group effect into a regularisation term is presented. By doing so, the framework significantly enhances discrimination power and proves highly effective in handling noisy data.
Hengmin Zhang +5 more
wiley +1 more source
The uniqueness of a nonlinear diffusion equation related to the p-Laplacian. [PDF]
Zhan H.
europepmc +1 more source
Boosted unsupervised feature selection for tumor gene expression profiles
Abstract In an unsupervised scenario, it is challenging but essential to eliminate noise and redundant features for tumour gene expression profiles. However, the current unsupervised feature selection methods treat all samples equally, which tend to learn discriminative features from simple samples.
Yifan Shi +5 more
wiley +1 more source

