Inventory of ammonia emissions from UK agriculture 2009

The National Ammonia Reduction Strategy Evaluation System (NARSES) model (spreadsheet version) was used to estimate ammonia (NH3) emissions from UK agriculture for the year 2009. Year-specific livestock numbers and fertiliser N use were added for 2009 and revised for previous years. The estimate for 2009 was 231.8 kt NH3, representing a 2.3 kt increase from the previously submitted estimate for 2008. Backward and forward projections using the 2009 model structure gave estimates of 317, 245 and 244 kt NH3 for the years 1990, 2010 and 2020, respectively. This inventory reports emission from livestock agriculture and from nitrogen fertilisers applied to agricultural land. There are a number of other minor sources reported as ‘agriculture’ in the total UK emission inventory, including horses not kept on agricultural holdings, emissions from composting and domestic fertiliser use

Controlled Growth, Patterning and Placement of Carbon Nanotube Thin Films

Controlled growth, patterning and placement of carbon nanotube (CNT) thin films for electronic applications are demonstrated. The density of CNT films is controlled by optimizing the feed gas composition as well as the concentration of growth catalyst in a chemical vapor deposition process. Densities of CNTs ranging from 0.02 CNTs/{\mu}m^2 to 1.29 CNTs/{\mu}m^2 are obtained. The resulting pristine CNT thin films are then successfully patterned using either pre-growth or post-growth techniques. By developing a layered photoresist process that is compatible with ferric nitrate catalyst, significant improvements over popular pre-growth patterning methods are obtained. Limitations of traditional post-growth patterning methods are circumvented by selective transfer printing of CNTs with either thermoplastic or metallic stamps. Resulting as-grown patterns of CNT thin films have edge roughness (< 1 {\mu}m) and resolution (< 5 {\mu}m) comparable to standard photolithography. Bottom gate CNT thin film devices are fabricated with field-effect mobilities up to 20 cm^2/Vs and on/off ratios of the order of 10^3. The patterning and transfer printing methods discussed here have a potential to be generalized to include other nanomaterials in new device configurations

Mid-Miocene cooling and the extinction of tundra in continental Antarctica

A major obstacle in understanding the evolution of Cenozoic climate has been the lack of well dated terrestrial evidence from high-latitude, glaciated regions. Here, we report the discovery of exceptionally well preserved fossils of lacustrine and terrestrial organisms from the McMurdo Dry Valleys sector of the Transantarctic Mountains for which we have established a precise radiometric chronology. The fossils, which include diatoms, palynomorphs, mosses, ostracodes, and insects, represent the last vestige of a tundra community that inhabited the mountains before stepped cooling that first brought a full polar climate to Antarctica. Paleoecological analyses, 40Ar/39Ar analyses of associated ash fall, and climate inferences from glaciological modeling together suggest that mean summer temperatures in the region cooled by at least 8°C between 14.07 ± 0.05 Ma and 13.85 ± 0.03 Ma. These results provide novel constraints for the timing and amplitude of middle-Miocene cooling in Antarctica and reveal the ecological legacy of this global climate transition

On rr-Simple kk-Path

An $r$-simple $k$-path is a {path} in the graph of length $k$ that passes through each vertex at most $r$ times. The $r$-SIMPLE $k$-PATH problem, given a graph $G$ as input, asks whether there exists an $r$-simple $k$-path in $G$. We first show that this problem is NP-Complete. We then show that there is a graph $G$ that contains an $r$-simple $k$-path and no simple path of length greater than $4\log k/\log r$. So this, in a sense, motivates this problem especially when one's goal is to find a short path that visits many vertices in the graph while bounding the number of visits at each vertex. We then give a randomized algorithm that runs in time $$\mathrm{poly}(n)\cdot 2^{O( k\cdot \log r/r)}$$ that solves the $r$-SIMPLE $k$-PATH on a graph with $n$ vertices with one-sided error. We also show that a randomized algorithm with running time $\mathrm{poly}(n)\cdot 2^{(c/2)k/ r}$ with $c<1$ gives a randomized algorithm with running time \poly(n)\cdot 2^{cn} for the Hamiltonian path problem in a directed graph - an outstanding open problem. So in a sense our algorithm is optimal up to an $O(\log r)$ factor