Specification, execution and verification of interaction protocols: an approach based on computational logic

Interaction protocols establish how different computational entities can interact with each other. The interaction can be finalized to the exchange of data, as in 'communication protocols', or can be oriented to achieve some result, as in 'application protocols'. Moreover, with the increasing complexity of modern distributed systems, protocols are used also to control such a complexity, and to ensure that the system as a whole evolves with certain features. However, the extensive use of protocols has raised some issues, from the language for specifying them to the several verification aspects. Computational Logic provides models, languages and tools that can be effectively adopted to address such issues: its declarative nature can be exploited for a protocol specification language, while its operational counterpart can be used to reason upon such specifications. In this thesis we propose a proof-theoretic framework, called SCIFF, together with its extensions. SCIFF is based on Abductive Logic Programming, and provides a formal specification language with a clear declarative semantics (based on abduction). The operational counterpart is given by a proof procedure, that allows to reason upon the specifications and to test the conformance of given interactions w.r.t. a defined protocol. Moreover, by suitably adapting the SCIFF Framework, we propose solutions for addressing (1) the protocol properties verification (g-SCIFF Framework), and (2) the a-priori conformance verification of peers w.r.t. the given protocol (AlLoWS Framework). We introduce also an agent based architecture, the SCIFF Agent Platform, where the same protocol specification can be used to program and to ease the implementation task of the interacting peers.

Tecniche per il controllo dinamico del consumo di potenza per piattaforme system-on-chip

Providing support for multimedia applications on low-power mobile devices remains a significant research challenge. This is primarily due to two reasons: • Portable mobile devices have modest sizes and weights, and therefore inadequate resources, low CPU processing power, reduced display capabilities, limited memory and battery lifetimes as compared to desktop and laptop systems. • On the other hand, multimedia applications tend to have distinctive QoS and processing requirementswhichmake themextremely resource-demanding. This innate conflict introduces key research challenges in the design of multimedia applications and device-level power optimization. Energy efficiency in this kind of platforms can be achieved only via a synergistic hardware and software approach. In fact, while System-on-Chips are more and more programmable thus providing functional flexibility, hardwareonly power reduction techniques cannot maintain consumption under acceptable bounds. It is well understood both in research and industry that system configuration andmanagement cannot be controlled efficiently only relying on low-level firmware and hardware drivers. In fact, at this level there is lack of information about user application activity and consequently about the impact of power management decision on QoS. Even though operating system support and integration is a requirement for effective performance and energy management, more effective and QoSsensitive power management is possible if power awareness and hardware configuration control strategies are tightly integratedwith domain-specificmiddleware services. The main objective of this PhD research has been the exploration and the integration of amiddleware-centric energymanagement with applications and operating-system. We choose to focus on the CPU-memory and the video subsystems, since they are the most power-hungry components of an embedded system. A second main objective has been the definition and implementation of software facilities (like toolkits, API, and run-time engines) in order to improve programmability and performance efficiency of such platforms. Enhancing energy efficiency and programmability ofmodernMulti-Processor System-on-Chips (MPSoCs) Consumer applications are characterized by tight time-to-market constraints and extreme cost sensitivity. The software that runs on modern embedded systems must be high performance, real time, and even more important low power. Although much progress has been made on these problems, much remains to be done. Multi-processor System-on-Chip (MPSoC) are increasingly popular platforms for high performance embedded applications. This leads to interesting challenges in software development since efficient software development is a major issue for MPSoc designers. An important step in deploying applications on multiprocessors is to allocate and schedule concurrent tasks to the processing and communication resources of the platform. The problem of allocating and scheduling precedenceconstrained tasks on processors in a distributed real-time system is NP-hard. There is a clear need for deployment technology that addresses thesemulti processing issues. This problem can be tackled by means of specific middleware which takes care of allocating and scheduling tasks on the different processing elements and which tries also to optimize the power consumption of the entire multiprocessor platform. This dissertation is an attempt to develop insight into efficient, flexible and optimalmethods for allocating and scheduling concurrent applications tomultiprocessor architectures. It is a well-known problem in literature: this kind of optimization problems are very complex even in much simplified variants, therefore most authors propose simplified models and heuristic approaches to solve it in reasonable time. Model simplification is often achieved by abstracting away platform implementation ”details”. As a result, optimization problems become more tractable, even reaching polynomial time complexity. Unfortunately, this approach creates an abstraction gap between the optimization model and the real HW-SW platform. The main issue with heuristic or, more in general, with incomplete search is that they introduce an optimality gap of unknown size. They provide very limited or no information on the distance between the best computed solution and the optimal one. The goal of this work is to address both abstraction and optimality gaps, formulating accurate models which accounts for a number of ”non-idealities” in real-life hardware platforms, developing novel mapping algorithms that deterministically find optimal solutions, and implementing software infrastructures required by developers to deploy applications for the targetMPSoC platforms. Energy Efficient LCDBacklightAutoregulation on Real-LifeMultimediaAp- plication Processor Despite the ever increasing advances in Liquid Crystal Display’s (LCD) technology, their power consumption is still one of the major limitations to the battery life of mobile appliances such as smart phones, portable media players, gaming and navigation devices. There is a clear trend towards the increase of LCD size to exploit the multimedia capabilities of portable devices that can receive and render high definition video and pictures. Multimedia applications running on these devices require LCD screen sizes of 2.2 to 3.5 inches andmore to display video sequences and pictures with the required quality. LCD power consumption is dependent on the backlight and pixel matrix driving circuits and is typically proportional to the panel area. As a result, the contribution is also likely to be considerable in future mobile appliances. To address this issue, companies are proposing low power technologies suitable for mobile applications supporting low power states and image control techniques. On the research side, several power saving schemes and algorithms can be found in literature. Some of them exploit software-only techniques to change the image content to reduce the power associated with the crystal polarization, some others are aimed at decreasing the backlight level while compensating the luminance reduction by compensating the user perceived quality degradation using pixel-by-pixel image processing algorithms. The major limitation of these techniques is that they rely on the CPU to perform pixel-based manipulations and their impact on CPU utilization and power consumption has not been assessed. This PhDdissertation shows an alternative approach that exploits in a smart and efficient way the hardware image processing unit almost integrated in every current multimedia application processors to implement a hardware assisted image compensation that allows dynamic scaling of the backlight with a negligible impact on QoS. The proposed approach overcomes CPU-intensive techniques by saving system power without requiring either a dedicated display technology or hardware modification. Thesis Overview The remainder of the thesis is organized as follows. The first part is focused on enhancing energy efficiency and programmability of modern Multi-Processor System-on-Chips (MPSoCs). Chapter 2 gives an overview about architectural trends in embedded systems, illustrating the principal features of new technologies and the key challenges still open. Chapter 3 presents a QoS-driven methodology for optimal allocation and frequency selection for MPSoCs. The methodology is based on functional simulation and full system power estimation. Chapter 4 targets allocation and scheduling of pipelined stream-oriented applications on top of distributed memory architectures with messaging support. We tackled the complexity of the problem by means of decomposition and no-good generation, and prove the increased computational efficiency of this approach with respect to traditional ones. Chapter 5 presents a cooperative framework to solve the allocation, scheduling and voltage/frequency selection problem to optimality for energyefficient MPSoCs, while in Chapter 6 applications with conditional task graph are taken into account. Finally Chapter 7 proposes a complete framework, called Cellflow, to help programmers in efficient software implementation on a real architecture, the Cell Broadband Engine processor. The second part is focused on energy efficient software techniques for LCD displays. Chapter 8 gives an overview about portable device display technologies, illustrating the principal features of LCD video systems and the key challenges still open. Chapter 9 shows several energy efficient software techniques present in literature, while Chapter 10 illustrates in details our method for saving significant power in an LCD panel. Finally, conclusions are drawn, reporting the main research contributions that have been discussed throughout this dissertation.

