A planar Penning trap

In this thesis I present theoretical and experimental results concern- ing the operation and properties of a new kind of Penning trap, the planar trap. It consists of circular electrodes printed on an isolating surface, with an homogeneous magnetic field pointing perpendicular to that surface. The motivation of such geometry is to be found in the construction of an array of planar traps for quantum informa- tional purposes. The open access to radiation of this geometry, and the long coherence times expected for Penning traps, make the planar trap a good candidate for quantum computation. Several proposals for quantum 2-qubit interactions are studied and estimates for their rates are given. An expression for the electrostatic potential is presented, and its fea- tures exposed. A detailed study of the anharmonicity of the potential is given theoretically and is later demonstrated by experiment and numerical simulations, showing good agreement. Size scalability of this trap has been studied by replacing the original planar trap by a trap twice smaller in the experimental setup. This substitution shows no scale effect apart from those expected for the scaling of the parameters of the trap. A smaller lifetime for trapped electrons is seen for this smaller trap, but is clearly matched to a bigger misalignment of the trap’s surface and the magnetic field, due to its more difficult hand manipulation. I also give a hint that this trap may be of help in studying non-linear dynamics for a sextupolarly perturbed Penning trap.

Advanced data deduplication techniques and their application

Data deduplication describes a class of approaches that reduce the storage capacity needed to store data or the amount of data that has to be transferred over a network. These approaches detect coarse-grained redundancies within a data set, e.g. a file system, and remove them.rnrnOne of the most important applications of data deduplication are backup storage systems where these approaches are able to reduce the storage requirements to a small fraction of the logical backup data size.rnThis thesis introduces multiple new extensions of so-called fingerprinting-based data deduplication. It starts with the presentation of a novel system design, which allows using a cluster of servers to perform exact data deduplication with small chunks in a scalable way.rnrnAfterwards, a combination of compression approaches for an important, but often over- looked, data structure in data deduplication systems, so called block and file recipes, is introduced. Using these compression approaches that exploit unique properties of data deduplication systems, the size of these recipes can be reduced by more than 92% in all investigated data sets. As file recipes can occupy a significant fraction of the overall storage capacity of data deduplication systems, the compression enables significant savings.rnrnA technique to increase the write throughput of data deduplication systems, based on the aforementioned block and file recipes, is introduced next. The novel Block Locality Caching (BLC) uses properties of block and file recipes to overcome the chunk lookup disk bottleneck of data deduplication systems. This chunk lookup disk bottleneck either limits the scalability or the throughput of data deduplication systems. The presented BLC overcomes the disk bottleneck more efficiently than existing approaches. Furthermore, it is shown that it is less prone to aging effects.rnrnFinally, it is investigated if large HPC storage systems inhibit redundancies that can be found by fingerprinting-based data deduplication. Over 3 PB of HPC storage data from different data sets have been analyzed. In most data sets, between 20 and 30% of the data can be classified as redundant. According to these results, future work in HPC storage systems should further investigate how data deduplication can be integrated into future HPC storage systems.rnrnThis thesis presents important novel work in different area of data deduplication re- search.

Diskontinuierliche Galerkin-Verfahren für die operationelle Wettervorhersage

