Abstract:
Multiview light sheet fluorescence microscopy (LSFM) allows to image developing organisms in 3D at unprecedented temporal resolution over long periods of time. The resulting massive amounts of raw image data requires extensive processing interactively via dedicated graphical user interface (GUI) applications. The consecutive processing steps can be easily automated and the individual time points can be processed independently, which lends itself to trivial parallelization on a high performance cluster (HPC). Here we introduce an automated workflow for processing large multiview, multi-channel, multi-illumination time-lapse LSFM data on a single workstation or in parallel on a HPC. The pipeline relies on snakemake to resolve dependencies among consecutive processing steps and can be easily adapted to any cluster environment for processing LSFM data in a fraction of the time required to collect it.

Abstract:
Markus Schmids bachelor thesis Eine kritische Stimme zur Hexenverfolgung: Johannes Matth us Meyfarts Christliche Erinnerung von 1635 (A critical view on the persecution of witches: Johannes Matth us Meyfarts Christian Commemoration of 1635) takes us back to early modern Europe and the age of witchtrials. With Johannes Matth us Meyfarts Christliche Erinnerung Schmid presents a view opposed to the persecution of men and women, who have been accused of witchcraft. Schmid succeeds in demonstrating how Meyfarts personal experience led him to a different approach of criticizing this persecution: The criticism of the authorities and the methods used to prosecute those accused of witchcraft. Schmids conclusion reflects the importance of Meyfarts Christliche Erinnerung for the reappraisal of these dark times.

Abstract:
We present approximate methods for calculating the three-dimensional electric potentials of finite surface electrodes including gaps between electrodes, and estimate the effects of finite electrode thickness and an underlying dielectric substrate. As an example we optimize a radio-frequency surface-electrode ring ion trap, and find that each of these factors reduces the trapping secular frequencies by less than 5% in realistic situations. This small magnitude validates the usual assumption of neglecting the influences of gaps between electrodes and finite electrode extent.

Abstract:
This document is the lecture script of a one-semester course taught at the University of Basel in the Fall semesters of 2012 and 2013 and in the Spring semester of 2015. It is aimed at advanced students of physics who are familiar with the concepts and notations of quantum mechanics. Quantum mechanics lectures can often be separated into two classes. In the first class you get to know Schroedinger's equation and find the form and dynamics of simple physical systems (square well, harmonic oscillator, hydrogen atom); most calculations are analytic and inspired by calculations originally done in the 1920s and 1930s. In the second class you learn about large systems such as molecular structures, crystalline solids, or lattice models; these calculations are usually so complicated that it is difficult for the student to understand them in all detail. This lecture tries to bridge the gap between simple analytic calculations and complicated large-scale computations. We will revisit most of the problems encountered in introductory quantum mechanics, focusing on computer implementations for finding analytical as well as numerical solutions and their visualization. Most of these calculations are too complicated to be done by hand. Even relatively simple problems, such as two interacting particles in a one-dimensional trap, do not have analytic solutions and require the use of computers for their solution and visualization. More complex problems scale exponentially with the number of degrees of freedom, and make the use of large computer simulations unavoidable. The course is taught using the Mathematica programming language; however, the concepts presented are readily translated to any other programming language.

Abstract:
Searle's Chinese Room argument is refuted by showing that he has actually given two different versions of the room, which fail for different reasons. Hence, Searle does not achieve his stated goal of showing ``that a system could have input and output capabilities that duplicated those of a native Chinese speaker and still not understand Chinese''.

Abstract:
Die Einführung moderner immunmodulierender Therapien hat neue Perspektiven in der Behandlung der Multiplen Sklerose er ffnet. Erstmals kann zumindest bei einem Teil der betroffenen Patienten die Zahl der Schübe verringert und auch die Progredienz der Behinderung signifikant verlangsamt werden. Vor allem bei Patienten mit schlechterer prognostischer Ausgangslage sollte früh mit einer immunmodulierenden Therapie begonnen werden. Bei wenig Unterschieden im Wirkprofil und hnlichen Nebenwirkungen ist allerdings die Wahl des Pr parats nicht einfach, und es sollte auch die konkrete Lebenssituation des Betroffenen in der Entscheidung berücksichtigt werden.

Abstract:
We prove explicit approximation hardness results for the Graphic TSP on cubic and subcubic graphs as well as the new inapproximability bounds for the corresponding instances of the (1,2)-TSP. The proof technique uses new modular constructions of simulating gadgets for the restricted cubic and subcubic instances. The modular constructions used in the paper could be also of independent interest.

Abstract:
We develop a new method for proving explicit approximation lower bounds for TSP problems with bounded metrics improving on the best up to now known bounds. They almost match the best known bounds for unbounded metric TSP problems. In particular, we prove the best known lower bound for TSP with bounded metrics for the metric bound equal to 4.

Abstract:
We study the approximation hardness of the Shortest Superstring, the Maximal Compression and the Maximum Asymmetric Traveling Salesperson (MAX-ATSP) problem. We introduce a new reduction method that produces strongly restricted instances of the Shortest Superstring problem, in which the maximal orbit size is eight (with no character appearing more than eight times) and all given strings having length four. Based on this reduction method, we are able to improve the best up to now known approximation lower bound for the Shortest Superstring problem and the Maximal Compression problem by an order of magnitude. The results imply also an improved approximation lower bound for the MAX-ATSP problem.