Worker demography in a large-colony, swarm-founding wasp

Neotropical swarm-founding wasps build nests enclosed in a covering envelope, which makes it difficult to count individual births and deaths. Thus, knowledge of worker demography is very limited for swarm-founding species compared with that for independent-founding species. In this study, we explored the worker demography of the swarm-founding wasp Polybia paulista, the colony size of which usually exceeds several thousand adults. We considered each wasp colony as an open-population and estimated the survival probability, recruitment rate, and population size of workers using the developments of the Cormack-Jolly-Seber model. We found that capture probability varied considerably among the workers, probably due to age polyethism and/or task specialization. The daily survival rate of workers was high (around 0.97) throughout the season and was not related to the phase of colony development. On the other hand, the recruitment rate ranged from 0 to 0.37, suggesting that worker production was substantially less important than worker survival in determining worker population fluctuations. When we compared survival rates among worker groups of one colony, the mean daily survival rate was lower for founding workers than for progeny workers and tended to be higher in progeny workers that emerged in winter. These differences in survivorship patterns among worker cohorts would be related to worker foraging activity and/or level of parasitism.

How does a colony of Apoica flavissima (Hymenoptera: Vespidae, Epiponini) maintain a constant temperature?

The thermal characteristics of a colony of Apoica flavissima, an epiponine wasp, were examined. The nest, with a diameter of slightly less than 30 cm, was built on a twig of an orange tree. The temperature of the roof surface fluctuated greatly, ranging between 19.1 and 41.5 degrees C. However, the temperature in the central cell was kept constant at around 27 degrees C throughout a day. Although heavy rain pelted the nest roof in the morning, the central cell maintained temperatures higher than 25 degrees C. On the contrary, after all immature and adult wasps were removed the temperature in the nest fluctuated considerably. The presence of immature individuals and adult wasps densely covering the under surface of the comb seemed to function as an effective insulator. The smaller temperature fluctuation in the central cell than on the roof surface, when the nest was in the empty state, suggests that the thick spongy tissue of the roof made from curled plant leaf hairs serves as an insulator to prevent the conduction of solar heat into the cells and the outward flow of heat generated in cells, especially at night.

Use of the q-Gaussian mutation in evolutionary algorithms

This paper proposes the use of the q-Gaussian mutation with self-adaptation of the shape of the mutation distribution in evolutionary algorithms. The shape of the q-Gaussian mutation distribution is controlled by a real parameter q. In the proposed method, the real parameter q of the q-Gaussian mutation is encoded in the chromosome of individuals and hence is allowed to evolve during the evolutionary process. In order to test the new mutation operator, evolution strategy and evolutionary programming algorithms with self-adapted q-Gaussian mutation generated from anisotropic and isotropic distributions are presented. The theoretical analysis of the q-Gaussian mutation is also provided. In the experimental study, the q-Gaussian mutation is compared to Gaussian and Cauchy mutations in the optimization of a set of test functions. Experimental results show the efficiency of the proposed method of self-adapting the mutation distribution in evolutionary algorithms.

Discrete dimorphism among castes of the bald-faced hornet Dolichovespula maculata (Hymenoptera: Vespidae) in different phases of the colony cycle

Morphological and physiological caste differences were compared from colonies of Dolichovespula maculata in middle and late phases of the colony cycle. The females showed three patterns of ovarian development and only females classified as queens were inseminated. In both phases, queens were larger than workers for most measures. Discriminant analyses showed high distinction of caste in both phases. We also found highly pronounced qualitative differences: workers had hairs covering the entire body whereas queens had no hair and also some colour differences in the gaster. These results indicate that D. maculata presents pre-imaginal differentiation as seen in other Vespinae, and that size variation occurs from colony to colony such that queens of one colony may be comparable to workers of a different colony although the castes are always distinguishable within colonies.

Most of the patients presenting myocardial infarction would not be eligible for intensive lipid-lowering based on clinical algorithms or plasma C-reactive protein

