(Table 1) Radiocarbon and OSL ages of sediment cores C1-C5 drilled during the COAST expedition to Cape Mamontov Klyk in April 2005

The palaeoenvironmental development of the western Laptev Sea is understood primarily from investigations of exposed cliffs and surface sediment cores from the shelf. In 2005, a core transect was drilled between the Taymyr Peninsula and the Lena Delta, an area that was part of the westernmost region of the non-glaciated Beringian landmass during the late Quaternary. The transect of five cores, one terrestrial and four marine, taken near Cape Mamontov Klyk reached 12 km offshore and 77 m below sea level. A multiproxy approach combined cryolithological, sedimentological, geochronological (14C-AMS, OSL on quartz, IR-OSL on feldspars) and palaeoecological (pollen, diatoms) methods. Our interpretation of the proxies focuses on landscape history and the transition of terrestrial into subsea permafrost. Marine interglacial deposits overlain by relict terrestrial permafrost within the same offshore core were encountered in the western Laptev Sea. Moreover, the marine interglacial deposits lay unexpectedly deep at 64 m below modern sea level 12 km from the current coastline, while no marine deposits were encountered onshore. This implies that the position of the Eemian coastline presumably was similar to today's. The landscape reconstruction suggests Eemian coastal lagoons and thermokarst lakes, followed by Early to Middle Weichselian fluvially dominated terrestrial deposition. During the Late Weichselian, this fluvial landscape was transformed into a poorly drained accumulation plain, characterized by widespread and broad ice-wedge polygons. Finally, the shelf plain was flooded by the sea during the Holocene, resulting in the inundation and degradation of terrestrial permafrost and its transformation into subsea permafrost.

An approximation method for solving the sofa problem,

"C00-2118-0026."

Diophantus von Alexandrien, über die polygonzahlen. Uebers., mit zusätzen,

Mode of access: Internet.

Über bizentrische Polygone steinersche Kreis und Kugelreihen und die Erfindung der Inversion /

Mode of access: Internet.

Premiers éléments d'une théorie du quadrilatère complet /

Mode of access: Internet.

The Microphysical Structure of Mesoscale Convective Systems

Thesis (Ph.D.)--University of Washington, 2016-05

Do harvest refuges buffer kangaroos against evolutionary responses to selective harvesting?

There is a wealth of literature documenting a directional change of body size in heavily harvested populations. Most of this work concentrates on aquatic systems, but terrestrial populations are equally at risk. This paper explores the capacity of harvest refuges to counteract potential effects of size-selective harvesting on the allele frequency,of populations. We constructed a stochastic, individual-based model parameterized with data on red kangaroos. Because we do not know which part of individual growth would change in the course of natural selection, we explored the effects of two alternative models of individual growth in which alleles affect either the growth rate or the maximum size. The model results show that size-selective harvesting can result in significantly smaller kangaroos for a given age when the entire population is subject to harvesting. In contrast, in scenarios that include dispersal from harvest refuges, the initial allele frequency remains virtually unchanged.

An investigation into effects of long-distance seed dispersal on organelle population genetic structure and colonization rate: a model analysis

A simulation-based modelling approach is used to examine the effects of stratified seed dispersal (representing the distribution of the majority of dispersal around the maternal parent and also rare long-distance dispersal) on the genetic structure of maternally inherited genomes and the colonization rate of expanding plant populations. The model is parameterized to approximate postglacial oak colonization in the UK, but is relevant to plant populations that exhibit stratified seed dispersal. The modelling approach considers the colonization of individual plants over a large area (three 500 km x 10 km rolled transects are used to approximate a 500 km x 300 km area). Our approach shows how the interaction of plant population dynamics with stratified dispersal can result in a spatially patchy haplotype structure. We show that while both colonization speeds and the resulting genetic structure are influenced by the characteristics of the dispersal kernel, they are robust to changes in the periodicity of long-distance events, provided the average number of long-distance dispersal events remains constant. We also consider the effects of additional physical and environmental mechanisms on plant colonization. Results show significant changes in genetic structure when the initial colonization of different haplotypes is staggered over time and when a barrier to colonization is introduced. Environmental influences on survivorship and fecundity affect both the genetic structure and the speed of colonization. The importance of these mechanisms in relation to the postglacial spread and genetic structure of oak in the UK is discussed.

