SwePub
Tyck till om SwePub Sök här!
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "LAR1:mdh srt2:(2005-2009)"

Sökning: LAR1:mdh > (2005-2009)

  • Resultat 1-10 av 3598
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  •  
2.
  • Abbaneo, Chiara, et al. (författare)
  • UML based reverse engineering for the verification of railway control logics
  • 2007
  • Ingår i: Proceedings of International Conference on Dependability of Computer Systems, DepCoS-RELCOMEX 2006. - : IEEE. - 0769525652 - 9780769525655 ; , s. 3-10
  • Konferensbidrag (refereegranskat)abstract
    • The Unified Modeling Language (UML) is widely used as a high level object oriented specification language. In this paper we present a novel approach in which reverse engineering is performed using UML as the modelling language used to achieve a representation of the implemented system. The target is the core logic of a complex critical railway control system, which was written in an application specific legacy language. UML perfectly suited to represent the nature of the core logic, made up by concurrent and interacting processes, using a bottom-up approach and proper modeling rules. Each process, in fact, was strictly related to the management of a physically (resp. logically) well distinguished railway device (resp. functionality). The obtained model deeply facilitated the static analysis of the logic code, allowing for at a glance verification of correctness and compliance with higher-level specifications, and opened the way to refactoring and other formal analyses. © 2006 IEEE.
  •  
3.
  •  
4.
  • Abdul-Ahad, Amir Stefan, et al. (författare)
  • Robust distance-based watermarking for digital image
  • 2008
  • Ingår i: Proceedings of the 2008 International Conference on Security and Management, SAM 2008. - 160132085X - 9781601320858 ; , s. 404-409
  • Konferensbidrag (refereegranskat)abstract
    • In this paper, an algorithm is developed to invisibly watermark a cover object (color image) using watermark object (iconic image). The algorithm is based on the distances among the addresses of values of the cover object. These distances use to make the embedding. The order of manipulating these distances are specified by the values of the watermark data which is dealt with serially. The algorithm serves and achieves self encryption key. Each watermark object has its unique pattern of distances at different possible lengths of distance bits. This enhances the complexity of sequential embedding. The algorithm is tested using direct and single level and double level of Two-Dimensional Discrete Wavelet Transform (2D DWT) embeddings. Two important issues are addressed. Firstly is to achieve a high Peak Signal to Noise Ratio (PSNR). The ratio was found to increase with an increasing of distance bits. Secondly is that the watermarked object retains the same properties of cover object. The algorithm shows resisting and withstanding against the most important attacks. Some of these include the lossy compression, blurring, resize and some types of Noise.
  •  
5.
  •  
6.
  • Abelli, Björn (författare)
  • Directing and Enacting the Information System
  • 2007
  • Ingår i: Advances in Information Systems Development - New Methods and Practice for the Networked Society.. - Boston, MA : Springer US. - 9780387708010 ; , s. 13-23
  • Bokkapitel (övrigt vetenskapligt/konstnärligt)
  •  
7.
  • Abelli, Björn (författare)
  • Enacting the e-Society
  • 2006
  • Ingår i: Proceedings of the IADIS International Conference e-Society 2006. ; , s. 285-298
  • Konferensbidrag (refereegranskat)
  •  
8.
  •  
9.
  •  
