Ändra sökning
Avgränsa sökresultatet
2345678 201 - 250 av 2741
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 201.
    Ashjaei, Mohammad
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Khalilzad, Nima
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Mubeen, Saad
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system. IS (Embedded Systems).
    Behnam, Moris
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Sander, Ingo
    Royal Institute of Technology, Sweden.
    Almeida, Luis
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Nolte, thomas
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Designing End-to-end Resource Reservations in Predictable Distributed Embedded SystemsIngår i: Real-time systems, ISSN 0922-6443, E-ISSN 1573-1383Artikel i tidskrift (Refereegranskat)
  • 202.
    Ashjaei, Mohammad
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Mubeen, Saad
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Behnam, Moris
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Almeida, Luis
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Nolte, Thomas
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    End-to-end Resource Reservations in Distributed Embedded Systems2016Ingår i: Proceedings - 2016 IEEE 22nd International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2016, 2016, 1-11 s., 7579921Konferensbidrag (Refereegranskat)
    Abstract [en]

    The resource reservation techniques provide effective means to lower the software complexity, ensure predictability and allow flexibility during the development and execution of complex distributed embedded systems. In this paper we propose a new end-to-end resource reservation model for distributed embedded systems. The model is comprehensive in such a way that it supports end-to-end resource reservations on distributed transactions with various activation patterns that are commonly used in industrial control systems. The model allows resource reservations on processors and real-time network protocols. We also present timing analysis for the distributed embedded systems that are developed using the proposed model. The timing analysis computes the end-to-end response times as well as delays such as data age and reaction delays. The presented analysis also supports real-time networks that can autonomously initiate transmissions. Such networks are not supported by the existing analyses. We also include a case study to show the usability of the model and end-to-end timing analysis with resource reservations.

  • 203.
    Ashjaei, Mohammad
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Patti, Gaetano
    University of Catania, Italy.
    Behnam, Moris
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Nolte, Thomas
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Alderisi, Giuliana
    University of Catania, Italy.
    Lo Bello, Lucia
    University of Catania, Italy.
    Schedulability Analysis of Ethernet Audio Video Bridging Networks with Scheduled Traffic Support2017Ingår i: Real-time systems, ISSN 0922-6443, E-ISSN 1573-1383, Vol. 53, nr 4, 526-577 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The IEEE Audio Video Bridging (AVB) technology is nowadays under consideration in several automation domains, such as, automotive, avionics, and industrial communications. AVB offers several benefits, such as open specifications, the existence of multiple providers of electronic components, and the real-time support, as AVB provides bounded latency to real-time traffic classes. In addition to the above mentioned properties, in the automotive domain, comparing with the existing in-vehicle networks, AVB offers significant advantages in terms of high bandwidth, significant reduction of cabling costs, thickness and weight, while meeting the challenging EMC/EMI requirements. Recently, an improvement of the AVB protocol, called the AVB ST, was proposed in the literature, which allows for supporting scheduled traffic, i.e., a class of time-sensitive traffic that requires time-driven transmission and low latency. In this paper, we present a schedulability analysis for the real-time traffic crossing through the AVB ST network. In addition, we formally prove that, if the bandwidth in the network is allocated according to the AVB standard, the schedulability test based on response time analysis will fail for most cases even if, in reality, these cases are schedulable. In order to provide guarantees based on analysis test a bandwidth over-reservation is required. In this paper, we propose a solution to obtain a minimized bandwidth over-reservation. To the best of our knowledge, this is the first attempt to formally spot the limitation and to propose a solution for overcoming it. The proposed analysis is applied to both the AVB standard and the AVB ST. The analysis results are compared with the results of several simulative assessments, obtained using OMNeT++, on both automotive and industrial case studies. The comparison between the results of the analysis and the simulation ones shows the effectiveness of the analysis proposed in this work.

  • 204.
    Aslam, Mudassar
    Mälardalens högskola, Akademin för innovation, design och teknik. Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Bringing Visibility in the Clouds: using Security, Transparency and Assurance Services2014Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    The evolution of cloud computing allows the provisioning of IT resources over the Internet and promises many benefits for both - the service users and providers. Despite various benefits offered by cloud based services, many users hesitate in moving their IT systems to the cloud mainly due to many new security problems introduced by cloud environments. In fact, the characteristics of cloud computing become basis of new problems, for example, support of third party hosting introduces loss of user control on the hardware; similarly, on-demand availability requires reliance on complex and possibly insecure API interfaces; seamless scalability relies on the use of sub-providers; global access over public Internet exposes to broader attack surface; and use of shared resources for better resource utilization introduces isolation problems in a multi-tenant environment. These new security issues in addition to existing security challenges (that exist in today's classic IT environments) become major reasons for the lack of user trust in cloud based services categorized in Software-as-a-Service (SaaS), Platform-as-a-Service (PaaS) or Infrastructure-as-a-Service (IaaS).

    The focus of this thesis is on IaaS model which allows users to lease IT resources (e.g. computing power, memory, storage, etc.) from a public cloud to create Virtual Machine (VM) instances. The public cloud deployment model considered in this thesis exhibits most elasticity (i.e. degree of freedom to lease/release IT resources according to user demand) but is least secure as compared to private or hybrid models. As a result, public clouds are not trusted for many use cases which involve processing of security critical data such as health records, financial data, government data, etc. However, public IaaS clouds can also be made trustworthy and viable for these use cases by providing better transparency and security assurance services for the user. In this thesis, we consider such assurance services and identify security aspects which are important for making public clouds trustworthy. Based upon our findings, we propose solutions which promise to improve cloud transparency thereby realizing trustworthy clouds.

    The solutions presented in this thesis mainly deal with the secure life cycle management of the user VM which include protocols and their implementation for secure VM launch and migration. The VM launch and migration solutions ensure that the user VM is always hosted on correct cloud platforms which are setup according to a profile that fulfills the use case relevant security requirements. This is done by using an automated platform security audit and certification mechanism which uses trusted computing and security automation techniques in an integrated solution. In addition to provide the assurance about the cloud platforms, we also propose a solution which provides assurance about the placement of user data in correct and approved geographical locations which is critical from many legal aspects and usually an important requirement of the user. Finally, the assurance solutions provided in this thesis increase cloud transparency which is important for user trust and to realize trustworthy clouds.

  • 205.
    Asplund, Fredrik
    KTH, Skolan för industriell teknik och management (ITM), Maskinkonstruktion (Inst.), Mekatronik.
    Risks Related to the Use of Software Tools when Developing Cyber-Physical Systems: A Critical Perspective on the Future of Developing Complex, Safety-Critical Systems2014Doktorsavhandling, monografi (Övrigt vetenskapligt)
    Abstract [sv]

    Den ökande komplexiteten och storleken på Cyber-Fysiska System (CPS) har lett till att produktiviteten i utvecklingen av CPS har minskat kraftigt. Krav på att CPS ska vara säkra att använda förvärrar problemet ytterligare, då dessa ofta är svåra att säkerställa och samtidigt av stor vikt för samhället.

    Mjukvaruverktyg, eller egentligen alla insatser för att automatisera utvecklingen av CPS, är en central komponent i många innovationer menade att lösa detta problem. Även om forskningen endast delvis studerat säkerhetsrelaterade konsekvenser av att automatisera produktutveckling, så är det känt att automation har haft en kraftig (och subtil) inverkan på operationella system. Om verktyg ska lösa problemet med en ökande komplexitet hos säkerhetskritiska CPS, så måste verktygens påverkan på produktutveckling, och i förlängningen på det säkra användandet av slutprodukterna, vara känd.

    Den här boken ger en översikt av forskningsfronten gällande säkerhetsrelaterade konsekvenser av verktygsanvändning. Denna kommer från en litteraturstudie i områdena systemsäkerhet, mjukvaruutveckling och verktygsintegration. Industriella säkerhetsstandarder identifieras som en viktig informationskälla. Då riskerna med användandet av enskilda verktyg har undersökts i stor utsträckning hos producenter av produkter relaterade till transport, studeras flera välkända säkerhetsstandarder från denna domän. Enligt de utvalda standarderna bör automation primärt utvärderas utifrån dess förmåga att självständigt utföra enskilda processteg på ett robust sätt. Automation som stödjer operatörers egna handlingar ses som tämligen oviktig.

    En konceptuell modell och en referensmodell har utvecklats baserat på litteraturstudien. Den förstnämnda definierar vilka entiteter och relationer som är av vikt för säkerhetsrelaterade konsekvenser av verktygsanvändning. Den sistnämnda beskriver olika aspekter av verktygsintegration och hur dessa relaterar till varandra. Genom att kombinera modellerna och utföra en riskanalys har egenskaper hos verktygskedjor som måste säkerställas för att undvika risk identifierats. Tio sådana säkerhetsrelaterade egenskaper beskrivs.

    Dessa säkerhetsrelaterade egenskaper möjliggör ett systematiskt sätt att begränsa vad som måste beaktas under studier av risker relaterade till verktygsanvändning. Hypotesen att ett stort antal faktorer relaterade till verktygsanvändning innebär risk kunde därför testas i en empirisk studie. Denna studie identifierade säkerhetsrelaterade svagheter i utvecklingsmiljöer knutna både till höga och låga nivåer av automation. Slutsatsen är att ett brett perspektiv, som inkluderar fler faktorer än de som beaktas av de utvalda standarderna, kommer att behövas i framtiden.

    Tre möjliga orsaker till att ett bredare perspektiv ändå skulle vara irrelevant analyseras, nämligen egenskaper specifika för CPS-domänen, egenskaper hos säkerhetskritiska CPS och möjligheten att lita på en beprövad, manuell process. Slutsatsen blir att ett bredare perspektiv är motiverat, och att den framtida utvecklingen av utvecklingsmiljöer för CPS sannolikt kommer att öka denna betydelse.

    Baserat på detta breda perspektiv läggs förslag fram för hur de mentala modellerna som bärs fram av de utvalda säkerhetstandarderna (och andra standarder som dem) kan utvecklas.

  • 206.
    Asplund, Fredrik
    et al.
    KTH, Skolan för industriell teknik och management (ITM), Maskinkonstruktion (Inst.), Mekatronik.
    Biehl, Matthias
    KTH, Skolan för industriell teknik och management (ITM), Maskinkonstruktion (Inst.), Mekatronik.
    El-Khoury, Jad
    KTH, Skolan för industriell teknik och management (ITM), Maskinkonstruktion (Inst.), Mekatronik.
    Törngren, Martin
    KTH, Skolan för industriell teknik och management (ITM), Maskinkonstruktion (Inst.), Mekatronik.
    Tool Integration Beyond Wasserman2011Ingår i: Advanced Information Systems Engineering Workshops / [ed] Camille Salinesi, Oscar Pastor, Berlin: Springer-Verlag , 2011, 270-281 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    The typical development environment today consists of many specialized development tools, which are partially integrated, forming a complex tool landscape with partial integration. Traditional approaches for reasoning about tool integration are insufficient to measure the degree of integration and integration optimality in today’s complex tool landscape. This paper presents a reference model that introduces dependencies between, and metrics for, integration aspects to overcome this problem. This model is used to conceive a method for reasoning about tool integration and identify improvements in an industrial case study. Based on this we are able to conclude that our reference model does not detract value from the principles that it is based on, instead it highlights improvements that were not well visible earlier. We conclude the paper by discussing open issues for our reference model, namely if it is suitable to use during the creation of new systems, if the used integration aspects can be subdivided further to support the analysis of secondary issues related to integration, difficulties related to the state dependency between the data and process aspects within the context of developing embedded systems and the analysis of non-functional requirements to support tool integration.

  • 207.
    Asplund, Katarina
    et al.
    Karlstads universitet, Institutionen för informationsteknologi.
    Brunstrom, Anna
    Karlstads universitet, Institutionen för informationsteknologi.
    Partially Reliable Multimedia Transport2004Rapport (Övrigt vetenskapligt)
  • 208.
    Asplund, Katarina
    et al.
    Karlstads universitet, Institutionen för informationsteknologi.
    Brunstrom, Anna
    The trade-off Between Latency and Image Quality: A User PerspectiveManuskript (preprint) (Övrig (populärvetenskap, debatt, mm))
  • 209.
    Asplund, Katarina
    et al.
    Karlstads universitet, Institutionen för informationsteknologi.
    Garcia, Johan
    Brunstrom, Anna
    Schneyer, Sean
    Decreasing Transfer Delay Through Partial ReliabilityManuskript (preprint) (Övrig (populärvetenskap, debatt, mm))
  • 210.
    Asplund, Lars
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Lundqvist, Kristina
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Safety Critical Systems Based on Formal Models2000Ingår i: ACM SIGAda Letters, ISSN 1094-3641, Vol. XX, nr 4, 32-39 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The Ravenscar profile for high integrity systems using Ada 95 is well defined in all real-time aspects. The complexity of the run-time system has been reduced to allow full utilization of formal methods for applications using the Ravenscar profile. In the Mana project a tool set is being developed including a formal model of a Ravenscar compliant run-time system, a gnat compatible run-time system, and an ASIS based tool to allow for the verification of a system including both COTS and code that is reused.

  • 211.
    Asplund, Lars
    et al.
    Uppsala University, Sweden.
    Lundqvist, Kristina
    Massachusetts Institute of Technology, USA.
    Safety Critical Systems Based on Formal Models2000Ingår i: ACM SIGAda Ada Letters - special issue on presentations from SIGAda 2000, Vol. XX, Iss. 4, 2000Konferensbidrag (Övrigt vetenskapligt)
  • 212.
    Asplund, Lars
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Lundqvist, Kristina
    MIT, Cambridge, MA, United States .
    The Gurkh Project: A Framework for Verification and Execution of Mission Critical Applications2003Ingår i: AIAA/IEEE Digital Avionics Systems Conference - Proceedings, vol. 2, 2003, 10.B.1/1-10.B.1/9 s.Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    The paper contributes with three methods that together will make a complete tool-set for verification of mission critical applications. The first method is the transformation of existing Ada or VHDL code into an intermediate form. This form is used for verification by numerous different model checkers. The second method is a predictable runtime kernel that has both a verifiable formal model and is implemented in hardware to achieve full predictability. Finally, a method for transforming the intermediate form of the complete system into a hardware unit, the SafetyChip that performs runtime control of the system. This SafetyChip can catch 'out-of-state' behaviors.

  • 213.
    Asplund, Mikael
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Nadjm-Tehrani, Simin
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Attitudes and Perceptions of IoT Security in Critical Societal Services2016Ingår i: IEEE Access, E-ISSN 2169-3536, Vol. 4, 2130-2138 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    A quiet revolution that impacts several sectors, ranging over transport, home automation, energy, industrial control, and health services is undergoing with addition of new networked devices leading to enhanced services. In this paper, we aim to identify information security requirements that are common over several (vertical) sectors, and in particular, ones that impact critical societal services, namely, the energy, water, and health management systems. We present the results of an interview-based study where actors in these sectors were asked about their perceptions and attitudes on the security of Internet of Things (IoT). We set these perceptions and attitudes in context through a literature review of IoT security, and relate to current challenges in this area. This paper demonstrates that despite an overall optimistic view on IoT in critical societal services, there is a lack of consensus on risks related to IoT security.

  • 214.
    Assabie, Yaregal
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Bigun, Josef
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Ethiopic Document Image Database for Testing Character Recognition Systems2006Rapport (Övrigt vetenskapligt)
    Abstract [en]

    In this paper we describe the acquisition and content of a large database of Ethiopic documents for testing and evaluating character recognition systems. The Ethiopic Document Image Database (EDIDB) contains documents written in Amharic and Geez languages. The database was built from a variety of documents such as printouts, books, newspapers, and magazines. Documents written in various font types, sizes and styles were included in the database. Degraded and poor quality documents were also included in the database to represent the real life situation. A total of 1,204 pages were scanned at a resolution of 300 dpi and saved as grayscale images of JPEG format. We also describe an evaluation protocol for standardizing the comparison of recognition systems and their results. The database is made available to the research community through http://www.hh.se/staff/josef/.

  • 215.
    Aster, Maximilian
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Repackaging Web Pages2013Självständigt arbete på avancerad nivå (magisterexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Current trends in the market of Web-enabled devices are moving the focus from desktop web pages to pages optimised for a set of other devices like smartphones or tablets. Within this thesis an approach is introduced, able to adapt and automatically transform web pages and even the web applications logic flow into a new kind of representation, specifically for a certain target group. Therefore a general process is defined to describe the various phases that have to be gone through to transform or repackage a website. It serves as the basis for the solution, which was built as part of this thesis, and incorporates state of the art concepts and methods from various fields of Web Science. The implemented artefacts demonstrate how an appropriate architecture looks like and what additional possibilities open up.

  • 216.
    Atif, Sohaib
    Mittuniversitetet, Fakulteten för naturvetenskap, teknik och medier, Avdelningen för informations- och kommunikationssystem. Mid sweden University.
    Cooperative diversity and downlink power control using PARPS with application to LTE services (eMBMS and CoMP)2014Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Mobile devices and their applications are continuing to develop and the more advanced they are, the more they require high data ranges and the more they demand of the available wireless communication networks. At present, LTE (Long Term Evolution) is a good solution as it provides the users of mobile devices with a good throughput and a low latency. In the future, the two most important aspects for end users will be system spectral efficiency and system power controlling. This thesis deals with LTE downlink spectral efficiency and power controlling. The thesis will show how, by using IP multicasting for the LTE downlink, the base station is able to provide the necessary data through a significantly smaller spectrum and, additionally, how cooperative diversity, i.e. the cooperation between several base stations, can improve or even maximise the total network channel capacity, regardless of bandwidth size. A Packet and Resource Plan Scheduling algorithm (PARPS) is used to schedule the transmissions, and the results are calculated in MATLAB. By this means it is possible to analyse the efficiency of the spectrum management, the coverage probability and the power controlling for the different transmitters used for the LTE downlink.The LTE downlink scheme is simulated in Matlab for different numbers of transmitters (2-3). IP multicasting over the LTE downlink manages to transmit the same amount of data using less transmission power (50- 66.6%) with a better system spectral efficiency.

  • 217.
    Atig, Mohamed Faouzi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Bouajjani, Ahmed
    LIAFA, CNRS and University of Paris Diderot.
    Kumar, K. Narayan
    Chennai Mathematical Institute, Chennai, India.
    Saivasan, Prakash
    Chennai Mathematical Institute, Chennai.
    On Bounded Reachability Analysis of Shared Memory Systems2014Ingår i: {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2014, December 15-17, 2014, New Delhi, India, 2014Konferensbidrag (Refereegranskat)
  • 218.
    Atig, Mohamed Faouzi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Bouajjani, Ahmed
    LIAFA, CNRS and University of Paris Diderot.
    Parlato, Gennaro
    University of Southampton.
    Context-Bounded Analysis of TSO Systems2014Ingår i: From Programs to Systems: The Systems perspective in Computing / [ed] Bensalem, S; Lakhneck, Y; Legay, A, Springer, 2014, 21-38 s.Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    We address the state reachability problem in concurrent programs running over the TSO weak memory model. This problem has been shown to be decidable with non-primitive recursive complexity in the case of finite-state threads. For recursive threads this problem is undecidable. The aim of this paper is to provide under-approximate analyses for TSO systems that are decidable and have better (elementary) complexity. We propose three bounding concepts for TSO behaviors that are inspired from the concept of bounding the number of context switches introduced by Qadeer and Rehof for the sequentially consistent (SC) model. We investigate the decidability and the complexity of the state reachability problems under these three bounding concepts for TSO, and provide reduction of these problems to known reachability problems of concurrent systems under the SC semantics.

  • 219.
    Atig, Mohamed Faouzi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Kumar, K. Narayan
    Saivasan, Prakash
    Acceleration in Multi-PushDown Systems2016Ingår i: Tools and Algorithms for the Construction and Analysis of Systems, Springer, 2016, 698-714 s.Konferensbidrag (Refereegranskat)
  • 220.
    Attarzadeh-Niaki, Seyed Hosein
    et al.
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Elektronik och Inbyggda System.
    Sander, Ingo
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Elektronik och Inbyggda System.
    Integrating Functional Mock-up units into a formal heterogeneous system modeling framework2015Ingår i: 18th CSI International Symposium on Computer Architecture and Digital Systems, CADS 2015, Institute of Electrical and Electronics Engineers (IEEE), 2015Konferensbidrag (Refereegranskat)
    Abstract [en]

    The Functional Mock-up Interface (FMI) standard defines a method for tool- and platform-independent model exchange and co-simulation of dynamic system models. In FMI, the master algorithm, which executes the imported components, is a timed differential equation solver. This is a limitation for heterogeneous embedded and cyber-physical systems, where models with different time abstractions co-exist and interact. This work integrates FMI into a heterogeneous system modeling and simulation framework as process constructors and co-simulation wrappers. Consequently, each external model communicates with the framework without unnecessary semantic adaptation while the framework provides necessary mechanisms for handling heterogeneity. The presented methods are implemented in the ForSyDe-SystemC modeling framework and tested using a case study.

  • 221.
    Atxutegi, Eneko
    et al.
    Spanien.
    Liberal, Fidel
    Spanien.
    Grinnemo, Karl-Johan
    Karlstad University.
    Brunström, Anna
    Karlstad University.
    Arvidsson, Åke
    Högskolan Kristianstad, Sektionen för hälsa och samhälle, Avdelningen för Design och datavetenskap. Ericsson AB.
    Robert, Rèmi
    Ericsson AB.
    TCP behaviour in LTE: impact of flow start-up and mobility2016Ingår i: Wireless and Mobile Networking Conference (WMNC), 2016 9th IFIP, IEEE Communications Society, 2016, 73-80 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    Mobile internet has been widely adopted and it is expected to rise to almost 4 billion users by 2020. Despite the research effort dedicated to the enhancement of its performance, there still exists a gap in the understanding of how TCP and its many variants work over LTE. To this end, this paper evaluates the extent to which five common TCP variants, CUBIC, NewReno,Westwood+, Illinois, and CAIA Delay Gradient (CDG), are able to utilise available radio resources under hard conditions, such as during start-up and in mobile scenarios at different speeds. The paper suggests that CUBIC, due to its Hybrid Slow-Start mechanism, enters congestion avoidance prematurely, and thus experiences a prolonged start-up phase. As a result, it is unable to efficiently utilise radio resources during shorter transmissionsessions. Besides, CUBIC, Illinois and NewReno, i.e., the loss-based TCP implementations, offer better throughput, and are able to better utilise available resources during mobility than Westwood+ and CDG - the delay-based variants do.

  • 222.
    Augustsson, Jesper
    et al.
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för informatik (IK).
    Salomonsson, Peter
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för informatik (IK).
    Gamification - Samspelet mellan människor och IT: Undersökning av spelmekanismers motivationshöjande effekter2015Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Denna kandidatuppsats är en studie gjord för att undersöka spelmekanismer i en utvald träningsapplikation. Syftet med undersökningen är att skapa ökad förståelsen på varför människor får motivationshöjande effekter med hjälp av den utvalda träningsapplikationen. Detta kommer göras genom att undersöka användare av det praktiskta exemplet Nike+ för att ta reda på vilka funktioner som de anser gett dem motivationshöjande effekter och därmed ta fram vilka spelmekanismer dessa innefattar.

     

    Studien använder sig av en kvalitativ ansats och genom  intervjuer göra en datainsamling av användare av undersökningsexemplet Nike+. Intervjufrågorna grundar sig i teori om området Gamification samt tidigare forskning kring ämnet.

     

    Resultatet visar att det finns flera olika spelmekanismer implementerade i Nike+ som har positiv inverkan på användarna. Resultatet stärker att de spelmekanismer som informanterna ställts sig positivt till har hjälpt till att göra motionsträning en roligare form av träning samt ökat träningsfrekvensen hos informanterna.

  • 223.
    Aurelius, Andreas
    et al.
    Acreo.
    Arvidsson, Åke
    Ericsson AB.
    Heegard, Poul
    Norge.
    Villa, Björn
    Norge.
    Kihl, Maria
    Lunds Universitet.
    Zhang, Yichi
    Kungliga Tekniska Högskolan.
    How much of the bandwidth do we actually use?: an investigation of residential access traffic load2012Ingår i: ICTON 2012 / [ed] Bozena Jaskorzynska och Richard De La Rue, IEEE Communications Society, 2012Konferensbidrag (Refereegranskat)
    Abstract [en]

    Internet traffic from a fibre based residential access network is investigated concerning traffic volumes and link load. Also the cost of the services is analyzed. We show that 1 Mbps accesses subscribers maintain high loads, and that the price they pay per GB used is five times higher than the one paid by 100 Mbps access subscribers.

  • 224. Avdagic, Zikrija
    et al.
    Boskovic, Dusanka
    Causevic, Aida
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Code Evaluation Using Fuzzy Logic2008Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper presents application of a fuzzy logic based system to automatically evaluate the

    maintainability of code. Code evaluation is accomplished by rating its quality provided with bad smells in

    code as inputs. Straightforward bad smells with existing software metrics tools are selected as inputs:

    duplicated code, long methods, large classes having a high cyclomatic complexity, or a large number of

    parameters and temporary fields. Removing these bad smells can result in significant code improvements

    concerning readability and maintainability. However, the precise definition of attributes like small, long, large

    or high is not clear, and their identification is rather subjective. Fuzzy logic values are suitable for capturing

    partial correspondence to attributes and fuzzy rules model have been used to describe the relation between bad

    smells and code quality. Model supporting the experimental evaluation of the fuzzy based code evaluation is

    implemented in Java.

    Key-Words: - Fuzzy Logic, Reasoning Systems, Refactoring, Bad Smells

  • 225.
    Avdic, Kenan
    et al.
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Melot, Nicolas
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Kessler, Christoph
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Keller, Jörg
    FernUniversität in Hagen.
    Pipelined parallel sorting on the Intel SCC2011Ingår i: Fourth Swedish Workshop on Multi-Core Computing MCC-2011: November 23-25, 2011, Linköping University, Linköping, Sweden / [ed] Christoph Kessler, Linköping: Linköping University , 2011, Vol. S. 96-101, 96-101 s.Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    The Single-Chip Cloud Computer (SCC) is an experimental processor created by Intel Labs. It comprises 48 Intel-IA32 cores linked by an on-chip high performance mesh network, as well as four DDR3 memory controllers to access an off-chip main memory. We investigate the adaptation of sorting onto SCC as an algorithm engineering problem. We argue that a combination of pipelined mergesort and sample sort will fit best to SCC's architecture. We also provide a mapping based on integer linear programming to address load balancing and latency considerations. We describe a prototype implementation of our proposai together with preliminary runtime measurements, that indicate the usefulness of this approach. As mergesort can be considered as a representative of the class of streaming applications, the techniques deveioped here should also apply to the other problems in this class, such as many applications for parallel embedded systems, i.e. MPSoC. 

  • 226.
    Avgouleas, Ioannis
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    IoT Networking Resource Allocation and Cooperation2017Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    The Internet of Things (IoT) promises that "anything that can be connected, will be connected". It comprises of Information and Communication Technologies that interconnect billions of physical and visual things with some "basic" intelligence. The emerging IoT services will be able to react with minimal human intervention and further contribute to the big data era that requires real-time, ultrareliable, ubiquitous, scalable, and heterogeneous operation.

    This thesis is the result of our investigations on problems dealing with the evolution of such technologies. First, we explore the potential of using relay i.e., intermediate, nodes that assist users to transmit their packets in a a cellular network. Paper I provides insights into how adapting the cooperation of the relay's receiver and transmitter optimizes the network-wide throughput while the relay's queue stability is guaranteed.

    The next part of the thesis copes with the resource allocation of services on IoT devices equipped with multiple network interfaces. The resources are heterogeneous and can be split among dierent interfaces. Additionally, they are not interchangeable. In paper II, we develop optimization models for this resource allocation problem, prove the complexity of the models, and derive results that give intuition into the problems. Moreover, we propose algorithms that approximate the optimal solution and show under which circumstances this is possible.

    Finally, in paper III, we present a resource allocation problem specically for smart cities services. In comparison to the previous problem denition, resources are of one type but the IoT network device can oer capacities that vary over time. Furthermore, services have a tolerance regarding their preferred scheduling, namely, their allocation over time. We parametrize each service with a pricing function to indicate its tolerance to be served at the beginning of the scheduling window. We prove that the problem is computationally hard and provide numerical results to gain insight into how different pricing weight functions impact the allocations' distribution within the scheduling window.

  • 227.
    Avgouleas, Ioannis
    et al.
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Pappas, Nikolaos
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Yuan, Di
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Angelakis, Vangelis
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Probabilistic Cooperation of a Full-Duplex Relay in Random Access Networks2017Ingår i: IEEE Access, E-ISSN 2169-3536, Vol. 5, 7394-7404 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this paper, we analyze the probabilistic cooperation of a full-duplex relay in a multiuser random-access network. The relay is equipped with on/off modes for the receiver and the transmitter independently. These modes are modeled as probabilities by which the receiver and the transmitter are activated. We provide analytical expressions for the performance of the relay queue, such as arrival and service rates, stability conditions, and the average queue size. We optimize the relays operation setup to maximize the network-wide throughput while, simultaneously, we keep the relays queue stable and lower the relays receptions and transmissions. Furthermore, we study the effect of the SINR threshold and the self-interference coefficient on the per-user and network-wide throughput. For low SINR threshold, we show under which circumstances it is beneficial to switch off the relay completely, or switch off the relays receiver only.

  • 228.
    Avritzer, A
    et al.
    Siemens Corporate Research, USA.
    Weyuker, Elaine
    AT and T Labs - Research, USA.
    The Automated Generation of Test Cases using an Extended Domain Based Reliability Model2009Ingår i: Proceedings of the 2009 ICSE Workshop on Automation of Software Test, AST 2009, 2009, 44-52 s., 5069040Konferensbidrag (Refereegranskat)
  • 229.
    Awan, Ahsan Javed
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS. KTH Royal Institute of Technology.
    Performance Characterization of In-Memory Data Analytics on a Scale-up Server2016Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    The sheer increase in volume of data over the last decade has triggered research in cluster computing frameworks that enable web enterprises to extract big insights from big data. While Apache Spark defines the state of the art in big data analytics platforms for (i) exploiting data-flow and in-memory computing and (ii) for exhibiting superior scale-out performance on the commodity machines, little effort has been devoted at understanding the performance of in-memory data analytics with Spark on modern scale-up servers. This thesis characterizes the performance of in-memory data analytics with Spark on scale-up servers.

    Through empirical evaluation of representative benchmark workloads on a dual socket server, we have found that in-memory data analytics with Spark exhibit poor multi-core scalability beyond 12 cores due to thread level load imbalance and work-time inflation. We have also found that workloads are bound by the latency of frequent data accesses to DRAM. By enlarging input data size, application performance degrades significantly due to substantial increase in wait time during I/O operations and garbage collection, despite 10% better instruction retirement rate (due to lower L1 cache misses and higher core utilization).

    For data accesses we have found that simultaneous multi-threading is effective in hiding the data latencies. We have also observed that (i) data locality on NUMA nodes can improve the performance by 10% on average, (ii) disabling next-line L1-D prefetchers can reduce the execution time by up-to 14%. For GC impact, we match memory behaviour with the garbage collector to improve performance of applications between 1.6x to 3x. and recommend to use multiple small executors that can provide up-to 36% speedup over single large executor.

  • 230.
    Awan, Ahsan Javed
    et al.
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Brorsson, Mats
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Vlassov, Vladimir
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Ayguade, Eduard
    Barcelona Super Computing Center and Technical University of Catalunya.
    Architectural Impact on Performance of In-memoryData Analytics: Apache Spark Case StudyManuskript (preprint) (Övrigt vetenskapligt)
    Abstract [en]

    While cluster computing frameworks are contin-uously evolving to provide real-time data analysis capabilities,Apache Spark has managed to be at the forefront of big data an-alytics for being a unified framework for both, batch and streamdata processing. However, recent studies on micro-architecturalcharacterization of in-memory data analytics are limited to onlybatch processing workloads. We compare micro-architectural per-formance of batch processing and stream processing workloadsin Apache Spark using hardware performance counters on a dualsocket server. In our evaluation experiments, we have found thatbatch processing are stream processing workloads have similarmicro-architectural characteristics are bounded by the latency offrequent data access to DRAM. For data accesses we have foundthat simultaneous multi-threading is effective in hiding the datalatencies. We have also observed that (i) data locality on NUMAnodes can improve the performance by 10% on average and(ii)disabling next-line L1-D prefetchers can reduce the executiontime by up-to 14% and (iii) multiple small executors can provideup-to 36% speedup over single large executor

  • 231.
    Awan, Ahsan Javed
    et al.
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Brorsson, Mats
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Vlassov, Vladimir
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Ayguade, Eduard
    Technical University of Catalunya, Barcelona Super Computing Center.
    How Data Volume Affects Spark Based Data Analytics on a Scale-up Server2015Ingår i: Big Data Benchmarks, Performance Optimization, and Emerging Hardware: 6th Workshop, BPOE 2015, Kohala, HI, USA, August 31 - September 4, 2015. Revised Selected Papers, Springer, 2015, Vol. 9495, 81-92 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    Sheer increase in volume of data over the last decade has triggered research in cluster computing frameworks that enable web enterprises to extract big insights from big data. While Apache Spark is gaining popularity for exhibiting superior scale-out performance on the commodity machines, the impact of data volume on the performance of Spark based data analytics in scale-up configuration is not well understood. We present a deep-dive analysis of Spark based applications on a large scale-up server machine. Our analysis reveals that Spark based data analytics are DRAM bound and do not benefit by using more than 12 cores for an executor. By enlarging input data size, application performance degrades significantly due to substantial increase in wait time during I/O operations and garbage collection, despite 10 % better instruction retirement rate (due to lower L1 cache misses and higher core utilization). We match memory behaviour with the garbage collector to improve performance of applications between 1.6x to 3x.

  • 232.
    Awan, Ahsan Javed
    et al.
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Brorsson, Mats
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Vlassov, Vladimir
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Ayguade, Eduard
    Barcelona Super Computing Center and Technical University of Catalunya.
    Micro-architectural Characterization of Apache Spark on Batch and Stream Processing Workloads2016Konferensbidrag (Refereegranskat)
    Abstract [en]

    While cluster computing frameworks are continuously evolving to provide real-time data analysis capabilities, Apache Spark has managed to be at the forefront of big data analytics for being a unified framework for both, batch and stream data processing. However, recent studies on micro-architectural characterization of in-memory data analytics are limited to only batch processing workloads. We compare the micro-architectural performance of batch processing and stream processing workloads in Apache Spark using hardware performance counters on a dual socket server. In our evaluation experiments, we have found that batch processing and stream processing has same micro-architectural behavior in Spark if the difference between two implementations is of micro-batching only. If the input data rates are small, stream processing workloads are front-end bound. However, the front end bound stalls are reduced at larger input data rates and instruction retirement is improved. Moreover, Spark workloads using DataFrames have improved instruction retirement over workloads using RDDs.

  • 233.
    Awan, Ahsan Javed
    et al.
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Brorsson, Mats
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Vlassov, Vladimir
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Ayguade, Eduard
    Barcelona Super Computing Center and Technical University of Catalunya.
    Node architecture implications for in-memory data analytics on scale-in clusters2016Konferensbidrag (Refereegranskat)
    Abstract [en]

    While cluster computing frameworks are continuously evolving to provide real-time data analysis capabilities, Apache Spark has managed to be at the forefront of big data analytics. Recent studies propose scale-in clusters with in-storage processing devices to process big data analytics with Spark However the proposal is based solely on the memory bandwidth characterization of in-memory data analytics and also does not shed light on the specification of host CPU and memory. Through empirical evaluation of in-memory data analytics with Apache Spark on an Ivy Bridge dual socket server, we have found that (i) simultaneous multi-threading is effective up to 6 cores (ii) data locality on NUMA nodes can improve the performance by 10% on average, (iii) disabling next-line L1-D prefetchers can reduce the execution time by up to 14%, (iv) DDR3 operating at 1333 MT/s is sufficient and (v) multiple small executors can provide up to 36% speedup over single large executor.

  • 234.
    Axelsson, Andreas
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Ambrosius, Christian
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Nya lagar och avtal: Hur kan de komma att förändra svenskarnas fildelningsvanor?2012Självständigt arbete på grundnivå (högskoleexamen), 5 poäng / 7,5 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    I många år nu har det varit vanligt förekommande att människor suttit hemma vid sin dator och med några få klick laddat ner filmer, musik och programvaror, till en början helt lagligt, men med åren har lagar kommit till som har gjort det mer och mer olagligt.Oavsett om det har varit lagligt eller inte, så är det troligt att många artister, filmmakare och liknande gått miste om stora summor pengar i förlorade inkomster på grund av att folk inte har betalat för att ta del av deras verk, utan istället valt att ladda ner dem över Internet.

    Det faktum att fildelning har blivit så pass vanligt och att folk inte har sett det som ett särskilt allvarligt brott, har lett till att fildelning länge har varit ett hett omdiskuterat ämne i media, bland upphovsrättsinnehavare och bland folk i allmänhet. Upphovsmän och upphovsrättsinnehavare, såsom filmbolag, författare och artister har legat på och debatterat för att försöka få till en hårdare lagstiftning för att försvåra fildelning och kopiering av upphovsrättsskyddat material, samt för att få till hårdare straff mot fildelning.

    Flera försök från beslutsfattare har gjorts för att råda bot på problemet, nya lagar har stiftats och avtal har skrivits under. Frågan är om de nya lagarna och avtalen gör någon nytta? Blir folk avskräckta från att fildela eller fortsätter de som förut? Många har säkert under många år blivit bortskämda med att kunna sitta hemma vid datorn och på några minuter få hem de senaste filmerna och den nyaste musiken helt gratis, vilket säkert gör det svårt att helt plötsligt sluta fildela och börja betala för film och musik igen.

  • 235.
    Axelsson, Jakob
    Software and Systems Engineering Laboratory, Swedish Institute of Computer Science (SICS), Kista, Sweden .
    A Systematic Mapping of the Research Literature on System-of-Systems Engineering2015Ingår i: 10th Annual Systems of Systems Engineering Conference SOSE, 2015, 18-23 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    The research area systems-of-systems engineering has increased rapidly over the last decade and now contains a substantial body of literature. To get an overview of the field, a systematic mapping of the literature has been done, covering over 3000 papers. It revealed a field massively dominated by US researchers, with an emphasis on military and space systems. A large number of people are involved, but few researchers focus on the area, and citations are fairly low compared to other fields. Important research topics include architecture, modeling and simulation, integration and interoperability, communication, sustainability, and safety and security. There are signs of immaturity within the research area, and it is recommended that existing venues are complemented with an international scientific event with very high standards for submissions.

  • 236.
    Axelsson, Jakob
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Architectural Allocation Alternatives and Associated Concerns in Cyber-Physical Systems: A Case Study2015Ingår i: ECSAW '15 Proceedings of the 2015 European Conference on Software Architecture Workshops, 2015, Vol. Article No.15Konferensbidrag (Refereegranskat)
    Abstract [en]

    Cyber-physical systems is an extension of traditional embedded systems, where communication to the outside world is given more emphasis. This leads to a new design space also for software development, allowing new allocation strategies for functionality. In traditional embedded systems, all functionality was inside the product, but now it becomes possible to partition the software between the embedded systems and IT systems outside the product. This paper investigates, through a case study from the automotive domain, possible new allocation alternatives where computation is offloaded from the embedded system to a server, and what additional architectural concerns this leads to, including performance, resource utilization, robustness, and lifecycle aspects. In addition, the paper addresses new opportunities created by allocating functionality outside the embedded systems, and thus making data available for extended services, as well as the larger concerns that result on the organizational level, including new competency in architecture and DevOps.

  • 237.
    Axelsson, Jakob
    et al.
    Swedish Institute of Computer Science, SICS, Sweden.
    Franke, Ulrik
    Swedish Institute of Computer Science, SICS, Sweden.
    Carlson, Jan
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Sentilles, Séverine
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Cicchetti, Antonio
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Towards the Architecture of a Decision Support Ecosystem for System Component Selection2017Ingår i: 11th Annual IEEE International Systems conference SysCon17, 2017, 371-377 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    When developing complex software-intensive systems, it is nowadays common practice to base the solution partly on existing software components. Selecting which components to use becomes a critical decision in development, but it is currently not well supported through methods and tools. This paper discusses how a decision support system for this problem could benefit from a software ecosystem approach, where participants share knowledge across organizations both through reuse of analysis models, and through partially disclosed past decision cases. It is shown how the architecture of this ecosystem becomes fundamental to deal with efficient knowledge sharing, while respecting constraints on integrity of intellectual property. A concrete proposal for an architecture is outlined, which is a distributed system-of-systems using web technologies. Experiences of a proof-of-concept implementation are also described.

  • 238.
    Axelsson, Jakob
    et al.
    SICS Swedish ICT, Sweden.
    Papatheocharous, Efi
    SICS Swedish ICT, Sweden.
    Nyfjord, Jaana
    SICS Swedish ICT, Sweden.
    Törngren, Martin
    KTH Royal Institute of Technology, Sweden.
    Notes On Agile and Safety-Critical Development2016Ingår i: Software Engineering Notes: an Informal Newsletter of The Specia, ISSN 0163-5948, E-ISSN 1943-5843, Vol. 41, nr 2, 23-26 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Agile approaches have been highly influential to the software engineering practices in many organizations, and are increasingly being applied in larger companies, and for developing systems outside the pure software domain. To understand more about the current state of agile, its applications to safety-critical systems, and the consequences on innovation and large organizations, a seminar was organized in Stockholm in 2014. This paper gives an overview of the topics discussed at that seminar, a summary of the main results and suggestions for future work as input to a research agenda for agile development of safety-critical software.

  • 239.
    Ayala, Inmaculada
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Gallina, Barbara
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Towards Tool-based Security-informed Safety Oriented Process Line Engineering2016Ingår i: 1st International workshop on Interplay of Security, Safety and System/Software Architecture ISSA-2016, 2016, 38Konferensbidrag (Refereegranskat)
    Abstract [en]

    For the purpose of certification, manufactures of nowadays highly connected safety-critical systems are expected to en- gineer their systems according to well-defined engineering processes in compliance with safety and security standards. Certification is an extremely expensive and time-consuming process. Since safety and security standards exhibit a certain degree of commonality, certification-related artifacts (e.g., process models) should to some extent be reusable. To en- able systematic reuse and customization of process infor- mation, in this paper we further develop security-informed safety-oriented process line engineering (i.e., engineering of sets of processes including security and safety concerns). More specifically, first we consider three tool-supported ap- proaches for process-related commonality and variability man- agement and we apply them to limited but meaningful por- tions of safety and security standards within airworthiness. Then, we discuss our findings. Finally, we draw our conclu- sions and sketch future work.

  • 240.
    Ayguadé, Eduard
    et al.
    European Center for Parallelism of Barcelona (CEPBA), Technical University of Catalunya (UPC).
    Brorsson, Mats
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Mikroelektronik och Informationsteknik, IMIT.
    Brunst, H.
    ) Center for High Performance Computing (ZHR), TU Dresden.
    Hoppe, H. -C
    Pallas GmbH.
    Karlsson, S.
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Mikroelektronik och Informationsteknik, IMIT.
    Martorell, X.
    European Center for Parallelism of Barcelona (CEPBA), Technical University of Catalunya (UPC).
    Nagel, W. E.
    ) Center for High Performance Computing (ZHR), TU Dresden.
    Schlimbach, F.
    Pallas GmbH.
    Utrera, G.
    European Center for Parallelism of Barcelona (CEPBA), Technical University of Catalunya (UPC).
    Winkler, M.
    ) Center for High Performance Computing (ZHR), TU Dresden.
    OpenMP Performance Analysis in the INTONE Project2001Konferensbidrag (Refereegranskat)
  • 241.
    Aysan, Hüseyin
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Fault-Tolerance Strategies and Probabilistic Guarantees for Real-Time Systems2012Doktorsavhandling, monografi (Övrigt vetenskapligt)
    Abstract [en]

    Ubiquitous deployment of embedded systems is having a substantial impact on our society, since they interact with our lives in many critical real-time applications. Typically, embedded systems used in safety or mission critical applications (e.g., aerospace, avionics, automotive or nuclear domains) work in harsh environments where they are exposed to frequent transient faults such as power supply jitter, network noise and radiation. They are also susceptible to errors originating from design and production faults. Hence, they have the design objective to maintain the properties of timeliness and functional correctness even under error occurrences.

    Fault-tolerance plays a crucial role towards achieving dependability, and the fundamental requirement for the design of effective and efficient fault-tolerance mechanisms is a realistic and applicable model of potential faults and their manifestations. An important factor to be considered in this context is the random nature of faults and errors, which, if addressed in the timing analysis by assuming a rigid worst-case occurrence scenario, may lead to inaccurate results. It is also important that the power, weight, space and cost constraints of embedded systems are addressed by efficiently using the available resources for fault-tolerance.

    This thesis presents a framework for designing predictably dependable embedded real-time systems by jointly addressing the timeliness and the reliability properties. It proposes a spectrum of fault-tolerance strategies particularly targeting embedded real-time systems. Efficient resource usage is attained by considering the diverse criticality levels of the systems' building blocks. The fault-tolerance strategies are complemented with the proposed probabilistic schedulability analysis techniques, which are based on a comprehensive stochastic fault and error model.

  • 242.
    Aysan, Hüseyin
    et al.
    Mälardalens högskola, Institutionen för datavetenskap och elektronik.
    Dobrin, Radu
    Mälardalens högskola, Institutionen för datavetenskap och elektronik.
    Punnekkat, Sasikumar
    Mälardalens högskola, Institutionen för datavetenskap och elektronik.
    A Generalized Task Allocation Framework for Dependable Real-Time Systems2007Ingår i: Proceedings of the Work-In-Progress (WIP) session of the 19th Euromicro Conference on Real-Time Systems (ECRTS 07), 2007Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we present a general framework which allows the designer to specify a wide range of criteria for allocation. Major factors considered as part of our framework are mixed criticalities of tasks, schedulability, power consumption, fault-tolerance, and dependability requirements in addition to typical functional aspects such as memory constraints. This being a global optimization problem, we are forced to use meta-heuristic algorithms, and we were able to represent these requirements in a very intuitive manner by the usage of energy functions in simulated annealing. We envision the proposed methodology as a quite simple, scalable, as well as computationally effective solution covering a wide range of system architectures and solution spaces. 

  • 243.
    Aysan, Hüseyin
    et al.
    Mälardalens högskola, Institutionen för datavetenskap och elektronik.
    Dobrin, Radu
    Mälardalens högskola, Institutionen för datavetenskap och elektronik.
    Punnekkat, Sasikumar
    Mälardalens högskola, Institutionen för datavetenskap och elektronik.
    FT-Feasibility in Fixed Priority Real-Time Scheduling2007Rapport (Övrigt vetenskapligt)
    Abstract [en]

    Real-time systems typically have to satisfy complex requirements mapped to the timing attributes of the tasks that are eventually guaranteed by the underlying scheduler. These systems consist of a mix of hard and soft tasks with varying criticalities as well as associated fault tolerance (FT) requirements. Often time redundancy techniques are preferred in many embedded applications and hence it is extremely important to devise appropriate methodologies for scheduling real-time tasks under fault assumptions. Additionally, the relative criticality of tasks could undergo changes during the evolution of the system. Hence scheduling decisions under fault assumptions have to reflect all these important factors in addition to the resource constraints.

    In this paper we propose a framework for 'FTfeasibility', i.e., to provide a priori guarantees that all critical tasks in the system will meet their deadlines even in case of faults. Our main objective here is to ensure FTfeasibility of all critical tasks in the system and do so with minimal costs and without any fundamental changes in the scheduling paradigm. We demonstrate its applicability in scenarios where the FT strategy employed is re-execution of the affected tasks or an alternate action upon occurrence of transient faults or software design faults. We analyse a feasible set of tasks and propose methods to adapt it to varying FT requirements without modifications to the underlying scheduler. We do so by reassigning task attributes to achieve FT-feasibility while keeping the costs minimised.

  • 244.
    Aysan, Hüseyin
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Punnekkat, Sasikumar
    Mälardalens högskola, Akademin för innovation, design och teknik.
    A Generalised Error Model and Schedulability Guarantees for Dependable Real-Time Systems2011Ingår i: Proceedings of the 1st International Workshop on Dependable and Secure Industrial and Embedded Systems (WORDS), 2011Konferensbidrag (Refereegranskat)
    Abstract [en]

    The fundamental requirement for the design of effective and efficient fault-tolerance mechanisms in dependable real-time systems is a realistic and applicable model of potential faults, their manifestations and consequences. Fault and error models also need to be evolved based on the changes in the environments of usage or even based on technological advances. In this paper we propose a novel probabilistic burst error model in lieu of the commonly used simplistic fault assumptions. We introduce an approach to reason about real-time systems schedulability under the proposed error model in a probabilistic manner. We first present a sufficient analysis that accounts for the worst case interference caused by error bursts on the response times of tasks scheduled under the fixed priority scheduling (FPS) policy. Further, we identify potential sources of pessimism in the calculations and propose an algorithm that refines the results.

  • 245.
    Ayyalasomayajula, Kalyan Ram
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för visuell information och interaktion. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Brun, Anders
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för visuell information och interaktion. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Document binarization using topological clustering guided Laplacian Energy Segmentation2014Ingår i: Proceedings International Conference on Frontiers in Handwriting Recognition (ICFHR), 2014, 2014, 523-528 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    The current approach for text binarization proposesa clustering algorithm as a preprocessing stage toan energy-based segmentation method. It uses a clusteringalgorithm to obtain a coarse estimate of the background (BG)and foreground (FG) pixels. These estimates are used as a priorfor the source and sink points of a graph cut implementation,which is used to efficiently find the minimum energy solution ofan objective function to separate the BG and FG. The binaryimage thus obtained is used to refine the edge map that guidesthe graph cut algorithm. A final binary image is obtained byonce again performing the graph cut guided by the refinededges on a Laplacian of the image.

  • 246.
    Azizpour, Hossein
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP.
    Visual Representations and Models: From Latent SVM to Deep Learning2016Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    Two important components of a visual recognition system are representation and model. Both involves the selection and learning of the features that are indicative for recognition and discarding those features that are uninformative. This thesis, in its general form, proposes different techniques within the frameworks of two learning systems for representation and modeling. Namely, latent support vector machines (latent SVMs) and deep learning.

    First, we propose various approaches to group the positive samples into clusters of visually similar instances. Given a fixed representation, the sampled space of the positive distribution is usually structured. The proposed clustering techniques include a novel similarity measure based on exemplar learning, an approach for using additional annotation, and augmenting latent SVM to automatically find clusters whose members can be reliably distinguished from background class. 

    In another effort, a strongly supervised DPM is suggested to study how these models can benefit from privileged information. The extra information comes in the form of semantic parts annotation (i.e. their presence and location). And they are used to constrain DPMs latent variables during or prior to the optimization of the latent SVM. Its effectiveness is demonstrated on the task of animal detection.

    Finally, we generalize the formulation of discriminative latent variable models, including DPMs, to incorporate new set of latent variables representing the structure or properties of negative samples. Thus, we term them as negative latent variables. We show this generalization affects state-of-the-art techniques and helps the visual recognition by explicitly searching for counter evidences of an object presence.

    Following the resurgence of deep networks, in the last works of this thesis we have focused on deep learning in order to produce a generic representation for visual recognition. A Convolutional Network (ConvNet) is trained on a largely annotated image classification dataset called ImageNet with $\sim1.3$ million images. Then, the activations at each layer of the trained ConvNet can be treated as the representation of an input image. We show that such a representation is surprisingly effective for various recognition tasks, making it clearly superior to all the handcrafted features previously used in visual recognition (such as HOG in our first works on DPM). We further investigate the ways that one can improve this representation for a task in mind. We propose various factors involving before or after the training of the representation which can improve the efficacy of the ConvNet representation. These factors are analyzed on 16 datasets from various subfields of visual recognition.

  • 247.
    Azizpour, Hossein
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP.
    Arefiyan, Mostafa
    Naderi Parizi, Sobhan
    Carlsson, Stefan
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP.
    Spotlight the Negatives: A Generalized Discriminative Latent Model2015Konferensbidrag (Refereegranskat)
    Abstract [en]

    Discriminative latent variable models (LVM) are frequently applied to various visualrecognition tasks. In these systems the latent (hidden) variables provide a formalism formodeling structured variation of visual features. Conventionally, latent variables are de-fined on the variation of the foreground (positive) class. In this work we augment LVMsto includenegativelatent variables corresponding to the background class. We formalizethe scoring function of such a generalized LVM (GLVM). Then we discuss a frameworkfor learning a model based on the GLVM scoring function. We theoretically showcasehow some of the current visual recognition methods can benefit from this generalization.Finally, we experiment on a generalized form of Deformable Part Models with negativelatent variables and show significant improvements on two different detection tasks.

  • 248.
    Azizpour, Hossein
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP.
    Carlsson, Stefan
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP.
    Self-tuned Visual Subclass Learning with Shared Samples An Incremental Approach2013Artikel, forskningsöversikt (Övrigt vetenskapligt)
    Abstract [en]

    Computer vision tasks are traditionally defined and eval-uated using semantic categories. However, it is known to thefield that semantic classes do not necessarily correspondto a unique visual class (e.g. inside and outside of a car).Furthermore, many of the feasible learning techniques athand cannot model a visual class which appears consistentto the human eye. These problems have motivated the useof 1) Unsupervised or supervised clustering as a prepro-cessing step to identify the visual subclasses to be used ina mixture-of-experts learning regime. 2) Felzenszwalb etal. part model and other works model mixture assignmentwith latent variables which is optimized during learning 3)Highly non-linear classifiers which are inherently capableof modelling multi-modal input space but are inefficient atthe test time. In this work, we promote an incremental viewover the recognition of semantic classes with varied appear-ances. We propose an optimization technique which incre-mentally finds maximal visual subclasses in a regularizedrisk minimization framework. Our proposed approach uni-fies the clustering and classification steps in a single algo-rithm. The importance of this approach is its compliancewith the classification via the fact that it does not need toknow about the number of clusters, the representation andsimilarity measures used in pre-processing clustering meth-ods a priori. Following this approach we show both quali-tatively and quantitatively significant results. We show thatthe visual subclasses demonstrate a long tail distribution.Finally, we show that state of the art object detection meth-ods (e.g. DPM) are unable to use the tails of this distri-bution comprising 50% of the training samples. In fact weshow that DPM performance slightly increases on averageby the removal of this half of the data.

  • 249.
    Bachelder, Steven
    et al.
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Historisk-filosofiska fakulteten, Institutionen för speldesign.
    Hayashi, Masaki
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Historisk-filosofiska fakulteten, Institutionen för speldesign.
    Nakajima, Masayuki
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Historisk-filosofiska fakulteten, Institutionen för speldesign.
    4K/8K Ultra High-resolution Interactive Display System for Museum Collections: Providing Information and Context2013Konferensbidrag (Övrigt vetenskapligt)
  • 250.
    Bachelder, Steven
    et al.
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Historisk-filosofiska fakulteten, Institutionen för speldesign.
    Ohta, Takashi
    Tokyo University of Technology.
    Nakajima, Masayuki
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Historisk-filosofiska fakulteten, Institutionen för speldesign.
    Hayashi, Masaki
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Historisk-filosofiska fakulteten, Institutionen för speldesign.
    Kondo, Kunio
    Tokyo University of Technology.
    Andreasson, Joakim
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Historisk-filosofiska fakulteten, Institutionen för speldesign.
    Böstrom, Pelle
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Historisk-filosofiska fakulteten, Institutionen för speldesign.
    Khatib, Youssef
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Historisk-filosofiska fakulteten, Institutionen för speldesign.
    Lau, Kakee
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Historisk-filosofiska fakulteten, Institutionen för speldesign.
    Lewis, Jonas
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Historisk-filosofiska fakulteten, Institutionen för speldesign.
    Research Work-Package Methodology exemplified by the Multiple Screens Project: Pinch Game using Unity for Android2013Konferensbidrag (Övrigt vetenskapligt)
2345678 201 - 250 av 2741
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf