Memory mixed with desire : a preliminary study of philosophy and literature in the works of Friedrich Nietzsche and Milan Kundera

Memory Mixed with Desire: A preliminary study of Philosophy and Literature in the works of Friedrich Nietzsche and Milan Kundera Robert Spinelli Brock University, Department of Philosophy This thesis studies intertextuality in the works of Friedrich Nietzsche and Milan Kundera through the primary themes of memory and forgetting. The thesis starts with two introductory chapters that delineate memory according to Nietzsche and Kundera respectively. From here, I move into a discussion of Nietzsche's Ubermensch as an example of the type of forgetting that Nietzsche sees as a cure for the overabundance of memory that has led to Christian morality. Next, I explore the Kunderan concept of kitsch as the polar opposite of what Nietzsche has sought in his philosophy, finishing the chapter by tying the two thinkers together in a Kunderan critique of Nietzsche. The thesis ends with a chapter devoted to the Eternal Return beginning with an exegesis of Nietzsche's idea and ending with a similar exegesis of Kundera's treatment of this thought. What I suggest in this chapter is that the Eternal Return might itself be a form of kitsch even in its attempt to revalue existence.

Breeding parameters of great cormorants (Phalacrocorax carbo carbo) at mixed species colonies on Prince Edward Island, Canada

Breeding parameters of Great Cormorants (PkaZac/iOCOfiCLX CCUibo dCUtbo) and Double-crested Cormorants (P. CLU/uXuA CMJhLtllb) were examined at two mixed species colonies at Cape Tryon and Durell Point, Prince Edward Island from 1976 to 1978. Differential access to nests at the two colony sites resulted in more complete demographic data for P. CCUibo than for P. CLUJiituA. In 1911j P. CCtfibo was present at both colonies by 21 March, whereas P. auAAJtuA did not return until 1 April and 16 April at Cape Tryon and Durell Point, respectively. Differences in the arrival chronology by individuals of each species and differences in the time of nest site occupation according to age, are suggested as factors influencing the nest site distribution of P. CXUtbo and P. aiVtituA at Cape Tryon. Forty-eight P. dOJtbo chicks banded at the Durell Point colony between 19 74 and 19 76 returned there to nest as two- to four-year olds in 19 77 and 19 78. Unmarked individuals with clutch-starts in April were likely greater than four years old as all marked two to four-year olds (with one possible exception) in 19 77 and 1978 had clutch-starts in May and June. Seasonal variation in the breeding success of P. dOJibo individuals was examined at Durell Point in 1977. Mean clutch-size, hatching success and fledging success exhibited a seasonal decline. Four- and 5-egg clutches represented the majority (75%) of all P. CCUibo clutches at Durell Point in 1977 and had the highest reproductive success (0.48 and 0.43 chicks fledged per egg laid respectively). Smaller clutches produced small broods with significantly higher chick mortality while larger clutches suffered high egg loss prior to clutch completion.

NMR studies of mixed tetrahaloborates and some related boron trihalide complexes /|nGary John Schrobilgen. -- 260 St. Catharines, Ont. : [s. n.],

Nuclear magnetic resonance spectroscopy has been used to study donor-acceptor complexes of boron trifluoride with several ureas, tetramethylthiourea, tetramethylselenourea, and tetramethylquanidine as well as adducts of tetramethyl- -urea with BF2Cl, BFC1 2 , and BC1 3 - A large number of mixed tetrahaloborate ions, including some of the ternary ones such as BF2CIBr-,have been obtained by ligand exchange reactions and studied by NMR techniques. The bonding in these ions is of the same inherent interest as the bonding in the isoelectronic tetrahalomethanes which have been the subject of many detailed studies and have been involved in a controversy concerning the existence of and the nature of "fluorine hyperconjugation" or C-F P1T- Pn bonding_ Ligand exchange reactions also gave rise to the difluoroboron cation, (TMU)20BF2+o The difluoroboron cation has been observed in solutions of TMU-BF3 , and has been proposed as a possible intermediate for fluorine exchange reactions in BF3 adducts.

Studies of some cocondensations of nickel atoms with unsaturated organic ligands and with mixed ligand systems