In dieser Arbeit wird ein neuer Dynamikkern entwickelt und in das bestehendernnumerische Wettervorhersagesystem COSMO integriert. Für die räumlichernDiskretisierung werden diskontinuierliche Galerkin-Verfahren (DG-Verfahren)rnverwendet, für die zeitliche Runge-Kutta-Verfahren. Hierdurch ist ein Verfahrenrnhoher Ordnung einfach zu realisieren und es sind lokale Erhaltungseigenschaftenrnder prognostischen Variablen gegeben. Der hier entwickelte Dynamikkern verwendetrngeländefolgende Koordinaten in Erhaltungsform für die Orographiemodellierung undrnkoppelt das DG-Verfahren mit einem Kessler-Schema für warmen Niederschlag. Dabeirnwird die Fallgeschwindigkeit des Regens, nicht wie üblich implizit imrnKessler-Schema diskretisiert, sondern explizit im Dynamikkern. Hierdurch sindrndie Zeitschritte der Parametrisierung für die Phasenumwandlung des Wassers undrnfür die Dynamik vollständig entkoppelt, wodurch auch sehr große Zeitschritte fürrndie Parametrisierung verwendet werden können. Die Kopplung ist sowohl fürrnOperatoraufteilung, als auch für Prozessaufteilung realisiert.rnrnAnhand idealisierter Testfälle werden die Konvergenz und die globalenrnErhaltungseigenschaften des neu entwickelten Dynamikkerns validiert. Die Massernwird bis auf Maschinengenauigkeit global erhalten. Mittels Bergüberströmungenrnwird die Orographiemodellierung validiert. Die verwendete Kombination ausrnDG-Verfahren und geländefolgenden Koordinaten ermöglicht die Behandlung vonrnsteileren Bergen, als dies mit dem auf Finite-Differenzenverfahren-basierendenrnDynamikkern von COSMO möglich ist. Es wird gezeigt, wann die vollernTensorproduktbasis und wann die Minimalbasis vorteilhaft ist. Die Größe desrnEinflusses auf das Simulationsergebnis der Verfahrensordnung, desrnParametrisierungszeitschritts und der Aufteilungsstrategie wirdrnuntersucht. Zuletzt wird gezeigt dass bei gleichem Zeitschritt die DG-Verfahrenrnaufgrund der besseren Skalierbarkeit in der Laufzeit konkurrenzfähig zurnFinite-Differenzenverfahren sind.

Field-free control of magnetism in nanostructured materials probed with high resolution X-ray microscopy

Magnetic memories are a backbone of today's digital data storage technology, where the digital information is stored as the magnetic configuration of nanostructured ferromagnetic bits. Currently, the writing of the digital information on the magnetic memory is carried out with the help of magnetic fields. This approach, while viable, is not optimal due to its intrinsically high energy consumption and relatively poor scalability. For this reason, the research for different mechanisms that can be used to manipulate the magnetic configuration of a material is of interest. In this thesis, the control of the magnetization of different nanostructured materials with field-free mechanisms is investigated. The magnetic configuration of these nanostructured materials was imaged directly with high resolution x-ray magnetic microscopy. rnFirst of all, the control of the magnetic configuration of nanostructured ferromagnetic Heusler compounds by fabricating nanostructures with different geometries was analyzed. Here, it was observed that the magnetic configuration of the nanostructured elements is given by the competition of magneto-crystalline and shape anisotropy. By fabricating elements with different geometries, we could alter the point where these two effects equilibrate, allowing for the possibility to tailor the magnetic configuration of these nanostructured elements to the required necessities.rnThen, the control of the magnetic configuration of Ni nanostructures fabricated on top of a piezoelectric material with the magneto-elastic effect (i.e. by applying a piezoelectric strain to the Ni nanostructures) was investigated. Here, the magneto-elastic coupling effect gives rise to an additional anisotropy contribution, proportional to the strain applied to the magnetic material. For this system, a reproducible and reversible control of the magnetic configuration of the nanostructured Ni elements with the application of an electric field across the piezoelectric material was achieved.rnFinally, the control of the magnetic configuration of La0.7Sr0.3MnO3 (LSMO) nanostructures with spin-polarized currents was studied. Here, the spin-transfer torque effect was employed to achieve the displacement of magnetic domain walls in the LSMO nanostructures. A high spin-transfer torque efficiency was observed for LSMO at low temperatures, and a Joule-heating induced hopping of the magnetic domain walls was observed at room temperatures, allowing for the analysis of the energetics of the domain walls in LSMO.rnThe results presented in this thesis give thus an overview on the different field-free approaches that can be used to manipulate and tailor the magnetization configuration of a nanostructured material to the various technological requirements, opening up novel interesting possibilities for these materials.