Caratterizzazione del legame di molecole di interesse farmaceutico alla sieroalbumina umana mediante biocromatografia e dicroismo circolare

Negli ultimi anni, un crescente numero di studiosi ha focalizzato la propria attenzione sullo sviluppo di strategie che permettessero di caratterizzare le proprietà ADMET dei farmaci in via di sviluppo, il più rapidamente possibile. Questa tendenza origina dalla consapevolezza che circa la metà dei farmaci in via di sviluppo non viene commercializzato perché ha carenze nelle caratteristiche ADME, e che almeno la metà delle molecole che riescono ad essere commercializzate, hanno comunque qualche problema tossicologico o ADME [1]. Infatti, poco importa quanto una molecola possa essere attiva o specifica: perché possa diventare farmaco è necessario che venga ben assorbita, distribuita nell’organismo, metabolizzata non troppo rapidamente, ne troppo lentamente e completamente eliminata. Inoltre la molecola e i suoi metaboliti non dovrebbero essere tossici per l’organismo. Quindi è chiaro come una rapida determinazione dei parametri ADMET in fasi precoci dello sviluppo del farmaco, consenta di risparmiare tempo e denaro, permettendo di selezionare da subito i composti più promettenti e di lasciar perdere quelli con caratteristiche negative. Questa tesi si colloca in questo contesto, e mostra l’applicazione di una tecnica semplice, la biocromatografia, per caratterizzare rapidamente il legame di librerie di composti alla sieroalbumina umana (HSA). Inoltre mostra l’utilizzo di un’altra tecnica indipendente, il dicroismo circolare, che permette di studiare gli stessi sistemi farmaco-proteina, in soluzione, dando informazioni supplementari riguardo alla stereochimica del processo di legame. La HSA è la proteina più abbondante presente nel sangue. Questa proteina funziona da carrier per un gran numero di molecole, sia endogene, come ad esempio bilirubina, tiroxina, ormoni steroidei, acidi grassi, che xenobiotici. Inoltre aumenta la solubilità di molecole lipofile poco solubili in ambiente acquoso, come ad esempio i tassani. Il legame alla HSA è generalmente stereoselettivo e ad avviene a livello di siti di legame ad alta affinità. Inoltre è ben noto che la competizione tra farmaci o tra un farmaco e metaboliti endogeni, possa variare in maniera significativa la loro frazione libera, modificandone l’attività e la tossicità. Per queste sue proprietà la HSA può influenzare sia le proprietà farmacocinetiche che farmacodinamiche dei farmaci. Non è inusuale che un intero progetto di sviluppo di un farmaco possa venire abbandonato a causa di un’affinità troppo elevata alla HSA, o a un tempo di emivita troppo corto, o a una scarsa distribuzione dovuta ad un debole legame alla HSA. Dal punto di vista farmacocinetico, quindi, la HSA è la proteina di trasporto del plasma più importante. Un gran numero di pubblicazioni dimostra l’affidabilità della tecnica biocromatografica nello studio dei fenomeni di bioriconoscimento tra proteine e piccole molecole [2-6]. Il mio lavoro si è focalizzato principalmente sull’uso della biocromatografia come metodo per valutare le caratteristiche di legame di alcune serie di composti di interesse farmaceutico alla HSA, e sul miglioramento di tale tecnica. Per ottenere una miglior comprensione dei meccanismi di legame delle molecole studiate, gli stessi sistemi farmaco-HSA sono stati studiati anche con il dicroismo circolare (CD). Inizialmente, la HSA è stata immobilizzata su una colonna di silice epossidica impaccata 50 x 4.6 mm di diametro interno, utilizzando una procedura precedentemente riportata in letteratura [7], con alcune piccole modifiche. In breve, l’immobilizzazione è stata effettuata ponendo a ricircolo, attraverso una colonna precedentemente impaccata, una soluzione di HSA in determinate condizioni di pH e forza ionica. La colonna è stata quindi caratterizzata per quanto riguarda la quantità di proteina correttamente immobilizzata, attraverso l’analisi frontale di L-triptofano [8]. Di seguito, sono stati iniettati in colonna alcune soluzioni raceme di molecole note legare la HSA in maniera enantioselettiva, per controllare che la procedura di immobilizzazione non avesse modificato le proprietà di legame della proteina. Dopo essere stata caratterizzata, la colonna è stata utilizzata per determinare la percentuale di legame di una piccola serie di inibitori della proteasi HIV (IPs), e per individuarne il sito(i) di legame. La percentuale di legame è stata calcolata attraverso il fattore di capacità (k) dei campioni. Questo parametro in fase acquosa è stato estrapolato linearmente dal grafico log k contro la percentuale (v/v) di 1-propanolo presente nella fase mobile. Solamente per due dei cinque composti analizzati è stato possibile misurare direttamente il valore di k in assenza di solvente organico. Tutti gli IPs analizzati hanno mostrato un’elevata percentuale di legame alla HSA: in particolare, il valore per ritonavir, lopinavir e saquinavir è risultato maggiore del 95%. Questi risultati sono in accordo con dati presenti in letteratura, ottenuti attraverso il biosensore ottico [9]. Inoltre, questi risultati sono coerenti con la significativa riduzione di attività inibitoria di questi composti osservata in presenza di HSA. Questa riduzione sembra essere maggiore per i composti che legano maggiormente la proteina [10]. Successivamente sono stati eseguiti degli studi di competizione tramite cromatografia zonale. Questo metodo prevede di utilizzare una soluzione a concentrazione nota di un competitore come fase mobile, mentre piccole quantità di analita vengono iniettate nella colonna funzionalizzata con HSA. I competitori sono stati selezionati in base al loro legame selettivo ad uno dei principali siti di legame sulla proteina. In particolare, sono stati utilizzati salicilato di sodio, ibuprofene e valproato di sodio come marker dei siti I, II e sito della bilirubina, rispettivamente. Questi studi hanno mostrato un legame indipendente dei PIs ai siti I e II, mentre è stata osservata una debole anticooperatività per il sito della bilirubina. Lo stesso sistema farmaco-proteina è stato infine investigato in soluzione attraverso l’uso del dicroismo circolare. In particolare, è stato monitorata la variazione del segnale CD indotto di un complesso equimolare [HSA]/[bilirubina], a seguito dell’aggiunta di aliquote di ritonavir, scelto come rappresentante della serie. I risultati confermano la lieve anticooperatività per il sito della bilirubina osservato precedentemente negli studi biocromatografici. Successivamente, lo stesso protocollo descritto precedentemente è stato applicato a una colonna di silice epossidica monolitica 50 x 4.6 mm, per valutare l’affidabilità del supporto monolitico per applicazioni biocromatografiche. Il supporto monolitico monolitico ha mostrato buone caratteristiche cromatografiche in termini di contropressione, efficienza e stabilità, oltre che affidabilità nella determinazione dei parametri di legame alla HSA. Questa colonna è stata utilizzata per la determinazione della percentuale di legame alla HSA di una serie di poliamminochinoni sviluppati nell’ambito di una ricerca sulla malattia di Alzheimer. Tutti i composti hanno mostrato una percentuale di legame superiore al 95%. Inoltre, è stata osservata una correlazione tra percentuale di legame è caratteristiche della catena laterale (lunghezza e numero di gruppi amminici). Successivamente sono stati effettuati studi di competizione dei composti in esame tramite il dicroismo circolare in cui è stato evidenziato un effetto anticooperativo dei poliamminochinoni ai siti I e II, mentre rispetto al sito della bilirubina il legame si è dimostrato indipendente. Le conoscenze acquisite con il supporto monolitico precedentemente descritto, sono state applicate a una colonna di silice epossidica più corta (10 x 4.6 mm). Il metodo di determinazione della percentuale di legame utilizzato negli studi precedenti si basa su dati ottenuti con più esperimenti, quindi è necessario molto tempo prima di ottenere il dato finale. L’uso di una colonna più corta permette di ridurre i tempi di ritenzione degli analiti, per cui la determinazione della percentuale di legame alla HSA diventa molto più rapida. Si passa quindi da una analisi a medio rendimento a una analisi di screening ad alto rendimento (highthroughput- screening, HTS). Inoltre, la riduzione dei tempi di analisi, permette di evitare l’uso di soventi organici nella fase mobile. Dopo aver caratterizzato la colonna da 10 mm con lo stesso metodo precedentemente descritto per le altre colonne, sono stati iniettati una serie di standard variando il flusso della fase mobile, per valutare la possibilità di utilizzare flussi elevati. La colonna è stata quindi impiegata per stimare la percentuale di legame di una serie di molecole con differenti caratteristiche chimiche. Successivamente è stata valutata la possibilità di utilizzare una colonna così corta, anche per studi di competizione, ed è stata indagato il legame di una serie di composti al sito I. Infine è stata effettuata una valutazione della stabilità della colonna in seguito ad un uso estensivo. L’uso di supporti cromatografici funzionalizzati con albumine di diversa origine (ratto, cane, guinea pig, hamster, topo, coniglio), può essere proposto come applicazione futura di queste colonne HTS. Infatti, la possibilità di ottenere informazioni del legame dei farmaci in via di sviluppo alle diverse albumine, permetterebbe un migliore paragone tra i dati ottenuti tramite esperimenti in vitro e i dati ottenuti con esperimenti sull’animale, facilitando la successiva estrapolazione all’uomo, con la velocità di un metodo HTS. Inoltre, verrebbe ridotto anche il numero di animali utilizzati nelle sperimentazioni. Alcuni lavori presenti in letteratura dimostrano l’affidabilita di colonne funzionalizzate con albumine di diversa origine [11-13]: l’utilizzo di colonne più corte potrebbe aumentarne le applicazioni.

Specification and Verification of Declarative Open Interaction Models - A Logic-based framework

The advent of distributed and heterogeneous systems has laid the foundation for the birth of new architectural paradigms, in which many separated and autonomous entities collaborate and interact to the aim of achieving complex strategic goals, impossible to be accomplished on their own. A non exhaustive list of systems targeted by such paradigms includes Business Process Management, Clinical Guidelines and Careflow Protocols, Service-Oriented and Multi-Agent Systems. It is largely recognized that engineering these systems requires novel modeling techniques. In particular, many authors are claiming that an open, declarative perspective is needed to complement the closed, procedural nature of the state of the art specification languages. For example, the ConDec language has been recently proposed to target the declarative and open specification of Business Processes, overcoming the over-specification and over-constraining issues of classical procedural approaches. On the one hand, the success of such novel modeling languages strongly depends on their usability by non-IT savvy: they must provide an appealing, intuitive graphical front-end. On the other hand, they must be prone to verification, in order to guarantee the trustworthiness and reliability of the developed model, as well as to ensure that the actual executions of the system effectively comply with it. In this dissertation, we claim that Computational Logic is a suitable framework for dealing with the specification, verification, execution, monitoring and analysis of these systems. We propose to adopt an extended version of the ConDec language for specifying interaction models with a declarative, open flavor. We show how all the (extended) ConDec constructs can be automatically translated to the CLIMB Computational Logic-based language, and illustrate how its corresponding reasoning techniques can be successfully exploited to provide support and verification capabilities along the whole life cycle of the targeted systems.

Self-organising coordination systems

Many research fields are pushing the engineering of large-scale, mobile, and open systems towards the adoption of techniques inspired by self-organisation: pervasive computing, but also distributed artificial intelligence, multi-agent systems, social networks, peer-topeer and grid architectures exploit adaptive techniques to make global system properties emerge in spite of the unpredictability of interactions and behaviour. Such a trend is visible also in coordination models and languages, whenever a coordination infrastructure needs to cope with managing interactions in highly dynamic and unpredictable environments. As a consequence, self-organisation can be regarded as a feasible metaphor to define a radically new conceptual coordination framework. The resulting framework defines a novel coordination paradigm, called self-organising coordination, based on the idea of spreading coordination media over the network, and charge them with services to manage interactions based on local criteria, resulting in the emergence of desired and fruitful global coordination properties of the system. Features like topology, locality, time-reactiveness, and stochastic behaviour play a key role in both the definition of such a conceptual framework and the consequent development of self-organising coordination services. According to this framework, the thesis presents several self-organising coordination techniques developed during the PhD course, mainly concerning data distribution in tuplespace-based coordination systems. Some of these techniques have been also implemented in ReSpecT, a coordination language for tuple spaces, based on logic tuples and reactions to events occurring in a tuple space. In addition, the key role played by simulation and formal verification has been investigated, leading to analysing how automatic verification techniques like probabilistic model checking can be exploited in order to formally prove the emergence of desired behaviours when dealing with coordination approaches based on self-organisation. To this end, a concrete case study is presented and discussed.

Designing and Programming Organizational Infrastructures for Agents situated in Artifact-based Environments

Actual trends in software development are pushing the need to face a multiplicity of diverse activities and interaction styles characterizing complex and distributed application domains, in such a way that the resulting dynamics exhibits some grade of order, i.e. in terms of evolution of the system and desired equilibrium. Autonomous agents and Multiagent Systems are argued in literature as one of the most immediate approaches for describing such a kind of challenges. Actually, agent research seems to converge towards the definition of renewed abstraction tools aimed at better capturing the new demands of open systems. Besides agents, which are assumed as autonomous entities purposing a series of design objectives, Multiagent Systems account new notions as first-class entities, aimed, above all, at modeling institutional/organizational entities, placed for normative regulation, interaction and teamwork management, as well as environmental entities, placed as resources to further support and regulate agent work. The starting point of this thesis is recognizing that both organizations and environments can be rooted in a unifying perspective. Whereas recent research in agent systems seems to account a set of diverse approaches to specifically face with at least one aspect within the above mentioned, this work aims at proposing a unifying approach where both agents and their organizations can be straightforwardly situated in properly designed working environments. In this line, this work pursues reconciliation of environments with sociality, social interaction with environment based interaction, environmental resources with organizational functionalities with the aim to smoothly integrate the various aspects of complex and situated organizations in a coherent programming approach. Rooted in Agents and Artifacts (A&A) meta-model, which has been recently introduced both in the context of agent oriented software engineering and programming, the thesis promotes the notion of Embodied Organizations, characterized by computational infrastructures attaining a seamless integration between agents, organizations and environmental entities.

