vente ... |

Jump to content
Endre søk PrimeFaces.cw("InputText","widget_formSmash_searchField",{id:"formSmash:searchField",widgetVar:"widget_formSmash_searchField"}); Søk $(function(){PrimeFaces.cw("DefaultCommand","widget_formSmash_j_idt130",{id:"formSmash:j_idt130",widgetVar:"widget_formSmash_j_idt130",target:"formSmash:searchButton",scope:"formSmash:simpleSearch"});}); Søk PrimeFaces.cw("CommandButton","widget_formSmash_searchButton",{id:"formSmash:searchButton",widgetVar:"widget_formSmash_searchButton"});
Kun dokumenter med fulltekst i DiVA
PrimeFaces.cw("Fieldset","widget_formSmash_search",{id:"formSmash:search",widgetVar:"widget_formSmash_search",toggleable:true,collapsed:true,toggleSpeed:500,behaviors:{toggle:function(ext) {PrimeFaces.ab({s:"formSmash:search",e:"toggle",f:"formSmash",p:"formSmash:search"},ext);}}});
PrimeFaces.cw("InputText","widget_formSmash_upper_j_idt572",{id:"formSmash:upper:j_idt572",widgetVar:"widget_formSmash_upper_j_idt572"}); Fler formatPrimeFaces.cw("InputText","widget_formSmash_upper_j_idt585",{id:"formSmash:upper:j_idt585",widgetVar:"widget_formSmash_upper_j_idt585"}); Fler språkSkapa PrimeFaces.cw("CommandButton","widget_formSmash_upper_j_idt594",{id:"formSmash:upper:j_idt594",widgetVar:"widget_formSmash_upper_j_idt594"}); Stäng PrimeFaces.cw("CommandButton","widget_formSmash_upper_j_idt595",{id:"formSmash:upper:j_idt595",widgetVar:"widget_formSmash_upper_j_idt595"});
$(function(){PrimeFaces.cw("Dialog","citationDialog",{id:"formSmash:upper:j_idt558",widgetVar:"citationDialog",width:"800",height:"600"});});
5 10 20 50 100 250 $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_j_idt609",{id:"formSmash:j_idt609",widgetVar:"widget_formSmash_j_idt609",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:j_idt609",e:"change",f:"formSmash",p:"formSmash:j_idt609"},ext);}}});});
Standard (Relevans) Forfatter A-Ø Forfatter Ø-A Tittel A-Ø Tittel Ø-A Type publikasjon A-Ø Type publikasjon Ø-A Eldste først Nyeste først Skapad (Eldste først) Skapad (Nyeste først) Senast uppdaterad (Eldste først) Senast uppdaterad (Nyeste først) Disputationsdatum (tidligste først) Disputationsdatum (siste først) $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_j_idt623",{id:"formSmash:j_idt623",widgetVar:"widget_formSmash_j_idt623",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:j_idt623",e:"change",f:"formSmash",p:"formSmash:j_idt623"},ext);}}});});
Standard (Relevans) Forfatter A-Ø Forfatter Ø-A Tittel A-Ø Tittel Ø-A Type publikasjon A-Ø Type publikasjon Ø-A Eldste først Nyeste først Skapad (Eldste først) Skapad (Nyeste først) Senast uppdaterad (Eldste først) Senast uppdaterad (Nyeste først) Disputationsdatum (tidligste først) Disputationsdatum (siste først) $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_j_idt627",{id:"formSmash:j_idt627",widgetVar:"widget_formSmash_j_idt627",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:j_idt627",e:"change",f:"formSmash",p:"formSmash:j_idt627"},ext);}}});});
alle i siden PrimeFaces.cw("CommandButton","widget_formSmash_j_idt636",{id:"formSmash:j_idt636",widgetVar:"widget_formSmash_j_idt636"}); 250 framåt PrimeFaces.cw("CommandButton","widget_formSmash_j_idt637",{id:"formSmash:j_idt637",widgetVar:"widget_formSmash_j_idt637"});
Rydd valg PrimeFaces.cw("CommandButton","widget_formSmash_j_idt639",{id:"formSmash:j_idt639",widgetVar:"widget_formSmash_j_idt639"});
$(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_j_idt642",{id:"formSmash:j_idt642",widgetVar:"widget_formSmash_j_idt642",target:"formSmash:selectHelpLink",showEffect:"blind",hideEffect:"fade",showCloseIcon:true});});
$(function(){PrimeFaces.cw("DataList","widget_formSmash_items_resultList",{id:"formSmash:items:resultList",widgetVar:"widget_formSmash_items_resultList"});});
PrimeFaces.cw("InputText","widget_formSmash_lower_j_idt1026",{id:"formSmash:lower:j_idt1026",widgetVar:"widget_formSmash_lower_j_idt1026"}); Fler formatPrimeFaces.cw("InputText","widget_formSmash_lower_j_idt1036",{id:"formSmash:lower:j_idt1036",widgetVar:"widget_formSmash_lower_j_idt1036"}); Fler språkSkapa PrimeFaces.cw("CommandButton","widget_formSmash_lower_j_idt1045",{id:"formSmash:lower:j_idt1045",widgetVar:"widget_formSmash_lower_j_idt1045"}); Stäng PrimeFaces.cw("CommandButton","widget_formSmash_lower_j_idt1046",{id:"formSmash:lower:j_idt1046",widgetVar:"widget_formSmash_lower_j_idt1046"});
$(function(){PrimeFaces.cw("Dialog","citationDialog",{id:"formSmash:lower:j_idt1015",widgetVar:"citationDialog",width:"800",height:"600"});});

Begrens søket

RefereraExporteraLink til resultatlisten
http://kth.diva-portal.org/smash/resultList.jsf?query=&language=no&searchType=SIMPLE&noOfRows=50&sortOrder=author_sort_asc&sortOrder2=title_sort_asc&onlyFullText=false&sf=all&aq=%5B%5B%7B%22categoryId%22%3A%2211501%22%7D%5D%5D&aqe=%5B%5D&aq2=%5B%5B%5D%5D&af=%5B%5D $(function(){PrimeFaces.cw("InputTextarea","widget_formSmash_upper_j_idt544_recordPermLink",{id:"formSmash:upper:j_idt544:recordPermLink",widgetVar:"widget_formSmash_upper_j_idt544_recordPermLink",autoResize:true});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt544_j_idt546",{id:"formSmash:upper:j_idt544:j_idt546",widgetVar:"widget_formSmash_upper_j_idt544_j_idt546",target:"formSmash:upper:j_idt544:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Permanent link

Referera

Referensformatapa ieee modern-language-association-8th-edition vancouver Annet format $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_upper_j_idt566",{id:"formSmash:upper:j_idt566",widgetVar:"widget_formSmash_upper_j_idt566",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:upper:j_idt566",e:"change",f:"formSmash",p:"formSmash:upper:j_idt566",u:"formSmash:upper:otherStyle"},ext);}}});});

- apa
- ieee
- modern-language-association-8th-edition
- vancouver
- Annet format

Språkde-DE en-GB en-US fi-FI nn-NO nn-NB sv-SE Annet språk $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_upper_j_idt581",{id:"formSmash:upper:j_idt581",widgetVar:"widget_formSmash_upper_j_idt581",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:upper:j_idt581",e:"change",f:"formSmash",p:"formSmash:upper:j_idt581",u:"formSmash:upper:otherLanguage"},ext);}}});});

- de-DE
- en-GB
- en-US
- fi-FI
- nn-NO
- nn-NB
- sv-SE
- Annet språk

Utmatningsformathtml text asciidoc rtf $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_upper_j_idt591",{id:"formSmash:upper:j_idt591",widgetVar:"widget_formSmash_upper_j_idt591"});});

- html
- text
- asciidoc
- rtf

Treff pr side

- 5
- 10
- 20
- 50
- 100
- 250

Sortering

- Standard (Relevans)
- Forfatter A-Ø
- Forfatter Ø-A
- Tittel A-Ø
- Tittel Ø-A
- Type publikasjon A-Ø
- Type publikasjon Ø-A
- Eldste først
- Nyeste først
- Skapad (Eldste først)
- Skapad (Nyeste først)
- Senast uppdaterad (Eldste først)
- Senast uppdaterad (Nyeste først)
- Disputationsdatum (tidligste først)
- Disputationsdatum (siste først)

- Standard (Relevans)
- Forfatter A-Ø
- Forfatter Ø-A
- Tittel A-Ø
- Tittel Ø-A
- Type publikasjon A-Ø
- Type publikasjon Ø-A
- Eldste først
- Nyeste først
- Skapad (Eldste først)
- Skapad (Nyeste først)
- Senast uppdaterad (Eldste først)
- Senast uppdaterad (Nyeste først)
- Disputationsdatum (tidligste først)
- Disputationsdatum (siste først)

Merk

Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.

