Comparative Ultrastructure and Molecular Phylogeny of Selenidium melongena n. sp and S. terebellae Ray 1930 Demonstrate Niche Partitioning in Marine Gregarine Parasites (Apicomplexa)

Gregarine apicomplexans are a diverse group of single-celled parasites that have feeding stages (trophozoites) and gamonts that generally inhabit the extracellular spaces of invertebrate hosts living in marine, freshwater, and terrestrial environments. Inferences about the evolutionary morphology of gregarine apicomplexans are being incrementally refined by molecular phylogenetic data, which suggest that several traits associated with the feeding cells of gregarines arose by convergent evolution. The study reported here supports these inferences by showing how molecular data reveals traits that are phylogenetically misleading within the context of comparative morphology alone. We examined the ultrastructure and molecular phylogenetic positions of two gregarine species isolated from the spaghetti worm Thelepus japonicus: Selenidium terebellae Ray 1930 and S. melongena n. sp. The ultrastructural traits of S. terebellae were very similar to other species of Selenidium sensu stricto, such as having vermiform trophozoites with an apical complex, few epicytic folds, and a dense array of microtubules underlying the trilayered pellicle. By contrast, S. melongena n. sp. lacked a comparably discrete assembly of subpellicular microtubules, instead employing a system of fibrils beneath the cell surface that supported a relatively dense array of helically arranged epicytic folds. Molecular phylogenetic analyses of small subunit rDNA sequences derived from single-cell PCR unexpectedly demonstrated that these two gregarines are close sister species. The ultrastructural differences between these two species were consistent with the fact that S. terebellae infects the inner lining of the host intestines, and S. melongena n. sp. primarily inhabits the coelom, infecting the outside wall of the host intestine. Altogether, these data demonstrate a compelling case of niche partitioning and associated morphological divergence in marine gregarine apicomplexans. (C) 2014 Elsevier GmbH. All rights reserved.

Quadratically Hyponormal Weighted Shifts with Recursive Tail

We characterize positive quadratic hyponormality of the weighted shift W-alpha(x) associated to the weight sequence alpha(x) : 1, 1, root x, (root u, root v, root w)(Lambda) with Stampfli recursive tail, and produce an interval in x with non-empty interior in the positive real line for quadratic hyponormality but not positive quadratic hyponormality for such a shift. (C) 2013 Elsevier Inc. All rights reserved.

Use of a State-Level Pharmaceutical Assistance Program Among Urban and Rural Elders

A number of state-level pharmaceutical assistance programs have been established as a result of the growing recognition of the role of pharmaceuticals in the long-term care of the elderly. However, existing research does not provide a coherent expectation for patterns of use by rural and urban elderly. The data for this analysis are drawn from a larger study of the Pennsylvania Pharmaceutical Assistance Contract for the Elderly (PACE). PACE provides prescription medicines for elderly who meet income requirements. The research project was designed to assess the characteristics of PACE program participants and non-participants on a wide range of issues. Chi-square analysis and regression models were used to assess the association between rural and urban residence and access to the PACE Program. The results indicate that rural/urban status of the elderly is not a significant predictor of the use of PACE. Other traditional variables (e.g., health self-rating and physician visits) did predict difference in the pattern of use.

Computation of discrete cosine transform using Clenshaw's recurence formula

Clenshaw’s recurrenee formula is used to derive recursive algorithms for the discrete cosine transform @CT) and the inverse discrete cosine transform (IDCT). The recursive DCT algorithm presented here requires one fewer delay element per coefficient and one fewer multiply operation per coeflident compared with two recently proposed methods. Clenshaw’s recurrence formula provides a unified development for the recursive DCT and IDCT algorithms. The M v e al gorithms apply to arbitrary lengtb algorithms and are appropriate for VLSI implementation.