ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Publication Date: 2014-01-17
    Description: Forests are major components of the global carbon cycle, providing substantial feedback to atmospheric greenhouse gas concentrations. Our ability to understand and predict changes in the forest carbon cycle--particularly net primary productivity and carbon storage--increasingly relies on models that represent biological processes across several scales of biological organization, from tree leaves to forest stands. Yet, despite advances in our understanding of productivity at the scales of leaves and stands, no consensus exists about the nature of productivity at the scale of the individual tree, in part because we lack a broad empirical assessment of whether rates of absolute tree mass growth (and thus carbon accumulation) decrease, remain constant, or increase as trees increase in size and age. Here we present a global analysis of 403 tropical and temperate tree species, showing that for most species mass growth rate increases continuously with tree size. Thus, large, old trees do not act simply as senescent carbon reservoirs but actively fix large amounts of carbon compared to smaller trees; at the extreme, a single big tree can add the same amount of carbon to the forest within a year as is contained in an entire mid-sized tree. The apparent paradoxes of individual tree growth increasing with tree size despite declining leaf-level and stand-level productivity can be explained, respectively, by increases in a tree's total leaf area that outpace declines in productivity per unit of leaf area and, among other factors, age-related reductions in population density. Our results resolve conflicting assumptions about the nature of tree growth, inform efforts to undertand and model forest carbon dynamics, and have additional implications for theories of resource allocation and plant senescence.〈br /〉〈span class="detail_caption"〉Notes: 〈/span〉Stephenson, N L -- Das, A J -- Condit, R -- Russo, S E -- Baker, P J -- Beckman, N G -- Coomes, D A -- Lines, E R -- Morris, W K -- Ruger, N -- Alvarez, E -- Blundo, C -- Bunyavejchewin, S -- Chuyong, G -- Davies, S J -- Duque, A -- Ewango, C N -- Flores, O -- Franklin, J F -- Grau, H R -- Hao, Z -- Harmon, M E -- Hubbell, S P -- Kenfack, D -- Lin, Y -- Makana, J-R -- Malizia, A -- Malizia, L R -- Pabst, R J -- Pongpattananurak, N -- Su, S-H -- Sun, I-F -- Tan, S -- Thomas, D -- van Mantgem, P J -- Wang, X -- Wiser, S K -- Zavala, M A -- England -- Nature. 2014 Mar 6;507(7490):90-3. doi: 10.1038/nature12914. Epub 2014 Jan 15.〈br /〉〈span class="detail_caption"〉Author address: 〈/span〉US Geological Survey, Western Ecological Research Center, Three Rivers, California 93271, USA. ; Smithsonian Tropical Research Institute, Apartado 0843-03092, Balboa, Republic of Panama. ; School of Biological Sciences, University of Nebraska, Lincoln, Nebraska 68588, USA. ; Department of Forest and Ecosystem Science, University of Melbourne, Victoria 3121, Australia. ; 1] School of Biological Sciences, University of Nebraska, Lincoln, Nebraska 68588, USA [2] Mathematical Biosciences Institute, Ohio State University, Columbus, Ohio 43210, USA (N.G.B.); German Centre for Integrative Biodiversity Research (iDiv), Halle-Jena-Leipzig, 04103 Leipzig, Germany (N.R.). ; Department of Plant Sciences, University of Cambridge, Cambridge CB2 3EA, UK. ; Department of Geography, University College London, London WC1E 6BT, UK. ; School of Botany, University of Melbourne, Victoria 3010, Australia. ; 1] Smithsonian Tropical Research Institute, Apartado 0843-03092, Balboa, Republic of Panama [2] Spezielle Botanik und Funktionelle Biodiversitat, Universitat Leipzig, 04103 Leipzig, Germany [3] Mathematical Biosciences Institute, Ohio State University, Columbus, Ohio 43210, USA (N.G.B.); German Centre for Integrative Biodiversity Research (iDiv), Halle-Jena-Leipzig, 04103 Leipzig, Germany (N.R.). ; Jardin Botanico de Medellin, Calle 73, No. 51D-14, Medellin, Colombia. ; Instituto de Ecologia Regional, Universidad Nacional de Tucuman, 4107 Yerba Buena, Tucuman, Argentina. ; Research Office, Department of National Parks, Wildlife and Plant Conservation, Bangkok 10900, Thailand. ; Department of Botany and Plant Physiology, Buea, Southwest Province, Cameroon. ; Smithsonian Institution Global Earth Observatory-Center for Tropical Forest Science, Smithsonian Institution, PO Box 37012, Washington, DC 20013, USA. ; Universidad Nacional de Colombia, Departamento de Ciencias Forestales, Medellin, Colombia. ; Wildlife Conservation Society, Kinshasa/Gombe, Democratic Republic of the Congo. ; Unite Mixte de Recherche-Peuplements Vegetaux et Bioagresseurs en Milieu Tropical, Universite de la Reunion/CIRAD, 97410 Saint Pierre, France. ; School of Environmental and Forest Sciences, University of Washington, Seattle, Washington 98195, USA. ; State Key Laboratory of Forest and Soil Ecology, Institute of Applied Ecology, Chinese Academy of Sciences, Shenyang 110164, China. ; Department of Forest Ecosystems and Society, Oregon State University, Corvallis, Oregon 97331, USA. ; 1] Smithsonian Tropical Research Institute, Apartado 0843-03092, Balboa, Republic of Panama [2] Department of Ecology and Evolutionary Biology, University of California, Los Angeles, California 90095, USA. ; Department of Life Science, Tunghai University, Taichung City 40704, Taiwan. ; Facultad de Ciencias Agrarias, Universidad Nacional de Jujuy, 4600 San Salvador de Jujuy, Argentina. ; Faculty of Forestry, Kasetsart University, ChatuChak Bangkok 10900, Thailand. ; Taiwan Forestry Research Institute, Taipei 10066, Taiwan. ; Department of Natural Resources and Environmental Studies, National Dong Hwa University, Hualien 97401, Taiwan. ; Sarawak Forestry Department, Kuching, Sarawak 93660, Malaysia. ; Department of Botany and Plant Pathology, Oregon State University, Corvallis, Oregon 97331, USA. ; US Geological Survey, Western Ecological Research Center, Arcata, California 95521, USA. ; Landcare Research, PO Box 40, Lincoln 7640, New Zealand. ; Forest Ecology and Restoration Group, Department of Life Sciences, University of Alcala, Alcala de Henares, 28805 Madrid, Spain.〈br /〉〈span class="detail_caption"〉Record origin:〈/span〉 〈a href="http://www.ncbi.nlm.nih.gov/pubmed/24429523" target="_blank"〉PubMed〈/a〉
    Keywords: Aging/metabolism ; Biomass ; *Body Size ; Carbon/*metabolism ; *Carbon Cycle ; Climate ; Geography ; Models, Biological ; Plant Leaves/growth & development/metabolism ; Sample Size ; Species Specificity ; Time Factors ; Trees/*anatomy & histology/classification/growth & development/*metabolism ; Tropical Climate
    Print ISSN: 0028-0836
    Electronic ISSN: 1476-4687
    Topics: Biology , Chemistry and Pharmacology , Medicine , Natural Sciences in General , Physics
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Journal of cryptology 8 (1995), S. 39-64 
    ISSN: 1432-1378
    Keywords: Secret sharing scheme ; Graph access structure ; Linear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper we continue a study of secret sharing schemes for-access structures based on graphs. Given a graph G, we require that a subset of participants can compute a secret key if they contain an edge of G; otherwise, they can obtain no information regarding the key. We study the information rate of such schemes, which measures how much information in being distributed as shares compared with the size of the secret key, and the average information rate, which is the ratio between the secret size and the arithmetic mean of the size of the shares. We give both upper and lower bounds on the optimal information rate and average information rate that can be obtained. Upper bounds arise by applying entropy arguments due to Capocelli et al. [15]. Lower bounds come from constructions that are based on graph decompositions. Application of these constructions requires solving a particular linear programming problem. We prove some general results concerning the information rate and average information rate for paths, cycles, and trees. Also, we study the 30 (connected) graphs on at most five vertices, obtaining exact values for the optimal information rate in 26 of the 30 cases, and for the optimal average information rate in 28 of the 30 cases.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Computational complexity 8 (1999), S. 145-168 
    ISSN: 1420-8954
    Keywords: Keywords. Cryptography, private protocols, randomness, information theory, entropy.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract. We consider the problem of n honest but curious players with private inputs $ x_1,\ldots,x_n, $ who wish to compute the value of a fixed function $ {\cal F}(x_1,\ldots,x_n) $ in such way that at the end of the protocol every player knows the value $ {\cal F}(x_1,\ldots,x_n) $ . Each pair of players is connected by a secure point-to-point communication channel. The players have unbounded computational resources and they intend to compute $ {\cal F} $ in a t-private way. That is, after the execution of the protocol, no coalition of size at most $ t \le n - 1 $ can get any information about the inputs of the remaining players other than what can be deduced from their own inputs and the value of $ \cal F $ .¶ We study the amount of randomness needed in t-private protocols. We prove a lower bound on the randomness complexity of any t-private protocol to compute a function with sensitivity n. As a corollary, we obtain that when the private inputs are uniformly distributed, at least k(n—1)(n—2)/2 random bits are needed to compute the sum modulo 2 k of n k-bit integers in an (n—2)-private way. This result is tight as there are protocols for this problem that use exactly this number of random bits.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Hydrobiologia 176-177 (1989), S. 297-306 
    ISSN: 1573-5117
    Keywords: remobilisation ; nutrients ; organic carbon ; estuarine waters
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology
    Notes: Abstract The processes affecting the in-sea diffusion of nutrients at the Tiber River mouth are strongly dependent on seasonal conditions. In summer, during the low-flow period, a two-layer structure is established and it is then possible to detect the occurrence of biological processes in the lower layer, at the sediment level. During these conditions, the mean concentrations of dissolved organic carbon, inorganic phosphorus and nitrogen increase in the lower saline layer above the theoretical dilution values and, in some cases, the concentrations are double those in the upper layer. During high flow periods, mixing between the river and sea water occurs in the coastal area away from the mouth, with the transport of pollutants being affected mainly by physico-chemical processes. This paper reports the results of surveys of the distribution of soluble and particulate nutrients in the Tiber River estuary, as a function of salinity. The role of biological regeneration processes is inferred from a comparison of the different behaviour of the pollutants in summer and winter.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Designs, codes and cryptography 11 (1997), S. 235-259 
    ISSN: 1573-7586
    Keywords: Secret Sharing Scheme ; Randomness
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we provide upper and lower bounds on the randomness required by the dealer to set up a secret sharing scheme for infinite classes of access structures. Lower bounds are obtained using entropy arguments. Upper bounds derive from a decomposition construction based on combinatorial designs (in particular, t-(v,k,λ) designs). We prove a general result on the randomness needed to construct a scheme for the cycle Cn; when n is odd our bound is tight. We study the access structures on at most four participants and the connected graphs on five vertices, obtaining exact values for the randomness for all them. Also, we analyze the number of random bits required to construct anonymous threshold schemes, giving upper bounds. (Informally, anonymous threshold schemes are schemes in which the secret can be reconstructed without knowledge of which participants hold which shares.)
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Publication Date: 1989-07-01
    Print ISSN: 0018-8158
    Electronic ISSN: 1573-5117
    Topics: Biology
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Publication Date: 2005-01-01
    Print ISSN: 1389-5753
    Electronic ISSN: 1572-9362
    Topics: Economics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Publication Date: 1999-01-01
    Print ISSN: 0010-4620
    Electronic ISSN: 1460-2067
    Topics: Computer Science
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Publication Date: 2003-02-01
    Print ISSN: 0010-4620
    Electronic ISSN: 1460-2067
    Topics: Computer Science
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Publication Date: 2014-01-15
    Print ISSN: 0028-0836
    Electronic ISSN: 1476-4687
    Topics: Biology , Chemistry and Pharmacology , Medicine , Natural Sciences in General , Physics
    Published by Springer Nature
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...