Inferring macro‐ecological patterns from local presence/absence data
نویسندگان
چکیده
منابع مشابه
Anurans from a local assemblage in central Brazil: linking local processes with macroecological patterns.
Macroecological variables of Anuran species found in a local assemblage from Central Brazil (Silvânia, Goiás State) were linked to population dyamics statistics of these species. Geographical range size (GRS), body size, and species' midpoints were the macroecological variables investigated for those species found in the local assemblage and for all other species (105 in the total) found in the...
متن کاملInferring consistent functional interaction patterns from natural stimulus FMRI data
There has been increasing interest in how the human brain responds to natural stimulus such as video watching in the neuroimaging field. Along this direction, this paper presents our effort in inferring consistent and reproducible functional interaction patterns under natural stimulus of video watching among known functional brain regions identified by task-based fMRI. Then, we applied and comp...
متن کاملInferring Cortical Variability from Local Field Potentials.
UNLABELLED The responses of sensory neurons can be quite different to repeated presentations of the same stimulus. Here, we demonstrate a direct link between the trial-to-trial variability of cortical neuron responses and network activity that is reflected in local field potentials (LFPs). Spikes and LFPs were recorded with a multielectrode array from the middle temporal (MT) area of the visual...
متن کاملInferring spike trains from local field potentials.
We investigated whether it is possible to infer spike trains solely on the basis of the underlying local field potentials (LFPs). Using support vector machines and linear regression models, we found that in the primary visual cortex (V1) of monkeys, spikes can indeed be inferred from LFPs, at least with moderate success. Although there is a considerable degree of variation across electrodes, th...
متن کاملInferring Ordered Trees from Local Constraints
We consider a problem of inferring an ordered tree from a set of local constraints on its leaves which we term as the ordered local consensus tree problem. Using our eecient decremental interval union algorithm, we show that the ordered local consensus tree problem for m constraints on n leaves can be deterministically solved in time O((m+n) log n): We also show that the related optimization pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Oikos
سال: 2019
ISSN: 0030-1299,1600-0706
DOI: 10.1111/oik.06754