Morphometrical, biochemical and molecular tools for assessing biodiversity. An example in Plebeia remota (Holmberg, 1903) (Apidae, Meliponini)

We see today many efforts to quantify biodiversity in different biomes. It is very important then to develop and to apply other methodologies that allow us to assess biodiversity. Here we present an example of application of three tools with this goal. We analyzed two populations of Plebeia remota from two distinct biomes that already showed several differences in morphology and behavior. Based on these differences, it has been suggested that the populations of Cunha and Prudentopolis do not represent a single species. In order to verify the existence or absence of gene flow between these two groups, we characterized the patterns of mtDNA through RFLP, the patterns of wing venation through geometric morphometry, and the cuticular hydrocarbons through gas chromatography-mass spectrometry. We used bees collected in these two locations and also from colonies which have being kept for around 9 years at Sao Paulo University. We found six different haplotypes in these specimens, of which three of them occurred exclusively in the population of Cunha and three only in the Prudentopolis population. The fact that the populations do not share haplotypes suggests no maternal gene flow between them. The two populations were differentiated by the pattern of the wing veins. They also had different mixtures of cuticle hydrocarbons. Furthermore it was shown that the colonies kept at the university did not hybridize. These two groups may constitute different species. We also show here the importance of using other methodologies than traditional taxonomy to assess and understand biodiversity, especially in bees.

A revision of the spider genera Chaetopelma ausserer 1871 and Nesiergus simon 1903 (Araneae, theraphosidae, ischnocolinae)

Chaetopelma Ausserer 1871 and Nesiergus Simon 1903 are revised. Cratorrhagus Simon 1891 is considered a junior synonym of Chaetopelma. Cratorrhagus tetramerus (Simon 1873) and the female of Cratorrhagus concolor (Simon 1873) are conspecific with C. olivaceum (C. L. Koch 1841). Ischnocolus gracilis Ausserer 1871, Ischnocolus syriacus Ausserer 1871, Chaetopelma shabati Hassan 1950 and Ischnocolus jerusalemensis Smith 1990 are also treated here as junior synonyms of C. olivaceum. Chaetopelma adenense Simon 1890 is proposed as a junior synonym of Ischnocolus jickelii L. Koch 1875. Chaetopelma gardineri Hirst 1911 is transferred to Nesiergus. Hence, Chaetopelma comprises three valid species: C. olivaceum (C. L. Koch 1841); C. karlamani Vollmer 1997; C. concolor (Simon 1873) n. comb. from the Middle East and northeastern Africa. Nesiergus, which appears endemic to the Seychelles archipelago, now comprises three valid species: N. gardineri (Hirst 1911) n. comb.; N. halophilus Benoit 1978; N. insulanus Simon 1903.

Fitting Lorenz curves

This paper presents a functional form, linear in the parameters, to deal with income distribution and Lorenz curves. The function is fitted to the Brazilian income distribution. Data standard deviations were estimated from year-to-year variation of the income share. (C) 2010 Elsevier B.V. All rights reserved.

FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ`S ATTRACTOR

A novel cryptography method based on the Lorenz`s attractor chaotic system is presented. The proposed algorithm is secure and fast, making it practical for general use. We introduce the chaotic operation mode, which provides an interaction among the password, message and a chaotic system. It ensures that the algorithm yields a secure codification, even if the nature of the chaotic system is known. The algorithm has been implemented in two versions: one sequential and slow and the other, parallel and fast. Our algorithm assures the integrity of the ciphertext (we know if it has been altered, which is not assured by traditional algorithms) and consequently its authenticity. Numerical experiments are presented, discussed and show the behavior of the method in terms of security and performance. The fast version of the algorithm has a performance comparable to AES, a popular cryptography program used commercially nowadays, but it is more secure, which makes it immediately suitable for general purpose cryptography applications. An internet page has been set up, which enables the readers to test the algorithm and also to try to break into the cipher.