Parallel modeling of the electric field distribution in the brain

The term "Brain Imaging" identi�es a set of techniques to analyze the structure and/or functional behavior of the brain in normal and/or pathological situations. These techniques are largely used in the study of brain activity. In addition to clinical usage, analysis of brain activity is gaining popularity in others recent �fields, i.e. Brain Computer Interfaces (BCI) and the study of cognitive processes. In this context, usage of classical solutions (e.g. f MRI, PET-CT) could be unfeasible, due to their low temporal resolution, high cost and limited portability. For these reasons alternative low cost techniques are object of research, typically based on simple recording hardware and on intensive data elaboration process. Typical examples are ElectroEncephaloGraphy (EEG) and Electrical Impedance Tomography (EIT), where electric potential at the patient's scalp is recorded by high impedance electrodes. In EEG potentials are directly generated from neuronal activity, while in EIT by the injection of small currents at the scalp. To retrieve meaningful insights on brain activity from measurements, EIT and EEG relies on detailed knowledge of the underlying electrical properties of the body. This is obtained from numerical models of the electric �field distribution therein. The inhomogeneous and anisotropic electric properties of human tissues make accurate modeling and simulation very challenging, leading to a tradeo�ff between physical accuracy and technical feasibility, which currently severely limits the capabilities of these techniques. Moreover elaboration of data recorded requires usage of regularization techniques computationally intensive, which influences the application with heavy temporal constraints (such as BCI). This work focuses on the parallel implementation of a work-flow for EEG and EIT data processing. The resulting software is accelerated using multi-core GPUs, in order to provide solution in reasonable times and address requirements of real-time BCI systems, without over-simplifying the complexity and accuracy of the head models.

Singularity-Free Fully-Isotropic Translational Parallel Manipulators

Parallel mechanisms show desirable characteristics such as a large payload to robot weight ratio, considerable stiffness, low inertia and high dynamic performances. In particular, parallel manipulators with fewer than six degrees of freedom have recently attracted researchers’ attention, as their employ may prove valuable in those applications in which a higher mobility is uncalled-for. The attention of this dissertation is focused on translational parallel manipulators (TPMs), that is on parallel manipulators whose output link (platform) is provided with a pure translational motion with respect to the frame. The first part deals with the general problem of the topological synthesis and classification of TPMs, that is it identifies the architectures that TPM legs must possess for the platform to be able to freely translate in space without altering its orientation. The second part studies both constraint and direct singularities of TPMs. In particular, special families of fully-isotropic mechanisms are identified. Such manipulators exhibit outstanding properties, as they are free from singularities and show a constant orthogonal Jacobian matrix throughout their workspace. As a consequence, both the direct and the inverse position problems are linear and the kinematic analysis proves straightforward.

mRNAs translation and tumorigenesis

Translational control has a direct impact on cancer development and progression. Quantitative and qualitative changes of cap-dependent translation initiation contribute to neoplastic transformation and progression. However, the idea that “alternative” mechanisms of translation initiation, such as IRES-dependent translation, can be involved in the tumorigenesis is emerging. Because the relevance of this kind of translation initiation in cancer progression is not so well clarified, the purpose of my work was to study the impact of IRES-dependent mRNA translation on tumourigenesis and cancer progression with particular regard for breast cancer. The data obtained clarify the function of cap-independent translation in cancer. Particularly they suggested that the deregulation of IRES-dependent translation can be considered a sort of pro-oncogenic stimulus characterized by the inhibition of the expression of some proteins that block cell growth and proliferation and by the over expression of other proteins that contributed to cell survival. In addition, under stress condition, such as a hypoxia, in immortalized epithelial cell lines, changes in cap-independent translation are associated with an induction of expression of stem cell markers, and with the selection of a sub group of cells that have an increased ability to self-renewing and therefore in the acquisition of a more aggressive phenotype.

The central role of Fyn kinase in axon-glial signalling and translation of myelin proteins

