Resource partitioning in sympatric delphinids: Space use and habitat preferences of Australian snubfin and Indo-Pacific humpback dolphins

1. Many species of delphinids co-occur in space and time. However, little is known of their ecological interactions and the underlying mechanisms that mediate their coexistence. 2. Snubfin Orcaella heinsohni, and Indo-Pacific humpback dolphins Sousa chinensis, live in sympatry throughout most of their range in Australian waters. I conducted boat-based surveys in Cleveland Bay, north-east Queensland, to collect data on the space and habitat use of both species. Using Geographic Information Systems, kernel methods and Euclidean distances I investigated interspecific differences in their space use patterns, behaviour and habitat preferences. 3. Core areas of use (50% kernel range) for both species were located close to river mouths and modified habitat such as dredged channels and breakwaters close to the Port of Townsville. Foraging and travelling activities were the dominant behavioural activities of snubfin and humpback dolphins within and outside their core areas. 4. Their representative ranges (95% kernel range) overlapped considerably, with shared areas showing strong concordance in the space use by both species. Nevertheless, snubfin dolphins preferred slightly shallower (1-2 m) waters than humpback dolphins (2-5 m). Additionally, shallow areas with seagrass ranked high in the habitat preferences of snubfin dolphins, whereas humpback dolphins favoured dredged channels. 5. Slight differences in habitat preferences appear to be one of the principal factors maintaining the coexistence of snubfin and humpback dolphins. I suggest diet partitioning and interspecific aggression as the major forces determining habitat selection in these sympatric species.

Partitioning of deformation within a subduction channel during exhumation of high-pressure rocks: a case study from the Western Alps

The metamorphic belt of the Western Alps was subjected to widespread extensional tectonism at the end of the Eocene (ca. 45-35 Ma). Extension was accommodated by hinterland-directed movements along gently inclined extensional shear zones, which facilitated rapid exhumation of high-pressure and ultra-high-pressure rocks. This deformation resulted in a normal metamorphic sequence. Extension in the inner parts of the Western Alps was coeval with shortening at the front of the belt (foreland-directed thrusts), which took place during decompression, and emplaced higher grade metamorphic units over lower grade metamorphic rocks, thus forming an inverse metamorphic sequence. Two mechanisms for this extensional episode are discussed: (1) collapse of an overthickened lithosphere, and (2) internal readjustments within the orogenic wedge due to subduction channel dynamics. We favour the latter mechanism because it can account for the development of the observed inverse and normal metamorphic sequences along foreland-directed thrusts and hinterland-directed detachments, respectively. This hypothesis is supported by published structural, metamorphic and geochronological data from four geological transects through the Western Alps. This study also emphasizes the importance of post-shearing deformation (e.g. horizontal buckling versus vertical flattening), which can modify the distribution of hinterland- and foreland-directed shear zones in orogenic belts. (c) 2006 Elsevier Ltd. All rights reserved.

Improvements in the data partitioning approach for frequent itemsets mining

Frequent Itemsets mining is well explored for various data types, and its computational complexity is well understood. There are methods to deal effectively with computational problems. This paper shows another approach to further performance enhancements of frequent items sets computation. We have made a series of observations that led us to inventing data pre-processing methods such that the final step of the Partition algorithm, where a combination of all local candidate sets must be processed, is executed on substantially smaller input data. The paper shows results from several experiments that confirmed our general and formally presented observations.

A graphical specification of model transformations with triple graph grammars

Models and model transformations are the core concepts of OMG's MDA (TM) approach. Within this approach, most models are derived from the MOF and have a graph-based nature. In contrast, most of the current model transformations are specified textually. To enable a graphical specification of model transformation rules, this paper proposes to use triple graph grammars as declarative specification formalism. These triple graph grammars can be specified within the FUJABA tool and we argue that these rules can be more easily specified and they become more understandable and maintainable. To show the practicability of our approach, we present how to generate Tefkat rules from triple graph grammar rules, which helps to integrate triple graph grammars with a state of a art model transformation tool and shows the expressiveness of the concept.

An efficient algorithm for partitioning parameterized polygons into rectangles

In this paper, we propose an algorithm for partitioning parameterized orthogonal polygons into rectangles. The algorithm is based on the plane-sweep technique and can be used for partitioning polygons which contain holes. The input to the algorithm consists of the contour of a parameterized polygon to be partitioned and the constraints for those parameters which reside in the contour. The algorithm uses horizontal cuts only and generates a minimum number of rectangles whose union is the original orthogonal polygon. The proposed algorithm can be used as the basis to build corner stitching data structure for parameterized VLSI layouts and has been implemented in Java programming language. Copyright © 2010 ACM, Inc.