The efficacy of anti-predator behaviour in the wood fog tadpole (Rana sylvatica) /

Activity has been suggested as an important behaviour that is tightly linked with predator avoidance in tadpoles. In this thesis I examine predator-prey relationships using wood frog tadpoles {Rana sylvaticd) as prey and dragonfly larvae {AnaxJunius) and backswimmers {Notonecta undulatd) as predators. I explore the role of prey activity in predator attack rates, prey response to single and multiple predator introductions, and prey survivorship. The data suggest that Anax is the more successful predator, able to capture both active and inactive tadpoles. In contrast, Notonecta strike at inactive prey less frequently and are seldom successftil when they do. A mesocosm study revealed that the presence of any predator resulted in reduced activity level of tadpoles. Each predator species alone had similar effects on tadpole activity, as did the combined predator treatment. Tadpole survivorship, however, differed significantly among both predator treatments and prey populations. Tadpwles in the combined predator treatment had enhanced risk; survivorship was lower than that expected if the two predators had additive effects. Differences in survivorship among wood frog populations showed that tadpoles from a lake habitat had the lowest survivorship, those from a shallow pond habitat had an intermediate survivorship, and tadpoles from a marsh habitat had the highest survivorship. The frequency of interactions with predators in the native habitat may be driving the population differences observed. In conclusion, results from this study show that complex interactions exist between predators, prey, and the environment, with activity playing a key role in the survival of tadpoles.

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 (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.

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.

Anti-Oedipus en-procés : a comparative analysis of Kristeva and Deleuze & Guattari

The present thesis is an attempt to bring into dialogue what appear to be two radically different approaches of negotiating subjectivity in late Western Modernity. Here the thought of Julia Kristeva as well as Gilles Deleuze and Felix Guattari are fully engaged. These thinkers, the latter two being considered as one, have until now remained strangers to one another. Consequently much confusion has amassed concerning their respective philosophical, as well as social/political projects. I take up the position that Deleuze and Guattari's account of subjectivity is a commendable attempt to understand a particular type of historical subject: late modern Western man. However I claim that their account comes up short insofar as I argue that they lack the theoretical language in order to fully, and successfully, make their point. Thus I argue that their system does not stand up to its own claims. On the contrary, by embracing the psychoanalytic tradition - staying rather close to the Freudian and Kleinian schools of thought - I argue that it is in fact Kristeva that is better equipped to provide an account of this particular subject. Considerable time is invested in fleshing out the notion of the Other insofar as this Other is central to the constitution of subjectivity. This Other - insofar as this Other is to be found in Kristeva's notion of the chora -- is something I claim that Deleuze and Guattari simply undervalued.

Between the panels: How anti-Black racism has recycled myths of the Black body in comic books

Anti-Black racism continues to be a widespread problem, and as such deserves investigation and elimination. As Jackson (2006) says; “There is a hyperawareness…of the negative inscriptions associated with the Black masculine body as criminal, angry and incapacitated.” (2) To continue the study of the changing face of racism, the researcher must be well equipped with a contemporary methodology which is adaptable and exploratory. Due to the malleability of racism, research into its elimination must make inroads to areas that have heretofore been neglected and overlooked by traditional academic study. This project achieves a unique perspective by undertaking a theoretical exploration of racist stereotypes and motifs in the world of mass produced superhero comic books, a genre of comics which has neither yet been thoroughly investigated for the use of racist stereotypes nor been the focus of anti-racist scholarship.

Square Root Finding In Graphs

Abstract: Root and root finding are concepts familiar to most branches of mathematics. In graph theory, H is a square root of G and G is the square of H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Graph square is a basic operation with a number of results about its properties in the literature. We study the characterization and recognition problems of graph powers. There are algorithmic and computational approaches to answer the decision problem of whether a given graph is a certain power of any graph. There are polynomial time algorithms to solve this problem for square of graphs with girth at least six while the NP-completeness is proven for square of graphs with girth at most four. The girth-parameterized problem of root fining has been open in the case of square of graphs with girth five. We settle the conjecture that recognition of square of graphs with girth 5 is NP-complete. This result is providing the complete dichotomy theorem for square root finding problem.

Making Queer Anti-capitalist Resistance Intelligible: Reading Queer Childhood in the Ruins of Neoliberalism

In challenging normative social relations, queer cultural studies has shied away from deploying historical materialist theoretical tools. My research addresses this gap by drawing these two literatures into conversation. I do so by investigating how global economic relations provide an allegorical and material context for the regulation, representation and re-imagining of working-class queer childhood through anti- capitalist queer readings of three films: Kes, Billy Elliot, and Boys Village. I deploy this reading practice to investigate how these films represent heteronormative capitalism’s systematic extermination of the life possibilities of working class children, how children resist forces of normalisation by creating queer times and spaces, and how nostalgia engenders a spatio-temporal understanding of queerness through a radical utopianism. My analysis foregrounds visual cultural productions as sites for understanding how contemporary social worlds exclude queer working class children, who struggle to insert themselves into and thereby shift the grounds of normative social relations.

Rings, Group Rings, and Their Graphs

We associate some graphs to a ring R and we investigate the interplay between the ring-theoretic properties of R and the graph-theoretic properties of the graphs associated to R. Let Z(R) be the set of zero-divisors of R. We define an undirected graph ᴦ(R) with nonzero zero-divisors as vertices and distinct vertices x and y are adjacent if xy=0 or yx=0. We investigate the Isomorphism Problem for zero-divisor graphs of group rings RG. Let Sk denote the sphere with k handles, where k is a non-negative integer, that is, Sk is an oriented surface of genus k. The genus of a graph is the minimal integer n such that the graph can be embedded in Sn. The annihilating-ideal graph of R is defined as the graph AG(R) with the set of ideals with nonzero annihilators as vertex such that two distinct vertices I and J are adjacent if IJ=(0). We characterize Artinian rings whose annihilating-ideal graphs have finite genus. Finally, we extend the definition of the annihilating-ideal graph to non-commutative rings.

Acyclic 5-Choosability of Planar Graphs Without Adjacent Short Cycles

The conjecture claiming that every planar graph is acyclic 5-choosable[Borodin et al., 2002] has been verified for several restricted classes of planargraphs. Recently, O. V. Borodin and A. O. Ivanova, [Journal of Graph Theory,68(2), October 2011, 169-176], have shown that a planar graph is acyclically 5-choosable if it does not contain an i-cycle adjacent to a j-cycle, where 3<=j<=5 if i=3 and 4<=j<=6 if i=4. We improve the above mentioned result and prove that every planar graph without an i-cycle adjacent to a j-cycle with3<=j<=5 if i=3 and 4<=j<=5 if i=4 is acyclically 5-choosable.

Edge-choosability of Planar Graphs

According to the List Colouring Conjecture, if G is a multigraph then χ' (G)=χl' (G) . In this thesis, we discuss a relaxed version of this conjecture that every simple graph G is edge-(∆ + 1)-choosable as by Vizing’s Theorem ∆(G) ≤χ' (G)≤∆(G) + 1. We prove that if G is a planar graph without 7-cycles with ∆(G)≠5,6 , or without adjacent 4-cycles with ∆(G)≠5, or with no 3-cycles adjacent to 5-cycles, then G is edge-(∆ + 1)-choosable.

Subjective Ambivalence and the Expression of Anti-Gay Bias

Univalent attitudes toward gay people have been widely studied, but no research to date has examined ambivalent (i.e., torn, conflicted) attitudes toward gay people. However, the Justification-Suppression Model (JSM; Crandall & Eshleman, 2003) proposes that ambivalence leads to biased expressions through intrapsychic processes which facilitate biased expression, particularly in contexts presenting strong justifications for expressing prejudice and weak pressures to suppress prejudice. I test these implications in the context of bias toward gay people. In Study 1, the measurement of ambivalence is examined in terms of both subjective ambivalence (i.e., the reported experience of “torn” attitudes) and calculated ambivalence (i.e., mathematical conflict between positive and negative attitude components). I find that higher subjective ambivalence is only associated with more negative attitudes toward gay people (and not positive attitudes toward gay people), and that higher subjective ambivalence predicts less gay rights support even after taking negative and positive attitudes toward gay people into account. Further, higher subjective ambivalence is associated with ideological opposition to gay people and more negative intergroup emotions (e.g., intergroup disgust). These findings suggest it is valuable to examine the unique component of subjective ambivalence separate from univalent negativity. Because calculated ambivalence measures are mathematically dependent upon a univalent negative measure, they cannot be examined separately from negativity. Therefore, subjective ambivalence is the focus of Study 2. The main goals of Study 2 were to determine why and when subjective ambivalence is related to bias. I examined the extent to which the negative relation between subjective ambivalence and opposition to anti-gay bullying can be accounted for by lower intergroup empathy and lower collective guilt, which may facilitate the expression of bias in keeping with the JSM. The relation between subjective ambivalence and anti-gay bullying opposition was examined within four social contexts based on a 2 (high vs. low offensiveness) x 2 (normatively unjustified vs. normatively justified) manipulation. I expected that higher subjective ambivalence would be most strongly related to lower intergroup empathy and collective guilt when there are the strongest justifications for bias expression, and that lower intergroup empathy and collective guilt would lead to less opposition to anti-gay bullying. Higher subjective ambivalence predicted less anti-gay bullying opposition. After accounting for positivity and negativity, the direct effect of subjective ambivalence was no longer significant, yet subjective ambivalence uniquely predicted intergroup empathy, which in turn predicted less anti-gay bullying opposition. These findings provide evidence that subjective ambivalence is largely negative in nature, but also presents evidence for a unique component of subjective ambivalence (separate from univalent attitudes) associated with low intergroup empathy and negativity. In contrast to previous research, I found very little evidence for the context-dependency of subjective ambivalence. Further research on subjective ambivalence, including subjective ambivalence toward other social groups, may expand our understanding of the factors leading to biased expressions.