Designing Massive Open Online Learning Processes: The importance of the social element

This is a pre-print for personal use only. Please refer to the Springer website for the official, published version http://www.springer.com/978-3-662-52923-2

Un répertoire de musique brésilienne adapté à l’enseignement collectif du trombone

Cette thèse, complémentaire à deux récitals donnés dans le cadre de la réalisation d’un doctorat en études pédagogiques et pratiques musicales instrumentales, a comme fil conducteur l’enseignement collectif du trombone au Brésil et examine le trombone sous trois angles : historique, pédagogique et dans une perspective d’interprétation musicale. Bien que le sujet ne soit pas nouveau, le projet présente une réflexion, sur le trombone et son enseignement, encore inexplorée en raison principalement du répertoire sélectionné pour la présente étude. En effet, à notre connaissance, le répertoire populaire brésilien n’a jusqu’à maintenant pas fait l’objet d’arrangements musicaux écrits, en vue d’une exploitation non seulement en contexte de représentation publique, mais aussi avec des visées pédagogiques. Les morceaux choisis ont été retenus en raison de leur contenu, qui présente un vocabulaire musical lié à la culture régionale de quatre des cinq régions géographiques du Brésil. Dans le processus de réalisation du projet, les morceaux choisis ont fait l’objet d’arrangements dans la perspective qu’ils servent comme outil pédagogique pour la formation en trombone, en contexte de musique brésilienne. Les arrangements ont été conçus pour des ensembles réduits, où le trombone tient fréquemment le rôle de soliste. Ainsi, au-delà des concepts et techniques issus de la formation traditionnelle reçue, l’interprétation des arrangements a été une occasion pour le doctorant et soliste de présenter, à travers l’improvisation dans le langage de la musique populaire brésilienne, les résultats de processus développés au cours des deux dernières années. Les partitions sont annexées au texte de la thèse, afin d’illustrer certains propos et avec l’objectif de soutenir les recherches futures dans ce domaine. La thèse est divisée en quatre chapitres lesquels, bien que présentés séparément, possèdent entre eux d’étroites relations. Le premier chapitre donne un aperçu général de l’histoire de l’instrument, à travers les cinq siècles de son existence. Le deuxième chapitre s’articule autour de l’histoire de la musique brésilienne et de la présence du trombone au Brésil. Le troisième chapitre présente d’abord un aperçu de l’enseignement artistique et musical au Brésil au 20e et 21e siècle, poursuit en abordant la situation de l’enseignement du trombone au Brésil et aboutit à une proposition favorisant l’apprentissage du trombone en contexte d’enseignement musical collectif. Finalement, le quatrième chapitre fait un retour sur l’expérience musicale vécue dans le premier volet du projet, celui se rapportant à la pratique musicale instrumentale, établit des liens et trace des pistes dans une perspective d’enseignement et d’apprentissage du trombone.

Mesh partitioning: A multilevel balancing and refinement algorithm

Multilevel algorithms are a successful class of optimisation techniques which address the mesh partitioning problem. They usually combine a graph contraction algorithm together with a local optimisation method which refines the partition at each graph level. In this paper we present an enhancement of the technique which uses imbalance to achieve higher quality partitions. We also present a formulation of the Kernighan-Lin partition optimisation algorithm which incorporates load-balancing. The resulting algorithm is tested against a different but related state-of the-art partitioner and shown to provide improved results.

Load-balancing for parallel adaptive unstructured grids

A parallel method for the dynamic partitioning of unstructured meshes is outlined. The method includes diffusive load-balancing techniques and an iterative optimisation technique known as relative gain optimisationwhich both balances theworkload and attempts to minimise the interprocessor communications overhead. It can also optionally include amultilevel strategy. Experiments on a series of adaptively refined meshes indicate that the algorithmprovides partitions of an equivalent or higher quality to static partitioners (which do not reuse the existing partition) and much more rapidly. Perhaps more importantly, the algorithm results in only a small fraction of the amount of data migration compared to the static partitioners.

Parallel dynamic load-balancing for adaptive unstructured meshes

This chapter describes a parallel optimization technique that incorporates a distributed load-balancing algorithm and provides an extremely fast solution to the problem of load-balancing adaptive unstructured meshes. Moreover, a parallel graph contraction technique can be employed to enhance the partition quality and the resulting strategy outperforms or matches results from existing state-of-the-art static mesh partitioning algorithms. The strategy can also be applied to static partitioning problems. Dynamic procedures have been found to be much faster than static techniques, to provide partitions of similar or higher quality and, in comparison, involve the migration of a fraction of the data. The method employs a new iterative optimization technique that balances the workload and attempts to minimize the interprocessor communications overhead. Experiments on a series of adaptively refined meshes indicate that the algorithm provides partitions of an equivalent or higher quality to static partitioners (which do not reuse the existing partition) and much more quickly. The dynamic evolution of load has three major influences on possible partitioning techniques; cost, reuse, and parallelism. The unstructured mesh may be modified every few time-steps and so the load-balancing must have a low cost relative to that of the solution algorithm in between remeshing.

Dynamic load-balancing for parallel adaptive unstructured meshes

A parallel method for dynamic partitioning of unstructured meshes is described. The method employs a new iterative optimisation technique which both balances the workload and attempts to minimise the interprocessor communications overhead. Experiments on a series of adaptively refined meshes indicate that the algorithm provides partitions of an equivalent or higher quality to static partitioners (which do not reuse the existing partition) and much more quickly. Perhaps more importantly, the algorithm results in only a small fraction of the amount of data migration compared to the static partitioners.

Parallel partitioning of unstructured meshes

A method is outlined for optimising graph partitions which arise in mapping un- structured mesh calculations to parallel computers. The method employs a combination of iterative techniques to both evenly balance the workload and minimise the number and volume of interprocessor communications. They are designed to work efficiently in parallel as well as sequentially and when combined with a fast direct partitioning technique (such as the Greedy algorithm) to give an initial partition, the resulting two-stage process proves itself to be both a powerful and flexible solution to the static graph-partitioning problem. The algorithms can also be used for dynamic load-balancing and a clustering technique can additionally be employed to speed up the whole process. Experiments indicate that the resulting parallel code can provide high quality partitions, independent of the initial partition, within a few seconds.

Aspect ratio for mesh partitioning

This paper deals with the measure of Aspect Ratio for mesh partitioning and gives hints why, for certain solvers, the Aspect Ratio of partitions plays an important role. We define and rate different kinds of Aspect Ratio, present a new center-based partitioning method which optimizes this measure implicitly and rate several existing partitioning methods and tools under the criterion of Aspect Ratio.

Mesh partitioning and load balancing for distributed memory parallel systems

A method is outlined for optimising graph partitions which arise in mapping unstructured mesh calculations to parallel computers. The method employs a relative gain iterative technique to both evenly balance the workload and minimise the number and volume of interprocessor communications. A parallel graph reduction technique is also briefly described and can be used to give a global perspective to the optimisation. The algorithms work efficiently in parallel as well as sequentially and when combined with a fast direct partitioning technique (such as the Greedy algorithm) to give an initial partition, the resulting two-stage process proves itself to be both a powerful and flexible solution to the static graph-partitioning problem. Experiments indicate that the resulting parallel code can provide high quality partitions, independent of the initial partition, within a few seconds. The algorithms can also be used for dynamic load-balancing, reusing existing partitions and in this case the procedures are much faster than static techniques, provide partitions of similar or higher quality and, in comparison, involve the migration of a fraction of the data.

Parallel dynamic graph-partitioning for unstructured meshes

A parallel method for the dynamic partitioning of unstructured meshes is described. The method introduces a new iterative optimisation technique known as relative gain optimisation which both balances the workload and attempts to minimise the interprocessor communications overhead. Experiments on a series of adaptively refined meshes indicate that the algorithm provides partitions of an equivalent or higher quality to static partitioners (which do not reuse the existing partition) and much more rapidly. Perhaps more importantly, the algorithm results in only a small fraction of the amount of data migration compared to the static partitioners.

Analysis of Molecular Dynamics Simulations of Protein Folding

