Synthetic strategies of new molecular paramagnetic mechanically-interlocked complexes

Supramolecular chemistry is a multidisciplinary field which impinges on other disciplines, focusing on the systems made up of a discrete number of assembled molecular subunits. The forces responsible for the spatial organization are intermolecular reversible interactions. The supramolecular architectures I was interested in are Rotaxanes, mechanically-interlocked architectures consisting of a "dumbbell shaped molecule", threaded through a "macrocycle" where the stoppers at the end of the dumbbell prevent disassociation of components and catenanes, two or more interlocked macrocycles which cannot be separated without breaking the covalent bonds. The aim is to introduce one or more paramagnetic units to use the ESR spectroscopy to investigate complexation properties of these systems cause this technique works in the same time scale of supramolecular assemblies. Chapter 1 underlines the main concepts upon which supramolecular chemistry is based, clarifying the nature of supramolecular interactions and the principles of host-guest chemistry. In chapter 2 it is pointed out the use of ESR spectroscopy to investigate the properties of organic non-covalent assemblies in liquid solution by spin labels and spin probes. The chapter 3 deals with the synthesis of a new class of p-electron-deficient tetracationic cyclophane ring, carrying one or two paramagnetic side-arms based on 2,2,6,6-tetramethylpiperidine-N-oxyl (TEMPO) moiety. In the chapter 4, the Huisgen 1,3-dipolar cycloaddition is exploited to synthesize rotaxanes having paramagnetic cyclodextrins as wheels. In the chapter 5, the catalysis of Huisgen’s cycloaddition by CB[6] is exploited to synthesize paramagnetic CB[6]-based [3]-rotaxanes. In the chapter 6 I reported the first preliminary studies of Actinoid series as a new class of templates in catenanes’ synthesis. Being f-block elements, so having the property of expanding the valence state, they constitute promising candidates as chemical templates offering the possibility to create a complex with coordination number beyond 6.

Portfolio Approaches in Constraint Programming

Recent research has shown that the performance of a single, arbitrarily efficient algorithm can be significantly outperformed by using a portfolio of —possibly on-average slower— algorithms. Within the Constraint Programming (CP) context, a portfolio solver can be seen as a particular constraint solver that exploits the synergy between the constituent solvers of its portfolio for predicting which is (or which are) the best solver(s) to run for solving a new, unseen instance. In this thesis we examine the benefits of portfolio solvers in CP. Despite portfolio approaches have been extensively studied for Boolean Satisfiability (SAT) problems, in the more general CP field these techniques have been only marginally studied and used. We conducted this work through the investigation, the analysis and the construction of several portfolio approaches for solving both satisfaction and optimization problems. We focused in particular on sequential approaches, i.e., single-threaded portfolio solvers always running on the same core. We started from a first empirical evaluation on portfolio approaches for solving Constraint Satisfaction Problems (CSPs), and then we improved on it by introducing new data, solvers, features, algorithms, and tools. Afterwards, we addressed the more general Constraint Optimization Problems (COPs) by implementing and testing a number of models for dealing with COP portfolio solvers. Finally, we have come full circle by developing sunny-cp: a sequential CP portfolio solver that turned out to be competitive also in the MiniZinc Challenge, the reference competition for CP solvers.