Habitat selection of three rodents in a frequently burned boreal environment : productivity and habitat diversity

How does fire affect the plant and animal community of the boreal forest? This study attempted to examine the changes in plant composition and productivity, and small mammal demography brought about by fire in the northern boreal environment at Chick Lake, N.W.T. (65053fN, 128°14,W). Two 5*6 ha plots measuring 375m x 150m were selected for study during the summers of 1973 and 197^. One had been unburned for 120 years, the other was part of a fire which burned in the spring of 1969. Grids of 15m x 15m were established in each plot and meter square quadrats taken at each of the 250 grid intersections in order to determine plant composition and density. Aerial primary production was assessed by clipping and drying 80 samples of terminal new production for each species under investigation. Small mammal populations were sampled by placing a Sherman live trap at each grid intersection for ten days in every month. The two plots were similar in plant species composition which suggested that most regrowth in the burned area was from rootstocks which survived the fire. The plant data were submitted to a cluster analysis that revealed nine separate species associations, six of which occured in the burned area and eight of which occured in the control. These were subsequently treated as habitats for purposes of comparison with small mammal distributions. The burned area showed a greater productivity in flowers and fruits although total productivity in the control area was higher due to a large contribution from the non-vascular component. Maximum aerial productivity as dry wieght was measured at 157.1 g/m and 207.8 g/m for the burn and control respectively. Microtus pennsylvanicus and Clethrionomys rutilus were the two most common small mammals encountered; Microtus xanthognathus, Synaptomys borealis, and Phenacomys intermedius also occured in the area. Populations of M. pennsylvanicus and C. rutilus were high during the summer of 1973; however, M. pennsylvanicus was rare on the control but abundant on the burn, while C. rutilus was rare on the burn but abundant in the control. During the summer of 197^ populations declined, with the result that few voles of any species were caught in the burn while equal numbers of the two species were caught in the control. During the summer of 1973 M. pennsylvanicus showed a positive association to the most productive habitat type in the burn which was avoided by C. rutilus. In the control £• rutilus showed a similar positive association to the most productive habitat type which was avoided by M. pennsylvanicus. In all cases for the high population year of 1973# the two species never overlapped in habitat preference. When populations declined in 197^f "both species showed a strong association for the most productive habitat in the control. This would suggest that during a high population year, an abundant species can exclude competitors from a chosen habitat, but that this dominance decreases as population levels decrease. It is possible that M. pennsylvanicus is a more efficient competitor in a recently burned environment, while C. rutilus assumes this role once non-vascular regrowth becomes extensive.

Frequency-dependent selection at the amylase locus in Drosophila melanogaster

A. strain of Drosophila melanog-aster deficient in null amylase activity (Amylase ) was isolated from a wild null population of flies. The survivorship of Amylase homozygous flies is very low when the principal dietary carbohydrate source is starch. However, the survivorship of the null Amylase genotype is comparable to the wild type when the dietary starch is replaced by glucose. In addition, the null viability of the amylase-producing and Amylase strains is comparable v and very lm<] f on a medium with no carbohydrates . Furthermore, amylase-producing genotypes were shovm to excrete enzymatically active amylase protein into the food medium. The excreted amylase causes the external breakdown of dietary starch to sugar. These results led to the following null prediction: the viability of the A.mvlase genotype (fed on a starch rich diet) might increase in the presence of individuals which were amylase-producing. It was shown experimentally that such an increase in viability did in fact occur and that this increase v\Tas proportional to the number of mnylase..::producing fli.es present. These results provide a unique example of a non-"competi ti ve inter-genotype interaction, and one where the underlying physio~ logical and biochemical mechanism has been fully understood.

Properties and algorithms of the hyper-star graph and its related graphs

The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some properties of the graph such as connectivity, symmetry properties, embedding properties have been studied by other researchers, routing and broadcasting algorithms have also been designed. This thesis studies the hyper-star graph from both the topological and algorithmic point of view. For the topological properties, we try to establish relationships between hyper-star graphs with other known graphs. We also give a formal equation for the surface area of the graph. Another topological property we are interested in is the Hamiltonicity problem of this graph. For the algorithms, we design an all-port broadcasting algorithm and a single-port neighbourhood broadcasting algorithm for the regular form of the hyper-star graphs. These algorithms are both optimal time-wise. Furthermore, we prove that the folded hyper-star, a variation of the hyper-star, to be maixmally fault-tolerant.

The nesting biology of Ceratina (Hymenoptera: Apidae) in the Niagara Region : new species, nest site selection and parasitism