Objective: The study we assessed how often patients who are manifesting a myocardial infarction (MI) would not be considered candidates for intensive lipid-lowering therapy based on the current guidelines. Methods: In 355 consecutive patients manifesting ST elevation MI (STEMI), admission plasma C-reactive protein (CRP) was measured and Framingham risk score (FRS), PROCAM risk score, Reynolds risk score, ASSIGN risk score, QRISK, and SCORE algorithms were applied. Cardiac computed tomography and carotid ultrasound were performed to assess the coronary artery calcium score (CAC), carotid intima-media thickness (cIMT) and the presence of carotid plaques. Results: Less than 50% of STEMI patients would be identified as having high risk before the event by any of these algorithms. With the exception of FRS (9%), all other algorithms would assign low risk to about half of the enrolled patients. Plasma CRP was <1.0 mg/L in 70% and >2 mg/L in 14% of the patients. The average cIMT was 0.8 +/- 0.2 mm and only in 24% of patients was >= 1.0 mm. Carotid plaques were found in 74% of patients. CAC > 100 was found in 66% of patients. Adding CAC >100 plus the presence of carotid plaque, a high-risk condition would be identified in 100% of the patients using any of the above mentioned algorithms. Conclusion: More than half of patients manifesting STEMI would not be considered as candidates for intensive preventive therapy by the current clinical algorithms. The addition of anatomical parameters such as CAC and the presence of carotid plaques can substantially reduce the CVD risk underestimation. (C) 2010 Elsevier Ireland Ltd. All rights reserved.

Granulocyte-Colony Stimulating Factor (G-CSF) induces mechanical hyperalgesia via spinal activation of MAP kinases and PI(3)K in mice

Granulocyte-colony stimulating factor (G-CSF) is a current pharmacological approach to increase peripheral neutrophil counts after anti-tumor therapies. Pain is most relevant side effect of G-CSF in healthy volunteers and cancer patients. Therefore, the mechanisms of G-CSF-induced hyperalgesia were investigated focusing on the role of spinal mitogen-activated protein (MAP) kinases ERK (extracellular signal-regulated kinase). JNK (Jun N-terminal Kinase) and p38, and PI(3)K (phosphatidylinositol 3-kinase). G-CSF induced dose (30-300 ng/paw)-dependent mechanical hyperalgesia, which was inhibited by local post-treatment with morphine. This effect of morphine was reversed by naloxone (opioid receptor antagonist). Furthermore, G-CSF-induced hyperalgesia was inhibited in a dose-dependent manner by intrathecal pre-treatment with ERK (PD98059), JNK (SB600125), p38 (SB202190) or PI(3)K (wortmanin) inhibitors. The co-treatment with MAP kinase and PI(3)K inhibitors, at doses that were ineffective as single treatment, significantly inhibited G-CSF-induced hyperalgesia. Concluding, in addition to systemic opioids, peripheral opioids as well as spinal treatment with MAP kinases and PI(3)K inhibitors also reduce G-CSF-induced pain. (C) 2011 Elsevier Inc. All rights reserved.

Colony dehydration and water collection by specialized caste in the leaf-cutting ant Atta sexdens rubropilosa

Social organization enables leaf-cutting ants to keep appropriate micro-ecological nest conditions for the fungus garden (their main food), eggs, larvae and adults. To maintain stability while facing changing conditions, individual ants must perceive destabilising factors and produce a proper behavioral response. We investigated behavioral responses to experimental dehydration in leaf-cutting ants to verify if task specialization exists, and to quantify the ability of ant sub-colonies for water management. Our setup consisted of fourteen sub-colonies, ten of which were randomly assigned to different levels of experimental dehydration with silica gel, whereas the remaining four were controls. The ten experimental sub-colonies were split into two groups, so that five of them had access to water. Diverse ant morphs searched for water in dehydrated colonies, but mainly a caste of small ants collected water after sources had been discovered. Size specialization for water collection was replicable in shorter experiments with three additional colonies. Ants of dehydrated colonies accumulated leaf-fragments on the nest entrance, and covering the fungus garden. Behaviors that may enhance humidity within the nests were common to all dehydration treatments. Water availability increased the life span of dehydrated colonies.

Granulocyte Colony-stimulating Factor Reduces Mortality by Suppressing Ventricular Arrhythmias in Acute Phase of Myocardial Infarction in Rats

