Results 81 to 90 of about 836,691 (279)
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
On the distance eigenvalues of Cayley graphs
In this paper, graphs are undirected and loop-free and groups are finite. By Cn, Kn and Km,n we mean the cycle graph with n vertices, the complete graph with n vertices and the complete bipartite graph with parts size m and n, respectively.
Majid Arezoomand
doaj
Functional Connectivity Linked to Cognitive Recovery After Minor Stroke
ABSTRACT Objective Patients with minor stroke exhibit slowed processing speed and generalized alterations in functional connectivity involving frontoparietal cortex (FPC). The pattern of connectivity evolves over time. In this study, we examine the relationship of functional connectivity patterns to cognitive performance, to determine ...
Vrishab Commuri +7 more
wiley +1 more source
Structural Relationship of Isomorphic Graph and its Mapping to Hamming Distance [PDF]
Mapping graph isomorphism to Hamming distance enables a simple yet effective approach to quantifying structural similarity. By encoding graphs as binary adjacency vectors—flattened from the upper triangle of the adjacency matrix—structural comparisons ...
Tiwari Monika +3 more
doaj +1 more source
ABSTRACT Background and Objectives Multiple sclerosis (MS) exhibits racially disparate rates of disease progression. Black people with MS (B‐PwMS) experience a more severe disease course than non‐Hispanic White people with MS (NHW‐PwMS). Here we investigated structural and functional connectivity as well as structure–function decoupling in the ...
Emilio Cipriano +11 more
wiley +1 more source
On Wiener index of graph complements [PDF]
Let $G$ be an $(n,m)$-graph. We say that $G$ has property $(ast)$ if for every pair of its adjacent vertices $x$ and $y$, there exists a vertex $z$, such that $z$ is not adjacent to either $x$ or $y$.
Jaisankar Senbagamalar +2 more
doaj
Shortest path distance in random k-nearest neighbor graphs [PDF]
Consider a weighted or unweighted k-nearest neighbor graph that has been built on n data points drawn randomly according to some density p on R^d. We study the convergence of the shortest path distance in such graphs as the sample size tends to infinity.
Alamgir, Morteza, von Luxburg, Ulrike
core +1 more source
A Depolarizing Leak in Sodium Bicarbonate Cotransporter NBCe1 Causes Brain Edema
ABSTRACT Objectives SLC4A4 encodes electrogenic sodium bicarbonate cotransporter NBCe1, prominently expressed in kidney and brain. Recessive loss‐of‐function variants in SLC4A4 cause proximal renal tubular acidosis, no brain edema. In the brain, NBCe1 is expressed by astrocytes, where it regulates pH and mediates astrocyte volume changes.
Quinty Bisseling +16 more
wiley +1 more source
Universal distance domination in random graphs
Given a graph G=(V,E)D⊆VV∖DDGγ(G)GkDDdDk uk(G):= min {d:∀ D⊆V with |D|≥d,D is a kdd set in G}.kuk(G)γ(G)=u1(G)ukkkkH ...
Gábor Bacsó +2 more
doaj +1 more source
ABSTRACT Objective Considerable efforts have been dedicated to developing effective treatments for post‐stroke executive impairment (PSEI), among which repetitive transcranial magnetic stimulation (rTMS) has shown great potential. This study aimed to investigate the therapeutic effects of high‐frequency rTMS on working memory (WM) and response ...
Mengting Lao +6 more
wiley +1 more source

