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.

Evolutionary Origin and Maintenance of Sociality in the Small Carpenter Bees

Many arthropods exhibit behaviours precursory to social life, including adult longevity, parental care, nest loyalty and mutual tolerance, yet there are few examples of social behaviour in this phylum. The small carpenter bees, genus Ceratina, provide important insights into the early stages of sociality. I described the biology and social behaviour of five facultatively social species which exhibit all of the preadaptations for successful group living, yet present ecological and behavioural characteristics that seemingly disfavour frequent colony formation. These species are socially polymorphic with both / solitary and social nests collected in sympatry. Social colonies consist of two adult females, one contributing both foraging and reproductive effort and the second which remains at the nest as a passive guard. Cooperative nesting provides no overt reproductive benefits over solitary nesting, although brood survival tends to be greater in social colonies. Three main theories explain cooperation among conspecifics: mutual benefit, kin selection and manipulation. Lifetime reproductive success calculations revealed that mutual benefit does not explain social behaviour in this group as social colonies have lower per capita life time reproductive success than solitary nests. Genetic pedigrees constructed from allozyme data indicate that kin selection might contribute to the maintenance of social nesting -, as social colonies consist of full sisters and thus some indirect fitness benefits are inherently bestowed on subordinate females as a result of remaining to help their dominant sister. These data suggest that the origin of sociality in ceratinines has principal costs and the great ecological success of highly eusociallineages occurred well after social origins. Ecological constraints such as resource limitation, unfavourable weather conditions and parasite pressure have long been considered some of the most important selective pressures for the evolution of sociality. I assessed the fitness consequences of these three ecological factors for reproductive success of solitary and social colonies and found that nest sites were not limiting, and the frequency of social nesting was consistent across brood rearing seasons. Local weather varied between seasons but was not correlated with reproductive success. Severe parasitism resulted in low reproductive success and total nest failure in solitary nests. Social colonies had higher reproductive success and were never extirpated by parasites. I suggest that social nesting represents a form of bet-hedging. The high frequency of solitary nests suggests that this is the optimal strategy when parasite pressure is low. However, social colonies have a selective advantage over solitary nesting females during periods of extreme parasite pressure. Finally, the small carpenter bees are recorded from all continents except Antarctica. I constructed the first molecular phylogeny of ceratinine bees based on four gene regions of selected species covering representatives from all continents and ecological regions. Maximum parsimony and Bayesian Inference tree topology and fossil dating support an African origin followed by an Old World invasion and New World radiation. All known Old World ceratinines form social colonies while New World species are largely solitary; thus geography and phylogenetic inertia are likely predictors of social evolution in this genus. This integrative approach not only describes the behaviour of several previously unknown or little-known Ceratina species, bu~ highlights the fact that this is an important, though previously unrecognized, model for studying evolutionary transitions from solitary to social behaviour.

The Implications of Forager Behaviour for Social Organisation in a Socially Polymorphic Carpenter Bee (Xylocopa virginica)

In social Hymenoptera, the division of labour is a major step in the evolution of sociality. Bees, which express many different kinds of sociality, can be classified according to how individuals share or do not share foraging and reproductive activities (Michener, 1974). The large carpenter bee, Xylocopa virginica, lives in populations with both solitary and social nests. In social nests, reproduction is controlled by the dominant female, who does all of her own foraging and egg-laying, while the subordinates guard the nest only. This study examined foraging behaviour as a way to classify the social hierarchy. Individual females were marked, measured and intensely observed for the foraging season. It was found that a large number of subordinates forage and likely obtain more reproductive fitness than previously thought. The dominance hierarchy is very likely a social queue, in which bees take turns foraging and egg-laying.

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.

Simulation-Based Finite and Large Sample Tests in Multivariate Regressions.

In the context of multivariate linear regression (MLR) models, it is well known that commonly employed asymptotic test criteria are seriously biased towards overrejection. In this paper, we propose a general method for constructing exact tests of possibly nonlinear hypotheses on the coefficients of MLR systems. For the case of uniform linear hypotheses, we present exact distributional invariance results concerning several standard test criteria. These include Wilks' likelihood ratio (LR) criterion as well as trace and maximum root criteria. The normality assumption is not necessary for most of the results to hold. Implications for inference are two-fold. First, invariance to nuisance parameters entails that the technique of Monte Carlo tests can be applied on all these statistics to obtain exact tests of uniform linear hypotheses. Second, the invariance property of the latter statistic is exploited to derive general nuisance-parameter-free bounds on the distribution of the LR statistic for arbitrary hypotheses. Even though it may be difficult to compute these bounds analytically, they can easily be simulated, hence yielding exact bounds Monte Carlo tests. Illustrative simulation experiments show that the bounds are sufficiently tight to provide conclusive results with a high probability. Our findings illustrate the value of the bounds as a tool to be used in conjunction with more traditional simulation-based test methods (e.g., the parametric bootstrap) which may be applied when the bounds are not conclusive.

Simulation-Based Finite-and Large-sample Inference Methods in Multivariate Regressions and Seemingly Unrelated Regressions

In the context of multivariate regression (MLR) and seemingly unrelated regressions (SURE) models, it is well known that commonly employed asymptotic test criteria are seriously biased towards overrejection. in this paper, we propose finite-and large-sample likelihood-based test procedures for possibly non-linear hypotheses on the coefficients of MLR and SURE systems.