1. Search for events with a pair of displaced vertices from long-lived neutral particles decaying into hadronic jets in the ATLAS muon spectrometer in pp collisions at root s=13 TeV Aad, G. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_0_j_idt669",{id:"formSmash:items:resultList:0:j_idt669",widgetVar:"widget_formSmash_items_resultList_0_j_idt669",onLabel:"Aad, G. ",offLabel:"Aad, G. ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_0_j_idt672",{id:"formSmash:items:resultList:0:j_idt672",widgetVar:"widget_formSmash_items_resultList_0_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Aix Marseille Univ, CPPM, CNRS IN2P3, Marseille, France..PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:0:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Leopold, AlexanderKTH, Skolan för teknikvetenskap (SCI), Fysik, Partikel- och astropartikelfysik.Lundberg, OlofKTH, Skolan för teknikvetenskap (SCI), Fysik, Partikel- och astropartikelfysik.Lund-Jensen, BengtKTH, Skolan för teknikvetenskap (SCI), Fysik, Partikel- och astropartikelfysik.Ohm, ChristianKTH, Skolan för teknikvetenskap (SCI), Fysik, Partikel- och astropartikelfysik.Ripellino, GiuliaKTH, Skolan för teknikvetenskap (SCI), Fysik, Partikel- och astropartikelfysik.Shaheen, RabiaKTH, Skolan för teknikvetenskap (SCI), Fysik, Partikel- och astropartikelfysik.Shope, David R.KTH, Skolan för teknikvetenskap (SCI), Fysik, Partikel- och astropartikelfysik.Strandberg, JonasKTH, Skolan för teknikvetenskap (SCI), Fysik, Partikel- och astropartikelfysik.Zwalinski, L.CERN, Geneva, Switzerland..et al.,PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:0:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Search for events with a pair of displaced vertices from long-lived neutral particles decaying into hadronic jets in the ATLAS muon spectrometer in pp collisions at root s=13 TeV2022Inngår i: Physical Review D: covering particles, fields, gravitation, and cosmology, ISSN 2470-0010, E-ISSN 2470-0029, Vol. 106, nr 3, artikkel-id 032005Artikkel i tidsskrift (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_0_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:0:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_0_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); A search for events with two displaced vertices from long-lived particle (LLP) pairs using data collected by the ATLAS detector at the LHC is presented. This analysis uses 139 fb(-1) of proton-proton collision data at root s=13 TeV recorded in 2015-2018. The search employs techniques for reconstructing vertices of LLPs decaying to jets in the muon spectrometer displaced between 3 and 14 m with respect to the primary interaction vertex. The observed numbers of events are consistent with the expected background and limits for several benchmark signals are determined. For the Higgs boson with a mass of 125 GeV, the paper reports the first exclusion limits for branching fractions into neutral long-lived particles below 0.1%, while branching fractions above 10% are excluded at 95% confidence level for LLP proper lifetimes ranging from 4 cm to 72.4 m. In addition, the paper present the first results for the decay of LLPs into (tt) over bar in the ATLAS muon spectrometer.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:0:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 2. John-Nirenberg lemmas for a doubling measure Aalto, Danielet al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_1_j_idt672",{id:"formSmash:items:resultList:1:j_idt672",widgetVar:"widget_formSmash_items_resultList_1_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:1:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Berkovits, LauriKansanen, Outi ElinaKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.).Yue, HongPrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:1:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); John-Nirenberg lemmas for a doubling measure2011Inngår i: Studia Mathematica, ISSN 0039-3223, E-ISSN 1730-6337, Vol. 204, nr 1, s. 21-37Artikkel i tidsskrift (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_1_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:1:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_1_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We study, in the context of doubling metric measure spaces, a class of BMO type functions defined by John and Nirenberg. In particular, we present a new version of the Calderon-Zygmund decomposition in metric spaces and use it to prove the corresponding John Nirenberg inequality.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:1:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 3. The exact phase diagram for a semipermeable TASEP with nonlocal boundary jumps Aas, E.et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_2_j_idt672",{id:"formSmash:items:resultList:2:j_idt672",widgetVar:"widget_formSmash_items_resultList_2_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:2:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Ayyer, A.Linusson, SvanteKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).Potka, SamuKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:2:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); The exact phase diagram for a semipermeable TASEP with nonlocal boundary jumps2019Inngår i: Journal of Physics A: Mathematical and Theoretical, ISSN 1751-8113, E-ISSN 1751-8121, Vol. 52, nr 35, artikkel-id 355001Artikkel i tidsskrift (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_2_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:2:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_2_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We consider a finite one-dimensional totally asymmetric simple exclusion process with four types of particles, {1, 0, 1, }, in contact with reservoirs. Particles of species 0 can neither enter nor exit the lattice, and those of species are constrained to lie at the first and last site. Particles of species 1 enter from the left reservoir into either the first or second site, move rightwards, and leave from either the last or penultimate site. Conversely, particles of species 1 enter from the right reservoir into either the last or penultimate site, move leftwards, and leave from either the first or last site. This dynamics is motivated by a natural random walk on the Weyl group of type D. We compute the exact nonequilibrium steady state distribution using a matrix ansatz building on earlier work of Arita. We then give explicit formulas for the nonequilibrium partition function as well as densities and currents of all species in the steady state, and derive the phase diagram.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:2:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 4. A Markov Process on Cyclic Words Aas, Erik PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_3_j_idt669",{id:"formSmash:items:resultList:3:j_idt669",widgetVar:"widget_formSmash_items_resultList_3_j_idt669",onLabel:"Aas, Erik ",offLabel:"Aas, Erik ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:3:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:3:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); A Markov Process on Cyclic Words2014Doktoravhandling, med artikler (Annet vitenskapelig)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_3_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:3:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_3_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The TASEP (totally asymmetric simple exclusion process) studied here is a Markov chain on cyclic words over the alphabet{1,2,...,n} given by at each time step sorting an adjacent pair of letters chosen uniformly at random. For example, from the word 3124 one may go to 1324, 3124, 3124, 4123 by sorting the pair 31, 12, 24, or 43.

Two words have the sametype if they are permutations of each other. If we restrict TASEP to words of some particular type

**m**we get an ergodic Markov chain whose stationary distribution we denote by ζ_{m}. Soζ_{m }(u) is the asymptotic proportion of time spent in the state*u*if the chain started in some word of type**m**. The distribution ζ is the main object of study in this thesis. This distribution turns out to have several remarkable properties, and alternative characterizations. It has previously been studied both from physical, combinatorial, and probabilitistic viewpoints.In the first chapter we give an extended summary of known results and results in this thesis concerning ζ. The new results are described (and proved) in detail in Papers I - IV.

The new results in Papers I and II include an explicit formula for the value ofζat sorted words and a product formula for decomposable words. We also compute some correlation functions for ζ. In Paper III we study of a generalization of TASEP to Weyl groups. In Paper IV we study a certain scaling limit of ζ, finding several interesting patterns of which we prove some. We also study an inhomogenous version of TASEP, in which different particles get sorted at different rates, which generalizes the homogenous version in several aspects. In the first chapter we compute some correlation functions for ζ

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:3:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fulltekst (pdf)Thesis$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_3_j_idt946_0_j_idt949",{id:"formSmash:items:resultList:3:j_idt946:0:j_idt949",widgetVar:"widget_formSmash_items_resultList_3_j_idt946_0_j_idt949",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:3:j_idt946:0:fullText"});}); 5. Limit points of the iterative scaling procedure Aas, Erik PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_4_j_idt669",{id:"formSmash:items:resultList:4:j_idt669",widgetVar:"widget_formSmash_items_resultList_4_j_idt669",onLabel:"Aas, Erik ",offLabel:"Aas, Erik ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:4:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:4:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Limit points of the iterative scaling procedure2014Inngår i: Annals of Operations Research, ISSN 0254-5330, E-ISSN 1572-9338, Vol. 215, nr 1, s. 15-23Artikkel i tidsskrift (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_4_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:4:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_4_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The iterative scaling procedure (ISP) is an algorithm which computes a sequence of matrices, starting from some given matrix. The objective is to find a matrix 'proportional' to the given matrix, having given row and column sums. In many cases, for example if the initial matrix is strictly positive, the sequence is convergent. It is known that the sequence has at most two limit points. When these are distinct, convergence to these two points can be slow. We give an efficient algorithm which finds the limit points, invoking the ISP only on subproblems for which the procedure is convergent.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:4:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 6. Stationary probability of the identity for the TASEP on a Ring Aas, Erik PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_5_j_idt669",{id:"formSmash:items:resultList:5:j_idt669",widgetVar:"widget_formSmash_items_resultList_5_j_idt669",onLabel:"Aas, Erik ",offLabel:"Aas, Erik ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:5:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:5:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Stationary probability of the identity for the TASEP on a Ring2012Annet (Annet vitenskapelig)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_5_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:5:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_5_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Consider the following Markov chain on permutations of length n. At each time step we choose a random position. If the letter at that position is smaller than the letter immediately to the left (cyclically) then these letters swap positions. Otherwise nothing happens, corresponding to a loop in the Markov chain. This is the circular TASEP. We compute the average proportion of time the chain spends at the identity permutation (and, in greater generality, at sorted words). This answers a conjecture by Thomas Lam.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:5:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fulltekst (pdf)fulltext$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_5_j_idt946_0_j_idt949",{id:"formSmash:items:resultList:5:j_idt946:0:j_idt949",widgetVar:"widget_formSmash_items_resultList_5_j_idt946_0_j_idt949",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:5:j_idt946:0:fullText"});}); 7. TASEP in any Weyl group Aas, Erik PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_6_j_idt669",{id:"formSmash:items:resultList:6:j_idt669",widgetVar:"widget_formSmash_items_resultList_6_j_idt669",onLabel:"Aas, Erik ",offLabel:"Aas, Erik ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:6:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:6:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); TASEP in any Weyl groupManuskript (preprint) (Annet vitenskapelig)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_6_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:6:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_6_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We investigate a Markov chain dened by Thomas Lam [6], whichgeneralizes the multi-type TASEP on a ring to any Weyl group. For groups of typeC we dene an analogue of the multiline queues of Ferrari and Martin (which com-pute the stationary distribution for the classical TASEP). While our constructiondoes not suce for nding the stationary distribution, the construction gives thestationary distribution of a certain projection of Lam's chain. Also, our approach isincremental, in the sense that the construction appears to t into a pattern of 'con-jugation matrices', which remains to be fully worked out. We conjecture an explicitformula for the partition function of the model. Finally, we prove a theorem for theclassical TASEP which ts into the picture of viewing TASEP in a permutation-freeway.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:6:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 8. Limiting directions for random walks in classical affine Weyl groups Aas, Eriket al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_7_j_idt672",{id:"formSmash:items:resultList:7:j_idt672",widgetVar:"widget_formSmash_items_resultList_7_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:7:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Ayyer, ArvindLinusson, SvanteKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).Potka, SamuKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:7:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Limiting directions for random walks in classical affine Weyl groupsManuskript (preprint) (Annet vitenskapelig)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_7_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:7:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_7_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Let be a finite Weyl group and the corresponding affine Weyl group. A random element of can be obtained as a reduced random walk on the alcoves of . By a theorem of Lam (Ann. Probab. 2015), such a walk almost surely approaches one of many directions. We compute these directions when is , and and the random walk is weighted by Kac and dual Kac labels. This settles Lam's questions for types and in the affirmative and for type in the negative. The main tool is a combinatorial two row model for a totally asymmetric simple exclusion process called the -TASEP, with four parameters. By specializing the parameters in different ways, we obtain TASEPs for each of the Weyl groups mentioned above. Computing certain correlations in these TASEPs gives the desired limiting directions.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:7:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fulltekst (pdf)fulltext$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_7_j_idt946_0_j_idt949",{id:"formSmash:items:resultList:7:j_idt946:0:j_idt949",widgetVar:"widget_formSmash_items_resultList_7_j_idt946_0_j_idt949",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:7:j_idt946:0:fullText"});}); 9. Limiting Directions for Random Walks in Classical Affine Weyl Groups Aas, Erik PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_8_j_idt669",{id:"formSmash:items:resultList:8:j_idt669",widgetVar:"widget_formSmash_items_resultList_8_j_idt669",onLabel:"Aas, Erik ",offLabel:"Aas, Erik ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_8_j_idt672",{id:"formSmash:items:resultList:8:j_idt672",widgetVar:"widget_formSmash_items_resultList_8_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Penn State Univ, Dept Math, University Pk, PA 16802 USA..PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:8:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Ayyer, ArvindIndian Inst Sci, Dept Math, Bangalore 560012, Karnataka, India..Linusson, SvanteKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).Potka, SamuKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:8:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Limiting Directions for Random Walks in Classical Affine Weyl Groups2021Inngår i: International mathematics research notices, ISSN 1073-7928, E-ISSN 1687-0247, Vol. 2023, nr 4, s. 3092-3137Artikkel i tidsskrift (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_8_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:8:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_8_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Let W be a finite Weyl group and (W) over tilde the corresponding affine Weyl group. A random element of (W) over tilde can be obtained as a reduced random walk on the alcoves of (W) over tilde. By a theorem of Lam (Ann. Prob. 2015), such a walk almost surely approaches one of vertical bar W vertical bar many directions. We compute these directions when W is B-n, C-n, and D-n, and the random walk is weighted by Kac and dual Kac labels. This settles Lam's questions for types B and C in the affirmative and for type D in the negative. The main tool is a combinatorial two row model for a totally asymmetric simple exclusion process (TASEP) called the D*-TASEP, with four parameters. By specializing the parameters in different ways, we obtain TASEPs for each of the Weyl groups mentioned above. Computing certain correlations in these TASEPs gives the desired limiting directions.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:8:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 10. Continuous multiline queues and TASEP Aas, Erik PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_9_j_idt669",{id:"formSmash:items:resultList:9:j_idt669",widgetVar:"widget_formSmash_items_resultList_9_j_idt669",onLabel:"Aas, Erik ",offLabel:"Aas, Erik ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_9_j_idt672",{id:"formSmash:items:resultList:9:j_idt672",widgetVar:"widget_formSmash_items_resultList_9_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:9:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Linusson, SvanteKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:9:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Continuous multiline queues and TASEPManuskript (preprint) (Annet vitenskapelig)Fulltekst (pdf)fulltext$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_9_j_idt946_0_j_idt949",{id:"formSmash:items:resultList:9:j_idt946:0:j_idt949",widgetVar:"widget_formSmash_items_resultList_9_j_idt946_0_j_idt949",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:9:j_idt946:0:fullText"});}); 11. Continuous multi-line queues and TASEP Aas, Erik PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_10_j_idt669",{id:"formSmash:items:resultList:10:j_idt669",widgetVar:"widget_formSmash_items_resultList_10_j_idt669",onLabel:"Aas, Erik ",offLabel:"Aas, Erik ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_10_j_idt672",{id:"formSmash:items:resultList:10:j_idt672",widgetVar:"widget_formSmash_items_resultList_10_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:10:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Linusson, SvanteKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:10:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Continuous multi-line queues and TASEP2018Inngår i: Annales de l'Institut Henri Poincare D: Combinatorics, Physics and their Interactions, ISSN 2308-5827, E-ISSN 2308-5835, Vol. 5, nr 1, s. 127-152Artikkel i tidsskrift (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_10_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:10:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_10_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); In this paper, we study a distribution Xi of labeled particles on a continuous ring. It arises in three different ways, all related to the multi-type TASEP on a ring. We prove formulas for the probability density function for some permutations and give conjectures for a larger class. We give a complete conjecture for the probability of two particles i, j being next to each other on the cycle, for which we prove some cases. We also find that two natural events associated to the process have exactly the same probability expressed as a Vandermonde determinant. It is unclear whether this is just a coincidence or a consequence of a deeper connection.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:10:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 12. A product formula for the TASEP on a ring Aas, Erik PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_11_j_idt669",{id:"formSmash:items:resultList:11:j_idt669",widgetVar:"widget_formSmash_items_resultList_11_j_idt669",onLabel:"Aas, Erik ",offLabel:"Aas, Erik ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_11_j_idt672",{id:"formSmash:items:resultList:11:j_idt672",widgetVar:"widget_formSmash_items_resultList_11_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:11:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Sjöstrand, JonasKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:11:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); A product formula for the TASEP on a ring2016Inngår i: Random structures & algorithms (Print), ISSN 1042-9832, E-ISSN 1098-2418, Vol. 48, nr 2, s. 247-259Artikkel i tidsskrift (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_11_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:11:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_11_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); For a random permutation sampled from the stationary distributionof the TASEP on a ring, we show that, conditioned on the event that the rstentries are strictly larger than the last entries, the order of the rst entries isindependent of the order of the last entries. The proof uses multi-line queues asdened by Ferrari and Martin, and the theorem has an enumerative combinatorialinterpretation in that setting.As an application we prove a conjecture of Lam and Williams concerningSchubert factors of the stationary probability of certain states.Finally, we present a conjecture for the case where the small and large entriesare not separated.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:11:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 13. A product formula for the TASEP on a ring - Extended Abstract Aas, Erik PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_12_j_idt669",{id:"formSmash:items:resultList:12:j_idt669",widgetVar:"widget_formSmash_items_resultList_12_j_idt669",onLabel:"Aas, Erik ",offLabel:"Aas, Erik ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_12_j_idt672",{id:"formSmash:items:resultList:12:j_idt672",widgetVar:"widget_formSmash_items_resultList_12_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:12:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Sjöstrand, JonasKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:12:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); A product formula for the TASEP on a ring - Extended Abstract2014Inngår i: Discrete Mathematics and Theoretical Computer Science, Discrete Mathematics and Theoretical Computer Science , 2014, s. 633-641Konferansepaper (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_12_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:12:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_12_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); For a random permutation sampled from the stationary distribution of the TASEP on a ring, we show that, conditioned on the event that the first entries are strictly larger than the last entries, the order of the first entries is independent of the order of the last entries. The proof uses multi-line queues as defined by Ferrari and Martin, and the theorem has an enumerative combinatorial interpretation in that setting. Finally, we present a conjecture for the case where the small and large entries are not separated.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:12:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 14. Optimal kontroll av en cykel Abakar, Ibrahim PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_13_j_idt669",{id:"formSmash:items:resultList:13:j_idt669",widgetVar:"widget_formSmash_items_resultList_13_j_idt669",onLabel:"Abakar, Ibrahim ",offLabel:"Abakar, Ibrahim ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:13:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:13:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Optimal kontroll av en cykel2022Independent thesis Basic level (degree of Bachelor), 10 poäng / 15 hpOppgaveAbstract [sv] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_13_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:13:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_13_j_idt714_0_j_idt715",onLabel:"Abstract [sv]",offLabel:"Abstract [sv]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Optimal kontroll är studien om hur man på bästa sätt kan kontrollera ett system, givet kontrollvariabler, för att minimera ett specifikt prestationsindex. Denna teori användes för att studera hur en cykel optimalt skulle kunna balanseras. Cykeln modellerades med tre tillståndsparametrar, dess lutning theta, vinkelhastigheten hos lutningen theta' samt dess styrvinkeln alpha, som togs fram ifrån två differentialekvationer. Dessa tillstånd, tillsammans med en kontrollvariabel delta=alpha' (styrets vinkelhastighet), användes sedan med dynamisk programmering samt LQR-kontroll, två grenar inom optimal kontroll, för att undersöka kontroll av cykeln. Resultaten visar på att alla tillståndsparametrar konvergerar mot noll för båda metoderna innan sluttiden vilket indikerar på att cykeln lyckades balanseras, i teorin. Kontrollen som användes, styrets vinkelhastighet, var även rimlig och uppfattades som intuitiva.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:13:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fulltekst (pdf)fulltext$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_13_j_idt946_0_j_idt949",{id:"formSmash:items:resultList:13:j_idt946:0:j_idt949",widgetVar:"widget_formSmash_items_resultList_13_j_idt946_0_j_idt949",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:13:j_idt946:0:fullText"});}); 15. Predicting Stock Price Direction for Asian Small Cap Stocks with Machine Learning Methods Abazari, Tina PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_14_j_idt669",{id:"formSmash:items:resultList:14:j_idt669",widgetVar:"widget_formSmash_items_resultList_14_j_idt669",onLabel:"Abazari, Tina ",offLabel:"Abazari, Tina ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_14_j_idt672",{id:"formSmash:items:resultList:14:j_idt672",widgetVar:"widget_formSmash_items_resultList_14_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:14:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Baghchesara, SherwinKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:14:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Predicting Stock Price Direction for Asian Small Cap Stocks with Machine Learning Methods2021Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgaveAbstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_14_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:14:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_14_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Portfolio managers have a great interest in detecting high-performing stocks early on. Detecting outperforming stocks has for long been of interest from a research as well as financial point of view. Quantitative methods to predict stock movements have been widely studied in diverse contexts, where some present promising results. The quantitative algorithms for such prediction models can be, to name a few, support vector machines, tree-based methods, and regression models, where each one can carry different predictive power. Most previous research focuses on indices such as S&P 500 or large-cap stocks, while small- and micro-cap stocks have been examined to a lesser extent. These types of stocks also commonly share the characteristic of high volatility, with prospects that can be difficult to assess. This study examines to which extent widely studied quantitative methods such as random forest, support vector machine, and logistic regression can produce accurate predictions of stock price directions on a quarterly and yearly basis. The problem is modeled as a binary classification task, where the aim is to predict whether a stock achieves a return above or below a benchmark index. The focus lies on Asian small- and micro-cap stocks. The study concludes that the random forest method for a binary yearly prediction produces the highest accuracy of 69.64%, where all three models produced higher accuracy than a binary quarterly prediction. Although the statistical power of the models can be ruled adequate, more extensive studies are desirable to examine whether other models or variables can increase the prediction accuracy for small- and micro-cap stocks.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:14:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fulltekst (pdf)fulltext$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_14_j_idt946_0_j_idt949",{id:"formSmash:items:resultList:14:j_idt946:0:j_idt949",widgetVar:"widget_formSmash_items_resultList_14_j_idt946_0_j_idt949",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:14:j_idt946:0:fullText"});}); 16. Updated relations for the uniaxial compressive strength of marlstones based on P-wave velocity and point load index test Abbaszadeh Shahri, Abbas PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_15_j_idt669",{id:"formSmash:items:resultList:15:j_idt669",widgetVar:"widget_formSmash_items_resultList_15_j_idt669",onLabel:"Abbaszadeh Shahri, Abbas ",offLabel:"Abbaszadeh Shahri, Abbas ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_15_j_idt672",{id:"formSmash:items:resultList:15:j_idt672",widgetVar:"widget_formSmash_items_resultList_15_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för arkitektur och samhällsbyggnad (ABE), Byggvetenskap.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:15:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Larsson, StefanKTH, Skolan för arkitektur och samhällsbyggnad (ABE), Byggvetenskap, Jord- och bergmekanik.Johansson, FredrikKTH, Skolan för arkitektur och samhällsbyggnad (ABE), Byggvetenskap, Jord- och bergmekanik.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:15:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Updated relations for the uniaxial compressive strength of marlstones based on P-wave velocity and point load index test2016Inngår i: INNOVATIVE INFRASTRUCTURE SOLUTIONS, ISSN 2364-4176, Vol. 1, nr 1, artikkel-id UNSP 17Artikkel i tidsskrift (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_15_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:15:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_15_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Although there are many proposed relations for different rock types to predict the uniaxial compressive strength (UCS) as a function of P-wave velocity (V-P) and point load index (Is), only a few of them are focused on marlstones. However, these studies have limitations in applicability since they are mainly based on local studies. In this paper, an attempt is therefore made to present updated relations for two previous proposed correlations for marlstones in Iran. The modification process is executed through multivariate regression analysis techniques using a provided comprehensive database for marlstones in Iran, including UCS, V-P and Is from publications and validated relevant sources comprising 119 datasets. The accuracy, appropriateness and applicability of the obtained modifications were tested by means of different statistical criteria and graph analyses. The conducted comparison between updated and previous proposed relations highlighted better applicability in the prediction of UCS using the updated correlations introduced in this study. However, the derived updated predictive models are dependent on rock types and test conditions, as they are in this study.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:15:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 17. Lefschetz properties of some codimension three Artinian Gorenstein algebras Abdallah, Nancy PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_16_j_idt669",{id:"formSmash:items:resultList:16:j_idt669",widgetVar:"widget_formSmash_items_resultList_16_j_idt669",onLabel:"Abdallah, Nancy ",offLabel:"Abdallah, Nancy ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_16_j_idt672",{id:"formSmash:items:resultList:16:j_idt672",widgetVar:"widget_formSmash_items_resultList_16_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Univ Borås, Borås, Sweden..PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:16:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Altafi, NasrinKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.). KTH Royal Inst Technol, Dept Math, S-10044 Stockholm, Sweden.;Queens Univ, Dept Math & Stat, Kingston, ON K7L 3N6, Canada..Iarrobino, AnthonyNortheastern Univ, Dept Math, Boston, MA 02115 USA..Seceleanu, AlexandraUniv Nebraska Lincoln, Dept Math, Lincoln, NE 68588 USA..Yameogo, JoachimUniv Cote dAzur, CNRS, LJAD, Nice, France..PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:16:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lefschetz properties of some codimension three Artinian Gorenstein algebras2023Inngår i: Journal of Algebra, ISSN 0021-8693, E-ISSN 1090-266X, Vol. 625, s. 28-45Artikkel i tidsskrift (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_16_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:16:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_16_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Codimension two Artinian algebras have the strong and weak Lefschetz properties provided the characteristic is zero or greater than the socle degree. It is open to what extent such results might extend to codimension three Artinian Gorenstein algebras. Despite much work, the strong Lefschetz property for codimension three Artinian Gorenstein algebra has remained largely mysterious; our results build on and strengthen some of the previous results. We here show that every standard-graded codimension three Artinian Gorenstein algebra A having maximum value of the Hilbert function at most six has the strong Lefschetz property, provided that the characteristic is zero. When the characteristic is greater than the socle degree of A, we show that A is almost strong Lefschetz, they are strong Lefschetz except in the extremal pair of degrees.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:16:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 18. Learning Stochastic Nonlinear Dynamical Systems Using Non-stationary Linear Predictors Abdalmoaty, Mohamed PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_17_j_idt669",{id:"formSmash:items:resultList:17:j_idt669",widgetVar:"widget_formSmash_items_resultList_17_j_idt669",onLabel:"Abdalmoaty, Mohamed ",offLabel:"Abdalmoaty, Mohamed ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:17:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:17:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Learning Stochastic Nonlinear Dynamical Systems Using Non-stationary Linear Predictors2017Licentiatavhandling, monografi (Annet vitenskapelig)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_17_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:17:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_17_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The estimation problem of stochastic nonlinear parametric models is recognized to be very challenging due to the intractability of the likelihood function. Recently, several methods have been developed to approximate the maximum likelihood estimator and the optimal mean-square error predictor using Monte Carlo methods. Albeit asymptotically optimal, these methods come with several computational challenges and fundamental limitations.

The contributions of this thesis can be divided into two main parts. In the first part, approximate solutions to the maximum likelihood problem are explored. Both analytical and numerical approaches, based on the expectation-maximization algorithm and the quasi-Newton algorithm, are considered. While analytic approximations are difficult to analyze, asymptotic guarantees can be established for methods based on Monte Carlo approximations. Yet, Monte Carlo methods come with their own computational difficulties; sampling in high-dimensional spaces requires an efficient proposal distribution to reduce the number of required samples to a reasonable value.

In the second part, relatively simple prediction error method estimators are proposed. They are based on non-stationary one-step ahead predictors which are linear in the observed outputs, but are nonlinear in the (assumed known) input. These predictors rely only on the first two moments of the model and the computation of the likelihood function is not required. Consequently, the resulting estimators are defined via analytically tractable objective functions in several relevant cases. It is shown that, under mild assumptions, the estimators are consistent and asymptotically normal. In cases where the first two moments are analytically intractable due to the complexity of the model, it is possible to resort to vanilla Monte Carlo approximations. Several numerical examples demonstrate a good performance of the suggested estimators in several cases that are usually considered challenging.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:17:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fulltekst (pdf)fulltext$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_17_j_idt946_0_j_idt949",{id:"formSmash:items:resultList:17:j_idt946:0:j_idt949",widgetVar:"widget_formSmash_items_resultList_17_j_idt946_0_j_idt949",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:17:j_idt946:0:fullText"});}); 19. Non-linearstates in parallel Blasius boundary layer Abdullah Al Ahad, Muhammed PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_18_j_idt669",{id:"formSmash:items:resultList:18:j_idt669",widgetVar:"widget_formSmash_items_resultList_18_j_idt669",onLabel:"Abdullah Al Ahad, Muhammed ",offLabel:"Abdullah Al Ahad, Muhammed ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Numerisk analys, NA.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:18:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:18:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Non-linearstates in parallel Blasius boundary layer2014Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgaveAbstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_18_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:18:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_18_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); There is large theoretical, experimental and numerical interest in studying boundary layers, which develop around any body moving through a fluid. The simplest of these boundary layers lead to the theoretical abstraction of a so-called Blasius boundary layer, which can be derived under the assumption of a flat plate and zero external pressure gradient. The Blasius solution is characterised by a slow growth of the boundary layer in the streamwise direction. For practical purposes, in particular related to studying transition scenarios, non-linear finite-amplitude states (exact coherent states, edge states), but also for turbulence, a major simplification of the problem could be attained by removing this slow streamwise growth, and instead consider a parallel boundary layer. Parallel boundary layers are found in reality, e.g. when applying suction (asymptotic suction boundary layer) or rotation (Ekman boundary layer), but not in the Blasius case. As this is only a model which is not an exact solution to the Navier-Stokes (or boundary-layer) equations, some modifications have to be introduced into the governing equations in order for such an approach to be feasible. Spalart and Yang introduced a modification term to the governing Navier-Stokes equations in 1987. In this thesis work, we adapted the amplitude of the modification term introduced by Spalart and Yang to identify the nonlinear states in the parallel Blasius boundary layer. A final application of this modification was in determining the so-called edge states for boundary layers, previously found in the asymptotic suction boundary layer

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:18:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fulltekst (pdf)fulltext$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_18_j_idt946_0_j_idt949",{id:"formSmash:items:resultList:18:j_idt946:0:j_idt949",widgetVar:"widget_formSmash_items_resultList_18_j_idt946_0_j_idt949",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:18:j_idt946:0:fullText"});}); 20. Pricing and Modeling Heavy Tailed Reinsurance Treaties - A Pricing Application to Risk XL Contracts Abdullah Mohamad, Ormia PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_19_j_idt669",{id:"formSmash:items:resultList:19:j_idt669",widgetVar:"widget_formSmash_items_resultList_19_j_idt669",onLabel:"Abdullah Mohamad, Ormia ",offLabel:"Abdullah Mohamad, Ormia ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_19_j_idt672",{id:"formSmash:items:resultList:19:j_idt672",widgetVar:"widget_formSmash_items_resultList_19_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematisk statistik.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:19:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Westin, AnnaKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematisk statistik.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:19:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Pricing and Modeling Heavy Tailed Reinsurance Treaties - A Pricing Application to Risk XL Contracts2023Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgaveAbstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_19_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:19:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_19_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); To estimate the risk of a loss occurring for insurance takers is a difficult task in the insurance industry. It is an even more difficult task to price the risk for reinsurance companies which insures the primary insurers. Insurance that is bought by an insurance company, the cedent, from another insurance company, the reinsurer, is called treaty reinsurance. This type of reinsurance is the main focus in this thesis. A very common risk to insure, is the risk of fire in municipal and commercial properties which is the risk that is priced in this thesis. This thesis evaluates Länsförsäkringar AB's current pricing model which calculates the risk premium for Risk XL contracts. The goal of this thesis is to find areas of improvement for tail risk pricing. The risk premium can be calculated commonly by using one of three different types of pricing models, experience rating, exposure rating and frequency-severity rating. This thesis focuses on frequency-severity pricing, which is a model that assumes independence between the frequency and the severity of losses, and therefore splits the two into separate models. This is a very common model used when pricing Risk XL contracts. The risk premium is calculated with the help of loss data from two insurance companies, from a Norwegian and a Finnish insurance company. The main focus of this thesis is to price the risk with the help of extreme value theory, mainly with the method of moments method to model the frequency of losses, and peaks over threshold model to model the severity of the losses. In order to model the estimated frequency of losses by using the method of moments method, two distributions are compared, the Poisson and the negative binomial distribution. There are different distributions that can be used to model the severity of losses. In order to evaluate which distribution is optimal to use, two different Goodness of Fit tests are applied, the Kolmogorov-Smirnov and the Anderson-Darling test. The Peaks over threshold model is a model that can be used with the Pareto distribution. With the help of the Hill estimator we are able to calculate a threshold $u$, which regulates the tail of the Pareto curve. To estimate the rest of the ingoing parameters in the generalized Pareto distribution, the maximum likelihood and the least squares method are used. Lastly, the bootstrap method is used to estimate the uncertainty in the price which was calculated with the help of the estimated parameters. From this, empirical percentiles are calculated and set as guidelines to where the risk premium should lie between, in order for both the data sets to be considered fairly priced.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:19:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fulltekst (pdf)fulltext$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_19_j_idt946_0_j_idt949",{id:"formSmash:items:resultList:19:j_idt946:0:j_idt949",widgetVar:"widget_formSmash_items_resultList_19_j_idt946_0_j_idt949",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:19:j_idt946:0:fullText"});}); 21. Multiscale Methods for Wave Problems in Heterogeneous Media Abdulle, A.et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_20_j_idt672",{id:"formSmash:items:resultList:20:j_idt672",widgetVar:"widget_formSmash_items_resultList_20_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:20:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Henning, PatrickKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Numerisk analys, NA.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:20:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Multiscale Methods for Wave Problems in Heterogeneous Media2017Inngår i: Handbook of Numerical Analysis, Elsevier B.V. , 2017, s. 545-576Konferansepaper (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_20_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:20:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_20_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); In this chapter we give a survey on various multiscale methods for the numerical solution of second-order hyperbolic equations in highly heterogeneous media. We concentrate on the wave equation and distinguish between two classes of applications. First we discuss numerical methods for the wave equation in heterogeneous media without scale separation. Such a setting is for instance encountered in the geosciences, where natural structures often exhibit a continuum of different scales, that all need to be resolved numerically to get meaningful approximations. Approaches tailored for these settings typically involve the construction of generalized finite element spaces, where the basis functions incorporate information about the data variations. In the second part of the chapter, we discuss numerical methods for the case of structured media with scale separation. This setting is for instance encountered in engineering sciences, where materials are often artificially designed. If this is the case, the structure and the scale separation can be explicitly exploited to compute appropriate homogenized/upscaled wave models that only exhibit a single coarse scale and that can be hence solved at significantly reduced computational costs.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:20:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 22. Localized orthogonal decomposition method for the wave equation with a continuum of scales Abdulle, Assyret al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_21_j_idt672",{id:"formSmash:items:resultList:21:j_idt672",widgetVar:"widget_formSmash_items_resultList_21_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:21:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Henning, PatrickKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Numerisk analys, NA.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:21:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Localized orthogonal decomposition method for the wave equation with a continuum of scales2017Inngår i: Mathematics of Computation, ISSN 0025-5718, E-ISSN 1088-6842, Vol. 86, nr 304, s. 549-587Artikkel i tidsskrift (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_21_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:21:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_21_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); This paper is devoted to numerical approximations for the wave equation with a multiscale character. Our approach is formulated in the framework of the Localized Orthogonal Decomposition (LOD) interpreted as a numerical homogenization with an L2-projection. We derive explicit convergence rates of the method in the L∞(L2)-, W1,∞(L2)-and L∞(H1)-norms without any assumptions on higher order space regularity or scale-separation. The order of the convergence rates depends on further graded assumptions on the initial data. We also prove the convergence of the method in the framework of G-convergence without any structural assumptions on the initial data, i.e. without assuming that it is well-prepared. This rigorously justifies the method. Finally, the performance of the method is demonstrated in numerical experiments.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:21:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 23. Automatingand optimizing pile group design using a Genetic Algorithm Abedin, Arian PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_22_j_idt669",{id:"formSmash:items:resultList:22:j_idt669",widgetVar:"widget_formSmash_items_resultList_22_j_idt669",onLabel:"Abedin, Arian ",offLabel:"Abedin, Arian ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_22_j_idt672",{id:"formSmash:items:resultList:22:j_idt672",widgetVar:"widget_formSmash_items_resultList_22_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:22:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Ligai, WolmirKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:22:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Automatingand optimizing pile group design using a Genetic Algorithm2018Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgaveAbstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_22_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:22:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_22_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); In bridge design, a set of piles is referred to as a pile group. The design process of pile groups employed by many firms is currently manual, time consuming, and produces pile groups that are not robust against placement errors.

