Ändra sökning
Avgränsa sökresultatet
123 1 - 50 av 116
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Aguilar, Xavier
    et al.
    KTH, Centra, SeRC - Swedish e-Science Research Centre. KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Jordan, H.
    Heller, T.
    Hirsch, A.
    Fahringer, T.
    Laure, Erwin
    KTH, Centra, SeRC - Swedish e-Science Research Centre. KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    An On-Line Performance Introspection Framework for Task-Based Runtime Systems2019Ingår i: 19th International Conference on Computational Science, ICCS 2019, Springer Verlag , 2019, s. 238-252Konferensbidrag (Refereegranskat)
    Abstract [en]

    The expected high levels of parallelism together with the heterogeneity and complexity of new computing systems pose many challenges to current software. New programming approaches and runtime systems that can simplify the development of parallel applications are needed. Task-based runtime systems have emerged as a good solution to cope with high levels of parallelism, while providing software portability, and easing program development. However, these runtime systems require real-time information on the state of the system to properly orchestrate program execution and optimise resource utilisation. In this paper, we present a lightweight monitoring infrastructure developed within the AllScale Runtime System, a task-based runtime system for extreme scale. This monitoring component provides real-time introspection capabilities that help the runtime scheduler in its decision-making process and adaptation, while introducing minimum overhead. In addition, the monitoring component provides several post-mortem reports as well as real-time data visualisation that can be of great help in the task of performance debugging.

  • 2.
    Ahmed, Laeeq
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Scalable Analysis of Large Datasets in Life Sciences2019Doktorsavhandling, monografi (Övrigt vetenskapligt)
    Abstract [sv]

    Vi upplever just nu en flodvåg av data inom både vetenskaplig forskning och färetagsdriven utveckling. Detta gäller framfärallt inom livsvetenskap på grund av utveckling av bättre instrument och framsteg inom informationsteknologin under de senaste åren. Det finns dock betydande utmaningar med hanteringen av sådana datamängder som sträcker sig från praktisk hantering av de stora datavolymerna till färståelse av betydelsen och de praktiska implikationerna av dessa data.

    I den här avhandlingen presenterar jag metoder fär att snabbt och effektivt hantera, behandla, analysera och visualisera stora biovetenskapliga datamängder. Stärre delen av arbetet är fokuserat på att tillämpa de senaste Big Data ramverken fär att på så sätt skapa effektiva verktyg fär virtuell screening, vilket är en metod som används fär att säka igenom stora mängder kemiska strukturer fär läkemedelsutvecklings. Vidare presenterar jag en metod fär analys av stora mängder elektroencefalografidata (EEG) i realtid, vilken är en av de huvudsakliga metoderna fär att mäta elektrisk hjärnaktivitet.

    Färst utvärderar jag lämpligheten att med Spark (ett parallellt ramverk fär stora datamängder) genomfära parallell ligand-baserad virtuell screening. Jag applicerar metoden fär att klassificera samlingar med molekyler med hjälp av färtränade modeller fär att selektera de aktiva molekylerna. Jag demonstrerar även en strategi fär att skapa molnanpassade fläden fär strukturbaserad virtuell screening. Den huvudsakliga färdelen med den här strategin är äkad produktivitet och häg hastighet i analysen. I det här arbetet visar jag att Spark kan användas fär virtuell screening och att det även i allmänhet är en lämplig läsning fär parallell analys av stora mängder data. Dessutom visar jag genom ett exempel att Big Data analys kan vara värdefull vid arbete med biovetenskapliga data.

    I den andra delen av mitt arbete presenterar jag en metod som ytterligare minskar tiden fär den strukturbaserade virtuella screening genom användning av maskininlärning och en iterativ modelleringsstrategi baserad på Conformal Prediction. Syftet är att endast docka de molekyler som har en hägre sannolikhet att binda till ett målprotein, vid säkning efter molekyler som potentiellt kan användas som läkemedelskandidater. Med användning av maskininlärningsmodellerna från detta arbete har jag byggt en webbtjänst fär att färutsäga en profil av en molekyls olika interaktioner med olika målprotein. Dessa prediktioner kan användas fär att indikera sekundära interaktioner i tidiga skeden av läkemedelsutvecklingen.

    I den tredje delen presenterar jag metoder fär att detektera anfall med långtidsEEG - den här metoden fungerar i realtid genom att ta pågående mätningar som datasträmmar. Metoden mäter utmaningarna med att fatta beslut i realtid att lagra stora mängder data i datorns minne och uppdatera färutsägelsemodellen ny data som produceras i snabb takt. Den resulterande algoritmen klassificerar inte bara anfall i realtid, den lär sig också gränsvärdet i realtid. Jag presenterar också ett nytt mått, “topp-k amplitudmått” fär att klassificera vilka delar of data som motsvarar anfall. Utäver detta hjälper måttet till att minska mängden data som behäver behandlas i efterfäljande steg.

  • 3.
    Ahmed, Laeeq
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Georgiev, Valentin
    Capuccini, Marco
    Toor, Salman
    Schaal, Wesley
    Laure, Erwin
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Spjuth, Ola
    Efficient iterative virtual screening with Apache Spark and conformal prediction2018Ingår i: Journal of Cheminformatics, ISSN 1758-2946, E-ISSN 1758-2946, Vol. 10, artikel-id 8Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Background: Docking and scoring large libraries of ligands against target proteins forms the basis of structure-based virtual screening. The problem is trivially parallelizable, and calculations are generally carried out on computer clusters or on large workstations in a brute force manner, by docking and scoring all available ligands. Contribution: In this study we propose a strategy that is based on iteratively docking a set of ligands to form a training set, training a ligand-based model on this set, and predicting the remainder of the ligands to exclude those predicted as 'low-scoring' ligands. Then, another set of ligands are docked, the model is retrained and the process is repeated until a certain model efficiency level is reached. Thereafter, the remaining ligands are docked or excluded based on this model. We use SVM and conformal prediction to deliver valid prediction intervals for ranking the predicted ligands, and Apache Spark to parallelize both the docking and the modeling. Results: We show on 4 different targets that conformal prediction based virtual screening (CPVS) is able to reduce the number of docked molecules by 62.61% while retaining an accuracy for the top 30 hits of 94% on average and a speedup of 3.7. The implementation is available as open source via GitHub (https://github.com/laeeq80/spark-cpvs) and can be run on high-performance computers as well as on cloud resources.

  • 4.
    Akhmetova, Dana
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Cebamanos, L.
    Iakymchuk, Roman
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Rotaru, T.
    Rahn, M.
    Markidis, Stefano
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Laure, Erwin
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Bartsch, V.
    Simmendinger, C.
    Interoperability of GASPI and MPI in large scale scientific applications2018Ingår i: 12th International Conference on Parallel Processing and Applied Mathematics, PPAM 2017, Springer Verlag , 2018, s. 277-287Konferensbidrag (Refereegranskat)
    Abstract [en]

    One of the main hurdles of a broad distribution of PGAS approaches is the prevalence of MPI, which as a de-facto standard appears in the code basis of many applications. To take advantage of the PGAS APIs like GASPI without a major change in the code basis, interoperability between MPI and PGAS approaches needs to be ensured. In this article, we address this challenge by providing our study and preliminary performance results regarding interoperating GASPI and MPI on the performance crucial parts of the Ludwig and iPIC3D applications. In addition, we draw a strategy for better coupling of both APIs. 

  • 5. Aronsson, Sanna
    et al.
    Artman, Henrik
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Medieteknik och interaktionsdesign, MID.
    Lindquist, Sinna
    Mikael, Mitchell
    Persson, Tomas
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Medieteknik och interaktionsdesign, MID.
    Ramberg, Robert
    Stockholms Universitet.
    Romero, Mario
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    van de Vehn, Pontus
    Supporting after action review in simulator mission training: Co-creating visualization concepts for training of fast-jet fighter pilots2019Ingår i: The Journal of Defence Modeling and Simulation: Applications, Methodology, Technology, ISSN 1548-5129, E-ISSN 1557-380X, Vol. 16, nr 3, s. 219-231Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This article presents the design and evaluation of visualization concepts supporting After Action Review (AAR) in simulator mission training of fast-jet fighter pilots. The visualization concepts were designed based on three key characteristics of representations: re-representation, graphical constraining, and computational offloading. The visualization concepts represent combined parameters of missile launch and threat range, the former meant to elicit discussions about the prerequisites for launching missiles, and the latter to present details of what threats a certain aircraft is facing at a specific moment. The visualization concepts were designed to: 1) perceptually and cognitively offload mental workload from participants in support of determining relevant situations to discuss; 2) re-represent parameters in a format that facilitates reading-off of crucial information; and 3) graphically constrain plausible interpretations. Through a series of workshop iterations, two visualization concepts were developed and evaluated with 11 pilots and instructors. All pilots were unanimous in their opinion that the visualization concepts should be implemented as part of the AAR. Offloading, in terms of finding interesting events in the dynamic and unique training sessions, was the most important guiding concept, while re-representation and graphical constraining enabled a more structured and grounded collaboration during the AAR.

  • 6.
    Aurell, Erik
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). Aalto Univ, Dept Comp Sci, FIN-00076 Aalto, Finland.;Aalto Univ, Dept Appl Phys, FIN-00076 Aalto, Finland.
    Characteristic functions of quantum heat with baths at different temperatures2018Ingår i: Physical review. E, ISSN 2470-0045, E-ISSN 2470-0053, Vol. 97, nr 6, artikel-id 062117Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This paper is about quantum heat defined as the change in energy of a bath during a process. The presentation takes into account recent developments in classical strong-coupling thermodynamics and addresses a version of quantum heat that satisfies quantum-classical correspondence. The characteristic function and the full counting statistics of quantum heat are shown to be formally similar. The paper further shows that the method can be extended to more than one bath, e.g., two baths at different temperatures, which opens up the prospect of studying correlations and heat flow. The paper extends earlier results on the expected quantum heat in the setting of one bath [E. Aurell and R. Eichhorn, New .J Phys. 17, 065007 (2015); E. Aurell, Entropy 19, 595 (2017)].

  • 7.
    Aurell, Erik
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Dominguez, Eduardo
    Univ Havana, Dept Theoret Phys, Grp Complex Syst & Stat Phys, Havana, Cuba..
    Machado, David
    Univ Havana, Dept Theoret Phys, Grp Complex Syst & Stat Phys, Havana, Cuba..
    Mulet, Roberto
    Univ Havana, Dept Theoret Phys, Grp Complex Syst & Stat Phys, Havana, Cuba..
    Exploring the diluted ferromagnetic p-spin model with a cavity master equation2018Ingår i: Physical review. E, ISSN 2470-0045, E-ISSN 2470-0053, Vol. 97, nr 5, artikel-id 050103Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We introduce an alternative solution to Glauber multispin dynamics on random graphs. The solution is based on the recently introduced cavity master equation (CME), a time-closure turning the, in principle, exact dynamic cavity method into a practical method of analysis and of fast simulation. Running CME once is of comparable computational complexity as one Monte Carlo run on the same problem. We show that CME correctly models the ferromagnetic p-spin Glauber dynamics from high temperatures down to and below the spinoidal transition. We also show that CME allows an alternative exploration of the low-temperature spin-glass phase of the model.

  • 8.
    Aurell, Erik
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Montana, Federica
    KTH, Centra, Nordic Institute for Theoretical Physics NORDITA.
    Thermal power of heat flow through a qubit2019Ingår i: Physical review. E, ISSN 2470-0045, E-ISSN 2470-0053, Vol. 99, nr 4, artikel-id 042130Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this paper we consider the thermal power of a heat flow through a qubit between two baths. The baths are modeled as a set of harmonic oscillators initially at equilibrium, at two temperatures. Heat is defined as the change of energy of the cold bath, and thermal power is defined as expected heat per unit time, in the long-time limit. The qubit and the baths interact as in the spin-boson model, i.e., through qubit operator sigma(z). We compute thermal power in an approximation analogous to a "noninteracting blip" (NIBA) and express it in the polaron picture as products of correlation functions of the two baths, and a time derivative of a correlation function of the cold bath. In the limit of weak interaction we recover known results in terms of a sum of correlation functions of the two baths, a correlation functions of the cold bath only, and the energy split.

  • 9.
    Barkman, Patrik
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Grey-box modelling of distributed parameter systems2018Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Hybridmodeller konstrueras genom att kombinera modellkomponenter som härleds från grundläggande principer med modelkomponenter som bestäms empiriskt från data. I den här uppsatsen presenteras en metod för att beskriva distribuerade parametersystem genom hybridmodellering. Metoden kombinerar partiella differentialekvationer med ett neuronnätverk för att inkorporera tidigare känd kunskap om systemet samt identifiera okänd dynamik från data. Neuronnätverket tränas genom en gradientbaserad optimeringsmetod som använder sig av bakåt-läget av automatisk differentiering. För att demonstrera metoden används den för att modellera kemiska reaktioner i en fluid. Metoden appliceras slutligen på ett en-dimensionellt och ett två-dimensionellt exempel av reaktions-systemet. Resultaten indikerar att hybridmodellen lyckades återskapa beteendet hos systemet med god precision samt identifiera den underliggande reaktionen.

  • 10.
    Belic, Jovana
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Untangling Cortico-Striatal Circuitry and its Role in Health and Disease - A computational investigation2018Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    The basal ganglia (BG) play a critical role in a variety of regular motor and cognitive functions. Many brain diseases, such as Parkinson’s diseases, Huntington’s disease and dyskinesia, are directly related to malfunctions of the BG nuclei. One of those nuclei, the input nucleus called the striatum, is heavily connected to the cortex and receives afferents from nearly all cortical areas. The striatum is a recurrent inhibitory network that contains several distinct cell types. About 95% of neurons in the striatum are medium spiny neurons (MSNs) that form the only output from the striatum. Two of the most examined sources of GABAergic inhibition into MSNs are the feedback inhibition (FB) from the axon collaterals of the MSNs themselves, and the feedforward inhibition (FF) via the small population (1-2% of striatal neurons) of fast spiking interneurons (FSIs). The cortex sends direct projections to the striatum, while the striatum can affect the cortex only indirectly through other BG nuclei and the thalamus. Understanding how different components of the striatal network interact with each other and influence the striatal response to cortical inputs has crucial importance for clarifying the overall functions and dysfunctions of the BG.

        In this thesis I have employed advanced experimental data analysis techniques as well as computational modelling, to study the complex nature of cortico-striatal interactions. I found that for pathological states, such as Parkinson’s disease and L-DOPA-induced dyskinesia, effective connectivity is bidirectional with an accent on the striatal influence on the cortex. Interestingly, in the case of L-DOPA-induced dyskinesia, there was a high increase in effective connectivity at ~80 Hz and the results also showed a large relative decrease in the modulation of the local field potential amplitude (recorded in the primary motor cortex and sensorimotor striatum in awake, freely behaving, 6-OHDA lesioned hemi-parkinsonian rats) at ~80 Hz by the phase of low frequency oscillations. These results suggest a lack of coupling between the low frequency activity of a presumably larger neuronal population and the synchronized activity of a presumably smaller group of neurons active at 80 Hz.

        Next, I used a spiking neuron network model of the striatum to isolate the mechanisms underlying the transmission of cortical oscillations to the MSN population. I showed that FSIs play a crucial role in efficient propagation of cortical oscillations to the MSNs that did not receive direct cortical oscillations. Further, I have identified multiple factors such as the number of activated neurons, ongoing activity, connectivity, and synchronicity of inputs that influenced the transfer of oscillations by modifying the levels of FB and FF inhibitions. Overall, these findings reveal a new role of FSIs in modulating the transfer of information from the cortex to striatum. By modulating the activity and properties of the FSIs, striatal oscillations can be controlled very efficiently. Finally, I explored the interactions in the striatal network with different oscillation frequencies and showed that the features of those oscillations, such as amplitude and frequency fluctuations, can be influenced by a change in the input intensities into MSNs and FSIs and that these fluctuations are also highly dependent on the selected frequencies in addition to the phase offset between different cortical inputs.

        Lastly, I investigated how the striatum responds to cortical neuronal avalanches. Recordings in the striatum revealed that striatal activity was also characterized by spatiotemporal clusters that followed a power law distribution albeit, with significantly steeper slope. In this study, an abstract computational model was developed to elucidate the influence of intrastriatal inhibition and cortico-striatal interplay as important factors to understand the experimental findings. I showed that one particularly high activation threshold of striatal nodes can reproduce a power law-like distribution with a coefficient similar to the one found experimentally. By changing the ratio of excitation and inhibition in the cortical model, I saw that increased activity in the cortex strongly influenced striatal dynamics, which was reflected in a less negative slope of cluster size distributions in the striatum.  Finally, when inhibition was added to the model, cluster size distributions had a prominently earlier deviation from the power law distribution compared to the case when inhibition was not present. 

  • 11.
    Belic, Jovana
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). KTH, Centra, Science for Life Laboratory, SciLifeLab. Bernstein Center Freiburg, University of Freiburg, Freiburg, 79104, Germany.
    Kumar, Arvind
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). Bernstein Center Freiburg, University of Freiburg, Freiburg, 79104, Germany.
    Hellgren Kotaleski, Jeanette
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). KTH, Centra, Science for Life Laboratory, SciLifeLab. Department of Neuroscience, Karolinska Institute, Solna, 17177, Sweden.
    The role of striatal feedforward inhibition in propagation of cortical oscillations2017Ingår i: BMC neuroscience (Online), ISSN 1471-2202, E-ISSN 1471-2202, Vol. 18, s. 91-91Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Fast spiking interneurons (FSIs) and feedforward (FF) inhibition are a common property of neuronal networks throughout the brain and play crucial role in neural computations. For instance, in the cortex FF inhibition sets the window of temporal integration and spiking and thereby contributes to the control of firing rate and correlations [1]. In the striatum (the main input structure of the basal ganglia) despite their high firing rates and strong synapses, FSIs (comprise 1–2% of striatal neurons) do not seem to play a major role in controlling the firing of medium spiny neurons (MSNs; comprise 95% of striatal neurons) [2] and so far, it has not been possible to attribute a functional role to FSIs in the striatum. Here we use a spiking neuron network model in order to investigate how externally induced oscillations propagate through striatal circuitry. Recordings in the striatum have shown robust oscillatory activity that might be in fact cortical oscillations transmitted by the corticostriatal projections [3–5]. We propose that FSIs can perform an important role in transferring cortical oscillations to the striatum especially to those MSNs that are not directly driven by the cortical oscillations. Strong and divergent connectivity of FSIs implies that even weak oscillations in FSI population activity can be spread to the whole MSN population [6]. Further, we have identified multiple factors that influence the transfer of oscillations to MSNs. The variables such as the number of activated neurons, ongoing activity, connectivity, and synchronicity of inputs influence the transfer of oscillations by modifying the levels of feedforward and feedback inhibitions suggesting that the striatum can exploit different parameters to impact the transfer of oscillatory signals.

    References

    1. Isaacson, J. S., & Scanziani, M. (2011). How inhibition shapes cortical activity. Neuron, 72(2), 231–243. 

    2. Berke, J. D. (2011). Functional properties of striatal fast-spiking interneurons. Frontiers in systems neuroscience, 5.

    3. Belić, J. J., Halje, P., Richter, U., Petersson, P., & Kotaleski, J. H. (2016). Untangling cortico-striatal connectivity and cross-frequency coupling in L-DOPA-induced dyskinesia. Frontiers in systems neuroscience, 10.

    4. Berke, J. D. (2009). Fast oscillations in cortical‐striatal networks switch frequency following rewarding events and stimulant drugs. European Journal of Neuroscience, 30(5), 848–859.

    5. Boraud, T., Brown, P., Goldberg, J. A., Graybiel, A. M., & Magill, P. J. (2005). Oscillations in the basal ganglia: the good, the bad, and the unexpected. In The basal ganglia VIII (pp. 1–24). Springer US.

    6. Belić, J. J., Kumar, A., & Kotaleski, J. H. (2017). Interplay between periodic stimulation and GABAergic inhibition in striatal network oscillations. PloS one, 12(4), e0175135.

  • 12.
    Berglund, Emelie
    et al.
    KTH, Skolan för kemi, bioteknologi och hälsa (CBH), Genteknologi.
    Maaskola, Jonas
    KTH, Skolan för kemi, bioteknologi och hälsa (CBH), Genteknologi.
    Schultz, Niklas
    Friedrich, Stefanie
    Marklund, Maja
    KTH, Skolan för kemi, bioteknologi och hälsa (CBH), Genteknologi.
    Bergenstrahle, Joseph
    KTH, Skolan för kemi, bioteknologi och hälsa (CBH), Genteknologi.
    Tarish, Firas
    Tanoglidi, Anna
    Vickovic, Sanja
    KTH, Centra, Science for Life Laboratory, SciLifeLab.
    Larsson, Ludvig
    KTH, Skolan för kemi, bioteknologi och hälsa (CBH), Genteknologi.
    Salmén, Fredrik
    KTH, Centra, Science for Life Laboratory, SciLifeLab.
    Ogris, Christoph
    Wallenborg, Karolina
    Lagergren, Jens
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Ståhl, Patrik
    Sonnhammer, Erik
    Helleday, Thomas
    Lundeberg, Joakim
    KTH, Centra, Science for Life Laboratory, SciLifeLab.
    Spatial maps of prostate cancer transcriptomes reveal an unexplored landscape of heterogeneity2018Ingår i: Nature Communications, ISSN 2041-1723, E-ISSN 2041-1723, Vol. 9, artikel-id 2419Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Intra-tumor heterogeneity is one of the biggest challenges in cancer treatment today. Here we investigate tissue-wide gene expression heterogeneity throughout a multifocal prostate cancer using the spatial transcriptomics (ST) technology. Utilizing a novel approach for deconvolution, we analyze the transcriptomes of nearly 6750 tissue regions and extract distinct expression profiles for the different tissue components, such as stroma, normal and PIN glands, immune cells and cancer. We distinguish healthy and diseased areas and thereby provide insight into gene expression changes during the progression of prostate cancer. Compared to pathologist annotations, we delineate the extent of cancer foci more accurately, interestingly without link to histological changes. We identify gene expression gradients in stroma adjacent to tumor regions that allow for re-stratification of the tumor microenvironment. The establishment of these profiles is the first step towards an unbiased view of prostate cancer and can serve as a dictionary for future studies.

  • 13.
    Blackwell, Kim T.
    et al.
    George Mason Univ, Krasnow Inst Adv Study, Fairfax, VA 22030 USA. lackwell, Kim T..
    Salinas, Armando G.
    Tewatia, Parul
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). KTH, Centra, Science for Life Laboratory, SciLifeLab.
    English, Brad
    Hellgren Kotaleski, Jeanette
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). KTH, Centra, Science for Life Laboratory, SciLifeLab.
    Lovinger, David M.
    Molecular mechanisms underlying striatal synaptic plasticity: relevance chronic alcohol consumption and seeking2019Ingår i: European Journal of Neuroscience, ISSN 0953-816X, E-ISSN 1460-9568, Vol. 49, nr 6, s. 768-783Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The striatum, the input structure of the basal ganglia, is a major site learning and memory for goal-directed actions and habit formation. iny projection neurons of the striatum integrate cortical, thalamic, d nigral inputs to learn associations, with cortico-striatal synaptic asticity as a learning mechanism. Signaling molecules implicated in naptic plasticity are altered in alcohol withdrawal, which may ntribute to overly strong learning and increased alcohol seeking and nsumption. To understand how interactions among signaling molecules oduce synaptic plasticity, we implemented a mechanistic model of gnaling pathways activated by dopamine D1 receptors, acetylcholine ceptors, and glutamate. We use our novel, computationally efficient mulator, NeuroRD, to simulate stochastic interactions both within and tween dendritic spines. Dopamine release during theta burst and 20-Hz imulation was extrapolated from fast-scan cyclic voltammetry data llected in mouse striatal slices. Our results show that the combined tivity of several key plasticity molecules correctly predicts the currence of either LTP, LTD, or no plasticity for numerous perimental protocols. To investigate spatial interactions, we imulate two spines, either adjacent or separated on a 20-mu m ndritic segment. Our results show that molecules underlying LTP hibit spatial specificity, whereas 2-arachidonoylglycerol exhibits a atially diffuse elevation. We also implement changes in NMDA ceptors, adenylyl cyclase, and G protein signaling that have been asured following chronic alcohol treatment. Simulations under these nditions suggest that the molecular changes can predict changes in naptic plasticity, thereby accounting for some aspects of alcohol use sorder.

  • 14.
    Carlsson, Stefan
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Robotik, perception och lärande, RPL.
    Azizpour, Hossein
    KTH, Skolan för datavetenskap och kommunikation (CSC), Beräkningsvetenskap och beräkningsteknik (CST).
    Razavian, Ali Sharif
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Robotik, perception och lärande, RPL.
    Sullivan, Josephine
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Robotik, perception och lärande, RPL.
    Smith, Kevin
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    The Preimage of Rectifier Network Activities2017Ingår i: International Conference on Learning Representations (ICLR), 2017Konferensbidrag (Refereegranskat)
    Abstract [en]

    The preimage of the activity at a certain level of a deep network is the set of inputs that result in the same node activity. For fully connected multi layer rectifier networks we demonstrate how to compute the preimages of activities at arbitrary levels from knowledge of the parameters in a deep rectifying network. If the preimage set of a certain activity in the network contains elements from more than one class it means that these classes are irreversibly mixed. This implies that preimage sets which are piecewise linear manifolds are building blocks for describing the input manifolds specific classes, ie all preimages should ideally be from the same class. We believe that the knowledge of how to compute preimages will be valuable in understanding the efficiency displayed by deep learning networks and could potentially be used in designing more efficient training algorithms.

  • 15.
    Chen, Guang
    et al.
    Tongji Univ, Coll Automot Engn, Shanghai, Peoples R China.;Tech Univ Munich, Robot & Embedded Syst, Munich, Germany..
    Cao, Hu
    Hunan Univ, State Key Lab Adv Design & Mfg Vehicle Body, Changsha, Hunan, Peoples R China..
    Aafaque, Muhammad
    Tech Univ Munich, Robot & Embedded Syst, Munich, Germany..
    Chen, Jieneng
    Tongji Univ, Coll Elect & Informat Engn, Shanghai, Peoples R China..
    Ye, Canbo
    Tongji Univ, Coll Automot Engn, Shanghai, Peoples R China..
    Roehrbein, Florian
    Tech Univ Munich, Robot & Embedded Syst, Munich, Germany..
    Conradt, Jörg
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Chen, Kai
    Tongji Univ, Coll Automot Engn, Shanghai, Peoples R China..
    Bing, Zhenshan
    Tech Univ Munich, Robot & Embedded Syst, Munich, Germany..
    Liu, Xingbo
    Tongji Univ, Coll Automot Engn, Shanghai, Peoples R China..
    Hinz, Gereon
    Tech Univ Munich, Robot & Embedded Syst, Munich, Germany..
    Stechele, Walter
    Tech Univ Munich, Integrated Syst, Munich, Germany..
    Knoll, Alois
    Tech Univ Munich, Robot & Embedded Syst, Munich, Germany..
    Neuromorphic Vision Based Multivehicle Detection and Tracking for Intelligent Transportation System2018Ingår i: Journal of Advanced Transportation, ISSN 0197-6729, E-ISSN 2042-3195, artikel-id 4815383Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Neuromorphic vision sensor is a new passive sensing modality and a frameless sensor with a number of advantages over traditional cameras. Instead of wastefully sending entire images at fixed frame rate, neuromorphic vision sensor only transmits the local pixel-level changes caused by the movement in a scene at the time they occur. This results in advantageous characteristics, in terms of low energy consumption, high dynamic range, sparse event stream, and low response latency, which can be very useful in intelligent perception systems for modern intelligent transportation system (ITS) that requires efficient wireless data communication and low power embedded computing resources. In this paper, we propose the first neuromorphic vision based multivehicle detection and tracking system in ITS. The performance of the system is evaluated with a dataset recorded by a neuromorphic vision sensor mounted on a highway bridge. We performed a preliminary multivehicle tracking-by-clustering study using three classical clustering approaches and four tracking approaches. Our experiment results indicate that, by making full use of the low latency and sparse event stream, we could easily integrate an online tracking-by-clustering system running at a high frame rate, which far exceeds the real-time capabilities of traditional frame-based cameras. If the accuracy is prioritized, the tracking task can also be performed robustly at a relatively high rate with different combinations of algorithms. We also provide our dataset and evaluation approaches serving as the first neuromorphic benchmark in ITS and hopefully can motivate further research on neuromorphic vision sensors for ITS solutions.

  • 16.
    Chen, Guang
    et al.
    Tongji Univ, Coll Automot Engn, Shanghai, Peoples R China.;Tech Univ Munich, Robot Artificial Intelligence & Real Time Syst, Munich, Germany..
    Cao, Hu
    Hunan Univ, State Key Lab Adv Design & Mfg Vehicle Body, Changsha, Hunan, Peoples R China..
    Ye, Canbo
    Tongji Univ, Coll Automot Engn, Shanghai, Peoples R China..
    Zhang, Zhenyan
    Tongji Univ, Coll Automot Engn, Shanghai, Peoples R China..
    Liu, Xingbo
    Tongji Univ, Coll Automot Engn, Shanghai, Peoples R China..
    Mo, Xuhui
    Hunan Univ, State Key Lab Adv Design & Mfg Vehicle Body, Changsha, Hunan, Peoples R China..
    Qu, Zhongnan
    Swiss Fed Inst Technol, Comp Engn & Networks Lab, Zurich, Switzerland..
    Conradt, Jörg
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Roehrbein, Florian
    Tech Univ Munich, Robot Artificial Intelligence & Real Time Syst, Munich, Germany..
    Knoll, Alois
    Tech Univ Munich, Robot Artificial Intelligence & Real Time Syst, Munich, Germany..
    Multi-Cue Event Information Fusion for Pedestrian Detection With Neuromorphic Vision Sensors2019Ingår i: Frontiers in Neurorobotics, ISSN 1662-5218, Vol. 13, artikel-id 10Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Neuromorphic vision sensors are bio-inspired cameras that naturally capture the dynamics of a scene with ultra-low latency, filtering out redundant information with low power consumption. Few works are addressing the object detection with this sensor. In this work, we propose to develop pedestrian detectors that unlock the potential of the event data by leveraging multi-cue information and different fusion strategies. To make the best out of the event data, we introduce three different event-stream encoding methods based on Frequency, Surface of Active Event (SAE) and Leaky Integrate-and-Fire (LIF). We further integrate them into the state-of-the-art neural network architectures with two fusion approaches: the channel-level fusion of the raw feature space and decision-level fusion with the probability assignments. We present a qualitative and quantitative explanation why different encoding methods are chosen to evaluate the pedestrian detection and which method performs the best. We demonstrate the advantages of the decision-level fusion via leveraging multi-cue event information and show that our approach performs well on a self-annotated event-based pedestrian dataset with 8,736 event frames. This work paves the way of more fascinating perception applications with neuromorphic vision sensors.

  • 17.
    Chen, Guang
    et al.
    Tongji Univ, Coll Automot Engn, Shanghai, Peoples R China.;Tech Univ Munich, Chair Robot Artificial Intelligence & Real Time S, Munich, Germany..
    Chen, Jieneng
    Tongji Univ, Coll Elect & Informat Engn, Shanghai, Peoples R China..
    Lienen, Marten
    Tech Univ Munich, Chair Robot Artificial Intelligence & Real Time S, Munich, Germany..
    Conradt, Jörg
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Roehrbein, Florian
    Tech Univ Munich, Chair Robot Artificial Intelligence & Real Time S, Munich, Germany..
    Knoll, Alois C.
    Tech Univ Munich, Chair Robot Artificial Intelligence & Real Time S, Munich, Germany..
    FLGR: Fixed Length Gists Representation Learning for RNN-HMM Hybrid-Based Neuromorphic Continuous Gesture Recognition2019Ingår i: Frontiers in Neuroscience, ISSN 1662-4548, E-ISSN 1662-453X, Vol. 13, artikel-id 73Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    A neuromorphic vision sensors is a novel passive sensing modality and frameless sensors with several advantages over conventional cameras. Frame-based cameras have an average frame-rate of 30 fps, causing motion blur when capturing fast motion, e.g., hand gesture. Rather than wastefully sending entire images at a fixed frame rate, neuromorphic vision sensors only transmit the local pixel-level changes induced by the movement in a scene when they occur. This leads to advantageous characteristics, including low energy consumption, high dynamic range, a sparse event stream and low response latency. In this study, a novel representation learning method was proposed: Fixed Length Gists Representation (FLGR) learning for event-based gesture recognition. Previous methods accumulate events into video frames in a time duration (e.g., 30 ms) to make the accumulated image-level representation. However, the accumulated-frame-based representation waives the friendly event-driven paradigm of neuromorphic vision sensor. New representation are urgently needed to fill the gap in non-accumulated-frame-based representation and exploit the further capabilities of neuromorphic vision. The proposed FLGR is a sequence learned from mixture density autoencoder and preserves the nature of event-based data better. FLGR has a data format of fixed length, and it is easy to feed to sequence classifier. Moreover, an RNN-HMM hybrid was proposed to address the continuous gesture recognition problem. Recurrent neural network (RNN) was applied for FLGR sequence classification while hidden Markov model (HMM) is employed for localizing the candidate gesture and improving the result in a continuous sequence. A neuromorphic continuous hand gestures dataset (Neuro ConGD Dataset) was developed with 17 hand gestures classes for the community of the neuromorphic research. Hopefully, FLGR can inspire the study on the event-based highly efficient, high-speed, and high-dynamic-range sequence classification tasks.

  • 18. Chien, Steven W. D.
    et al.
    Markidis, Stefano
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Sishtla, Chaitanya Prasad
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Santos, Luis
    Herman, Pawel
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Nrasimhamurthy, Sai
    Laure, Erwin
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, Parallelldatorcentrum, PDC.
    Characterizing Deep-Learning I/O Workloads in TensorFlow2018Ingår i: Proceedings of PDSW-DISCS 2018: 3rd Joint International Workshop on Parallel Data Storage and Data Intensive Scalable Computing Systems, Held in conjunction with SC 2018: The International Conference for High Performance Computing, Networking, Storage and Analysis, Institute of Electrical and Electronics Engineers (IEEE), 2018, s. 54-63Konferensbidrag (Refereegranskat)
    Abstract [en]

    The performance of Deep-Learning (DL) computing frameworks rely on the rformance of data ingestion and checkpointing. In fact, during the aining, a considerable high number of relatively small files are first aded and pre-processed on CPUs and then moved to accelerator for mputation. In addition, checkpointing and restart operations are rried out to allow DL computing frameworks to restart quickly from a eckpoint. Because of this, I/O affects the performance of DL plications. this work, we characterize the I/O performance and scaling of nsorFlow, an open-source programming framework developed by Google and ecifically designed for solving DL problems. To measure TensorFlow I/O rformance, we first design a micro-benchmark to measure TensorFlow ads, and then use a TensorFlow mini-application based on AlexNet to asure the performance cost of I/O and checkpointing in TensorFlow. To prove the checkpointing performance, we design and implement a burst ffer. find that increasing the number of threads increases TensorFlow ndwidth by a maximum of 2.3 x and 7.8 x on our benchmark environments. e use of the tensorFlow prefetcher results in a complete overlap of mputation on accelerator and input pipeline on CPU eliminating the fective cost of I/O on the overall performance. The use of a burst ffer to checkpoint to a fast small capacity storage and copy ynchronously the checkpoints to a slower large capacity storage sulted in a performance improvement of 2.6x with respect to eckpointing directly to slower storage on our benchmark environment.

  • 19.
    Chien, Steven Wei Der
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, Parallelldatorcentrum, PDC.
    Sishtla, Chaitanya Prasad
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, Parallelldatorcentrum, PDC.
    Markidis, Stefano
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, Parallelldatorcentrum, PDC.
    Jun, Zhang
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, Parallelldatorcentrum, PDC.
    Peng, Ivy Bo
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, Parallelldatorcentrum, PDC. KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Laure, Erwin
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, Parallelldatorcentrum, PDC. KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    An Evaluation of the TensorFlow Programming Model for Solving Traditional HPC Problems2018Ingår i: Proceedings of the 5th International Conference on Exascale Applications and Software, The University of Edinburgh , 2018, s. 34-Konferensbidrag (Refereegranskat)
    Abstract [en]

    Computational intensive applications such as pattern recognition, and natural language processing, are increasingly popular on HPC systems. Many of these applications use deep-learning, a branch of machine learning, to determine the weights of artificial neural network nodes by minimizing a loss function. Such applications depend heavily on dense matrix multiplications, also called tensorial operations. The use of Graphics Processing Unit (GPU) has considerably speeded up deep-learning computations, leading to a Renaissance of the artificial neural network. Recently, the NVIDIA Volta GPU and the Google Tensor Processing Unit (TPU) have been specially designed to support deep-learning workloads. New programming models have also emerged for convenient expression of tensorial operations and deep-learning computational paradigms. An example of such new programming frameworks is TensorFlow, an open-source deep-learning library released by Google in 2015. TensorFlow expresses algorithms as a computational graph where nodes represent operations and edges between nodes represent data flow. Multi-dimensional data such as vectors and matrices which flows between operations are called Tensors. For this reason, computation problems need to be expressed as a computational graph. In particular, TensorFlow supports distributed computation with flexible assignment of operation and data to devices such as GPU and CPU on different computing nodes. Computation on devices are based on optimized kernels such as MKL, Eigen and cuBLAS. Inter-node communication can be through TCP and RDMA. This work attempts to evaluate the usability and expressiveness of the TensorFlow programming model for traditional HPC problems. As an illustration, we prototyped a distributed block matrix multiplication for large dense matrices which cannot be co-located on a single device and a Conjugate Gradient (CG) solver. We evaluate the difficulty of expressing traditional HPC algorithms using computational graphs and study the scalability of distributed TensorFlow on accelerated systems. Our preliminary result with distributed matrix multiplication shows that distributed computation on TensorFlow is extremely scalable. This study provides an initial investigation of new emerging programming models for HPC.

  • 20.
    Chien, Wei Der
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, Parallelldatorcentrum, PDC.
    An Evaluation of TensorFlow as a Programming Framework for HPC Applications2018Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Under de senaste åren har deep-learning, en så kallad typ av maskininlärning, blivit populärt på grund av dess applikationer och prestanda. Den viktigaste komponenten i de här teknikerna är matrismultiplikation. Grafikprocessorer (GPUs) är vanligt förekommande vid träningsprocesser av artificiella neuronnät. Detta på grund av deras massivt parallella beräkningskapacitet. Dessutom har specialiserade lågprecisionsacceleratorer  som  specifikt beräknar  matrismultiplikation tagits fram. Många utvecklingsramverk har framkommit för att hjälpa programmerare att hantera artificiella neuronnät. I TensorFlow uttrycks beräkningsproblem som en beräkningsgraf. En nod representerar en beräkningsoperation och en väg representerar dataflöde mellan beräkningsoperationer i en beräkningsgraf. Eftersom man måste programmera olika acceleratorer med olika systemarkitekturer har programmering av högprestandasystem blivit allt svårare. TensorFlow erbjuder en hög abstraktionsnivå och förenklar programmering av högprestandaberäkningar. Man programmerar acceleratorer genom att placera operationer inom grafen på olika acceleratorer med en API. I detta arbete granskas användbarheten hos TensorFlow som ett programmeringsramverk för applikationer med högprestandaberäkningar. Vi presenterar TensorFlow som ett programmeringsutvecklingsramverk för distribuerad beräkning. Vi implementerar två vanliga applikationer i TensorFlow: en lösare som löser linjära ekvationsystem med konjugerade gradientmetoden samt blockmatrismultiplikation och illustrerar hur de här problemen kan uttryckas i beräkningsgrafer för distribuerad beräkning. Vi experimenterar och kommenterar metoder för att demonstrera hur TensorFlow kan nyttja HPC-maskinvaror. Vi testar både skalbarhet och effektivitet samt gör mikro-benchmarking på kommunikationsprestanda. Genom detta arbete visar vi att TensorFlow är en framväxande och lovande plattform som passar väl för en viss typ av problem som kräver minimal synkronisering.

  • 21.
    Chrysanthidis, Nikolaos
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). Aristotle University of Thessaloniki, Faculty of Engineering, School of Electrical and Computer Engineering, 54124, Thessaloniki, Greece.
    Fiebig, Florian
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). Institute for Adaptive and Neural Computation, Edinburgh University, EH8 9AB Edinburgh, Scotland.
    Lansner, Anders
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). Department of Numerical Analysis and Computer Science, Stockholm University, 10691 Stockholm, Sweden.
    Introducing double bouquet cells into a modular cortical associative memory modelManuskript (preprint) (Övrigt vetenskapligt)
    Abstract [en]

    We present an electrophysiological model of double bouquet cells and integrate them into an established cortical columnar microcircuit model that has previously been used as a spiking attractor model for memory. Learning in that model relies on a Bayesian-Hebbian learning rule to condition recurrent connectivity between pyramidal cells. We here demonstrate that the inclusion of a biophysically plausible double bouquet cell model can solve earlier concerns about learning rules that simultaneously learn excitation and inhibition and might thus violate Dale's Principle. We show that learning ability and resulting effective connectivity between functional columns of previous network models is preserved when pyramidal synapses onto double-bouquet cells are plastic under the same Hebbian-Bayesian learning rule. The proposed architecture draws on experimental evidence on double bouquet cells and effectively solves the problem of duplexed learning of inhibition and excitation by replacing recurrent inhibition between pyramidal cells in functional columns of different stimulus selectivity with a plastic disynaptic pathway. We thus show that the resulting change to the microcircuit architecture improves the model's biological plausibility without otherwise impacting the models spiking activity, basic operation, and learning abilities.

  • 22.
    Degirmenci, Niyazi Cem
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Adaptive Finite Element Methods for Fluid Structure Interaction Problems with Applications to Human Phonation2018Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [sv]

    Detta arbete presenterar en enhetlig ram för numerisk lösning av fluid-strukturinteraktion (FSI) och akustikproblem med fokus på det mänskligatalet. En finita elementmetod används för numerisk lösning av de partiella differentialekvationer som beskriver konserveringslagar för moment och massa.Eftersom det resulterande systemet av ekvationer är mycket stort, konstruerasen öppen källkod med hög prestanda. För att få hög noggrannhet i de numeriska lösningarna används en adaptiv nätförfiningsstrategi vilken minskar beräkningskostnaden jämfört med en uniform förfining.Adaptiv förfining av nätet bygger på beräknade felindikatorer som bygger på en kombination av en beräkningsbar residual och lösningen av ett såkallat dualt problem. Den första huvudresultatet av denna avhandling är attutveckla en och validera denna strategi för en FSI-modell i ett benchmarkproblem.Denna FSI-modell utvidgas vidare för att hantera kontaktmekanik, ochanvänds sedan för en realistisk modell av stämbandsstrukturerna där denglottiska vågformationen fångas i de numeriska simuleringarna. Detta är detandra huvudresultatet i det presenterade arbetet.FSI-modellen kopplas också till en akustikmodell genom en akustisk analogi,för modell konstruerad för att skapa vokalen / i /. Den erhållna trycksignaleni ett antal punkter jämförs med resultat från litteraturen, vilket är det slutligahuvudresultatet som presenteras.

  • 23.
    Elgarf, Maha
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Exploring Eye-Tracking driven Sonification for the Visually Impaired2016Ingår i: PROCEEDINGS OF THE 7TH AUGMENTED HUMAN INTERNATIONAL CONFERENCE (AUGMENTED HUMAN 2016), 2016Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    Most existing sonification approaches for the visually impaired restrict the user to the perception of static scenes by performing sequential scans and transformations of visual information to acoustic signals. This takes away the user's freedom to explore the environment and to decide which information is relevant at a given point in time. As a solution, we propose an eye tracking system to allow the user to choose which elements of the field of view should be sonified. More specifically, we enhance the sonification approaches for color, text and facial expressions with eye tracking mechanisms. To find out how visually impaired people might react to such a system we applied a user centered design approach. Finally, we explored the effectiveness of our concept in a user study with seven visually impaired persons. The results show that eye tracking is a very promising input method to control the sonification, but the large variety of visual impairment conditions restricts the applicability of the technology.

  • 24.
    Eriksson, Olivia
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). KTH, Centra, SeRC - Swedish e-Science Research Centre.
    Jauhiainen, Alexandra
    AstraZeneca, IMED Biotech Unit, Early Clin Dev, Biometr, Gothenburg, Sweden..
    Sasane, Sara Maad
    Lund Univ, Ctr Math Sci, Lund, Sweden..
    Kramer, Andrei
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). KTH, Centra, Science for Life Laboratory, SciLifeLab.
    Nair, Anu G.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). KTH, Centra, Science for Life Laboratory, SciLifeLab.
    Sartorius, Carolina
    Lund Univ, Ctr Math Sci, Lund, Sweden..
    Hellgren Kotaleski, Jeanette
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). KTH, Centra, SeRC - Swedish e-Science Research Centre.
    Uncertainty quantification, propagation and characterization by Bayesian analysis combined with global sensitivity analysis applied to dynamical intracellular pathway models2019Ingår i: Bioinformatics, ISSN 1367-4803, E-ISSN 1367-4811, Vol. 35, nr 2, s. 284-292Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Motivation: Dynamical models describing intracellular phenomena are increasing in size and complexity as more information is obtained from experiments. These models are often over-parameterized with respect to the quantitative data used for parameter estimation, resulting in uncertainty in the individual parameter estimates as well as in the predictions made from the model. Here we combine Bayesian analysis with global sensitivity analysis (GSA) in order to give better informed predictions; to point out weaker parts of the model that are important targets for further experiments, as well as to give guidance on parameters that are essential in distinguishing different qualitative output behaviours. Results: We used approximate Bayesian computation (ABC) to estimate the model parameters from experimental data, as well as to quantify the uncertainty in this estimation (inverse uncertainty quantification), resulting in a posterior distribution for the parameters. This parameter uncertainty was next propagated to a corresponding uncertainty in the predictions (forward uncertainty propagation), and a GSA was performed on the predictions using the posterior distribution as the possible values for the parameters. This methodology was applied on a relatively large model relevant for synaptic plasticity, using experimental data from several sources. We could hereby point out those parameters that by themselves have the largest contribution to the uncertainty of the prediction as well as identify parameters important to separate between qualitatively different predictions. This approach is useful both for experimental design as well as model building.

  • 25.
    Eriksson, Olivia
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Laure, Erwin
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, Parallelldatorcentrum, PDC.
    Lindahl, Erik
    KTH, Skolan för teknikvetenskap (SCI), Tillämpad fysik, Biofysik.
    Henningson, Dan S.
    KTH, Skolan för teknikvetenskap (SCI), Mekanik, Stabilitet, Transition, Kontroll.
    Ynnerman, Anders
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    e-Science in Scandinavia2018Ingår i: Informatik-Spektrum, ISSN 0170-6012, E-ISSN 1432-122X, Vol. 41, nr 6, s. 398-404Artikel i tidskrift (Refereegranskat)
  • 26.
    Fiebig, Florian
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Active Memory Processing on Multiple Time-scales in Simulated Cortical Networks with Hebbian Plasticity2018Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    This thesis examines declarative memory function, and its underlying neural activity and mechanisms in simulated cortical networks. The included simulation models utilize and synthesize proposed universal computational principles of the brain, such as the modularity of cortical circuit organization, attractor network theory, and Hebbian synaptic plasticity, along with selected biophysical detail from the involved brain areas to implement functional models of known cortical memory systems. The models hypothesize relations between neural activity, brain area interactions, and cognitive memory functions such as sleep-dependent memory consolidation, or specific working memory tasks. In particular, this work addresses the acutely relevant research question if recently described fast forms of Hebbian synaptic plasticity are a possible mechanism behind working memory. The proposed models specifically challenge the “persistent activity hypothesis of working memory”, an established but increasingly questioned paradigm in working memory theory. The proposed alternative is a novel synaptic working memory model that is arguably more defensible than the existing paradigm as it can better explain memory function and important aspects of working memory-linked activity (such as the role of long-term memory in working memory tasks), while simultaneously matching experimental data from behavioral memory testing and important evidence from electrode recordings.

  • 27.
    Fiebig, Florian
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Herman, Pawel
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Lansner, Anders
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). Department of Mathematics, Stockholm University, 10691 Stockholm, Swed.
    An Indexing Theory for Working Memory based on Fast Hebbian PlasticityManuskript (preprint) (Övrigt vetenskapligt)
    Abstract [en]

    Working memory (WM) is a key component of human memory and cognitive function. Computational models have been used to uncover the underlying neural mechanisms. However, these studies have mostly focused on the short-term memory aspects of WM and neglected the equally important role of interactions between short- and long-term memory (STM, LTM). Here, we concentrate on these interactions within the framework of our new computational model of WM, which accounts for three cortical patches in macaque brain, corresponding to networks in prefrontal cortex (PFC) together with parieto-temporal cortical areas. In particular, we propose a cortical indexing theory that explains how PFC could associate, maintain and update multi-modal LTM representations. Our simulation results demonstrate how simultaneous, brief multi-modal memory cues could build a temporary joint memory representation linked via an "index" in the prefrontal cortex by means of fast Hebbian synaptic plasticity. The latter can then activate spontaneously and thereby reactivate the associated long-term representations. Cueing one long-term memory item rapidly pattern-completes the associated un-cued item via prefrontal cortex. The STM network updates flexibly as new stimuli arrive thereby gradually over-writing older representations. In a wider context, this WM model suggests a novel explanation for "variable binding", a long-standing and fundamental phenomenon in cognitive neuroscience, which is still poorly understood in terms of detailed neural mechanisms.

  • 28.
    Friberg, Anders
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Tal, musik och hörsel, TMH.
    Lindeberg, Tony
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Hellwagner, Martin
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Tal, musik och hörsel, TMH.
    Helgason, Pétur
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Tal, musik och hörsel, TMH.
    Salomão, Gláucia Laís
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Tal, musik och hörsel, TMH.
    Elovsson, Anders
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Tal, musik och hörsel, TMH.
    Lemaitre, Guillaume
    Institute for Research and Coordination in Acoustics and Music, Paris, France.
    Ternström, Sten
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Tal, musik och hörsel, TMH.
    Prediction of three articulatory categories in vocal sound imitations using models for auditory receptive fields2018Ingår i: Journal of the Acoustical Society of America, ISSN 0001-4966, E-ISSN 1520-8524, Vol. 144, nr 3, s. 1467-1483Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Vocal sound imitations provide a new challenge for understanding the coupling between articulatory mechanisms and the resulting audio. In this study, we have modeled the classification of three articulatory categories, phonation, supraglottal myoelastic vibrations, and turbulence from audio recordings. Two data sets were assembled, consisting of different vocal imitations by four professional imitators and four non-professional speakers in two different experiments. The audio data were manually annotated by two experienced phoneticians using a detailed articulatory description scheme. A separate set of audio features was developed specifically for each category using both time-domain and spectral methods. For all time-frequency transformations, and for some secondary processing, the recently developed Auditory Receptive Fields Toolbox was used. Three different machine learning methods were applied for predicting the final articulatory categories. The result with the best generalization was found using an ensemble of multilayer perceptrons. The cross-validated classification accuracy was 96.8 % for phonation, 90.8 % for supraglottal myoelastic vibrations, and 89.0 % for turbulence using all the 84 developed features. A final feature reduction to 22 features yielded similar results.

  • 29.
    Frånberg, Mattias
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS). KTH, Centra, Science for Life Laboratory, SciLifeLab. Cardiovascular Medicine Unit, Department of Medicine, Solna, Karolinska Institutet, Stockholm, Sweden ; Department of Numerical Analysis and Computer Science, Stockholm University, Stockholm, Sweden.
    Lagergren, Jens
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). KTH, Centra, SeRC - Swedish e-Science Research Centre.
    Sennblad, Bengt
    Cardiovascular Medicine Unit, Department of Medicine, Solna, Karolinska Institutet, Stockholm, Sweden ; Dept of Cell and Molecular Biology, National Bioinformatics Infrastructure Sweden, Science for Life Laboratory, Uppsala University, Uppsala, Sweden.
    BESIQ: A tool for discovering gene-gene and gene-environment interactions in genome-wide association studiesManuskript (preprint) (Övrigt vetenskapligt)
  • 30. Galal-Edeen, G. H.
    et al.
    Abdrabou, Y.
    Elgarf, Maha
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Hassan, H. M.
    HCI of Arabia: The challenges of HCI research in Egypt2019Ingår i: interactions, ISSN 1072-5520, E-ISSN 1558-3449, Vol. 26, nr 3, s. 55-59Artikel i tidskrift (Refereegranskat)
  • 31.
    Gao, Chen-Yi
    et al.
    Chinese Acad Sci, Inst Theoret Phys, Key Lab Theoret Phys, Beijing 100190, Peoples R China.;Univ Chinese Acad Sci, Sch Phys Sci, Beijing 100049, Peoples R China..
    Cecconi, Fabio
    Sapienza Univ Roma, CNR ISC, Ple Moro 2, I-00185 Rome, Italy.;Sapienza Univ Roma, Dipartimento Fis, Ple Moro 2, I-00185 Rome, Italy..
    Vulpiani, Angelo
    Sapienza Univ Roma, CNR ISC, Ple Moro 2, I-00185 Rome, Italy.;Sapienza Univ Roma, Dipartimento Fis, Ple Moro 2, I-00185 Rome, Italy.;Accademia Lincei, Ctr Interdisciplinare B Segre, Rome, Italy..
    Zhou, Hai-Jun
    Chinese Acad Sci, Inst Theoret Phys, Key Lab Theoret Phys, Beijing 100190, Peoples R China.;Univ Chinese Acad Sci, Sch Phys Sci, Beijing 100049, Peoples R China..
    Aurell, Erik
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). Aalto Univ, Dept Appl Phys, FIN-00076 Aalto, Finland.;Aalto Univ, Dept Comp Sci, FIN-00076 Aalto, Finland.;PSL Res Univ, Lab Phys Chim Theor, UMR CNRS Gulliver 7083, ESPCI, 10 Rue Vauquelin, F-75231 Paris, France..
    DCA for genome-wide epistasis analysis: the statistical genetics perspective2019Ingår i: Physical Biology, ISSN 1478-3967, E-ISSN 1478-3975, Vol. 16, nr 2, artikel-id 026002Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Direct coupling analysis (DCA) is a now widely used method to leverage statistical information from many similar biological systems to draw meaningful conclusions on each system separately. DCA has been applied with great success to sequences of homologous proteins, and also more recently to whole-genome population-wide sequencing data. We here argue that the use of DCA on the genome scale is contingent on fundamental issues of population genetics. DCA can be expected to yield meaningful results when a population is in the quasi-linkage equilibrium (QLE) phase studied by Kimura and others, but not, for instance, in a phase of clonal competition. We discuss how the exponential (Potts model) distributions emerge in QLE, and compare couplings to correlations obtained in a study of about 3000 genomes of the human pathogen Streptococcus pneumoniae.

  • 32.
    Görnerup, Olof
    et al.
    RISE.
    Gillblad, Daniel
    RISE.
    Vasiloudis, Theodore
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). RISE.
    Domain-agnostic discovery of similarities and concepts at scale2017Ingår i: Knowledge and Information Systems, ISSN 0219-1377, E-ISSN 0219-3116, Vol. 51, nr 2, s. 531-560Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Appropriately defining and efficiently calculating similarities from large data sets are often essential in data mining, both for gaining understanding of data and generating processes and for building tractable representations. Given a set of objects and their correlations, we here rely on the premise that each object is characterized by its context, i.e., its correlations to the other objects. The similarity between two objects can then be expressed in terms of the similarity between their contexts. In this way, similarity pertains to the general notion that objects are similar if they are exchangeable in the data. We propose a scalable approach for calculating all relevant similarities among objects by relating them in a correlation graph that is transformed to a similarity graph. These graphs can express rich structural properties among objects. Specifically, we show that concepts—abstractions of objects—are constituted by groups of similar objects that can be discovered by clustering the objects in the similarity graph. These principles and methods are applicable in a wide range of fields and will be demonstrated here in three domains: computational linguistics, music, and molecular biology, where the numbers of objects and correlations range from small to very large.

  • 33.
    Görnerup, Olof
    et al.
    RISE.
    Gillblad, Daniel
    RISE.
    Vasiloudis, Theodore
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). RISE.
    Knowing an Object by the Company It Keeps: A Domain-Agnostic Scheme for Similarity Discovery2015Konferensbidrag (Refereegranskat)
    Abstract [en]

    Appropriately defining and then efficiently calculating similarities from large data sets are often essential in data mining, both for building tractable representations and for gaining understanding of data and generating processes. Here we rely on the premise that given a set of objects and their correlations, each object is characterized by its context, i.e. its correlations to the other objects, and that the similarity between two objects therefore can be expressed in terms of the similarity between their respective contexts. Resting on this principle, we propose a data-driven and highly scalable approach for discovering similarities from large data sets by representing objects and their relations as a correlation graph that is transformed to a similarity graph. Together these graphs can express rich structural properties among objects. Specifically, we show that concepts -- representations of abstract ideas and notions -- are constituted by groups of similar objects that can be identified by clustering the objects in the similarity graph. These principles and methods are applicable in a wide range of domains, and will here be demonstrated for three distinct types of objects: codons, artists and words, where the numbers of objects and correlations range from small to very large.

  • 34.
    Hahn, Gerald
    et al.
    Univ Pompeu Fabra, Ctr Brain & Cognit, Computat Neurosci Grp, Dept Informat & Commun Technol, Barcelona, Spain..
    Ponce-Alvarez, Adrian
    Univ Pompeu Fabra, Ctr Brain & Cognit, Computat Neurosci Grp, Dept Informat & Commun Technol, Barcelona, Spain..
    Deco, Gustavo
    Univ Pompeu Fabra, Ctr Brain & Cognit, Computat Neurosci Grp, Dept Informat & Commun Technol, Barcelona, Spain.;Univ Pompeu Fabra, Inst Catalana Recerca & Estudis Avancats, Barcelona, Spain..
    Aertsen, Ad
    Univ Freiburg, Fac Biol, Freiburg, Germany.;Univ Freiburg, Bernstein Ctr Freiburg, Freiburg, Germany..
    Kumar, Arvind
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Portraits of communication in neuronal networks2019Ingår i: Nature Reviews Neuroscience, ISSN 1471-003X, E-ISSN 1471-0048, Vol. 20, nr 2, s. 117-127Artikel, forskningsöversikt (Refereegranskat)
    Abstract [en]

    The brain is organized as a network of highly specialized networks of spiking neurons. To exploit such a modular architecture for computation, the brain has to be able to regulate the flow of spiking activity between these specialized networks. In this Opinion article, we review various prominent mechanisms that may underlie communication between neuronal networks. We show that communication between neuronal networks can be understood as trajectories in a two-dimensional state space, spanned by the properties of the input. Thus, we propose a common framework to understand neuronal communication mediated by seemingly different mechanisms. We also suggest that the nesting of slow (for example, alpha-band and theta-band) oscillations and fast (gamma-band) oscillations can serve as an important control mechanism that allows or prevents spiking signals to be routed between specific networks. We argue that slow oscillations can modulate the time required to establish network resonance or entrainment and, thereby, regulate communication between neuronal networks.

  • 35.
    Heil, Katharina F.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). University of Edinburgh.
    A Systems Biological Approach to Parkinson's Disease2018Doktorsavhandling, monografi (Övrigt vetenskapligt)
    Abstract [sv]

    Parkinsons sjukdom (PS) är den näst vanligaste neurodegenerativa sjukdomen i väst-världen. Den uppvisar en hög grad av genetisk och fenotypisk komplexitet, med mångafaktorer inblandade, den manifesterar sig på olika sätt men det finns få identifieradeorsakssamband. Forskningen har dock identifierat fler och fler molekylära förändringarsom är kopplade till sjukdomen.Det är främst dopaminerga nervceller i Substantia Nigra och speciellt deras synap-ser, som är påverkade vid PS. Denna avhandling fokuserar därför på att förstå desynaptiska sjukdomseffekterna bättre, och arbetet har som ambition att identifiera genetisktorsakade och synaptiskt associerade PS-mekanismer. Idag är en huvudsaklig utmaninginom detta fält kvaliteten på och åtkomsten av data.I denna studie inhämtades och analyserades publikt data på ett systematiskt sätt, föratt bättre förstå PS. 418 PS-associerade gener kunde identifieras baserat på mutationersamt kurerade annoteringar av data. Jag kurerade ett synapsproteom som innehöll to-talt 6706 proteiner. Regionspecifika datamängder som beskriver presynapsen, postsy-napsen och hela synapsregionen definierades också. Dessa datamängder analyseradesgenom att undersöka likheter och skillnader, inklusive reproducerbarhet av resultatensamt proteinernas funktionella kopplingar.Analys av Protein-Protein-Interaktions Nätverk (PPIN) valdes för att få en dju-pare kunskap vad gäller specifika effekter av PS på synapsen. Därför genereradejag ett specifikt Protein-Protein-Interaktions (PPI dataset från fyra publika databasersom innehöll 211824 direkta interaktioner. Proteomikdata och PPI-information fråndetta dataset skapade förutsättningar för att konstruera några PPINs. Dessa anal-yserades och statistisk information erhölls vad gäller nätverkens modularitet, klus-tringskoefficient och nodgrad, vilket beskriver nätverkens topologi utifrån en matem-atisk synvinkel. Förutom denna grundläggande nätverksstatistik, undersöktes ocksåmer specifika egenskaper vad gäller topologin i de studerade PPINs. För att under-söka funktionella undergrupper i nätverken användes olika klustringsalgoritmer. Närdet gäller biologiska nätverk är den underliggande hypotesen att proteiner som ingår isamma strukturella grupp har högre sannolikhet att ha gemensamma funktioner. Där-för försökte jag identifiera grupper anrikade med synapsproteiner som associeras medPS. Dessa grupper jämfördes sedan med varandra. Tre kluster identifierades vilka in-nehöll överlappande uppsättningar gener. Dessa innehöll 24 gener associerade med PS.Förutom de gener som man redan vet är associerade med sjukdomen, identifierade viytterligare 322 potentiella gener. För vart och ett av dessa tre kluster var förekomsten 

    av vissa biologiska processer och cellulära komponenter förhöjd, såsom sådana somär involverade i den synaptiska transmissionen eller reglerar pre- och postsynapsensproteinorganisation, inklusive t.e.x. “scaffold” proteiner och klassisk komplementak-tivering (relaterat till immunystemet).Det beskrivna tillvägagångssättet kombinerar en kurerad datamängd av gener as-socierade med PS, filtrerad PPI information och synapsproteom. Olika små- ochstorskaliga analytiska metoder, såsom topologianalys av PPINs, klustringsalgoritmeroch anrikningsstudier identifierade synapsproteiner som var påverkade vid PS. Despecifika sjukdomsassocierade proteinfunktioner som identifierades bekräftade redanexisterande kunskap, och tillät mig att lista tidigare okända potentiella sjukdomsas-socierade gener. Ett liknande tillvägagångssätt kan i framtiden även appliceras på an-dra komplexa sjukdomar.

  • 36.
    Heining, Katharina
    et al.
    Univ Freiburg, Dept Microsyst Engn IMTEK, Biomicrotechnol, Fac Engn, D-79110 Freiburg, Germany.;Univ Freiburg, Bernstein Ctr Freiburg, D-79104 Freiburg, Germany.;Univ Freiburg, Fac Biol, D-79104 Freiburg, Germany..
    Kilias, Antje
    Univ Freiburg, Dept Microsyst Engn IMTEK, Biomicrotechnol, Fac Engn, D-79110 Freiburg, Germany.;Univ Freiburg, Bernstein Ctr Freiburg, D-79104 Freiburg, Germany.;Univ Freiburg, Fac Biol, D-79104 Freiburg, Germany..
    Janz, Philipp
    Univ Freiburg, Fac Biol, D-79104 Freiburg, Germany.;Univ Freiburg, Dept Neurosurg, Med Ctr, Expt Epilepsy Res, D-79106 Freiburg, Germany..
    Haeussler, Ute
    Univ Freiburg, Dept Neurosurg, Med Ctr, Expt Epilepsy Res, D-79106 Freiburg, Germany.;Univ Freiburg, BrainLinks BrainTools Cluster Excellence, D-79110 Freiburg, Germany..
    Kumar, Arvind
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). Univ Freiburg, Bernstein Ctr Freiburg, D-79104 Freiburg, Germany..
    Haas, Carola A.
    Univ Freiburg, Bernstein Ctr Freiburg, D-79104 Freiburg, Germany.;Univ Freiburg, Dept Neurosurg, Med Ctr, Expt Epilepsy Res, D-79106 Freiburg, Germany.;Univ Freiburg, BrainLinks BrainTools Cluster Excellence, D-79110 Freiburg, Germany..
    Egert, Ulrich
    Univ Freiburg, Dept Microsyst Engn IMTEK, Biomicrotechnol, Fac Engn, D-79110 Freiburg, Germany.;Univ Freiburg, Bernstein Ctr Freiburg, D-79104 Freiburg, Germany.;Univ Freiburg, BrainLinks BrainTools Cluster Excellence, D-79110 Freiburg, Germany..
    Bursts with High and Low Load of Epileptiform Spikes Show Contex-Dependent Correlations in Epileptic Mice2019Ingår i: ENEURO, ISSN 2373-2822, Vol. 6, nr 5, artikel-id UNSP ENEURO.0299-18.2019Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Hypersynchronous network activity is the defining hallmark of epilepsy and manifests in a wide spectrum of phenomena, of which electrographic activity during seizures is only one extreme. The aim of this study was to differentiate between different types of epileptiform activity (EA) patterns and investigate their temporal succession and interactions. We analyzed local field potentials (LFPs) from freely behaving male mice that had received an intrahippocampal kainate injection to model mesial temporal lobe epilepsy (MTLE). Epileptiform spikes occurred in distinct bursts. Using machine learning, we derived a scale reflecting the spike load of bursts and three main burst categories that we labeled high-load, medium-load, and low-load bursts. We found that bursts of these categories were non-randomly distributed in time. High-load bursts formed clusters and were typically surrounded by transition phases with increased rates of medium-load and low-load bursts. In apparent contradiction to this, increased rates of low-load bursts were also associated with longer background phases, i.e., periods lacking high-load bursting. Furthermore, the rate of low-load bursts was more strongly correlated with the duration of background phases than the overall rate of epileptiform spikes. Our findings are consistent with the hypothesis that low-level EA could promote network stability but could also participate in transitions towards major epileptiform events, depending on the current state of the network.

  • 37.
    Hoffman, Johan
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), Beräkningsvetenskap och beräkningsteknik (CST).
    Holm, Bärbel
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Richter, Thomas
    The locally adapted parametric finite element method for interface problems on triangular meshes2017Ingår i: Fluid-Structure Interaction: Modeling, Adaptive Discretizations and Solvers / [ed] Stefan Frei, Bärbel Holm, Thomas Richter, Thomas, Huidong Yang, Walter de Gruyter, 2017, s. 41-63Kapitel i bok, del av antologi (Refereegranskat)
  • 38.
    Holm, Bärbel
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Wihler, Thomas P.
    Univ Bern, Math Inst, Sidlerstr 5, CH-3012 Bern, Switzerland..
    Continuous and discontinuous Galerkin time stepping methods for nonlinear initial value problems with application to finite time blow-up2018Ingår i: Numerische Mathematik, ISSN 0029-599X, E-ISSN 0945-3245, Vol. 138, nr 3, s. 767-799Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We consider continuous and discontinuous Galerkin time stepping methods of arbitrary order as applied to first-order initial value ordinary differential equation problems in real Hilbert spaces. Our only assumption is that the nonlinearities are continuous; in particular, we include the case of unbounded nonlinear operators. Specifically, we develop new techniques to prove general Peano-type existence results for discrete solutions. In particular, our results show that the existence of solutions is independent of the local approximation order, and only requires the local time steps to be sufficiently small (independent of the polynomial degree). The uniqueness of (local) solutions is addressed as well. In addition, our theory is applied to finite time blow-up problems with nonlinearities of algebraic growth. For such problems we develop a time step selection algorithm for the purpose of numerically computing the blow-up time, and provide a convergence result.

  • 39.
    Iakymchuk, Roman
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Graillat, Stef
    Sorbonne Univ, Paris, France..
    Defour, David
    Univ Perpignan, Perpignan, France..
    Quintana-Orti, Enrique S.
    Univ Jaime I, Castellon de La Plana, Spain..
    Hierarchical approach for deriving a reproducible unblocked LU factorization2019Ingår i: The international journal of high performance computing applications, ISSN 1094-3420, E-ISSN 1741-2846, Vol. 33, nr 5, s. 791-803Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We propose a reproducible variant of the unblocked LU factorization for graphics processor units (GPUs). For this purpose, we build upon Level-1/2 BLAS kernels that deliver correctly-rounded and reproducible results for the dot (inner) product, vector scaling, and the matrix-vector product. In addition, we draw a strategy to enhance the accuracy of the triangular solve via iterative refinement. Following a bottom-up approach, we finally construct a reproducible unblocked implementation of the LU factorization for GPUs, which accommodates partial pivoting for stability and can be eventually integrated in a high performance and stable algorithm for the (blocked) LU factorization.

  • 40. Iatropoulos, G.
    et al.
    Herman, Pawel
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Lansner, Anders
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Karlgren, Jussi
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Teoretisk datalogi, TCS. Gavagai, Slussplan 9, Stockholm, Sweden.
    Larsson, M.
    Olofsson, J. K.
    The language of smell: Connecting linguistic and psychophysical properties of odor descriptors2018Ingår i: Cognition, ISSN 0010-0277, E-ISSN 1873-7838, Vol. 178, s. 37-49Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The olfactory sense is a particularly challenging domain for cognitive science investigations of perception, memory, and language. Although many studies show that odors often are difficult to describe verbally, little is known about the associations between olfactory percepts and the words that describe them. Quantitative models of how odor experiences are described in natural language are therefore needed to understand how odors are perceived and communicated. In this study, we develop a computational method to characterize the olfaction-related semantic content of words in a large text corpus of internet sites in English. We introduce two new metrics: olfactory association index (OAI, how strongly a word is associated with olfaction) and olfactory specificity index (OSI, how specific a word is in its description of odors). We validate the OAI and OSI metrics using psychophysical datasets by showing that terms with high OAI have high ratings of perceived olfactory association and are used to describe highly familiar odors. In contrast, terms with high OSI have high inter-individual consistency in how they are applied to odors. Finally, we analyze Dravnieks's (1985) dataset of odor ratings in terms of OAI and OSI. This analysis reveals that terms that are used broadly (applied often but with moderate ratings) tend to be olfaction-unrelated and abstract (e.g., “heavy” or “light”; low OAI and low OSI) while descriptors that are used selectively (applied seldom but with high ratings) tend to be olfaction-related (e.g., “vanilla” or “licorice”; high OAI). Thus, OAI and OSI provide behaviorally meaningful information about olfactory language. These statistical tools are useful for future studies of olfactory perception and cognition, and might help integrate research on odor perception, neuroimaging, and corpus-based linguistic models of semantic organization.

  • 41. Janson, C. -E
    et al.
    Shiri, A.
    Jansson, Johan
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Moragues, M.
    Castanon, D.
    Saavedra, L.
    Degirmenci, C.
    Leoni, M.
    Nonlinear computations of heave motions for a generic wave energy converter2018Ingår i: NAV International Conference on Ship and Shipping Research, Associazione Italiana di Tecnica Navale , 2018, nr 221499, s. 283-290Konferensbidrag (Refereegranskat)
    Abstract [en]

    A bench-marking activity of numerical methods for analysis of Wave Energy Converters (WEC) was proposed under the Ocean Energy Systems (OES) International Energy Agency (IEA) Task 10 in 2015. The purpose of the benchmark is to do a code-2-code comparison of the predicted motions and power take out for a WEC. A heaving sphere was used as a first simple test case. The participants simulated heave decay and regular and irregular wave cases. The numerical methods ranged from linear methods to viscous methods solving the Navier-Stokes equations (CFD). An overview of the results from the first phase of the benchmark was reported in [1]. The present paper focus on the simulations of the sphere using one fully nonlinear time-domain BEM one transient RANS method and one transient Direct FE method with no turbulence model. The theory of the three methods as well as the modeling of the sphere are described. Heave decay and heave motions for steep regular waves were selected as test cases in order to study and compare the capability to handle nonlinear effects. Computational efficiency and applicability of the three methods are also discussed. 

  • 42.
    Jansson, Niclas
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Laure, Erwin
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Towards a Parallel Algebraic Multigrid Solver Using PGAS2018Ingår i: 2018 Workshop on High Performance Computing Asia, New York, NY, USA: Association for Computing Machinery (ACM), 2018, s. 31-38Konferensbidrag (Refereegranskat)
    Abstract [en]

    The Algebraic Multigrid (AMG) method has over the years developed into an efficient tool for solving unstructured linear systems. The need to solve large industrial problems discretized on unstructured meshes, has been a key motivation for devising a parallel AMG method. Despite some success, the key part of the AMG algorithm; the coarsening step, is far from trivial to parallelize efficiently. We here introduce a novel parallelization of the inherently sequential Ruge-Stüben coarsening algorithm, that retains most of the good interpolation properties of the original method. Our parallelization is based on the Partitioned Global Address Space (PGAS) abstraction, which greatly simplifies the parallelization as compared to traditional message passing based implementations. The coarsening algorithm and solver is described in detail and a performance study on a Cray XC40 is presented.

  • 43.
    Jansson, Ylva
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Lindeberg, Tony
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Dynamic texture recognition using time-causal and time-recursive spatio-temporal receptive fields2018Ingår i: Journal of Mathematical Imaging and Vision, ISSN 0924-9907, E-ISSN 1573-7683, Vol. 60, nr 9, s. 1369-1398Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This work presents a first evaluation of using spatio-temporal receptive fields from a recently proposed time-causal spatiotemporal scale-space framework as primitives for video analysis. We propose a new family of video descriptors based on regional statistics of spatio-temporal receptive field responses and evaluate this approach on the problem of dynamic texture recognition. Our approach generalises a previously used method, based on joint histograms of receptive field responses, from the spatial to the spatio-temporal domain and from object recognition to dynamic texture recognition. The time-recursive formulation enables computationally efficient time-causal recognition. The experimental evaluation demonstrates competitive performance compared to state of the art. In particular, it is shown that binary versions of our dynamic texture descriptors achieve improved performance compared to a large range of similar methods using different primitives either handcrafted or learned from data. Further, our qualitative and quantitative investigation into parameter choices and the use of different sets of receptive fields highlights the robustness and flexibility of our approach. Together, these results support the descriptive power of this family of time-causal spatio-temporal receptive fields, validate our approach for dynamic texture recognition and point towards the possibility of designing a range of video analysis methods based on these new time-causal spatio-temporal primitives.

  • 44.
    Jordan, Jakob
    et al.
    Julich Res Ctr, Inst Neurosci & Med INM 6, Julich, Germany.;Julich Res Ctr, Inst Adv Simulat IAS 6, Julich, Germany.;Julich Res Ctr, JARA Inst Brain Struct Funct Relationships INM 10, Julich, Germany..
    Ippen, Tammo
    Julich Res Ctr, Inst Neurosci & Med INM 6, Julich, Germany.;Julich Res Ctr, Inst Adv Simulat IAS 6, Julich, Germany.;Julich Res Ctr, JARA Inst Brain Struct Funct Relationships INM 10, Julich, Germany.;Norwegian Univ Life Sci, Fac Sci & Technol, As, Norway..
    Helias, Moritz
    Julich Res Ctr, Inst Neurosci & Med INM 6, Julich, Germany.;Julich Res Ctr, Inst Adv Simulat IAS 6, Julich, Germany.;Julich Res Ctr, JARA Inst Brain Struct Funct Relationships INM 10, Julich, Germany.;Rhein Westfal TH Aachen, Dept Phys, Fac 1, Aachen, Germany..
    Kitayama, Itaru
    RIKEN, Adv Inst Computat Sci, Kobe, Hyogo, Japan..
    Sato, Mitsuhisa
    RIKEN, Adv Inst Computat Sci, Kobe, Hyogo, Japan..
    Igarashi, Jun
    RIKEN, Computat Engn Applicat Unit, Wako, Saitama, Japan..
    Diesmann, Markus
    Julich Res Ctr, Inst Neurosci & Med INM 6, Julich, Germany.;Julich Res Ctr, Inst Adv Simulat IAS 6, Julich, Germany.;Julich Res Ctr, JARA Inst Brain Struct Funct Relationships INM 10, Julich, Germany.;Rhein Westfal TH Aachen, Dept Phys, Fac 1, Aachen, Germany.;Rhein Westfal TH Aachen, Med Fac, Dept Psychiat Psychotherapy & Psychosomat, Aachen, Germany..
    Kunkel, Susanne
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST). Julich Res Ctr, Simulat Lab Neurosci Bernstein Facil Simulat & Da, Julich, Germany..
    Extremely Scalable Spiking Neuronal Network Simulation Code: From Laptops to Exascale Computers (vol 12, 2, 2018)2018Ingår i: Frontiers in Neuroinformatics, ISSN 1662-5196, E-ISSN 1662-5196, Vol. 12, artikel-id 34Artikel i tidskrift (Refereegranskat)
  • 45.
    Jordanova, V. K.
    et al.
    Los Alamos Natl Lab, Los Alamos, NM 87545 USA..
    Delzanno, G. L.
    Los Alamos Natl Lab, Los Alamos, NM 87545 USA..
    Henderson, M. G.
    Los Alamos Natl Lab, Los Alamos, NM 87545 USA..
    Godinez, H. C.
    Los Alamos Natl Lab, Los Alamos, NM 87545 USA..
    Jeffery, C. A.
    Los Alamos Natl Lab, Los Alamos, NM 87545 USA..
    Lawrence, E. C.
    Los Alamos Natl Lab, Los Alamos, NM 87545 USA..
    Morley, S. K.
    Los Alamos Natl Lab, Los Alamos, NM 87545 USA..
    Moulton, J. D.
    Los Alamos Natl Lab, Los Alamos, NM 87545 USA..
    Vernon, L. J.
    Los Alamos Natl Lab, Los Alamos, NM 87545 USA..
    Woodroffe, J. R.
    Los Alamos Natl Lab, Los Alamos, NM 87545 USA..
    Brito, T. V.
    Los Alamos Natl Lab, Los Alamos, NM 87545 USA..
    Engel, M. A.
    Los Alamos Natl Lab, Los Alamos, NM 87545 USA..
    Meierbachtol, C. S.
    Los Alamos Natl Lab, Los Alamos, NM 87545 USA..
    Svyatsky, D.
    Los Alamos Natl Lab, Los Alamos, NM 87545 USA..
    Yu, Y.
    Los Alamos Natl Lab, Los Alamos, NM 87545 USA.;Beihang Univ, Beijing, Peoples R China..
    Toth, G.
    Univ Michigan, Ann Arbor, MI 48109 USA..
    Welling, D. T.
    Univ Michigan, Ann Arbor, MI 48109 USA..
    Chen, Y.
    Univ Michigan, Ann Arbor, MI 48109 USA..
    Haiducek, J.
    Univ Michigan, Ann Arbor, MI 48109 USA..
    Markidis, Stefano
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Albert, J. M.
    Air Force Res Lab, Kirtland AFB, NM USA..
    Birn, J.
    Los Alamos Natl Lab, Los Alamos, NM 87545 USA.;Space Sci Inst, Boulder, CO USA..
    Denton, M. H.
    Space Sci Inst, Boulder, CO USA.;New Mexico Consortium, Los Alamos, NM USA..
    Horne, R. B.
    British Antarctic Survey, Cambridge, England..
    Specification of the near-Earth space environment with SHIELDS2018Ingår i: Journal of Atmospheric and Solar-Terrestrial Physics, ISSN 1364-6826, E-ISSN 1879-1824, Vol. 177, s. 148-159Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Predicting variations in the near-Earth space environment that can lead to spacecraft damage and failure is one example of "space weather" and a big space physics challenge. A project recently funded through the Los Alamos National Laboratory (LANL) Directed Research and Development (LDRD) program aims at developing a new capability to understand, model, and predict Space Hazards Induced near Earth by Large Dynamic Storms, the SHIELDS framework. The project goals are to understand the dynamics of the surface charging environment (SCE), the hot (keV) electrons representing the source and seed populations for the radiation belts, on both macro and micro-scale. Important physics questions related to particle injection and acceleration associated with magnetospheric storms and substorms, as well as plasma waves, are investigated. These challenging problems are addressed using a team of world-class experts in the fields of space science and computational plasma physics, and state-of-the-art models and computational facilities. A full two-way coupling of physics-based models across multiple scales, including a global MHD (BATS-R-US) embedding a particle-in-cell (iPIC3D) and an inner magnetosphere (RAM-SCB) codes, is achieved. New data assimilation techniques employing in situ satellite data are developed; these provide an order of magnitude improvement in the accuracy in the simulation of the SCE. SHIELDS also includes a post-processing tool designed to calculate the surface charging for specific spacecraft geometry using the Curvilinear Particle-In-Cell (CPIC) code that can be used for reanalysis of satellite failures or for satellite design.

  • 46.
    Kisner, Alexandre
    et al.
    NIDA, Neuronal Circuits & Behav Unit, Intramural Res Program, NIH, Baltimore, MD 21224 USA..
    Slocomb, Julia E.
    NIDA, Neuronal Circuits & Behav Unit, Intramural Res Program, NIH, Baltimore, MD 21224 USA..
    Sarsfield, Sarah
    NIDA, Neuronal Circuits & Behav Unit, Intramural Res Program, NIH, Baltimore, MD 21224 USA..
    Zuccoli, Maria Laura
    NIDA, Neuronal Circuits & Behav Unit, Intramural Res Program, NIH, Baltimore, MD 21224 USA.;Univ Genoa, Dept Internal Med, Pharmacol & Toxicol Unit, Genoa, Italy..
    Siemian, Justin
    NIDA, Neuronal Circuits & Behav Unit, Intramural Res Program, NIH, Baltimore, MD 21224 USA..
    Gupta, Jay F.
    NIDA, Neuronal Circuits & Behav Unit, Intramural Res Program, NIH, Baltimore, MD 21224 USA..
    Kumar, Arvind
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Aponte, Yeka
    NIDA, Neuronal Circuits & Behav Unit, Intramural Res Program, NIH, Baltimore, MD 21224 USA.;Johns Hopkins Univ, Sch Med, Solomon H Snyder Dept Neurosci, Baltimore, MD 21218 USA..
    Electrophysiological properties and projections of lateral hypothalamic parvalbumin positive neurons2018Ingår i: PLoS ONE, ISSN 1932-6203, E-ISSN 1932-6203, Vol. 13, nr 6, artikel-id e0198991Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Cracking the cytoarchitectural organization, activity patterns, and neurotransmitter nature of genetically-distinct cell types in the lateral hypothalamus (LH) is fundamental to develop a mechanistic understanding of how activity dynamics within this brain region are generated and operate together through synaptic connections to regulate circuit function. However, the precise mechanisms through which LH circuits orchestrate such dynamics have remained elusive due to the heterogeneity of the intermingled and functionally distinct cell types in this brain region. Here we reveal that a cell type in the mouse LH identified by the expression of the calcium-binding protein parvalbumin (PVALB; LHPV) is fast-spiking, releases the excitatory neurotransmitter glutamate, and sends long range projections throughout the brain. Thus, our findings challenge long-standing concepts that define neurons with a fast-spiking phenotype as exclusively GABAergic. Furthermore, we provide for the first time a detailed characterization of the electrophysiological properties of these neurons. Our work identifies LHPV neurons as a novel functional component within the LH glutamatergic circuitry.

  • 47.
    Köpp, Wiebke
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Weinkauf, Tino
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Temporal Treemaps: Static Visualization of Evolving Trees2019Ingår i: IEEE Transactions on Visualization and Computer Graphics, ISSN 1077-2626, E-ISSN 1941-0506, Vol. 25, nr 1, s. 534-543Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We consider temporally evolving trees with changing topology and data: tree nodes may persist for a time range, merge or split, and the associated data may change. Essentially, one can think of this as a time series of trees with a node correspondence per hierarchy level between consecutive time steps. Existing visualization approaches for such data include animated 2D treemaps, where the dynamically changing layout makes it difficult to observe the data in its entirety. We present a method to visualize this dynamic data in a static, nested, and space-filling visualization. This is based on two major contributions: First, the layout constitutes a graph drawing problem. We approach it for the entire time span at once using a combination of a heuristic and simulated annealing. Second, we propose a rendering that emphasizes the hierarchy through an adaption of the classic cushion treemaps. We showcase the wide range of applicability using data from feature tracking in time-dependent scalar fields, evolution of file system hierarchies, and world population.

  • 48.
    Li, Chengjie
    et al.
    KTH.
    Androulakaki, Theofronia
    KTH.
    Gao, Alex Yuan
    Yang, Fangkai
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Saikia, Himangshu
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Peters, Christopher
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Skantze, Gabriel
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Tal, musik och hörsel, TMH.
    Effects of Posture and Embodiment on Social Distance in Human-Agent Interaction in Mixed Reality2018Ingår i: Proceedings of the 18th International Conference on Intelligent Virtual Agents, ACM Digital Library, 2018, s. 191-196Konferensbidrag (Refereegranskat)
    Abstract [en]

    Mixed reality offers new potentials for social interaction experiences with virtual agents. In addition, it can be used to experiment with the design of physical robots. However, while previous studies have investigated comfortable social distances between humans and artificial agents in real and virtual environments, there is little data with regards to mixed reality environments. In this paper, we conducted an experiment in which participants were asked to walk up to an agent to ask a question, in order to investigate the social distances maintained, as well as the subject's experience of the interaction. We manipulated both the embodiment of the agent (robot vs. human and virtual vs. physical) as well as closed vs. open posture of the agent. The virtual agent was displayed using a mixed reality headset. Our experiment involved 35 participants in a within-subject design. We show that, in the context of social interactions, mixed reality fares well against physical environments, and robots fare well against humans, barring a few technical challenges.

  • 49.
    Li, Jing-Rebecca
    et al.
    INRIA Saclay, Equipe DEFI, CMAP, Ecole Polytechnique, Route de Saclay, 91128 Palaiseau Cedex, France.
    Nguyen, Van Dang
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Tran, Try Nguyen
    INRIA Saclay, Equipe DEFI, CMAP, Ecole Polytechnique, Route de Saclay, 91128 Palaiseau Cedex, France.
    Valdman, Jan
    Institute of Mathematics, Faculty of Science, University of South Bohemia, Ceske Budejovice and Institute of Information Theory and Automation of the ASCR, Prague, Czech Republic.
    Trang, Bang Cong
    INRIA Saclay, Equipe DEFI, CMAP, Ecole Polytechnique, Route de Saclay, 91128 Palaiseau Cedex, France.
    Nguyen, Khieu Van
    INRIA Saclay, Equipe DEFI, CMAP, Ecole Polytechnique, Route de Saclay, 91128 Palaiseau Cedex, France.
    Thach Son, Vu Duc
    INRIA Saclay, Equipe DEFI, CMAP, Ecole Polytechnique, Route de Saclay, 91128 Palaiseau Cedex, France.
    Tran, Hoang An
    INRIA Saclay, Equipe DEFI, CMAP, Ecole Polytechnique, Route de Saclay, 91128 Palaiseau Cedex, France.
    Tran, Hoang Trong An
    INRIA Saclay, Equipe DEFI, CMAP, Ecole Polytechnique, Route de Saclay, 91128 Palaiseau Cedex, France.
    Nguyen, Thi Minh Phuong
    INRIA Saclay, Equipe DEFI, CMAP, Ecole Polytechnique, Route de Saclay, 91128 Palaiseau Cedex, France.
    SpinDoctor: a Matlab toolbox for diffusion MRI simulation2019Ingår i: NeuroImage, ISSN 1053-8119, E-ISSN 1095-9572, ISSN 1053-8119, Vol. 202, artikel-id 116120Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The complex transverse water proton magnetization subject to diffusion-encoding magnetic field gradient pulses in a heterogeneous medium can be modeled by the multiple compartment Bloch-Torrey partial differential equation (BTPDE). A mathematical model for the time-dependent apparent diffusion coefficient (ADC), called the H-ADC model, was obtained recently using homogenization techniques on the BTPDE. Under the assumption of negligible water exchange between compartments, the H-ADC model produces the ADC of a diffusion medium from the solution of a diffusion equation (DE) subject to a time-dependent Neumann boundary condition. This paper describes a publicly available Matlab toolbox called SpinDoctor that can be used 1) to solve the BTPDE to obtain the dMRI signal (the toolbox provides a way of robustly fitting the dMRI signal to obtain the fitted ADC); 2) to solve the DE of the H-ADC model to obtain the ADC; 3) a short-time approximation formula for the ADC is also included in the toolbox for comparison with the simulated ADC. The PDEs are solved by P 1 finite elements combined with built-in Matlab routines for solving ordinary differential equations. The finite element mesh generation is performed using an external package called Tetgen that is included in the toolbox. SpinDoctor provides built-in options of including 1) spherical cells with a nucleus; 2) cylindrical cells with a myelin layer; 3) an extra-cellular space (ECS) enclosed either a) in a box or b) in a tight wrapping around the cells; 4) deformation of canonical cells by bending and twisting. 5) permeable membranes for the BT-PDE (the H-ADC assumes negligible permeability). Built-in diffusion-encoding pulse sequences include the Pulsed Gradient Spin Echo and the Oscillating Gradient Spin Echo.

  • 50.
    Lindeberg, Tony
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Beräkningsvetenskap och beräkningsteknik (CST).
    Dense scale selection over space, time and space-time2018Ingår i: SIAM Journal on Imaging Sciences, ISSN 1936-4954, E-ISSN 1936-4954, Vol. 11, nr 1, s. 407-441Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Scale selection methods based on local extrema over scale of scale-normalized derivatives have been primarily developed to be applied sparsely---at image points where the magnitude of a scale-normalized differential expression additionally assumes local extrema over the domain where the data are defined. This paper presents a methodology for performing dense scale selection, so that hypotheses about local characteristic scales in images, temporal signals, and video can be computed at every image point and every time moment. A critical problem when designing mechanisms for dense scale selection is that the scale at which scale-normalized differential entities assume local extrema over scale can be strongly dependent on the local order of the locally dominant differential structure. To address this problem, we propose a methodology where local extrema over scale are detected of a quasi quadrature measure involving scale-space derivatives up to order two and propose two independent mechanisms to reduce the phase dependency of the local scale estimates by (i) introducing a second layer of postsmoothing prior to the detection of local extrema over scale, and (ii) performing local phase compensation based on a model of the phase dependency of the local scale estimates depending on the relative strengths between first- and second-order differential structures. This general methodology is applied over three types of domains: (i) spatial images, (ii) temporal signals, and (iii) spatio-temporal video. Experiments demonstrate that the proposed methodology leads to intuitively reasonable results with local scale estimates that reflect variations in the characteristic scales of locally dominant structures over space and time.

123 1 - 50 av 116
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf