Parallel Working-Set Search Structures

In this paper we present two versions of a parallel working-set map on p processors that supports searches, insertions and deletions. In both versions, the total work of all operations when the map has size at least p is bounded by the working-set bound, i.e., the cost of an item depends on how recently it was accessed (for some linearization): accessing an item in the map with recency r takes O(1+log r) work. In the simpler version each map operation has O((log p)^2+log n) span (where n is the maximum size of the map). In the pipelined version each map operation on an item with recency r has O((log p)^2+log r) span. (Operations in parallel may have overlapping span; span is additive only for operations in sequence.) Both data structures are designed to be used by a dynamic multithreading parallel program that at each step executes a unit-time instruction or makes a data structure call. To achieve the stated bounds, the pipelined data structure requires a weak-priority scheduler, which supports a limited form of 2-level prioritization. At the end we explain how the results translate to practical implementations using work-stealing schedulers. To the best of our knowledge, this is the first parallel implementation of a self-adjusting search structure where the cost of an operation adapts to the access sequence. A corollary of the working-set bound is that it achieves work static optimality: the total work is bounded by the access costs in an optimal static search tree.Comment: Authors' version of a paper accepted to SPAA 201

Factors Influencing Consumer Behavior to Purchase Sustainable Cosmetic Products in a German Context

In today's markets, corporate social responsibility is a new consumer expectation. Organizations across all industries are trying to meet these expectations by building a positive reputation and sending a signal to their stakeholders. However, consumers’ environmental behavior is not always the result of their positive attitudes towards environmental issues. Potentially, their environmentally friendly attitudes are contradicted by their actual behavior. This means that people, who have positive attitudes about sustainable products and state that they would purchase them, may not actually buy them after all. In addition, consumers often do not wish to spend more money on buying sustainably, even if they have higher expectations towards sustainable products or companies. Further research is therefore needed to explain the gap between consumer awareness and actual purchasing behavior. In several contexts, environmentally friendly consumption, called sustainable consumption, has been explained by the theory of planned behavior (TPB), such as when buying food or apparel. Sustainable consumption often results from planned decisions rather than hedonic reasons.        &nbsp

Differential gene expression of the honey bee Apis mellifera associated with Varroa destructor infection

Background: The parasitic mite, Varroa destructor, is the most serious pest of the western honey bee, Apis mellifera, and has caused the death of millions of colonies worldwide. This mite reproduces in brood cells and parasitizes immature and adult bees. We investigated whether Varroa infestation induces changes in Apis mellifera gene expression, and whether there are genotypic differences that affect gene expression relevant to the bee's tolerance, as first steps toward unravelling mechanisms of host response and differences in susceptibility to Varroa parasitism. Results: We explored the transcriptional response to mite parasitism in two genetic stocks of A. mellifera which differ in susceptibility to Varroa, comparing parasitized and non-parasitized full-sister pupae from both stocks. Bee expression profiles were analyzed using microarrays derived from honey bee ESTs whose annotation has recently been enhanced by results from the honey bee genome sequence. We measured differences in gene expression in two colonies of Varroa-susceptible and two colonies of Varroa-tolerant bees. We identified a set of 148 genes with significantly different patterns of expression: 32 varied with the presence of Varroa, 116 varied with bee genotype, and 2 with both. Varroa parasitism caused changes in the expression of genes related to embryonic development, cell metabolism and immunity. Bees tolerant to Varroa were mainly characterized by differences in the expression of genes regulating neuronal development, neuronal sensitivity and olfaction. Differences in olfaction and sensitivity to stimuli are two parameters that could, at least in part, account for bee tolerance to Varroa; differences in olfaction may be related to increased grooming and hygienic behavior, important behaviors known to be involved in Varroa tolerance. Conclusion: These results suggest that differences in behavior, rather than in the immune system, underlie Varroa tolerance in honey bees, and give an indication of the specific physiological changes found in parasitized bees. They provide a first step toward better understanding molecular pathways involved in this important host-parasite relationshi

Honeybee Colony Vibrational Measurements to Highlight the Brood Cycle

