Results 111 to 120 of about 886,685 (323)
Automorphisms of infinite Johnson graphs
We consider the {\it infinite Johnson graph} $J_{\infty}$ whose vertex set consists of all subsets $X\subset {\mathbb N}$ satisfying $|X|=|{\mathbb N}\setminus X|=\infty$ and whose edges are pairs of such subsets $X,Y$ satisfying $|X\setminus Y|=|Y\setminus X|=1$.
openaire +3 more sources
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
Towards the specification and verification of modal properties for structured systems [PDF]
System specification formalisms should come with suitable property specification languages and effective verification tools. We sketch a framework for the verification of quantified temporal properties of systems with dynamically evolving structure.
Andrea Vandin, Vandin, Andrea, Vandin A
core +1 more source
Optimizing photoactivation of PA‐mCherry for optical pooled CRISPR screens
Photoactivatable PA‐mCherry finds widespread use to optically tag individual cells. However, confocal 405 nm UV laser‐scanning (normal scan) is much less efficient than widefield UV illumination, limiting the use of PA‐mCherry on confocal instruments. We remedy this limitation by reporting that rapid and repeated confocal scanning with a low‐intensity,
Sravasti Mukherjee +3 more
wiley +1 more source
Graph-based implicit knowledge discovery from architecture change logs [PDF]
Service architectures continuously evolve as a consequence of frequent business and technical change cycles. Architecture change log data represents a source of evolution-centric information in terms of intent, scope and operationalisation to ...
Pooyan Jamshidi (5276344) +12 more
core +2 more sources
On the discrete spectrum of the Dirac operator on bent chain quantum graph
We study Dirac operators on an infinite quantum graph of a bent chain form which consists of identical rings connected at the touching points by δ-couplings with a parameter α ∈ ℝ.
Belov Michail, Popov Igor, Blinova Irina
doaj +1 more source
The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong +3 more
wiley +1 more source
Retracts of Infinite Hamming Graphs
A Hamming graph is a Cartesian product of complete graphs. We show that (finite or infinite) quasi-median graphs, which are a generalization of median graphs, are exactly the retracts of Hamming graphs. This generalizes a result of \textit{H. J. Bandelt} [J.
openaire +3 more sources
In a murine model of myocardial ischemia and reperfusion (MI/R), the CD36 azapeptide ligand MPE‐298 reduces cardiac injury and transiently lowers left ventricular long‐chain fatty acids (LCFAs) accumulation 3 h after reperfusion, accompanied by a decrease of oxidative stress and inflammation‐associated genes' expression in the heart and adipose tissue.
Jade Gauvin +12 more
wiley +1 more source
In this paper, the concept of Total semirelib graph of a planar graph is introduced. Authors present a characterization of those graphs whose total semirelib graphs are planar, outer planar, Eulerian, hamiltonian with crossing number ...
Prasad, Manjunath +3 more
core +1 more source