Slowing down a pine invasion despite uncertainty in demography and dispersal

1. Management decisions regarding invasive plants often have to be made quickly and in the face of fragmentary knowledge of their population dynamics. However, recommendations are commonly made on the basis of only a restricted set of parameters. Without addressing uncertainty and variability in model parameters we risk ineffective management, resulting in wasted resources and an escalating problem if early chances to control spread are missed. 2. Using available data for Pinus nigra in ungrazed and grazed grassland and shrubland in New Zealand, we parameterized a stage-structured spread model to calculate invasion wave speed, population growth rate and their sensitivities and elasticities to population parameters. Uncertainty distributions of parameters were used with the model to generate confidence intervals (CI) about the model predictions. 3. Ungrazed grassland environments were most vulnerable to invasion and the highest elasticities and sensitivities of invasion speed were to long-distance dispersal parameters. However, there was overlap between the elasticity and sensitivity CI on juvenile survival, seedling establishment and long-distance dispersal parameters, indicating overlap in their effects on invasion speed. 4. While elasticity of invasion speed to long-distance dispersal was highest in shrubland environments, there was overlap with the CI of elasticity to juvenile survival. In shrubland invasion speed was most sensitive to the probability of establishment, especially when establishment was low. In the grazed environment elasticity and sensitivity of invasion speed to the severity of grazing were consistently highest. Management recommendations based on elasticities and sensitivities depend on the vulnerability of the habitat. 5. Synthesis and applications. Despite considerable uncertainty in demography and dispersal, robust management recommendations emerged from the model. Proportional or absolute reductions in long-distance dispersal, juvenile survival and seedling establishment parameters have the potential to reduce wave speed substantially. Plantations of wind-dispersed invasive conifers should not be sited on exposed sites vulnerable to long-distance dispersal events, and trees in these sites should be removed. Invasion speed can also be reduced by removing seedlings, establishing competitive shrubs and grazing. Incorporating uncertainty into the modelling process increases our confidence in the wide applicability of the management strategies recommended here.

Identification of MIMO Hammerstein systems using cardinal spline functions

A new approach to identify multivariable Hammerstein systems is proposed in this paper. By using cardinal cubic spline functions to model the static nonlinearities, the proposed method is effective in modelling processes with hard and/or coupled nonlinearities. With an appropriate transformation, the nonlinear models are parameterized such that the nonlinear identification problem is converted into a linear one. The persistently exciting condition for the transformed input is derived to ensure the estimates are consistent with the true system. A simulation study is performed to demonstrate the effectiveness of the proposed method compared with the existing approaches based on polynomials. (C) 2006 Elsevier Ltd. All rights reserved.

A general-purpose tunable landscape generator

The research literature on metalieuristic and evolutionary computation has proposed a large number of algorithms for the solution of challenging real-world optimization problems. It is often not possible to study theoretically the performance of these algorithms unless significant assumptions are made on either the algorithm itself or the problems to which it is applied, or both. As a consequence, metalieuristics are typically evaluated empirically using a set of test problems. Unfortunately, relatively little attention has been given to the development of methodologies and tools for the large-scale empirical evaluation and/or comparison of metaheuristics. In this paper, we propose a landscape (test-problem) generator that can be used to generate optimization problem instances for continuous, bound-constrained optimization problems. The landscape generator is parameterized by a small number of parameters, and the values of these parameters have a direct and intuitive interpretation in terms of the geometric features of the landscapes that they produce. An experimental space is defined over algorithms and problems, via a tuple of parameters for any specified algorithm and problem class (here determined by the landscape generator). An experiment is then clearly specified as a point in this space, in a way that is analogous to other areas of experimental algorithmics, and more generally in experimental design. Experimental results are presented, demonstrating the use of the landscape generator. In particular, we analyze some simple, continuous estimation of distribution algorithms, and gain new insights into the behavior of these algorithms using the landscape generator.

