Nestmate recognition in the large carpenter bee, Xylocopa virginica /

Abstract Many species of social insects have the ability to recognize their nestmates. In bees, sociality is maintained by bees that recognize which individuals should be helped and which should be hanned in order to maximize fitness (either inclusive or individual) (Hamilton 1964; Lin and Michener 1972). Since female bees generally lay eggs in a single nest, it is highly likely that bees found cohabitating in the same nest are siblings. According to the kin selection hypothesis, individuals should cooperate and avoid aggression with same sex nestmates (Hamilton 1964). However, in opposite sex pairs that are likely kin, aggression should increase among nestmates as an expression of inbreeding avoidance (Lihoreau et al. 2007). Female bees often guard nest entrances, recognizing and excluding foreign conspecific females that threaten to steal nest resources (Breed and Page 1991). Conversely, males that aggressively guard territories should avoid aggression towards other males that are likely kin (Shellman-Reeve and Gamboa 1984). In order to test whether Xy/ocopa virginica can distinguish nestmates from non-nestmates, circle tube testing arenas were used. Measures of aggression, cooperation and tolerance were evaluated to detennine the presence of nestmate recognition in this species. The results of this study indicate that male and female X virginica have the ability to distinguish nestmates from non-nestmates. Individuals in same sex pairs demonstrated increased pushing, biting, and C-posturing when faced with non-nestmates. Males in same sex pairs also attempted to pass (unsuccessfully) nOIl-nestmates more often than ncstmates, suggesting that this behaviour may be an cxpression of dominancc in males. Increased cooperation exemplified by successful passes was not observed among nestmates. However, incrcased tolerance in the [onn of head-to-head touching was observed for nestmates in female same sex and opposite sex pairs. These results supported the kin selection hypothesis. Moreover, increased tolerance among opposite sex non-nestmates suggested that X virginica do not demonstrate inbreeding avoidance among nestmates. 3 The second part of this study was conducted to establish the presence and extent of drifting, or travelling to different nests, in a Xylocopa virgillica population. Drifting in flying Hymenoptera is reported to be the result of navigation error and guard bees erroneously admitting novel individuals into the nest (Michener 1966). Since bees in this study were individually marked and captured at nest entrances, the locations where individuals were caught allowed me to determine where and how often bees travelled from nest to nest. Ifbees were captured near their home nests, changing nests may have been deliberate or explained by navigational error. However, ifbees were found in nests further away from their homes, this provides stronger evidence that flying towards a novel nest may have been deliberate. Female bees are often faithful to their own nests (Kasuya 1981) and no drifting was expected in female X virginica because they raise brood and contribute to nest maintenance activities. Contrary to females, males were not expected to remain faithful to a single nest. Results showed that many more females drifted than expected and that they were most often recaptured in a single nest, either their home nest or a novel nest. There were some females that were never caught in the same nest twice. In addition, females drifted to further nests when population density was low (in 2007), suggesting they seek out and claim nesting spaces when they are available. Males, as expected, showed the opposite pattern and most males drifted from nest to nest, never recaptured in the same location. This pattern indicates that males may be nesting wherever space is available, or nesting in benches nearest to their territories. This study reveals that both female and male X virginica are capable of nestmate recognition and use this ability in a dynamic environment, where nest membership is not as stable as once thought.

Effects of large anphiphilic ligands upon the spectra and kinetics of cytochrome C oxidase

Cytoch ro me c oxidase (ferrocytochrome c : 02 oxidoreductase ; EC 1.9. 3.1) is the terminal enzyme in the mitochondrial electron transport chain, catalyzing the transfer of electrons from ferrocytochrome c to molecular oxygen. The effects of two large amphiphilic molecules .. valinomycin and dibucaine upon the spectra of the isolated enzyme and upon the activity of both isolated enzyme and enzyme in membrane systems are investigated by using spectrophotometric and oxygen electrode techniques. The results show that both valinomycin and dibucaine change the Soret region of the spectrum and cause a partial inhibition in a concentration range higher than that in which they act as ionophores. It is concluded that both valinomycin and dibucain~ binding induce a conformational change of the protein structure which modifies the spectrum of the a3 CUB centre and diminishes the rate of electron transfer between cytochrome a and the binuclear centre.

Effects of large anphiphilic ligands upon the spectra and kinetics of cytochrome C oxidase

Cytoch ro me c oxidase (ferrocytochrome c : 02 oxidoreductase ; EC 1.9. 3.1) is the terminal enzyme in the mitochondrial electron transport chain, catalyzing the transfer of electrons from ferrocytochrome c to molecular oxygen. The effects of two large amphiphilic molecules - valinomycin and dibucaine upon the spectra of the isolated enzyme and upon the activity of both isolated enzyme and enzyme in membrane systems are investigated by using spectrophotometric and oxygen electrode techniques. The results show that both valinomycin and dibucaine change the Soret region of the speetrum and cause a partial inhibition in a concentration range higher than that in which they act as ionophores. It is concluded that both valinomycin and dibucaine binding induce a conformational change of the protein structure which modifies the spectrum of the a3 CUB centre and diminishes the rate of electron transfer between cytochrome a and the binuclear centre.

Genetic programming for the RoboCup Rescue Simulation System

The Robocup Rescue Simulation System (RCRSS) is a dynamic system of multi-agent interaction, simulating a large-scale urban disaster scenario. Teams of rescue agents are charged with the tasks of minimizing civilian casualties and infrastructure damage while competing against limitations on time, communication, and awareness. This thesis provides the first known attempt of applying Genetic Programming (GP) to the development of behaviours necessary to perform well in the RCRSS. Specifically, this thesis studies the suitability of GP to evolve the operational behaviours required of each type of rescue agent in the RCRSS. The system developed is evaluated in terms of the consistency with which expected solutions are the target of convergence as well as by comparison to previous competition results. The results indicate that GP is capable of converging to some forms of expected behaviour, but that additional evolution in strategizing behaviours must be performed in order to become competitive. An enhancement to the standard GP algorithm is proposed which is shown to simplify the initial search space allowing evolution to occur much quicker. In addition, two forms of population are employed and compared in terms of their apparent effects on the evolution of control structures for intelligent rescue agents. The first is a single population in which each individual is comprised of three distinct trees for the respective control of three types of agents, the second is a set of three co-evolving subpopulations one for each type of agent. Multiple populations of cooperating individuals appear to achieve higher proficiencies in training, but testing on unseen instances raises the issue of overfitting.

Heuristics for the Critical Node Detection Problem in Large Complex Networks

Complex networks have recently attracted a significant amount of research attention due to their ability to model real world phenomena. One important problem often encountered is to limit diffusive processes spread over the network, for example mitigating pandemic disease or computer virus spread. A number of problem formulations have been proposed that aim to solve such problems based on desired network characteristics, such as maintaining the largest network component after node removal. The recently formulated critical node detection problem aims to remove a small subset of vertices from the network such that the residual network has minimum pairwise connectivity. Unfortunately, the problem is NP-hard and also the number of constraints is cubic in number of vertices, making very large scale problems impossible to solve with traditional mathematical programming techniques. Even many approximation algorithm strategies such as dynamic programming, evolutionary algorithms, etc. all are unusable for networks that contain thousands to millions of vertices. A computationally efficient and simple approach is required in such circumstances, but none currently exist. In this thesis, such an algorithm is proposed. The methodology is based on a depth-first search traversal of the network, and a specially designed ranking function that considers information local to each vertex. Due to the variety of network structures, a number of characteristics must be taken into consideration and combined into a single rank that measures the utility of removing each vertex. Since removing a vertex in sequential fashion impacts the network structure, an efficient post-processing algorithm is also proposed to quickly re-rank vertices. Experiments on a range of common complex network models with varying number of vertices are considered, in addition to real world networks. The proposed algorithm, DFSH, is shown to be highly competitive and often outperforms existing strategies such as Google PageRank for minimizing pairwise connectivity.

Canadian Niagara Power Glass Slide - Large Group in Tunnel

A large group of men in hard hats in the tunnel. The names of the men are unknown.

Canadian Niagara Power Company - Large group photo in tunnel

Large group of men standing in the tunnel wearing boots and hard hats.

STRUCTURAL ANALYSIS, LAYER THICKNESS MEASUREMENTS AND MINERALOGICAL INVESTIGATION OF THE LARGE INTERIOR LAYERED DEPOSIT WITHIN GANGES CHASMA, VALLES MARINERIS, MARS

The interior layered deposit (ILD) in Ganges Chasma, Valles Marineris, is a 4.25 km high mound that extends approximately 110 km from west to east. The deposition, deformation, and erosion history of the Ganges ILD records aids in identifying the processes that formed and shaped the Chasma. To interpret structural and geomorphic processes acting on the ILD, multiple layer attitudes and layer thickness transects were conducted on the Ganges ILD. Mineralogical data was analyzed to determine correlations between materials and landforms. Layer thickness measurements indicate that the majority of layers are between 0.5 m and 4 m throughout the ILD. Three major benches dominate the Ganges ILD. Layer thicknesses increase at the ILD benches, suggesting that the benches are formed from the gradual thickening of layers. This indicates that the benches are depositional features draping over basement topography. Layer attitudes indicate overall shallow dips generally confined to a North-South direction that locally appear to follow bench topography. Layering is disrupted on a scale of 40 m to 150 m in 12 separate locations throughout the ILD. In all locations, underlying layering is disturbed by overlying folded layers in a trough-like geometry. These features are interpreted to have formed as submarine channels in a lacustrine setting, subsequently infilled by sediments. Subsequently, the channels were eroded to the present topography, resulting in the thin, curved layering observed. Data cannot conclusively support one ILD formation hypothesis, but does indicate that the Ganges ILD postdates Chasma formation. The presence of water altered minerals, consistently thin layering, and layer orientations provide strong evidence that the ILD formed in a lacustrine setting.

Photograph - Woman Standing by a Large Tree Trunk

A woman wearing a hat and holding a small purse. She is standing next to a large tree trunk and there are benches behind her.

Safe Handling of Large Animals

The article discusses improving welfare by reducing fear by studying: Animal Sensory Perception, Animal Behavior Patterns, Animal Habituation and Temperament, Effects of Previous Handling, Training Animals, Training Time and Temperament, Genetic Effects on Handling, Handling of escaped Animals, Facilities, Aggression in Grazing Animals, Inherent Danger of Large Animals, Cattle and Car Accidents.

Dynamics in large scale networks

In this thesis we study the properties of two large dynamic networks, the competition network of advertisers on the Google and Bing search engines and the dynamic network of friend relationships among avatars in the massively multiplayer online game (MMOG) Planetside 2. We are particularly interested in removal patterns in these networks. Our main finding is that in both of these networks the nodes which are most commonly removed are minor near isolated nodes. We also investigate the process of merging of two large networks using data captured during the merger of servers of Planetside 2. We found that the original network structures do not really merge but rather they get gradually replaced by newcomers not associated with the original structures. In the final part of the thesis we investigate the concept of motifs in the Barabási-Albert random graph. We establish some bounds on the number of motifs in this graph.

A Scalability Study and New Algorithms for Large-Scale Many-Objective Optimization

Many real-world optimization problems contain multiple (often conflicting) goals to be optimized concurrently, commonly referred to as multi-objective problems (MOPs). Over the past few decades, a plethora of multi-objective algorithms have been proposed, often tested on MOPs possessing two or three objectives. Unfortunately, when tasked with solving MOPs with four or more objectives, referred to as many-objective problems (MaOPs), a large majority of optimizers experience significant performance degradation. The downfall of these optimizers is that simultaneously maintaining a well-spread set of solutions along with appropriate selection pressure to converge becomes difficult as the number of objectives increase. This difficulty is further compounded for large-scale MaOPs, i.e., MaOPs possessing large amounts of decision variables. In this thesis, we explore the challenges of many-objective optimization and propose three new promising algorithms designed to efficiently solve MaOPs. Experimental results demonstrate the proposed optimizers to perform very well, often outperforming state-of-the-art many-objective algorithms.

Transfers and Municipal Infrastructure Expenditures in Canada: 1988-2003. Is There a Flypaper Effect?.

Rapport de recherche