Change search
Refine search result
3456789 251 - 300 of 3257
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 251.
    Asplund, Katarina
    et al.
    Karlstad University, Division for Information Technology.
    Brunstrom, Anna
    The trade-off Between Latency and Image Quality: A User PerspectiveManuscript (preprint) (Other (popular science, discussion, etc.))
  • 252.
    Asplund, Katarina
    et al.
    Karlstad University, Division for Information Technology.
    Garcia, Johan
    Brunstrom, Anna
    Schneyer, Sean
    Decreasing Transfer Delay Through Partial ReliabilityManuscript (preprint) (Other (popular science, discussion, etc.))
  • 253.
    Asplund, Lars
    et al.
    Mälardalen University, School of Innovation, Design and Engineering.
    Lundqvist, Kristina
    Mälardalen University, School of Innovation, Design and Engineering.
    Safety Critical Systems Based on Formal Models2000In: ACM SIGAda Letters, ISSN 1094-3641, Vol. XX, no 4, p. 32-39Article in journal (Refereed)
    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.

  • 254.
    Asplund, Lars
    et al.
    Uppsala University, Sweden.
    Lundqvist, Kristina
    Massachusetts Institute of Technology, USA.
    Safety Critical Systems Based on Formal Models2000In: ACM SIGAda Ada Letters - special issue on presentations from SIGAda 2000, Vol. XX, Iss. 4, 2000Conference paper (Other academic)
  • 255.
    Asplund, Lars
    et al.
    Mälardalen University, School of Innovation, Design and Engineering.
    Lundqvist, Kristina
    MIT, Cambridge, MA, United States .
    The Gurkh Project: A Framework for Verification and Execution of Mission Critical Applications2003In: AIAA/IEEE Digital Avionics Systems Conference - Proceedings, vol. 2, 2003, p. 10.B.1/1-10.B.1/9Conference paper (Other academic)
    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.

  • 256.
    Asplund, Mikael
    et al.
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
    Nadjm-Tehrani, Simin
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
    Attitudes and Perceptions of IoT Security in Critical Societal Services2016In: IEEE Access, E-ISSN 2169-3536, Vol. 4, p. 2130-2138Article in journal (Refereed)
    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.

  • 257.
    Assabie, Yaregal
    et al.
    Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Bigun, Josef
    Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Ethiopic Document Image Database for Testing Character Recognition Systems2006Report (Other academic)
    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/.

  • 258.
    Aster, Maximilian
    Linnaeus University, Faculty of Technology, Department of Computer Science.
    Repackaging Web Pages2013Independent thesis Advanced level (degree of Master (One Year)), 10 credits / 15 HE creditsStudent thesis
    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.

  • 259.
    Atif, Sohaib
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Information and Communication systems. Mid sweden University.
    Cooperative diversity and downlink power control using PARPS with application to LTE services (eMBMS and CoMP)2014Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    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.

  • 260.
    Atig, Mohamed Faouzi
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Bollig, Benedikt
    CNRS, LSV, Paris, France.;ENS Paris Saclay, Paris, France.
    Habermehl, Peter
    CNRS, IRIF, Paris, France.;Univ Paris Diderot, Paris, France..
    Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete2017In: International Journal of Foundations of Computer Science, ISSN 0129-0541, Vol. 28, no 8, p. 945-975Article in journal (Refereed)
    Abstract [en]

    We consider ordered multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-empty stack (which implies that we assume a linear ordering on the collection of stacks). We show that the emptiness problem for multi-pushdown automata is 2ETIME-complete. Containment in 2ETIME is shown by translating an automaton into a grammar for which we can check if the generated language is empty. The lower bound is established by simulating the behavior of an alternating Turing machine working in exponential space. We also compare ordered multi-pushdown automata with the model of bounded-phase (visibly) multi-stack pushdown automata, which do not impose an ordering on stacks, but restrict the number of alternations of pop operations on different stacks.

  • 261.
    Atig, Mohamed Faouzi
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    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 Systems2014In: {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2014, December 15-17, 2014, New Delhi, India, 2014Conference paper (Refereed)
  • 262.
    Atig, Mohamed Faouzi
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Bouajjani, Ahmed
    LIAFA, CNRS and University of Paris Diderot.
    Kumar, K. Narayan
    Chennai Mathematical Institute, Chennai, India.
    Saivasan, Prakash
    TU Braunschweig, Germany.
    Parity Games on Bounded Phase Multi-pushdown Systems2017In: Networked Systems: 5th International Conference, NETYS 2017, Marrakech, Morocco, May 17-19, 2017, Proceedings / [ed] Amr El Abbadi and Benoit Garbinato, Cham, 2017, Vol. 10299, p. 272-287Conference paper (Refereed)
    Abstract [en]

    In this paper we address the problem of solving parity games over the configuration graphs of bounded phase multi-pushdown systems. A non-elementary decision procedure was proposed for this problem by A. Seth. In this paper, we provide a simple and inductive construction to solve this problem. We also prove a non-elementary lower-bound, answering a question posed by A. Seth.

  • 263.
    Atig, Mohamed Faouzi
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Bouajjani, Ahmed
    LIAFA, CNRS and University of Paris Diderot.
    Kumar, K. Narayan
    Chennai Mathematical Institute, Chennai, India.
    Saivasan, Prakash
    TU Braunschweig, Germany.
    Verification of Asynchronous Programs with Nested Locks2017In: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, December 11-15, 2017, Kanpur, India / [ed] Satya Lokam and R. Ramanujam, Dagstuhl, Germany, 2017, Vol. 93, p. 11:1-11:14Conference paper (Refereed)
    Abstract [en]

    In this paper, we consider asynchronous programs consisting of multiple recursive threads running in parallel. Each of the threads is equipped with a multi-set. The threads can create tasks and post them onto the multi-sets or read a task from their own. In addition, they can synchronise through a finite set of locks. In this paper, we show that the reachability problem for such class of asynchronous programs is undecidable even under the nested locking policy. We then show that the reachability problem becomes decidable (Exp-space-complete) when the locks are not allowed to be held across tasks. Finally, we show that the problem is NP-complete when in addition to previous restrictions, threads always read tasks from the same state.

  • 264.
    Atig, Mohamed Faouzi
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Bouajjani, Ahmed
    LIAFA, CNRS and University of Paris Diderot.
    Parlato, Gennaro
    University of Southampton.
    Context-Bounded Analysis of TSO Systems2014In: From Programs to Systems: The Systems perspective in Computing / [ed] Bensalem, S; Lakhneck, Y; Legay, A, Springer, 2014, p. 21-38Conference paper (Other academic)
    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.

  • 265.
    Atig, Mohamed Faouzi
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Kumar, K. Narayan
    Saivasan, Prakash
    Acceleration in Multi-PushDown Systems2016In: Tools and Algorithms for the Construction and Analysis of Systems, Springer, 2016, p. 698-714Conference paper (Refereed)
  • 266.
    Attarzadeh-Niaki, Seyed Hosein
    et al.
    KTH, School of Information and Communication Technology (ICT), Electronics and Embedded Systems.
    Sander, Ingo
    KTH, School of Information and Communication Technology (ICT), Electronics and Embedded Systems.
    Integrating Functional Mock-up units into a formal heterogeneous system modeling framework2015In: 18th CSI International Symposium on Computer Architecture and Digital Systems, CADS 2015, Institute of Electrical and Electronics Engineers (IEEE), 2015Conference paper (Refereed)
    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.

  • 267.
    Atxutegi, Eneko
    et al.
    Spanien.
    Liberal, Fidel
    Spanien.
    Grinnemo, Karl-Johan
    Karlstad University.
    Brunström, Anna
    Karlstad University.
    Arvidsson, Åke
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap. Ericsson AB.
    Robert, Rèmi
    Ericsson AB.
    TCP behaviour in LTE: impact of flow start-up and mobility2016In: Wireless and Mobile Networking Conference (WMNC), 2016 9th IFIP, IEEE Communications Society, 2016, p. 73-80Conference paper (Refereed)
    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.

  • 268.
    Augustsson, Jesper
    et al.
    Linnaeus University, Faculty of Technology, Department of Informatics.
    Salomonsson, Peter
    Linnaeus University, Faculty of Technology, Department of Informatics.
    Gamification - Samspelet mellan människor och IT: Undersökning av spelmekanismers motivationshöjande effekter2015Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    This bachelor thesis is a study to investigate the game mechanics in a selected training application. The study aims to create a greater understanding of why people get motivational effects with the help of information technology. This will be done by examining the users of the example Nike + to find out what features they consider giving them a motivating effect and thus describe the game mechanics these include.

     

    The study uses a qualitative approach to carryout interviews with the users of our example Nike+. The interview questions are based in theory of the field Gamification and previous research on the topic.

     

    The result shows that there are several different game mechanics implemented in Nike +, which has a positive impact on users. The result strengthens the game mechanics informants set positively towards making running a fun form of exercise as well as increased training frequency of our informants.

  • 269.
    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 load2012In: ICTON 2012 / [ed] Bozena Jaskorzynska och Richard De La Rue, IEEE Communications Society, 2012Conference paper (Refereed)
    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.

  • 270. Avdagic, Zikrija
    et al.
    Boskovic, Dusanka
    Causevic, Aida
    Mälardalen University, School of Innovation, Design and Engineering.
    Code Evaluation Using Fuzzy Logic2008Conference paper (Refereed)
    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

  • 271.
    Avdic, Kenan
    et al.
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Melot, Nicolas
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Kessler, Christoph
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Keller, Jörg
    FernUniversität in Hagen.
    Pipelined parallel sorting on the Intel SCC2011In: 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, p. 96-101Conference paper (Other academic)
    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. 

  • 272.
    Avgouleas, Ioannis
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    IoT Networking Resource Allocation and Cooperation2017Licentiate thesis, comprehensive summary (Other academic)
    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.

  • 273.
    Avgouleas, Ioannis
    et al.
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Pappas, Nikolaos
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Yuan, Di
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Angelakis, Vangelis
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Probabilistic Cooperation of a Full-Duplex Relay in Random Access Networks2017In: IEEE Access, E-ISSN 2169-3536, Vol. 5, p. 7394-7404Article in journal (Refereed)
    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.

  • 274.
    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 Model2009In: Proceedings of the 2009 ICSE Workshop on Automation of Software Test, AST 2009, 2009, p. 44-52, article id 5069040Conference paper (Refereed)
  • 275.
    Awada, Imad Alex
    et al.
    University Politehnica of Bucharest, Romania.
    Cramariuc, Oana
    IT Cenetr for Science and Technology, Romania.
    Mocanu, Irina
    University Politehnica of Bucharest.
    Seceleanu, Cristina
    Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.
    Kunnappilly, Ashalatha
    Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.
    Florea, Adina Magda
    University Politehnica of Bucharest, Romania.
    An end- user perspective on the CAMI Ambient and Assisted Living Project2018In: INTED2018 Proceedings, 2018Conference paper (Refereed)
    Abstract [en]

    In this paper, we present the outcomes and conclusions obtained by involving seniors from three countries (Denmark, Poland and Romania) in an innovative project funded under the European Ambient Assisted Living (ALL) program. CAMI stands for "Companion with Autonomously Mobile Interface" in "Artificially intelligent ecosystem for self-management and sustainable quality of life in AAL". The CAMI solution enables flexible, scalable and individualised services that support elderly to self-manage their daily life and prolong their involvement in the society (sharing knowledge, continue working, etc). This also allows their informal caregivers (family and friends) to continue working and participating in society while caring for their loved ones. The solution is designed as an innovative architecture that allows for individualized, intelligent self-management which can be tailored to an individual's preferences and needs. A user-centred approach has ranked health monitoring, computer supervised physical exercises and voice based interaction among the top favoured CAMI functionalities. Respondents from three countries (Poland, Romania and Denmark) participated in a multinational survey and a conjoint analysis study.

  • 276.
    Awan, Ahsan Javed
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Performance Characterization and Optimization of In-Memory Data Analytics on a Scale-up Server2017Doctoral thesis, monograph (Other academic)
    Abstract [en]

    The sheer increase in the 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 to 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 (the additional CPU time spent by threads in a multi-threaded computation beyond the CPU time required to perform the same work in a sequential computation). We have also found that workloads are bound by the latency of frequent data accesses to the memory. By enlarging input data size, application performance degrades significantly due to the substantial increase in wait time during I/O operations and garbage collection, despite 10% better instruction retirement rate (due to lower L1cache 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 upto14%. For garbage collection impact, we match memory behavior with the garbage collector to improve the performance of applications between 1.6xto 3x and recommend using multiple small Spark executors that can provide up to 36% reduction in execution time over single large executor. Based on the characteristics of workloads, the thesis envisions near-memory and near storage hardware acceleration to improve the single-node performance of scale-out frameworks like Apache Spark. Using modeling techniques, it estimates the speed-up of 4x for Apache Spark on scale-up servers augmented with near-data accelerators.

  • 277.
    Awan, Ahsan Javed
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS. KTH Royal Institute of Technology.
    Performance Characterization of In-Memory Data Analytics on a Scale-up Server2016Licentiate thesis, comprehensive summary (Other academic)
    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.

  • 278.
    Awan, Ahsan Javed
    et al.
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Brorsson, Mats
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Vlassov, Vladimir
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Ayguade, Eduard
    Barcelona Super Computing Center and Technical University of Catalunya.
    Architectural Impact on Performance of In-memoryData Analytics: Apache Spark Case StudyManuscript (preprint) (Other academic)
    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

  • 279.
    Awan, Ahsan Javed
    et al.
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Brorsson, Mats
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Vlassov, Vladimir
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Ayguade, Eduard
    Technical University of Catalunya, Barcelona Super Computing Center.
    How Data Volume Affects Spark Based Data Analytics on a Scale-up Server2015In: 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, p. 81-92Conference paper (Refereed)
    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.

  • 280.
    Awan, Ahsan Javed
    et al.
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Brorsson, Mats
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Vlassov, Vladimir
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Ayguade, Eduard
    Barcelona Super Computing Center and Technical University of Catalunya.
    Micro-architectural Characterization of Apache Spark on Batch and Stream Processing Workloads2016Conference paper (Refereed)
    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.

  • 281.
    Awan, Ahsan Javed
    et al.
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Brorsson, Mats
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Vlassov, Vladimir
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Ayguade, Eduard
    Barcelona Super Computing Center and Technical University of Catalunya.
    Node architecture implications for in-memory data analytics on scale-in clusters2016Conference paper (Refereed)
    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.

  • 282.
    Axelsson, Andreas
    et al.
    Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE).
    Ambrosius, Christian
    Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE).
    Nya lagar och avtal: Hur kan de komma att förändra svenskarnas fildelningsvanor?2012Independent thesis Basic level (university diploma), 5 credits / 7,5 HE creditsStudent thesis
    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.

  • 283.
    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 Engineering2015In: 10th Annual Systems of Systems Engineering Conference SOSE, 2015, p. 18-23Conference paper (Refereed)
    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.

  • 284.
    Axelsson, Jakob
    Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. RISE Research Institutes of Sweden, Kista, Sweden.
    An initial analysis of operational emergent properties in a platooning system-of-systems2018In: 12th Annual IEEE International Systems Conference, SysCon 2018 - Proceedings, Institute of Electrical and Electronics Engineers Inc. , 2018, p. 1-8Conference paper (Refereed)
    Abstract [en]

    As systems-of-systems start to be more common in commercial applications, an analysis of emergent properties related to utility and cost for all stakeholders becomes critical. This paper describes an approach for this based on network simulation and game theory, which is applied to truck highway platooning. The emergent properties of energy efficiency and transport efficiency are studied as a consequence of the strategies for platoon formation, and it is shown that having information about the route planning of other vehicles has a significant positive effect on the properties. This indicates the need for a mediator in the platooning system-of-systems architecture. Its role is to communicate plans of the constituent systems.

  • 285.
    Axelsson, Jakob
    Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.
    Architectural Allocation Alternatives and Associated Concerns in Cyber-Physical Systems: A Case Study2015In: ECSAW '15 Proceedings of the 2015 European Conference on Software Architecture Workshops, 2015, Vol. Article No.15Conference paper (Refereed)
    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.

  • 286.
    Axelsson, Jakob
    et al.
    Swedish Institute of Computer Science, SICS, Sweden.
    Franke, Ulrik
    Swedish Institute of Computer Science, SICS, Sweden.
    Carlson, Jan
    Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.
    Sentilles, Séverine
    Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.
    Cicchetti, Antonio
    Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.
    Towards the Architecture of a Decision Support Ecosystem for System Component Selection2017In: 11th Annual IEEE International Systems conference SysCon17, 2017, p. 371-377Conference paper (Refereed)
    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.

  • 287.
    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 Development2016In: Software Engineering Notes: an Informal Newsletter of The Specia, ISSN 0163-5948, E-ISSN 1943-5843, Vol. 41, no 2, p. 23-26Article in journal (Refereed)
    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.

  • 288.
    Axetun, Magnus
    Linköping University, Department of Computer and Information Science.
    Securing hospitals from exploitation of hardware ports2017Independent thesis Basic level (university diploma), 10,5 credits / 16 HE creditsStudent thesis
    Abstract [en]

    Electronic devices are widely used in today’s hospitals and the possibilities they offer are increasing every day. The devices are often embedded systems, running outdated operating systems and need to have a high uptime which makes them vulnerable to malicious software (malware). This thesis examines the ways malware can propagate through the Universal Serial Bus (USB) with the help of social engineering. Valuable assets are defined and different threat scenarios to these assets are presented. Lastly, the different scenarios are evaluated based on which assets they impact and how to effective mitigate the threats they present. Short- and long-term mitigations are presented to secure the devices in a broader view.

  • 289.
    Ayala, Inmaculada
    et al.
    Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.
    Gallina, Barbara
    Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.
    Towards Tool-based Security-informed Safety Oriented Process Line Engineering2016In: 1st International workshop on Interplay of Security, Safety and System/Software Architecture ISSA-2016, 2016, article id 38Conference paper (Refereed)
    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.

  • 290.
    Ayguadé, Eduard
    et al.
    European Center for Parallelism of Barcelona (CEPBA), Technical University of Catalunya (UPC).
    Brorsson, Mats
    KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.
    Brunst, H.
    ) Center for High Performance Computing (ZHR), TU Dresden.
    Hoppe, H. -C
    Pallas GmbH.
    Karlsson, S.
    KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, 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 Project2001Conference paper (Refereed)
  • 291.
    Aysan, Hüseyin
    Mälardalen University, School of Innovation, Design and Engineering.
    Fault-Tolerance Strategies and Probabilistic Guarantees for Real-Time Systems2012Doctoral thesis, monograph (Other academic)
    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.

  • 292.
    Aysan, Hüseyin
    et al.
    Mälardalen University, Department of Computer Science and Electronics.
    Dobrin, Radu
    Mälardalen University, Department of Computer Science and Electronics.
    Punnekkat, Sasikumar
    Mälardalen University, Department of Computer Science and Electronics.
    A Generalized Task Allocation Framework for Dependable Real-Time Systems2007In: Proceedings of the Work-In-Progress (WIP) session of the 19th Euromicro Conference on Real-Time Systems (ECRTS 07), 2007Conference paper (Refereed)
    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. 

  • 293.
    Aysan, Hüseyin
    et al.
    Mälardalen University, Department of Computer Science and Electronics.
    Dobrin, Radu
    Mälardalen University, Department of Computer Science and Electronics.
    Punnekkat, Sasikumar
    Mälardalen University, Department of Computer Science and Electronics.
    FT-Feasibility in Fixed Priority Real-Time Scheduling2007Report (Other academic)
    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.

  • 294.
    Aysan, Hüseyin
    et al.
    Mälardalen University, School of Innovation, Design and Engineering.
    Punnekkat, Sasikumar
    Mälardalen University, School of Innovation, Design and Engineering.
    A Generalised Error Model and Schedulability Guarantees for Dependable Real-Time Systems2011In: Proceedings of the 1st International Workshop on Dependable and Secure Industrial and Embedded Systems (WORDS), 2011Conference paper (Refereed)
    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.

  • 295.
    Ayyalasomayajula, Kalyan Ram
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Visual Information and Interaction. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computerized Image Analysis and Human-Computer Interaction.
    Brun, Anders
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Visual Information and Interaction. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computerized Image Analysis and Human-Computer Interaction.
    Document binarization using topological clustering guided Laplacian Energy Segmentation2014In: Proceedings International Conference on Frontiers in Handwriting Recognition (ICFHR), 2014, 2014, p. 523-528Conference paper (Refereed)
    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.

  • 296.
    Azizpour, Hossein
    KTH, School of Computer Science and Communication (CSC), Computer Vision and Active Perception, CVAP.
    Visual Representations and Models: From Latent SVM to Deep Learning2016Doctoral thesis, comprehensive summary (Other academic)
    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.

  • 297.
    Azizpour, Hossein
    et al.
    KTH, School of Computer Science and Communication (CSC), Computer Vision and Active Perception, CVAP.
    Arefiyan, Mostafa
    Naderi Parizi, Sobhan
    Carlsson, Stefan
    KTH, School of Computer Science and Communication (CSC), Computer Vision and Active Perception, CVAP.
    Spotlight the Negatives: A Generalized Discriminative Latent Model2015Conference paper (Refereed)
    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.

  • 298.
    Azizpour, Hossein
    et al.
    KTH, School of Computer Science and Communication (CSC), Computer Vision and Active Perception, CVAP.
    Carlsson, Stefan
    KTH, School of Computer Science and Communication (CSC), Computer Vision and Active Perception, CVAP.
    Self-tuned Visual Subclass Learning with Shared Samples An Incremental Approach2013Article, review/survey (Other academic)
    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.

  • 299.
    Bachelder, Steven
    et al.
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Game Design.
    Hayashi, Masaki
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Game Design.
    Nakajima, Masayuki
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Game Design.
    4K/8K Ultra High-resolution Interactive Display System for Museum Collections: Providing Information and Context2013Conference paper (Other academic)
  • 300.
    Bachelder, Steven
    et al.
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Game Design.
    Ohta, Takashi
    Tokyo University of Technology.
    Nakajima, Masayuki
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Game Design.
    Hayashi, Masaki
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Game Design.
    Kondo, Kunio
    Tokyo University of Technology.
    Andreasson, Joakim
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Game Design.
    Böstrom, Pelle
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Game Design.
    Khatib, Youssef
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Game Design.
    Lau, Kakee
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Game Design.
    Lewis, Jonas
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Game Design.
    Research Work-Package Methodology exemplified by the Multiple Screens Project: Pinch Game using Unity for Android2013Conference paper (Other academic)
3456789 251 - 300 of 3257
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf