Results 1 to 10 of about 2,132,960 (297)
Assessing sense of community at farmers markets
Farmers markets are valuable for reducing food insecurity and delivering healthy food options to populations living with low incomes. However, farmers markets have developed a reputation for being exclusive shopping spaces devoted to affluent, white ...
Jennifer Russomanno +1 more
doaj +1 more source
On the extremal connective eccentricity index among trees with maximum degree [PDF]
The connective eccentricity index (CEI) of a graph $G$ is defined as $\xi^{ce}(G)=\sum_{v \in V(G)}\frac{d_G(v)}{\varepsilon_G(v)}$, where $d_G(v)$ is the degree of $v$ and $\varepsilon_G(v)$ is the eccentricity of $v$. In this paper, we characterize the
Fazal Hayat
doaj +1 more source
Taxonium, a web-based tool for exploring large phylogenetic trees
The COVID-19 pandemic has resulted in a step change in the scale of sequencing data, with more genomes of SARS-CoV-2 having been sequenced than any other organism on earth.
Theo Sanderson
doaj +1 more source
AUTOMATION OF QURANIC READINGS GATHERING PROCESS
Quran has been the focus of many computer science and computational linguistics researchers. However, little contribution was directed towards Quranic readings. This field focuses on the different ways in which Quranic words can be recited.
Majed AbuSafiya
doaj +1 more source
RNA-guided transposases: the successors to CRISPR [PDF]
CRISPR undoubtedly transformed genome editing, but it left two crucial problems unsolved. Cas nucleases cut the chromosome and leave the cell to repair the break, an error-prone process that is inefficient for installing new DNA, and Cas9 is large ...
Christopher Jin, Jai Tree
doaj +1 more source
A Complete Characterisation of Vertex-multiplications of Trees with Diameter 5
For a connected graph $G$, let $\mathscr{D}(G)$ be the family of strong orientations of $G$; and for any $D\in\mathscr{D}(G)$, we denote by $d(D)$ the diameter of $D$. The $\textit{orientation number}$ of $G$ is defined as $\bar{d}(G)=\min\{d(D)\mid D\in
Willie Wong, Eng Guan Tay
doaj +1 more source
Conflict-Free Vertex-Connections of Graphs
A path in a vertex-colored graph is called conflict-free if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be conflict-free vertex-connected if any two vertices of the graph are connected by a conflict-free path ...
Li Xueliang +5 more
doaj +1 more source
Auto-Configuration of ACL Policy in Case of Topology Change in Hybrid SDN
Software-defined networking (SDN) has emerged as a new network architecture, which decouples both the control and management planes from data plane at forwarding devices.
Rashid Amin +3 more
doaj +1 more source
On the Distance Spectral Radius of Trees with Given Degree Sequence
We consider the problem of maximizing the distance spectral radius and a slight generalization thereof among all trees with some prescribed degree sequence.
Dadedzi Kenneth +2 more
doaj +1 more source
Singing Trees. Note su Tōru Takemitsu
The article examines the relationship between Western and Eastern aesthetics, analyzing some aspects of the musical production of Tōru Takemitsu, the great Japanese composer, now firmly included in the contemporary music “Western Canon”.
Pier Alberto, Porceddu Cilione
doaj +1 more source