Expansion-based algorithms for finding single pair shortest path on surface

Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path planning system, and surface nearest neighbor query in spatial database, etc. Currently, to solve the problem, existing algorithms must traverse the entire polyhedral surface. With the rapid advance in areas like Global Positioning System (CPS), Computer Aided Design (CAD) systems and laser range scanner, surface models axe becoming more and more complex. It is not uncommon that a surface model contains millions of polygons. The single pair shortest path problem is getting harder and harder to solve. Based on the observation that the single pair shortest path is in the locality, we propose in this paper efficient methods by excluding part of the surface model without considering them in the search process. Three novel expansion-based algorithms are proposed, namely, Naive algorithm, Rectangle-based Algorithm and Ellipse-based Algorithm. Each algorithm uses a two-step approach to find the shortest path. (1) compute an initial local path. (2) use the value of this initial path to select a search region, in which the global shortest path exists. The search process terminates once the global optimum criteria are satisfied. By reducing the searching region, the performance is improved dramatically in most cases.

3D statistical shape models to embed spatial relationship information

This paper presents the creation of 3D statistical shape models of the knee bones and their use to embed information into a segmentation system for MRIs of the knee. We propose utilising the strong spatial relationship between the cartilages and the bones in the knee by embedding this information into the created models. This information can then be used to automate the initialisation of segmentation algorithms for the cartilages. The approach used to automatically generate the 3D statistical shape models of the bones is based on the point distribution model optimisation framework of Davies. Our implementation of this scheme uses a parameterized surface extraction algorithm, which is used as the basis for the optimisation scheme that automatically creates the 3D statistical shape models. The current approach is illustrated by generating 3D statistical shape models of the patella, tibia and femoral bones from a segmented database of the knee. The use of these models to embed spatial relationship information to aid in the automation of segmentation algorithms for the cartilages is then illustrated.

On-line learning with adaptive back-propagation in two-layer networks

An adaptive back-propagation algorithm parameterized by an inverse temperature 1/T is studied and compared with gradient descent (standard back-propagation) for on-line learning in two-layer neural networks with an arbitrary number of hidden units. Within a statistical mechanics framework, we analyse these learning algorithms in both the symmetric and the convergence phase for finite learning rates in the case of uncorrelated teachers of similar but arbitrary length T. These analyses show that adaptive back-propagation results generally in faster training by breaking the symmetry between hidden units more efficiently and by providing faster convergence to optimal generalization than gradient descent.

Modeling geometric rules in object based models:an XML / GML approach

Most object-based approaches to Geographical Information Systems (GIS) have concentrated on the representation of geometric properties of objects in terms of fixed geometry. In our road traffic marking application domain we have a requirement to represent the static locations of the road markings but also enforce the associated regulations, which are typically geometric in nature. For example a give way line of a pedestrian crossing in the UK must be within 1100-3000 mm of the edge of the crossing pattern. In previous studies of the application of spatial rules (often called 'business logic') in GIS emphasis has been placed on the representation of topological constraints and data integrity checks. There is very little GIS literature that describes models for geometric rules, although there are some examples in the Computer Aided Design (CAD) literature. This paper introduces some of the ideas from so called variational CAD models to the GIS application domain, and extends these using a Geography Markup Language (GML) based representation. In our application we have an additional requirement; the geometric rules are often changed and vary from country to country so should be represented in a flexible manner. In this paper we describe an elegant solution to the representation of geometric rules, such as requiring lines to be offset from other objects. The method uses a feature-property model embraced in GML 3.1 and extends the possible relationships in feature collections to permit the application of parameterized geometric constraints to sub features. We show the parametric rule model we have developed and discuss the advantage of using simple parametric expressions in the rule base. We discuss the possibilities and limitations of our approach and relate our data model to GML 3.1. © 2006 Springer-Verlag Berlin Heidelberg.