Synthesis and utilization of guanidine catalysts for applications directed towards the preparation of butenolide and modified amino acid derivatives

Development of guanidine catalysts is explored through direct iminium chloride and amine coupling, alongside a 2-chloro-l,3-dimethyl-IH-imidazol-:-3-ium chloride (DMC) induced thiourea cyclization. Synthesized achiral catalyst N-(5Hdibenzo[ d,t][1,3]diazepin-6(7H)-ylidene)-3,5-bis(trifluoromethyl) aniline proved unsuccessful towards O-acyl migrations, however successfully catalyzed the vinylogous aldol reaction between dicbloro furanone and benzaldehyde. Incorporating chirality into the guanidine catalyst utilizing a (R)-phenylalaninol auxiliary, generating (R)-2-((5Hdibenzo[ d,t] [1,3 ]diazepin-6(7H)-ylidene ) amino )-3 -phenylpropan-l-ol, demonstrated enantioselectivity for a variety of adducts. Highest enantiomeric excess (ee) was afforded between dibromofuranone and p-chlorobenzaldehyde, affording the syn conformation in 96% ee and the anti in 54% ee, with an overall yield of30%. Attempts to increase asymmetric induction were focused on incorporation of axial chirality to the (R)phenylalaninol catalyst using binaphthyl diamine. Incorporation of (S)-binaphthyl exhibited destructive selectivity, whereas incorporation of (R)-binaphthyl demonstrated no effects on enantioselectivity. Current studies are being directed towards identifying the catalytic properties of asymmetric induction with further studies are being aimed towards increasing enantioselectivity by increasing backbone steric bulk.

DNA-Directed DNA Polymerases Evolve From Reverse Transcriptase

Scientists have been debating for decades the origin of life on earth. A number of hypotheses were proposed as to what emerged first RNA or DNA; with most scientists are in favour of the "RNA World" hypothesis. Assuming RNA emerged first, it fellow that the RNA polymerases would've appeared before DNA polymerases. Using recombinant DNA technology and bioinformatics we undertook this study to explore the relationship between RNA polymerases, reverse transcriptase and DNA polymerases. The working hypothesis is that DNA polymerases evolved from reverse transcriptase and the latter evolved from RNA polymerases. If this hypothesis is correct then one would expect to find various ancient DNA polymerases with varying level of reverse transcriptase activity. In the first phase of this research project multiple sequence alignments were made on the protein sequence of 32 prokaryotic DNA-directed DNA polymerases originating from 11 prokaryotic families against 3 viral reverse transcriptase. The data from such alignments was not very conclusive. DNA polymerases with higher level of reverse transcriptase activity were non-confined to ancient organisms, as one would've expected. The second phase of this project was focused on conditions that may alter the DNA polymerase activity. Various reaction conditions, such as temperature, using various ions (Ni2+, Mn2+, Mg2+) were tested. Interestingly, it was found that the DNA polymerase from the Thermos aquatics family can be made to copy RNA into DNA (i.e. reverse transcriptase activity). Thus it was shown that under appropriate conditions (ions and reactions temperatures) reverse transcriptase activity can be induced in DNA polymerase. In the third phase of this study recombinant DNA technology was used to generate a chimeric DNA polymerase; in attempts to identify the region(s) of the polymerase responsible for RNA-directed DNA polymerase activity. The two DNA polymerases employed were the Thermus aquatic us and Thermus thermophiles. As in the second phase various reaction conditions were investigated. Data indicated that the newly engineered chimeric DNA polymerase can be induced to copy RNA into DNA. Thus the intrinsic reverse transcriptase activity found in ancient DNA polymerases was localized into a domain and can be induced via appropriate reaction conditions.

Automatic Inference of Graph Models for Complex Networks with Genetic Programming

Complex networks can arise naturally and spontaneously from all things that act as a part of a larger system. From the patterns of socialization between people to the way biological systems organize themselves, complex networks are ubiquitous, but are currently poorly understood. A number of algorithms, designed by humans, have been proposed to describe the organizational behaviour of real-world networks. Consequently, breakthroughs in genetics, medicine, epidemiology, neuroscience, telecommunications and the social sciences have recently resulted. The algorithms, called graph models, represent significant human effort. Deriving accurate graph models is non-trivial, time-intensive, challenging and may only yield useful results for very specific phenomena. An automated approach can greatly reduce the human effort required and if effective, provide a valuable tool for understanding the large decentralized systems of interrelated things around us. To the best of the author's knowledge this thesis proposes the first method for the automatic inference of graph models for complex networks with varied properties, with and without community structure. Furthermore, to the best of the author's knowledge it is the first application of genetic programming for the automatic inference of graph models. The system and methodology was tested against benchmark data, and was shown to be capable of reproducing close approximations to well-known algorithms designed by humans. Furthermore, when used to infer a model for real biological data the resulting model was more representative than models currently used in the literature.

Network Similarity Measures and Automatic Construction of Graph Models using Genetic Programming

A complex network is an abstract representation of an intricate system of interrelated elements where the patterns of connection hold significant meaning. One particular complex network is a social network whereby the vertices represent people and edges denote their daily interactions. Understanding social network dynamics can be vital to the mitigation of disease spread as these networks model the interactions, and thus avenues of spread, between individuals. To better understand complex networks, algorithms which generate graphs exhibiting observed properties of real-world networks, known as graph models, are often constructed. While various efforts to aid with the construction of graph models have been proposed using statistical and probabilistic methods, genetic programming (GP) has only recently been considered. However, determining that a graph model of a complex network accurately describes the target network(s) is not a trivial task as the graph models are often stochastic in nature and the notion of similarity is dependent upon the expected behavior of the network. This thesis examines a number of well-known network properties to determine which measures best allowed networks generated by different graph models, and thus the models themselves, to be distinguished. A proposed meta-analysis procedure was used to demonstrate how these network measures interact when used together as classifiers to determine network, and thus model, (dis)similarity. The analytical results form the basis of the fitness evaluation for a GP system used to automatically construct graph models for complex networks. The GP-based automatic inference system was used to reproduce existing, well-known graph models as well as a real-world network. Results indicated that the automatically inferred models exemplified functional similarity when compared to their respective target networks. This approach also showed promise when used to infer a model for a mammalian brain network.

Object-Oriented Genetic Programming for the Automatic Inference of Graph Models for Complex Networks

Complex networks are systems of entities that are interconnected through meaningful relationships. The result of the relations between entities forms a structure that has a statistical complexity that is not formed by random chance. In the study of complex networks, many graph models have been proposed to model the behaviours observed. However, constructing graph models manually is tedious and problematic. Many of the models proposed in the literature have been cited as having inaccuracies with respect to the complex networks they represent. However, recently, an approach that automates the inference of graph models was proposed by Bailey [10] The proposed methodology employs genetic programming (GP) to produce graph models that approximate various properties of an exemplary graph of a targeted complex network. However, there is a great deal already known about complex networks, in general, and often specific knowledge is held about the network being modelled. The knowledge, albeit incomplete, is important in constructing a graph model. However it is difficult to incorporate such knowledge using existing GP techniques. Thus, this thesis proposes a novel GP system which can incorporate incomplete expert knowledge that assists in the evolution of a graph model. Inspired by existing graph models, an abstract graph model was developed to serve as an embryo for inferring graph models of some complex networks. The GP system and abstract model were used to reproduce well-known graph models. The results indicated that the system was able to evolve models that produced networks that had structural similarities to the networks generated by the respective target models.

The Impact of Directed Mirror Focus and Technique Cues on Psychological, Cognitive and Emotional Exercise Correlates in an Introductory Weight Training Orientation

The purpose of the study was to investigate whether teaching inactive and low active women to use mirrors for form and technique purposes could lessen the negative impact of mirrors on self-presentational concerns, affect, and self-efficacy. Eligible women (N = 82) underwent a one-on-one weight training orientation with a personal trainer. Participants were randomized into one of four experimental groups, each unique in the type of feedback (general or technique-specific) and the degree of focus on the mirror for technique reinforcement. Questionnaires assessed study outcomes pre- and post-orientation. Results indicated groups did not significantly differ on any post-condition variables, when controlling for pre-condition values (all p’s >.05). All groups showed outcome improvements following the orientation. This suggests that during a complex task, a personal trainer who emphasizes form and technique can facilitate improvements to psychological outcomes in novice exercisers, independent of the presence of mirrors or directional cues provided.

Directed Technical Change and International Trade

Recent changes in comparative advantage in the largest OECD economies differ significantly from the predictions of Heckscher-Ohlin-Vanek theory. Japan's rising share of OECD machinery exports and the improvement in the comparative advantage of the USA and Germany in heavy industry were accompanied by growing scarcities of the factors used intensively in the favored sector of each country. Here we examine Acemoglu's (1998, 2002) hypothesis that technical change may be directed toward raising the marginal productivity of abundant factors. Testing this hypothesis with 1970-1992 export data from 14 OECD countries, we find evidence that international comparative advantage was reshaped by innovation biased toward the abundant factors in the largest economies.

Directed evolution of human dihydrofolate reductase: towards a better understanding of binding at the active site