One of the most common bee genera in the Niagara Region, the genus Ceratina (Hymenoptera: Apidae) is composed of four species, C. dupla, C. calcarata, the very rare C. strenua, and a previously unknown species provisionally named C. near dupla. The primary goal of this thesis was to investigate how these closely related species coexist with one another in the Niagara ~ee community. The first necessary step was to describe and compare the nesting biologies and life histories of the three most common species, C. dupla, C. calcarata and the new C. near dupla, which was conducted in 2008 via nest collections and pan trapping. Ceratina dupla and C. calcarata were common, each comprising 49% of the population, while C. near dupla was rare, comprising only 2% of the population. Ceratina dupla and C. near dupla both nested more commonly in teasel (Dipsacus sp.) in the sun, occasionally in raspberry (Rubus sp.) in the shade, and never in shady sumac (Rhus sp.), while C. calcarata nested most commonly in raspberry and sumac (shaded) and occasionally in teasel (sunny). Ceratina near dupla differed from both C. dupla and C. calcarata in that it appeared to be partially bivoltine, with some females founding nests very early and then again very late in the season. To examine the interactions and possible competition for nests that may be taking place between C. dupla and C. calcarata, a nest choice experiment was conducted in 2009. This experiment allowed both species to choose among twigs from all three substrates in the sun and in the shade. I then compared the results from 2008 (where bees chose from what was available), to where they nested when given all options (2009 experiment). Both C. dupla and C. calcarata had the same preferences for microhabitat and nest substrate in 2009, that being raspberry and sumac twigs in the sun. As that microhabitat and nest substrate combination is extremely rare in nature, both species must make a choice. In nature Ceratina dupla nests more often in the preferred microhabitat (sun), while C. calcarata nests in the preferred substrate (raspberry). Nesting in the shade also leads to smaller clutch sizes, higher parasitism and lower numbers of live brood in C. calcarata, suggesting that C. dupla may be outcompeting C. calcarata for the sunny nesting sites. The development and host preferences of Ceratina parasitoids were also examined. Ceratina species in Niagara were parasitized by no less than eight species of arthropod. Six of these were wasps from the superfamily Chalcidoidea (Hymenoptera), one was a wasp from the family Ichneumonidae (Hymenoptera) and one was a physogastric mite from the family Pyemotidae (Acari). Parasites shared a wide range of developmental strategies, from ichneumonid larvae that needed to consume multiple Ceratina immatures to complete development, to the species from the Eulophidae (Baryscapus) and Encyrtidae (Coelopencyrtus), in which multiple individuals completed development inside a single Ceratina host. Biological data on parasitoids is scarce in the scientific literature, and this Chapter documents these interactions for future research.

Automatic Inference of Graph Models for Complex Networks with Genetic Programming

Complex networks can arise naturally and spontaneously from all things that act as a part of a larger system. From the patterns of socialization between people to the way biological systems organize themselves, complex networks are ubiquitous, but are currently poorly understood. A number of algorithms, designed by humans, have been proposed to describe the organizational behaviour of real-world networks. Consequently, breakthroughs in genetics, medicine, epidemiology, neuroscience, telecommunications and the social sciences have recently resulted. The algorithms, called graph models, represent significant human effort. Deriving accurate graph models is non-trivial, time-intensive, challenging and may only yield useful results for very specific phenomena. An automated approach can greatly reduce the human effort required and if effective, provide a valuable tool for understanding the large decentralized systems of interrelated things around us. To the best of the author's knowledge this thesis proposes the first method for the automatic inference of graph models for complex networks with varied properties, with and without community structure. Furthermore, to the best of the author's knowledge it is the first application of genetic programming for the automatic inference of graph models. The system and methodology was tested against benchmark data, and was shown to be capable of reproducing close approximations to well-known algorithms designed by humans. Furthermore, when used to infer a model for real biological data the resulting model was more representative than models currently used in the literature.

Network Similarity Measures and Automatic Construction of Graph Models using Genetic Programming

A complex network is an abstract representation of an intricate system of interrelated elements where the patterns of connection hold significant meaning. One particular complex network is a social network whereby the vertices represent people and edges denote their daily interactions. Understanding social network dynamics can be vital to the mitigation of disease spread as these networks model the interactions, and thus avenues of spread, between individuals. To better understand complex networks, algorithms which generate graphs exhibiting observed properties of real-world networks, known as graph models, are often constructed. While various efforts to aid with the construction of graph models have been proposed using statistical and probabilistic methods, genetic programming (GP) has only recently been considered. However, determining that a graph model of a complex network accurately describes the target network(s) is not a trivial task as the graph models are often stochastic in nature and the notion of similarity is dependent upon the expected behavior of the network. This thesis examines a number of well-known network properties to determine which measures best allowed networks generated by different graph models, and thus the models themselves, to be distinguished. A proposed meta-analysis procedure was used to demonstrate how these network measures interact when used together as classifiers to determine network, and thus model, (dis)similarity. The analytical results form the basis of the fitness evaluation for a GP system used to automatically construct graph models for complex networks. The GP-based automatic inference system was used to reproduce existing, well-known graph models as well as a real-world network. Results indicated that the automatically inferred models exemplified functional similarity when compared to their respective target networks. This approach also showed promise when used to infer a model for a mammalian brain network.

The Order of Canada Investiture Ceremony Program (Selection of Pages)

