Reconstruction and analysis of the NF-kB pathway interactome: a systems biology approach

Background. One of the phenomena observed in human aging is the progressive increase of a systemic inflammatory state, a condition referred to as “inflammaging”, negatively correlated with longevity. A prominent mediator of inflammation is the transcription factor NF-kB, that acts as key transcriptional regulator of many genes coding for pro-inflammatory cytokines. Many different signaling pathways activated by very diverse stimuli converge on NF-kB, resulting in a regulatory network characterized by high complexity. NF-kB signaling has been proposed to be responsible of inflammaging. Scope of this analysis is to provide a wider, systemic picture of such intricate signaling and interaction network: the NF-kB pathway interactome. Methods. The study has been carried out following a workflow for gathering information from literature as well as from several pathway and protein interactions databases, and for integrating and analyzing existing data and the relative reconstructed representations by using the available computational tools. Strong manual intervention has been necessarily used to integrate data from multiple sources into mathematically analyzable networks. The reconstruction of the NF-kB interactome pursued with this approach provides a starting point for a general view of the architecture and for a deeper analysis and understanding of this complex regulatory system. Results. A “core” and a “wider” NF-kB pathway interactome, consisting of 140 and 3146 proteins respectively, were reconstructed and analyzed through a mathematical, graph-theoretical approach. Among other interesting features, the topological characterization of the interactomes shows that a relevant number of interacting proteins are in turn products of genes that are controlled and regulated in their expression exactly by NF-kB transcription factors. These “feedback loops”, not always well-known, deserve deeper investigation since they may have a role in tuning the response and the output consequent to NF-kB pathway initiation, in regulating the intensity of the response, or its homeostasis and balance in order to make the functioning of such critical system more robust and reliable. This integrated view allows to shed light on the functional structure and on some of the crucial nodes of thet NF-kB transcription factors interactome. Conclusion. Framing structure and dynamics of the NF-kB interactome into a wider, systemic picture would be a significant step toward a better understanding of how NF-kB globally regulates diverse gene programs and phenotypes. This study represents a step towards a more complete and integrated view of the NF-kB signaling system.

Near-Optimum Coding for q-ary Symmetric Channel with Application to Space Communications

Questa Tesi aspira a mostrare un codice a livello di pacchetto, che abbia performance molto vicine a quello ottimo, per progetti di comunicazioni Satellitari. L’altro scopo di questa Tesi è quello di capire se rimane ancora molto più difficile maneggiare direttamente gli errori piuttosto che le erasures. Le applicazioni per comunicazioni satellitari ora come ora usano tutte packet erasure coding per codificare e decodificare l’informazione. La struttura dell’erasure decoding è molto semplice, perché abbiamo solamente bisogno di un Cyclic Redundancy Check (CRC) per realizzarla. Il problema nasce quando abbiamo pacchetti di dimensioni medie o piccole (per esempio più piccole di 100 bits) perché in queste situazioni il costo del CRC risulta essere troppo dispendioso. La soluzione la possiamo trovare utilizzando il Vector Symbol Decoding (VSD) per raggiungere le stesse performance degli erasure codes, ma senza la necessità di usare il CRC. Per prima cosa viene fatta una breve introduzione su come è nata e su come si è evoluta la codifica a livello di pacchetto. In seguito è stato introdotto il canale q-ary Symmetric Channel (qSC), con sia la derivazione della sua capacità che quella del suo Random Coding Bound (RCB). VSD è stato poi proposto con la speranza di superare in prestazioni il Verification Based Decoding (VBD) su il canale qSC. Infine, le effettive performance del VSD sono state stimate via simulazioni numeriche. I possibili miglioramenti delle performance, per quanto riguarda il VBD sono state discusse, come anche le possibili applicazioni future. Inoltre abbiamo anche risposto alla domande se è ancora così tanto più difficile maneggiare gli errori piuttosto che le erasure.

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.

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.

Coding of reaching in 3-D space

