Open top chambers and infrared lamps : a comparison of heating efficacy and CO₂/CH₄ dynamics in a Lake Superior coastal peatland

Experimental warming provides a method to determine how an ecosystem will respond to increased temperatures. Northern peatland ecosystems, sensitive to changing climates, provide an excellent setting for experimental warming. Storing great quantities of carbon, northern peatlands play a critical role in regulating global temperatures. Two of the most common methods of experimental warming include open top chambers (OTCs) and infrared (IR) lamps. These warming systems have been used in many ecosystems throughout the world, yet their efficacy to create a warmer environment is variable and has not been widely studied. To date, there has not been a direct, experimentally controlled comparison of OTCs and IR lamps. As a result, a factorial study was implemented to compare the warming efficacy of OTCs and IR lamps and to examine the resulting carbon dioxide (CO2) and methane (CH4) flux rates in a Lake Superior peatland. IR lamps warmed the ecosystem on average by 1-2 #°C, with the majority of warming occurring during nighttime hours. OTC's did not provide any long-term warming above control plots, which is contrary to similar OTC studies at high latitudes. By investigating diurnal heating patterns and micrometeorological variables, we were able to conclude that OTCs were not achieving strong daytime heating peaks and were often cooler than control plots during nighttime hours. Temperate day-length, cloudy and humid conditions, and latent heat loss were factors that inhibited OTC warming. There were no changes in CO2 flux between warming treatments in lawn plots. Gross ecosystem production was significantly greater in IR lamp-hummock plots, while ecosystem respiration was not affected. CH4 flux was not significantly affected by warming treatment. Minimal daytime heating differences, high ambient temperatures, decay resistant substrate, as well as other factors suppressed significant gas flux responses from warming treatments.

Automated design of self-stabilization

Self-stabilization is a property of a distributed system such that, regardless of the legitimacy of its current state, the system behavior shall eventually reach a legitimate state and shall remain legitimate thereafter. The elegance of self-stabilization stems from the fact that it distinguishes distributed systems by a strong fault tolerance property against arbitrary state perturbations. The difficulty of designing and reasoning about self-stabilization has been witnessed by many researchers; most of the existing techniques for the verification and design of self-stabilization are either brute-force, or adopt manual approaches non-amenable to automation. In this dissertation, we first investigate the possibility of automatically designing self-stabilization through global state space exploration. In particular, we develop a set of heuristics for automating the addition of recovery actions to distributed protocols on various network topologies. Our heuristics equally exploit the computational power of a single workstation and the available parallelism on computer clusters. We obtain existing and new stabilizing solutions for classical protocols like maximal matching, ring coloring, mutual exclusion, leader election and agreement. Second, we consider a foundation for local reasoning about self-stabilization; i.e., study the global behavior of the distributed system by exploring the state space of just one of its components. It turns out that local reasoning about deadlocks and livelocks is possible for an interesting class of protocols whose proof of stabilization is otherwise complex. In particular, we provide necessary and sufficient conditions – verifiable in the local state space of every process – for global deadlock- and livelock-freedom of protocols on ring topologies. Local reasoning potentially circumvents two fundamental problems that complicate the automated design and verification of distributed protocols: (1) state explosion and (2) partial state information. Moreover, local proofs of convergence are independent of the number of processes in the network, thereby enabling our assertions about deadlocks and livelocks to apply on rings of arbitrary sizes without worrying about state explosion.