SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "db:Swepub ;conttype:(scientificother);lar1:(mdh)"

Search: db:Swepub > Other academic/artistic > Mälardalen University

  • Result 21-30 of 4832
Sort/group result
   
EnumerationReferenceCoverFind
21.
  • Abola, Benard (author)
  • Perturbed Markov Chains with Damping Component and Information Networks
  • 2020
  • Doctoral thesis (other academic/artistic)abstract
    • This thesis brings together three thematic topics, PageRank of evolving tree graphs, stopping criteria for ranks and perturbed Markov chains with damping component. The commonality in these topics is their focus on ranking problems in information networks. In the fields of science and engineering, information networks are interesting from both practical and theoretical perspectives. The fascinating property of networks is their applicability in analysing broad spectrum of problems and well established mathematical objects. One of the most common algorithms in networks' analysis is PageRank. It was developed for web pages’ ranking and now serves as a tool for identifying important vertices as well as studying characteristics of real-world systems in several areas of applications. Despite numerous successes of the algorithm in real life, the analysis of information networks is still challenging. Specifically, when the system experiences changes in vertices /edges or it is not strongly connected or when a damping stochastic matrix and a damping factor are added to an information matrix. For these reasons, extending existing or developing methods to understand such complex networks is necessary.Chapter 2 of this thesis focuses on information networks with no bidirectional interaction. They are commonly encountered in ecological systems, number theory and security systems. We consider certain specific changes in a network and describe how the corresponding information matrix can be updated as well as PageRank scores. Specifically, we consider the graph partitioned into levels of vertices and describe how PageRank is updated as the network evolves.In Chapter 3, we review different stopping criteria used in solving a linear system of equations and investigate each stopping criterion against some classical iterative methods. Also, we explore whether clustering algorithms may be used as stopping criteria.Chapter 4 focuses on perturbed Markov chains commonly used for the description of information networks. In such models, the transition matrix of an information Markov chain is usually regularised and approximated by a stochastic (Google type) matrix. Stationary distribution of the stochastic matrix is equivalent to PageRank, which is very important for ranking of vertices in information networks. Determining stationary probabilities and related characteristics of singularly perturbed Markov chains is complicated; leave alone the choice of regularisation parameter. We use the procedure of artificial regeneration for the perturbed Markov chain with the matrix of transition probabilities and coupling methods. We obtain ergodic theorems, in the form of asymptotic relations. We also derive explicit upper bounds for the rate of convergence in ergodic relations. Finally, we illustrate these results with numerical examples.
  •  
22.
  • Abrahamsson, Gun, 1977-, et al. (author)
  • Ekonomiska ansvarsenheter
  • 2013. - 1
  • In: Perspektiv på ekonomistyrning. - Stockholm : Liber. - 9789147096947 ; , s. 14-35
  • Book chapter (other academic/artistic)
  •  
23.
  •  
24.
  • Abrahamsson, Henrik (author)
  • Network overload avoidance by traffic engineering and content caching
  • 2012
  • Doctoral thesis (other academic/artistic)abstract
    • The Internet traffic volume continues to grow at a great rate, now driven by video and TV distribution. For network operators it is important to avoid congestion in the network, and to meet service level agreements with their customers.  This thesis presents work on two methods operators can use to reduce links loads in their networks: traffic engineering and content caching.This thesis studies access patterns for TV and video and the potential for caching.  The investigation is done both using simulation and by analysis of logs from a large TV-on-Demand system over four months.The results show that there is a small set of programs that account for a large fraction of the requests and that a comparatively small local cache can be used to significantly reduce the peak link loads during prime time. The investigation also demonstrates how the popularity of programs changes over time and shows that the access pattern in a TV-on-Demand system very much depends on the content type.For traffic engineering the objective is to avoid congestion in the network and to make better use of available resources by adapting the routing to the current traffic situation. The main challenge for traffic engineering in IP networks is to cope with the dynamics of Internet traffic demands.This thesis proposes L-balanced routings that route the traffic on the shortest paths possible but make sure that no link is utilised to more than a given level L. L-balanced routing gives efficient routing of traffic and controlled spare capacity to handle unpredictable changes in traffic.  We present an L-balanced routing algorithm and a heuristic search method for finding L-balanced weight settings for the legacy routing protocols OSPF and IS-IS. We show that the search and the resulting weight settings work well in real network scenarios.
  •  
25.
  •  
26.
  • Abut, Hüseyin, et al. (author)
  • Real-World Data Collection with UYANIK
  • 2009
  • In: In-Vehicle Corpus and Signal Processing for Driver Behavior. - Boston, MA : Springer. - 9780387795812 - 9780387795829 ; , s. 23-44
  • Book chapter (other academic/artistic)
  •  
27.
  •  
28.
  •  
