Results 61 to 70 of about 407,618 (322)

Visual Recovery Reflects Cortical MeCP2 Sensitivity in Rett Syndrome

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Rett syndrome (RTT) is a devastating neurodevelopmental disorder with developmental regression affecting motor, sensory, and cognitive functions. Sensory disruptions contribute to the complex behavioral and cognitive difficulties and represent an important target for therapeutic interventions.
Alex Joseph Simon, Nathalie Picard, Valeria d'Andrea, Enchi Chang, Joseph Leffler, Eleonora Centofante, Matthew Taylor, Francesca Bardi, Francesca Cavicchiolo, Takao K. Hensch, Stefano Panzeri, Chinfei Chen, Michela Fagiolini   +12 more
wiley   +1 more source

γ-Cycles And Transitivity By Monochromatic Paths In Arc-Coloured Digraphs

Discussiones Mathematicae Graph Theory, 2013
We call the digraph D an m-coloured digraph if its arcs are coloured with m colours. If D is an m-coloured digraph and a ∈ A(D), colour(a) will denote the colour has been used on a.
Casas-Bautista Enrique, Galeana-Sánchez Hortensia, Rojas-Monroy Rocío   +2 more
doaj   +1 more source

Minimum degrees for powers of paths and cycles

, 2020
We study minimum degree conditions under which a graph $G$ contains $k^{th}$ power of paths and cycles of arbitrary specified lengths. We determine precise thresholds, assuming that the order of G is large.
Hng, Eng Keat
core  

Impact of APOE ε4 Genotype Load on Cognitive Function and Lipid Metabolism in Patients With Cerebral Small Vessel Disease

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background Apolipoprotein ε4 (APOE ε4) is a potent genetic risk factor for Alzheimer's disease (AD). However, its role in cerebral small vessel disease (CSVD) remains unclear. Given the clinical and pathological similarities between CSVD and AD, this study aimed to investigate the associations of APOE ε4 gene dosage with cognitive function and
Tingru Jin, Haocheng Yang, Feng Liu, Sihao Lin, Junru Hu, Jian Wang, Yulan Gou   +6 more
wiley   +1 more source

Conjectures About Wheels Without One Edge with Paths and Cycles

Mathematics
The crossing number cr(G) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main aim of this paper is to give the crossing numbers of the join products G*+Pn and G*+Cn for the connected graph G* obtained by ...
Michal Staš, Mária Timková
doaj   +1 more source

Variations of Solar Non-axisymmetric Activity [PDF]

, 2013
The temporal behaviour of solar active longitudes has been examined by using two sunspot catalogues, the Greenwich Photoheliographic Results (GPR) and the Debrecen Photoheliographic Data (DPD).
Baranyi, Tünde, Gyenge, Norbert, Ludmány, András   +2 more
core   +1 more source

Clinical Outcomes of Patients Within the Rheumatoid Arthritis Care Pathway Cohort at a Tertiary Care Integrated Delivery Network: A Comparison to Usual Care

Arthritis Care &Research, EarlyView.
Objective We aimed to compare clinical outcomes between patients in the Allegheny Health Network rheumatoid arthritis (RA) care pathway and patients receiving usual care. Methods The care pathway initiative implements guideline‐based best practice alongside multidisciplinary team‐based care.
Tarun Sharma, Tyson S. Barrett, Teigan Dwyer, Nancy Campbell, Jessica Heintzinger, Ellen Kraemer, Adam Dore, Susan Manzi   +7 more
wiley   +1 more source

Analysis of Known Linear Distributed Average Consensus Algorithms on Cycles and Paths

Sensors, 2018
In this paper, we compare six known linear distributed average consensus algorithms on a sensor network in terms of convergence time (and therefore, in terms of the number of transmissions required).
Jesús Gutiérrez-Gutiérrez, Marta Zárraga-Rodríguez, Xabier Insausti   +2 more
doaj   +1 more source

The Ramsey number of loose paths in 3-uniform hypergraphs [PDF]

, 2012
Recently, asymptotic values of 2-color Ramsey numbers for loose cycles and also loose paths were determined. Here we determine the 2-color Ramsey number of 3-uniform loose paths when one of the paths is significantly larger than the other: for every $n ...
Maherani, Leila, Omidi, Gholamreza, Raeisi, Ghaffar, Shahsiah, Maryam   +3 more
core  

Decomposition of Graphs into Paths and Cycles [PDF]

Journal of Discrete Mathematics, 2013
A decomposition of a graph is a collection of edge-disjoint subgraphs of such that every edge of belongs to exactly one . If each is a path or a cycle in , then is called a path decomposition of . If each is a path in , then is called an acyclic path decomposition of .
Arumugam, S., Hamid, I. Sahul, Abraham, V. M.   +2 more
openaire   +2 more sources