The cocondensation of nickel with a number of unsaturated ligands was studied, as was the cocondensation with a number of mixed ligand systems. Enamines were found not to react with nickel while acrylonitrile was polymerized. In the mixed ligand syst.ems different products were obtained than when the ligands were cocondensed individually. Cocondensations of benzyl halide/allyl halide mixtures gave unstable products that were not observed when the halides were cocondensed individually. The effect of Kao-Wool insulation on nickel/benzyl halide cocondensations was found to be significant. Kao-Wool caused the bulk of the benzyl halide to be polymeri zed to a number of poly-benzylic species. An alkali metal reactor was designed for the evaporation of sodium and potassium atoms into cold solutions of metal halide and an or ganic substrate. This apparatus was used to synthesize Ni(P¢3 )3' but proved unsuccessful for synthesizing a nickel-enamine compound.

Mothers' experiences in the elementary school education of their children of mixed heritage /

This study explores the perceptions and experiences of middle-class women, mostly mothers, regarding the elementary school education of their children of mixed heritage. Because it endeavours to provide a forum in which the voices of women are considered a source of valuable information for educators, this study contributes to the fields of feminist and mothering research. Participants assign meanings to their lived experiences (Schon, 1983; van Manen 1997) and contemplate the various ways in which a mixed heritage mayor may not affect a child's schooling. Four main participants were interviewed who are mothers whose children of mixed heritage presently attend public elementary schools in Ontario, Canada. The study had an emergent design, thus allowing the researcher to make decisions as the study progressed. Three additional participants were included in the study to provide a wider perspective on the topic. These 3 additional women were the researcher herself as she explored her self-conceptual baggage (Kirby & McKenna. 1989); the researcher's mother in an attempt to consider the motherline (Lowinsky, 1992); and a volunteer non-mother of mixed ethnicity. The study involved a total of 12 individual interviews of approximately 2 hours in length. The 4 main participants and the researcher were each interviewed twice; the researcher's mother and the volunteer non-mother were each interviewed once. The researcher also attempted a focus group and kept a journal throughout the research process. Much of the analysis centers on women's interpretations of the mixed heritage experience and on their suggestions for elementary school educators. It concludes pondering on the invisibility (Chiong, 1998) of such children within the school system and calling for increased teacher education as a way to bring the mixed heritage experience out of the shadows.

The mechanism of formation of the mixed boron trihalide adducts of trimenthylamine

Boron trihalide and mixed boron trihalide adducts of trimethylamine have been prepared, and characterized by proton and fluorine N.M.R. spectroscopy. The acceptor power of the boron trihalides was seen to increase in the order BF3 < BC13 < BBr3 < BI3, corroborating previous evidence. The mixed boron trihalides had intermediate Lewis acidities. Solution reactions between adducts and free boron trihalides rapidly led to the formation of mixed adducts when the free boron trihalide is a stronger Lewis acid than that in the adduct. A slower reaction is observed when the free BX3 is a weaker Lewis aoid than that complexed. The mechanism of halogen exchange leading to the mixed (CH3)3NBX3 adducts was investigated. 10B labelling experiments precluded B-N bond rupture as a possible mechanism in solution; results are discussed in terms of halogen-bridged intermediates. Pre-ionization may be important for some systems. At higher temperatures, during gas phase reactions,B-N coordinate bond rupture may be the initial step of reaction. Two mixed adduots, namely (CH3)3NBClBr2 and (CH3)3NBHOIBr were prepared and characterized by Mass Spectrometry

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.

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.

Reading Rocks Junior: A Mixed-Methodological Study of the Efficacy and Accessibility of an Emergent Literacy Intervention

This thesis explored early literacy development in young vulnerable readers. More specifically, this thesis examined an emergent literacy program called Reading Rocks Junior offered by the Learning Disabilities Association of Niagara Region to children four- to six-years of age living in low socioeconomic status communities. Three methodologies were combined to create a rich and complete picture of an effective and accessible literacy program. First of all, a description of the Reading Rocks Junior program is outlined. Secondly, quantitative data that was collected pre- and post- program was analyzed to demonstrate achievement gains made as a result of participating in the program. Finally, qualitative interviews with the program coordinator, the convener of the agency that funded Reading Rocks Junior and three parents whose children participated in the program were analyzed to determine the contextual factors that make Reading Rocks Junior a success.

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.