An investigation into the oxidation of organic sulphides, organic selenides and simple hydrocarbons by Mortierella isabellina NRRL 1757

The work presented in this thesis is divided into three separate sections 4!> Each' 'section is involved wi th a different problem, however all three are involved with a microbial oxidation of a substrate~ A series of 'aryl substituted phenyl a.nd be,nzyl methyl sulphides were oxidized to the corre~pondi~g sulphoxides by 'Mo:rtierellai's'a'b'e'llina NRR.L17'S7 @ For this enzymic Qxidation, based on 180 labeled experiments, the oxygen atom is derived fr'orn the atmosphere and not from water. By way of an u~.traviolet analysis, the rates of oxidation, in terms of sulphox~ de appearance, were obtained and correlated with the Hatnmett p s~grna constants for the phenyl methyl sulphide series. A value of -0.67 was obtained and, is interpreted in terms of a mechanism of oxidation that involves an electrophilic attack on the sulphide sulphur by an enzymic ironoxygen activated complex and the conversion of the resulti!lg sulphur cation to sulphoxide. A series of alkyl phenyl selen~des have been incubated with the fu~gi, Aspergillus niger ATCC9l42, Aspergillus fO'etidus NRRL 337, MIIJisabellina NF.RLl757 and'He'lminth'osparium sp'ecies NRRL 4671 @l These fu?gi have been reported to be capable of carrying out the efficient oxidation of sulphide to sulphoxide, but in no case was there any evidence to supp'ort the occurrence of a microbialox,idation. A more extensive inves·t~gation was carried out with'M,e 'i's'a'b'e'l'l'i'na, this fu~gus was capable of oxidizing the correspondi~g sulphides to sulphoxi.de·s·$ Usi:ng a 1abel.edsubstra.te, [Methyl-l4c]-methyl phenyl selenide, the fate of this compound was invest~gated followi!lg an i'ncubation wi th Me isabellina .. BeSUldes th. e l4C-ana1YS1Q S-,'. a quant"ltta"lve selen'lum ana1Y"S1S was carried out with phenyl methyl selenide. These techniques indicate that thesel'enium was capable of enteri!1g thefu!1gal cell ef'ficiently but that s'ome metabolic cleav~ge of the seleni'um-carbon bond' may take plac'e Ie The l3c NMR shifts were assigned to the synthesized alkyl phenyl sulphides and selenides@ The final section involved the incubation ofethylben~ zene and p-e:rtr.hyltoluene wi th'M ~ 'isab'e'llina NRRL 17574b Followi~ g this incubation an hydroxylated product was isolated from the medium. The lH NMR and mass spectral data identify the products as I-phenylethanol and p-methyl-l-phenylethanol. Employi!lg a ch'iral shift re~gent,tri~ (3-heptafluorobutyl-dcamphorato)'- europium III, the enantiomeric puri ty of these products was invest~gated. An optical rotation measurement of I-phenylethanol was in ~greement with the results obtained with the chiral shift re~gen,te 'M.isabe'l'lina is capable of carryi~g out an hydroxylation of ethylbenzene and p-ethyltoluene at the ~ position.

Elementary computer-mediated online distance education : identification of criteria for successful implementation and practice

This study had three purposes related to the effective implem,entation and practice of computer-mediated online distance education (C-MODE) at the elementary level: (a) To identify a preliminary framework of criteria 'or guidelines for effective implementation and practice, (b) to identify areas ofC-MODE for which criteria or guidelines of effectiveness have not yet been developed, and (c) to develop an implementation and practice criteria questionnaire based on a review of the distance education literature, and to use the questionnaire in an exploratory survey of elementary C-MODE practitioners. Using the survey instrument, the beliefs and attitudes of 16 elementary C'- MODE practitioners about what constitutes effective implementation and practice principles were investigated. Respondents, who included both administrators and instructors, provided information about themselves and the program in which they worked. They rated 101 individual criteria statenlents on a 5 point Likert scale with a \. point range that included the values: 1 (Strongly Disagree), 2 (Disagree), 3 (Neutral or Undecided), 4 (Agree), 5 (Strongly Agree). Respondents also provided qualitative data by commenting on the individual statements, or suggesting other statements they considered important. Eighty-two different statements or guidelines related to the successful implementation and practice of computer-mediated online education at the elementary level were endorsed. Response to a small number of statements differed significantly by gender and years of experience. A new area for investigation, namely, the role ofparents, which has received little attention in the online distance education literature, emerged from the findings. The study also identified a number of other areas within an elementary context where additional research is necessary. These included: (a) differences in the factors that determine learning in a distance education setting and traditional settings, (b) elementary students' ability to function in an online setting, (c) the role and workload of instructors, (d) the importance of effective, timely communication with students and parents, and (e) the use of a variety of media.