Insect pollination is of great importance to crop production worldwide and honey bees are amongst its chief facilitators. Because of the decline of managed colonies, the use of sensor technology is growing in popularity and it is of interest to develop new methods which can more accurately and less invasively assess honey bee colony status. Our approach is to use accelerometers to measure vibrations in order to provide information on colony activity and development. The accelerometers provide amplitude and frequency information which is recorded every three minutes and analysed for night time only. Vibrational data were validated by comparison to visual inspection data, particularly the brood development. We show a strong correlation between vibrational amplitude data and the brood cycle in the vicinity of the sensor. We have further explored the minimum data that is required, when frequency information is also included, to accurately predict the current point in the brood cycle. Such a technique should enable beekeepers to reduce the frequency with which visual inspections are required, reducing the stress this places on the colony and saving the beekeeper time

E-β-Ocimene, a Volatile Brood Pheromone Involved in Social Regulation in the Honey Bee Colony (Apis mellifera)

Background: In honey bee colony, the brood is able to manipulate and chemically control the workers in order to sustain their own development. A brood ester pheromone produced primarily by old larvae (4 and 5 days old larvae) was first identified as acting as a contact pheromone with specific effects on nurses in the colony. More recently a new volatile brood pheromone has been identified: E-β-ocimene, which partially inhibits ovary development in workers. [br/] Methodology and Principal Finding: Our analysis of E-β-ocimene production revealed that young brood (newly hatched to 3 days old) produce the highest quantity of E-b-ocimene relative to their body weight. By testing the potential action of this molecule as a non-specific larval signal, due to its high volatility in the colony, we demonstrated that in the presence of E-β-ocimene nest workers start to forage earlier in life, as seen in the presence of real brood. [br/] Conclusions/Significance: In this way, young larvae are able to assign precedence to the task of foraging by workers in order to increase food stores for their own development. Thus, in the complexity of honey bee chemical communication, E-β- ocimene, a pheromone of young larvae, provides the brood with the means to express their nutritional needs to the workers

Practical methods for constructing suffix trees

Sequence datasets are ubiquitous in modern life-science applications, and querying sequences is a common and critical operation in many of these applications. The suffix tree is a versatile data structure that can be used to evaluate a wide variety of queries on sequence datasets, including evaluating exact and approximate string matches, and finding repeat patterns. However, methods for constructing suffix trees are often very time-consuming, especially for suffix trees that are large and do not fit in the available main memory. Even when the suffix tree fits in memory, it turns out that the processor cache behavior of theoretically optimal suffix tree construction methods is poor, resulting in poor performance. Currently, there are a large number of algorithms for constructing suffix trees, but the practical tradeoffs in using these algorithms for different scenarios are not well characterized.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/47869/1/778_2005_Article_154.pd

Compressed Suffix Arrays for Massive Data

We present a fast space-efficient algorithm for constructing compressed suffix arrays (CSA). The algorithm requires O(n log n) time in the worst case, and only O(n) bits of extra space in addition to the CSA. As the basic step, we describe an algorithm for merging two CSAs. We show that the construction algorithm can be parallelized in a symmetric multiprocessor system, and discuss the possibility of a distributed implementation. We also describe a parallel implementation of the algorithm, capable of indexing several gigabytes per hour

On Constructing Suffix Arrays in External Memory

The construction of full-text indexes on very large text collections is nowadays a hot problem. The suffix array~\cite{Manber-Myers} is one of the most attractive full-text indexing data structures due to its simplicity, space efficiency and powerful/fast search operations supported. In this paper we analyze theoretically and experimentally, the I/O-complexity and the working space of six algorithms for constructing large suffix arrays. Additionally, we design a new external-memory algorithm that follows the basic philosophy underlying the algorithm in~\cite{book-info} but in a significantly different manner, thus combining its good practical qualities with efficient worst-case performances. At the best of our knowledge, this is the first study which provides a wide spectrum of possible approaches to the construction of suffix arrays in external memory, and thus it should be helpful to anyone who is interested in building full-text indexes on very large text collections