Our aim was to evaluate the effects of granulocyte colony-stimulating factor (G-CSF) on early cardiac arrhythmias after myocardial infarction (MI) and the impact on survival. Male Wistar rats received repeated doses of 50 mu g/kg G-CSF (MI-GCSF group) or vehicle (MI group) at 7, 3, and 1 days before surgery. MI was induced by permanent occlusion of left corollary artery. The electrocardiogram was obtained before occlusion and then for 30 minutes after surgery. Events and duration of ventricular arrhythmias were analyzed. The levels of connexin43 (Cx43) were measured by Western blot immediately before MI production. Survival was significantly increased in MI-GCSF pretreated group (74% versus 52.0% MI. P < 0.05). G-CSF pretreatment also significantly reduced the ventricular premature beats when compared with the untreated-MI group (201 +/- 47 versus 679 +/- 117, P < 0.05). The number and the duration of ventricular tachycardia were smaller in the MI-G-CSF group, as well as the number of ventricular fibrillation episodes (10% versus 69% in NIL P < 0.05). Cx43 levels were significantly increased by G-CSF treatment (1.27 +/- 0.13 versus 0.86 +/- 0.11; P < 0.05). The MI size 24 hours after occlusion was reduced by G-CSF pretreatment (36 +/- 3% versus 44 +/- 2% of left ventricle in MI group; P < 0.05). The increase of Cx43 expression in the heart may explain the reduced incidence in ventricular arrhythmias in the early phases after coronary artery occlusion in rats, thus increasing survival after MI.

The Antiapoptotic Effect of Granulocyte Colony-stimulating Factor Reduces Infarct Size and Prevents Heart Failure Development in Rats

Background/Aim. Granulocyte colony-stimulating factor (G-CSF) reduces myocardial injury and improves cardiac function after myocardial infarction (MI). We investigated the early alterations provided by G-CSF and the chronic repercussions in infarcted rats. Methods. Male Wistar rats (200-250g) received vehicle (MI) or G-CSF (MI-GCSF) (50 mu g/kg, sc) at 7, 3 and 1 days before MI surgery. Afterwards MI was produced and infarct size was measured 1 and 15 days after surgery. Expression of anti-and proapoptotic proteins was evaluated immediately before surgery. 24 hours after surgery, apoptotic nuclei were evaluated. Two weeks after MI, left ventricular (LV) function was evaluated, followed by in situ LV diastolic pressure-volume evaluation. Results. Infarct size was decreased by 1 day pretreatment before occlusion (36 +/- 2.8 vs. 44 +/- 2.1% in MI; P<0.05) and remained reduced at 15 days after infarction (28 +/- 2.2 vs. 36 +/- 1.4% in MI; P<0.05). G-CSF pretreatment increased Bcl-2 and Bcl-xL protein expression, but did not alter Bax in LV. Apoptotic nuclei were reduced by treatment (Sham: 0.46 +/- 0.42, MI: 15.5 +/- 2.43, MI-GCSF: 5.34 +/- 3.34%; P<0.05). Fifteen days after MI, cardiac function remained preserved in G-CSF pretreated rats. The LV dilation was reduced in MI-G-CSF group as compared to MI rats, being closely associated with infarct size. Conclusion. The early beneficial effects of G-CSF were essentials to preserve cardiac function at a chronic stage of myocardial infarction. Copyright (C) 2011 S. Karger AG, Basel

A hybrid approach to learn with imbalanced classes using evolutionary algorithms

There is an increasing interest in the application of Evolutionary Algorithms (EAs) to induce classification rules. This hybrid approach can benefit areas where classical methods for rule induction have not been very successful. One example is the induction of classification rules in imbalanced domains. Imbalanced data occur when one or more classes heavily outnumber other classes. Frequently, classical machine learning (ML) classifiers are not able to learn in the presence of imbalanced data sets, inducing classification models that always predict the most numerous classes. In this work, we propose a novel hybrid approach to deal with this problem. We create several balanced data sets with all minority class cases and a random sample of majority class cases. These balanced data sets are fed to classical ML systems that produce rule sets. The rule sets are combined creating a pool of rules and an EA is used to build a classifier from this pool of rules. This hybrid approach has some advantages over undersampling, since it reduces the amount of discarded information, and some advantages over oversampling, since it avoids overfitting. The proposed approach was experimentally analysed and the experimental results show an improvement in the classification performance measured as the area under the receiver operating characteristics (ROC) curve.

Optimal subdivision of land in agrarian reform projects: an analysis using genetic algorithms

