Granulometry and Bulk Geochemistry of Nearshore Sediments, Herschel Island, Yukon Territory, Canada

This dataset contains the results of granulometric and bulk geochemical analyses of Van Veen surface samples obtained by the Alfred Wegener Institute (AWI) in the course of the 2012 and 2013 summer field seasons. The sampling was performed along transects in depths generally <13 m, to a distance of about <5 km off Herschel Island. In 2012, 75 samples in Pauline Cove and in the vicinity of Simpson Point were obtained. Sample collection was expanded in 2013, on transects established the previous year, with additional locations in Tetris Bay and Workboat Passage. Samples consisted of approximately 100 g of the top 3-6 cm of sediment, and were frozen in the field and freeze dried at the AWI before undergoing analytical procedures. Sample locations were recorded with the onboard global positioning system (GPS) unit. Grain size distributions in our study were obtained using laser diffractometry at the AWI (Beckman Coulter LS200) on the <1 mm fraction of samples oxidized with 30% H2O2 until effervescence ceased to remove organics. Some samples were also sieved using a sieve stack with 1 phi intervals. GRADISTAT (Blott and Pye, 2001) was used to calculate graphical grain size statistics (Folk and Ward, 1957). Grain diameters were logarithmically transformed to phi values, calculated as phi=-log2d, where d is the grain diameter in millimeters (Blott and Pye, 2001; Krumbein, 1934). Freeze dried samples were ground and ground using an Elemetar Vario EL III carbon-nitrogen-sulphur analyzer at the AWI to measure total carbon (TC) and total nitrogen (TN). Tungsten oxide was added to the samples as a catalyst to the pyrolysis. Following this analysis, total organic carbon (TOC) was determined using an Elementar VarioMax. Stable carbon isotope ratios of 13C/12C of 118 samples were determined on a DELTAplusXL mass spectrometer (ThermoFisher Scientific, Bremen) at the German Research Centre for Geosciences (GFZ) in Potsdam, Germany . An additional analysis on 69 samples was carried out at the University of Hamburg with an isotope ratio mass spectrometer (Delta V, Thermo Scientific, Germany) coupled to an elemental analyzer (Flash 2000, Thermo Scientific, Germany). Prior to analysis, soil samples were treated with phosphoric acid (43%) to release inorganic carbon. Values are expressed relative to Vienna Peedee belemnite (VPDB) using external standards (USGS40, -26.4 per mil VPDB and IVA soil 33802153, -27.5 per mil VPDB).

Accumulation rate and stable oxygen isotope ratios of the ice cores from the North Greenland Traverse

We present for the first time all 12 d18O records obtained from ice cores drilled in the framework of the North Greenland Traverse (NGT) between 1993 and 1995 in northern Greenland. The cores cover an area of 680 km × 317 km, 10 % of the Greenland ice sheet. Depending on core length (100-175 m) and accumulation rate (90-200 kg/m**2/a) the single records reflect an isotope-temperature history over the last 500-1100 years. Lowest d18O mean values occur north of the summit and east of the main divide as a consequence of Greenland's topography. In general, ice cores drilled on the main ice divide show different results than those drilled east of the main ice divide that might be influenced by secondary regional moisture sources. A stack of all NGT records and the NGRIP record is presented with improved signal-to-noise ratio. Compared to single records, this stack represents the mean d18O signal for northern Greenland that is interpreted as proxy for temperature. Our northern Greenland d18O stack indicates distinctly enriched d18O values during medieval times, about AD 1420 ± 20 and from AD 1870 onwards. The period between AD 1420 and AD 1850 has depleted d18O values compared to the average for the entire millennium and represents the Little Ice Age. The d18O values of the 20th century are comparable to the medieval period but are lower than that about AD 1420.

Extreme ultraviolet detection using AlGaN-on-Si inverted Schottky photodiodes

We report on the fabrication of aluminum gallium nitride (AlGaN) Schottky diodes for extreme ultraviolet (EUV) detection. AlGaN layers were grown on silicon wafers by molecular beam epitaxy with the conventional and inverted Schottky structure, where the undoped, active layer was grown before or after the n-doped layer, respectively. Different current mechanisms were observed in the two structures. The inverted Schottky diode was designed for the optimized backside sensitivity in the hybrid imagers. A cut-off wavelength of 280 nm was observed with three orders of magnitude intrinsic rejection ratio of the visible radiation. Furthermore, the inverted structure was characterized using a EUV source based on helium discharge and an open electrode design was used to improve the sensitivity. The characteristic He I and He II emission lines were observed at the wavelengths of 58.4 nm and 30.4 nm, respectively, proving the feasibility of using the inverted layer stack for EUV detection

Parallelizing irregular and pointer-based computations automatically: perspectives from logic and constraint programming

