Results 51 to 60 of about 304,795 (244)

Using Multiscale Entropy to Assess the Efficacy of Local Cooling on Reactive Hyperemia in People with a Spinal Cord Injury

open access: yesEntropy, 2019
Pressure ulcers are one of the most common complications of a spinal cord injury (SCI). Prolonged unrelieved pressure is thought to be the primary causative factor resulting in tissue ischemia and eventually pressure ulcers.
Fuyuan Liao   +5 more
doaj   +1 more source

A regularity structure for rough volatility [PDF]

open access: yesMathematical Finance, 2017
A new paradigm has emerged recently in financial modeling: rough (stochastic) volatility. First observed by Gatheral et al. in high‐frequency data, subsequently derived within market microstructure models, rough volatility captures parsimoniously key ...
Christian Bayer   +4 more
semanticscholar   +1 more source

Nonlinear higher order fractional terminal value problems

open access: yesAIMS Mathematics, 2022
Terminal value problems for systems of fractional differential equations are studied with an especial focus on higher-order systems. Discretized piecewise polynomial collocation methods are used for approximating the exact solution. This leads to solving
Dumitru Baleanu, Babak Shiri
doaj   +1 more source

Local Elliptic Regularity for the Dirichlet Fractional Laplacian [PDF]

open access: yes, 2017
We prove the Wloc2⁢s,p${W_{{\mathrm{loc}}}^{2s,p}}$ local elliptic regularity of weak solutions to the Dirichlet problem associated with the fractional Laplacian on an arbitrary bounded open set of ℝN${\mathbb{R}^{N}}$. The key tool consists in analyzing
U. Biccari, M. Warma, E. Zuazua
semanticscholar   +1 more source

Regular graphs with regular neighborhoods [PDF]

open access: yesGlasgow Mathematical Journal, 1992
The existence of r-regular graphs such that each edge lies in exactly t triangles, for given integers t < r, is studied. If t is sufficiently close to r then each such connected graph has to be the complete multipartite graph. Relations to graphs with isomorphic neighborhoods are also considered.
openaire   +2 more sources

Regular subgraphs of almost regular graphs [PDF]

open access: yesJournal of Combinatorial Theory, Series B, 1984
AbstractSuppose every vertex of a graph G has degree k or k + 1 and at least one vertex has degree k + 1. It is shown that if k ≥ 2q − 2 and q is a prime power then G contains a q-regular subgraph (and hence an r-regular subgraph for all r < q, r ≡ q (mod 2)). It is also proved that every simple graph with maximal degree Δ ≥ 2q − 2 and average degree d
Noga Alon, Gil Kalai, Shmuel Friedland
openaire   +1 more source

Regular transducer expressions for regular transformations [PDF]

open access: yesInformation and Computation, 2018
Functional MSO transductions, deterministic two-way transducers, as well as streaming string transducers are all equivalent models for regular functions. In this paper, we show that every regular function, either on finite words or on infinite words, captured by a deterministic two-way transducer, can be described with a regular transducer expression ...
Shankara Narayanan Krishna   +2 more
openaire   +4 more sources

Le quotidien, objet philosophique ?

open access: yesCahiers Jean Moulin, 2019
Everyday life takes place between the two poles of the abstract and the concrete pushed one against the other. On the one hand, everyday life is made up of repetitive stereotypes, that their haunting return paradoxically makes invisible, so much do they ...
Pierre Macherey
doaj   +1 more source

On fractional Schrödinger equations with Hartree type nonlinearities

open access: yesMathematics in Engineering, 2022
Goal of this paper is to study the following doubly nonlocal equation $(- \Delta)^s u + \mu u = (I_\alpha*F(u))F'(u) \quad {\rm{in}}\;{\mathbb{R}^N}\qquad\qquad\qquad\qquad ({\rm{P}}) $ in the case of general nonlinearities $ F \in C^1(\mathbb{R})
Silvia Cingolani   +2 more
doaj   +1 more source

Regularity and Planarity of Token Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2017
Let G = (V, E) be a graph of order n and let 1 ≤ k < n be an integer. The k-token graph of G is the graph whose vertices are all the k-subsets of V, two of which are adjacent whenever their symmetric difference is a pair of adjacent vertices in G.
Carballosa Walter   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy