kth.sePublikationer
Ändra sökning
Avgränsa sökresultatet
1234567 1 - 50 av 601
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. Abrams, M. B.
    et al.
    Bjaalie, J. G.
    Das, S.
    Egan, G. F.
    Ghosh, S. S.
    Goscinski, W. J.
    Grethe, J. S.
    Hellgren Kotaleski, Jeanette
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Ho, E. T. W.
    Kennedy, D. N.
    Lanyon, L. J.
    Leergaard, T. B.
    Mayberg, H. S.
    Milanesi, L.
    Mouček, R.
    Poline, J. B.
    Roy, P. K.
    Strother, S. C.
    Tang, T. B.
    Tiesinga, P.
    Wachtler, T.
    Wójcik, D. K.
    Martone, M. E.
    A Standards Organization for Open and FAIR Neuroscience: the International Neuroinformatics Coordinating Facility2021Ingår i: Neuroinformatics, ISSN 1539-2791, E-ISSN 1559-0089Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    There is great need for coordination around standards and best practices in neuroscience to support efforts to make neuroscience a data-centric discipline. Major brain initiatives launched around the world are poised to generate huge stores of neuroscience data. At the same time, neuroscience, like many domains in biomedicine, is confronting the issues of transparency, rigor, and reproducibility. Widely used, validated standards and best practices are key to addressing the challenges in both big and small data science, as they are essential for integrating diverse data and for developing a robust, effective, and sustainable infrastructure to support open and reproducible neuroscience. However, developing community standards and gaining their adoption is difficult. The current landscape is characterized both by a lack of robust, validated standards and a plethora of overlapping, underdeveloped, untested and underutilized standards and best practices. The International Neuroinformatics Coordinating Facility (INCF), an independent organization dedicated to promoting data sharing through the coordination of infrastructure and standards, has recently implemented a formal procedure for evaluating and endorsing community standards and best practices in support of the FAIR principles. By formally serving as a standards organization dedicated to open and FAIR neuroscience, INCF helps evaluate, promulgate, and coordinate standards and best practices across neuroscience. Here, we provide an overview of the process and discuss how neuroscience can benefit from having a dedicated standards body.

  • 2.
    Acharjee, Animesh
    et al.
    Univ Birmingham, Coll Med & Dent Sci, Inst Canc & Genom Sci, Birmingham B15 2TT, W Midlands, England.;Fdn Trust, Univ Hosp Birmingham NHS, Inst Translat Med, Birmingham B15 2TT, W Midlands, England.;Univ Hosp Birmingham, NIHR Surg Reconstruct & Microbiol Res Ctr, Birmingham B15 2WB, W Midlands, England..
    Agarwal, Prasoon
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Nash, Katrina
    Univ Birmingham, Coll Med & Dent Sci, Birmingham B15 2TT, W Midlands, England..
    Bano, Subia
    Elvesys Microfluid Innovat Ctr, F-75011 Paris, France..
    Rahmans, Taufiq
    Univ Cambridge, Dept Pharmacol, Tennis Court Rd, Cambridge CB2 1PD, England..
    Gkoutos, Georgios, V
    Univ Birmingham, Coll Med & Dent Sci, Inst Canc & Genom Sci, Birmingham B15 2TT, W Midlands, England.;Fdn Trust, Univ Hosp Birmingham NHS, Inst Translat Med, Birmingham B15 2TT, W Midlands, England.;Univ Hosp Birmingham, NIHR Surg Reconstruct & Microbiol Res Ctr, Birmingham B15 2WB, W Midlands, England.;MRC Hlth Data Res UK HDR UK, London, England.;NIHR Expt Canc Med Ctr, Birmingham B15 2TT, W Midlands, England.;Univ Hosp Birmingham, NIHR Biomed Res Ctr, Birmingham B15 2TT, W Midlands, England..
    Immune infiltration and prognostic and diagnostic use of LGALS4 in colon adenocarcinoma and bladder urothelial carcinoma2021Ingår i: American Journal of Translational Research, E-ISSN 1943-8141, Vol. 13, nr 10, s. 11353-11363Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Colon adenocarcinoma (COAD) is a common tumor of the gastrointestinal tract with a high mortality rate. Current research has identified many genes associated with immune infiltration that play a vital role in the development of COAD. In this study, we analysed the prognostic and diagnostic features of such immune-related genes in the context of colonic adenocarcinoma (COAD). We analysed 17 overlapping gene expression profiles of COAD and healthy samples obtained from TCGA-COAD and public single-cell sequencing resources, to identify potential therapeutic COAD targets. We evaluated the abundance of immune infiltration with those genes using the TIMER (Tumor Immune Estimation Resource) deconvolution method. Subsequently, we developed predictive and survival models to assess the prognostic value of these genes. The LGALS4 (Galectin-4) gene was found to be significantly (P<0.05) downregulated in COAD and bladder urothelial carcinoma (BLCA) compared to healthy samples. We identified LGALS4 as a prognostic and diagnostic marker for multiple cancer types, including COAD and BLCA. Our analysis reveals a series of novel candidate drug targets, as well as candidate molecular markers, that may explain the pathogenesis of COAD and BLCA. LGALS4 gene is associated with multiple cancer types and is a possible prognostic, as well as diagnostic, marker of COAD and BLCA.

  • 3.
    Adhi, Boma
    et al.
    Center for Computational Science (R-CCS), RIKEN, Japan.
    Cortes, Carlos
    Center for Computational Science (R-CCS), RIKEN, Japan.
    Sozzo, Emanuele Del
    Center for Computational Science (R-CCS), RIKEN, Japan.
    Ueno, Tomohiro
    Center for Computational Science (R-CCS), RIKEN, Japan.
    Tan, Yiyu
    Iwate University, Faculty of Science and Engineering, Japan.
    Kojima, Takuya
    Center for Computational Science (R-CCS), RIKEN, Japan; The University of Tokyo, Graduate School of Information Science and Technology, Japan.
    Podobas, Artur
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Sano, Kentaro
    Center for Computational Science (R-CCS), RIKEN, Japan.
    Less for more: reducing intra-cgra connectivity for higher performance and efficiency in hpc2023Ingår i: 2023 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2023, Institute of Electrical and Electronics Engineers (IEEE) , 2023, s. 452-459Konferensbidrag (Refereegranskat)
    Abstract [en]

    Coarse-Grained Reconfigurable Arrays (CGRAs) are a class of reconfigurable architectures that inherit the performance of Domain-specific accelerators and the reconfigurability aspects of Field-Programmable Gate Arrays (FPGAs). Historically, CGRAs have been successfully used to accelerate embedded applications and are now considered to accelerate High-Performance Computing (HPC) applications in future supercomputers. However, embedded systems and supercomputers are two vastly different domains with different applications and constraints, and it is today not fully understood what CGRA design decisions adequately cater to the HPC market. One such unknown design decision is regarding the interconnect that facilitates intra-CGRA communication. Our findings show that even the typical king-style mesh-like topology is often under-utilized with a typical HPC workload, leading to inefficiency. This research aims to explore the provisioning of intra-CGRA interconnect for HPC-oriented workloads and, ultimately, recoup the potential performance and efficiency lost by reducing the interconnect complexity. We proposed several reduced interconnect topologies based on the usage statistic. Then we evaluate the tradeoffs regarding hardware cost, routability of DFGs, and computational throughput.

  • 4.
    Adhi, Boma
    et al.
    RIKEN, Ctr Computat Sci R CCS, Wako, Saitama, Japan..
    Cortes, Carlos
    RIKEN, Ctr Computat Sci R CCS, Wako, Saitama, Japan..
    Tan, Yiyu
    RIKEN, Ctr Computat Sci R CCS, Wako, Saitama, Japan..
    Kojima, Takuya
    RIKEN, Ctr Computat Sci R CCS, Wako, Saitama, Japan.;Univ Tokyo, Grad Sch Informat Sci & Technol, Tokyo, Japan..
    Podobas, Artur
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Sano, Kentaro
    RIKEN, Ctr Computat Sci R CCS, Wako, Saitama, Japan..
    Exploration Framework for Synthesizable CGRAs Targeting HPC: Initial Design and Evaluation2022Ingår i: 2022 IEEE 36Th International Parallel And Distributed Processing Symposium Workshops (IPDPSW 2022), Institute of Electrical and Electronics Engineers (IEEE) , 2022, s. 639-646Konferensbidrag (Refereegranskat)
    Abstract [en]

    Among the more salient accelerator technologies to continue performance scaling in High-Performance Computing (HPC) are Coarse-Grained Reconfigurable Arrays (CGRAs). However, what benefits CGRAs will bring to HPC workloads and how those benefits will be reaped is an open research question today. In this work, we propose a framework to explore the design space of CGRAs for HPC workloads, which includes a tool flow of compilation and simulation, a CGRA HDL library written in SystemVerilog, and a synthesizable CGRA design as a baseline. Using RTL simulation, we evaluate two well-known computation kernels with the baseline CGRA for multiple different architectural parameters. The simulation results demonstrate both correctness and usefulness of our exploration framework.

  • 5.
    Adhi, Boma
    et al.
    RIKEN, Ctr Computat Sci R CCS, Kobe, Hyogo, Japan..
    Cortes, Carlos
    RIKEN, Ctr Computat Sci R CCS, Kobe, Hyogo, Japan..
    Tan, Yiyu
    Iwate Univ, Dept Syst Innovat Engn, Sci & Engn, Morioka, Iwate, Japan..
    Kojima, Takuya
    RIKEN, Ctr Computat Sci R CCS, Kobe, Hyogo, Japan.;Univ Tokyo, Grad Sch Informat Sci & Technol, Tokyo, Japan..
    Podobas, Artur
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Sano, Kentaro
    RIKEN, Ctr Computat Sci R CCS, Kobe, Hyogo, Japan..
    The Cost of Flexibility: Embedded versus Discrete Routers in CGRAs for HPC2022Ingår i: 2022 IEEE INTERNATIONAL CONFERENCE ON CLUSTER COMPUTING (CLUSTER 2022), Institute of Electrical and Electronics Engineers (IEEE) , 2022, s. 347-356Konferensbidrag (Refereegranskat)
    Abstract [en]

    Coarse-Grained Reconfigurable Arrays (CGRAs) are a class of reconfigurable architectures that inherit the performance and usability properties of Central Processing Units (CPUs) and the reconfigurability aspects of Field-Programmable Gate Arrays (FPGAs). Historically, CGRAs have been successfully used to accelerate embedded applications and are today also being considered to accelerate High-Performance Computing (HPC) applications in future supercomputers. However, embedded systems and supercomputers are two vastly different domains with different applications and constraints, and it is today not fully understood what CGRA design decisions adequately cater to the HPC market. One such unknown design decision is regarding the interconnect that facilitates intra-CGRA communication. Today, intra-CGRA communication comes in two flavors: using routers closely embedded into the compute units or using discrete routers outside the compute units. The former trades flexibility for a reduction in hardware cost, while the latter has greater flexibility but is more resource hungry. In this paper, we aspire to understand which of both designs best suits the CGRA HPC segment. We extend our previous methodology, which consists of both a parameterized CGRA design and an OpenMP-capable compiler, to accommodate both types of routing designs, including verification tests using RTL simulation. Our results show that the discrete router design can facilitate better use of processing elements (PEs) compared to embedded routers and can achieve up to 79.27% reduction in unnecessary PE occupancy for an aggressively unrolled stencil kernel on a 18 x 16 CGRA at a (estimated) hardware resource overhead cost of 6.3x. This reduction in PE occupancy can be used, for example, to exploit instruction-level parallelism (ILP) through even more aggressive unrolling.

  • 6.
    Adhi, Boma
    et al.
    Center for Computational Science (R-CCS), RIKEN, Japan.
    Cortes, Carlos
    Center for Computational Science (R-CCS), RIKEN, Japan.
    Ueno, Tomohiro
    Center for Computational Science (R-CCS), RIKEN, Japan.
    Tan, Yiyu
    Iwate University, Department of Systems Innovation Engineering, Japan.
    Kojima, Takuya
    Graduate School of Information Science and Technology, The University of Tokyo, Japan.
    Podobas, Artur
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Sano, Kentaro
    Center for Computational Science (R-CCS), RIKEN, Japan.
    Exploring Inter-tile Connectivity for HPC-oriented CGRA with Lower Resource Usage2022Ingår i: FPT 2022: 21st International Conference on Field-Programmable Technology, Proceedings, Institute of Electrical and Electronics Engineers (IEEE) , 2022Konferensbidrag (Refereegranskat)
    Abstract [en]

    This research aims to explore the tradeoffs between routing flexibility and hardware resource usage, ultimately reducing the resource usage of our CGRA architecture while maintaining compute efficiency. we investigate statistics of connection usages among switch blocks for benchmark DFGs, propose several CGRA architecture with a reduced connection, and evaluate their hardware cost, routability of DFGs, and computational throughput for benchmarks. We found that the topology with horizontal plus diagonal connection saves about 30% of the resource usage while maintaining virtually the same routing flexibility as the full connectivity topology.

  • 7.
    Afzal, Ayesha
    et al.
    Erlangen Natl High Performance Comp Ctr NHR FAU, D-91058 Erlangen, Germany.;Friedrich Alexander Univ Erlangen Nurnberg, Dept Comp Sci, D-91058 Erlangen, Germany..
    Hager, Georg
    Erlangen Natl High Performance Comp Ctr NHR FAU, D-91058 Erlangen, Germany..
    Markidis, Stefano
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Wellein, Gerhard
    Erlangen Natl High Performance Comp Ctr NHR FAU, D-91058 Erlangen, Germany.;Friedrich Alexander Univ Erlangen Nurnberg, Dept Comp Sci, D-91058 Erlangen, Germany..
    Making applications faster by asynchronous execution: Slowing down processes or relaxing MPI collectives2023Ingår i: Future generations computer systems, ISSN 0167-739X, E-ISSN 1872-7115, Vol. 148, s. 472-487Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Comprehending the performance bottlenecks at the core of the intricate hardware-software inter-actions exhibited by highly parallel programs on HPC clusters is crucial. This paper sheds light on the issue of automatically asynchronous MPI communication in memory-bound parallel programs on multicore clusters and how it can be facilitated. For instance, slowing down MPI processes by deliberate injection of delays can improve performance if certain conditions are met. This leads to the counter-intuitive conclusion that noise, independent of its source, is not always detrimental but can be leveraged for performance improvements. We employ phase-space graphs as a new tool to visualize parallel program dynamics. They are useful in spotting certain patterns in parallel execution that will easily go unnoticed with traditional tracing tools. We investigate five different microbenchmarks and applications on different supercomputer platforms: an MPI-augmented STREAM Triad, two implementations of Lattice-Boltzmann fluid solvers (D3Q19 and SPEChpc D2Q37), the LULESH and HPCG proxy applications.

  • 8.
    Afzal, Ayesha
    et al.
    Erlangen National High Performance Computing Center (NHR@FAU), 91058, Erlangen, Germany.
    Hager, Georg
    Erlangen National High Performance Computing Center (NHR@FAU), 91058, Erlangen, Germany.
    Wellein, Gerhard
    Erlangen National High Performance Computing Center (NHR@FAU), 91058, Erlangen, Germany; Department of Computer Science, University of Erlangen-Nürnberg, 91058, Erlangen, Germany.
    Markidis, Stefano
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Exploring Techniques for the Analysis of Spontaneous Asynchronicity in MPI-Parallel Applications2023Ingår i: Parallel Processing and Applied Mathematics - 14th International Conference, PPAM 2022, Revised Selected Papers, Springer Nature , 2023, s. 155-170Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper studies the utility of using data analytics and machine learning techniques for identifying, classifying, and characterizing the dynamics of large-scale parallel (MPI) programs. To this end, we run microbenchmarks and realistic proxy applications with the regular compute-communicate structure on two different supercomputing platforms and choose the per-process performance and MPI time per time step as relevant observables. Using principal component analysis, clustering techniques, correlation functions, and a new “phase space plot,” we show how desynchronization patterns (or lack thereof) can be readily identified from a data set that is much smaller than a full MPI trace. Our methods also lead the way towards a more general classification of parallel program dynamics.

  • 9.
    Aghanoori, Mohamad-Reza
    et al.
    St Boniface Gen Hosp, Albrechtsen Res Ctr, Div Neurodegenerat Disorders, Winnipeg, MB, Canada.;Univ Manitoba, Dept Pharmacol & Therapeut, Winnipeg, MB, Canada.;Univ Calgary, Cumming Sch Med, Dept Med Genet, 3330 Hosp Dr NW, Calgary, AB T2N 4N2, Canada..
    Agarwal, Prasoon
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST). Univ Manitoba, Dept Pharmacol & Therapeut, Winnipeg, MB, Canada.;Univ Manitoba, Childrens Hosp Res Inst Manitoba, Winnipeg, MB, Canada..
    Gauvin, Evan
    St Boniface Gen Hosp, Albrechtsen Res Ctr, Div Neurodegenerat Disorders, Winnipeg, MB, Canada..
    Nagalingam, Raghu S.
    Univ Manitoba, Rady Fac Hlth Sci, Dept Physiol & Pathophysiol, Winnipeg, MB, Canada.;St Boniface Gen Hosp, Inst Cardiovasc Sci, Albrechtsen Res Ctr, Winnipeg, MB, Canada..
    Bonomo, Raiza
    Loyola Univ, Cellular & Mol Dept, Stritch Sch Med, Chicago, IL 60611 USA..
    Yathindranath, Vinith
    Univ Manitoba, Kleysen Inst Adv Med, Winnipeg, MB, Canada..
    Smith, Darrell R.
    St Boniface Gen Hosp, Albrechtsen Res Ctr, Div Neurodegenerat Disorders, Winnipeg, MB, Canada..
    Hai, Yan
    Univ Manitoba, Rady Fac Hlth Sci, Dept Biochem & Med Genet, Winnipeg, MB, Canada..
    Lee, Samantha
    Univ Manitoba, Rady Fac Hlth Sci, Dept Biochem & Med Genet, Winnipeg, MB, Canada..
    Jolivalt, Corinne G.
    Univ Calif San Diego, Dept Pathol, San Diego, CA USA..
    Calcutt, Nigel A.
    Univ Calif San Diego, Dept Pathol, San Diego, CA USA..
    Jones, Meaghan J.
    Univ Manitoba, Rady Fac Hlth Sci, Dept Biochem & Med Genet, Winnipeg, MB, Canada..
    Czubryt, Michael P.
    Univ Manitoba, Rady Fac Hlth Sci, Dept Physiol & Pathophysiol, Winnipeg, MB, Canada.;St Boniface Gen Hosp, Inst Cardiovasc Sci, Albrechtsen Res Ctr, Winnipeg, MB, Canada..
    Miller, Donald W.
    Univ Manitoba, Kleysen Inst Adv Med, Winnipeg, MB, Canada..
    Dolinsky, Vernon W.
    Univ Manitoba, Dept Pharmacol & Therapeut, Winnipeg, MB, Canada.;Univ Manitoba, Childrens Hosp Res Inst Manitoba, Winnipeg, MB, Canada..
    Mansuy-Aubert, Virginie
    Loyola Univ, Cellular & Mol Dept, Stritch Sch Med, Chicago, IL 60611 USA..
    Fernyhough, Paul
    St Boniface Gen Hosp, Albrechtsen Res Ctr, Div Neurodegenerat Disorders, Winnipeg, MB, Canada.;Univ Manitoba, Dept Pharmacol & Therapeut, Winnipeg, MB, Canada..
    CEBP beta regulation of endogenous IGF-1 in adult sensory neurons can be mobilized to overcome diabetes-induced deficits in bioenergetics and axonal outgrowth2022Ingår i: Cellular and Molecular Life Sciences (CMLS), ISSN 1420-682X, E-ISSN 1420-9071, Vol. 79, nr 4, artikel-id 193Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Aberrant insulin-like growth factor 1 (IGF-1) signaling has been proposed as a contributing factor to the development of neurodegenerative disorders including diabetic neuropathy, and delivery of exogenous IGF-1 has been explored as a treatment for Alzheimer's disease and amyotrophic lateral sclerosis. However, the role of autocrine/paracrine IGF-1 in neuroprotection has not been well established. We therefore used in vitro cell culture systems and animal models of diabetic neuropathy to characterize endogenous IGF-1 in sensory neurons and determine the factors regulating IGF-1 expression and/or affecting neuronal health. Single-cell RNA sequencing (scRNA-Seq) and in situ hybridization analyses revealed high expression of endogenous IGF-1 in non-peptidergic neurons and satellite glial cells (SGCs) of dorsal root ganglia (DRG). Brain cortex and DRG had higher IGF-1 gene expression than sciatic nerve. Bidirectional transport of IGF-1 along sensory nerves was observed. Despite no difference in IGF-1 receptor levels, IGF-1 gene expression was significantly (P < 0.05) reduced in liver and DRG from streptozotocin (STZ)-induced type 1 diabetic rats, Zucker diabetic fatty (ZDF) rats, mice on a high-fat/ high-sugar diet and db/db type 2 diabetic mice. Hyperglycemia suppressed IGF-1 gene expression in cultured DRG neurons and this was reversed by exogenous IGF-1 or the aldose reductase inhibitor sorbinil. Transcription factors, such as NFAT1 and CEBP beta, were also less enriched at the IGF-1 promoter in DRG from diabetic rats vs control rats. CEBP beta overexpression promoted neurite outgrowth and mitochondrial respiration, both of which were blunted by knocking down or blocking IGF-1. Suppression of endogenous IGF-1 in diabetes may contribute to neuropathy and its upregulation at the transcriptional level by CEBP beta can be a promising therapeutic approach.

  • 10.
    Aghdam, Rosa
    et al.
    Inst Res Fundamental Sci IPM, Sch Biol Sci, Tehran, Iran..
    Habibi, Mahnaz
    Islamic Azad Univ, Dept Math, Qazvin Branch, Qazvin, Iran..
    Taheri, Golnaz
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST). KTH, Centra, Science for Life Laboratory, SciLifeLab.
    Using informative features in machine learning based method for COVID-19 drug repurposing2021Ingår i: Journal of Cheminformatics, E-ISSN 1758-2946, Vol. 13, nr 1, artikel-id 70Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Coronavirus disease 2019 (COVID-19) is caused by a novel virus named Severe Acute Respiratory Syndrome Coronavirus-2 (SARS-CoV-2). This virus induced a large number of deaths and millions of confirmed cases worldwide, creating a serious danger to public health. However, there are no specific therapies or drugs available for COVID-19 treatment. While new drug discovery is a long process, repurposing available drugs for COVID-19 can help recognize treatments with known clinical profiles. Computational drug repurposing methods can reduce the cost, time, and risk of drug toxicity. In this work, we build a graph as a COVID-19 related biological network. This network is related to virus targets or their associated biological processes. We select essential proteins in the constructed biological network that lead to a major disruption in the network. Our method from these essential proteins chooses 93 proteins related to COVID-19 pathology. Then, we propose multiple informative features based on drug-target and protein-protein interaction information. Through these informative features, we find five appropriate clusters of drugs that contain some candidates as potential COVID-19 treatments. To evaluate our results, we provide statistical and clinical evidence for our candidate drugs. From our proposed candidate drugs, 80% of them were studied in other studies and clinical trials.

  • 11.
    Aguilar, Xavier
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST). KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, Parallelldatorcentrum, PDC.
    Performance Monitoring, Analysis, and Real-Time Introspection on Large-Scale Parallel Systems2020Doktorsavhandling, monografi (Övrigt vetenskapligt)
    Abstract [sv]

    HPC (högpresterande datorer) har idag blivit ett nödvändigt verktyg för stora forskningsprojekt inom olika områden såsom läkemedelsdesign, klimat- modellering mm. Den enorma datorkraften hos HPC-system har dessutom gjort det möjligt för forskare att simulera problem som var otänkbara för en- dast några år sedan. Det finns dock ett problem. Den ökande komplexiteten hos HPC-system medför att utvecklingen av effektiv mjukvara kapabel att ut- nyttja dessa resurser blir utmanande. Användningen av prestandaövervakning och mjukvaruanalys måste därför spela en viktig roll för att avslöja prestand- aproblem i parallella system. Utveckling av prestandaverktyg står dock också inför liknande utmaningar och måste kunna hantera allt växande mängder genererade data.

    I denna avhandling föreslår vi en ny modell för prestandakaraktärisering av MPI applikationer för att försöka lösa problemet med stora datamängder. Vår metod använder sig av “Event Flow” grafer för att balansera mellan skal- barheten av profileringsmetoder, dvs prestandadata av aggregerade mätvär- den, med informationen från spårningsmetoder, dvs filer med tidsstämplade händelser. Dessa grafer tillåter oss att koda händelserna och därmed minskar behovet av lagring, vilket leder till utnyttjande av mycket mindre minne och diskutrymme, och slutligen till ökad skalbarhet. Vi demonstrerar även i denna avhandling hur vår “Event Flow” grafmodell kan användas för spårkompri- mering. Dessutom föreslår vi en ny metod som använder “Event Flow” grafer för att automatiskt undersöka strukturen hos MPI-applikationer. Denna kun- skap kan i efterhand användas för att samla in prestandadata på ett smartare sätt och minskar mängden redundanta data som samlas in. Slutligen visar vi att våra grafer kan användas inom andra områden, utöver spårkomprime- ring och automatiskt analys av prestandadata, dvs för att utforska visuella prestandadata.

    Förutom ”Event Flow” grafer undersöker vi i denna avhandling även de- signen och användningen av ramverk för introspektion av prestanda. Framtida HPC-system kommer att vara mycket dynamiska miljöer kapabla till extrema nivåer av parallelism, men med en begränsad energikonsumtion, betydande resursfördelning och heterogen hårdvara. Användningen av realtidsdata för att orkestrera exekvering av program i så komplexa och dynamiska miljöer kommer att bli en nödvändighet. Den här avhandlingen presenterar två oli- ka ramverk för introspektion av prestandadata. Dessa ramverk är enkla att använda, ger prestandadata i realtid och kräver få resurser. Vi demonstrerar bland annat hur vårt tillvägagångssätt kan användas för att i realtid minska systemets energikonsumtion.

    De metoder som föreslås i denna avhandling har bekräftats på olika stor- skaliga HPC-system med många kärnor såväl som gentemot nutida vetenskap- liga applikationer. Experimenten visar att våra metoder, när det gäller pre- standakarakterisering och introspektion av prestandadata, inte är resurskrä- vande och kan bidra till prestandaövervakning av framtida HPC-system.

    Ladda ner fulltext (pdf)
    fulltext
  • 12.
    Aguilar, Xavier
    et al.
    KTH, Centra, SeRC - Swedish e-Science Research Centre. KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, 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), Datavetenskap, 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.

  • 13.
    Aguilar, Xavier
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, Parallelldatorcentrum, PDC.
    Markidis, Stefano
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    A Deep Learning-Based Particle-in-Cell Method for Plasma Simulations2021Ingår i: 2021 IEEE International Conference On Cluster Computing (CLUSTER 2021), Institute of Electrical and Electronics Engineers (IEEE) , 2021, s. 692-697Konferensbidrag (Refereegranskat)
    Abstract [en]

    We design and develop a new Particle-in-Cell (PIC) method for plasma simulations using Deep-Learning (DL) to calculate the electric field from the electron phase space. We train a Multilayer Perceptron (MLP) and a Convolutional Neural Network (CNN) to solve the two-stream instability test. We verify that the DL-based MLP PIC method produces the correct results using the two-stream instability: the DL-based PIC provides the expected growth rate of the two-stream instability. The DL-based PIC does not conserve the total energy and momentum. However, the DL-based PIC method is stable against the cold-beam instability, affecting traditional PIC methods. This work shows that integrating DL technologies into traditional computational methods is a viable approach for developing next-generation PIC algorithms.

  • 14.
    Ahmed, Laeeq
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, 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.

    Ladda ner fulltext (pdf)
    fulltext
  • 15.
    Ahmed, Laeeq
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Alogheli, Hiba
    Uppsala Univ, Dept Pharmaceut Biosci, Box 591, S-75124 Uppsala, Sweden..
    McShane, Staffan Arvidsson
    Uppsala Univ, Dept Pharmaceut Biosci, Box 591, S-75124 Uppsala, Sweden..
    Alvarsson, Jonathan
    Uppsala Univ, Dept Pharmaceut Biosci, Box 591, S-75124 Uppsala, Sweden..
    Berg, Arvid
    Uppsala Univ, Dept Pharmaceut Biosci, Box 591, S-75124 Uppsala, Sweden..
    Larsson, Anders
    Uppsala Univ, Dept Cell & Mol Biol, Natl Bioinformat Infrastruct Sweden NBIS, Box 596, S-75124 Uppsala, Sweden..
    Schaal, Wesley
    Uppsala Univ, Dept Pharmaceut Biosci, Box 591, S-75124 Uppsala, Sweden..
    Laure, Erwin
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST). Royal Inst Technol KTH, Dept Elect Engn & Computat Sci, Lindstedtsvagen 5, S-10044 Stockholm, Sweden..
    Spjuth, Ola
    Uppsala Univ, Dept Pharmaceut Biosci, Box 591, S-75124 Uppsala, Sweden..
    Predicting target profiles with confidence as a service using docking scores2020Ingår i: Journal of Cheminformatics, E-ISSN 1758-2946, Vol. 12, nr 1, artikel-id 62Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Background: Identifying and assessing ligand-target binding is a core component in early drug discovery as one or more unwanted interactions may be associated with safety issues. Contributions: We present an open-source, extendable web service for predicting target profiles with confidence using machine learning for a panel of 7 targets, where models are trained on molecular docking scores from a large virtual library. The method uses conformal prediction to produce valid measures of prediction efficiency for a particular confidence level. The service also offers the possibility to dock chemical structures to the panel of targets with QuickVina on individual compound basis. Results: The docking procedure and resulting models were validated by docking well-known inhibitors for each of the 7 targets using QuickVina. The model predictions showed comparable performance to molecular docking scores against an external validation set. The implementation as publicly available microservices on Kubernetes ensures resilience, scalability, and extensibility.

  • 16.
    Ahmed, Laeeq
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Georgiev, Valentin
    Capuccini, Marco
    Toor, Salman
    Schaal, Wesley
    Laure, Erwin
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Spjuth, Ola
    Efficient iterative virtual screening with Apache Spark and conformal prediction2018Ingår i: Journal of Cheminformatics, 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.

  • 17.
    Akerlund, Cecilia A., I
    et al.
    Karolinska Inst, Dept Physiol & Pharmacol, Sect Anaesthesiol & Intens Care, Stockholm, Sweden.;Karolinska Univ Hosp Solna, Funct Perioperat Med & Intens Care, Stockholm, Sweden..
    Holst, Anders
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Bhattacharyay, Shubhayu
    Univ Cambridge, Dept Med, Div Anaesthesia, Cambridge, England..
    Stocchetti, Nino
    Univ Cambridge, Cambridge, England.;Milan Univ, Dept Physiopathol & Transplant, Milan, Italy.;Osped Maggiore Policlin, Fdn IRCCS Ca Granda, Milan, Italy..
    Steyerberg, Ewout
    Leiden Univ Med Ctr, Dept Biomed Data Sci, Leiden, Netherlands..
    Smielewski, Peter
    Univ Cambridge, Clin Neurosci, Cambridge, England..
    Menon, David K.
    Univ Cambridge, Dept Med, Div Anaesthesia, Cambridge, England..
    Ercole, Ari
    Univ Cambridge, Dept Med, Div Anaesthesia, Cambridge, England.;Univ Cambridge, Ctr Artificial Intelligence Med, Cambridge, England..
    Nelson, David W.
    Karolinska Inst, Dept Physiol & Pharmacol, Sect Anaesthesiol & Intens Care, Stockholm, Sweden.;Karolinska Univ Hosp Solna, Funct Perioperat Med & Intens Care, Stockholm, Sweden.;Karolinska Inst, Dept Physiol & Pharmacol, Sect Anaesthes & Intens Care, S-171 77 Stockholm, Sweden..
    Clinical descriptors of disease trajectories in patients with traumatic brain injury in the intensive care unit (CENTER-TBI): a multicentre observational cohort study2024Ingår i: Lancet Neurology, ISSN 1474-4422, E-ISSN 1474-4465, Vol. 23, nr 1, s. 71-80Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Background Patients with traumatic brain injury are a heterogeneous population, and the most severely injured individuals are often treated in an intensive care unit (ICU). The primary injury at impact, and the harmful secondary events that can occur during the first week of the ICU stay, will affect outcome in this vulnerable group of patients. We aimed to identify clinical variables that might distinguish disease trajectories among patients with traumatic brain injury admitted to the ICU. Methods We used data from the Collaborative European NeuroTrauma Effectiveness Research in Traumatic Brain Injury (CENTER-TBI) prospective observational cohort study. We included patients aged 18 years or older with traumatic brain injury who were admitted to the ICU at one of the 65 CENTER-TBI participating centres, which range from large academic hospitals to small rural hospitals. For every patient, we obtained pre-injury data and injury features, clinical characteristics on admission, demographics, physiological parameters, laboratory features, brain biomarkers (ubiquitin carboxy-terminal hydrolase L1 [UCH-L1], S100 calcium-binding protein B [S100B], tau, neurofilament light [NFL], glial fibrillary acidic protein [GFAP], and neuron-specific enolase [NSE]), and information about intracranial pressure lowering treatments during the first 7 days of ICU stay. To identify clinical variables that might distinguish disease trajectories, we applied a novel clustering method to these data, which was based on a mixture of probabilistic graph models with a Markov chain extension. The relation of clusters to the extended Glasgow Outcome Scale (GOS-E) was investigated. Findings Between Dec 19, 2014, and Dec 17, 2017, 4509 patients with traumatic brain injury were recruited into the CENTER-TBI core dataset, of whom 1728 were eligible for this analysis. Glucose variation (defined as the difference between daily maximum and minimum glucose concentrations) and brain biomarkers (S100B, NSE, NFL, tau, UCH-L1, and GFAP) were consistently found to be the main clinical descriptors of disease trajectories (ie, the leading variables contributing to the distinguishing clusters) in patients with traumatic brain injury in the ICU. The disease trajectory cluster to which a patient was assigned in a model was analysed as a predictor together with variables from the IMPACT model, and prediction of both mortality and unfavourable outcome (dichotomised GOS-E <= 4) was improved. Interpretation First-day ICU admission data are not the only clinical descriptors of disease trajectories in patients with traumatic brain injury. By analysing temporal variables in our study, variation of glucose was identified as the most important clinical descriptor that might distinguish disease trajectories in the ICU, which should direct further research. Biomarkers of brain injury (S100B, NSE, NFL, tau, UCH-L1, and GFAP) were also top clinical descriptors over time, suggesting they might be important in future clinical practice.

  • 18.
    Akhmetova, Dana
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Cebamanos, L.
    Iakymchuk, Roman
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Rotaru, T.
    Rahn, M.
    Markidis, Stefano
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Laure, Erwin
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, 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. 

  • 19.
    Allen, Tyler
    et al.
    University of North Carolina, Charlotte, United States.
    Peng, Ivy Bo
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Brightwell, Ron
    Sandia National Laboratories, United States.
    Gokhale, Maya
    Lawrence Livermore National Laboratory, United States.
    Workshop on Memory Technologies, Systems, and Applications (MTSA'23)2023Ingår i: ACM International Conference Proceeding Series, Association for Computing Machinery , 2023, s. 961-Konferensbidrag (Övrigt vetenskapligt)
  • 20. Anderson, E F
    et al.
    John, D
    Mikulski, R
    Redford, A
    Romero, Mario
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Preserving and presenting cultural heritage using off-the-shelf software2020Ingår i: Springer Series on Cultural Computing, The National Centre for Computer Animation, Bournemouth University, Poole, United Kingdom: Springer , 2020, s. 423-444Kapitel i bok, del av antologi (Övrigt vetenskapligt)
    Abstract [en]

    The preservation and presentation of cultural heritage (CH) encompasses many domains and disciplines and ranges from tangible CH, traditionally taking the form of museum exhibits and historical sites that are open to the public to intangible CH, focussing on human and societal aspects of CH, as opposed to physical artefacts. The use of computer graphics (CG) and related techniques such as interactive virtual environments since the 1990s has had a profound impact on the presentation of and public engagement with CH, allowing virtual reconstruction of archaeological/historical sites as well as the virtual (re-)construction of culturally and historically relevant artefacts. These are frequently implemented using bespoke or proprietary systems, often explicitly created with a CH application in mind, which may require specialist expertise or significant investment. There exist, however, alternative approaches that can simplify and improve the uptake of CG for CH. In this chapter we discuss how off-the-shelf CG systems such as developer and artists’ tools for the entertainment industries, which are comparatively inexpensive, usually provide open developer licenses, and sometimes are even available free of charge, or affordable consumer-level hardware, can be used for the preservation and presentation of tangible and intangible CH, the application of which we illustrate with a set of case studies. 

  • 21.
    Andersson, Måns
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Leveraging Intermediate Representations for High-Performance Portable Discrete Fourier Transform Frameworks: with Application to Molecular Dynamics2023Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [sv]

    Den diskreta Fouriertransformen och dess snabba implementeringar är viktiga för vetenskap och ingenjörskonst. Den har tillämningar i ämnen som singnal behnadling, lösning av partiella diffrentialekvationer och många andra ämnen inom vetenskapliga beräkningar. En växande trend inom ämnet är heterogena datorer där acceleratorer som är specialicerade till vissa beräkningar kan användas som stöd för traditionella processorer. Detta leder till problem med portabilitet, prestanda och produktivitet. 

    Avhandligen inleds med att beskriva diskret Fouriertransform och ett ramverk för faktorisering till glesa strukturerade matriser som tillsammans representerar snabb Fouriertransform (FFT, Eng.) och som kan användas för att uttrycka parallelism i algorithmerna. För att motivera arbete med FFT i vetenskapliga beräkningar så utväreras den parallela prestandan av GROMACS: en kod för simulering av Molekyldynmik. GROMACS använder en tredimensionell diskret Fouriertransform för att finna den elektrostatiska potentialen med hjälp av Particle-Mesh Ewald-tekniken. 

    De följande två artiklarna presenterar två olika ramverk för att utnyttja mellankod (IR Eng.) och kompilatorteknik, för utvecklandet av  snabb och portabel kod. Den andra artikeln beskriver arbetet att utveckla ett domänspecifikt språk baserat på Multi-Level Intermediate Representation för design av snabba Fouriertransformer baserat på matrisfaktorisering. Den sista artikeln undersöker och optimerar en viktig komponent för matrisfaktorisering av diskreta Fouriertransformen: att beräkna flera små diskreta Fouriertransformer parallelt. Detta är gjort med DaCe som är ramverk för data-centrisk programmering som använder en mellankod kallad SDFG. I artikeln utvärderas strategier för data format av komplexa tal för prestanda och portabilitet, och visar att en abstraktion med hjälp av SDFG kan motiveras. 

    Ladda ner fulltext (pdf)
    fulltext
  • 22.
    Andersson, Måns
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Liu, Felix
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST). RaySearch Laboratories, RaySearch Laboratories.
    Markidis, Stefano
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Anderson Accelerated PMHSS for Complex-Symmetric Linear Systems2024Ingår i: 2024 SIAM Conference on Parallel Processing for Scientific Computing, PP 2024, Society for Industrial and Applied Mathematics Publications , 2024, s. 39-51Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper presents the design and development of an Anderson Accelerated Preconditioned Modified Hermitian and Skew-Hermitian Splitting (AA-PMHSS) method for solving complex-symmetric linear systems with application to electromagnetics problems, such as wave scattering and eddy currents. While it has been shown that the Anderson acceleration of real linear systems is essentially equivalent to GMRES, we show here that the formulation using Anderson acceleration leads to a more performant method. We show relatively good robustness compared to existing preconditioned GMRES methods and significantly better performance due to the faster evaluation of the preconditioner. In particular, AA-PMHSS can be applied to solve problems and equations arising from complex-valued systems, such as time-harmonic eddy current simulations discretized with the Finite Element Method. We also evaluate three test systems present in previous literature. We show that the method is competitive with two types of preconditioned GMRES, which share the significant advantage of having a convergence rate that is independent of the discretization size.

  • 23.
    Andersson, Måns
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Markidis, Stefano
    KTH, Centra, SeRC - Swedish e-Science Research Centre. KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    A Case Study on DaCe Portability & Performance for Batched Discrete Fourier Transforms2023Ingår i: Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region: 2023, Association for Computing Machinery (ACM) , 2023Konferensbidrag (Refereegranskat)
    Abstract [en]

    With the emergence of new computer architectures, portability and performance-portability become significant concerns for developing HPC applications. This work reports our experience and lessons learned using DaCe to create and optimize batched Discrete Fourier Transform (DFT) calculations on different single node computer systems. The batched DFT calculation is an essential component in FFT algorithms and is widely used in computer science, numerical analysis, and signal processing. We implement the batched DFT with three complex-value array data layouts and compare them with the native complex type implementation. We use DaCe, which relies on Stateful DataFlow multiGraphs (SDFG) as an intermediate representation (IR) which can be optimized through transforms and then generates code for different architectures. We present several performance results showcasing the potential of DaCe for expressing HPC applications on different computer systems.

  • 24.
    Andersson, Måns
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Natarajan Arul, Murugan
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Podobas, Artur
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Markidis, Stefano
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Breaking Down the Parallel Performance of GROMACS, a High-Performance Molecular Dynamics Software2023Ingår i: PPAM 2022. Lecture Notes in Computer Science, vol 13826., Springer Nature , 2023, s. 333-345Konferensbidrag (Refereegranskat)
    Abstract [en]

    GROMACS is one of the most widely used HPC software packages using the Molecular Dynamics (MD) simulation technique. In this work, we quantify GROMACS parallel performance using different configurations, HPC systems, and FFT libraries (FFTW, Intel MKL FFT, and FFT PACK). We break down the cost of each GROMACS computational phase and identify non-scalable stages, such as MPI communication during the 3D FFT computation when using a large number of processes. We show that the Particle-Mesh Ewald phase and the 3D FFT calculation significantly impact the GROMACS performance. Finally, we discuss performance opportunities with a particular interest in developing GROMACS for the FFT calculations.

  • 25.
    Andreozzi, Emilio
    et al.
    Univ Naples Federico II, Dept Elect Engn & Informat Technol DIETI, Naples, Italy.;Ist Clin Sci Maugeri IRCCS, Dept Bioengn, Telese Terme Inst, Telese Terme, BN, Italy..
    Carannante, Ilaria
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    D'Addio, Giovanni
    Ist Clin Sci Maugeri IRCCS, Dept Bioengn, Telese Terme Inst, Telese Terme, BN, Italy..
    Cesarelli, Mario
    Univ Naples Federico II, Dept Elect Engn & Informat Technol DIETI, Naples, Italy.;Ist Clin Sci Maugeri IRCCS, Dept Bioengn, Telese Terme Inst, Telese Terme, BN, Italy..
    Balbi, Pietro
    Ist Clin Sci Maugeri IRCCS, Lab Computat Neurophysiol, Telese Terme Inst, Telese Terme, BN, Italy..
    Phenomenological models of Na(V)1.5. A side by side, procedural, hands-on comparison between Hodgkin-Huxley and kinetic formalisms2019Ingår i: Scientific Reports, E-ISSN 2045-2322, Vol. 9, artikel-id 17493Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Computational models of ion channels represent the building blocks of conductance-based, biologically inspired models of neurons and neural networks. Ion channels are still widely modelled by means of the formalism developed by the seminal work of Hodgkin and Huxley (HH), although the electrophysiological features of the channels are currently known to be better fitted by means of kinetic Markov-type models. The present study is aimed at showing why simplified Markov-type kinetic models are more suitable for ion channels modelling as compared to HH ones, and how a manual optimization process can be rationally carried out for both. Previously published experimental data of an illustrative ion channel (Na(V)1.5) are exploited to develop a step by step optimization of the two models in close comparison. A conflicting practical limitation is recognized for the HH model, which only supplies one parameter to model two distinct electrophysiological behaviours. In addition, a step by step procedure is provided to correctly optimize the kinetic Markov-type model. Simplified Markov-type kinetic models are currently the best option to closely approximate the known complexity of the macroscopic currents of ion channels. Their optimization can be achieved through a rationally guided procedure, and allows to obtain models with a computational burden that is comparable with HH models one.

  • 26.
    Angelopoulos, Anastasios N.
    et al.
    Univ Calif Berkeley, Berkeley, CA 94720 USA..
    Martel, Julien N. P.
    Stanford Univ, Stanford, CA 94305 USA..
    Kohli, Amit P.
    Univ Calif Berkeley, Berkeley, CA 94720 USA..
    Conradt, Jörg
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Wetzstein, Gordon
    Stanford Univ, Stanford, CA 94305 USA..
    Event-Based Near-Eye Gaze Tracking Beyond 10,000 Hz2021Ingår i: IEEE Transactions on Visualization and Computer Graphics, ISSN 1077-2626, E-ISSN 1941-0506, Vol. 27, nr 5, s. 2577-2586Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The cameras in modern gaze-tracking systems suffer from fundamental bandwidth and power limitations, constraining data acquisition speed to 300 Hz realistically. This obstructs the use of mobile eye trackers to perform, e.g., low latency predictive rendering, or to study quick and subtle eye motions like microsaccades using head-mounted devices in the wild. Here, we propose a hybrid frame-event-based near-eye gaze tracking system offering update rates beyond 10,000 Hz with an accuracy that matches that of high-end desktop-mounted commercial trackers when evaluated in the same conditions. Our system, previewed in Figure 1, builds on emerging event cameras that simultaneously acquire regularly sampled frames and adaptively sampled events. We develop an online 2D pupil fitting method that updates a parametric model every one or few events. Moreover, we propose a polynomial regressor for estimating the point of gaze from the parametric pupil model in real time. Using the first event-based gaze dataset, we demonstrate that our system achieves accuracies of 0.45 degrees -1.75 degrees for fields of view from 45 degrees to 98 degrees. With this technology, we hope to enable a new generation of ultra-low-latency gaze-contingent rendering and display techniques for virtual and augmented reality.

  • 27.
    Araújo De Medeiros, Daniel
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Emerging Paradigms in the Convergence of Cloud and High-Performance Computing2023Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [sv]

    Framväxande vetenskapliga applikationer är mycket datatunga och starkt kopplade. Nya högpresterande datorsystem anpassar sig till dessa nya krav och motiveras av behovet av prestanda och effektivitet i resursanvändningen. Å andra sidan är moln-applikationer löst kopplade och deras system har mogna teknologier som utvecklats under andra begränsningar än HPC.

    I den här avhandlingen diskuteras användningen av moln-teknologier som har mognat under löst kopplade applikationer i HPC-landskapet i tre huvuddelar. Den första delen handlar om implementeringen av HPC-applikationer i molnmiljöer genom användning av containrar och analyserar genomförbarheten och avvägningarna av elastisk skalning. Den andra delen handlar om användningen av arbetsflödeshanteringsystem i HPC-arbetsflöden; särskilt diskuteras ett molekylär dockningsarbetsflöde som utförs genom Airflow. Objektlagringssystem och deras användning inom HPC, tillsammans med ett gränssnitt mellan S3-standard och MPI I/O, diskuteras i den tredje delen av denna avhandling

    Ladda ner fulltext (pdf)
    Summary
  • 28.
    Araújo De Medeiros, Daniel
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Markidis, Stefano
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Peng, Ivy Bo
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    LibCOS: Enabling Converged HPC and Cloud Data Stores with MPI2023Ingår i: Proceedings of International Conference on High Performance Computing in Asia-Pacific Region, HPC Asia 2023, Association for Computing Machinery (ACM) , 2023, s. 106-116Konferensbidrag (Refereegranskat)
    Abstract [en]

    Recently, federated HPC and cloud resources are becoming increasingly strategic for providing diversified and geographically available computing resources. However, accessing data stores across HPC and cloud storage systems is challenging. Many cloud providers use object storage systems to support their clients in storing and retrieving data over the internet. One popular method is REST APIs atop the HTTP protocol, with Amazon's S3 APIs being supported by most vendors. In contrast, HPC systems are contained within their networks and tend to use parallel file systems with POSIX-like interfaces. This work addresses the challenge of diverse data stores on HPC and cloud systems by providing native object storage support through the unified MPI I/O interface in HPC applications. In particular, we provide a prototype library called LibCOS that transparently enables MPI applications running on HPC systems to access object storage on remote cloud systems. We evaluated LibCOS on a Ceph object storage system and a traditional HPC system. In addition, we conducted performance characterization of core S3 operations that enable individual and collective MPI I/O. Our evaluation in HACC, IOR, and BigSort shows that enabling diverse data stores on HPC and Cloud storage is feasible and can be transparently achieved through the widely adopted MPI I/O. Also, we show that a native object storage system like Ceph could improve the scalability of I/O operations in parallel applications.

  • 29.
    Araújo De Medeiros, Daniel
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Schieffer, Gabin
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Wahlgren, Jacob
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Peng, Ivy
    KTH.
    A GPU-Accelerated Molecular Docking Workflow with Kubernetes and Apache Airflow2023Ingår i: High Performance Computing: ISC High Performance 2023 International Workshops, Revised Selected Papers, Springer Nature , 2023, s. 193-206Konferensbidrag (Refereegranskat)
    Abstract [en]

    Complex workflows play a critical role in accelerating scientific discovery. In many scientific domains, efficient workflow management can lead to faster scientific output and broader user groups. Workflows that can leverage resources across the boundary between cloud and HPC are a strong driver for the convergence of HPC and cloud. This study investigates the transition and deployment of a GPU-accelerated molecular docking workflow that was designed for HPC systems onto a cloud-native environment with Kubernetes and Apache Airflow. The case study focuses on state-of-of-the-art molecular docking software for drug discovery. We provide a DAG-based implementation in Apache Airflow and technical details for GPU-accelerated deployment. We evaluated the workflow using the SWEETLEAD bioinformatics dataset and executed it in a Cloud environment with heterogeneous computing resources. Our workflow can effectively overlap different stages when mapped onto different computing resources.

  • 30.
    Araújo De Medeiros, Daniel
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Wahlgren, Jacob
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Schieffer, Gabin
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Peng, Ivy Bo
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Kub: Enabling Elastic HPC Workloads on Containerized Environments2023Ingår i: Proceedings of the 35th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), Institute of Electrical and Electronics Engineers (IEEE), 2023Konferensbidrag (Refereegranskat)
    Abstract [en]

    The conventional model of resource allocation in HPC systems is static. Thus, a job cannot leverage newly available resources in the system or release underutilized resources during the execution. In this paper, we present Kub, a methodology that enables elastic execution of HPC workloads on Kubernetes so that the resources allocated to a job can be dynamically scaled during the execution. One main optimization of our method is to maximize the reuse of the originally allocated resources so that the disruption to the running job can be minimized. The scaling procedure is coordinated among nodes through remote procedure calls on Kubernetes for deploying workloads in the cloud. We evaluate our approach using one synthetic benchmark and two production-level MPI-based HPC applications - GRO-MACS and CM1. Our results demonstrate that the benefits of adapting the allocated resources depend on the workload characteristics. In the tested cases, a properly chosen scaling point for increasing resources during execution achieved up to 2x speedup. Also, the overhead of checkpointing and data reshuffling significantly influences the selection of optimal scaling points and requires application-specific knowledge.

  • 31. Aronsson, Sanna
    et al.
    Artman, Henrik
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Människocentrerad teknologi, Medieteknik och interaktionsdesign, MID.
    Lindquist, Sinna
    Mikael, Mitchell
    Persson, Tomas
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Människocentrerad teknologi, Medieteknik och interaktionsdesign, MID.
    Ramberg, Robert
    Stockholms Universitet.
    Romero, Mario
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, 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.

  • 32.
    Arslan, M. Tunc
    et al.
    Bilkent Univ, Dept Elect & Elect Engn, Natl Magnet Resonance Res Ctr UMRAM, TR-06800 Ankara, Turkey..
    Ozaslan, A. Alper
    Bilkent Univ, Dept Elect & Elect Engn, Natl Magnet Resonance Res Ctr UMRAM, TR-06800 Ankara, Turkey..
    Kurt, Semih
    KTH, Centra, Science for Life Laboratory, SciLifeLab. KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Muslu, Yavuz
    Univ Wisconsin Madison, Dept Biomed Engn, Madison, WI 53706 USA.;Univ Wisconsin Madison, Dept Radiol, Madison, WI 53706 USA..
    Saritas, Emine Ulku
    Bilkent Univ, Dept Elect & Elect Engn, Natl Magnet Resonance Res Ctr UMRAM, TR-06800 Ankara, Turkey.;Bilkent Univ, Neurosci Program, Sabuncu Brain Res Ctr, TR-06800 Ankara, Turkey..
    Rapid TAURUS for Relaxation-Based Color Magnetic Particle Imaging2022Ingår i: IEEE Transactions on Medical Imaging, ISSN 0278-0062, E-ISSN 1558-254X, Vol. 41, nr 12, s. 3774-3786Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Magnetic particle imaging (MPI) is a rapidly developing medical imaging modality that exploits the non- linear response of magnetic nanoparticles (MNPs). Color MPI widens the functionality of MPI, empowering it with the capability to distinguish differentMNPs and/orMNP environments. The system function approach for color MPI relies on extensive calibrations that capture the differences in the harmonic responses of the MNPs. An alternative calibration-free x-space-basedmethod called TAURUS estimates amap of the relaxation time constant, tau, by recovering the underlyingmirror symmetry in the MPI signal. However, TAURUS requires a back and forth scanning of a given region, restricting its usage to slow trajectories with constant or piecewise constant focus fields (FFs). In this work, we propose a novel technique to increase the performance of TAURUS and enable tau map estimation for rapid andmultidimensional trajectories. The proposed technique is based on correcting the distortions on mirror symmetry induced by time-varying FFs. We demonstrate via simulations and experiments in our in-house MPI scanner that the proposed method successfully estimates high-fidelity tau maps for rapid trajectories that provide orders of magnitude reduction in scanning time (over 300 fold for simulations and over 8 fold for experiments) while preserving the calibration-free property of TAURUS.

  • 33.
    Atzori, Marco
    et al.
    KTH, Skolan för teknikvetenskap (SCI), Teknisk mekanik.
    Köpp, Wiebke
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Chien, Wei Der
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Massaro, Daniele
    KTH, Skolan för teknikvetenskap (SCI), Teknisk mekanik.
    Mallor, Fermin
    KTH, Skolan för teknikvetenskap (SCI), Teknisk mekanik.
    Peplinski, Adam
    KTH, Skolan för teknikvetenskap (SCI), Teknisk mekanik, Strömningsmekanik och Teknisk Akustik.
    Rezaei, Mohamad
    PDC Center for High Performance Computing, KTH Royal Institute of Technology.
    Jansson, Niclas
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Markidis, Stefano
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Vinuesa, Ricardo
    KTH, Skolan för teknikvetenskap (SCI), Teknisk mekanik, Strömningsmekanik och Teknisk Akustik.
    Laure, Erwin
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Schlatter, Philipp
    KTH, Skolan för teknikvetenskap (SCI), Teknisk mekanik, Strömningsmekanik och Teknisk Akustik.
    Weinkauf, Tino
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    In-situ visualization of large-scale turbulence simulations in Nek5000 with ParaView Catalyst2021Rapport (Övrigt vetenskapligt)
    Abstract [en]

    In-situ visualization on HPC systems allows us to analyze simulation results that would otherwise be impossible, given the size of the simulation data sets and offline post-processing execution time. We design and develop in-situ visualization with Paraview Catalyst in Nek5000, a massively parallel Fortran and C code for computational fluid dynamics applications. We perform strong scalability tests up to 2,048 cores on KTH's Beskow Cray XC40 supercomputer and assess in-situ visualization's impact on the Nek5000 performance. In our study case, a high-fidelity simulation of turbulent flow, we observe that in-situ operations significantly limit the strong scalability of the code, reducing the relative parallel efficiency to only ~21\% on 2,048 cores (the relative efficiency of Nek5000 without in-situ operations is ~99\%). Through profiling with Arm MAP, we identified a bottleneck in the image composition step (that uses Radix-kr algorithm) where a majority of the time is spent on MPI communication. We also identified an imbalance of in-situ processing time between rank 0 and all other ranks. Better scaling and load-balancing in the parallel image composition would considerably improve the performance and scalability of Nek5000 with in-situ capabilities in large-scale simulation.

  • 34.
    Atzori, Marco
    et al.
    KTH, Centra, SeRC - Swedish e-Science Research Centre. KTH, Skolan för teknikvetenskap (SCI), Centra, Linné Flow Center, FLOW.
    Köpp, Wiebke
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Chien, Wei Der
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Teoretisk datalogi, TCS. KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Massaro, Daniele
    KTH, Skolan för teknikvetenskap (SCI), Teknisk mekanik.
    Mallor, Fermin
    KTH, Skolan för teknikvetenskap (SCI), Centra, Linné Flow Center, FLOW.
    Peplinski, Adam
    KTH, Skolan för teknikvetenskap (SCI), Centra, Linné Flow Center, FLOW. KTH, Centra, SeRC - Swedish e-Science Research Centre.
    Rezaei, Mohammadtaghi
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, Parallelldatorcentrum, PDC.
    Jansson, Niclas
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Markidis, Stefano
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Vinuesa, Ricardo
    KTH, Skolan för teknikvetenskap (SCI), Centra, Linné Flow Center, FLOW.
    Laure, E.
    Schlatter, Philipp
    KTH, Skolan för teknikvetenskap (SCI), Centra, Linné Flow Center, FLOW.
    Weinkauf, Tino
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    In situ visualization of large-scale turbulence simulations in Nek5000 with ParaView Catalyst2022Ingår i: Journal of Supercomputing, ISSN 0920-8542, E-ISSN 1573-0484, Vol. 78, nr 3, s. 3605-3620Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In situ visualization on high-performance computing systems allows us to analyze simulation results that would otherwise be impossible, given the size of the simulation data sets and offline post-processing execution time. We develop an in situ adaptor for Paraview Catalyst and Nek5000, a massively parallel Fortran and C code for computational fluid dynamics. We perform a strong scalability test up to 2048 cores on KTH’s Beskow Cray XC40 supercomputer and assess in situ visualization’s impact on the Nek5000 performance. In our study case, a high-fidelity simulation of turbulent flow, we observe that in situ operations significantly limit the strong scalability of the code, reducing the relative parallel efficiency to only ≈ 21 % on 2048 cores (the relative efficiency of Nek5000 without in situ operations is ≈ 99 %). Through profiling with Arm MAP, we identified a bottleneck in the image composition step (that uses the Radix-kr algorithm) where a majority of the time is spent on MPI communication. We also identified an imbalance of in situ processing time between rank 0 and all other ranks. In our case, better scaling and load-balancing in the parallel image composition would considerably improve the performance of Nek5000 with in situ capabilities. In general, the result of this study highlights the technical challenges posed by the integration of high-performance simulation codes and data-analysis libraries and their practical use in complex cases, even when efficient algorithms already exist for a certain application scenario.

  • 35.
    Aurell, Erik
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, 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)].

  • 36.
    Aurell, Erik
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    On Work and Heat in Time-Dependent Strong Coupling2017Ingår i: Entropy, E-ISSN 1099-4300, Vol. 19, nr 11, artikel-id UNSP 595Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This paper revisits the classical problem of representing a thermal bath interacting with a system as a large collection of harmonic oscillators initially in thermal equilibrium. As is well known, the system then obeys an equation, which in the bulk and in the suitable limit tends to the Kramers-Langevin equation of physical kinetics. I consider time-dependent system-bath coupling and show that this leads to an additional harmonic force acting on the system. When the coupling is switched on and switched off rapidly, the force has delta-function support at the initial and final time. I further show that the work and heat functionals as recently defined in stochastic thermodynamics at strong coupling contain additional terms depending on the time derivative of the system-bath coupling. I discuss these terms and show that while they can be very large if the system-bath coupling changes quickly, they only give a finite contribution to the work that enters in Jarzynski's equality. I also discuss that these corrections to standard work and heat functionals provide an explanation for non-standard terms in the change of the von Neumann entropy of a quantum bath interacting with a quantum system found in an earlier contribution (Aurell and Eichhorn, 2015).

  • 37.
    Aurell, Erik
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, 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.

  • 38.
    Aurell, Erik
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST). AlbaJagiellonian Univ, Fac Phys Astron & Appl Comp Sci, PL-30348 Krakow, Poland..
    Donvil, Brecht
    Univ Helsinki, Dept Math & Stat, POB 68, Helsinki 00014, Finland..
    Mallick, Kirone
    Univ Paris Saclay, Inst Phys Theor, CEA, F-91191 Gif Sur Yvette, France.;CNRS, F-91191 Gif Sur Yvette, France..
    Large deviations and fluctuation theorem for the quantum heat current in the spin-boson model2020Ingår i: Physical review. E, ISSN 2470-0045, E-ISSN 2470-0053, Vol. 101, nr 5, artikel-id 052116Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We study the heat current flowing between two baths consisting of harmonic oscillators interacting with a qubit through a spin-boson coupling. An explicit expression for the generating function of the total heat flowing between the right and left baths is derived by evaluating the corresponding Feynman-Vernon path integral by performing the noninteracting blip approximation (NIBA). We recover the known expression, obtained by using the polaron transform. This generating function satisfies the Gallavotti-Cohen fluctuation theorem, both before and after performing the NIBA. We also verify that the heat conductance is proportional to the variance of the heat current, retrieving the well-known fluctuation dissipation relation. Finally, we present numerical results for the heat current.

  • 39.
    Aurell, Erik
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Eckstein, Michal
    Jagiellonian Univ, Inst Theoret Phys, Lojasiewicza 11, PL-30348 Krakow, Poland.;Copernicus Ctr Interdisciplinary Studies, Ul Szczepanska 1-5, PL-31011 Krakow, Poland..
    Horodecki, Pawel
    Univ Gdansk, Int Ctr Theory Quantum Technol, Wita Stwosza 63, PL-80308 Gdansk, Poland.;Gdansk Univ Technol, Fac Appl Phys & Math, Natl Quantum Informat Ctr, Gabriela Narutowicza 11-12, PL-80233 Gdansk, Poland..
    Hawking radiation and the quantum marginal problem2022Ingår i: Journal of Cosmology and Astroparticle Physics, E-ISSN 1475-7516, nr 1Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In 1974 Steven Hawking showed that black holes emit thermal radiation, which eventually causes them to evaporate. The problem of the fate of information in this process is known as the "black hole information paradox". Two main types of resolution postulate either a fundamental loss of information in Nature - hence the breakdown of quantum mechanics - or some sort of new physics, e.g. quantum gravity, which guarantee the global preservation of unitarity. Here we explore the second possibility with the help of recent developments in continuous-variable quantum information. Concretely, we employ the solution to the Gaussian quantum marginal problem to show that the thermality of all individual Hawking modes is consistent with a global pure state of the radiation. Surprisingly, we find out that the mods of radiation of an astrophysical black hole are thermal until the very last burst. In contrast, the single-mode thermality of Hawking radiation originating from microscopic black holes, expected to evaporate through several quanta, is not excluded, though there are constraints on modes' frequencies. Our result paves the way towards a systematic study of multi-mode correlations in Hawking radiation.

  • 40.
    Aurell, Erik
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST). Jagiellonian Univ, Fac Phys Astron & Appl Comp Sci, PL-30348 Krakow, Poland..
    Eckstein, Michal
    Jagiellonian Univ, Inst Theoret Phys, Ul Lojasiewicza 11, PL-30348 Krakow, Poland.;Univ Gdansk, Fac Math Phys & Informat, Natl Quantum Informat Ctr, Inst Theoret Phys & Astrophys, Wita Stwosza 57, PL-80308 Gdansk, Poland..
    Horodecki, Pawel
    Univ Gdansk, Int Ctr Theory Quantum Technol, Wita Stwosza 63, PL-80308 Gdansk, Poland.;Gdansk Univ Technol, Fac Appl Phys & Math, Natl Quantum Informat Ctr, Gabriela Narutowicza 11-12, PL-80233 Gdansk, Poland..
    Quantum Black Holes as Solvents2021Ingår i: Foundations of physics, ISSN 0015-9018, E-ISSN 1572-9516, Vol. 51, nr 2, artikel-id 54Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Almost all of the entropy in the universe is in the form of Bekenstein-Hawking (BH) entropy of super-massive black holes. This entropy, if it satisfies Boltzmann's equation S=log N, hence represents almost all the accessible phase space of the Universe, somehow associated to objects which themselves fill out a very small fraction of ordinary three-dimensional space. Although time scales are very long, it is believed that black holes will eventually evaporate by emitting Hawking radiation, which is thermal when counted mode by mode. A pure quantum state collapsing to a black hole will hence eventually re-emerge as a state with strictly positive entropy, which constitutes the famous black hole information paradox. Expanding on a remark by Hawking we posit that BH entropy is a thermodynamic entropy, which must be distinguished from information-theoretic entropy. The paradox can then be explained by information return in Hawking radiation. The novel perspective advanced here is that if BH entropy counts the number of accessible physical states in a quantum black hole, then the paradox can be seen as an instance of the fundamental problem of statistical mechanics. We suggest a specific analogy to the increase of the entropy in a solvation process. We further show that the huge phase volume (N), which must be made available to the universe in a gravitational collapse, cannot originate from the entanglement between ordinary matter and/or radiation inside and outside the black hole. We argue that, instead, the quantum degrees of freedom of the gravitational field must get activated near the singularity, resulting in a final state of the 'entangled entanglement' form involving both matter and gravity.

  • 41.
    Aurell, Erik
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Kawai, Ryochi
    Univ Alabama Birmingham, Dept Phys, Birmingham, AL 35294 USA..
    Goyal, Ketan
    Univ Alabama Birmingham, Dept Phys, Birmingham, AL 35294 USA..
    An operator derivation of the Feynman-Vernon theory, with applications to the generating function of bath energy changes and to an-harmonic baths2020Ingår i: Journal of Physics A: Mathematical and Theoretical, ISSN 1751-8113, E-ISSN 1751-8121, Vol. 53, nr 27, artikel-id 275303Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We present a derivation of the Feynman-Vernon approach to open quantum systems in the language of super-operators. We show that this gives a new and more direct derivation of the generating function of energy changes in a bath, or baths. As found previously, this generating function is given by a Feynman-Vernon-like influence functional, with only time shifts in the kernels coupling the forward and backward paths. We further show that the new approach extends to an-harmonic and possible non-equilibrium baths, provided that the interactions are bi-linear, and that the baths do not interact between themselves. Such baths are characterized by non-trivial cumulants. Every non-zero cumulant of certain environment correlation functions is thus a kernel in a higher-order term in the Feynman-Vernon action.

  • 42.
    Aurell, Erik
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST). KTH, Skolan för bioteknologi (BIO), Centra, Albanova VinnExcellence Center for Protein Technology, ProNova.
    Machado Perez, David
    Univ Havana, Phys Fac, Dept Theoret Phys, Grp Complex Syst & Stat Phys, Havana, Cuba..
    Mulet, Roberto
    Univ Havana, Phys Fac, Dept Theoret Phys, Grp Complex Syst & Stat Phys, Havana, Cuba..
    A closure for the master equation starting from the dynamic cavity method2023Ingår i: Journal of Physics A: Mathematical and Theoretical, ISSN 1751-8113, E-ISSN 1751-8121, Vol. 56, nr 17, artikel-id 17LT02Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We consider classical spin systems evolving in continuous time with interactions given by a locally tree-like graph. Several approximate analysis methods have earlier been reported based on the idea of Belief Propagation / cavity method. We introduce a new such method which can be derived in a more systematic manner using the theory of Random Point Processes. Within this approach, the master equation governing the system's dynamics is closed via a set of differential equations for the auxiliary cavity probabilities. The numerical results improve on the earlier versions of the closure on several important classes of problems. We re-visit here the cases of the Ising ferromagnet and the Viana-Bray spin-glass model.

  • 43.
    Aurell, Erik
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, 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.

  • 44.
    Aurell, Erik
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST). AlbaNova Univ Ctr, KTH Royal Inst Technol, SE-10691 Stockholm, Sweden..
    Mulet, Roberto
    Univ Havana, Phys Fac, Dept Theoret Phys, Grp Complex Syst & Stat Phys, Havana, Cuba..
    Tuziemski, Jan
    Stockholm Univ, AlbaNova Univ Ctr, Dept Phys, SE-10691 Stockholm, Sweden.;Royal Inst Technol, NORDITA, Roslagstullsbacken 23, SE-10691 Stockholm, Sweden.;Stockholm Univ, Roslagstullsbacken 23, SE-10691 Stockholm, Sweden.;Gdansk Univ Technol, Dept Appl Phys & Math, PL-80233 Gdansk, Poland..
    Real-time dynamics in diluted quantum networks2022Ingår i: Physical Review A: covering atomic, molecular, and optical physics and quantum information, ISSN 2469-9926, E-ISSN 2469-9934, Vol. 105, nr 2, artikel-id 022205Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We introduce an approach to characterize the dynamics of disordered quantum networks. Each quantum element (i.e., each node) of the network experiences the other nodes as an effective environment that can be self-consistently represented by a Feynman-Vernon influence functional. For networks having the topology of locally treelike graphs, these Feynman-Vernon (FV) functionals can be determined by a new version of the cavity or belief propagation (BP) method. Here, we find the fixed point solution of this version of BP for a network of uniform quantum harmonic oscillators. Then, we estimate the effects of the disorder in these networks within the replica symmetry ansatz. We show that over a large time interval, at small disorder, the real part of the FV functional induces decoherence and classicality while at sufficiently large disorder the Feynman-Vernon functional tends to zero and the coherence survives, signaling in a time setting, the onset of an Anderson's transition.

  • 45.
    Aurell, Erik
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Tuziemski, Jan
    Frohlich-coupled qubits interacting with fermionic baths2020Ingår i: Physical Review E. Statistical, Nonlinear, and Soft Matter Physics, ISSN 1539-3755, E-ISSN 1550-2376, Vol. 102, nr 1, artikel-id 012136Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We consider a quantum system such as a qubit, interacting with a bath of fermions as in the Frohlich polaron model. The interaction Hamiltonian is thus linear in the system variable and quadratic in the fermions. Using the recently developed extension of Feynman-Vernon theory to nonharmonic baths we evaluate quadratic and the quartic terms in the influence action. We find that for this model the quartic term vanish by symmetry arguments. Although the influence of the bath on the system is of the same form as from bosonic harmonic oscillators up to effects to sixth order in the system-bath interaction, the temperature dependence is nevertheless rather different, unless rather contrived models are considered.

  • 46.
    Bahuguna, Jyotika
    et al.
    Aix Marseille Univ, Inst Syst Neurosci, Marseille, France..
    Sahasranamam, Ajith
    Ongil Pvt Ltd, Singapore, Singapore..
    Kumar, Arvind
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Uncoupling the roles of firing rates and spike bursts in shaping the STN-GPe beta band oscillations2020Ingår i: PloS Computational Biology, ISSN 1553-734X, E-ISSN 1553-7358, Vol. 16, nr 3Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The excess of 15-30 Hz (beta-band) oscillations in the basal ganglia is one of the key signatures of Parkinson's disease (PD). The STN-GPe network is integral to generation and modulation of beta band oscillations in basal ganglia. However, the role of changes in the firing rates and spike bursting of STN and GPe neurons in shaping these oscillations has remained unclear. In order to uncouple their effects, we studied the dynamics of STN-GPe network using numerical simulations. In particular, we used a neuron model, in which firing rates and spike bursting can be independently controlled. Using this model, we found that while STN firing rate is predictive of oscillations but GPe firing rate is not. The effect of spike bursting in STN and GPe neurons was state-dependent. That is, only when the network was operating in a state close to the border of oscillatory and non-oscillatory regimes, spike bursting had a qualitative effect on the beta band oscillations. In these network states, an increase in GPe bursting enhanced the oscillations whereas an equivalent proportion of spike bursting in STN suppressed the oscillations. These results provide new insights into the mechanisms underlying the transient beta bursts and how duration and power of beta band oscillations may be controlled by an interplay of GPe and STN firing rates and spike bursts. Author summary The STN-GPe network undergoes a change in firing rates as well as increased bursting during excessive beta band oscillations during Parkinson's disease. In this work we uncouple their effects by using a novel neuron model and show that presence of oscillations is contingent on the increase in STN firing rates, however the effect of spike bursting on oscillations depends on the network state. In a network state on the border of oscillatory and non-oscillatory regime, GPe spike bursting strengthens oscillations. The effect of spike bursting in the STN depends on the proportion of GPe neurons bursting. These results suggest a mechanism underlying a transient beta band oscillation bursts often seen in experimental data.

  • 47.
    Baldassarre, Federico
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Robotik, perception och lärande, RPL.
    Smith, Kevin
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Sullivan, Josephine
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Robotik, perception och lärande, RPL.
    Azizpour, Hossein
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Robotik, perception och lärande, RPL.
    Explanation-Based Weakly-Supervised Learning of Visual Relations with Graph Networks2020Ingår i: Proceedings, Part XXVIII Computer Vision - ECCV 2020 - 16th European Conference, Glasgow, UK, August 23-28, 2020, Springer Nature , 2020, s. 612-630Konferensbidrag (Refereegranskat)
    Abstract [en]

    Visual relationship detection is fundamental for holistic image understanding. However, the localization and classification of (subject, predicate, object) triplets remain challenging tasks, due to the combinatorial explosion of possible relationships, their long-tailed distribution in natural images, and an expensive annotation process. This paper introduces a novel weakly-supervised method for visual relationship detection that relies on minimal image-level predicate labels. A graph neural network is trained to classify predicates in images from a graph representation of detected objects, implicitly encoding an inductive bias for pairwise relations. We then frame relationship detection as the explanation of such a predicate classifier, i.e. we obtain a complete relation by recovering the subject and object of a predicted predicate. We present results comparable to recent fully- and weakly-supervised methods on three diverse and challenging datasets: HICO-DET for human-object interaction, Visual Relationship Detection for generic object-to-object relations, and UnRel for unusual triplets; demonstrating robustness to non-comprehensive annotations and good few-shot generalization.

    Ladda ner fulltext (pdf)
    fulltext
  • 48.
    Balmus, Maximilian
    et al.
    Kings Coll London, Sch Imaging Sci & Biomed Engn, Dept Biomed Engn, Kings Hlth Partners, London SE1 7EH, England..
    Hoffman, Johan
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Massing, Andre
    Norwegian Univ Sci & Technol, Dept Math Sci, N-7491 Trondheim, Norway..
    Nordsletten, David A.
    Kings Coll London, Sch Imaging Sci & Biomed Engn, Dept Biomed Engn, Kings Hlth Partners, London SE1 7EH, England.;Univ Michigan, Dept Biomed Engn & Cardiac Surg, NCRC B20,2800 Plymouth Rd, Ann Arbor, MI 48100 USA..
    A stabilized multidomain partition of unity approach to solving incompressible viscous flow2022Ingår i: Computer Methods in Applied Mechanics and Engineering, ISSN 0045-7825, E-ISSN 1879-2138, Vol. 392, artikel-id 114656Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this work we propose a new stabilized approach for solving the incompressible Navier-Stokes equations on fixed overlapping grids. This new approach is based on the partition of unity finite element method, which defines the solution fields as weighted sums of local fields, supported by the different grids. Here, the discrete weak formulation of the problem is re-set in cG(1)cG(1) stabilized form, which has the dual benefit of lowering grid resolution requirements for convection dominated flows and allowing for the use of velocity and pressure discretizations which do not satisfy the inf-sup condition. Additionally, we provide an outline of our implementation within an existing distributed parallel application and identify four key options to improve the code efficiency namely: the use of cache to store mapped quadrature points and basis function gradients, the intersection volume splitting algorithm, the use of lower order quadrature schemes, and tuning the partition weight associated with the interface elements. The new method is shown to have comparable accuracy to the single mesh boundary-fitted version of the same stabilized solver based on three transient flow tests including both 2D and 3D settings, as well as low and moderate Reynolds number flow conditions. Moreover, we demonstrate how the four implementation options have a synergistic effect lowering the residual assembly time by an order of magnitude compared to a naive implementation, and showing good load balancing properties.

  • 49.
    Barkman, Patrik
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, 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.

    Ladda ner fulltext (pdf)
    fulltext
  • 50.
    Belic, Jovana
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST).
    Automatic detection of exudates in retinal images2010Konferensbidrag (Refereegranskat)
    Abstract [en]

    Nowadays, automatic detection of different diseases plays an important role in early and reliable diagnosis, which leads to faster recovery and significant reduction in health care costs. One such disease is diabetic retinopathy, which is induced by diabetes and is manifested through the gradual loss of eye blood vessels. Exudates are a form of diabetic retinopathy, and the idea of this paper was developing the program which would be used for automatic recognition of places that are potentially exudates in retinal images. The program was made in MatLab and three different methods were used. Also, a method for detection of blind spots was developed, concerning importance of it for appropriate detection of exudates.

1234567 1 - 50 av 601
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