29.
  • Acuña, G. J., et al. (author)
  • Teaching about complementarity - proposal of classes for university students - including exercises
  • 2022
  • In: Complementarity of Variable Renewable Energy Sources. - : Elsevier. - 9780323855273 - 9780323855280 ; , s. 687-713
  • Book chapter (other academic/artistic)abstract
    • The idea behind this chapter is to provide teachers and students with material that can be used while studying renewable energy sources with special attention paid to their complementary characteristics. The questions and exercises included below refer to chapters presented in the book. In case of any questions, we provide the readers with contact details to chapters corresponding authors who would be happy in assisting you in case of any queries.
  •  
30.
  • Adolfsson, Petra, et al. (author)
  • Closing words!
  • 2009
  • In: Guiding and guided tours. - Göteborg : BAS Publishers. - 9789172462854 ; , s. 215-217
  • Book chapter (other academic/artistic)
  •  
Skapa referenser, mejla, bekava och länka
  • Result 21-30 of 4832
Type of publication
book chapter (1060)
conference paper (769)
reports (740)
doctoral thesis (592)
journal article (496)
licentiate thesis (392)
show more...
other publication (344)
book (209)
editorial collection (114)
review (79)
editorial proceedings (34)
artistic work (3)
research review (3)
show less...
Type of content
other academic/artistic  (4832)Undo refine
Author/Editor
Wiklund Gustin, Lena ... (66)
Lundqvist, Kristina (53)
Biesta, Gert (51)
Eriksson, Maria, 196 ... (47)
Söderbaum, Peter, 19 ... (46)
Nolte, Thomas (42)
show more...
Lönnermark, Anders, ... (41)
Björkman, Mats (36)
Yan, Jinyue (35)
Hansson, Hans (34)
Ingason, Haukur (34)
Crnkovic, Ivica (32)
Bäck, Hanna (32)
Stier, Jonas, 1967- (32)
Dodig-Crnkovic, Gord ... (32)
Ekström, Mikael (31)
Pecorari, Diane, 196 ... (30)
Gherardi, Silvia (30)
Sandberg, Anette (29)
Gallina, Barbara (28)
Thorin, Eva, 1967- (28)
Dahlquist, Erik (28)
Sjödin, Mikael (27)
Hallin, Anette (27)
Malyarenko, Anatoliy ... (26)
Dodig-Crnkovic, Gord ... (25)
Yan, Jinyue, 1959- (25)
Seceleanu, Cristina (24)
Pettersson, Paul (24)
Wamala, Sarah (24)
Silvestrov, Sergei, ... (23)
Dahlquist, Erik, 195 ... (23)
Bohlin, Markus (23)
Carlson, Jan (23)
Månsson, Niclas, 196 ... (23)
Lahdenperä, Pirjo, 1 ... (23)
Färnlöf, Hans, 1970- (23)
Mubeen, Saad (22)
Tillgren, Per, 1945- (22)
Kautiainen, Susanna (21)
Darvishpour, Mehrdad ... (21)
Eriksson, Yvonne (21)
Hallin, Anette, 1969 ... (21)
Segelod, Esbjörn (21)
Ärlemalm-Hagsér, Eva ... (20)
Lindén, Maria (19)
Dobers, Peter, 1966 (19)
Seceleanu, Cristina, ... (19)
Sandberg, Håkan, 195 ... (19)
Mäki-Turja, Jukka (19)
show less...
University
Mälardalen University  (4832)Undo refine
Uppsala University (243)
Högskolan Dalarna (150)
Örebro University (128)
Royal Institute of Technology (93)
Stockholm University (86)
show more...
Linnaeus University (78)
RISE (69)
Karolinska Institutet (60)
Marie Cederschiöld högskola (59)
Linköping University (47)
Södertörn University (45)
University of Gothenburg (44)
Chalmers University of Technology (38)
Karlstad University (35)
Jönköping University (30)
Luleå University of Technology (24)
University of Gävle (24)
Umeå University (22)
Red Cross University College (18)
Lund University (16)
Mid Sweden University (13)
Halmstad University (8)
Stockholm School of Economics (8)
University of Skövde (8)
Sophiahemmet University College (8)
University of Borås (6)
Blekinge Institute of Technology (6)
Malmö University (5)
The Institute for Language and Folklore (4)
University West (3)
Swedish University of Agricultural Sciences (3)
University College of Arts, Crafts and Design (2)
Kristianstad University College (1)
Swedish National Heritage Board (1)
Swedish National Defence College (1)
VTI - The Swedish National Road and Transport Research Institute (1)
show less...
Language
English (3360)
Swedish (1380)
French (24)
Norwegian (19)
German (11)
Italian (10)
show more...
Finnish (8)
Spanish (4)
Kurdish (4)
Danish (3)
Portuguese (2)
Japanese (2)
Russian (1)
Polish (1)
Dutch (1)
Turkish (1)
Korean (1)
show less...
Research subject (UKÄ/SCB)
Social Sciences (1615)
Engineering and Technology (998)
Natural sciences (624)
Medical and Health Sciences (537)
Humanities (284)
Agricultural Sciences (11)

Year

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view