A minor theory of the transit of materiality into discourse, Via Campesina.

In this thesis I explore how the material properties of plant seed enter the political discourses of the international peasant coalition the Via Campesina and coalition member the National Fanners Union of Canada (NFU), querying how this process might be employed as a resource for a transformative eco-social politics. I employ several post-structural theoretical constructs, configuring them together as a "minor theory". This minor theory provides the basis for a "minor" reading of three sets of Via Campesina and NFU texts. The aim of these readings is to track the movement of seed from a local agricultural concern to a transitive political one, across both the material and discursive registers. In surfacing the presence of the seed's physical properties in the three texts, I highlight the distinctions between the constraining seed of corporate industrial agriculture, and the social and agroecological opportunities resulting from what I call a "Seed Event".

Properties and algorithms of the (n, k)-arrangement graphs

The (n, k)-arrangement interconnection topology was first introduced in 1992. The (n, k )-arrangement graph is a class of generalized star graphs. Compared with the well known n-star, the (n, k )-arrangement graph is more flexible in degree and diameter. However, there are few algorithms designed for the (n, k)-arrangement graph up to present. In this thesis, we will focus on finding graph theoretical properties of the (n, k)- arrangement graph and developing parallel algorithms that run on this network. The topological properties of the arrangement graph are first studied. They include the cyclic properties. We then study the problems of communication: broadcasting and routing. Embedding problems are also studied later on. These are very useful to develop efficient algorithms on this network. We then study the (n, k )-arrangement network from the algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms such as prefix sums computation, sorting, merging and basic geometry computation: finding convex hull on the (n, k )-arrangement graph. A literature review of the state-of-the-art in relation to the (n, k)-arrangement network is also provided, as well as some open problems in this area.

Mating behaviours of the field cricket (Gryllus integer) at different levels of male density

The reproductive behaviour of the field cricket, Gryllus integer, was systematically observed in indoor arenas to determine the extent of female Choice and male-male competition at different sex ratios representing two male densities (12:6 and 6:6). The costs and benefits to males and females in those two densities were analyzed according to the theory of the evolution o£ leks. Observations were conducted during the dark hours when most calling occurred since hourly rates of courtship song and mating did not fluctuate significantly over a 24 h period. Female mating rates were not significantly different between densities, therefore males at high densities were not advantaged because of increased female tendencies to mate when social stimulation was increased. Mean rates of acoustical signalling (calling and courtin"g) did not differ significantly between densities. Mean rates of fighting by males at the high density were significantly greater than those of males at the low density. Mating benefits associated with callin~courting and fighting were measured. Mating rates did not vary with rates of calling at either density. Calling was not a prerequisite to mating. Courtship song preceded all matings. There was a significant power fit between male mating and courting rates, and male mating and fighting rates at the low, but not at the high, density. Density differences in the benefits associated with increased courting and fighting may relate, in part, to greater economic defensibility and monopoly of females due to reduced male competition at the low density. Dominant males may be preferentially chosen by females or better able to monopolize mating opportunities than subordinate males. Three criteria were used to determine whether dominant males were preferentially chosen by females. The number of matings by males who won fights (within 30 min of mating) was significantly greater than the number of matings by males who were defeated in such fights. Mating rates did not vary significantly with rates of winning at either density. There was a significant power fit between male mating rates and the percentage of fights a male won (irrespective of his fighting-frequency) at the low density. The mean duration a male guarded the female after mating did not vary significantly between densities. There was a significant linear relationship between the duration a spermatophore was retained and the duration a male guarded the female after mating. Courtship song apparently stimulated spermatophore removal. Male guarding involved inter-male aggression and reduced courtship attempts by other males. Males at the high density received no apparent reproductive benefits associated with increased social stimulation. Conclusive evidence for preferential choice of males by females, using the criteria examined here, is lacking. Males at the lower density had fewer competitors and could monopolize females more effectively.

Properties and algorithms of the (n, k)-star graphs

The (n, k)-star interconnection network was proposed in 1995 as an attractive alternative to the n-star topology in parallel computation. The (n, k )-star has significant advantages over the n-star which itself was proposed as an attractive alternative to the popular hypercube. The major advantage of the (n, k )-star network is its scalability, which makes it more flexible than the n-star as an interconnection network. In this thesis, we will focus on finding graph theoretical properties of the (n, k )-star as well as developing parallel algorithms that run on this network. The basic topological properties of the (n, k )-star are first studied. These are useful since they can be used to develop efficient algorithms on this network. We then study the (n, k )-star network from algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms for basic communication, prefix computation, and sorting, etc. A literature review of the state-of-the-art in relation to the (n, k )-star network as well as some open problems in this area are also provided.

Properties and Algorithms of the KCube Graphs

The KCube interconnection topology was rst introduced in 2010. The KCube graph is a compound graph of a Kautz digraph and hypercubes. Compared with the at- tractive Kautz digraph and well known hypercube graph, the KCube graph could accommodate as many nodes as possible for a given indegree (and outdegree) and the diameter of interconnection networks. However, there are few algorithms designed for the KCube graph. In this thesis, we will concentrate on nding graph theoretical properties of the KCube graph and designing parallel algorithms that run on this network. We will explore several topological properties, such as bipartiteness, Hamiltonianicity, and symmetry property. These properties for the KCube graph are very useful to develop efficient algorithms on this network. We will then study the KCube network from the algorithmic point of view, and will give an improved routing algorithm. In addition, we will present two optimal broadcasting algorithms. They are fundamental algorithms to many applications. A literature review of the state of the art network designs in relation to the KCube network as well as some open problems in this field will also be given.