Many psychophysical studies suggest that target depth and direction during reaches are processed independently, but the neurophysiological support to this view is so far limited. Here, we investigated the representation of reach depth and direction by single neurons in an area of the medial posterior parietal cortex (V6A). Single-unit activity was recorded from V6A in two Macaca fascicularis monkeys performing a fixation-to-reach task to targets at different depths and directions. We found that in a substantial percentage of V6A neurons depth and direction signals jointly influenced fixation, planning and arm movement-related activity in 3D space. While target depth and direction were equally encoded during fixation, depth tuning became stronger during arm movement planning, execution and target holding. The spatial tuning of fixation activity was often maintained across epochs, and this occurred more frequently in depth. These findings support for the first time the existence of a common neural substrate for the encoding of target depth and direction during reaching movements in the posterior parietal cortex. Present results also highlight the presence in V6A of several types of cells that process independently or jointly eye position and arm movement planning and execution signals in order to control reaches in 3D space. It is possible that depth and direction influence also the metrics of the reach action and that this effect on the reach kinematic variables can account for the spatial tuning we found in V6A neural activity. For this reason, we recorded and analyzed behavioral data when one monkey performed reaching movements in 3-D space. We evaluated how the target spatial position, in particular target depth and target direction, affected the kinematic parameters and trajectories describing the motor action properties.

Architettura di supporto al peer-to-peer gaming basata su network coding

La popolarita` dei giochi online e` in crescita, ma allo stesso tempo le architetture proposte dagli sviluppatori e le connessioni di cui sono dotati gli utenti sembrano restare non adeguate a questo. Nella tesi si descrive un'architettura peer-to-peer che riesce ad effettuare una riduzione nella perdita dei pacchetti grazie al meccanismo del Network Coding senza effetti collaterali per la latenza.

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.

Learning with Kernels on Graphs: DAG-based kernels, data streams and RNA function prediction.

In many application domains data can be naturally represented as graphs. When the application of analytical solutions for a given problem is unfeasible, machine learning techniques could be a viable way to solve the problem. Classical machine learning techniques are defined for data represented in a vectorial form. Recently some of them have been extended to deal directly with structured data. Among those techniques, kernel methods have shown promising results both from the computational complexity and the predictive performance point of view. Kernel methods allow to avoid an explicit mapping in a vectorial form relying on kernel functions, which informally are functions calculating a similarity measure between two entities. However, the definition of good kernels for graphs is a challenging problem because of the difficulty to find a good tradeoff between computational complexity and expressiveness. Another problem we face is learning on data streams, where a potentially unbounded sequence of data is generated by some sources. There are three main contributions in this thesis. The first contribution is the definition of a new family of kernels for graphs based on Directed Acyclic Graphs (DAGs). We analyzed two kernels from this family, achieving state-of-the-art results from both the computational and the classification point of view on real-world datasets. The second contribution consists in making the application of learning algorithms for streams of graphs feasible. Moreover,we defined a principled way for the memory management. The third contribution is the application of machine learning techniques for structured data to non-coding RNA function prediction. In this setting, the secondary structure is thought to carry relevant information. However, existing methods considering the secondary structure have prohibitively high computational complexity. We propose to apply kernel methods on this domain, obtaining state-of-the-art results.

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.

Role of Non-coding RNAs in chemotherapeutic treatments

The transcribed ultraconserved regions (T-UCRs) are a group of long non-coding RNAs involved in human carcinogenesis. The factors regulating the expression of T-UCRs and their mechanism of action in human cancers are unknown. In this work it was shown that high expression of uc.339 associates with lower survival in 204 non-small cell lung cancer (NSCLC) patients. Moreover, it was shown that uc.339 found up-regulated in archival NSCLC samples, acts as a decoy RNA for miR-339-3p, -663-3p and -95-5p. So, Cyclin E2, a direct target of three microRNAs is up-regulated, inducing cancer growth and migration. Evidence of this mechanism was provided from cell lines and primary samples confirming that TP53 directly regulates uc.339. These results support a key role for uc.339 in lung cancer.

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

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.

Learning Spike-Based Population Codes by Reward and Population Feedback

We investigate a recently proposed model for decision learning in a population of spiking neurons where synaptic plasticity is modulated by a population signal in addition to reward feedback. For the basic model, binary population decision making based on spike/no-spike coding, a detailed computational analysis is given about how learning performance depends on population size and task complexity. Next, we extend the basic model to n-ary decision making and show that it can also be used in conjunction with other population codes such as rate or even latency coding.