The topological trigger system of the TOF detector for the ALICE experiment at the LHC

The ALICE experiment at the LHC has been designed to cope with the experimental conditions and observables of a Quark Gluon Plasma reaction. One of the main assets of the ALICE experiment with respect to the other LHC experiments is the particle identification. The large Time-Of-Flight (TOF) detector is the main particle identification detector of the ALICE experiment. The overall time resolution, better that 80 ps, allows the particle identification over a large momentum range (up to 2.5 GeV/c for pi/K and 4 GeV/c for K/p). The TOF makes use of the Multi-gap Resistive Plate Chamber (MRPC), a detector with high efficiency, fast response and intrinsic time resoltion better than 40 ps. The TOF detector embeds a highly-segmented trigger system that exploits the fast rise time and the relatively low noise of the MRPC strips, in order to identify several event topologies. This work aims to provide detailed description of the TOF trigger system. The results achieved in the 2009 cosmic-ray run at CERN are presented to show the performances and readiness of TOF trigger system. The proposed trigger configuration for the proton-proton and Pb-Pb beams are detailed as well with estimates of the efficiencies and purity samples.

Implicit computational complexity and probabilistic classes

The thesis applies the ICC tecniques to the probabilistic polinomial complexity classes in order to get an implicit characterization of them. The main contribution lays on the implicit characterization of PP (which stands for Probabilistic Polynomial Time) class, showing a syntactical characterisation of PP and a static complexity analyser able to recognise if an imperative program computes in Probabilistic Polynomial Time. The thesis is divided in two parts. The first part focuses on solving the problem by creating a prototype of functional language (a probabilistic variation of lambda calculus with bounded recursion) that is sound and complete respect to Probabilistic Prolynomial Time. The second part, instead, reverses the problem and develops a feasible way to verify if a program, written with a prototype of imperative programming language, is running in Probabilistic polynomial time or not. This thesis would characterise itself as one of the first step for Implicit Computational Complexity over probabilistic classes. There are still open hard problem to investigate and try to solve. There are a lot of theoretical aspects strongly connected with these topics and I expect that in the future there will be wide attention to ICC and probabilistic classes.

Topological aspects of the human protein interaction network

It is currently widely accepted that the understanding of complex cell functions depends on an integrated network theoretical approach and not on an isolated view of the different molecular agents. Aim of this thesis was the examination of topological properties that mirror known biological aspects by depicting the human protein network with methods from graph- and network theory. The presented network is a partial human interactome of 9222 proteins and 36324 interactions, consisting of single interactions reliably extracted from peer-reviewed scientific publications. In general, one can focus on intra- or intermodular characteristics, where a functional module is defined as "a discrete entity whose function is separable from those of other modules". It is found that the presented human network is also scale-free and hierarchically organised, as shown for yeast networks before. The interactome also exhibits proteins with high betweenness and low connectivity which are biologically analyzed and interpreted here as shuttling proteins between organelles (e.g. ER to Golgi, internal ER protein translocation, peroxisomal import, nuclear pores import/export) for the first time. As an optimisation for finding proteins that connect modules, a new method is developed here based on proteins located between highly clustered regions, rather than regarding highly connected regions. As a proof of principle, the Mediator complex is found in first place, the prime example for a connector complex. Focusing on intramodular aspects, the measurement of k-clique communities discriminates overlapping modules very well. Twenty of the largest identified modules are analysed in detail and annotated to known biological structures (e.g. proteasome, the NFκB-, TGF-β complex). Additionally, two large and highly interconnected modules for signal transducer and transcription factor proteins are revealed, separated by known shuttling proteins. These proteins yield also the highest number of redundant shortcuts (by calculating the skeleton), exhibit the highest numbers of interactions and might constitute highly interconnected but spatially separated rich-clubs either for signal transduction or for transcription factors. This design principle allows manifold regulatory events for signal transduction and enables a high diversity of transcription events in the nucleus by a limited set of proteins. Altogether, biological aspects are mirrored by pure topological features, leading to a new view and to new methods that assist the annotation of proteins to biological functions, structures and subcellular localisations. As the human protein network is one of the most complex networks at all, these results will be fruitful for other fields of network theory and will help understanding complex network functions in general.

Institutional Complexity and Technology Transfer: A Theoretical and Empirical Analysis

This Doctoral Thesis unfolds into a collection of three distinct papers that share an interest in institutional theory and technology transfer. Taking into account that organizations are increasingly exposed to a multiplicity of demands and pressures, we aim to analyze what renders this situation of institutional complexity more or less difficult to manage for organizations, and what makes organizations more or less successful in responding to it. The three studies offer a novel contribution both theoretically and empirically. In particular, the first paper “The dimensions of organizational fields for understanding institutional complexity: A theoretical framework” is a theoretical contribution that tries to better understand the relationship between institutional complexity and fields by providing a framework. The second article “Beyond institutional complexity: The case of different organizational successes in confronting multiple institutional logics” is an empirical study which aims to explore the strategies that allow organizations facing multiple logics to respond more successfully to them. The third work “ How external support may mitigate the barriers to university-industry collaboration” is oriented towards practitioners and presents a case study about technology transfer in Italy.

Italian texts as networks: Topological measurements, Zipf and Heaps' laws

In questa tesi si è studiato un corpus di importanti testi della letteratura Italiana utilizzando la teoria dei network. Le misure topologiche tipiche dei network sono state calcolate sui testi letterari, poi sono state studiate le loro distribuzioni e i loro valori medi, per capire quali di esse possono distinguere un testo reale da sue modificazioni. Inoltre si è osservato come tutti i testi presentino due importanti leggi statistiche: la legge di Zipf e quella di Heaps.

Extending Implicit Computational Complexity and Abstract Machines to Languages with Control

The Curry-Howard isomorphism is the idea that proofs in natural deduction can be put in correspondence with lambda terms in such a way that this correspondence is preserved by normalization. The concept can be extended from Intuitionistic Logic to other systems, such as Linear Logic. One of the nice conseguences of this isomorphism is that we can reason about functional programs with formal tools which are typical of proof systems: such analysis can also include quantitative qualities of programs, such as the number of steps it takes to terminate. Another is the possiblity to describe the execution of these programs in terms of abstract machines. In 1990 Griffin proved that the correspondence can be extended to Classical Logic and control operators. That is, Classical Logic adds the possiblity to manipulate continuations. In this thesis we see how the things we described above work in this larger context.

Probabilistic Recursion Theory and Implicit Computational Complexity

In this thesis we provide a characterization of probabilistic computation in itself, from a recursion-theoretical perspective, without reducing it to deterministic computation. More specifically, we show that probabilistic computable functions, i.e., those functions which are computed by Probabilistic Turing Machines (PTM), can be characterized by a natural generalization of Kleene's partial recursive functions which includes, among initial functions, one that returns identity or successor with probability 1/2. We then prove the equi-expressivity of the obtained algebra and the class of functions computed by PTMs. In the the second part of the thesis we investigate the relations existing between our recursion-theoretical framework and sub-recursive classes, in the spirit of Implicit Computational Complexity. More precisely, endowing predicative recurrence with a random base function is proved to lead to a characterization of polynomial-time computable probabilistic functions.

Beyond socialism: Tanzanian theatre, neoliberalism and foreign aid complexity

Theatralität ist ein gängiges Konzept, um Theater in Afrika zu definieren. Wird dieses Konzept angewendet, so treten die historischen Unterschiede zwischen den verschiedenen Theaterformen in den Hintergrund. Deshalb ist es wichtig, Theater in einen kulturellen Kontext zu stellen, aus dem das Theater entsteht. Dadurch können nationale und internationale Suprastrukturen, die die sozialpolitische und wirtschaftliche Atmosphäre bestimmen, analysiert werden,. Da sich die aktuelle „globale“ Entwicklung auf neoliberale Grundsätze stützt, ist es offensichtlich, dass man Theater nicht diskutieren kann, ohne näher auf Neoliberalismus, Imperialismus, Kapitalismus, Entwicklungshilfe und Geberpolitik einzugehen.rnDerzeit werden die meisten Theaterprojekte in Tansania durch die Entwicklungshilfe oder ausländische Geberorganisationen unterstützt. Diese Organisationen stellen finanzielle Mittel zur Verfügung, um Theaterproduktionen auf unterschiedlichem Niveau zu ermöglichen. Diese Spendenpraxis hat zu der Fehlannahme geführt, dass Theater nur dann ein Theater ist, wenn es durch ausländische Organisationen finanziert wird. Jedoch ist es offensichtlich, dass diese finanziellen Mittel eine große Rolle in der Machtpolitik spielen. Diese Studie untersucht deshalb die Frage: Welchen Einfluss hat die neoliberale Politik, insbesondere durch die Entwicklungshilfe, auf das Theater in Tansania? Die Arbeit deckt einmal die Verbindung zwischen dem produzieren Theater und den verschiedenen dominierenden politischen Richtungen – von Nationalismus bis Neoliberalismus – auf. Darüber hinaus wird gezeigt, dass diese Verbindungen es dem Theater erschweren, diese Suprastrukturen zu vermeiden, durch die es finanziert wird. Das bedeutet, dass die neoliberale Politik mit seinen Merkmalen von Einengung, Unterdrückung und Ausbeutung auch ein eingeengtes, unterdrücktes und ausbeuterisches Theater hervorbringt. Dieser Studie bezeichnet ein solches Theater als Theater (Neo-)Liberalismus. Es ist ein Theater, das apolitisch auftritt, aber tatsächlich unter der neoliberal Politik des freien Markts und der Subventionsstreichungen ums Überleben kämpft.rnIndem diese Verbindungen zwischen Theater, Entwicklungshilfe und Geberorganisationen erläutert werden, kommt diese Forschung zu folgendem Ergebnis: Die Geberorganisationen haben kein Recht, unabhängig von der Höhe ihrer Spende, in die Souveränität eines Staates einzugreifen oder ein neues System einzuführen. Deshalb sollte die Loslösung von ausländischen Geberländern an erster Stelle stehen, damit sich das Theater ganz entwickeln und unabhängig überleben kann. Es ist deshalb notwendig, das Konzept des Volkstheaters neu zu definieren. Das Theater soll wieder mit den Initiativen von Menschen zu tun haben und ihre eigenen Themen in einem gewissen zeitlich und räumlichen Rahmen ansprechen.rnrn