This thesis applies the metaheuristic method Genetic Algorithm to automate and improve the design of pile groups for bridge column foundations. A software is developed and improved by implementing modifications to the Genetic Algorithm. The algorithm is evaluated by the pile groups it produces, using the Monte Carlo method to simulate errors for the purpose of testing the robustness. The results are compared with designs provided by the consulting firm Tyrens AB.

The software is terminated manually, and generally takes less than half an hour to produce acceptable pile groups. The developed Genetic Algorithm Software produces pile groups that are more robust than the manually designed pile groups to which they are compared, using the Monte Carlo method. However, due to the visually disorganized designs, the pile groups produced by the algorithm may be di cult to get approved by Trafikverket. The software might require further modifications addressing this problem before it can be of practical use.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:22:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fulltekst (pdf)fulltext$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_22_j_idt946_0_j_idt949",{id:"formSmash:items:resultList:22:j_idt946:0:j_idt949",widgetVar:"widget_formSmash_items_resultList_22_j_idt946_0_j_idt949",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:22:j_idt946:0:fullText"});}); 24. Predicting Customer Conversion using Supervised Machine Learning Aboud, Stephanie PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_23_j_idt669",{id:"formSmash:items:resultList:23:j_idt669",widgetVar:"widget_formSmash_items_resultList_23_j_idt669",onLabel:"Aboud, Stephanie ",offLabel:"Aboud, Stephanie ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematisk statistik.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:23:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:23:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Predicting Customer Conversion using Supervised Machine Learning2021Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgaveAbstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_23_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:23:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_23_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The growth of e-commerce has been evident over the past years and for companies like Klarna that provides payment solutions, focusing on the purchase experience is more important than ever. With that goal in mind, more companies are using machine learning methods and tools to make predictions and forecast future outcomes, giving them a competitive advantage on the market. This thesis aims to apply supervised machine learning techniques to predict customer conversion, i.e. predict if a customer with a started shopping session will complete the purchase. The purpose of the project is to also determine which supervised learning algorithm performs the best when predicting customer conversion, with regards to a set of model evaluation metrics. The classical classification method Logistic Regression was tested, as well as the machine learning methods Support vector Machine, Random forest and XGBoost. The metrics used to evaluate the model performances were Precision, Recall, F1- and AUC-scores. Furthermore, the SHapley Additive exPlanations approach was implemented for feature importance and for interpreting tree-based models. The results showed that it is in fact possible to predict customer conversion using machine learning. All models yielded good performance and the difference in performance was relatively small. XGBoost performed slightly better than the rest of the models.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:23:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fulltekst (pdf)fulltext$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_23_j_idt946_0_j_idt949",{id:"formSmash:items:resultList:23:j_idt946:0:j_idt949",widgetVar:"widget_formSmash_items_resultList_23_j_idt946_0_j_idt949",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:23:j_idt946:0:fullText"});}); 25. Evaluation of Machine Learning Methods for Time Series Forecasting on E-commerce Data Abrahamsson, Peter PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_24_j_idt669",{id:"formSmash:items:resultList:24:j_idt669",widgetVar:"widget_formSmash_items_resultList_24_j_idt669",onLabel:"Abrahamsson, Peter ",offLabel:"Abrahamsson, Peter ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_24_j_idt672",{id:"formSmash:items:resultList:24:j_idt672",widgetVar:"widget_formSmash_items_resultList_24_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematisk statistik.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:24:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Ahlqvist, NiklasKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematisk statistik.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:24:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Evaluation of Machine Learning Methods for Time Series Forecasting on E-commerce Data2022Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgaveAbstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_24_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:24:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_24_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Within demand forecasting, and specifically within the field of e-commerce, the provided data often contains erratic behaviours which are difficult to explain. This induces contradictions to the common assumptions within classical approaches for time series analysis. Yet, classical and naive approaches are still commonly used. Machine learning could be used to alleviate such problems. This thesis evaluates four models together with Swedish fin-tech company QLIRO AB. More specifically, a MLR (Multiple Linear Regression) model, a classic Box-Jenkins model (SARIMAX), an XGBoost model, and a LSTM-network (Long Short-Term Memory). The provided data consists of aggregated total daily reservations by e-merchants within the Nordic market from 2014. Some data pre processing was required and a smoothed version of the data set was created for comparison. Each model was constructed according to their specific requirements but with similar feature engineering. Evaluation was then made on a monthly level with a forecast horizon of 30 days during 2021. The results shows that both the MLR and the XGBoost provides the most consistent results together with perks for being easy to use. After these two, the LSTM-network showed the best results for November and December on the original data set but worst overall. Yet it had good performance on the smoothed data set and was then comparable to the first two. The SARIMAX was the worst performing of all the models considered in this thesis and was not as easy to implement.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:24:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fulltekst (pdf)fulltext$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_24_j_idt946_0_j_idt949",{id:"formSmash:items:resultList:24:j_idt946:0:j_idt949",widgetVar:"widget_formSmash_items_resultList_24_j_idt946_0_j_idt949",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:24:j_idt946:0:fullText"});}); 26. Sustainable Investments - The impact of the EU green taxonomy Abrahamsson, Ville PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_25_j_idt669",{id:"formSmash:items:resultList:25:j_idt669",widgetVar:"widget_formSmash_items_resultList_25_j_idt669",onLabel:"Abrahamsson, Ville ",offLabel:"Abrahamsson, Ville ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_25_j_idt672",{id:"formSmash:items:resultList:25:j_idt672",widgetVar:"widget_formSmash_items_resultList_25_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematisk statistik.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:25:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Ekblom, JuliaKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematisk statistik.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:25:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Sustainable Investments - The impact of the EU green taxonomy2021Independent thesis Basic level (degree of Bachelor), 10 poäng / 15 hpOppgaveAbstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_25_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:25:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_25_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The increasing environmental issues and the measures taken to tackle them, is a topic of high significance in today's society. In light of this, the EU is underway with developing a taxonomy classifying sustainable economic activities in hopes to raise awareness, increase transparency regarding environmental impact, and motivate investors to invest sustainable. This paper aims to examine if the taxonomy is relevant to its cause, as well as if sustainability factors can be identified with linear regression connected to growth in a company's value, which may motivate sustainable investments. Several interviews were conducted, along with the creation of a mathematical model. The conclusions drawn was that it is not viable to determine a company's growth in value using solely sustainability factors. However, the results were promising regarding the implementation of sustainability factors in more comprehensive models. Furthermore, the impact of the taxonomy was hard to predict at this time, however, the consensus of the majority of the interviews conducted with experts on the subject, is that it has potential to impact sustainable investments in the future. Future research on the taxonomy may yield results of higher interest since more comprehensive data will be available, and the impact of the taxonomy will be more concrete.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:25:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fulltekst (pdf)fulltext$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_25_j_idt946_0_j_idt949",{id:"formSmash:items:resultList:25:j_idt946:0:j_idt949",widgetVar:"widget_formSmash_items_resultList_25_j_idt946_0_j_idt949",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:25:j_idt946:0:fullText"});}); 27. Plane intersections of rotational ellipsoids Abramson, Nils PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_26_j_idt669",{id:"formSmash:items:resultList:26:j_idt669",widgetVar:"widget_formSmash_items_resultList_26_j_idt669",onLabel:"Abramson, Nils ",offLabel:"Abramson, Nils ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_26_j_idt672",{id:"formSmash:items:resultList:26:j_idt672",widgetVar:"widget_formSmash_items_resultList_26_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för industriell teknik och management (ITM), Industriell produktion.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:26:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Boman, J.Bonnevier, BjörnKTH, Skolan för elektro- och systemteknik (EES), Centra, Alfvénlaboratoriet.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:26:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Plane intersections of rotational ellipsoids2006Inngår i: The American mathematical monthly, ISSN 0002-9890, E-ISSN 1930-0972, Vol. 113, nr 4, s. 336-339Artikkel i tidsskrift (Fagfellevurdert)28. Finite horizon mean field games on networks Achdou, Yveset al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_27_j_idt672",{id:"formSmash:items:resultList:27:j_idt672",widgetVar:"widget_formSmash_items_resultList_27_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:27:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Dao, Manh KhangKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematisk statistik.Ley, OlivierTchou, NicolettaPrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:27:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Finite horizon mean field games on networks2020Inngår i: Calculus of Variations and Partial Differential Equations, ISSN 0944-2669, E-ISSN 1432-0835, Vol. 59, nr 5, artikkel-id 157Artikkel i tidsskrift (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_27_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:27:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_27_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We consider finite horizon stochastic mean field games in which the state space is a network. They are described by a system coupling a backward in time Hamilton-Jacobi-Bellman equation and a forward in time Fokker-Planck equation. The value functionuis continuous and satisfies general Kirchhoff conditions at the vertices. The densitymof the distribution of states satisfies dual transmission conditions: in particular,mis generally discontinuous across the vertices, and the values ofmon each side of the vertices satisfy some compatibility conditions. The stress is put on the case when the Hamiltonian is Lipschitz continuous. Existence, uniqueness and regularity results are proven.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:27:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 29. The multi-layer free boundary problem for the p-Laplacian in convex domains Acker, A.et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_28_j_idt672",{id:"formSmash:items:resultList:28:j_idt672",widgetVar:"widget_formSmash_items_resultList_28_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:28:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Henrot, A.Poghosyan, M.Shahgholian, HenrikKTH, Tidigare Institutioner (före 2005), Matematik.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:28:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); The multi-layer free boundary problem for the p-Laplacian in convex domains2004Inngår i: Interfaces and free boundaries (Print), ISSN 1463-9963, E-ISSN 1463-9971, Vol. 6, nr 1, s. 81-103Artikkel i tidsskrift (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_28_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:28:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_28_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The main result of this paper concerns existence of classical solutions to the multi-layer Bernoulli free boundary problem with nonlinear joining conditions and the p-Laplacian as governing operator. The present treatment of the two-layer case involves technical refinements of the one-layer case, studied earlier by two of the authors. The existence treatment of the multi-layer case is largely based on a reduction to the two-layer case, in which uniform separation of the free boundaries plays a key role.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:28:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 30. On a lower bound for the connectivity of the independence complex of a graph Adamaszek, Michalet al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_29_j_idt672",{id:"formSmash:items:resultList:29:j_idt672",widgetVar:"widget_formSmash_items_resultList_29_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:29:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Barmak, Jonathan ArielKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:29:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); On a lower bound for the connectivity of the independence complex of a graph2011Inngår i: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 311, nr 21, s. 2566-2569Artikkel i tidsskrift (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_29_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:29:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_29_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Aharoni, Berger and Ziv proposed a function which is a lower bound for the connectivity of the independence complex of a graph. They conjectured that this bound is optimal for every graph. We give two different arguments which show that the conjecture is false.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:29:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 31. javaPlex Adams, Henryet al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_30_j_idt672",{id:"formSmash:items:resultList:30:j_idt672",widgetVar:"widget_formSmash_items_resultList_30_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:30:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Tausz, AndrewVejdemo-Johansson, MikaelKTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP. Institut Jozef Stefan, Slovenia .PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:30:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); javaPlex: A Research Software Package for Persistent (Co) Homology2014Konferansepaper (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_30_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:30:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_30_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The computation of persistent homology has proven a fundamental component of the nascent field of topological data analysis and computational topology. We describe a new software package for topological computation, with design focus on needs of the research community. This tool, replacing previous jPlex and Plex, enables researchers to access state of the art algorithms for persistent homology, cohomology, hom complexes, filtered simplicial complexes, filtered cell complexes, witness complex constructions, and many more essential components of computational topology. We describe, herewithin, the design goals we have chosen, as well as the resulting software package, and some of its more novel capabilities.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:30:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 32. In times of regional geopolitical turmoil – Why do some equity funds performbetter than others? Adelstrand, Carl PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_31_j_idt669",{id:"formSmash:items:resultList:31:j_idt669",widgetVar:"widget_formSmash_items_resultList_31_j_idt669",onLabel:"Adelstrand, Carl ",offLabel:"Adelstrand, Carl ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_31_j_idt672",{id:"formSmash:items:resultList:31:j_idt672",widgetVar:"widget_formSmash_items_resultList_31_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematisk statistik.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:31:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Gavefalk, SofiaKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematisk statistik.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:31:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); In times of regional geopolitical turmoil – Why do some equity funds performbetter than others?2014Independent thesis Basic level (degree of Bachelor), 10 poäng / 15 hpOppgaveAbstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_31_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:31:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_31_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); In times of regional geopolitical turmoil – why do some investment portfolios, equity funds, perform better than others? Is it simply luck, the effects of systematic risk or do factors such as investment styles and managerial skills play a significant part in the performance of a fund?