During central nervous system myelination, oligodendrocytes extend membrane processes towards an axonal contact site which is followed by ensheathment resulting in a compacted multilamellar myelin sheath. The formation of this axon-glial unit facilitates rapid saltatory propagation of action potentials along the axon and requires the synthesis and transport of copious amounts of lipids and proteins to the axon-glial contact site. Fyn is a member of the Src family of non receptor tyrosine kinases and inserted into the inner leaflet of the oligodendrocyte membrane by acylation. Fyn activity plays a pivotal role in the maturation of oligodendrocytes and the myelination process. It was suggested previously that Fyn kinase can be stimulated by binding of a neuronal ligand to oligodendroglial F3/ contactin, a glycosyl-phosphatidyl-inositol anchored immunoglobulin superfamily (IgSF) member protein. It could be shown here, that neuronal cell adhesion molecule L1 binds to oligodendrocytes in an F3-dependent manner and activates glial Fyn. In the search for downstream participants of this novel axon-glial signalling cascade, heterogeneous nuclear ribonucleoprotein (hnRNP) A2 was identified as a novel Fyn target in oligodendrocytes. HnRNP A2 was known to be involved in the localisation of translationally repressed myelin basic protein (MBP) mRNA by binding to a cis acting A2 response element (A2RE) present in the 3’ untranslated region. Transport of MBP mRNAs occurs in RNA-protein complexes termed RNA granules and translational repression during transport is achieved by hnRNP A2-mediated recruitment of hnRNP E1 to the granules. It could be shown here, that Fyn activity leads to enhanced translation of reporter mRNA containing a part of the 3’ UTR of MBP including the A2RE. Furthermore hnRNP E1 seems to dissociate from RNA granules in response to Fyn activity and L1 binding. These findings suggest a novel form of neuron- glial communication: Axonal L1 binding to oligodendroglial F3 activates Fyn kinase. Activated Fyn phosphorylates hnRNP A2 leading to removal of hnRNP E1 from RNA granules initiating the translation of MBP mRNA. MBP is the second most abundant myelin protein and mice lacking this protein show a severe hypomyelination phenotype. Moreover, the brains of Fyn knock out mice contain reduced MBP levels and are hypomyelinated. Hence, L1-mediated MBP synthesis via Fyn as a central molecule could be part of a regulatory mechanism required for myelinogenesis in the central nervous system.

Luis Cernuda: la realizzazione del desiderio

Le traduzioni di Luis Cernuda, poeta spagnolo della Generazione del '27, da testi poetici di autori francesi, tedeschi ed inglesi, la cui scelta è dettata da ragioni di coerenza artistica, non hanno valore secondario rispetto alla produzione poetica autoriale. Nel presente studio si delinea l'uniformità del percorso creativo di Luis Cernuda nel ruolo duplice ed apparentemente contraddittorio di poeta-traduttore, attraverso un tracciato spazio-temporale, al contempo realistico e metaforico, che si svolge lungo gran parte della vita del misconosciuto poeta sivigliano. Ad una preliminare presentazione analitica del concetto di traduzione, della funzione che la stessa riveste nel genere letterario specifico della poesia e nell'attività creativa di Cernuda, segue l'analisi comparativa delle traduzioni cernudiane con le rispettive fonti straniere. L'argomento si svolge in tre capitoli successivi, organizzati rispettando lo svolgimento cronologico del percorso traduttorio cernudiano, svolto in parallelo alla produzione poetica personale. Il secondo capitolo verte sulla traduzione da testi poetici in francese. Il terzo capitolo, sul periodo immediatamente successivo agli anni della sperimentazione francese, analizza lo studio della poesia tedesca e della sperimentazione in traduzione. Tale incontro si propone anche come momento di scissione definitiva dalla lirica romanza, piuttosto esornativa, e di accostamento alla più essenziale lirica germanica. Il quarto capitolo raccoglie le versioni poetiche da autori inglesi, che si contraddistinguono per la grande somiglianza alla poesia di Cernuda nelle scelte contenutistico-formali. Le conclusioni vertono sulla coesione perseguita nel tradurre, per cui contenuto e forma acquisiscono pari importanza nella “ricreazione poetica” realizzata da Cernuda.

A parallel community detection algorithm

Complex networks analysis is a very popular topic in computer science. Unfortunately this networks, extracted from different contexts, are usually very large and the analysis may be very complicated: computation of metrics on these structures could be very complex. Among all metrics we analyse the extraction of subnetworks called communities: they are groups of nodes that probably play the same role within the whole structure. Communities extraction is an interesting operation in many different fields (biology, economics,...). In this work we present a parallel community detection algorithm that can operate on networks with huge number of nodes and edges. After an introduction to graph theory and high performance computing, we will explain our design strategies and our implementation. Then, we will show some performance evaluation made on a distributed memory architectures i.e. the supercomputer IBM-BlueGene/Q "Fermi" at the CINECA supercomputing center, Italy, and we will comment our results.

Inverse Static Analysis of Massive Parallel Arrays of Three-State Actuators via Artificial Intelligence

Massive parallel robots (MPRs) driven by discrete actuators are force regulated robots that undergo continuous motions despite being commanded through a finite number of states only. Designing a real-time control of such systems requires fast and efficient methods for solving their inverse static analysis (ISA), which is a challenging problem and the subject of this thesis. In particular, five Artificial intelligence methods are proposed to investigate the on-line computation and the generalization error of ISA problem of a class of MPRs featuring three-state force actuators and one degree of revolute motion.

Frammenti di Erodoto: Problemi e metodi nello studio della storiografia frammentaria

Il percorso sui Frammenti di Erodoto è cronologico. L'introduzione presenta criteri di lavoro, un esempio di studio sul Proemio delle Storie e la struttura generale. Per ogni momento è preso in considerazione un fenomeno particolare con un esempio. Il primo caso è contemporaneo ad Erodoto. Si tratta di un test che riguarda la criticità di alcuni concetti chiave tradizionali: intertestualità e riferimenti letterali. Il secondo capitolo è uno studio sulla storiografica di IV secolo a.C., periodo di fioritura e determinazione delle norme del genere. Qui si mettono in luce la criticità dei frammenti multipli aprendo in questo modo ampie possibilità di ricerca. Il capitolo successivo, sulla tradizione papiracea mostra il passaggio storico tra la tradizione indiretta a la tradizione manoscritta e permette uno sguardo all'epoca alessandrina. Include un catalogo ed alcuni aggiornamenti. Il capitolo quinto pone invece problemi tradizionali di trasmissione delle tradizioni storiche affrontando lo studio di FGrHist 104, testo che permette di osservare passaggi della storiografia di quinto e quarto secolo avanti Cristo. I due capitoli sulle immagini e sul Rinascimento, paralleli per quanto riguarda i riferimenti cronologici, offrono un ponte per passare dal discorso storiografico a quello in cui la consapevolezza di Erodoto è già maturata come parte della ”cultura”. Alto Medioevo, Umanesimo e Rinascimento offrono spazio a storie delle Storie che iniziano ad essere quasi di ricezione di Erodoto. Questo tema è l'oggetto dei due capitoli finali, studi legati alla presenza o assenza di Erodoto in discipline e pensieri moderni e contemporanei: il pensiero di genere e l’analisi conversazionale. Le appendici completano soprattutto il capitolo su Aristodemo con uno studio sul codice che lo trasmette, il papiro P.Oxy 2469 e il testo stesso, con traduzione e commento storico. Il lavoro si completa con una premessa, una bibliografia strutturata e indici di persone e passi citati.

Parallel Architectures for Many-Core Systems-On-Chip in Deep Sub-Micron Technology

Despite the several issues faced in the past, the evolutionary trend of silicon has kept its constant pace. Today an ever increasing number of cores is integrated onto the same die. Unfortunately, the extraordinary performance achievable by the many-core paradigm is limited by several factors. Memory bandwidth limitation, combined with inefficient synchronization mechanisms, can severely overcome the potential computation capabilities. Moreover, the huge HW/SW design space requires accurate and flexible tools to perform architectural explorations and validation of design choices. In this thesis we focus on the aforementioned aspects: a flexible and accurate Virtual Platform has been developed, targeting a reference many-core architecture. Such tool has been used to perform architectural explorations, focusing on instruction caching architecture and hybrid HW/SW synchronization mechanism. Beside architectural implications, another issue of embedded systems is considered: energy efficiency. Near Threshold Computing is a key research area in the Ultra-Low-Power domain, as it promises a tenfold improvement in energy efficiency compared to super-threshold operation and it mitigates thermal bottlenecks. The physical implications of modern deep sub-micron technology are severely limiting performance and reliability of modern designs. Reliability becomes a major obstacle when operating in NTC, especially memory operation becomes unreliable and can compromise system correctness. In the present work a novel hybrid memory architecture is devised to overcome reliability issues and at the same time improve energy efficiency by means of aggressive voltage scaling when allowed by workload requirements. Variability is another great drawback of near-threshold operation. The greatly increased sensitivity to threshold voltage variations in today a major concern for electronic devices. We introduce a variation-tolerant extension of the baseline many-core architecture. By means of micro-architectural knobs and a lightweight runtime control unit, the baseline architecture becomes dynamically tolerant to variations.

Displacement Analysis of Under-Constrained Cable-Driven Parallel Robots

This dissertation studies the geometric static problem of under-constrained cable-driven parallel robots (CDPRs) supported by n cables, with n ≤ 6. The task consists of determining the overall robot configuration when a set of n variables is assigned. When variables relating to the platform posture are assigned, an inverse geometric static problem (IGP) must be solved; whereas, when cable lengths are given, a direct geometric static problem (DGP) must be considered. Both problems are challenging, as the robot continues to preserve some degrees of freedom even after n variables are assigned, with the final configuration determined by the applied forces. Hence, kinematics and statics are coupled and must be resolved simultaneously. In this dissertation, a general methodology is presented for modelling the aforementioned scenario with a set of algebraic equations. An elimination procedure is provided, aimed at solving the governing equations analytically and obtaining a least-degree univariate polynomial in the corresponding ideal for any value of n. Although an analytical procedure based on elimination is important from a mathematical point of view, providing an upper bound on the number of solutions in the complex field, it is not practical to compute these solutions as it would be very time-consuming. Thus, for the efficient computation of the solution set, a numerical procedure based on homotopy continuation is implemented. A continuation algorithm is also applied to find a set of robot parameters with the maximum number of real assembly modes for a given DGP. Finally, the end-effector pose depends on the applied load and may change due to external disturbances. An investigation into equilibrium stability is therefore performed.

Efficient parallel proximity queries and an application to highly complex motion planning problems with many narrow passages

In vielen Bereichen der industriellen Fertigung, wie zum Beispiel in der Automobilindustrie, wer- den digitale Versuchsmodelle (sog. digital mock-ups) eingesetzt, um die Entwicklung komplexer Maschinen m ̈oglichst gut durch Computersysteme unterstu ̈tzen zu k ̈onnen. Hierbei spielen Be- wegungsplanungsalgorithmen eine wichtige Rolle, um zu gew ̈ahrleisten, dass diese digitalen Pro- totypen auch kollisionsfrei zusammengesetzt werden k ̈onnen. In den letzten Jahrzehnten haben sich hier sampling-basierte Verfahren besonders bew ̈ahrt. Diese erzeugen eine große Anzahl von zuf ̈alligen Lagen fu ̈r das ein-/auszubauende Objekt und verwenden einen Kollisionserken- nungsmechanismus, um die einzelnen Lagen auf Gu ̈ltigkeit zu u ̈berpru ̈fen. Daher spielt die Kollisionserkennung eine wesentliche Rolle beim Design effizienter Bewegungsplanungsalgorith- men. Eine Schwierigkeit fu ̈r diese Klasse von Planern stellen sogenannte “narrow passages” dar, schmale Passagen also, die immer dort auftreten, wo die Bewegungsfreiheit der zu planenden Objekte stark eingeschr ̈ankt ist. An solchen Stellen kann es schwierig sein, eine ausreichende Anzahl von kollisionsfreien Samples zu finden. Es ist dann m ̈oglicherweise n ̈otig, ausgeklu ̈geltere Techniken einzusetzen, um eine gute Performance der Algorithmen zu erreichen.rnDie vorliegende Arbeit gliedert sich in zwei Teile: Im ersten Teil untersuchen wir parallele Kollisionserkennungsalgorithmen. Da wir auf eine Anwendung bei sampling-basierten Bewe- gungsplanern abzielen, w ̈ahlen wir hier eine Problemstellung, bei der wir stets die selben zwei Objekte, aber in einer großen Anzahl von unterschiedlichen Lagen auf Kollision testen. Wir im- plementieren und vergleichen verschiedene Verfahren, die auf Hu ̈llk ̈operhierarchien (BVHs) und hierarchische Grids als Beschleunigungsstrukturen zuru ̈ckgreifen. Alle beschriebenen Verfahren wurden auf mehreren CPU-Kernen parallelisiert. Daru ̈ber hinaus vergleichen wir verschiedene CUDA Kernels zur Durchfu ̈hrung BVH-basierter Kollisionstests auf der GPU. Neben einer un- terschiedlichen Verteilung der Arbeit auf die parallelen GPU Threads untersuchen wir hier die Auswirkung verschiedener Speicherzugriffsmuster auf die Performance der resultierenden Algo- rithmen. Weiter stellen wir eine Reihe von approximativen Kollisionstests vor, die auf den beschriebenen Verfahren basieren. Wenn eine geringere Genauigkeit der Tests tolerierbar ist, kann so eine weitere Verbesserung der Performance erzielt werden.rnIm zweiten Teil der Arbeit beschreiben wir einen von uns entworfenen parallelen, sampling- basierten Bewegungsplaner zur Behandlung hochkomplexer Probleme mit mehreren “narrow passages”. Das Verfahren arbeitet in zwei Phasen. Die grundlegende Idee ist hierbei, in der er- sten Planungsphase konzeptionell kleinere Fehler zuzulassen, um die Planungseffizienz zu erh ̈ohen und den resultierenden Pfad dann in einer zweiten Phase zu reparieren. Der hierzu in Phase I eingesetzte Planer basiert auf sogenannten Expansive Space Trees. Zus ̈atzlich haben wir den Planer mit einer Freidru ̈ckoperation ausgestattet, die es erlaubt, kleinere Kollisionen aufzul ̈osen und so die Effizienz in Bereichen mit eingeschr ̈ankter Bewegungsfreiheit zu erh ̈ohen. Optional erlaubt unsere Implementierung den Einsatz von approximativen Kollisionstests. Dies setzt die Genauigkeit der ersten Planungsphase weiter herab, fu ̈hrt aber auch zu einer weiteren Perfor- mancesteigerung. Die aus Phase I resultierenden Bewegungspfade sind dann unter Umst ̈anden nicht komplett kollisionsfrei. Um diese Pfade zu reparieren, haben wir einen neuartigen Pla- nungsalgorithmus entworfen, der lokal beschr ̈ankt auf eine kleine Umgebung um den bestehenden Pfad einen neuen, kollisionsfreien Bewegungspfad plant.rnWir haben den beschriebenen Algorithmus mit einer Klasse von neuen, schwierigen Metall- Puzzlen getestet, die zum Teil mehrere “narrow passages” aufweisen. Unseres Wissens nach ist eine Sammlung vergleichbar komplexer Benchmarks nicht ̈offentlich zug ̈anglich und wir fan- den auch keine Beschreibung von vergleichbar komplexen Benchmarks in der Motion-Planning Literatur.

Kinematics and statics of cable-driven parallel robots by interval-analysis-based methods

In the past two decades the work of a growing portion of researchers in robotics focused on a particular group of machines, belonging to the family of parallel manipulators: the cable robots. Although these robots share several theoretical elements with the better known parallel robots, they still present completely (or partly) unsolved issues. In particular, the study of their kinematic, already a difficult subject for conventional parallel manipulators, is further complicated by the non-linear nature of cables, which can exert only efforts of pure traction. The work presented in this thesis therefore focuses on the study of the kinematics of these robots and on the development of numerical techniques able to address some of the problems related to it. Most of the work is focused on the development of an interval-analysis based procedure for the solution of the direct geometric problem of a generic cable manipulator. This technique, as well as allowing for a rapid solution of the problem, also guarantees the results obtained against rounding and elimination errors and can take into account any uncertainties in the model of the problem. The developed code has been tested with the help of a small manipulator whose realization is described in this dissertation together with the auxiliary work done during its design and simulation phases.

A suggested translation of art related texts

The thesis is the translation of art related texts, translated for a sculptor of Bologna. The comment to the translation is based on functional theories.