Pilgrimstad revisited - a multi-proxy reconstruction of Early/Middle Weichselian climate and environment at a key site in central Sweden

The site Pilgrimstad in central Sweden has often been cited as a key locality for discussions of ice-free/ice-covered intervals during the Early and Middle Weichselian. Multi-proxy investigations of a recently excavated section at Pilgrimstad now provide a revised picture of the climatic and environmental development between similar to 80 and 36 ka ago. The combination of sedimentology, geochemistry, OSL and 14C dating, and macrofossil, siliceous microfossil and chironomid analyses shows: (i) a lower succession of glaciofluvial/fluvial, lacustrine and glaciolacustrine sediments; (ii) an upper lacustrine sediment sequence; and (iii) Last Glacial Maximum till cover. Microfossils in the upper lacustrine sediments are initially characteristic for oligo- to mesotrophic lakes, and macrofossils indicate arctic/sub-arctic environments and mean July temperatures > 8 degrees C. These conditions were, however, followed by a return to a low-nutrient lake and a cold and dry climate. The sequence contains several hiatuses, as shown by the often sharp contacts between individual units, which suggests that ice-free intervals alternated with possible ice advances during certain parts of the Early and Middle Weichselian.

Core-based Methodology: An Automated Approach for Implementing a Complete System From Algorithms to a Heterogeneous Network Including FPGAs

In this paper, we present a methodology for implementing a complete Digital Signal Processing (DSP) system onto a heterogeneous network including Field Programmable Gate Arrays (FPGAs) automatically. The methodology aims to allow design refinement and real time verification at the system level. The DSP application is constructed in the form of a Data Flow Graph (DFG) which provides an entry point to the methodology. The netlist for parts that are mapped onto the FPGA(s) together with the corresponding software and hardware Application Protocol Interface (API) are also generated. Using a set of case studies, we demonstrate that the design and development time can be significantly reduced using the methodology developed.

Examining the uncertainties in a 'tuned and stacked' peatland water table reconstruction

Tuning and stacking approaches have been used to compile non-annually resolved peatland palaeo-water table records in several studies. This approach has been proposed as a potential way forward to overcome the chronological problems that beset the correlation of records and may help in the upscaling of palaeoclimate records for climate model-data comparisons. This paper investigates the uncertainties in this approach using a published water table compilation from Northern Ireland. Firstly, three plausible combinations of chronological match points are used to assess the variability of the reconstructions. It is apparent that even with markedly different match point combinations, the compilations are highly similar, especially when a 100-year running mean line is used for interpretation. Secondly, sample-specific reconstruction errors are scaled in relation to the standardised water table units and illustrated on the compiled reconstruction. Thirdly, the total chronological errors for each reconstruction are calculated using Bayesian age-modelling software. Although tuning and stacking approaches may be suitable for compiling peat-based palaeoclimate records, it is important that the reconstruction and chronological errors are acknowledged and clearly illustrated in future studies. The tuning of peat-based proxy climate records is based on a potentially flawed assumption that events are synchronous between sites. © 2011 Elsevier Ltd and INQUA.

Semiring induced valuation algebras: Exact and approximate local computation algorithms

Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra.There are many models of this algebraic structure ranging from probability theory to numerical analysis, relational databases and various classical and non-classical logics. It turns out that many interesting models of valuation algebras may be derived from semiring valued mappings. In this paper we study how valuation algebras are induced by semirings and how the structure of the valuation algebra is related to the algebraic structure of the semiring. In particular, c-semirings with idempotent multiplication induce idempotent valuation algebras and therefore permit particularly efficient architectures for local computation. Also important are semirings whose multiplicative semigroup is embedded in a union of groups. They induce valuation algebras with a partially defined division. For these valuation algebras, the well-known architectures for Bayesian networks apply. We also extend the general computational framework to allow derivation of bounds and approximations, for when exact computation is not feasible.