Results 21 to 30 of about 42,191 (216)

Multidimensional Profiling of MRI‐Negative Temporal Lobe Epilepsy Uncovers Distinct Phenotypes

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Although hippocampal sclerosis (TLE‐HS) represents the most frequent cause of temporal lobe epilepsy (TLE), up to 30% of patients show no lesion on visual MRI inspection (TLE‐MRIneg). These cases pose diagnostic and therapeutic challenges and are underrepresented in surgical series.
Alice Ballerini   +28 more
wiley   +1 more source

Onasemnogene Abeparvovec in Type I Spinal Muscular Atrophy: 24‐Month Follow‐Up From the Italian Registry

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Onasemnogene abeparvovec (OA) is an AAV9‐based gene therapy for spinal muscular atrophy type I (SMA I). Real‐world outcomes show increased response variability compared to clinical trials, and follow‐up data beyond 12–18 months are limited.
Marika Pane   +43 more
wiley   +1 more source

Association Between Motor Pathway Damage and Motor Deficit in Upper and Lower Limb in People With MS

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Corticospinal tract damage is common in people with MS, but the degree of clinical symptoms varies. We hypothesize that corticospinal tract lesions are more extensive and severe in people with MS with motor impairments in both upper and lower limbs.
Mathilde Liffran   +13 more
wiley   +1 more source

Vertex Degree Weighted Path Indices

open access: yesActa Chimica Slovenica, 2016
Vertex degree weighted path indices P(N)(a, b, ...), for example P(1)(a, b), P(2)(a, b, c), P(3)(a, b, c, d), and P(4)(a, b, c, d, e), are good topological indices for some of the physicochemical properties of octanes with |R|(max) up to 0.999. Mutually optimized combinations of them are even better, R (P(1)..P(4)) is in the worst tested case > 0.9 ...
openaire   +5 more sources

On the degrees of a strongly vertex-magic graph

open access: yesDiscrete Mathematics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Camino Balbuena   +8 more
openaire   +1 more source

Pain and Patient‐Reported Physical Function Did Not Differ Among Body Composition Profiles in Patients With Hip Osteoarthritis

open access: yesArthritis Care &Research, EarlyView.
Objective To explore whether higher body fat and lower lean mass are associated with greater pain and worse patient‐reported physical function in individuals with hip osteoarthritis (OA). A secondary aim was to examine whether pain and patient‐reported physical function differ according to four body composition profiles: high body fat, low lean mass ...
Alexandra Ryan   +10 more
wiley   +1 more source

Experimental Evaluation of 100Cr6 Steel Microindented Surfaces Under Lubricated Nonconformal Point Contacts

open access: yesAdvanced Engineering Materials, EarlyView.
The tribological behavior of 100Cr6 steel spheres textured via Vickers microindentation is evaluated under lubricated sliding by varying both dimple size and density. Fine and dense textures significantly reduce friction across all lubrication regimes, while large dimples increase it.
Farideh Davoodi   +3 more
wiley   +1 more source

Effect of Laser Deoxidation on Adhesive‐Bonded Aluminum in an Oxygen‐Free Atmosphere

open access: yesAdvanced Engineering Materials, EarlyView.
This study investigates laser ablation of aluminum under oxygen‐free conditions. The goal is to produce oxide‐free substrates that enable improved adhesive bonding with epoxy. Optimized laser parameters (90% overlap, 300 µJ) combined with oxide‐free substrates result in the highest tensile strength of the adhesive bond.
Sandra Gerland   +5 more
wiley   +1 more source

Sparse Vertex Cutsets and the Maximum Degree

open access: yesThe Electronic Journal of Combinatorics
We show that every graph $G$ of maximum degree $\Delta$ and sufficiently large order has a vertex cutset $S$ of order at most $\Delta$ that induces a subgraph $G[S]$ of maximum degree at most $\Delta-3$. For $\Delta\in \{ 4,5\}$, we refine this result by considering also the average degree of $G[S]$.
Stéphane Bessy   +3 more
openaire   +3 more sources

On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion

open access: yesJournal of Discrete Algorithms, 2015
16 pages, 4 figures, submitted to Elsevier's Journal of Discrete ...
Sounaka Mishra   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy