Estimating Lorenz's reference state in an ocean with a nonlinear equation of state for seawater

The study of the mechanical energy budget of the oceans using Lorenz available potential energy (APE) theory is based on knowledge of the adiabatically re-arranged Lorenz reference state of minimum potential energy. The compressible and nonlinear character of the equation of state for seawater has been thought to cause the reference state to be ill-defined, casting doubt on the usefulness of APE theory for investigating ocean energetics under realistic conditions. Using a method based on the volume frequency distribution of parcels as a function of temperature and salinity in the context of the seawater Boussinesq approximation, which we illustrate using climatological data, we show that compressibility effects are in fact minor. The reference state can be regarded as a well defined one-dimensional function of depth, which forms a surface in temperature, salinity and density space between the surface and the bottom of the ocean. For a very small proportion of water masses, this surface can be multivalued and water parcels can have up to two statically stable levels in the reference density profile, of which the shallowest is energetically more accessible. Classifying parcels from the surface to the bottom gives a different reference density profile than classifying in the opposite direction. However, this difference is negligible. We show that the reference state obtained by standard sorting methods is equivalent, though computationally more expensive, to the volume frequency distribution approach. The approach we present can be applied systematically and in a computationally efficient manner to investigate the APE budget of the ocean circulation using models or climatological data.

A benchmark-driven modelling approach for evaluating deployment choices on a multi-core architecture

The complexity of current and emerging architectures provides users with options about how best to use the available resources, but makes predicting performance challenging. In this work a benchmark-driven model is developed for a simple shallow water code on a Cray XE6 system, to explore how deployment choices such as domain decomposition and core affinity affect performance. The resource sharing present in modern multi-core architectures adds various levels of heterogeneity to the system. Shared resources often includes cache, memory, network controllers and in some cases floating point units (as in the AMD Bulldozer), which mean that the access time depends on the mapping of application tasks, and the core's location within the system. Heterogeneity further increases with the use of hardware-accelerators such as GPUs and the Intel Xeon Phi, where many specialist cores are attached to general-purpose cores. This trend for shared resources and non-uniform cores is expected to continue into the exascale era. The complexity of these systems means that various runtime scenarios are possible, and it has been found that under-populating nodes, altering the domain decomposition and non-standard task to core mappings can dramatically alter performance. To find this out, however, is often a process of trial and error. To better inform this process, a performance model was developed for a simple regular grid-based kernel code, shallow. The code comprises two distinct types of work, loop-based array updates and nearest-neighbour halo-exchanges. Separate performance models were developed for each part, both based on a similar methodology. Application specific benchmarks were run to measure performance for different problem sizes under different execution scenarios. These results were then fed into a performance model that derives resource usage for a given deployment scenario, with interpolation between results as necessary.

Visual analysis of image collections

Multidimensional Visualization techniques are invaluable tools for analysis of structured and unstructured data with variable dimensionality. This paper introduces PEx-Image-Projection Explorer for Images-a tool aimed at supporting analysis of image collections. The tool supports a methodology that employs interactive visualizations to aid user-driven feature detection and classification tasks, thus offering improved analysis and exploration capabilities. The visual mappings employ similarity-based multidimensional projections and point placement to layout the data on a plane for visual exploration. In addition to its application to image databases, we also illustrate how the proposed approach can be successfully employed in simultaneous analysis of different data types, such as text and images, offering a common visual representation for data expressed in different modalities.

Strong surjectivity of maps from 2-complexes into the 2-sphere

Given a model 2-complex K(P) of a group presentation P, we associate to it an integer matrix Delta(P) and we prove that a cellular map f : K(P) -> S(2) is root free (is not strongly surjective) if and only if the diophantine linear system Delta(P) Y = (deg) over right arrow (f) has an integer solution, here (deg) over right arrow (f) is the so-called vector-degree of f

Foliations and polynomial diffeomorphisms of R(3)

Let Y = (f, g, h): R(3) -> R(3) be a C(2) map and let Spec(Y) denote the set of eigenvalues of the derivative DY(p), when p varies in R(3). We begin proving that if, for some epsilon > 0, Spec(Y) boolean AND (-epsilon, epsilon) = empty set, then the foliation F(k), with k is an element of {f, g, h}, made up by the level surfaces {k = constant}, consists just of planes. As a consequence, we prove a bijectivity result related to the three-dimensional case of Jelonek`s Jacobian Conjecture for polynomial maps of R(n).

Invariant theory and reversible-equivariant vector fields

In this paper we present results for the systematic study of reversible-equivariant vector fields - namely, in the simultaneous presence of symmetries and reversing symmetries - by employing algebraic techniques from invariant theory for compact Lie groups. The Hilbert-Poincare series and their associated Molien formulae are introduced,and we prove the character formulae for the computation of dimensions of spaces of homogeneous anti-invariant polynomial functions and reversible-equivariant polynomial mappings. A symbolic algorithm is obtained for the computation of generators for the module of reversible-equivariant polynomial mappings over the ring of invariant polynomials. We show that this computation can be obtained directly from a well-known situation, namely from the generators of the ring of invariants and the module of the equivariants. (C) 2008 Elsevier B.V, All rights reserved.

Coincidence theorems and its applications to equilibrium problems

Given two maps h : X x K -> R and g : X -> K such that, for all x is an element of X, h(x, g(x)) = 0, we consider the equilibrium problem of finding (x) over tilde is an element of X such that h((x) over tilde, g(x)) >= 0 for every x is an element of X. This question is related to a coincidence problem.

M-deformations of A-simple germs from R(n) to R(n+1)

All A-simple corank-1 germs from R(n) to R(n+1), where n not equal 4, have an M-deformation, that is a deformation in which the maximal numbers of isolated stable singular points are simultaneously present in the image.

Direct Observation of Tetragonal Distortion in Epitaxial Structures through Secondary Peak Split in a Synchrotron Radiation Renninger Scan

This paper reports a direct observation of an interesting split of the (022)(022) four-beam secondary peak into two (022) and (022) three-beam peaks, in a synchrotron radiation Renninger scan (phi-scan), as an evidence of the layer tetragonal distortion in two InGaP/GaAs (001) epitaxial structures with different thicknesses. The thickness, composition, (a perpendicular to) perpendicular lattice parameter, and (01) in-plane lattice parameter of the two epitaxial ternary layers were obtained from rocking curves (omega-scan) as well as from the simulation of the (022)(022) split, and then, it allowed for the determination of the perpendicular and parallel (in-plane) strains. Furthermore, (022)(022) omega:phi mappings were measured in order to exhibit the multiple diffraction condition of this four-beam case with their split measurement.

Hybrid reflections in InGaP/GaAs(001) by synchrotron radiation multiple diffraction

Hybrid reflections (HRs) involving substrate and layer planes (SL type) [Morelhao et al., Appl. Phys. Len. 73 (15), 2194 (1998)] observed in Chemical Beam Epitaxy (CBE) grown InGaP/GaAs(001) structures were used as a three-dimensional probe to analyze structural properties of epitaxial layers. A set of (002) rocking curves (omega-scan) measured for each 15 degrees in the azimuthal plane was arranged in a pole diagram in phi for two samples with different layer thicknesses (#A -58 nm and #B - 370 nm) and this allowed us to infer the azimuthal epilayer homogeneity in both samples. Also, it was shown the occurrence of (1 (1) over bar3) HR detected even in the thinner layer sample. Mappings of the HR diffraction condition (omega:phi) allowed to observe the crystal truncation rod through the elongation of HR shape along the substrate secondary reflection streak which can indicate in-plane match of layer/substrate lattice parameters. (C) 2009 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim

Plasma confinement in tokamaks with robust torus

We present a non-linear symplectic map that describes the alterations of the magnetic field lines inside the tokamak plasma due to the presence of a robust torus (RT) at the plasma edge. This RT prevents the magnetic field lines from reaching the tokamak wall and reduces, in its vicinity, the islands and invariant curve destruction due to resonant perturbations. The map describes the equilibrium magnetic field lines perturbed by resonances created by ergodic magnetic limiters (EMLs). We present the results obtained for twist and non-twist mappings derived for monotonic and non-monotonic plasma current density radial profiles, respectively. Our results indicate that the RT implementation would decrease the field line transport at the tokamak plasma edge. (C) 2010 Elsevier B.V. All rights reserved.

A game theoretical approach to the evolution of structured communication codes

Structured meaning-signal mappings, i.e., mappings that preserve neighborhood relationships by associating similar signals with similar meanings, are advantageous in an environment where signals are corrupted by noise and sub-optimal meaning inferences are rewarded as well. The evolution of these mappings, however, cannot be explained within a traditional language evolutionary game scenario in which individuals meet randomly because the evolutionary dynamics is trapped in local maxima that do not reflect the structure of the meaning and signal spaces. Here we use a simple game theoretical model to show analytically that when individuals adopting the same communication code meet more frequently than individuals using different codes-a result of the spatial organization of the population-then advantageous linguistic innovations can spread and take over the population. In addition, we report results of simulations in which an individual can communicate only with its K nearest neighbors and show that the probability that the lineage of a mutant that uses a more efficient communication code becomes fixed decreases exponentially with increasing K. These findings support the mother tongue hypothesis that human language evolved as a communication system used among kin, especially between mothers and offspring.

Cross-situational and supervised learning in the emergence of communication

Scenarios for the emergence or bootstrap of a lexicon involve the repeated interaction between at least two agents who must reach a consensus on how to name N objects using H words. Here we consider minimal models of two types of learning algorithms: cross-situational learning, in which the individuals determine the meaning of a word by looking for something in common across all observed uses of that word, and supervised operant conditioning learning, in which there is strong feedback between individuals about the intended meaning of the words. Despite the stark differences between these learning schemes, we show that they yield the same communication accuracy in the limits of large N and H, which coincides with the result of the classical occupancy problem of randomly assigning N objects to H words.

Multilevel Training of Binary Morphological Operators

The design of binary morphological operators that are translation-invariant and locally defined by a finite neighborhood window corresponds to the problem of designing Boolean functions. As in any supervised classification problem, morphological operators designed from a training sample also suffer from overfitting. Large neighborhood tends to lead to performance degradation of the designed operator. This work proposes a multilevel design approach to deal with the issue of designing large neighborhood-based operators. The main idea is inspired by stacked generalization (a multilevel classifier design approach) and consists of, at each training level, combining the outcomes of the previous level operators. The final operator is a multilevel operator that ultimately depends on a larger neighborhood than of the individual operators that have been combined. Experimental results show that two-level operators obtained by combining operators designed on subwindows of a large window consistently outperform the single-level operators designed on the full window. They also show that iterating two-level operators is an effective multilevel approach to obtain better results.

A stronger Dunford-Pettis property

We discuss a strong version of the Dunford-Pettis property, earlier named (DP*) property, which is shared by both l(1) and l(infinity) It is equivalent to the Dunford-Pettis property plus the fact that every quotient map onto c(0) is completely continuous. Other weak sequential continuity results on polynomials and analytic mappings related to the (DP*) property are shown.