SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Karlsson Viktoria) "

Sökning: WFRF:(Karlsson Viktoria)

  • Resultat 1-10 av 37
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Akeus, Paulina, et al. (författare)
  • Regulatory T cells reduce endothelial neutral sphingomyelinase 2 to prevent T-cell migration into tumors
  • 2021
  • Ingår i: European Journal of Immunology. - : Wiley. - 0014-2980 .- 1521-4141. ; 51:9, s. 2317-2329
  • Tidskriftsartikel (refereegranskat)abstract
    • Endothelial cells are key regulators of transendothelial migration and their secretion of chemokines and expression of adhesion molecules facilitates lymphocyte entry into tissues. Previously, we demonstrated that Tregs can reduce transendothelial migration of T cells into tumors by decreasing endothelial CXCL10 secretion, but the mechanism by which this occurs is still not known. In this study, we aimed to define how Tregs decrease transendothelial migration into tumors. mRNA sequencing of intestinal tumor endothelial cells from Treg depleted mice identified neutral sphingomyelinase 2 (nSMase2) as a gene downregulated in the presence of Tregs. nSMase2 is expressed in human umbilical vein endothelial cells (HUVECs) and was decreased after coculture with Tregs. Furthermore, blocking of nSMase2 activity in vitro decreased VCAM1, CX3CL1, and CXCL10 expression in HUVECs, mirroring the same decrease found in Treg cocultures. In the APC(min/+) mouse model of intestinal cancer, nSMase2 is lower in tumor endothelial cells than in unaffected small intestine and chronic treatment with a nSMase2 inhibitor suppressed the increased migration that is otherwise seen in the absence of Tregs. We conclude that nSMase2 is an important mediator in endothelial cells supporting transendothelial migration, which may be targeted by Tregs to reduce T-cell migration into tumors.
  •  
2.
  •  
3.
  • Dán, György, et al. (författare)
  • A rate-distortion based comparison of media-dependent FEC and MDC for real-time audio
  • 2006
  • Ingår i: 2006 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-12. - 9781424403547 ; , s. 1002-1007
  • Konferensbidrag (refereegranskat)abstract
    • Applications that require low loss probabilities in today's Internet have to employ some end-to-end error-recovery mechanism. For interactive applications with strict delay constraints, the delay introduced by the applied schemes has to be low as well. In this paper we compare two schemes proposed for error recovery for real-time audio applications: media-dependent forward error correction (MD-FEC) and multiple description coding (MDC). We conclude that MDC always performs better than MD-FEC, and that the stationary loss probability plays a key role in the choice of the optimal parameters for these schemes. Combining the analytical results with the loss characteristics of measured traces of VoIP calls we conclude that in the current Internet these schemes give considerable gains for streams with a high code rate only, and for these streams MDC can decrease the average distortion significantly better than MD-FEC.
  •  
4.
  • Dán, György, et al. (författare)
  • Analysis of the Packet Loss Process for Multimedia Traffic
  • 2004
  • Ingår i: Intl. Conference on Telecommunication Systems Modeling and Analysis.
  • Konferensbidrag (refereegranskat)abstract
    • In the case of multimedia traffic, like VBR video, the average loss probability is not sufficient to investigate the effects of loss on perceived visual quality, but it is difficult to analytically model the queuing behavior for such traffic. It has been shown that in the case of realtime communications, for which small buffers are used for delay reasons, short range dependence dominates the loss process and so the Markovmodulated Poisson process (MMPP) might be a reasonable source model. In this paper we present an exact mathematical model for the loss process of an MMPP+M/D/1/K queue; we validate it via simulations and compare it to other mathematical models, like the MMPP+M/M/1/K and the Gilbert model, and to simulations with real MPEG-4 video traces. We conclude that the other models give accurate results only in a small set of network scenarios, while our model can capture the loss process of VBR video sufficiently well in most cases. This makes it possible to analyze the effects of forward error correction on transmission quality in various network scenarios.
  •  
5.
  • Dán, György, et al. (författare)
  • Are multiple descriptions better than one?
  • 2005
  • Ingår i: NETWORKING 2005: NETWORKING TECHNOLOGIES, SERVICES, AND PROTOCOLS; PERFORMANCE OF COMPUTER AND COMMUNICATION NETWORKS; MOBILE AND WIRELESS COMMUNICATIONS SYSTEMS. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 3540258094 ; , s. 684-696
  • Konferensbidrag (refereegranskat)abstract
    • In this paper we compare three schemes proposed for error recovery for real-time multimedia applications: media-dependent forward error correction (MD-FEC) proposed for real-time audio, media-independent forward error correction (MI-FEC) proposed for real-time video and the recently re-discovered multiple description coding (MDC). We provide a detailed queueing analysis for these schemes considering bursty traffic sources, and combine results from information theory and queueing theory to analyze their performance bounds. We conclude that MDC always performs better than MD-FEC, and that the average loss probability plays a key role in the choice of the optimal parameters. We also show that MDC outperforms MI-FEC if packet losses are highly correlated, like in the current Internet and the available delay for error control is low.
  •  