Sicurezza di rete, analisi del traffico e monitoraggio.

Il lavoro è stato suddiviso in tre macro-aree. Una prima riguardante un'analisi teorica di come funzionano le intrusioni, di quali software vengono utilizzati per compierle, e di come proteggersi (usando i dispositivi che in termine generico si possono riconoscere come i firewall). Una seconda macro-area che analizza un'intrusione avvenuta dall'esterno verso dei server sensibili di una rete LAN. Questa analisi viene condotta sui file catturati dalle due interfacce di rete configurate in modalità promiscua su una sonda presente nella LAN. Le interfacce sono due per potersi interfacciare a due segmenti di LAN aventi due maschere di sotto-rete differenti. L'attacco viene analizzato mediante vari software. Si può infatti definire una terza parte del lavoro, la parte dove vengono analizzati i file catturati dalle due interfacce con i software che prima si occupano di analizzare i dati di contenuto completo, come Wireshark, poi dei software che si occupano di analizzare i dati di sessione che sono stati trattati con Argus, e infine i dati di tipo statistico che sono stati trattati con Ntop. Il penultimo capitolo, quello prima delle conclusioni, invece tratta l'installazione di Nagios, e la sua configurazione per il monitoraggio attraverso plugin dello spazio di disco rimanente su una macchina agent remota, e sui servizi MySql e DNS. Ovviamente Nagios può essere configurato per monitorare ogni tipo di servizio offerto sulla rete.

Multi-level models and infrastructures for simulating biological system development

The hierarchical organisation of biological systems plays a crucial role in the pattern formation of gene expression resulting from the morphogenetic processes, where autonomous internal dynamics of cells, as well as cell-to-cell interactions through membranes, are responsible for the emergent peculiar structures of the individual phenotype. Being able to reproduce the systems dynamics at different levels of such a hierarchy might be very useful for studying such a complex phenomenon of self-organisation. The idea is to model the phenomenon in terms of a large and dynamic network of compartments, where the interplay between inter-compartment and intra-compartment events determines the emergent behaviour resulting in the formation of spatial patterns. According to these premises the thesis proposes a review of the different approaches already developed in modelling developmental biology problems, as well as the main models and infrastructures available in literature for modelling biological systems, analysing their capabilities in tackling multi-compartment / multi-level models. The thesis then introduces a practical framework, MS-BioNET, for modelling and simulating these scenarios exploiting the potential of multi-level dynamics. This is based on (i) a computational model featuring networks of compartments and an enhanced model of chemical reaction addressing molecule transfer, (ii) a logic-oriented language to flexibly specify complex simulation scenarios, and (iii) a simulation engine based on the many-species/many-channels optimised version of Gillespie’s direct method. The thesis finally proposes the adoption of the agent-based model as an approach capable of capture multi-level dynamics. To overcome the problem of parameter tuning in the model, the simulators are supplied with a module for parameter optimisation. The task is defined as an optimisation problem over the parameter space in which the objective function to be minimised is the distance between the output of the simulator and a target one. The problem is tackled with a metaheuristic algorithm. As an example of application of the MS-BioNET framework and of the agent-based model, a model of the first stages of Drosophila Melanogaster development is realised. The model goal is to generate the early spatial pattern of gap gene expression. The correctness of the models is shown comparing the simulation results with real data of gene expression with spatial and temporal resolution, acquired in free on-line sources.

Reverse genetic studies of Benyvirus - Polymyxa betae molecular interaction: Role of the RNA4-encoded protein in virus transmission