As financial markets often reflect the macro environment, much of the previous year’s fluctuations of Eastern European stocks can be seen to derive from a number of geopolitical events; from the 2013 summer clashes between the Turkish police and opposing parties to the current issue concerning Russia and Ukraine. Needless to say, these events have affected return on equity in their regions and created a distressed environment for investors and equity fund managers investing in Eastern Europe.

This thesis aims to explore how the aforementioned macroeconomic events impact the market and thus the portfolios of asset managers. The thesis also intends to provide aspects of eventual investment strategies that are more preferable than others under such circumstances, in order to mitigate the subsequent risks.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:31:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fulltekst (pdf)fulltext$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_31_j_idt946_0_j_idt949",{id:"formSmash:items:resultList:31:j_idt946:0:j_idt949",widgetVar:"widget_formSmash_items_resultList_31_j_idt946_0_j_idt949",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:31:j_idt946:0:fullText"});}); 33. Fine-Tuning Parameters in CT Adelöw, Anton PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_32_j_idt669",{id:"formSmash:items:resultList:32:j_idt669",widgetVar:"widget_formSmash_items_resultList_32_j_idt669",onLabel:"Adelöw, Anton ",offLabel:"Adelöw, Anton ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_32_j_idt672",{id:"formSmash:items:resultList:32:j_idt672",widgetVar:"widget_formSmash_items_resultList_32_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:32:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Nordström, TomasKTH, Skolan för teknikvetenskap (SCI).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:32:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fine-Tuning Parameters in CT2023Independent thesis Basic level (degree of Bachelor), 10 poäng / 15 hpOppgaveAbstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_32_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:32:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_32_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Computed tomography (CT) is a medical imaging technique that usesX-rays to obtain a reconstruction of an object. The term acquisition ge-ometry refers to the arrangement of imaging sensors and the X-ray sourceas well as the procedure used for data collection. The quality of the re-construction is often limited by the acquisition geometry and parametervalues. In this thesis, we present a procedure for fine-tuning acquisitiongeometry parameters in CT by minimizing the difference between theforward projection of a known phantom and measured data, i.e. data dis-crepancies. We extend the ODL library in Python and create acquisitiongeometries where different parameters have been distorted. We utilizegradient descent in an attempt recover the true parameters of the acquisi-tion geometries. Our results show that the recovery of the true geometryis successful when one or, in some cases, two parameters are perturbed.The objective function becomes very sensitive when more parameters areperturbed, requiring a low learning rate and making convergence slow.Nevertheless, we are able to minimize the objective function in the for-ward projection for all perturbations. Although our algorithm performswell in some aspects relating to parameter recovery, there is potential forfurther research by implementing other optimization methods.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:32:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fulltekst (pdf)fulltext$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_32_j_idt946_0_j_idt949",{id:"formSmash:items:resultList:32:j_idt946:0:j_idt949",widgetVar:"widget_formSmash_items_resultList_32_j_idt946_0_j_idt949",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:32:j_idt946:0:fullText"});}); 34. FAQ on the g-theorem and the hard Lefschetz theorem for face rings Adiprasito, Karim PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_33_j_idt669",{id:"formSmash:items:resultList:33:j_idt669",widgetVar:"widget_formSmash_items_resultList_33_j_idt669",onLabel:"Adiprasito, Karim ",offLabel:"Adiprasito, Karim ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:33:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:33:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); FAQ on the g-theorem and the hard Lefschetz theorem for face rings2019Inngår i: Rendiconti di Matematica e delle sue Applicazioni. Serie VII, ISSN 1120-7183, Vol. 40, nr 2, s. 97-111Artikkel i tidsskrift (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_33_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:33:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_33_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We discuss the hard Lefschetz theorem for simplicial spheres, as well as the theory at its core: Perturbations of maps, biased Poincaré pairings and a cobordism argument that relates the Lefschetz property of a manifold to the Lefschetz property on its boundary, and sketch an alternative argument based on edge-contractions.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:33:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 35. Face numbers of sequentially Cohen-Macaulay complexes and Betti numbers of componentwise linear ideals Adiprasito, Karimet al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_34_j_idt672",{id:"formSmash:items:resultList:34:j_idt672",widgetVar:"widget_formSmash_items_resultList_34_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:34:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Björner, AndersKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).Goodarzi, AfshinFreie Universität, Germany.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:34:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Face numbers of sequentially Cohen-Macaulay complexes and Betti numbers of componentwise linear ideals2017Inngår i: Journal of the European Mathematical Society (Print), ISSN 1435-9855, E-ISSN 1435-9863, Vol. 19, nr 12, s. 3851-3865Artikkel i tidsskrift (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_34_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:34:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_34_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); A numerical characterization is given of the h-triangles of sequentially Cohen-Macaulay simplicial complexes. This result determines the number of faces of various dimensions and codimensions that are possible in such a complex, generalizing the classical Macaulay-Stanley theorem to the nonpure case. Moreover, we characterize the possible Betti tables of componentwise linear ideals. A key tool in our investigation is a bijection between shifted multicomplexes of degree <= d and shifted pure. (d - 1)-dimensional simplicial complexes.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:34:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 36. Connectivity of pseudomanifold graphs from an algebraic point of view Adiprasito, Karimet al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_35_j_idt672",{id:"formSmash:items:resultList:35:j_idt672",widgetVar:"widget_formSmash_items_resultList_35_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:35:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Goodarzi, AfshinKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).Varbaro, MatteoPrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:35:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Connectivity of pseudomanifold graphs from an algebraic point of view2015Inngår i: Comptes Rendus Mathematiques de l'Academie des Sciences = Mathematical reports of the academy of science, ISSN 0706-1994, Vol. 353, nr 12, s. 1061-1065Artikkel i tidsskrift (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_35_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:35:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_35_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The connectivity of graphs of simplicial and polytopal complexes is a classical subject going back at least to Steinitz, and the topic has since been studied by many authors, including Balinski, Barnette, Athanasiadis, and Bjorner. In this note, we provide a unifying approach that allows us to obtain more general results. Moreover, we provide a relation to commutative algebra by relating connectivity problems to graded Betti numbers of the associated Stanley-Reisner rings.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:35:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 37. Data-driven Methods in Inverse Problems Adler, Jonas PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_36_j_idt669",{id:"formSmash:items:resultList:36:j_idt669",widgetVar:"widget_formSmash_items_resultList_36_j_idt669",onLabel:"Adler, Jonas ",offLabel:"Adler, Jonas ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:36:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:36:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Data-driven Methods in Inverse Problems2019Doktoravhandling, med artikler (Annet vitenskapelig)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_36_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:36:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_36_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); In this thesis on data-driven methods in inverse problems we introduce several new methods to solve inverse problems using recent advancements in machine learning and specifically deep learning. The main goal has been to develop practically applicable methods, scalable to medical applications and with the ability to handle all the complexities associated with them.

