Results 101 to 110 of about 1,307,438 (325)
The Relationship Between Inflammation and Central Nervous System in Multiple Sclerosis
ABSTRACT Aim Multiple sclerosis is an autoimmune demyelination disease that is seen especially in the young population and has a progressive course, causing motor, sensory, and cognitive deficits. In the literature, the pathogenesis of MS disease and the interconnection between the immune and central nervous system in the disease have not been fully ...
Gamze Ansen +5 more
wiley +1 more source
On colorings of graph fractional powers
\noindent Let $G$ be a simple graph. For any $k\in N$, the $k-$power of $G$ is a simple graph $G^k$ with vertex set $V(G)$ and edge set $\{xy:d_G(x,y)\leq k\}$ and the $k-$subdivision of $G$ is a simple graph $G^{\frac{1}{k}}$, which is constructed by replacing each edge of $G$ with a path of length $k$.
openaire +3 more sources
Objective This study aimed to determine if program format (in‐person, virtual, hybrid) results in differences in three‐month outcomes of pain, function, quality of life, self‐efficacy and chair stands in a hip/knee osteoarthritis management program. Methods A secondary analysis of the GLA:DTM Canada database was completed.
Jill Van Damme +7 more
wiley +1 more source
Mitigation of Cascading Outages Using a Dynamic Interaction Graph-Based Optimal Power Flow Model
Online decision support for effective mitigation actions against propagating cascading outages in a power grid still poses a big challenge to grid operators.
Changsheng Chen +3 more
doaj +1 more source
Recently, there has been growing discussion about how to best assess pain in clinical trials in rheumatic diseases. Reliable measurement of pain outcomes is essential for accurately determining the effectiveness of treatments. Although pain intensity is the most common measure of change in pain trials, other pain‐related measures, such as pain ...
Yen T. Chen +4 more
wiley +1 more source
Powers of connected graphs and hamiltonicity
A graph G is n-hamiltonian (resp. n-edge hamiltonian) if after the removal of any k vertices (resp. edges) with 0\(\leq k\leq n\), the resulting graph is hamiltonian. The kth power of a graph G is the graph having the same vertex-set as G and such that u and v, vertices of \(G^ k\), are adjacent if and only if the distance between u and v in G is at ...
openaire +3 more sources
Assessment of Pain Types in Recently Diagnosed Patients With Inflammatory Arthritis
Objective Up to 40% of patients with inflammatory arthritis (IA) experience persistent pain, traditionally thought to be associated with a shift from peripherally to centrally mediated pain during the disease course in some patients. We assessed sensory profiles of recently diagnosed individuals with IA, hypothesizing that pain reported at this early ...
Zoe Rutter‐Locher +8 more
wiley +1 more source
Workflow of the parameter optimization process for ITSC fault detection, applying Differential Evolution optimization and the Smooth Pseudo Wigner‐Ville Distribution for signal processing. The optimized parameters are then used in the failure identification pipeline, which combines the signal processing with a YOLO‐based architecture for fault severity
Rafael Martini Silva +4 more
wiley +1 more source
Research on power system carbon flow calculation based on graph database and graph computing engine
Firstly, the basic principles of graph database and graph algorithms are introduced, including the data model of graph database, query language, and common graph algorithms.Then, the method of constructing the graph model of the power system is ...
Guangxin ZHU +5 more
doaj
On powers of m-trapezoid graphs
The author introduces \(m\)-trapezoid graphs (\(m\)-TGs) as intersection graphs of \(m\)-trapezoids, where an \(m\)-trapezoid is given by \(m+ 1\) intervals on \(m+ 1\) parallel lines. (The class of 0-TGs is the class of interval graphs.) The main result concerns powers of graphs: If \(G^{k- 1}\) is an \(m\)-TG then \(G^k\) is also an \(m\)-TG.
openaire +2 more sources

