Spatial patterns in the brood combs of Nannotrigona testaceicornis (Hymenoptera: Meliponinae): male clusters

Genetic models of sex and caste determination in eusocial stingless bees suggest specific patterns of male, worker and gyne cell distribution in the brood comb. Conflict between queen and laying workers over male parentage and center-periphery gradients of conditions, such as food and temperature, could also contribute to non-random spatial configuration. We converted the positions of the hexagonal cells in a brood comb to Cartesian coordinates, labeled by sex or caste of the individuals inside. To detect and locate clustered patterns, the mapped brood combs were evaluated by indexes of dispersion (MMC, mean distance of cells of a given category from their centroid) and eccentricity (DMB, distance between this centroid and the overall brood comb centroid) that we developed. After randomizing the labels and recalculating the indexes, we calculated probabilities that the original values had been generated by chance. We created sets of binary brood combs in which males were aggregated, regularly or randomly distributed among females. These stylized maps were used to describe the power of MMC and DMB, and they were applied to evaluate the male distribution in the sampled Nannotrigona testaceicornis brood combs. MMC was very sensitive to slight deviations from a perfectly rounded clump; DMB detected any asymmetry in the location of these compact to fuzzy clusters. Six of the 82 brood combs of N. testaceicornis that we analyzed had more than nine males, distributed according to variations in spatial patterns, as indicated by the two indexes.

COUNTABLE GROUPS OF ISOMETRIES ON BANACH SPACES

A group G is representable in a Banach space X if G is isomorphic to the group of isometrics on X in some equivalent norm. We prove that a countable group G is representable in a separable real Banach space X in several general cases, including when G similar or equal to {-1,1} x H, H finite and dim X >= vertical bar H vertical bar or when G contains a normal subgroup with two elements and X is of the form c(0)(Y) or l(p)(Y), 1 <= p < +infinity. This is a consequence of a result inspired by methods of S. Bellenot (1986) and stating that under rather general conditions on a separable real Banach space X and a countable bounded group G of isomorphisms on X containing -Id, there exists an equivalent norm on X for which G is equal to the group of isometrics on X. We also extend methods of K. Jarosz (1988) to prove that any complex Banach space of dimension at least 2 may be renormed with an equivalent complex norm to admit only trivial real isometries, and that any complexification of a Banach space may be renormed with an equivalent complex norm to admit only trivial and conjugation real isometrics. It follows that every real Banach space of dimension at least 4 and with a complex structure may be renormed to admit exactly two complex structures up to isometry, and that every real Cartesian square may be renormed to admit a unique complex structure up to isometry.

A geometric mass-preserving redistancing scheme for the level set function

In this paper we describe and evaluate a geometric mass-preserving redistancing procedure for the level set function on general structured grids. The proposed algorithm is adapted from a recent finite element-based method and preserves the mass by means of a localized mass correction. A salient feature of the scheme is the absence of adjustable parameters. The algorithm is tested in two and three spatial dimensions and compared with the widely used partial differential equation (PDE)-based redistancing method using structured Cartesian grids. Through the use of quantitative error measures of interest in level set methods, we show that the overall performance of the proposed geometric procedure is better than PDE-based reinitialization schemes, since it is more robust with comparable accuracy. We also show that the algorithm is well-suited for the highly stretched curvilinear grids used in CFD simulations. Copyright (C) 2010 John Wiley & Sons, Ltd.

Two-Phase Mapping for Projecting Massive Data Sets

Most multidimensional projection techniques rely on distance (dissimilarity) information between data instances to embed high-dimensional data into a visual space. When data are endowed with Cartesian coordinates, an extra computational effort is necessary to compute the needed distances, making multidimensional projection prohibitive in applications dealing with interactivity and massive data. The novel multidimensional projection technique proposed in this work, called Part-Linear Multidimensional Projection (PLMP), has been tailored to handle multivariate data represented in Cartesian high-dimensional spaces, requiring only distance information between pairs of representative samples. This characteristic renders PLMP faster than previous methods when processing large data sets while still being competitive in terms of precision. Moreover, knowing the range of variation for data instances in the high-dimensional space, we can make PLMP a truly streaming data projection technique, a trait absent in previous methods.

Resampling Strategies for Deforming MLS Surfaces

Moving-least-squares (MLS) surfaces undergoing large deformations need periodic regeneration of the point set (point-set resampling) so as to keep the point-set density quasi-uniform. Previous work by the authors dealt with algebraic MLS surfaces, and proposed a resampling strategy based on defining the new points at the intersections of the MLS surface with a suitable set of rays. That strategy has very low memory requirements and is easy to parallelize. In this article new resampling strategies with reduced CPU-time cost are explored. The basic idea is to choose as set of rays the lines of a regular, Cartesian grid, and to fully exploit this grid: as data structure for search queries, as spatial structure for traversing the surface in a continuation-like algorithm, and also as approximation grid for an interpolated version of the MLS surface. It is shown that in this way a very simple and compact resampling technique is obtained, which cuts the resampling cost by half with affordable memory requirements.

A discontinuous-Galerkin-based immersed boundary method

A numerical method to approximate partial differential equations on meshes that do not conform to the domain boundaries is introduced. The proposed method is conceptually simple and free of user-defined parameters. Starting with a conforming finite element mesh, the key ingredient is to switch those elements intersected by the Dirichlet boundary to a discontinuous-Galerkin approximation and impose the Dirichlet boundary conditions strongly. By virtue of relaxing the continuity constraint at those elements. boundary locking is avoided and optimal-order convergence is achieved. This is shown through numerical experiments in reaction-diffusion problems. Copyright (c) 2008 John Wiley & Sons, Ltd.

Exact vortex solutions in a CP(N) Skyrme-Faddeev type model

We consider a four dimensional field theory with target space being CP(N) which constitutes a generalization of the usual Skyrme-Faddeev model defined on CP(1). We show that it possesses an integrable sector presenting an infinite number of local conservation laws, which are associated to the hidden symmetries of the zero curvature representation of the theory in loop space. We construct an infinite class of exact solutions for that integrable submodel where the fields are meromorphic functions of the combinations (x(1) + i x(2)) and (x(3) + x(0)) of the Cartesian coordinates of four dimensional Minkowski space-time. Among those solutions we have static vortices and also vortices with waves traveling along them with the speed of light. The energy per unity of length of the vortices show an interesting and intricate interaction among the vortices and waves.