Results 91 to 100 of about 20,082 (264)
Homological eigenvalues of graph p-Laplacians
Inspired by persistent homology in topological data analysis, we introduce the homological eigenvalues of the graph [Formula: see text]-Laplacian [Formula: see text], which allows us to analyze and classify non-variational eigenvalues. We show the stability of homological eigenvalues, and we prove that for any homological eigenvalue [Formula: see text]
openaire +2 more sources
Betamethasone concentrations in 20 horses from Japan and Germany following IV, IM, and INJ administration of betamethasone phosphate were analyzed using population pharmacokinetic modeling. For IV administration of 0.04 mg/kg q24 h, IPC and IUC were 0.012 and 0.31 ng/mL, respectively; the IUC approximated the IFHA urine ISL (0.20 ng/mL).
Taisuke Kuroda +9 more
wiley +1 more source
Pullback attractors for the non-autonomous complex Ginzburg–Landau type equation with p-Laplacian
In this paper, we are concerned with the long-time behavior of the non-autonomous complex Ginzburg–Landau type equation with p-Laplacian. We first prove the existence of pullback absorbing sets in L2(Ω)∩W01,p(Ω)∩Lq(Ω) for the process {U(t,τ)}t⩾τ ...
Fang Li, Bo You
doaj +1 more source
Abstract Objective In temporal lobe epilepsy (TLE), patients often present with neurobehavioral comorbidities encompassing affective and cognitive difficulties. Whereas the latter have been related to atypical connectivity of mesiotemporal and frontotemporal circuits, the brain basis of affective symptoms remains incompletely understood.
Fatemeh Fadaie +4 more
wiley +1 more source
Prüfer transformation for the \(p\)-Laplacian
Summary: Prüfer transformation is a useful tool for studying second-order ordinary differential equations. There are many possible extensions of the original Prüfer transformation. We focus on a transformation suitable for study of boundary value problems for the \(p\)-Laplacian in the resonant case.
Jiri Benedikt, Petr Girg
openaire +2 more sources
Hypergraph p-Laplacians and Scale Spaces
AbstractThe aim of this paper is to revisit the definition of differential operators on hypergraphs, which are a natural extension of graphs in systems based on interactions beyond pairs. In particular, we focus on the definition of Laplacian and p-Laplace operators for oriented and unoriented hypergraphs, their basic properties, variational structure,
Fazeny, Ariane +3 more
openaire +7 more sources
Immersed Boundary Projection Method for Boundaries With Slip Velocities
A formulation of the immersed boundary method for incompressible flow over arbitrarily‐shaped bodies with surface slip described by the Navier boundary condition is presented. The wall slip velocity and the boundary force are determined implicitly through a projection to satisfy both the boundary condition and the divergence‐free condition of the ...
Takehiro Fujii, Takeshi Omori
wiley +1 more source
This study developed a two‐stage model using radiomics‐based multiparametric MRI and clinical indicators to help identify and grade clinically significant prostate cancer. The model showed promising levels of diagnostic accuracy and predictive performance.
Yuyan Zou +10 more
wiley +1 more source
Origin of the \(p\)-Laplacian and A. Missbach
Summary: We describe the historical process of derivation of the \(p\)-Laplace operator from a nonlinear Darcy law and the continuity equation. The story begins with nonlinear flows in channels and ditches. As the nonlinear Darcy law we use the power law discovered by \textit{O.
Jiri Benedikt +3 more
openaire +2 more sources
Traveling Fronts for (q,r)$(q, r)$‐Relativistic Operators: Existence and Asymptotic Properties
ABSTRACT A new reaction–diffusion model governed by a (q,r)$(q, r)$‐relativistic type diffusion, generalizing the p$p$‐relativistic one and encompassing singular and/or degenerate diffusivity, is introduced. In the monostable case, some existence results for (decreasing) fronts are then provided, exploiting the study of a suitable two‐point problem ...
Pavel Drábek +2 more
wiley +1 more source