Irregular computations pose sorne of the most interesting and challenging problems in automatic parallelization. Irregularity appears in certain kinds of numerical problems and is pervasive in symbolic applications. Such computations often use dynamic data structures, which make heavy use of pointers. This complicates all the steps of a parallelizing compiler, from independence detection to task partitioning and placement. Starting in the mid 80s there has been significant progress in the development of parallelizing compilers for logic pro­gramming (and more recently, constraint programming) resulting in quite capable paralle­lizers. The typical applications of these paradigms frequently involve irregular computations, and make heavy use of dynamic data structures with pointers, since logical variables represent in practice a well-behaved form of pointers. This arguably makes the techniques used in these compilers potentially interesting. In this paper, we introduce in a tutoríal way, sorne of the problems faced by parallelizing compilers for logic and constraint programs and provide pointers to sorne of the significant progress made in the area. In particular, this work has resulted in a series of achievements in the areas of inter-procedural pointer aliasing analysis for independence detection, cost models and cost analysis, cactus-stack memory management, techniques for managing speculative and irregular computations through task granularity control and dynamic task allocation such as work-stealing schedulers), etc.

Efficient local unfolding with ancestor stacks

The most successful unfolding rules used nowadays in the partial evaluation of logic programs are based on well quasi orders (wqo) applied over (covering) ancestors, i.e., a subsequence of the atoms selected during a derivation. Ancestor (sub)sequences are used to increase the specialization power of unfolding while still guaranteeing termination and also to reduce the number of atoms for which the wqo has to be checked. Unfortunately, maintaining the structure of the ancestor relation during unfolding introduces significant overhead. We propose an efficient, practical local unfolding rule based on the notion of covering ancestors which can be used in combination with a wqo and allows a stack-based implementation without losing any opportunities for specialization. Using our technique, certain non-leftmost unfoldings are allowed as long as local unfolding is performed, i.e., we cover depth-first strategies. To deal with practical programs, we propose assertion-based techniques which allow our approach to treat programs that include (Prolog) built-ins and external predicates in a very extensible manner, for the case of leftmost unfolding. Finally, we report on our mplementation of these techniques embedded in a practical partial evaluator, which shows that our techniques, in addition to dealing with practical programs, are also significantly more efficient in time and somewhat more efficient in memory than traditional tree-based implementations. To appear in Theory and Practice of Logic Programming (TPLP).

Efficient local unfolding with ancestor stacks for full prolog

The integration of powerful partial evaluation methods into practical compilers for logic programs is still far from reality. This is related both to 1) efficiency issues and to 2) the complications of dealing with practical programs. Regarding efnciency, the most successful unfolding rules used nowadays are based on structural orders applied over (covering) ancestors, i.e., a subsequence of the atoms selected during a derivation. Unfortunately, maintaining the structure of the ancestor relation during unfolding introduces significant overhead. We propose an efficient, practical local unfolding rule based on the notion of covering ancestors which can be used in combination with any structural order and allows a stack-based implementation without losing any opportunities for specialization. Regarding the second issue, we propose assertion-based techniques which allow our approach to deal with real programs that include (Prolog) built-ins and external predicates in a very extensible manner. Finally, we report on our implementation of these techniques in a practical partial evaluator, embedded in a state of the art compiler which uses global analysis extensively (the Ciao compiler and, specifically, its preprocessor CiaoPP). The performance analysis of the resulting system shows that our techniques, in addition to dealing with practical programs, are also significantly more efficient in time and somewhat more efficient in memory than traditional tree-based implementations.

ACE: And/or-parallel copying-based execution of logic programs

In this paper we present a novel execution model for parallel implementation of logic programs which is capable of exploiting both independent and-parallelism and or-parallelism in an efficient way. This model extends the stack copying approach, which has been successfully applied in the Muse system to implement or-parallelism, by integrating it with proven techniques used to support independent and-parallelism. We show how all solutions to non-deterministic andparallel goals are found without repetitions. This is done through recomputation as in Prolog (and in various and-parallel systems, like &-Prolog and DDAS), i.e., solutions of and-parallel goals are not shared. We propose a scheme for the efficient management of the address space in a way that is compatible with the apparently incompatible requirements of both and- and or-parallelism. We also show how the full Prolog language, with all its extra-logical features, can be supported in our and-or parallel system so that its sequential semantics is preserved. The resulting system retains the advantages of both purely or-parallel systems as well as purely and-parallel systems. The stack copying scheme together with our proposed memory management scheme can also be used to implement models that combine dependent and-parallelism and or-parallelism, such as Andorra and Prometheus.

Relating goal scheduling, precedence, and memory management in and-parallel execution of logic programs

The interactions among three important issues involved in the implementation of logic programs in parallel (goal scheduling, precedence, and memory management) are discussed. A simplified, parallel memory management model and an efficient, load-balancing goal scheduling strategy are presented. It is shown how, for systems which support "don't know" non-determinism, special care has to be taken during goal scheduling if the space recovery characteristics of sequential systems are to be preserved. A solution based on selecting only "newer" goals for execution is described, and an algorithm is proposed for efficiently maintaining and determining precedence relationships and variable ages across parallel goals. It is argued that the proposed schemes and algorithms make it possible to extend the storage performance of sequential systems to parallel execution without the considerable overhead previously associated with it. The results are applicable to a wide class of parallel and coroutining systems, and they represent an efficient alternative to "all heap" or "spaghetti stack" allocation models.