La dihydrofolate réductase humaine (DHFRh) est une enzyme essentielle à la prolifération cellulaire, ce qui en fait une cible de choix pour le traitement de différents cancers. À cet effet, plusieurs inhibiteurs spécifiques de la DHFRh, les antifolates, ont été mis au point : le méthotrexate (MTX) et le pemetrexed (PMTX) en sont de bons exemples. Malgré l’efficacité clinique certaine de ces antifolates, le développement de nouveaux traitements s’avère nécessaire afin de réduire les effets secondaires liés à leur utilisation. Enfin, dans l’optique d’orienter la synthèse de nouveaux composés inhibiteurs des DHFRh, une meilleure connaissance des interactions entre les antifolates et leur enzyme cible est primordiale. À l’aide de l’évolution dirigée, il a été possible d’identifier des mutants de la DHFRh pour lesquels l’affinité envers des antifolates cliniquement actifs se voyait modifiée. La mutagenèse dite ¬¬de saturation a été utilisée afin de générer des banques de mutants présentant une diversité génétique au niveau des résidus du site actif de l’enzyme d’intérêt. De plus, une nouvelle méthode de criblage a été mise au point, laquelle s’est avérée efficace pour départager les mutations ayant entrainé une résistance aux antifolates et/ou un maintient de l’activité enzymatique envers son substrat natif, soient les phénotypes d’activité. La méthode de criblage consiste dans un premier temps en une sélection bactérienne à haut débit, puis dans un second temps en un criblage sur plaques permettant d’identifier les meilleurs candidats. Plusieurs mutants actifs de la DHFRh, résistants aux antifolates, ont ainsi pu être identifiés et caractérisés lors d’études de cinétique enzymatique (kcat et IC50). Sur la base de ces résultats cinétiques, de la modélisation moléculaire et des données structurales de la littérature, une étude structure-activité a été effectuée. En regardant quelles mutations ont les effets les plus significatif sur la liaison, nous avons commencé à construire un carte moléculaire des contacts impliqués dans la liaison des ligands. Enfin, des connaissances supplémentaires sur les propriétés spécifiques de liaison ont put être acquises en variant l’inhibiteur testé, permettant ainsi une meilleure compréhension du phénomène de discrimination du ligand.

Fixed point results for multivalued contractions on graphs and their applications

Nous présentons dans cette thèse des théorèmes de point fixe pour des contractions multivoques définies sur des espaces métriques, et, sur des espaces de jauges munis d’un graphe. Nous illustrons également les applications de ces résultats à des inclusions intégrales et à la théorie des fractales. Cette thèse est composée de quatre articles qui sont présentés dans quatre chapitres. Dans le chapitre 1, nous établissons des résultats de point fixe pour des fonctions multivoques, appelées G-contractions faibles. Celles-ci envoient des points connexes dans des points connexes et contractent la longueur des chemins. Les ensembles de points fixes sont étudiés. La propriété d’invariance homotopique d’existence d’un point fixe est également établie pour une famille de Gcontractions multivoques faibles. Dans le chapitre 2, nous établissons l’existence de solutions pour des systèmes d’inclusions intégrales de Hammerstein sous des conditions de type de monotonie mixte. L’existence de solutions pour des systèmes d’inclusions différentielles avec conditions initiales ou conditions aux limites périodiques est également obtenue. Nos résultats s’appuient sur nos théorèmes de point fixe pour des G-contractions multivoques faibles établis au chapitre 1. Dans le chapitre 3, nous appliquons ces mêmes résultats de point fixe aux systèmes de fonctions itérées assujettis à un graphe orienté. Plus précisément, nous construisons un espace métrique muni d’un graphe G et une G-contraction appropriés. En utilisant les points fixes de cette G-contraction, nous obtenons plus d’information sur les attracteurs de ces systèmes de fonctions itérées. Dans le chapitre 4, nous considérons des contractions multivoques définies sur un espace de jauges muni d’un graphe. Nous prouvons un résultat de point fixe pour des fonctions multivoques qui envoient des points connexes dans des points connexes et qui satisfont une condition de contraction généralisée. Ensuite, nous étudions des systèmes infinis de fonctions itérées assujettis à un graphe orienté (H-IIFS). Nous donnons des conditions assurant l’existence d’un attracteur unique à un H-IIFS. Enfin, nous appliquons notre résultat de point fixe pour des contractions multivoques définies sur un espace de jauges muni d’un graphe pour obtenir plus d’information sur l’attracteur d’un H-IIFS. Plus précisément, nous construisons un espace de jauges muni d’un graphe G et une G-contraction appropriés tels que ses points fixes sont des sous-attracteurs du H-IIFS.

