Larval diet affects number of femoral 'brush' scales in male Helicoverpa punctigera moths (Lepidoptera : Noctuidae)

Males of Helicoverpa punctigera (Wallengren) show considerable variation in the number of femoral scales on the prothoracic legs. Such intraspecific variation in adult morphology could indicate the presence of undetected sibling species, or it may be related to larval diet. Helicoverpa putactigera is polyphagous, and different host plant species are likely to represent diets of different quality. Femoral lengths and the numbers of femoral scales on the prothoracic legs were therefore determined from: (i) individuals that had been collected as larvae from various host species in the field; and (ii) individuals that had been laboratory-reared, in split-family tests, on different diets, namely cotton, lucerne, sowthistle and artificial diet. Host plant species (and therefore presumably diet quality) influenced femoral length of H. punctigera males and, perhaps in conjunction with this, the number of femoral scales on the fore leg. The rearing experiment indicated, in addition, that the effect of host plant quality varies with larval stage, and that the pattern of this variation across the immature stages is dependent on host plant species. The recorded variation in the morphology of field-collected H. punctigera males is therefore most readily explained as a consequence of different individuals developing (at least for most of their larval life) on different host plant species, with diet quality varying significantly with species. The relevance of these results for insect developmental studies and evolutionary interpretations of host relationships is outlined.

The number of long-lasting functional memory CD8(+) T cells generated depends on the nature of the initial nonspecific stimulation

The mechanism of generation of memory cytotoxic T cells (CTL) following immunization remains controversial. Using tumor protection and IFN-gamma ELISPOT assays in mice to detect functional CTL, we show that the initial effector CTL burst size after immunization is not directly related to the amount of functional memory CTL formed, suggesting that memory CTL are unlikely to arise stochastically from effector CTL. Induction of MHC class II-restricted T helper cells at the time of immunization by inclusion of a T helper peptide or protein in the immunogen, is necessary to generate memory CTL, although no T helper cell induction is required to generate effector CTL to a strong MHC class I-binding peptide. Host protective T cell memory correlates with the number of CTL epitope responsive IFN-gamma-secreting memory T cells as measured in an ELISPOT assay at the time of tumor challenge. We conclude that a different antigen presenting environment is required to induce long-lasting functional memory CTL, and non-cognate stimulation of the immune system is essential to allow generation of a long-lasting host protective memory CTL response.

Patchy populations in stochastic environments: Critical number of patches for persistence

We introduce a model for the dynamics of a patchy population in a stochastic environment and derive a criterion for its persistence. This criterion is based on the geometric mean (GM) through time of the spatial-arithmetic mean of growth rates. For the population to persist, the GM has to be greater than or equal to1. The GM increases with the number of patches (because the sampling error is reduced) and decreases with both the variance and the spatial covariance of growth rates. We derive analytical expressions for the minimum number of patches (and the maximum harvesting rate) required for the persistence of the population. As the magnitude of environmental fluctuations increases, the number of patches required for persistence increases, and the fraction of individuals that can be harvested decreases. The novelty of our approach is that we focus on Malthusian local population dynamics with high dispersal and strong environmental variability from year to year. Unlike previous models of patchy populations that assume an infinite number of patches, we focus specifically on the effect that the number of patches has on population persistence. Our work is therefore directly relevant to patchily distributed organisms that are restricted to a small number of habitat patches.

The number of rational points of a class of Artin-Schreier curves

We determine the number of F-q-rational points of a class of Artin-Schreier curves by using recent results concerning evaluations of some exponential sums. In particular, we determine infinitely many new examples of maximal and minimal plane curves in the context of the Hasse-Weil bound. (C) 2002 Elsevier Science (USA).

A subset-oriented algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries

Libraries of cyclic peptides are being synthesized using combinatorial chemistry for high throughput screening in the drug discovery process. This paper describes the min_syn_steps.cpp program (available at http://www.imb.uq.edu.au/groups/smythe/tran), which after inputting a list of cyclic peptides to be synthesized, removes cyclic redundant sequences and calculates synthetic strategies which minimize the synthetic steps as well as the reagent requirements. The synthetic steps and reagent requirements could be minimized by finding common subsets within the sequences for block synthesis. Since a brute-force approach to search for optimum synthetic strategies is impractically large, a subset-orientated approach is utilized here to limit the size of the search. (C) 2002 Elsevier Science Ltd. All rights reserved.

Effect of the number of shells on the pressure and energy of two-dimensional free bubble clusters

We have performed Surface Evolver simulations of two-dimensional hexagonal bubble clusters consisting of a central bubble of area lambda surrounded by s shells or layers of bubbles of unit area. Clusters of up to twenty layers have been simulated, with lambda varying between 0.01 and 100. In monodisperse clusters (i.e., for lambda = 1) [M.A. Fortes, F Morgan, M. Fatima Vaz, Philos. Mag. Lett. 87 (2007) 561] both the average pressure of the entire Cluster and the pressure in the central bubble are decreasing functions of s and approach 0.9306 for very large s, which is the pressure in a bubble of an infinite monodisperse honeycomb foam. Here we address the effect of changing the central bubble area lambda. For small lambda the pressure in the central bubble and the average pressure were both found to decrease with s, as in monodisperse clusters. However, for large,, the pressure in the central bubble and the average pressure increase with s. The average pressure of large clusters was found to be independent of lambda and to approach 0.9306 asymptotically. We have also determined the cluster surface energies given by the equation of equilibrium for the total energy in terms of the area and the pressure in each bubble. When the pressures in the bubbles are not available, an approximate equation derived by Vaz et al. [M. Fatima Vaz, M.A. Fortes, F. Graner, Philos. Mag. Lett. 82 (2002) 575] was shown to provide good estimations for the cluster energy provided the bubble area distribution is narrow. This approach does not take cluster topology into account. Using this approximate equation, we find a good correlation between Surface Evolver Simulations and the estimated Values of energies and pressures. (C) 2008 Elsevier B.V. All rights reserved.

An architecture for an effective usage of data mining in business intelligence systems

Business Intelligence (BI) is one emergent area of the Decision Support Systems (DSS) discipline. Over the last years, the evolution in this area has been considerable. Similarly, in the last years, there has been a huge growth and consolidation of the Data Mining (DM) field. DM is being used with success in BI systems, but a truly DM integration with BI is lacking. Therefore, a lack of an effective usage of DM in BI can be found in some BI systems. An architecture that pretends to conduct to an effective usage of DM in BI is presented.

Can varying the number of teams in a shift schedule constitute a preventive strategy?

OBJECTIVE: The study examines the implications for shiftworkers of applying different numbers of teams in the organization of shiftwork. METHODS: The participating operators came from five different companies applying continuous shift rotation systems. The companies shared the same product organization and a common corporate culture belonging to the same multinational company. Each company had a shift system consisting of four, five or six teams, with the proportion of shifts outside day work decreasing as the number of teams increased. Questionnaire and documentary data were used as data sources. RESULTS: Operators in systems with additional teams had more daywork but also more irregular working hours due to both overtime and schedule changes. Operators using six teams used fewer social compensation strategies. Operators in four teams were most satisfied with their work hours. Satisfaction with the time available for various social activities outside work varied inconsistently between the groups. CONCLUSIONS: In rotating systems the application of more teams reduces the number of shifts outside day work. This apparent improvement for shiftworkers was counteracted by a concomitant irregularity produced by greater organizational requirements for flexibility. The balance of this interaction was found to have a critical impact on employees.

Determining the number of clusters in categorical data

Cluster analysis for categorical data has been an active area of research. A well-known problem in this area is the determination of the number of clusters, which is unknown and must be inferred from the data. In order to estimate the number of clusters, one often resorts to information criteria, such as BIC (Bayesian information criterion), MML (minimum message length, proposed by Wallace and Boulton, 1968), and ICL (integrated classification likelihood). In this work, we adopt the approach developed by Figueiredo and Jain (2002) for clustering continuous data. They use an MML criterion to select the number of clusters and a variant of the EM algorithm to estimate the model parameters. This EM variant seamlessly integrates model estimation and selection in a single algorithm. For clustering categorical data, we assume a finite mixture of multinomial distributions and implement a new EM algorithm, following a previous version (Silvestre et al., 2008). Results obtained with synthetic datasets are encouraging. The main advantage of the proposed approach, when compared to the above referred criteria, is the speed of execution, which is especially relevant when dealing with large data sets.

The roman conquered by delay: reducing the number of preemptions using sleep states

Sleep-states are emerging as a first-class design choice in energy minimization. A side effect of this is that the release behavior of the system is affected and subsequently the preemption relations between tasks. In a first step we have investigated how the behavior in terms of number of preemptions of tasks in the system is changed at runtime, using an existing procrastination approach, which utilizes sleepstates for energy savings purposes. Our solution resulted in substantial savings of preemptions and we expect from even higher yields for alternative energy saving algorithms. This work is intended to form the base of future research, which aims to bound the number of preemptions at analysis time and subsequently how this may be employed in the analysis to reduced the amount of system utilization, which is reserved to account for the preemption delay.

Estimating the number of nodes in wireless sensor networks

We propose an efficient algorithm to estimate the number of live computer nodes in a network. This algorithm is fully distributed, and has a time-complexity which is independent of the number of computer nodes. The algorithm is designed to take advantage of a medium access control (MAC) protocol which is prioritized; that is, if two or more messages on different nodes contend for the medium, then the node contending with the highest priority will win, and all nodes will know the priority of the winner.