An investigation into the effects of homopteran honeydew sugars versus floral nectar sugars on black fly longevity, flight performance and digestion /

Floral nectar is thought to be the primary carbohydrate source for most dipteran species. However, it has been shown that black flies (Burgin & Hunter 1997 a,b,c), mosquitoes (Foster 1995; Burkett et al. 1999; Russell & Hunter 2002), deer flies (Magnarelli & Burger 1984; Janzen & Hunter 1998; Ossowski & Hunter 2000), horse flies (Schutz & Gaugler 1989; Hunter & Ossowski 1999) and sand flies (MacVicker et al. 1990; Wallbanks et al. 1990; Cameron et al. 1992, 1995; Schlein & Jacobson 1994, 1999; Hamilton & EI Naiem 2000) feed on homopteran honeydew as well as floral nectar. Prior to 1997 floral nectar was thought to be the main source of carbohydrates for black flies. However, Burgin & Hunter (1 997a) demonstrated that up to 35% of black flies had recently consumed meals of homo pte ran honeydew. This information has necessitated a re-assessment of many life history aspects of black flies. Attempts are being made to examine the effects of nectar versus honeydew on black fly fecundity and parasite transmission (Hazzard 2003). Recently, Stanfield and Hunter (unpublished data) have shown that in female black flies, honeydew sugars produce flights of longer distance and duration than do nectar sugars. This thesis examines two aspects of black fly biology as it relates to sugar meal consumption. First, the effects of honeydew and nectar on black fly longevity are examined. Second, the proximate causation behind longer flight performances in honeydew-fed flies will be examined. The comparison between these two sources is important because nectar is composed of mainly simple sugars (monosaccharides and disaccharides) whereas honeydew is composed of both simple and complex sugars (including trisaccharides and tetrasaccharides ).

The effects of simple procedural, cognitive procedural and declarative learning on sleep /

Sleep spindles have been found to increase following an intense period of learning on a combination of motor tasks. It is not clear whether these changes are task specific, or a result of learning in general. The current study investigated changes in sleep spindles and spectral power following learning on cognitive procedural (C-PM), simple procedural (S-PM) or declarative (DM) learning tasks. It was hypothesized that S-PM learning would result in increases in Sigma power during Non-REM sleep, whereas C-PM and DM learning would not affect Sigma power. It was also hypothesized that DM learning would increase Theta power during REM sleep, whereas S-PM and C-PM learning would not affect Theta power. Thirty-six participants spent three consecutive nights in the sleep laboratory. Baseline polysomnographic recordings were collected on night 2. Participants were randomly assigned to one of four conditions: C-PM, S-PM, DM or control (C). Memory task training occurred on night 3 followed by polysomnographic recording. Re-testing on respective memory tasks occurred one-week following training. EEG was sampled at 256Hz from 16 sites during sleep. Artifact-free EEG from each sleep stage was submitted to power spectral analysis. The C-PM group made significantly fewer errors, the DM group recalled more, and the S-PM improved on performance from test to re-test. There was a significant night by group interaction for the duration of Stage 2 sleep. Independent t-tests revealed that the S-PM group had significantly more Stage 2 sleep on the test night than the C group. The C-PM and the DM group did not differ from controls in the duration of Stage 2 sleep on test night. There was no significant change in the duration of slow wave sleep (SWS) or REM sleep. Sleep spindle density (spindles/minute) increased significantly from baseline to test night following S-PM learning, but not for C-PM, DM or C groups. This is the first study to have shown that the same pattern of results was found for spindles in SWS. Low Sigma power (12-14Hz) increased significantly during SWS following S-PM learning but not for C-PM, DM or C groups. This effect was maximal at Cz, and the largest increase in Sigma power was at Oz. It was also found that Theta power increased significantly during REM sleep following DM learning, but not for S-PM, C-PM or C groups. This effect was maximal at Cz and the largest change in Theta power was observed at Cz. These findings are consistent with the previous research that simple procedural learning is consolidated during Stage 2 sleep, and provide additional data to suggest that sleep spindles across all non-REM stages and not just Stage 2 sleep may be a mechanism for brain plasticity. This study also provides the first evidence to suggest that Theta activity during REM sleep is involved in memory consolidation.

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 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 von Neumann Minimax Theorem and its relatives and a study of externality in on-line auctions

This work consists of a theoretical part and an experimental one. The first part provides a simple treatment of the celebrated von Neumann minimax theorem as formulated by Nikaid6 and Sion. It also discusses its relationships with fundamental theorems of convex analysis. The second part is about externality in sponsored search auctions. It shows that in these auctions, advertisers have externality effects on each other which influence their bidding behavior. It proposes Hal R.Varian model and shows how adding externality to this model will affect its properties. In order to have a better understanding of the interaction among advertisers in on-line auctions, it studies the structure of the Google advertisements networ.k and shows that it is a small-world scale-free network.

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.

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.

Backbone Colouring of Graphs

Consider an undirected graph G and a subgraph of G, H. A q-backbone k-colouring of (G,H) is a mapping f: V(G) {1, 2, ..., k} such that G is properly coloured and for each edge of H, the colours of its endpoints differ by at least q. The minimum number k for which there is a backbone k-colouring of (G,H) is the backbone chromatic number, BBCq(G,H). It has been proved that backbone k-colouring of (G,T) is at most 4 if G is a connected C4-free planar graph or non-bipartite C5-free planar graph or Cj-free, j∈{6,7,8} planar graph without adjacent triangles. In this thesis we improve the results mentioned above and prove that 2-backbone k-colouring of any connected planar graphs without adjacent triangles is at most 4 by using a discharging method. In the second part of this thesis we further improve these results by proving that for any graph G with χ(G) ≥ 4, BBC(G,T) = χ(G). In fact, we prove the stronger result that a backbone tree T in G exists, such that ∀ uv ∈ T, |f(u)-f(v)|=2 or |f(u)-f(v)| ≥ k-2, k = χ(G). For the case that G is a planar graph, according to Four Colour Theorem, χ(G) = 4; so, BBC(G,T) = 4.

Using PageRank Algorithm in Analyzing Dictionary Graphs and PageRank in Dynamic Graphs

In this thesis we are going to analyze the dictionary graphs and some other kinds of graphs using the PagerRank algorithm. We calculated the correlation between the degree and PageRank of all nodes for a graph obtained from Merriam-Webster dictionary, a French dictionary and WordNet hypernym and synonym dictionaries. Our conclusion was that PageRank can be a good tool to compare the quality of dictionaries. We studied some artificial social and random graphs. We found that when we omitted some random nodes from each of the graphs, we have not noticed any significant changes in the ranking of the nodes according to their PageRank. We also discovered that some social graphs selected for our study were less resistant to the changes of PageRank.

Diagrams (charts and graphs) made into a booklet with a newspaper cover

Diagrams (charts and graphs) made into a booklet with a newspaper cover. This booklet contains cross sections of the back ditch on the south side of the Welland Canal feeder, west of the Marshville culverts (45 pages, hand drawn). This was created by Fred Holmes, Oct. 3, 1857.

Charts and graphs of cross sections from Brown’s ditch culvert to the main drain

Charts and graphs of cross sections from Brown’s ditch culvert to the main drain, cross sections from the feeder on the road allowance between lots 26 and 27 in the 5th concession of Humberstone, Cross sections of the main drain from Lyons Creek culvert to the road allowance between lots 7 and 8 in Wainfleet and cross selections of the old ditch on the west side of the road allowance between lots 17 and 18 in the 3rd concession in Wainfleet (8 pages, hand drawn), n.d.