Investigations towards the synthesis of isotope labelled analogues of tocopherols and tocotrienols /

Vitamin E is considered as the most effective lipophilic chain breaking antioxidant. a-Tocopherol and its analogues have been studied thoroughly with regards to its biokinetics and bioavailabily. Deuterated tocopherols have been synthesized and utilized in such studies. Tocotrienols are arousing more and more interest because of their high efficiency as antioxidants. However, to date, there is no effective synthetic method reported for deuterated tocotrienols. This thesis is focused on the investigation of the synthetic methods of deuterated tocotrienols and their analogues: 5-trideuteromethyl-a-tocotrienol, 5- trideuteromethyl-p-tocotrienol, tocotrienol acetate, silyl tocotrienol ether, etc. Several synthetic procedures for the preparation of poly-deuterated tocopherols are known. Mainly the deuterium is introduced by use of labelled formaldehyde and deuterated hydrogen chloride under Lewis acid catalysis. However, these methods are not effective in tocotrienols due to exchange of protons for deuterium at other sites under the acidic conditions. We developed several different approaches to generate polydeuterated tocotrienols by using both morpholinomethylation followed by reduction with NaCNBDs as deuterated reducing reagents and transmetalation strategy. The 5-trideuteromethyl-a-tocotrienol was finally obtained in a satisfactory yield of 60%. In addition, this thesis also discussed the study of structural comparison and the chemical property difference of tocopherols and tocotrienols, which provides hints to explain the reactivity difference of them towards oxidation at the C3-C4 positions.Furthermore, the methodology of halogenation and dehydrohalogenation of tocotrienol was explored to prepare a hexaene tocotrienol derivative as a florescent reporter of tocopherol.

Synthesis of isotope-labelled methoxypyrazine compounds as internal standards and quantitative determination of aroma methoxypyrazines in water and wines by solid-phase extraction with isotope dilution-GC-MS /

An efficient way of synthesizing the deuterium labelled analogues of three methoxypyrazine compounds: 2-d3-methoxy-3-isopropylpyrazine, 2-d3-methoxy-3- isobutylpyrazine, and 2-d3-methoxy-3-secbutylpyrazine, has been developed. To confirm that the deuterium labels had been incorporated into the expected positions in the molecules synthesized, the relevant characterization by NMR, HRMS and GC/MS analysis was conducted. Another part of this work involved quantitative determination of methoxypyrazines in water and wines. Solid-phase extraction (SPE) proved to be a suitable means for the sample separation and concentration prior to GC/MS analysis.Such factors as the presence of ethanol, salt, and acid have been investigated which can influence the recovery by SPE for the pyrazines from the water matrix. Significantly, in this work comparatively simple fractional distillation was attempted to replace the conventional steam distillation for pre-concentrating a sample with a relatively large volume prior to SPE. Finally, a real wine sample spiked with the relevant isotope-labelled methoxypyrazines was quantitatively analyzed, revealing that the wine with 10 beetles per litre contained 138 ppt of 2-methoxy-3-isopropylpyrazine. Interestingly, we have also found that 2-methoxy-3-secbutylpyrazine exhibits an extremely low detection limit in GC/MS analysis compared with the detection limit of the other two methoxypyrazines: 2- methoxy-3-isopropylpyrazine and 2-methoxy-3-isobutylpyrazine.

Reactions of steroidal epoxides with strong organic bases and an investigation into the syntheses of some labelled pregnane derivatives

Reactions of 5,6- and 4,5-epoxycholestane derivatives with strong bases were investigated. Epoxidation of 3a-acetoxycholest-5-ene also gave a new compound along with the anticipated epoxides. Interconversions of the latter were observed. Some possible mechanisms of its formation and rearrangements have been pIioposed. No reaction was observed with any of the 5,6- and 4,5-steroidal epoxides employed in the present study, using potassium tertiary butoxide under refluxing conditions. n-Butyllithium reacted only with 5,6-epoxycholestanes bearing a ketal moiety at the C3 carbon. Opening of the ketal group was observed with n-butyllithium in the case of a ~-epoxide. The reaction was also investigated in the absence of epoxide functionality. A possible mechanism for the opening of ketal group has been proposed. Lithium diethylamide (LDEA) was found effective in rearranging 5,6- and 4,5-epoxides to their ~orresponding allylic alcohols. These rearrangements presumably proceed via syn-eliminations, however the possibility of a corresponding anti-elimination has not been eliminated. A substituent effect of various functional groups (R = H, OH, OCH2CH20) at C3 has-been observed on product distribution in the LDEApromoted rearrangements of the corresponding epoxides. No reaction of these epoxides was observed with lithium diisopropylamide (LDA) • In the second part of the project, several attempts were made towards the sYRthesis of deoxycorticoste~one~17,2l,2l~d3' a compound desirable for the 2l-dehydroxylation studies of deoxycorticosterone. Several routes were investigated, and some deuterium labelled pregnane derivatives were prepared in this regard. Microbial 21-hydroxylation of progesteronel7,21,21,2l- d4 by ~ niger led to loss of deuterium from C21 of the product. An effort was made to hydroxylate progesterone microbially under neutral condtions.

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.

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.

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.