Microsecond long Molecular Dynamics (MD) trajectories of biomolecular processes are now possible due to advances in computer technology. Soon, trajectories long enough to probe dynamics over many milliseconds will become available. Since these timescales match the physiological timescales over which many small proteins fold, all atom MD simulations of protein folding are now becoming popular. To distill features of such large folding trajectories, we must develop methods that can both compress trajectory data to enable visualization, and that can yield themselves to further analysis, such as the finding of collective coordinates and reduction of the dynamics. Conventionally, clustering has been the most popular MD trajectory analysis technique, followed by principal component analysis (PCA). Simple clustering used in MD trajectory analysis suffers from various serious drawbacks, namely, (i) it is not data driven, (ii) it is unstable to noise and change in cutoff parameters, and (iii) since it does not take into account interrelationships amongst data points, the separation of data into clusters can often be artificial. Usually, partitions generated by clustering techniques are validated visually, but such validation is not possible for MD trajectories of protein folding, as the underlying structural transitions are not well understood. Rigorous cluster validation techniques may be adapted, but it is more crucial to reduce the dimensions in which MD trajectories reside, while still preserving their salient features. PCA has often been used for dimension reduction and while it is computationally inexpensive, being a linear method, it does not achieve good data compression. In this thesis, I propose a different method, a nonmetric multidimensional scaling (nMDS) technique, which achieves superior data compression by virtue of being nonlinear, and also provides a clear insight into the structural processes underlying MD trajectories. I illustrate the capabilities of nMDS by analyzing three complete villin headpiece folding and six norleucine mutant (NLE) folding trajectories simulated by Freddolino and Schulten [1]. Using these trajectories, I make comparisons between nMDS, PCA and clustering to demonstrate the superiority of nMDS. The three villin headpiece trajectories showed great structural heterogeneity. Apart from a few trivial features like early formation of secondary structure, no commonalities between trajectories were found. There were no units of residues or atoms found moving in concert across the trajectories. A flipping transition, corresponding to the flipping of helix 1 relative to the plane formed by helices 2 and 3 was observed towards the end of the folding process in all trajectories, when nearly all native contacts had been formed. However, the transition occurred through a different series of steps in all trajectories, indicating that it may not be a common transition in villin folding. The trajectories showed competition between local structure formation/hydrophobic collapse and global structure formation in all trajectories. Our analysis on the NLE trajectories confirms the notion that a tight hydrophobic core inhibits correct 3-D rearrangement. Only one of the six NLE trajectories folded, and it showed no flipping transition. All the other trajectories get trapped in hydrophobically collapsed states. The NLE residues were found to be buried deeply into the core, compared to the corresponding lysines in the villin headpiece, thereby making the core tighter and harder to undo for 3-D rearrangement. Our results suggest that the NLE may not be a fast folder as experiments suggest. The tightness of the hydrophobic core may be a very important factor in the folding of larger proteins. It is likely that chaperones like GroEL act to undo the tight hydrophobic core of proteins, after most secondary structure elements have been formed, so that global rearrangement is easier. I conclude by presenting facts about chaperone-protein complexes and propose further directions for the study of protein folding.

Congruences in modular, Jacobi, Siegel, and mock modular forms with applications

We study congruences in the coefficients of modular and other automorphic forms. Ramanujan famously found congruences for the partition function like p(5n+4) = 0 mod 5. For a wide class of modular forms, we classify the primes for which there can be analogous congruences in the coefficients of the Fourier expansion. We have several applications. We describe the Ramanujan congruences in the counting functions for overparitions, overpartition pairs, crank differences, and Andrews' two-coloured generalized Frobenius partitions. We also study Ramanujan congruences in the Fourier coefficients of certain ratios of Eisenstein series. We also determine the exact number of holomorphic modular forms with Ramanujan congruences when the weight is large enough. In a chapter based on joint work with Olav Richter, we study Ramanujan congruences in the coefficients of Jacobi forms and Siegel modular forms of degree two. Finally, the last chapter contains a completely unrelated result about harmonic weak Maass forms.

A new construction of Calabi–Yau manifolds: Generalized CICYs

We present a generalization of the complete intersection in products of projective space (CICY) construction of Calabi–Yau manifolds. CICY three-folds and four-folds have been studied extensively in the physics literature. Their utility stems from the fact that they can be simply described in terms of a ‘configuration matrix’, a matrix of integers from which many of the details of the geometries can be easily extracted. The generalization we present is to allow negative integers in the configuration matrices which were previously taken to have positive semi-definite entries. This broadening of the complete intersection construction leads to a larger class of Calabi–Yau manifolds than that considered in previous work, which nevertheless enjoys much of the same degree of calculational control. These new Calabi–Yau manifolds are complete intersections in (not necessarily Fano) ambient spaces with an effective anticanonical class. We find examples with topology distinct from any that has appeared in the literature to date. The new manifolds thus obtained have many interesting features. For example, they can have smaller Hodge numbers than ordinary CICYs and lead to many examples with elliptic and K3-fibration structures relevant to F-theory and string dualities.

Multiple-Retrieval Case-Based Reasoning for Course Timetabling Problems

The structured representation of cases by attribute graphs in a Case-Based Reasoning (CBR) system for course timetabling has been the subject of previous research by the authors. In that system, the case base is organised as a decision tree and the retrieval process chooses those cases which are sub attribute graph isomorphic to the new case. The drawback of that approach is that it is not suitable for solving large problems. This paper presents a multiple-retrieval approach that partitions a large problem into small solvable sub-problems by recursively inputting the unsolved part of the graph into the decision tree for retrieval. The adaptation combines the retrieved partial solutions of all the partitioned sub-problems and employs a graph heuristic method to construct the whole solution for the new case. We present a methodology which is not dependant upon problem specific information and which, as such, represents an approach which underpins the goal of building more general timetabling systems. We also explore the question of whether this multiple-retrieval CBR could be an effective initialisation method for local search methods such as Hill Climbing, Tabu Search and Simulated Annealing. Significant results are obtained from a wide range of experiments. An evaluation of the CBR system is presented and the impact of the approach on timetabling research is discussed. We see that the approach does indeed represent an effective initialisation method for these approaches.