SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Gilbert A.) srt2:(2000-2004)"

Sökning: WFRF:(Gilbert A.) > (2000-2004)

  • Resultat 1-10 av 14
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  •  
2.
  •  
3.
  •  
4.
  •  
5.
  • Krebs, C. J., et al. (författare)
  • Synchrony in lemming and vole populations in the Canadian Arctic
  • 2002
  • Ingår i: Canadian Journal of Zoology-Revue Canadienne De Zoologie. ; 80:8, s. 1323-1333
  • Tidskriftsartikel (refereegranskat)abstract
    • Population fluctuations may occur in synchrony among several rodent species at a given site, and they may occur in synchrony over large geographical areas. We summarize information on synchrony in lemmings and voles from the Canadian Arctic for the past 20 years. The most detailed available information is from the central Canadian Arctic, where snap-trap samples have been taken annually at several sites for periods of up to 15 years. Geographical synchrony in the same species among different sites was strong, especially for the central and eastern Canadian Arctic. Synchrony among different species at a given site was also generally high. When one species is at high density, densities of all species at that site tend to be high. These results do not easily fit the mobile-predator hypothesis proposed to explain regional synchrony, and are more consistent with the weather hypothesis, which we suggest both entrains synchrony among sites and enforces synchrony among species within a site. We tentatively support the weather hypothesis for geographical synchrony in lemmings, and recommend the establishment of a circumpolar program to monitor lemming cycles and predator movements that would advance our understanding of these large-scale patterns of cyclic synchrony.
  •  
6.
  •  
7.
  •  
8.
  •  
9.
  •  
10.
  • Dolev, Shlomi, et al. (författare)
  • Virtual Mobile Nodes for Mobile Ad Hoc Networks
  • 2004
  • Rapport (övrigt vetenskapligt/konstnärligt)abstract
    • One of the most significant challenges introduced by mobile networks is the difficulty in coping with the unpredictable movement of mobile nodes. If, instead, the mobile nodes could be programmed to travel through the world in a predictable and useful manner, the task of designing algorithms for mobile networks would be significantly simplified. Alas, users of mobile devices in the real world are not amenable to following instructions as to where their devices may travel. While real mobile nodes may be disinclined to move as desired, we propose executing algorithms on virtual mobile nodes that move in a predetermined, predictable, manner through the real world. In this paper, we define the Virtual Mobile Node Abstraction, and present selected algorithms that take advantage of virtual mobile nodes to simply and efficiently perform complicated tasks in highly dynamic, unpredictable mobile ad hoc networks. We then present the Mobile Point Emulator, a new algorithm that implements robust virtual mobile nodes. This algorithm replicates the virtual node at a constantly changing set of real nodes, choosing new replicas as the real nodes move in and out of the path of the virtual node. We claim that the Mobile Point algorithm correctly implements a virtual mobile node, and that it is robust as long as the virtual node travels through well-populated areas of the network.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 14

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy