958 resultados para RADIOISOTOPE GENERATORS
Resumo:
Includes index.
Resumo:
Includes index.
Resumo:
"February 1977."
Resumo:
"15 November 1985."
Resumo:
Includes index.
Resumo:
Includes index.
Resumo:
"5 December 1983."
Resumo:
"20 August 1984."
Resumo:
Includes index.
Resumo:
"22 April 1983."
Resumo:
"BNL 52211."
Resumo:
"No. 76."
Resumo:
To determine the influence of fire and thermokarst in a boreal landscape, we investigated peat cores within and adjacent to a permafrost collapse feature on the Tanana River Floodplain of Interior Alaska. Radioisotope dating, diatom assemblages, plant macrofossils, charcoal fragments, and carbon and nitrogen content of the peat profile indicate ~600 years of vegetation succession with a transition from a terrestrial forest to a sedge-dominated wetland over 100 years ago, and to a Sphagnum-dominated peatland in approximately 1970. The shift from sedge to Sphagnum, and a decrease in the detrended tree-ring width index of black spruce trees adjacent to the collapse coincided with an increase in the growing season temperature record from Fairbanks. This concurrent wetland succession and reduced growth of black spruce trees indicates a step-wise ecosystem-level response to a change in regional climate. In 2001, fire was observed coincident with permafrost collapse and resulted in lateral expansion of the peatland. These observations and the peat profile suggest that future warming and/or increased fire disturbance could promote permafrost degradation, peatland expansion, and increase carbon storage across this landscape; however, the development of drought conditions could reduce the success of both black spruce and Sphagnum, and potentially decrease the long-term ecosystem carbon storage.
Resumo:
Andrews and Curtis conjectured in 1965 that every balanced presentation of the trivial group can be transformed into a standard presentation by a finite sequence of elementary transformations. Recent computational work by Miasnikov and Myasnikov on this problem has been based on genetic algorithms. We show that a computational attack based on a breadth-first search of the tree of equivalent presentations is also viable, and seems to outperform that based on genetic algorithms. It allows us to extract shorter proofs (in some cases, provably shortest) and to consider the length thirteen case for two generators. We prove that, up to equivalence, there is a unique minimum potential counterexample.
Resumo:
Thesis (Master's)--University of Washington, 2016-06