In total, the thesis contains six papers. Some of them are focused on more theoretical questions such as characterizing the optimal solutions of reconstruction schemes or extending current methods to new domains, while others have focused on practical applicability. A significant portion of the papers also aim to bringing knowledge from the machine learning community into the imaging community, with considerable effort spent on translating many of the concepts. The papers have been published in a range of venues: machine learning, medical imaging and inverse problems.

The first two papers contribute to a class of methods now called learned iterative reconstruction where we introduce two ways of combining classical model driven reconstruction methods with deep neural networks. The next two papers look forward, aiming to address the question of "what do we want?" by proposing two very different but novel loss functions for training neural networks in inverse problems. The final papers dwelve into the statistical side, one gives a generalization of a class of deep generative models to Banach spaces while the next introduces two ways in which such methods can be used to perform Bayesian inversion at scale.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:36:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fulltekst (pdf)fulltext$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_36_j_idt946_0_j_idt949",{id:"formSmash:items:resultList:36:j_idt946:0:j_idt949",widgetVar:"widget_formSmash_items_resultList_36_j_idt946_0_j_idt949",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:36:j_idt946:0:fullText"});}); 38. GPU Monte Carlo scatter calculations for Cone Beam Computed Tomography Adler, Jonas PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_37_j_idt669",{id:"formSmash:items:resultList:37:j_idt669",widgetVar:"widget_formSmash_items_resultList_37_j_idt669",onLabel:"Adler, Jonas ",offLabel:"Adler, Jonas ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Numerisk analys, NA.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:37:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:37:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); GPU Monte Carlo scatter calculations for Cone Beam Computed Tomography2014Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgaveAbstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_37_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:37:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_37_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); A GPU Monte Carlo code for x-ray photon transport has been implemented and extensively tested. The code is intended for scatter compensation of cone beam computed tomography images.

The code was tested to agree with other well known codes within 5% for a set of simple scenarios. The scatter compensation was also tested using an artificial head phantom. The errors in the reconstructed Hounsfield values were reduced by approximately 70%.

Several variance reduction methods have been tested, although most were found infeasible on GPUs. The code is nonetheless fast, and can simulate approximately 3 ·10

