Results 21 to 30 of about 1,464,688 (300)
IEEE Access, 2019 An ultralow profile, dual-wideband and low passive intermodulation (PIM) in-building ceilingmount antenna for long term evolution (LTE) distributed antenna system (DAS) application is presented.
Kok Jiunn Ng +4 more
doaj +1 more source
Absence of epidemic threshold in scale-free networks with connectivity correlations [PDF]
, 2002 Random scale-free networks have the peculiar property of being prone to the spreading of infections. Here we provide an exact result showing that a scale-free connectivity distribution with diverging second moment is a sufficient condition to have null ...
Alessandro Vespignani +5 more
core +2 more sources
Rainbow Connection Number and Connectivity [PDF]
The Electronic Journal of Combinatorics, 2012 The rainbow connection number, $rc(G)$, of a connected graph $G$ is the minimum number of colors needed to color its edges, so that every pair of vertices is connected by at least one path in which no two edges are colored the same. Our main result is that $rc(G)\leq \lceil\frac{n}{2}\rceil$ for any 2-connected graph with at least three vertices.
Li, Xueliang +4 more
openaire +3 more sources
Better than Rician: modelling millimetre wave channels as two-wave with diffuse power
EURASIP Journal on Wireless Communications and Networking, 2019 This contribution provides experimental evidence for the two-wave with diffuse power (TWDP) fading model. We have conducted two indoor millimetre wave measurement campaigns with directive horn antennas at both link ends.
Erich Zöchmann +6 more
doaj +1 more source
Secluded Connectivity Problems [PDF]
, 2012 Consider a setting where possibly sensitive information sent over a path in a network is visible to every {neighbor} of the path, i.e., every neighbor of some node on the path, thus including the nodes on the path itself.
Chechik, Shiri +3 more
core +1 more source
Group connectivity under 3‐edge‐connectivity [PDF]
Journal of Graph Theory, 2020 AbstractLet be two distinct finite Abelian groups with . A fundamental theorem of Tutte shows that a graph admits a nowhere‐zero ‐flow if and only if it admits a nowhere‐zero ‐flow. Jaeger et al in 1992 introduced group connectivity as an extension of flow theory, and they asked whether such a relation holds for group connectivity analogy.
Miaomiao Han +3 more
openaire +3 more sources
The Connectivity and the Harary Index of a Graph [PDF]
, 2012 The Harary index of a graph is defined as the sum of reciprocals of distances between all pairs of vertices of the graph. In this paper we provide an upper bound of the Harary index in terms of the vertex or edge connectivity of a graph.
Das +17 more
core +1 more source
Nature Communications, 2019 Many functions of the human brain are lateralised i.e. associated more strongly with either the left or the right hemisphere of the brain. Here, the authors report the first complete map of functional asymmetries in the human brain, and its relationship ...
Vyacheslav R. Karolis +2 more
doaj +1 more source
Frontiers in Human Neuroscience, 2013 Anatomical, morphological and histological data have consistently shown that the cingulate cortex can be divided into four main regions. However, less is known about parcellations of the cingulate cortex when involved in active tasks.
Diana M.E. Torta +7 more
doaj +1 more source
Comparative measurement of the breakup length of liquid jets in airblast atomisers using optical connectivity, electrical connectivity and shadowgraphy [PDF]
, 2016 A comparative examination of the optical connectivity, electrical connectivity and shadowgraphy techniques for the measurement of the break-up length of atomising liquid jets from a co-axial airblast atomiser is presented.
Charalampous, G +2 more
core +1 more source