Abstract: Online learning initia-tives over the past decade have become increasingly comprehen-sive in their selection of courses and sophisticated in their presen-tation, culminating in the recent announcement of a number of consortium and startup activities that promise to make a university education on the internet, free of charge, a real possibility. At this pivotal moment it is appropriate to explore the potential for obtaining comprehensive bioinformatics training with currently existing free video resources. This article pre-sents such a bioinformatics curric-ulum in the form of a virtual course catalog, together with editorial commentary, and an assessment of strengths, weaknesses, and likely future directions for open online learning in this field. Online Learning Comes of Age Online academic ‘‘courseware’ ’ at the university level has now been available to the public for a decade, the earliest concerted effort having originated in 2002 with the Massachusetts Institute of Technology (MIT) and their OpenCour-seWare initiative

Parents, who directed me to follow the scientific path and where fully supportive at all times. Thanks to all the members of LSV – it was a pleasure working with You. I would like to thank the awesome people whom I have been working with in the same office on the 4th floor. Without all the nice riddles

Abstract not found

ges till offentlig granskning för avläggande av teknologie doktorsexamen fredagen

This Open Access Dissertation is brought to you for free and open access by the Dissertations and Theses at ScholarWorks@UMass Amherst. It has

First and foremost, I would like to thank my advisor, Prof. Jennifer E. Michaels. I am most appreciative of your guidance over the last four years, from the basics of elastic waves to both short- and long-term career advice. I have grown a tremendous amount, both profes-sionally and personally, and am deeply grateful for your mentorship, patience, and support. I would also like to thank my Ph.D. committee for their valuable insight and sugges-

Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments

Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations of con-cepts. This main goal is motivated by the basic fact, constituting also the main problem of KDD, that languages we may choose for knowledge description are incomplete. A fortiori, we have to describe concepts of interest (features, proper-ties, relations etc.) not completely but by means of their reflections (i.e. approx-imations) in the chosen language. The most important issues in this induction process are: – construction of relevant primitive concepts from which approximations of more complex concepts are assembled, – measures of inclusion and similarity (closeness) on concepts, – construction of operations producing complex concepts from the primitive ones.

mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where the group elements are data structures in a computer. Matrices are unnecessarily large structures, and part of this thesis is concerned with small and efficient representations of a large class of Coxeter groups (including most Coxeter groups that anyone ever payed any attention to.) The main contents of the thesis can be summarized as follows. • We prove that for all Coxeter graphs constructed from an n-path of unlabelled edges by adding a new labelled edge and a new vertex (sometimes two new edges and vertices), there is a permutational representation of the corresponding group. Group elements correspond to integer n-sequences and the nodes in the path generate all n! permutations. The extra node has a more complicated action, adding a certain quantity to some of the numbers.

In these lectures I review some basic examples of how the concepts of universality and scaling can be used to study aspects of the chiral and the deconfinement transition, if not in QCD directly but in QCD-like theories. As an example for flavor dynamics I discuss a quark-hadron model to describe the phase diagram of two-color QCD with the functional renormalization group. Universal aspects of deconfinement are illustrated mainly in the 2 + 1 dimensional SU(N) gauge theories with second order transition where many exact results from spin models can be exploited.