^{9}photons per minute on a NVIDIA Quadro 4000 graphics card. With the use of appropriate filtering methods, the code can be used to calculate patient specific scatter distributions for a full CBCT scan in approximately one minute, allowing scatter reduction in clinical applications.PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:37:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fulltekst (pdf)fulltext$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_37_j_idt946_0_j_idt949",{id:"formSmash:items:resultList:37:j_idt946:0:j_idt949",widgetVar:"widget_formSmash_items_resultList_37_j_idt946_0_j_idt949",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:37:j_idt946:0:fullText"});}); 39. Banach Wasserstein GAN Adler, Jonas PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_38_j_idt669",{id:"formSmash:items:resultList:38:j_idt669",widgetVar:"widget_formSmash_items_resultList_38_j_idt669",onLabel:"Adler, Jonas ",offLabel:"Adler, Jonas ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_38_j_idt672",{id:"formSmash:items:resultList:38:j_idt672",widgetVar:"widget_formSmash_items_resultList_38_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:38:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lunz, SebastianUniv Cambridge, Dept Appl Math & Theoret Phys, Cambridge, England..PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:38:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Banach Wasserstein GAN2018Inngår i: Advances in Neural Information Processing Systems 31 (NIPS 2018) / [ed] Bengio, S Wallach, H Larochelle, H Grauman, K CesaBianchi, N Garnett, R, Neural Information Processing Systems (NIPS) , 2018Konferansepaper (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_38_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:38:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_38_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Wasserstein Generative Adversarial Networks (WGANs) can be used to generate realistic samples from complicated image distributions. The Wasserstein metric used in WGANs is based on a notion of distance between individual images, which induces a notion of distance between probability distributions of images. So far the community has considered l(2) as the underlying distance. We generalize the theory of WGAN with gradient penalty to Banach spaces, allowing practitioners to select the features to emphasize in the generator. We further discuss the effect of some particular choices of underlying norms, focusing on Sobolev norms. Finally, we demonstrate a boost in performance for an appropriate choice of norm on CIFAR-10 and CelebA.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:38:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 40. Task adapted reconstruction for inverse problems Adler, Jonas PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_39_j_idt669",{id:"formSmash:items:resultList:39:j_idt669",widgetVar:"widget_formSmash_items_resultList_39_j_idt669",onLabel:"Adler, Jonas ",offLabel:"Adler, Jonas ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_39_j_idt672",{id:"formSmash:items:resultList:39:j_idt672",widgetVar:"widget_formSmash_items_resultList_39_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.). Elekta.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:39:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lunz, SebastianCentre for Mathematical Sciences, University of Cambridge, Cambridge CB3 0WA, United Kingdom.Verdier, OlivierDepartment of Mathematics, KTH Royal Institute of Technology, 100 44 Stockholm, Sweden ; Department of Computing, Mathematics and Physics, Western Norway University of Applied Sciences, Bergen, Norway.Schönlieb, Carola-BibianeCentre for Mathematical Sciences, University of Cambridge, Cambridge CB3 0WA, United Kingdom.Öktem, OzanKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:39:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Task adapted reconstruction for inverse problemsManuskript (preprint) (Annet vitenskapelig)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_39_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:39:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_39_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The paper considers the problem of performing a task defined on a model parameter that is only observed indirectly through noisy data in an ill-posed inverse problem. A key aspect is to formalize the steps of reconstruction and task as appropriate estimators (non-randomized decision rules) in statistical estimation problems. The implementation makes use of (deep) neural networks to provide a differentiable parametrization of the family of estimators for both steps. These networks are combined and jointly trained against suitable supervised training data in order to minimize a joint differentiable loss function, resulting in an end-to-end task adapted reconstruction method. The suggested framework is generic, yet adaptable, with a plug-and-play structure for adjusting both the inverse problem and the task at hand. More precisely, the data model (forward operator and statistical model of the noise) associated with the inverse problem is exchangeable, e.g., by using neural network architecture given by a learned iterative method. Furthermore, any task that is encodable as a trainable neural network can be used. The approach is demonstrated on joint tomographic image reconstruction, classification and joint tomographic image reconstruction segmentation.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:39:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fulltekst (pdf)fulltext$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_39_j_idt946_0_j_idt949",{id:"formSmash:items:resultList:39:j_idt946:0:j_idt949",widgetVar:"widget_formSmash_items_resultList_39_j_idt946_0_j_idt949",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:39:j_idt946:0:fullText"});}); 41. Learning to solve inverse problems using Wasserstein loss Adler, Jonas PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_40_j_idt669",{id:"formSmash:items:resultList:40:j_idt669",widgetVar:"widget_formSmash_items_resultList_40_j_idt669",onLabel:"Adler, Jonas ",offLabel:"Adler, Jonas ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_40_j_idt672",{id:"formSmash:items:resultList:40:j_idt672",widgetVar:"widget_formSmash_items_resultList_40_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.). Elekta, Box 7593, 103 93 Stockholm, Sweden.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:40:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Ringh, AxelKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.Öktem, OzanKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).Karlsson, JohanKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:40:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Learning to solve inverse problems using Wasserstein lossManuskript (preprint) (Annet vitenskapelig)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_40_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:40:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_40_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We propose using the Wasserstein loss for training in inverse problems. In particular, we consider a learned primal-dual reconstruction scheme for ill-posed inverse problems using the Wasserstein distance as loss function in the learning. This is motivated by miss-alignments in training data, which when using standard mean squared error loss could severely degrade reconstruction quality. We prove that training with the Wasserstein loss gives a reconstruction operator that correctly compensates for miss-alignments in certain cases, whereas training with the mean squared error gives a smeared reconstruction. Moreover, we demonstrate these effects by training a reconstruction algorithm using both mean squared error and optimal transport loss for a problem in computerized tomography.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:40:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 42. Deep Bayesian Inversion Adler, Jonas PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_41_j_idt669",{id:"formSmash:items:resultList:41:j_idt669",widgetVar:"widget_formSmash_items_resultList_41_j_idt669",onLabel:"Adler, Jonas ",offLabel:"Adler, Jonas ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_41_j_idt672",{id:"formSmash:items:resultList:41:j_idt672",widgetVar:"widget_formSmash_items_resultList_41_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.). Elekta.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:41:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Öktem, OzanKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:41:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Deep Bayesian InversionManuskript (preprint) (Annet vitenskapelig)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_41_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:41:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_41_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Characterizing statistical properties of solutions of inverse problems is essential for decision making. Bayesian inversion offers a tractable framework for this purpose, but current approaches are computationally unfeasible for most realistic imaging applications in the clinic. We introduce two novel deep learning based methods for solving large-scale inverse problems using Bayesian inversion: a sampling based method using a WGAN with a novel mini-discriminator and a direct approach that trains a neural network using a novel loss function. The performance of both methods is demonstrated on image reconstruction in ultra low dose 3D helical CT. We compute the posterior mean and standard deviation of the 3D images followed by a hypothesis test to assess whether a "dark spot" in the liver of a cancer stricken patient is present. Both methods are computationally efficient and our evaluation shows very promising performance that clearly supports the claim that Bayesian inversion is usable for 3D imaging in time critical applications.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:41:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fulltekst (pdf)fulltext$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_41_j_idt946_0_j_idt949",{id:"formSmash:items:resultList:41:j_idt946:0:j_idt949",widgetVar:"widget_formSmash_items_resultList_41_j_idt946_0_j_idt949",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:41:j_idt946:0:fullText"});}); 43. Solving ill-posed inverse problems using iterative deep neural networks Adler, Jonas PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_42_j_idt669",{id:"formSmash:items:resultList:42:j_idt669",widgetVar:"widget_formSmash_items_resultList_42_j_idt669",onLabel:"Adler, Jonas ",offLabel:"Adler, Jonas ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_42_j_idt672",{id:"formSmash:items:resultList:42:j_idt672",widgetVar:"widget_formSmash_items_resultList_42_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:42:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Öktem, OzanKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:42:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Solving ill-posed inverse problems using iterative deep neural networks2017Inngår i: Inverse Problems, ISSN 0266-5611, E-ISSN 1361-6420, Vol. 33, nr 12, artikkel-id 124007Artikkel i tidsskrift (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_42_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:42:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_42_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We propose a partially learned approach for the solution of ill-posed inverse problems with not necessarily linear forward operators. The method builds on ideas from classical regularisation theory and recent advances in deep learning to perform learning while making use of prior information about the inverse problem encoded in the forward operator, noise model and a regularising functional. The method results in a gradient-like iterative scheme, where the 'gradient' component is learned using a convolutional network that includes the gradients of the data discrepancy and regulariser as input in each iteration. We present results of such a partially learned gradient scheme on a non-linear tomographic inversion problem with simulated data from both the Sheep-Logan phantom as well as a head CT. The outcome is compared against filtered backprojection and total variation reconstruction and the proposed method provides a 5.4 dB PSNR improvement over the total variation reconstruction while being significantly faster, giving reconstructions of 512 x 512 pixel images in about 0.4 s using a single graphics processing unit (GPU).

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:42:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 44. Tacnode GUE-minor processes and double Aztec diamonds Adler, M.et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_43_j_idt672",{id:"formSmash:items:resultList:43:j_idt672",widgetVar:"widget_formSmash_items_resultList_43_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:43:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Chhita, S.Johansson, KurtKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).van Moerbeke, P.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:43:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Tacnode GUE-minor processes and double Aztec diamonds2015Inngår i: Probability theory and related fields, ISSN 0178-8051, E-ISSN 1432-2064, Vol. 162, nr 1-2, s. 275-325Artikkel i tidsskrift (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_43_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:43:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_43_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We study determinantal point processes arising in random domino tilings of a double Aztec diamond, a region consisting of two overlapping Aztec diamonds. At a turning point in a single Aztec diamond where the disordered region touches the boundary, the natural limiting process is the GUE-minor process. Increasing the size of a double Aztec diamond while keeping the overlap between the two Aztec diamonds finite, we obtain a new determinantal point process which we call the tacnode GUE-minor process. This process can be thought of as two colliding GUE-minor processes. As part of the derivation of the particle kernel whose scaling limit naturally gives the tacnode GUE-minor process, we find the inverse Kasteleyn matrix for the dimer model version of the Double Aztec diamond.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:43:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 45. A SINGULAR TOEPLITZ DETERMINANT AND THE DISCRETE TACNODE KERNEL FOR SKEW-AZTEC RECTANGLES Adler, Mark PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_44_j_idt669",{id:"formSmash:items:resultList:44:j_idt669",widgetVar:"widget_formSmash_items_resultList_44_j_idt669",onLabel:"Adler, Mark ",offLabel:"Adler, Mark ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_44_j_idt672",{id:"formSmash:items:resultList:44:j_idt672",widgetVar:"widget_formSmash_items_resultList_44_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Brandeis Univ, Dept Math, Waltham, MA 02254 USA..PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:44:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Johansson, KurtKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.).van Moerbeke, PierreUCLouvain, Dept Math, Louvain, Belgium.;Brandeis Univ, Waltham, MA 02254 USA..PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:44:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); A SINGULAR TOEPLITZ DETERMINANT AND THE DISCRETE TACNODE KERNEL FOR SKEW-AZTEC RECTANGLES2022Inngår i: The Annals of Applied Probability, ISSN 1050-5164, E-ISSN 2168-8737, Vol. 32, nr 2, s. 1234-1294Artikkel i tidsskrift (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_44_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:44:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_44_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Random tilings of geometrical shapes with dominos or lozenges have been a rich source of universal statistical distributions. This paper deals with domino tilings of checker board rectangular shapes such that the top two and bottom two adjacent squares have the same orientation and the two most left and two most right ones as well. It forces these so-called "skew-Aztec rectangles" to have cuts on either side. For large sizes of the domain and upon an appropriate scaling of the location of the cuts, one finds split tacnodes between liquid regions with two distinct adjacent frozen phases descending into the tacnode. Zooming about such split tacnodes, filaments appear between the liquid patches evolving in a bricklike sea of dimers of another type. This work shows that the random fluctuations in a neighborhood of the split tacnode are governed asymptotically by the discrete tacnode kernel, providing strong evidence that this kernel is a universal discrete-continuous limiting kernel occurring naturally whenever we have doubly interlacing patterns. The analysis involves the inversion of a singular Toeplitz matrix which leads to considerable difficulties.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:44:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 46. Double Aztec diamonds and the tacnode process Adler, Market al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_45_j_idt672",{id:"formSmash:items:resultList:45:j_idt672",widgetVar:"widget_formSmash_items_resultList_45_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:45:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Johansson, KurtKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).van Moerbeke, PierrePrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:45:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Double Aztec diamonds and the tacnode process2014Inngår i: Advances in Mathematics, ISSN 0001-8708, E-ISSN 1090-2082, Vol. 252, s. 518-571Artikkel i tidsskrift (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_45_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:45:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_45_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Discrete and continuous non-intersecting random processes have given rise to critical "infinite-dimensional diffusions", like the Airy process, the Pearcey process and variations thereof. It has been known that domino tilings of very large Aztec diamonds lead macroscopically to a disordered region within an inscribed ellipse (arctic circle in the homogeneous case), and a regular brick-like region outside the ellipse. The fluctuations near the ellipse, appropriately magnified and away from the boundary of the Aztec diamond, form an Airy process, run with time tangential to the boundary. This paper investigates the domino tiling of two overlapping Aztec diamonds; this situation also leads to non-intersecting random walks and an induced point process; this process is shown to be determinantal. In the large size limit, when the overlap is such that the two arctic ellipses for the single Aztec diamonds merely touch, a new critical process will appear near the point of osculation (tacnode), which is run with a time in the direction of the common tangent to the ellipses: this is the tacnode process. It is also-shown here that this tacnode process is universal: it coincides with the one found in the context of two groups of non-intersecting random walks or also Brownian motions, meeting momentarily.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:45:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 47. Lozenge Tilings of Hexagons with Cuts and Asymptotic Fluctuations Adler, Market al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_46_j_idt672",{id:"formSmash:items:resultList:46:j_idt672",widgetVar:"widget_formSmash_items_resultList_46_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:46:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Johansson, KurtKTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).van Moerbeke, PierrePrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:46:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lozenge Tilings of Hexagons with Cuts and Asymptotic Fluctuations: a New Universality Class2018Inngår i: Mathematical physics, analysis and geometry, ISSN 1385-0172, E-ISSN 1572-9656, Vol. 21, nr 1, artikkel-id 9Artikkel i tidsskrift (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_46_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:46:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_46_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); This paper investigates lozenge tilings of non-convex hexagonal regions and more specifically the asymptotic fluctuations of the tilings within and near the strip formed by opposite cuts in the regions, when the size of the regions tend to infinity, together with the cuts. It leads to a new kernel, which is expected to have universality properties.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:46:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 48. Turing's Model for Pattern Formation and Network Controllability Adolfsson, Isak PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_47_j_idt669",{id:"formSmash:items:resultList:47:j_idt669",widgetVar:"widget_formSmash_items_resultList_47_j_idt669",onLabel:"Adolfsson, Isak ",offLabel:"Adolfsson, Isak ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_47_j_idt672",{id:"formSmash:items:resultList:47:j_idt672",widgetVar:"widget_formSmash_items_resultList_47_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:47:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Delle, AmandaKTH, Skolan för teknikvetenskap (SCI).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:47:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Turing's Model for Pattern Formation and Network Controllability2024Independent thesis Basic level (degree of Bachelor), 10 poäng / 15 hpOppgaveAbstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_47_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:47:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_47_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); This thesis explores the Turing model for pattern formation and its applicationin controlling reaction-diffusion systems. The goal is to simulate both linear andnonlinear reaction-diffusion models, to understand how patterns emerge and toinvestigate the controllability of these systems with boundary controls. Using thefinite difference method (FDM) and other numerical methods on a discretizedgrid, we generated patterns with nonlinear reaction functions, validating Turing’shypothesis that nonlinear models are more applicable for pattern formation. Thenonlinear models produced stable, organized patterns, whereas linear models re-sulted in divergence, creating unrealistic patterns. In the controllability study, wediscovered that full controllability is achieved when all control inputs are active.Our findings suggest that the placement of minimal control inputs, derived fromspecific patterns, ensures full controllability in small systems, though further re-search is needed to generalize this method to larger grids. This work underscoresthe potential of simplified models like Turing’s to provide insights into the com-plex mechanisms governing natural pattern formation.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:47:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fulltekst (pdf)fulltext$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_47_j_idt946_0_j_idt949",{id:"formSmash:items:resultList:47:j_idt946:0:j_idt949",widgetVar:"widget_formSmash_items_resultList_47_j_idt946_0_j_idt949",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:47:j_idt946:0:fullText"});}); 49. Block-approximated exponential random graphs Adriaens, Florian PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_48_j_idt669",{id:"formSmash:items:resultList:48:j_idt669",widgetVar:"widget_formSmash_items_resultList_48_j_idt669",onLabel:"Adriaens, Florian ",offLabel:"Adriaens, Florian ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_48_j_idt672",{id:"formSmash:items:resultList:48:j_idt672",widgetVar:"widget_formSmash_items_resultList_48_j_idt672",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Teoretisk datalogi, TCS.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:48:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Mara, AlexandruIDLab, Ghent University, Belgium.Lijffijt, JefreyIDLab, Ghent University, Belgium.De Bie, TijlIDLab, Ghent University, Belgium.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:48:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Block-approximated exponential random graphs2020Inngår i: Proceedings - 2020 IEEE 7th International Conference on Data Science and Advanced Analytics, DSAA 2020, Institute of Electrical and Electronics Engineers Inc. , 2020, s. 70-80Konferansepaper (Fagfellevurdert)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_48_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:48:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_48_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs. By utilizing fast matrix block-approximation techniques, we propose an approximative framework to such non-trivial ERGs that result in dyadic independence (i.e., edge independent) distributions, while being able to meaningfully model local information of the graph (e.g., degrees) as well as global information (e.g., clustering coefficient, assortativity, etc.) if desired. This allows one to efficiently generate random networks with similar properties as an observed network, and the models can be used for several downstream tasks such as link prediction. Our methods are scalable to sparse graphs consisting of millions of nodes.Empirical evaluation demonstrates competitiveness in terms of both speed and accuracy with state-of-the-art methods - which are typically based on embedding the graph into some low-dimensional space - for link prediction, showcasing the potential of a more direct and interpretable probablistic model for this task.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:48:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 50. Computational methods for microfluidics af Klinteberg, Ludvig PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_49_j_idt669",{id:"formSmash:items:resultList:49:j_idt669",widgetVar:"widget_formSmash_items_resultList_49_j_idt669",onLabel:"af Klinteberg, Ludvig ",offLabel:"af Klinteberg, Ludvig ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Numerisk analys, NA.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:49:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:49:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Computational methods for microfluidics2013Licentiatavhandling, med artikler (Annet vitenskapelig)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_49_j_idt714_0_j_idt715",{id:"formSmash:items:resultList:49:j_idt714:0:j_idt715",widgetVar:"widget_formSmash_items_resultList_49_j_idt714_0_j_idt715",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); This thesis is concerned with computational methods for fluid flows on the microscale, also known as microfluidics. This is motivated by current research in biological physics and miniaturization technology, where there is a need to understand complex flows involving microscale structures. Numerical simulations are an important tool for doing this.

The first paper of the thesis presents a numerical method for simulating multiphase flows involving insoluble surfactants and moving contact lines. The method is based on an explicit interface tracking method, wherein the interface between two fluids is decomposed into segments, which are represented locally on an Eulerian grid. The framework of this method provides a natural setting for solving the advection-diffusion equation governing the surfactant concentration on the interface. Open interfaces and moving contact lines are also incorporated into the method in a natural way, though we show that care must be taken when regularizing interface forces to the grid near the boundary of the computational domain.

In the second paper we present a boundary integral formulation for sedimenting particles in periodic Stokes flow, using the completed double layer boundary integral formulation. The long-range nature of the particle-particle interactions lead to the formulation containing sums which are not absolutely convergent if computed directly. This is solved by applying the method of Ewald summation, which in turn is computed in a fast manner by using the FFT-based spectral Ewald method. The complexity of the resulting method is O(N log N), as the system size is scaled up with the number of discretization points N. We apply the method to systems of sedimenting spheroids, which are discretized using the Nyström method and a basic quadrature rule.

The Ewald summation method used in the boundary integral method of the second paper requires a decomposition of the potential being summed. In the introductory chapters of the thesis we present an overview of the available methods for creating Ewald decompositions, and show how the methods and decompositions can be related to each other.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:49:j_idt714:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fulltekst (pdf)fulltext$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_49_j_idt946_0_j_idt949",{id:"formSmash:items:resultList:49:j_idt946:0:j_idt949",widgetVar:"widget_formSmash_items_resultList_49_j_idt946_0_j_idt949",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:49:j_idt946:0:fullText"});});