10.
  • Abrahamsson, Henrik, et al. (författare)
  • Robust Traffic Engineering using L-balanced Weight-Settings in OSPF/IS-IS
  • 2009
  • Ingår i: Proceedings of the 2009 6th International Conference on Broadband Communications, Networks and Systems, BROADNETS 2009. - 9789639799493
  • Konferensbidrag (refereegranskat)abstract
    • Internet traffic volumes continue to grow at a great rate, now pushed by video and TV distribution in the networks. This brings up the need for traffic engineering mechanisms to better control the traffic. The objective of traffic engineering is to avoid congestion in the network and make good use of available resources by controlling and optimising the routing function. The challenge for traffic engineering in IP networks is to cope with the dynamics of Internet traffic demands. Today, the main alternative for intra-domain traffic engineering in IP networks is to use different methods for setting the weights in the routing protocols OSPF and IS-IS. In this paper we revisit the weight setting approach to traffic engineering but with focus on robustness. We propose I-balanced weight settings that route the traffic on the shortest paths possible but make sure that no link is utilised to more than a given level I. This gives efficient routing of traffic and controlled spare capacity to handle unpredictable changes in traffic. We present a heuristic search method for finding I-balanced weight settings and show that it works well in real network scenarios
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 3598
Typ av publikation
konferensbidrag (1364)
tidskriftsartikel (1152)
bokkapitel (446)
rapport (220)
doktorsavhandling (117)
licentiatavhandling (80)
visa fler...
bok (56)
samlingsverk (redaktörskap) (50)
annan publikation (47)
recension (38)
proceedings (redaktörskap) (13)
forskningsöversikt (10)
patent (5)
visa färre...
Typ av innehåll
refereegranskat (2241)
övrigt vetenskapligt/konstnärligt (1092)
populärvet., debatt m.m. (265)
Författare/redaktör
Biesta, Gert (79)
Dahlquist, Erik (68)
Crnkovic, Ivica (60)
Nolte, Thomas (58)
Yan, Jinyue (54)
Sandberg, Anette (49)
visa fler...
Funk, Peter (42)
Sjödin, Mikael (40)
Christensson, Kyllik ... (36)
Xiong, Ning (34)
Tillgren, Per (34)
Lundqvist, Kristina (33)
Land, Rikard (32)
Lindén, Maria (31)
Holmström, Inger (31)
Pettersson, Paul (29)
Norström, Christer (29)
Behnam, Moris (27)
Fagerberg, Ingegerd (27)
Björkman, Mats (26)
Berglund, Karin (26)
Dodig-Crnkovic, Gord ... (26)
Carlson, Jan (25)
Jackson, Mats (25)
Bälter, Katarina (25)
Granlund, Mats (24)
Mahmoudi, Jafar (24)
Leppert, Jerzy (24)
Silvestrov, Dmitrii (24)
Martínez-Ortega, Jos ... (24)
Pecorari, Diane, 196 ... (23)
Bate, Iain (23)
Flammini, Francesco, ... (22)
Punnekkat, Sasikumar (22)
Lindholm, Torun (22)
Ermedahl, Andreas (22)
Nilsson, Kent W. (22)
Mäki-Turja, Jukka (22)
Lisper, Björn (21)
Odlare, Monica (20)
Bäck, Hanna (20)
Adami, Hans Olov (19)
Gustafsson, Jan (19)
Ahmed, Mobyen Uddin (19)
Wamala, Sarah (19)
Ingason, Haukur (19)
Eriksson, Kimmo (19)
Larsson, Stig (19)
Denison, Eva (19)
Bohlin, Markus (19)
visa färre...
Lärosäte
Mälardalens universitet (3598)
Uppsala universitet (282)
Karolinska Institutet (203)
Kungliga Tekniska Högskolan (112)
Stockholms universitet (99)
Örebro universitet (92)
visa fler...
Linnéuniversitetet (87)
Jönköping University (80)
Högskolan Dalarna (79)
Linköpings universitet (75)
Umeå universitet (59)
Göteborgs universitet (57)
Lunds universitet (43)
Marie Cederschiöld högskola (42)
Södertörns högskola (41)
Luleå tekniska universitet (40)
Chalmers tekniska högskola (38)
Karlstads universitet (35)
Högskolan i Gävle (30)
RISE (29)
Högskolan i Halmstad (26)
Mittuniversitetet (26)
Röda Korsets Högskola (23)
Högskolan i Skövde (15)
Blekinge Tekniska Högskola (14)
Handelshögskolan i Stockholm (9)
Högskolan i Borås (6)
Malmö universitet (4)
Sveriges Lantbruksuniversitet (3)
VTI - Statens väg- och transportforskningsinstitut (3)
Högskolan Väst (1)
Gymnastik- och idrottshögskolan (1)
Sophiahemmet Högskola (1)
visa färre...
Språk
Engelska (2896)
Svenska (612)
Franska (30)
Spanska (12)
Tyska (11)
Norska (11)
visa fler...
Italienska (9)
Finska (5)
Polska (3)
Danska (2)
Ryska (2)
Kinesiska (2)
Arabiska (1)
Portugisiska (1)
Turkiska (1)
visa färre...
Forskningsämne (UKÄ/SCB)
Samhällsvetenskap (950)
Teknik (646)
Medicin och hälsovetenskap (446)
Naturvetenskap (435)
Humaniora (187)
Lantbruksvetenskap (6)

Å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