A Note On Some Domination Parameters in Graph Products

In this paper, we study the domination number, the global dom ination number, the cographic domination number, the global co graphic domination number and the independent domination number of all the graph products which are non-complete extended p-sums (NEPS) of two graphs.

On Chaos and Fractals in General Topological Spaces

The present study on chaos and fractals in general topological spaces. Chaos theory originated with the work of Edward Lorenz. The phenomenon which changes order into disorder is known as chaos. Theory of fractals has its origin with the frame work of Benoit Mandelbrot in 1977. Fractals are irregular objects. In this study different properties of topological entropy in chaos spaces are studied, which also include hyper spaces. Topological entropy is a measures to determine the complexity of the space, and compare different chaos spaces. The concept of fractals can’t be extended to general topological space fast it involves Hausdorff dimensions. The relations between hausdorff dimension and packing dimension. Regular sets in Metric spaces using packing measures, regular sets were defined in IR” using Hausdorff measures. In this study some properties of self similar sets and partial self similar sets. We can associate a directed graph to each partial selfsimilar set. Dimension properties of partial self similar sets are studied using this graph. Introduce superself similar sets as a generalization of self similar sets and also prove that chaotic self similar self are dense in hyper space. The study concludes some relationships between different kinds of dimension and fractals. By defining regular sets through packing dimension in the same way as regular sets defined by K. Falconer through Hausdorff dimension, and different properties of regular sets also.

Novel1, 3-Dipolar Cycloaddition Reactions of Acyclic Carbonyl Ylides and Related Chemistry

The thesis entitled novel 1,3-dipolar cycloaddition reactions of acyclic carbonyl ylides and related chemistry embodies the results of the investigations carried out to explore the reactivity of acyclic carbonyl ylides,generated by the reaction of dicarbomethoxy carbine and aldehydes towards dipolarophiles such as activated styrenes,1,2-and 1,4-quinones. In conclusion ,we have explored the reactivity pattern of acyclic carbonyl ylides derived from dicarbomethoxycarbene and aldehyde towards activated styrenes with a view to develop a stereoselective synthesis of highly substituted tetrahydrofuran derivatives. It was also found that the ylide could be trapped by various 1,2-and 1,4-diones to form dioxolane derivatives. It is noteworthy that the cycloaddition is highly region- and stereoselective. With isatins the ylide preferentially adds to the more electrone deficient carbonyl group making it regiospecific. Hetrocyclic compounds are of pivotal importance in organic chemistry, and enormous efforts have been devoted to develop new methodologies for their synthesis. It is noteworthy in this context that, 1,3-dipolar cycloaddition reaction,otherwise called Huisgen reaction, constitutes one of the most efficient methods for the synthesis of five membered heterocycles. Among the various dipoles, carbonyl ylides have received substiancial attention in recent years largely due to their utility in the synthesis of a wide range of oxygen hetrocycles, which are often found as structural subunits of many bioactive natural products.

The P3 Intersection Graph

We define a new graph operator called the P3 intersection graph, P3(G)- the intersection graph of all induced 3-paths in G. A characterization of graphs G for which P-3 (G) is bipartite is given . Forbidden subgraph characterization for P3 (G) having properties of being chordal , H-free, complete are also obtained . For integers a and b with a > 1 and b > a - 1, it is shown that there exists a graph G such that X(G) = a, X(P3( G)) = b, where X is the chromatic number of G. For the domination number -y(G), we construct graphs G such that -y(G) = a and -y (P3(G)) = b for any two positive numbers a > 1 and b. Similar construction for the independence number and radius, diameter relations are also discussed.

The Edge C4 Graph of a Graph

Abstract. The edge C4 graph E4(G) of a graph G has all the edges of Gas its vertices, two vertices in E4(G) are adjacent if their corresponding edges in G are either incident or are opposite edges of some C4. In this paper, characterizations for E4(G) being connected, complete, bipartite, tree etc are given. We have also proved that E4(G) has no forbidden subgraph characterization. Some dynamical behaviour such as convergence, mortality and touching number are also studied

GALLAI AND ANTI-GALLAI GRAPHS OF A GRAPH

Abstract. The paper deals with graph operators-the Gallai graphs and the anti-Gallai graphs. We prove the existence of a finite family of forbidden subgraphs for the Gallai graphs and the anti-Gallai graphs to be H-free for any finite graph H. The case of complement reducible graphs-cographs is discussed in detail. Some relations between the chromatic number, the radius and the diameter of a graph and its Gallai and anti-Gallai graphs are also obtained.