Results 61 to 70 of about 72,689,119 (258)

Maximum Cycle Packing in Eulerian Graphs Using Local Traces

open access: yesDiscussiones Mathematicae Graph Theory, 2015
For a graph G = (V,E) and a vertex v ∈ V , let T(v) be a local trace at v, i.e. T(v) is an Eulerian subgraph of G such that every walk W(v), with start vertex v can be extended to an Eulerian tour in T(v).
Recht Peter, Sprengel Eva-Maria
doaj   +1 more source

Perturbation graphs, invariant causal prediction and causal relations in psychology

open access: yesBritish Journal of Mathematical and Statistical Psychology, Volume 78, Issue 1, Page 303-340, February 2025.
Abstract Networks (graphs) in psychology are often restricted to settings without interventions. Here we consider a framework borrowed from biology that involves multiple interventions from different contexts (observations and experiments) in a single analysis. The method is called perturbation graphs. In gene regulatory networks, the induced change in
Lourens Waldorp   +2 more
wiley   +1 more source

Multiplicity of positive solutions for a fractional p&q-Laplacian problem in RN [PDF]

open access: yes, 2021
In this paper we deal with the following fractional p&q-Laplacian problem: {(−Δ)psu+(−Δ)qsu+V(εx)(|u|p−2u+|u|q−2u)=f(u) in RN,u∈Ws,p(RN)∩Ws,q(RN),u>0 in RN, where s∈(0,1), ε>0 is a small parameter, [Formula presented], (−Δ)ts, with t∈{p,q}, is ...
Ambrosio V., Isernia T.
core   +1 more source

New existence results for nonlinear delayed differential systems at resonance

open access: yesJournal of Inequalities and Applications, 2018
This paper deals with the first-order delayed differential systems {u′+a(t)u=h(t)v+f(t,u(t−τ(t))),v′+b(t)v=g(t,u(t−τ(t))), $$\textstyle\begin{cases} u'+a(t)u=h(t)v+f(t,u(t-\tau (t))), \\ v'+b(t)v=g(t,u(t-\tau (t))), \end{cases} $$ where a, b, τ, h are ...
Ruipeng Chen, Xiaoya Li
doaj   +1 more source

Multimodal sentiment analysis based on multi‐stage graph fusion networks under random missing modality conditions

open access: yesIET Image Processing, Volume 19, Issue 1, January/December 2025.
In order to solve the problem of uncertain missing modalities in multimodal sentiment analysis, this paper proposes a multimodal sentiment analysis method based on multi‐stage graph fusion network under the condition of random missing modalities.
Ting Zhang   +3 more
wiley   +1 more source

Taxonomic Revision of Tipula (Vestiplex Bezzi) Crane Flies (Diptera, Tipulidae) in Taiwan with Descriptions of Six New Species

open access: yesInsects, 2023
The crane fly subgenus Tipula (Vestiplex) Bezzi, 1924 (Diptera, Tipulidae) of Taiwan is taxonomically reviewed, entailing the recognition of 18 species, with six of these species newly described, including T. (V.) diamondi sp. nov., T.
Pavel Starkevich, Chen W. Young
doaj   +1 more source

Extension of planar Hölder homeomorphisms

open access: yesJournal of the London Mathematical Society, Volume 110, Issue 3, September 2024.
Abstract Let α∈(0,1)$\alpha \in (0,1)$. We show that any α$\alpha$‐Hölder homeomorphism from the unit circle in the plane to the plane can be extended to an α$\alpha$‐Hölder homeomorphism from the whole unit disc.
Stanislav Hencl, Aleksis Koski
wiley   +1 more source

Dimethyl Sulfoxide (DMSO) Decreases Cell Proliferation and TNF-α, IFN-γ, and IL-2 Cytokines Production in Cultures of Peripheral Blood Lymphocytes

open access: yesMolecules, 2017
Dimethylsulfoxide (DMSO) is an amphipathic molecule composed of a polar domain characterized by the sulfinyl and two nonpolar methyl groups, for this reason it is able to solubilize polar and nonpolar substances and transpose hydrophobic barriers.
Lucas de Abreu Costa   +7 more
semanticscholar   +1 more source

On (k,kn-k2-2k-1)-Choosability of n-Vertex Graphs

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2015
A (k,t)-list assignment L of a graph G is a mapping which assigns a set of size k to each vertex v of G and |⋃v∈V(G)‍L(v)|=t. A graph G is (k,t)-choosable if G has a proper coloring f such that f(v)∈L(v) for each (k,t)-list assignment L.
Wongsakorn Charoenpanitseri
doaj   +1 more source

CMS pythia  8 colour reconnection tunes based on underlying-event data

open access: yesEuropean Physical Journal C: Particles and Fields, 2023
New sets of parameter tunes for two of the colour reconnection models, quantum chromodynamics-inspired and gluon-move, implemented in the pythia  8 event generator, are obtained based on the default CMS pythia  8 underlying-event tune, CP5.
A. Tumasyan   +2330 more
doaj   +1 more source

Home - About - Disclaimer - Privacy