Beet necrotic yellow vein virus (BNYVV), the leading infectious agent that affects sugar beet, is included within viruses transmitted through the soil from plasmodiophorid as Polymyxa betae. BNYVV is the causal agent of Rhizomania, which induces abnormal rootlet proliferation and is widespread in the sugar beet growing areas in Europe, Asia and America; for review see (Peltier et al., 2008). In this latter continent, Beet soil-borne mosaic virus (BSBMV) has been identified (Lee et al., 2001) and belongs to the benyvirus genus together with BNYVV, both vectored by P. betae. BSBMV is widely distributed only in the United States and it has not been reported yet in others countries. It was first identified in Texas as a sugar beet virus morphologically similar but serologically distinct to BNYVV. Subsequent sequence analysis of BSBMV RNAs evidenced similar genomic organization to that of BNYVV but sufficient molecular differences to distinct BSBMV and BNYVV in two different species (Rush et al., 2003). Benyviruses field isolates usually consist of four RNA species but some BNYVV isolates contain a fifth RNA. RNAs -1 contains a single long ORF encoding polypeptide that shares amino acid homology with known viral RNA-dependent RNA polymerases (RdRp) and helicases. RNAs -2 contains six ORFs: capsid protein (CP), one readthrough protein, triple gene block proteins (TGB) that are required for cell-to-cell virus movement and the sixth 14 kDa ORF is a post-translation gene silencing suppressor. RNAs -3 is involved on disease symptoms and is essential for virus systemic movement. BSBMV RNA-3 can be trans-replicated, trans-encapsidated by the BNYVV helper strain (RNA-1 and -2) (Ratti et al., 2009). BNYVV RNA-4 encoded one 31 kDa protein and is essential for vector interactions and virus transmission by P. betae (Rahim et al., 2007). BNYVV RNA-5 encoded 26 kDa protein that improve virus infections and accumulation in the hosts. We are interest on BSBMV effect on Rhizomania studies using powerful tools as full-length infectious cDNA clones. B-type full-length infectious cDNA clones are available (Quillet et al., 1989) as well as A/P-type RNA-3, -4 and -5 from BNYVV (unpublished). A-type BNYVV full-length clones are also available, but RNA-1 cDNA clone still need to be modified. During the PhD program, we start production of BSBMV full-length cDNA clones and we investigate molecular interactions between plant and Benyviruses exploiting biological, epidemiological and molecular similarities/divergences between BSBMV and BNYVV. During my PhD researchrs we obtained full length infectious cDNA clones of BSBMV RNA-1 and -2 and we demonstrate that they transcripts are replicated and packaged in planta and able to substitute BNYVV RNA-1 or RNA-2 in a chimeric viral progeny (BSBMV RNA-1 + BNYVV RNA-2 or BNYVV RNA-1 + BSBMV RNA-2). During BSBMV full-length cDNA clones production, unexpected 1,730 nts long form of BSBMV RNA-4 has been detected from sugar beet roots grown on BSBMV infected soil. Sequence analysis of the new BSBMV RNA-4 form revealed high identity (~100%) with published version of BSBMV RNA-4 sequence (NC_003508) between nucleotides 1-608 and 1,138-1,730, however the new form shows 528 additionally nucleotides between positions 608-1,138 (FJ424610). Two putative ORFs has been identified, the first one (nucleotides 383 to 1,234), encode a protein with predicted mass of 32 kDa (p32) and the second one (nucleotides 885 to 1,244) express an expected product of 13 kDa (p13). As for BSBMV RNA-3 (Ratti et al., 2009), full-length BSBMV RNA-4 cDNA clone permitted to obtain infectious transcripts that BNYVV viral machinery (Stras12) is able to replicate and to encapsidate in planta. Moreover, we demonstrated that BSBMV RNA-4 can substitute BNYVV RNA-4 for an efficient transmission through the vector P. betae in Beta vulgaris plants, demonstrating a very high correlation between BNYVV and BSBMV. At the same time, using BNYVV helper strain, we studied BSBMV RNA-4’s protein expression in planta. We associated a local necrotic lesions phenotype to the p32 protein expression onto mechanically inoculated C. quinoa. Flag or GFP-tagged sequences of p32 and p13 have been expressed in viral context, using Rep3 replicons, based on BNYVV RNA-3. Western blot analyses of local lesions contents, using FLAG-specific antibody, revealed a high molecular weight protein, which suggest either a strong interaction of BSBMV RNA4’s protein with host protein(s) or post translational modifications. GFP-fusion sequences permitted the subcellular localization of BSBMV RNA4’s proteins. Moreover we demonstrated the absence of self-activation domains on p32 by yeast two hybrid system approaches. We also confirmed that p32 protein is essential for virus transmission by P. betae using BNYVV helper strain and BNYVV RNA-3 and we investigated its role by the use of different deleted forms of p32 protein. Serial mechanical inoculation of wild-type BSBMV on C. quinoa plants were performed every 7 days. Deleted form of BSBMV RNA-4 (1298 bp) appeared after 14 passages and its sequence analysis shows deletion of 433 nucleotides between positions 611 and 1044 of RNA-4 new form. We demonstrated that this deleted form can’t support transmission by P. betae using BNYVV helper strain and BNYVV RNA-3, moreover we confirmed our hypothesis that BSBMV RNA-4 described by Lee et al. (2001) is a deleted form. Interesting after 21 passages we identifed one chimeric form of BSBMV RNA-4 and BSBMV RNA-3 (1146 bp). Two putative ORFs has been identified on its sequence, the first one (nucleotides 383 to 562), encode a protein with predicted mass of 7 kDa (p7), corresponding to the N-terminal of p32 protein encoded by BSBMV RNA-4; the second one (nucleotides 562 to 789) express an expected product of 9 kDa (p9) corresponding to the C-terminal of p29 encoded by BSBMV RNA-3. Results obtained by our research in this topic opened new research lines that our laboratories will develop in a closely future. In particular BSBMV p32 and its mutated forms will be used to identify factors, as host or vector protein(s), involved in the virus transmission through P. betae. The new results could allow selection or production of sugar beet plants able to prevent virus transmission then able to reduce viral inoculum in the soil.

Study of Italian isolates of Alternaria spp.: molecular and morphological characterization and pathogenesis on apple tree

It was decided to carry out a morphological and molecular characterization of the Italian Alternaria isolatescollected from apple , and evaluate their pathogenicity and subsequently combining the data collected. The strain collection (174 isolates) was constructed by collecting material (received from extension service personnel) between June and August of 2007, 2008, and 2009. A Preliminary bioassays were performed on detached plant materials (fruit and leaf wounded and unwounded), belonging to the Golden cultivar, with two different kind of inoculation (conidial suspension and conidial filtrate). Symptoms were monitored daily and a value of pathogenicity score (P.S.) was assigned on the basis of the diameter of the necrotic area that developed. On the basis of the bioassays, the number of isolates to undergo further molecular analysis was restricted to a representative set of single spore strains (44 strains). Morphological characteristics of the colony and sporulation pattern were determined according to previous systematic work on small-spored Alternaria spp. (Pryor and Michaelides, 2002 and Hong et al., 2006). Reference strains (Alternaria alternata, Alternaria tenuissima, Alternaria arborescens and four Japanese strains of Alternaria alternata mali pathotype), used in the study were kindly provided by Prof. Barry Pryor, who allows a open access to his own fungal collection. Molecular characterization was performed combining and comparing different data sets obtained from distinct molecular approach: 1) investigation of specific loci and 2) fingerprinting based on diverse randomly selected polymorphic sites of the genome. As concern the single locus analysis, it was chosen to sequence the EndoPG partial gene and three anonymous region (OPA1-3, OPA2- and OPa10-2). These markers has revealed a powerful tool in the latter systematic works on small-spored Alternaria spp. In fact, as reported in literature small-spored Alternaria taxonomy is complicated due to the inability to resolve evolutionary relationships among the taxa because of the lack of variability in the markers commonly used in fungi systematic. The three data set together provided the necessary variation to establish the phylogenetic relationships among the Italian isolates of Alternaria spp. On Italian strains these markers showed a variable number of informative sites (ranging from 7 for EndoPg to 85 for OPA1-3) and the parsimony analysis produced different tree topologies all concordant to define A. arborescens as a mophyletic clade. Fingerprinting analysis (nine ISSR primers and eight AFLP primers combination) led to the same result: a monophyleic A. arborescens clade and one clade containing both A. tenuissima and the A. alternata strains. This first attempt to characterize Italian Alternaria species recovered from apple produced concordant results with what was already described in a similar phylogenetic study on pistachio (Pryor and Michaelides, 2002), on walnut and hazelnut (Hong et al., 2006), apple (Kang et al., 2002) and citurus (Peever et al., 2004). Together with these studies, this research demonstrates that the three morphological groups are widely distributed and occupy similar ecological niches. Furthermore, this research suggest that these Alternaria species exhibit a similar infection pattern despite the taxonomic and pathogenic differences. The molecular characterization of the pathogens is a fundamental step to understanding the disease that is spreading in the apple orchards of the north Italy. At the beginning the causal agent was considered as Alteraria alternata (Marshall and Bertagnoll, 2006). Their preliminary studies purposed a pathogenic system related to the synthesis of toxins. Experimental data of our bioassays suggest an analogous hypothesis, considering that symptoms could be induced after inoculating plant material with solely the filtrate from pathogenic strains. Moreover, positive PCR reactions using AM-toxin gene specific primers, designed for identification of apple infecting Alternaria pathovar, led to a hypothesis that a host specific toxin (toxins) were involved. It remains an intriguing challenge to discover or not if the agent of the “Italian disease” is the same of the one previously typified as Alternaria mali, casual agent of the apple blotch disease.

Recombinant expression of molluscan hemocyanin (KLH) substructures in a prokaryotic system: E. coli

The recombinant expression of 19 different substructures of KLH in the prokaryotic sys-tem E. coli has been successfully achieved: each one of the eight single FUs a to h of both isoforms, KLH1 and KLH2, two substructures consisting of two consecutive FUs (KLH1-bc and KLH1-gh) as well as a cDNA encompassing KLH1-abc. All recombinant proteins, fused to an N-terminal 6xHis tag, have successfully been detected by immuno precipitation using monoclonal α-His-antibodies and polyclonal α-KLH1- and α-KLH2-antibodies. One exception remained: SP-KLH2-a, which was not detected by the α-His-antibodies. This allows speculations as to whether the coexpressed signal peptide can lead, at one hand, to the secretion of the recombinant protein, and on the other to the simultaneous cut-off of the leader peptide, which results in the splitting off of even more N-terminal 6xHis tag, leading to failed recognition by the appropriate antibodies. The comparison of native KLH with recombinantly expressed prokaryotic (E. coli) and eukaryotic (Sf9 insect cells) KLH was done using FU-1h. The weak detection by the polyclonal α-KLH1-antibodies of both recombinantly expressed proteins showed that the native protein was the best recognized. For the prokaryotic one, both the denaturation applied for solubilisation of the bacterial inclusion bodies and the inability of bacterial cells to add N-linked glycosylation, are the reason for the poor hybridization. In contrast, KLH1-h expressed in eukaryotic insect cells is likely to be glycosylated. The incubation with the α-KLH1-antibodies resulting in the same weak detection, however, revealed that the linked carbohydrate side chains are not those expected. The establishment of SOE-PCR, together with further improvement, has enabled the generation of a clone encompassing the complete subunit KLH1-abcdefgh. The se-quence analysis compared to the original KLH1 sequence showed, however, that the resulting recombinant protein is defective in two histidines, required for the copper bind-ing sites in FU-1b and FU-1d and in three disulfide bridges (FU-1a, FU-1b and FU 1g). This is due to polymerase-related nucleotide exchanges, resulting in a changed amino acid sequence. Nevertheless, all eight potential N-glycosylation sites are present, leading to the speculation that the recombinant protein can in theory be fully glycosylated, which is the most important aspect for the clinical applicability of recombinant KLH as an im-munotherapeutic agent. The improvement of this method elaborated during the present work indicates bright prospects for the future generation of a correct cDNA sequence encoding for the complete KLH2 subunit.

Nonlinear Control Strategies for Cooperative Control of Multi-Robot Systems

This thesis deals with distributed control strategies for cooperative control of multi-robot systems. Specifically, distributed coordination strategies are presented for groups of mobile robots. The formation control problem is initially solved exploiting artificial potential fields. The purpose of the presented formation control algorithm is to drive a group of mobile robots to create a completely arbitrarily shaped formation. Robots are initially controlled to create a regular polygon formation. A bijective coordinate transformation is then exploited to extend the scope of this strategy, to obtain arbitrarily shaped formations. For this purpose, artificial potential fields are specifically designed, and robots are driven to follow their negative gradient. Artificial potential fields are then subsequently exploited to solve the coordinated path tracking problem, thus making the robots autonomously spread along predefined paths, and move along them in a coordinated way. Formation control problem is then solved exploiting a consensus based approach. Specifically, weighted graphs are used both to define the desired formation, and to implement collision avoidance. As expected for consensus based algorithms, this control strategy is experimentally shown to be robust to the presence of communication delays. The global connectivity maintenance issue is then considered. Specifically, an estimation procedure is introduced to allow each agent to compute its own estimate of the algebraic connectivity of the communication graph, in a distributed manner. This estimate is then exploited to develop a gradient based control strategy that ensures that the communication graph remains connected, as the system evolves. The proposed control strategy is developed initially for single-integrator kinematic agents, and is then extended to Lagrangian dynamical systems.

Different addictive drug exposure induces selective alterations of the Endogenous Opioid System : modulation of transcription and epigenetic mechanisms

Drug addiction manifests clinically as compulsive drug seeking, and cravings that can persist and recur even after extended periods of abstinence. The fundamental principle that unites addictive drugs is that each one enhances synaptic DA by means that dissociate it from normal behavioral control, so that they act to reinforce their own acquisition. Our attention has focused on the study of phenomena associated with the consumption of alcohol and heroin. Alcohol has long been considered an unspecific pharmacological agent, recent molecular pharmacology studies have shown that acts on different primary targets. Through gene expression studies conducted recently it has been shown that the classical opioid receptors are differently involved in the consumption of ethanol and, furthermore, the system nociceptin / NOP, included in the family of endogenous opioid system, and both appear able to play a key role in the initiation of alcohol use in rodents. What emerges is that manipulation of the opioid system, nociceptin, may be useful in the treatment of addictions and there are several evidences that support the use of this strategy. The linkage between gene expression alterations and epigenetic modulation in PDYN and PNOC promoters following alcohol treatment confirm the possible chromatin remodeling mechanism already proposed for alcoholism. In the second part of present study, we also investigated alterations in signaling molecules directly associated with MAPK pathway in a unique collection of postmortem brains from heroin abusers. The interest was focused on understanding the effects that prolonged exposure of heroin can cause in an individual, over the entire MAPK cascade and consequently on the transcription factor ELK1, which is regulated by this pathway. We have shown that the activation of ERK1/2 resulting in Elk-1 phosphorylation in striatal neurons supporting the hypothesis that prolonged exposure to substance abuse causes a dysregulation of MAPK pathway.

Engineering Agent-Oriented Technologies and Programming Languages for Computer Programming and Software Development

Mainstream hardware is becoming parallel, heterogeneous, and distributed on every desk, every home and in every pocket. As a consequence, in the last years software is having an epochal turn toward concurrency, distribution, interaction which is pushed by the evolution of hardware architectures and the growing of network availability. This calls for introducing further abstraction layers on top of those provided by classical mainstream programming paradigms, to tackle more effectively the new complexities that developers have to face in everyday programming. A convergence it is recognizable in the mainstream toward the adoption of the actor paradigm as a mean to unite object-oriented programming and concurrency. Nevertheless, we argue that the actor paradigm can only be considered a good starting point to provide a more comprehensive response to such a fundamental and radical change in software development. Accordingly, the main objective of this thesis is to propose Agent-Oriented Programming (AOP) as a high-level general purpose programming paradigm, natural evolution of actors and objects, introducing a further level of human-inspired concepts for programming software systems, meant to simplify the design and programming of concurrent, distributed, reactive/interactive programs. To this end, in the dissertation first we construct the required background by studying the state-of-the-art of both actor-oriented and agent-oriented programming, and then we focus on the engineering of integrated programming technologies for developing agent-based systems in their classical application domains: artificial intelligence and distributed artificial intelligence. Then, we shift the perspective moving from the development of intelligent software systems, toward general purpose software development. Using the expertise maturated during the phase of background construction, we introduce a general-purpose programming language named simpAL, which founds its roots on general principles and practices of software development, and at the same time provides an agent-oriented level of abstraction for the engineering of general purpose software systems.

Coordination and Control of Autonomous Mobile Robots Swarms by using Particle Swarm Optimization Algorithm and Consensus Theory

This thesis presents some different techniques designed to drive a swarm of robots in an a-priori unknown environment in order to move the group from a starting area to a final one avoiding obstacles. The presented techniques are based on two different theories used alone or in combination: Swarm Intelligence (SI) and Graph Theory. Both theories are based on the study of interactions between different entities (also called agents or units) in Multi- Agent Systems (MAS). The first one belongs to the Artificial Intelligence context and the second one to the Distributed Systems context. These theories, each one from its own point of view, exploit the emergent behaviour that comes from the interactive work of the entities, in order to achieve a common goal. The features of flexibility and adaptability of the swarm have been exploited with the aim to overcome and to minimize difficulties and problems that can affect one or more units of the group, having minimal impact to the whole group and to the common main target. Another aim of this work is to show the importance of the information shared between the units of the group, such as the communication topology, because it helps to maintain the environmental information, detected by each single agent, updated among the swarm. Swarm Intelligence has been applied to the presented technique, through the Particle Swarm Optimization algorithm (PSO), taking advantage of its features as a navigation system. The Graph Theory has been applied by exploiting Consensus and the application of the agreement protocol with the aim to maintain the units in a desired and controlled formation. This approach has been followed in order to conserve the power of PSO and to control part of its random behaviour with a distributed control algorithm like Consensus.