On Volterra and D'Ancona's footsteps: The temporal and spatial complexity of ecological interactions and networks1

2009 ◽  
Vol 76 (1) ◽  
pp. 3-15 ◽  
Author(s):  
M. Gatto
2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Jose Navar ◽  
F. de Jesus Rodriguez-Flores ◽  
Pedro A. Dominguez-Calleros ◽  
Gustavo Perez-Verdin

This research examines the diversity-productivity relationship in a semiarid scrubland, initially under late successional conditions and subsequently under early successional conditions created by experimental clearing, to explore the roles that productivity and stochastic mortality play in species exclusion in this environment. A total of fifteen plots were studied by measuring environmental conditions and biomass components of shrubs and seedlings. These stands were distributed along a productivity gradient across five different landforms. A hypothesis about the stochastic self-thinning mortality model along the gradient was evaluated with the diversity-productivity-environment data. The diversity-productivity relationship was linear and reversed between the early and late succession stages. The hypothesis of stochastic mortality of species exclusion was rejected in the early stages of succession and partially accepted in the mature stage of succession. Species exclusion was negatively related to productivity gradients, suggesting that strong interspecific competition occurs in high productivity plots and that a larger number of species can survive in higher abiotic stress landscapes. Further research is needed to understand the temporal and spatial variations of the ecological interactions that shape this plant community.


2015 ◽  
Vol 123 (1-2) ◽  
pp. 321-333 ◽  
Author(s):  
Jianhua Xu ◽  
Yaning Chen ◽  
Weihong Li ◽  
Zuhan Liu ◽  
Jie Tang ◽  
...  

2012 ◽  
Vol 85 (3) ◽  
pp. 219-230 ◽  
Author(s):  
Zachary Ross Stahlschmidt ◽  
Richard Shine ◽  
Dale F. DeNardo

2014 ◽  
Vol 24 (6) ◽  
Author(s):  
Evgeniy M. Perper

AbstractWe consider the problem of substring search in a set of strings. The problem is the following: given a set of strings and an arbitrary substring, list all strings from the set that contain this substring.We describe search algorithms and obtain lower bounds for the running time and for the memory volume required by the fastest algorithms


2010 ◽  
Vol 168-169 ◽  
pp. 105-108
Author(s):  
V.V. Zverev ◽  
G.A. Usachev

We consider unstable motion in small magnetic particles, driven by an external magnetic field and influenced by thermal fluctuations. Our studies demonstrate both temporal and spatial complexity of the dynamics in this system. The results are obtained using numerical simulations of the Landau-Lifshitz-Gilbert equations.


Sign in / Sign up

Export Citation Format

Share Document