Topological mass of magnetic Skyrmions probed by ultrafast dynamic imaging

In dieser Arbeit untersuchen wir mittels zeitaufgelöster Abbildungen die Gigahertz-Dynamik von magnetischen Skyrmionen, um die Bewegungsgleichungen für diese Quasiteilchen zu bestimmen. Um dieses Ziel zu erreichen haben wir zunächst ein CoB/Pt Schichtsystem entwickelt, das starke senkrechte magnetische Anisotropie mit einer besonders geringen Rauigkeit der Energielandschaft verbindet. Diese Eigenschaften sind für das repetitive dynamische Abbildungsverfahren unerlässlich. In einem zweiten Schritt haben wir das Probendesign optimiert und so weiterentwickelt, dass eine Beobachtung der Skyrmionenbewegung mit einer Auflösung von besser als 3 nm möglich wurde. Aufgrund dieser Verbesserungen ist es uns gelungen, die Trajektorie eines Skyrmionen aufzuzeichnen. Diese Bewegung ist eine Superposition von zwei Drehbewegungen, einer im Uhrzeigersinn und einer gegen läufigen. Aus der Existenz dieser zwei Moden lässt sich schließen, dass Skyrmionen träge Quasiteilchen sind, und aus den Frequenzen können wir einen Wert für die träge Masse ableiten. Es stellt sich heraus, dass die Masse von Skyrmion fünfmal größer ist als von existierenden Theorien vorhergesagt. Die Masse wird folglich durch einen neuartigen Mechanismus bestimmt, der sich aus der räumlichen Beschränkung der Skyrmionen ergibt, welche sich direkt aus der Topologie bleitenrnlässt.

Analysis of robot dynamics through complexity measures: an application in automatic design

L'applicazione di misure, derivanti dalla teoria dell'informazione, fornisce un valido strumento per quantificare alcune delle proprietà dei sistemi complessi. Le stesse misure possono essere utilizzate in robotica per favorire l'analisi e la sintesi di sistemi di controllo per robot. In questa tesi si è analizzata la correlazione tra alcune misure di complessità e la capacità dei robot di portare a termine, con successo, tre differenti task. I risultati ottenuti suggeriscono che tali misure di complessità rappresentano uno strumento promettente anche nel campo della robotica, ma che il loro utilizzo può diventare difficoltoso quando applicate a task compositi.

Complexity of miR-223 regulation by CEBPA in human AML

microRNA-223 (miR-223) can trigger normal granulopoiesis. miR-223 expression is regulated by two distinct CEBPA (CCAAT/enhancer binding protein-alpha) sites. Here, we report that miR-223 is largely suppressed in cells from acute myeloid leukemia (AML) patients. By sequencing, we found that miR-223 suppression in AML is not caused by DNA sequence alterations, nor is it mediated by promoter hypermethylation. The analysis of the individual contribution of both CEBPA sites to miR-223 regulation identified the site upstream of the miR-223 primary transcript as the predominant regulatory element. Our results suggest that miR-223 suppression in AML is caused by impaired miR-223 upstream factors.