A selection of pages from the program for the Order of Canada Investiture Ceremony in 2003 when Dorothy Wetherald Rungeling was a recipient.

Object-Oriented Genetic Programming for the Automatic Inference of Graph Models for Complex Networks

Complex networks are systems of entities that are interconnected through meaningful relationships. The result of the relations between entities forms a structure that has a statistical complexity that is not formed by random chance. In the study of complex networks, many graph models have been proposed to model the behaviours observed. However, constructing graph models manually is tedious and problematic. Many of the models proposed in the literature have been cited as having inaccuracies with respect to the complex networks they represent. However, recently, an approach that automates the inference of graph models was proposed by Bailey [10] The proposed methodology employs genetic programming (GP) to produce graph models that approximate various properties of an exemplary graph of a targeted complex network. However, there is a great deal already known about complex networks, in general, and often specific knowledge is held about the network being modelled. The knowledge, albeit incomplete, is important in constructing a graph model. However it is difficult to incorporate such knowledge using existing GP techniques. Thus, this thesis proposes a novel GP system which can incorporate incomplete expert knowledge that assists in the evolution of a graph model. Inspired by existing graph models, an abstract graph model was developed to serve as an embryo for inferring graph models of some complex networks. The GP system and abstract model were used to reproduce well-known graph models. The results indicated that the system was able to evolve models that produced networks that had structural similarities to the networks generated by the respective target models.

Feature Selection and Classification Using Age Layered Population Structure Genetic Programming

The curse of dimensionality is a major problem in the fields of machine learning, data mining and knowledge discovery. Exhaustive search for the most optimal subset of relevant features from a high dimensional dataset is NP hard. Sub–optimal population based stochastic algorithms such as GP and GA are good choices for searching through large search spaces, and are usually more feasible than exhaustive and deterministic search algorithms. On the other hand, population based stochastic algorithms often suffer from premature convergence on mediocre sub–optimal solutions. The Age Layered Population Structure (ALPS) is a novel metaheuristic for overcoming the problem of premature convergence in evolutionary algorithms, and for improving search in the fitness landscape. The ALPS paradigm uses an age–measure to control breeding and competition between individuals in the population. This thesis uses a modification of the ALPS GP strategy called Feature Selection ALPS (FSALPS) for feature subset selection and classification of varied supervised learning tasks. FSALPS uses a novel frequency count system to rank features in the GP population based on evolved feature frequencies. The ranked features are translated into probabilities, which are used to control evolutionary processes such as terminal–symbol selection for the construction of GP trees/sub-trees. The FSALPS metaheuristic continuously refines the feature subset selection process whiles simultaneously evolving efficient classifiers through a non–converging evolutionary process that favors selection of features with high discrimination of class labels. We investigated and compared the performance of canonical GP, ALPS and FSALPS on high–dimensional benchmark classification datasets, including a hyperspectral image. Using Tukey’s HSD ANOVA test at a 95% confidence interval, ALPS and FSALPS dominated canonical GP in evolving smaller but efficient trees with less bloat expressions. FSALPS significantly outperformed canonical GP and ALPS and some reported feature selection strategies in related literature on dimensionality reduction.

Feature Selection and Classification Using Age Layered Population Structure Genetic Programming

The curse of dimensionality is a major problem in the fields of machine learning, data mining and knowledge discovery. Exhaustive search for the most optimal subset of relevant features from a high dimensional dataset is NP hard. Sub–optimal population based stochastic algorithms such as GP and GA are good choices for searching through large search spaces, and are usually more feasible than exhaustive and determinis- tic search algorithms. On the other hand, population based stochastic algorithms often suffer from premature convergence on mediocre sub–optimal solutions. The Age Layered Population Structure (ALPS) is a novel meta–heuristic for overcoming the problem of premature convergence in evolutionary algorithms, and for improving search in the fitness landscape. The ALPS paradigm uses an age–measure to control breeding and competition between individuals in the population. This thesis uses a modification of the ALPS GP strategy called Feature Selection ALPS (FSALPS) for feature subset selection and classification of varied supervised learning tasks. FSALPS uses a novel frequency count system to rank features in the GP population based on evolved feature frequencies. The ranked features are translated into probabilities, which are used to control evolutionary processes such as terminal–symbol selection for the construction of GP trees/sub-trees. The FSALPS meta–heuristic continuously refines the feature subset selection process whiles simultaneously evolving efficient classifiers through a non–converging evolutionary process that favors selection of features with high discrimination of class labels. We investigated and compared the performance of canonical GP, ALPS and FSALPS on high–dimensional benchmark classification datasets, including a hyperspectral image. Using Tukey’s HSD ANOVA test at a 95% confidence interval, ALPS and FSALPS dominated canonical GP in evolving smaller but efficient trees with less bloat expressions. FSALPS significantly outperformed canonical GP and ALPS and some reported feature selection strategies in related literature on dimensionality reduction.