RefereraExporteraLink til resultatlisten
http://kth.diva-portal.org/smash/resultList.jsf?query=&language=no&searchType=SIMPLE&noOfRows=50&sortOrder=author_sort_asc&sortOrder2=title_sort_asc&onlyFullText=false&sf=all&aq=%5B%5B%7B%22categoryId%22%3A%2211501%22%7D%5D%5D&aqe=%5B%5D&aq2=%5B%5B%5D%5D&af=%5B%5D $(function(){PrimeFaces.cw("InputTextarea","widget_formSmash_lower_j_idt1003_recordPermLink",{id:"formSmash:lower:j_idt1003:recordPermLink",widgetVar:"widget_formSmash_lower_j_idt1003_recordPermLink",autoResize:true});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1003_j_idt1005",{id:"formSmash:lower:j_idt1003:j_idt1005",widgetVar:"widget_formSmash_lower_j_idt1003_j_idt1005",target:"formSmash:lower:j_idt1003:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Permanent link

Referera

Referensformatapa ieee modern-language-association-8th-edition vancouver Annet format $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_lower_j_idt1021",{id:"formSmash:lower:j_idt1021",widgetVar:"widget_formSmash_lower_j_idt1021",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:lower:j_idt1021",e:"change",f:"formSmash",p:"formSmash:lower:j_idt1021",u:"formSmash:lower:otherStyle"},ext);}}});});

- apa
- ieee
- modern-language-association-8th-edition
- vancouver
- Annet format

Språkde-DE en-GB en-US fi-FI nn-NO nn-NB sv-SE Annet språk $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_lower_j_idt1032",{id:"formSmash:lower:j_idt1032",widgetVar:"widget_formSmash_lower_j_idt1032",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:lower:j_idt1032",e:"change",f:"formSmash",p:"formSmash:lower:j_idt1032",u:"formSmash:lower:otherLanguage"},ext);}}});});

- de-DE
- en-GB
- en-US
- fi-FI
- nn-NO
- nn-NB
- sv-SE
- Annet språk

Utmatningsformathtml text asciidoc rtf $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_lower_j_idt1042",{id:"formSmash:lower:j_idt1042",widgetVar:"widget_formSmash_lower_j_idt1042"});});

- html
- text
- asciidoc
- rtf