6.
  • Dan, György (författare)
  • Internet Video Transmission
  • 2006
  • Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • The Internet has rapidly evolved from being a scientific experiment to a commercial network connecting millions of hosts that carries traffic generated by a large amount of applications with diverse requirements. Its architecture was however designed to enable efficient point-to-point delivery of bulk data, and can not provide statistical guarantees on the timely delivery of delay sensitive data such as streaming and real-time multimedia. Thus, applications that require low loss probabilities in today's Internet have to use some end-to-end error recovery mechanism. For delay sensitive applications the introduced latency by the applied schemes has to be low as well. Traffic control functions such as delay limited shaping and forward error correction (FEC), and multiple description coding (MDC) have been proposed for variable bitrate video. Their major drawback is, however, that it is difficult to predict their efficiency, as it depends on many factors like the characteristics of the stream itself, the characteristics of the traffic in the network and the network parameters. Consequently, it is difficult to decide which control mechanisms to employ, how to combine them and to choose the right parameters (e.g. block length, code rate) for optimal performance. In this thesis we present results on the efficiency of traffic control functions and MDC for video transmission based on mathematical models and simulations. We investigate the efficiency of delay limited traffic shaping and the trade-offs in the joint use of traffic shaping and forward error correction. We identify the packet size distribution of the traffic in the network as an additional factor that may influence the efficiency of FEC, and present a thorough analysis of its possible effects. We present an analytical comparison of MDC versus media-dependent FEC and media-independent FEC, and based on the results we conclude that MDC is a promising error control solution for multimedia communications with very strict delay bounds in an environment with bursty losses. We combine the analytical results with traces from measurements performed on the Internet to evaluate how efficient these error control schemes are under real loss patterns. We compare the efficiency of MDC and media-dependent FEC in the presence of channel estimation errors; we propose a new rate allocation method, which is robust to mis-estimations of the channel state and which improves error resilience on non-stationary channels. Finally we present an analytical model of the performance of an end-point-based multimedia streaming architecture based on multiple distribution trees and forward error correction, and analyze the behavior of the architecture for a large number of nodes.
  •  
7.
  • Dán, György, et al. (författare)
  • On the asymptotic behavior of end-point-based multicast streaming
  • 2006
  • Ingår i: 2006 International Zurich Seminar on Communications. - NEW YORK : IEEE. - 1424400910 ; , s. 66-69
  • Konferensbidrag (refereegranskat)abstract
    • In this paper we propose an analytical model of a resilient, tree-based end-node multicast streaming architecture that employs path diversity and forward error correction for improved resilience to node churns and packet losses. We show that this architecture can distribute data to nodes arbitrarily far away from the root of the trees as long as the loss probability is lower than a certain threshold, but the probability of packet reception suddenly drops to zero once this threshold is exceeded. The value of the threshold depends on the ratio of redundancy and on the number of the distribution trees.
  •  
8.
  • Dán, György, et al. (författare)
  • On the effects of the packet size distribution on FEC performance
  • 2006
  • Ingår i: Computer Networks. - : Elsevier BV. - 1389-1286 .- 1872-7069. ; 50:8, s. 1104-1129
  • Tidskriftsartikel (refereegranskat)abstract
    • For multimedia traffic like VBR video, knowledge of the average loss probability is not sufficient to determine the impact of loss on the perceived visual quality and on the possible ways of improving it, for example by forward error correction (FEC) and error concealment. In this paper we investigate how the packet size distribution affects the packet loss process, i.e., the probability of consecutive losses and the distribution of the number of packets lost in a block of packets and the related FEC performance. We present an exact mathematical model for the loss process of an MMPP + MMPP/Er/1/K queue and compare the results of the model to simulations performed with various other packet size distributions (PSDs), among others, the measured PSD from an Internet backbone. The results show that analytical models of the PSD matching the first three moments (mean, variance and skewness) of the empirical PSD can be used to evaluate the performance of FEC in real networks. We conclude that the exponential PSD, though it is not a worst case scenario, is a good approximation for the PSD of today's Internet to evaluate FEC performance. We also conclude that the packet size distribution affects the packet loss process and thus the efficiency of FEC mainly in access networks where a single multimedia stream might affect the multiplexing behavior. We evaluate how the PSD affects the accuracy of the widely used Gilbert model to calculate FEC performance and conclude that the Gilbert model can capture loss correlations better if the CoV of the PSD is high.
  •  
9.
  • Dán, György, et al. (författare)
  • On the effects of the packet size distribution on the packet loss process
  • 2006
  • Ingår i: Telecommunications Systems. - : Springer Science and Business Media LLC. - 1018-4864 .- 1572-9451. ; 32:1, s. 31-53
  • Tidskriftsartikel (refereegranskat)abstract
    • Real-time multimedia applications have to use forward error correction (FEC) anderror concealment techniques to cope with losses in today's best-effort Internet. The efficiency of these solutions is known however to depend on the correlation between losses in the media stream. In this paper we investigate how the packet size distribution affects the packet loss process, that is, the distribution of the number of lost packets in a block, the related FEC performance and the average loss run length. We present mathematical models for the loss process of the MMPP+M/D/1/K and the MMPP+M/M/1/K queues; we validate the models via simulations, and compare the results to simulation results with an MPEG-4 coded video trace. We conclude that the deterministic packet size distribution (PSD) not only results in lower stationary loss probability than the exponential one, but also gives a less correlated loss process, both at a particular average link load and at a particular stationary loss probability as seen by the media stream.Our results show that for applications that can only measure the packet loss probability, the effects of the PSD on FEC performance are higher in access networks, where a single multimedia stream might affect the multiplexing behavior. Our results show that the effects of the PSD on FEC performance are higher in access networks, where a single multimedia stream might affect the multiplexing behavior and thus can improve the queuing performance by decreasing the variance of its PSD.
  •  
10.
  • Dán, György, et al. (författare)
  • On the performance of error-resilient end-point-based multicast streaming
  • 2006
  • Ingår i: 2006 14TH IEEE INTERNATIONAL WORKSHOP ON QUALITY OF SERVICE, PROCEEDINGS. ; , s. 160-168
  • Konferensbidrag (refereegranskat)abstract
    • In this paper we propose an analytical model of a resilient end-node multicast streaming architecture based on multiple minimum-depth-trees that employs path diversity and forward error correction for improved resilience to node churns and packet losses. We study the performance of the architecture in the presence of packet losses and dynamic node behavior. We show that for a given redundancy the probability that an arbitrary node possesses a packet is high as long as the loss probability in the network is below a certain threshold. After reaching the threshold the packet possession probability suddenly drops; the rate decrease gets faster as the number of nodes in the overlay grows. The value of the threshold depends on the ratio of redundancy and on the number of the distribution trees. We study the overlay structure in the presence of node dynamics and conclude that stability can be achieved only if the root node serves a large number of nodes simultaneously.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 37
Typ av publikation
konferensbidrag (17)
tidskriftsartikel (15)
rapport (3)
doktorsavhandling (2)
Typ av innehåll
refereegranskat (28)
övrigt vetenskapligt/konstnärligt (9)
Författare/redaktör
Fodor, Viktoria (16)
Dán, György (11)
Olsson, Viktoria (8)
Wendin, Karin (7)
Karlsson, Viktoria (5)
Wärnberg, Fredrik (2)
visa fler...
Holmberg, Erik, 1951 (2)
Karlsson, Per, 1963 (2)
Hessle, Anna (2)
Schiza, Aglaia (2)
Friberg, Danielle (1)
Nilsson, Emma (1)
Andersson, Eva (1)
Karlsson, Magnus (1)
Karlsson, Anders (1)
Svensson, Magnus (1)
Bergh, Jonas (1)
Lernmark, Åke (1)
Agardh, Daniel (1)
Veijola, Riitta (1)
Cilio, Corrado (1)
Ivarsson, Sten (1)
Lee, Hye-Seung (1)
Andrén Aronsson, Car ... (1)
Hummel, Michael (1)
Koletzko, Sibylle (1)
Fredriksson, Robert (1)
Smith, Susan (1)
Yuan, Di, Professor (1)
Sundström, Patrik (1)
Akeus, Paulina (1)
Bexe-Lindskog, Elino ... (1)
Quiding-Järbrink, Ma ... (1)
Almgren, Peter (1)
Ask, Maria (1)
Johansson, Elin (1)
Langenes, Veronica (1)
Szeponik, Louis (1)
Tallon, C. (1)
Slusher, B. S. (1)
Marcus, Claude (1)
Karlsson, Håkan (1)
Hagströmer, Maria (1)
Micke, Patrick (1)
Östman, Arne (1)
Erlich, Henry (1)
Hyöty, Heikki (1)
Winkler, Christiane (1)
Knip, Mikael (1)
Ilonen, Jorma (1)
visa färre...
Lärosäte
Kungliga Tekniska Högskolan (17)
Högskolan Kristianstad (8)
Göteborgs universitet (4)
Uppsala universitet (4)
Naturvårdsverket (3)
Karolinska Institutet (3)
visa fler...
Marie Cederschiöld högskola (2)
Jönköping University (1)
Lunds universitet (1)
Högskolan i Skövde (1)
Linnéuniversitetet (1)
Sveriges Lantbruksuniversitet (1)
visa färre...
Språk
Engelska (33)
Svenska (4)
Forskningsämne (UKÄ/SCB)
Teknik (13)
Medicin och hälsovetenskap (10)
Naturvetenskap (7)
Lantbruksvetenskap (4)
Samhällsvetenskap (1)

År

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 Stäng

Kopiera och spara länken för att återkomma till aktuell vy