A parallel formulation for the simulation of a generic branch predictor

A parallel formulation for the simulation of a branch prediction algorithm is presented. This parallel formulation identifies independent tasks in the algorithm which can be executed concurrently. The parallel implementation is based on the multithreading model and two parallel programming platforms: pthreads and Cilk++. Improvement in execution performance by up to 7 times is observed for a generic 2-bit predictor in a 12-core multiprocessor system.

The curious case of the camelthorn: competition, coexistence and nest-site limitation in a multispecies mutualism

Myrmecophyte plants house ants in domatia in exchange for protection from herbivores. Ant-myrmecophyte mutualisms exhibit two general patterns due to competition between ants for plant occupancy: i) domatia nest-sites are a limiting resource and ii) each individual plant hosts one ant species at a time. However, individual camelthorn trees (Vachellia erioloba) typically host two to four ant species simultaneously, often coexisting in adjacent domatia on the same branch. Such fine-grain spatial coexistence brings into question the conventional wisdom on ant-myrmecophyte mutualisms. Camelthorn ants appear not to be nest-site limited, despite low abundance of suitable domatia, and have random distributions of nest-sites within and across trees. These patterns suggest a lack of competition between ants for domatia and contrast strongly with other ant-myrmecophyte systems. Comparison of this unusual case with others suggests that spatial scale is crucial to coexistence or competitive exclusion involving multiple ant species. Furthermore, coexistence may be facilitated when co-occurring ant species diverge strongly on at least one niche axis. Our conclusions provide recommendations for future ant-myrmecophyte research, particularly in utilising multispecies systems to further our understanding of mutualism biology.

Ecological niche modeling and geographical distribution of pollinator and plants: A case study of Peponapis fervens (Smith, 1879) (Eucerini: Apidae) and Cucurbita species (Cucurbitaceae)

The bees of the Peponapes genus (Eucerini, Apidae) have a Neotropical distribution with the center of species diversity located in Mexico and are specialized in Cucurbita plants. which have many species of economic importance. such as squashes and pumpkins Peponapis fervens is the only species of the genus known from southern South America The Cucurbita species occurring in the same area as P fervens Include four domesticated species (C ficifolia, C maxima maxima, C moschata and C pepo) and one non-domesticated species (Cucurbita maxima andreana) It was suggested that C. in andreana was the original pollen source to P fervens, and this bee expanded its geographical range due to the domestication of Cucurbita The potential geographical areas of these species were determined and compared using ecological niche modeling that was performed with the computational system openModeller and GARP with best subsets algorithm The climatic variables obtained through modeling were compared using Cluster Analysis Results show that the potential areas of domesticated species practically spread all over South America The potential area of P fervens Includes the areas of C m andreana but reaches a larger area, where the domesticated species of Cucurbita also Occur The Cluster Analysis shows a high climatic similarity between P fervens and C. m. andreana Nevertheless. P fervens presents the ability to occupy areas with wider ranges of climatic variables and to exploit resources provided by domesticated species (C) 2009 Elsevier B V All rights reserved

Potamotrygon tigrina, a new species of freshwater stingray from the upper Amazon basin, closely related to Potamotrygon schroederi Fernandez-Yepez, 1958 (Chondrichthyes: Potamotrygonidae)

A new species of Neotropical freshwater stingray, family Potamotrygonidae, is described from the Rio Nanay in the upper Rio Amazonas basin of Peru. Potamotrygon tigrina, n. sp., is easily distinguished from all congeners by its conspicuous dorsal disc coloration, composed of bright yellow to orange vermiculations strongly interwoven with a dark-brown to deep-black background. Additional features that in combination diagnose P. tigrina, n. sp., include the presence of a single angular cartilage, low and not closely grouped dorsal tail spines, and coloration of tail composed of relatively wide and alternating bands of creamy white and dark brown to black. Potamotrygon tigrina is closely related to Potamotrygon schroederi Fernandez-Yepez, 1958, which occurs in the Rio Negro (Brazil) and Rio Orinoco (Venezuela, Colombia). Both species are very similar in proportions and counts, and share features hypothesized to be derived within Potamotrygonidae, related to their specific angular cartilage morphology, distal tail color, dorsal tail-spine pattern, and ventral lateral-line system. To further substantiate the description of P. tigrina, n. sp., we provide a redescription of P. schroederi based on material from the Rio Negro (Brazil) and Rio Orinoco (Venezuela). Specimens from the two basins differ in number of vertebral centra and slightly in size and frequency of rosettes on dorsal disc, distinctions that presently do not warrant their specific separation. Potamotrygon tigrina is frequently commercialized in the international aquarium trade but virtually nothing is known of its biology or conservation status.

U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem

This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed method to the sequential floating forward selection (SFFS), which is a popular heuristic that gives good results in very short computational time. In all experiments, the proposed method got better or equal results in similar or even smaller computational time. (C) 2009 Elsevier Ltd. All rights reserved.

James Bond-temats musikaliska förändringar : Från Dr. No till Casino Royale

I denna uppsats har den musikaliska förändringen i James Bond-temat, sett över de 21 filmer som gjorts fram till denna uppsats genomförande, analyserats och tolkats. Syftet är att dela med mig av mina tankar och analyser om hur temat framförts och utvecklats, samt därmed också bidra till att utveckla kunskapen om James Bond-världen.Efter en litteraturbaserad del, där bakgrunden till James Bond-temats uppkomst behandlas, så analyseras sedan film för film i Bond-serien från Dr. No till Casino Royale. Analysen tar främst upp delarna synkronisering, instrumentering och influenser.Analyserna visar på att James Bond-temat i grund och botten bygger på samma melodi genom alla filmer, men också har förändrats i stor utsträckning i utförandet.

Branch and Bound Algorithm for Multiprocessor Scheduling

The multiprocessor task graph scheduling problem has been extensively studied asacademic optimization problem which occurs in optimizing the execution time of parallelalgorithm with parallel computer. The problem is already being known as one of the NPhardproblems. There are many good approaches made with many optimizing algorithmto find out the optimum solution for this problem with less computational time. One ofthem is branch and bound algorithm.In this paper, we propose a branch and bound algorithm for the multiprocessor schedulingproblem. We investigate the algorithm by comparing two different lower bounds withtheir computational costs and the size of the pruned tree.Several experiments are made with small set of problems and results are compared indifferent sections.

Produktion, skador och grenegenskaper hos 10-årig tall i ett kombinerat förbands- och avkommeförsök : Volume production, damages and branch properties in a 10-year old combined spacing and progeny trial of Scots pine

A Scots pine (Pinus sylvestris) progeny trial was established in 1990, in the southwestern part of Sweden. The offspring was from 30 plus trees. The trial is located on abandoned agricultural land and has a single tree block design with a variation in spacing. The trial has been damaged by voles. At a tree age of ten years, growth, damages and branch properties were estimated. An analysis of variance on height, diameter and stem volume shows significant difference between spacing and progenies as well as interactions between these factors. As indicated by a better annual height increment and fewer and thinner branches at each whorl the densest spacing has the highest potential to produce quality logs.There were also differences between progenies in growth and quality traits. Some progenies combined good growth and branch characters with low mortality, straight stems and few damages. Other progenies had superior volume production.