Exciting forces due to interaction of water waves with a submerged sphere in an ice-covered two-layer fluid of finite depth

Scattering of water waves by a sphere in a two-layer fluid, where the upper layer has an ice-cover modelled as an elastic plate of very small thickness, while the lower one has a rigid horizontal bottom surface, is investigated within the framework of linearized water wave theory. The effects of surface tension at the surface of separation is neglected. There exist two modes of time-harmonic waves - the one with lower wave number propagating along the ice-cover and the one with higher wave number along the interface. Method of multipole expansions is used to find the particular solution for the problem of wave scattering by a submerged sphere placed in either of the layers. The exciting forces for vertical and horizontal directions are derived and plotted against different values of the wave number for different submersion depths of the sphere and flexural rigidity of the ice-cover. When the flexural rigidity and the density of the ice-cover are taken to be zero, the numerical results for the exciting forces for the problem with free surface are recovered as particular cases. (C) 2011 Elsevier Ltd. All rights reserved.

Composition of Extrafloral Nectar Influences Interactions between the Myrmecophyte Humboldtia brunonis and its Ant Associates

Ant-plant interactions often are mediated by extrafloral nectar (EFN) composition that may influence plant visitation by ants. Over a 300 km range in the Indian Western Ghats, we investigated the correlation between the EFN composition of the myrmecophytic ant-plant Humboldtia brunonis (Fabaceae) and the number and species of ants visiting EFN. EFN composition varied among H. brunonis populations and between plant organs (floral bud vs. young leaf EFN). In general, EFN was rich in sugars with small quantities of amino acids, especially essential amino acids, and had moderate invertase activity. In experiments at the study sites with sugar and amino acid solutions and with leaf or floral bud EFN mimics, dominant EFN-feeding ants differentiated between solutions as well as between mimics. The castration parasite Crematogaster dohrni (northern study site) was the least selective and did not exhibit any clear feeding preferences, while the largely trophobiont-tending non-protective Myrmicaria brunnea (middle study site) preferred higher sucrose concentrations and certain essential/non-essential amino acid mixtures. The mutualistic Technomyrmex albipes (southern study site) preferred sucrose over glucose or fructose solutions and consumed the leaf EFN mimic to a greater extent than the floral bud EFN mimic. This young leaf EFN mimic had low sugar concentrations, the lowest viscosity and sugar: amino acid ratio, was rich in essential amino acids, and appeared ideally suited to the digestive physiology of T. albipes. This preference for young leaf EFN may explain the greater protection afforded to young leaves than to floral buds by T. albipes, and may also help to resolve ant-pollinator conflicts. The differential response of dominant ants to sugar, amino acids, or solution viscosity suggests that plants can fine-tune their interactions with local ants via EFN composition. Thus, EFN can mediate local partner-choice mechanisms in ant-plant interactions.

Minimizing the complexity of fast sphere decoding of STBCs

Decoding of linear space-time block codes (STBCs) with sphere-decoding (SD) is well known. A fast-version of the SD known as fast sphere decoding (FSD) has been recently studied by Biglieri, Hong and Viterbo. Viewing a linear STBC as a vector space spanned by its defining weight matrices over the real number field, we define a quadratic form (QF), called the Hurwitz-Radon QF (HRQF), on this vector space and give a QF interpretation of the FSD complexity of a linear STBC. It is shown that the FSD complexity is only a function of the weight matrices defining the code and their ordering, and not of the channel realization (even though the equivalent channel when SD is used depends on the channel realization) or the number of receive antennas. It is also shown that the FSD complexity is completely captured into a single matrix obtained from the HRQF. Moreover, for a given set of weight matrices, an algorithm to obtain a best ordering of them leading to the least FSD complexity is presented. The well known classes of low FSD complexity codes (multi-group decodable codes, fast decodable codes and fast group decodable codes) are presented in the framework of HRQF.

On the sphere decoding complexity of high-rate multigroup decodable STBCs in asymmetric MIMO systems

A space-time block code (STBC) is said to be multigroup decodable if the information symbols encoded by it can be partitioned into two or more groups such that each group of symbols can be maximum-likelihood (ML) decoded independently of the other symbol groups. In this paper, we show that the upper triangular matrix encountered during the sphere decoding of a linear dispersion STBC can be rank-deficient even when the rate of the code is less than the minimum of the number of transmit and receive antennas. We then show that all known families of high-rate (rate greater than 1) multigroup decodable codes have rank-deficient matrix even when the rate is less than the number of transmit and receive antennas, and this rank-deficiency problem arises only in asymmetric MIMO systems when the number of receive antennas is strictly less than the number of transmit antennas. Unlike the codes with full-rank matrix, the complexity of the sphere decoding-based ML decoder for STBCs with rank-deficient matrix is polynomial in the constellation size, and hence is high. We derive the ML sphere decoding complexity of most of the known high-rate multigroup decodable codes, and show that for each code, the complexity is a decreasing function of the number of receive antennas.

Construction of Block Orthogonal STBCs and Reducing Their Sphere Decoding Complexity

Construction of high rate Space Time Block Codes (STBCs) with low decoding complexity has been studied widely using techniques such as sphere decoding and non Maximum-Likelihood (ML) decoders such as the QR decomposition decoder with M paths (QRDM decoder). Recently Ren et al., presented a new class of STBCs known as the block orthogonal STBCs (BOSTBCs), which could be exploited by the QRDM decoders to achieve significant decoding complexity reduction without performance loss. The block orthogonal property of the codes constructed was however only shown via simulations. In this paper, we give analytical proofs for the block orthogonal structure of various existing codes in literature including the codes constructed in the paper by Ren et al. We show that codes formed as the sum of Clifford Unitary Weight Designs (CUWDs) or Coordinate Interleaved Orthogonal Designs (CIODs) exhibit block orthogonal structure. We also provide new construction of block orthogonal codes from Cyclic Division Algebras (CDAs) and Crossed-Product Algebras (CPAs). In addition, we show how the block orthogonal property of the STBCs can be exploited to reduce the decoding complexity of a sphere decoder using a depth first search approach. Simulation results of the decoding complexity show a 30% reduction in the number of floating point operations (FLOPS) of BOSTBCs as compared to STBCs without the block orthogonal structure.

Minimizing the Complexity of Fast Sphere Decoding of STBCs

Decoding of linear space-time block codes (STBCs) with sphere-decoding (SD) is well known. A fast-version of the SD known as fast sphere decoding (FSD) was introduced by Biglieri, Hong and Viterbo. Viewing a linear STBC as a vector space spanned by its defining weight matrices over the real number field, we define a quadratic form (QF), called the Hurwitz-Radon QF (HRQF), on this vector space and give a QF interpretation of the FSD complexity of a linear STBC. It is shown that the FSD complexity is only a function of the weight matrices defining the code and their ordering, and not of the channel realization (even though the equivalent channel when SD is used depends on the channel realization) or the number of receive antennas. It is also shown that the FSD complexity is completely captured into a single matrix obtained from the HRQF. Moreover, for a given set of weight matrices, an algorithm to obtain an optimal ordering of them leading to the least FSD complexity is presented. The well known classes of low FSD complexity codes (multi-group decodable codes, fast decodable codes and fast group decodable codes) are presented in the framework of HRQF.

Differences in host species relationships and biogeographic influences produce contrasting patterns of prevalence, community composition and genetic structure in two genera of avian malaria parasites in southern Melanesia

1. Host-parasite interactions have the potential to influence broadscale ecological and evolutionary processes, levels of endemism, divergence patterns and distributions in host populations. Understanding the mechanisms involved requires identification of the factors that shape parasite distribution and prevalence. 2. A lack of comparative information on community-level host-parasite associations limits our understanding of the role of parasites in host population divergence processes. Avian malaria (haemosporidian) parasites in bird communities offer a tractable model system to examine the potential for pathogens to influence evolutionary processes in natural host populations. 3. Using cytochrome b variation, we characterized phylogenetic diversity and prevalence of two genera of avian haemosporidian parasites, Plasmodium and Haemoproteus, and analysed biogeographic patterns of lineages across islands and avian hosts, in southern Melanesian bird communities to identify factors that explain patterns of infection. 4. Plasmodium spp. displayed isolation-by-distance effects, a significant amount of genetic variation distributed among islands but insignificant amounts among host species and families, and strong local island effects with respect to prevalence. Haemoproteus spp. did not display isolation-by-distance patterns, showed marked structuring of genetic variation among avian host species and families, and significant host species prevalence patterns. 5. These differences suggest that Plasmodium spp. infection patterns were shaped by geography and the abiotic environment, whereas Haemoproteus spp. infection patterns were shaped predominantly by host associations. Heterogeneity in the complement and prevalence of parasite lineages infecting local bird communities likely exposes host species to a mosaic of spatially divergent disease selection pressures across their naturally fragmented distributions in southern Melanesia. Host associations for Haemoproteus spp. indicate a capacity for the formation of locally co-adapted host-parasite relationships, a feature that may limit intraspecific gene flow or range expansions of closely related host species.