Results 11 to 20 of about 65 (53)
Abstract A particular challenge to the field of neuroscience involves translating findings from 2D in vitro systems to 3D in vivo environments. Standardized cell culture environments that adequately reflect the properties of the central nervous system (CNS) such as the stiffness, protein composition, and microarchitecture in which to study 3D cell–cell
Cian O'Connor +4 more
wiley +1 more source
Coloring the Voronoi tessellation of lattices
Abstract In this paper we define the chromatic number of a lattice: It is the least number of colors one needs to color the interiors of the cells of the Voronoi tessellation of a lattice so that no two cells sharing a facet are of the same color. We compute the chromatic number of the root lattices, their duals, and of the Leech lattice, we consider ...
Mathieu Dutour Sikirić +3 more
wiley +1 more source
Learning to Translate: A Statistical and Computational Analysis
We present an extensive experimental study of Phrase‐based Statistical Machine Translation, from the point of view of its learning capabilities. Very accurate Learning Curves are obtained, using high‐performance computing, and extrapolations of the projected performance of the system under different conditions are provided.
Marco Turchi +4 more
wiley +1 more source
$s$-Stable Kneser Graph are Hamiltonian
The Kneser Graph $K(n,k)$ has as vertices all $k$-subsets of $\{1,\ldots,n\}$ and edges connecting two vertices if they are disjoint. The $s$-stable Kneser Graph $K_{s-\text{stab}}(n, k)$ is obtained from the Kneser graph by deleting vertices with elements at cyclic distance less than $s$.
Agustina Victoria Ledezma +1 more
openaire +2 more sources
Hamiltonicity of Schrijver graphs and stable Kneser graphs
For integers $k\geq 1$ and $n\geq 2k+1$, the Schrijver graph $S(n,k)$ has as vertices all $k$-element subsets of $[n]:=\{1,2,\ldots,n\}$ that contain no two cyclically adjacent elements, and an edge between any two disjoint sets. More generally, for integers $k\geq 1$, $s\geq 2$, and $n \geq sk+1$, the $s$-stable Kneser graph $S(n,k,s)$ has as vertices
Torsten Mütze, Namrata
openaire +2 more sources
Asymmetric graphs with quantum symmetry
Abstract We present an infinite sequence of finite graphs with trivial automorphism group and non‐trivial quantum automorphism group. These are the first known examples of graphs with this property. Moreover, to the best of our knowledge, these are the first examples of any asymmetric classical space that has non‐trivial quantum symmetries.
Josse van Dobben de Bruyn +2 more
wiley +1 more source
Optimal Zero‐Free Regions for the Independence Polynomial of Bounded Degree Hypergraphs
ABSTRACT In this paper, we investigate the distribution of zeros of the independence polynomial of hypergraphs of maximum degree Δ$$ \Delta $$. For graphs, the largest zero‐free disk around zero was described by Shearer as having radius λs(Δ)=(Δ−1)Δ−1/ΔΔ$$ {\lambda}_s\left(\Delta \right)={\left(\Delta -1\right)}^{\Delta -1}/{\Delta}^{\Delta ...
Ferenc Bencs, Pjotr Buys
wiley +1 more source
Strong subgroup recurrence and the Nevo–Stuck–Zimmer theorem
Abstract Let Γ$\Gamma$ be a countable group and Sub(Γ)$\mathrm{Sub}(\Gamma)$ its Chabauty space, namely, the compact Γ$\Gamma$‐space consisting of all subgroups of Γ$\Gamma$. We call a subgroup Δ∈Sub(Γ)$\Delta \in \mathrm{Sub}(\Gamma)$ a boomerang subgroup if for every γ∈Γ$\gamma \in \Gamma$, γniΔγ−ni→Δ$\gamma ^{n_i} \Delta \gamma ^{-n_i} \rightarrow ...
Yair Glasner, Waltraud Lederle
wiley +1 more source
Generating Medical Reports With a Novel Deep Learning Architecture
ABSTRACT The writing of medical reports by doctors in hospitals is a critical and sensitive process that is time‐consuming, prone to human error, and requires medical experts on site. Existing work on autonomous medical report generation using medical images as input has not achieved sufficiently high success. The goal of this paper is to present a new,
Murat Ucan, Buket Kaya, Mehmet Kaya
wiley +1 more source
Abstract We prove that at differentiability points r0>0$r_0>0$ of the volume function of a compact set A⊂Rd$A\subset \mathbb {R}^d$ (associating to r$r$ the volume of the r$r$‐parallel set of A$A$), the surface area measures of r$r$‐parallel sets of A$A$ converge weakly to the surface area measure of the r0$r_0$‐parallel set as r→r0$r\rightarrow r_0 ...
Jan Rataj, Steffen Winter
wiley +1 more source

