✦ LIBER ✦

Bottom-up and top-down regulation of decomposition in a tropical forest

✍ Scribed by Ysabel Milton; Michael Kaspari

Publisher: Springer-Verlag
Year: 2007
Tongue: English
Weight: 424 KB
Volume: 153
Category: Article
ISSN: 0029-8549
DOI: 10.1007/s00442-007-0710-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Relative strengths of top-down and botto

Relative strengths of top-down and bottom-up forces in a tropical forest community

✍ Lee A. Dyer; Deborah K. Letourneau 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 165 KB

Top-down and bottom-up processes in gras

Top-down and bottom-up processes in grassland and forested streams

✍ Per Nyström; Angus R. McIntosh; Michael J. Winterbourn 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 460 KB

A note on the top-down and bottom-up gra

A note on the top-down and bottom-up gradient functions over a forested site

✍ Weiguo Wang; Kenneth J. Davis; Chuixiang Yi; Edward G. Patton; Martha P. Butler; 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 179 KB

A bottom-up and top-down approach to usi

A bottom-up and top-down approach to using context in text recognition

✍ Radian Shinghal; Godfried T. Toussaint 📂 Article 📅 1979 🏛 Elsevier Science ⚖ 570 KB

Existing approaches to using contextual information in text recognition tend to fall into two categories: dictionary look-up methods and Markov methods. Markov methods use transition probabilities between letters and represent a bottom-up approach to using context which is characterized by being ver

Seasonal variation in top-down and botto

Seasonal variation in top-down and bottom-up processes in a grassland arthropod community

✍ Alison G. Boyer; Robert E. Swearingen; Margo A. Blaha; Christopher T. Fortson; S 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 258 KB

A note on top down and bottom up analysi

A note on top down and bottom up analysis of strongly connected digraphs

✍ G. Chaty; M. Chein 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 124 KB

Knuth proposed to compare his method and those of Luce for studying strongly connected digraphs. Changing Knuth's notation slightly we construct a set of strongly connected digraphs which is equal to the set of the compound circuits defined by Luce. (Let us recall that Luce proved that a minimal str