J.A. Ferreira Neto, E.C. Santos Junior, U. Fra Paleo, D. Miranda Barros, and M.C.O. Moreira. 2011. Optimal subdivision of land in agrarian reform projects: an analysis using genetic algorithms. Cien. Inv. Agr. 38(2): 169-178. The objective of this manuscript is to develop a new procedure to achieve optimal land subdivision using genetic algorithms (GA). The genetic algorithm was tested in the rural settlement of Veredas, located in Minas Gerais, Brazil. This implementation was based on the land aptitude and its productivity index. The sequence of tests in the study was carried out in two areas with eight different agricultural aptitude classes, including one area of 391.88 ha subdivided into 12 lots and another of 404.1763 ha subdivided into 14 lots. The effectiveness of the method was measured using the shunting line standard value of a parceled area lot`s productivity index. To evaluate each parameter, a sequence of 15 calculations was performed to record the best individual fitness average (MMI) found for each parameter variation. The best parameter combination found in testing and used to generate the new parceling with the GA was the following: 320 as the generation number, a population of 40 individuals, 0.8 mutation tax, and a 0.3 renewal tax. The solution generated rather homogeneous lots in terms of productive capacity.

Extending the use of canonical and microcanonical Monte Carlo algorithms to spin models

We describe the canonical and microcanonical Monte Carlo algorithms for different systems that can be described by spin models. Sites of the lattice, chosen at random, interchange their spin values, provided they are different. The canonical ensemble is generated by performing exchanges according to the Metropolis prescription whereas in the microcanonical ensemble, exchanges are performed as long as the total energy remains constant. A systematic finite size analysis of intensive quantities and a comparison with results obtained from distinct ensembles are performed and the quality of results reveal that the present approach may be an useful tool for the study of phase transitions, specially first-order transitions. (C) 2009 Elsevier B.V. All rights reserved.

A novel MAP-MRF approach for multispectral image contextual classification using combination of suboptimal iterative algorithms

In this paper we present a novel approach for multispectral image contextual classification by combining iterative combinatorial optimization algorithms. The pixel-wise decision rule is defined using a Bayesian approach to combine two MRF models: a Gaussian Markov Random Field (GMRF) for the observations (likelihood) and a Potts model for the a priori knowledge, to regularize the solution in the presence of noisy data. Hence, the classification problem is stated according to a Maximum a Posteriori (MAP) framework. In order to approximate the MAP solution we apply several combinatorial optimization methods using multiple simultaneous initializations, making the solution less sensitive to the initial conditions and reducing both computational cost and time in comparison to Simulated Annealing, often unfeasible in many real image processing applications. Markov Random Field model parameters are estimated by Maximum Pseudo-Likelihood (MPL) approach, avoiding manual adjustments in the choice of the regularization parameters. Asymptotic evaluations assess the accuracy of the proposed parameter estimation procedure. To test and evaluate the proposed classification method, we adopt metrics for quantitative performance assessment (Cohen`s Kappa coefficient), allowing a robust and accurate statistical analysis. The obtained results clearly show that combining sub-optimal contextual algorithms significantly improves the classification performance, indicating the effectiveness of the proposed methodology. (C) 2010 Elsevier B.V. All rights reserved.

PARALLEL ALGORITHMS FOR MAXIMAL CLIQUES IN CIRCLE GRAPHS AND UNRESTRICTED DEPTH SEARCH

We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without actually generating them, our algorithm requires O(log p) communication rounds with O(nm/p) local computation time. We also present an algorithm to generate the first maximal clique in O(log p) communication rounds with O(nm/p) local computation, and to generate each one of the subsequent maximal cliques this algorithm requires O(log p) communication rounds with O(m/p) local computation. The maximal cliques generation algorithm is based on generating all maximal paths in a directed acyclic graph, and we present an algorithm for this problem that uses O(log p) communication rounds with O(m/p) local computation for each maximal path. We also show that the presented algorithms can be extended to the CREW PRAM model.

Approximation algorithms and hardness results for the clique packing problem

For a fixed family F of graphs, an F-packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F. Finding an F-packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just F = {K(2)}. In this paper we provide new approximation algorithms and hardness results for the K(r)-packing problem where K(r) = {K(2), K(3,) . . . , K(r)}. We show that already for r = 3 the K(r)-packing problem is APX-complete, and, in fact, we show that it remains so even for graphs with maximum degree 4. On the positive side, we give an approximation algorithm with approximation ratio at most 2 for every fixed r. For r = 3, 4, 5 we obtain better approximations. For r = 3 we obtain a simple 3/2-approximation, achieving a known ratio that follows from a more involved algorithm of Halldorsson. For r = 4, we obtain a (3/2 + epsilon)-approximation, and for r = 5 we obtain a (25/14 + epsilon)-approximation. (C) 2008 Elsevier B.V. All rights reserved.