liu.seSök publikationer i DiVA
Ändra sökning
Avgränsa sökresultatet
3456789 251 - 300 av 427
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste 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)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste 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.
  • 251.
    Lundkvist, Herman
    et al.
    Linköpings universitet, Institutionen för systemteknik, Datorteknik.
    Yngve, Alexander
    Linköpings universitet, Institutionen för systemteknik, Datorteknik.
    Accelerated Simulation of Modelica Models Using an FPGA-Based Approach2018Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This thesis presents Monza, a system for accelerating the simulation of modelsof physical systems described by ordinary differential equations, using a generalpurpose computer with a PCIe FPGA expansion card. The system allows bothautomatic generation of an FPGA implementation from a model described in theModelica programming language, and simulation of said system.Monza accomplishes this by using a customizable hardware architecture forthe FPGA, consisting of a variable number of simple processing elements. A cus-tom compiler, also developed in this thesis, tailors and programs the architectureto run a specific model of a physical system.Testing was done on two test models, a water tank system and a Weibel-lung,with up to several thousand state variables. The resulting system is several timesfaster for smaller models and somewhat slower for larger models compared to aCPU. The conclusion is that the developed hardware architecture and softwaretoolchain is a feasible way of accelerating model execution, but more work isneeded to ensure faster execution at all times.

  • 252.
    Lövhall, Jakob
    Linköpings universitet, Institutionen för datavetenskap.
    Analysis of a Bitcoin debit card: Design of a novel Bitcoin payment system2017Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This thesis introduces a debit card based payment system that aims to provide fast in-store payments using Bitcoin. The system introduces physical constraints to Bitcoin payments to enable stores to accept payments before they are in a block.The proposed system was tested in a proof of concept model to estimate the time itwould take to pay with the system on the real Bitcoin network. A security analysis was performed to validate system security and to point out potential problems. The security analysis was done by interviewing five experts from different organizations to receive different views on the system.

    The analysis of the system indicated that it could potentially be fast enough to be used in stores, however security problems exist and need to be considered.

  • 253.
    Löw, Joakim
    et al.
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska högskolan.
    Kronander, Joel
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska högskolan.
    Ynnerman, Anders
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska högskolan.
    Unger, Jonas
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska högskolan.
    BRDF Models for Accurate and Efficient Rendering of Glossy Surfaces2012Ingår i: ACM Transactions on Graphics, ISSN 0730-0301, E-ISSN 1557-7368, Vol. 31, nr 1Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This article presents two new parametric models of the Bidirectional Reflectance Distribution Function (BRDF), one inspired by the Rayleigh-Rice theory for light scattering from optically smooth surfaces, and one inspired by micro-facet theory. The models represent scattering from a wide range of glossy surface types with high accuracy. In particular, they enable representation of types of surface scattering which previous parametric models have had trouble modeling accurately. In a study of the scattering behavior of measured reflectance data, we investigate what key properties are needed for a model to accurately represent scattering from glossy surfaces. We investigate different parametrizations and how well they match the behavior of measured BRDFs. We also examine the scattering curves which are represented in parametric models by different distribution functions. Based on the insights gained from the study, the new models are designed to provide accurate fittings to the measured data. Importance sampling schemes are developed for the new models, enabling direct use in existing production pipelines. In the resulting renderings we show that the visual quality achieved by the models matches that of the measured data.

  • 254.
    Madireddy, Avinash
    Linköpings universitet, Institutionen för datavetenskap, Interaktiva och kognitiva system. Linköpings universitet, Tekniska högskolan.
    Usability Testing : The Relation between Tasks and Issues2012Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    The Usability of a website can be evaluated using various methods. One of the methods is usability testing, which is widely used and employed by the usability tester due to its low cost and user friendliness. The results of usability testing can be affected positively or negatively by several factors such as evaluator’s role, number of users, test environment, tasks, usability problem report, usability measures, and other factors. For more than a decade, the number of users plays a key role in usability testing. Previously done study [12], has shown that correlation exists between the number of user tasks and the number of issues found.

    As an extension and follow-up of the recent studies, the current work was carried out on task design, task number, and task coverage. Two types of task designs were proposed namely, guided tasks and unguided tasks. Considering the task as a key factor, the remaining factors were also considered while employing the usability test.

  • 255.
    Madzar, Boris
    et al.
    Queen's University, Kingston, Canada.
    Boudjadar, Jalil
    Aarhus University, Aarhus, Denmark.
    Dingel, Juergen
    Queen's University, Kingston, Canada.
    Fuhrman, Thomas
    General Motors R&D, Warren, USA.
    S, Ramesh
    General Motors R&D, Warren, USA.
    Formal Analysis of Predictable Data Flow in Fault-Tolerant Multicore Systems2017Ingår i: Formal Aspects of Component Software, Springer, 2017, Vol. 10231, s. 153-171Konferensbidrag (Refereegranskat)
    Abstract [en]

    The need to integrate large and complex functions into today’s vehicle electronic control systems requires high performance computing platforms, while at the same time the manufacturers try to reduce cost, power consumption and ensure safety. Traditionally, safety isolation and fault containment of software tasks have been achieved by either physically or temporally segregating them. This approach is reliable but inefficient in terms of processor utilization. Dynamic approaches that achieve better utilization without sacrificing safety isolation and fault containment appear to be of increasing interest. One of these approaches relies on predictable data flow introduced in PharOS and Giotto. In this paper, we extend the work on leveraging predictable data flow by addressing the problem of how the predictability of data flow can be proved formally for mixed criticality systems that run on multicore platforms and are subject to failures. We consider dynamic tasks where the timing attributes vary from one period to another. Our setting also allows for sporadic deadline overruns and accounts for criticality during fault handling. A user interface was created to allow automatic generation of the models as well as visualization of the analysis results, whereas predictability is verified using the Spin model checker

  • 256.
    Magnusson, Ulf
    Linköpings universitet, Institutionen för datavetenskap, RTSLAB - Laboratoriet för realtidssystem. Linköpings universitet, Tekniska högskolan.
    A Linux-based, Web-oriented operating system designed to boot quickly2011Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This thesis describes the design and implementation of a Linux-based, Web-oriented operating system called Awesom-O, designed with a focus on short boot time and small disk footprint. Among other techniques for lowering boot time, a semi-automatic method for generating a Linux kernel of minimal size for a given platform is developed, making use of an interpreter for the Linux kernel’s configuration language, Kconfig. The boot process of the finished system is analyzed to identify limiting factors in lowering its boot time further, and techniques for overcoming these are suggested.

    Excluding the initial BIOS stage of the boot process, the boot time of the finished system—up until it is idling inside the web browser interface waiting for user input—is 3.8 seconds (2.1 seconds to a shell prompt, 1.7 seconds in the kernel) on an Acer Travelmate 8200 laptop with an Intel Core Duo CPU at 2.0 GHz and a Momentus 5400.2 SATA (ST9120821AS) hard drive; 2.4 seconds (1.6 seconds to a shell prompt, 1.1 seconds in the kernel) on a Celsius M460 workstation with an Intel Core 2 Quad CPU at 2.5 GHz and a Barracuda 7200.11 SATA hard drive (ST3500320AS); 4.6 and 4.0 seconds respectively for the same systems when booting from a USB 2.0 device (a ChipsBank CBM2080 USB 2.0 stick); and 12.6 seconds on the BeagleBoard (8 seconds in the bootloader—an obvious area for future improvement).

    The Web functionality in Awesom-O is implemented atop the Opera Linux Devices SDK: a software framework for integrating web browser functionality in small Linux-based systems.

  • 257.
    Malmström, Mikael
    Linköpings universitet, Institutionen för datavetenskap.
    Design and Implementation of NFC-based gym mobile app2015Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This report investigates the technical and economic viability of introducing a Near Field Communication (NFC) client system in a gym environment. The system aims to aid the customers with logging their workout, retrieving information regarding exercises as well as enhancing the attendance control for both staff and customers. To identify what information to be presented, the most important quality factors and what functionalities are most desired, an exploratory case study was conducted. The study showed that there is a discrepancy between the desire to log ones workout and actually doing it. Most people want to keep track of how they workout, but despite the wide variety of workout applications on the market, they choose not to use them. The main concern expressed was that the logging needs to be fast and easy, indicating that the existing apps do not fulfill the ease of use desired. The system presented in this report is coupled to the gym where NFC tags pair an exercise to its corresponding logger and information in the application. The ability for the gym to track its customers’ workout habits is a rare feature that provides several economic benefits such as targeted advertisement, better maintenance control and new customer services analyzing their workout. For the system to be effective the customers need to use the system and log their workout, therefore it needs to be supported by the major mobile platforms. To accommodate this a hybrid platform approach using PhoneGap was used. This approach allows for development in one language that translates into native embedded web applications. At the time of writing Apple’s latest models do include the hardware for NFC communication. However, it is not possible to develop a custom NFC application for iPhone yet. By adopting the hybrid approach there is no need to create a whole new app when they do release the rights to do so. In conclusion, the technical viability of the NFC based system comes with the tradeoffs of dealing with the lack of standards of a new technology and being early on the market with a new feature. This calls for some custom solutions, since each platform adopts their own way of NFC implementation, but is manageable. The economic aspects are tied to the use of the system where the ease of use is the key factor for the customers. The end user tests indicate that NFC provides that small advantage over traditional workout applications needed to make logging attractive.

  • 258.
    Maluszynski, Jan
    et al.
    Linköpings universitet, Institutionen för datavetenskap, TCSLAB - Laboratoriet för teoretisk datalogi. Linköpings universitet, Tekniska högskolan.
    Szalas, Andrzej
    Linköpings universitet, Institutionen för datavetenskap, KPLAB - Laboratoriet för kunskapsbearbetning. Linköpings universitet, Tekniska högskolan. University of Warsaw, Poland .
    Partiality and Inconsistency in Agents' Belief Bases2013Ingår i: Advanced Methods and Technologies for Agent and Multi-Agent Systems: Proceedings of the 7th KES Conference on Agent and Multi-Agent Systems - Technologies and Applications (KES-AMSTA 2013) / [ed] Dariusz Barbucha, Manh Thanh Le, Robert J. Howlett, Lakhmi C. Jain, IOS Press, 2013, s. 3-17Konferensbidrag (Refereegranskat)
    Abstract [en]

    Agents' beliefs can be incomplete and partially inconsistent. The process of agents' belief formation in such contexts has to be supported by suitable tools allowing one to express a variety of inconsistency resolving and nonmonotonic reasoning techniques.

    In this paper we discuss 4QL*, a general purpose rule-based query language allowing one to use rules with negation in the premises and in the conclusions of rules. It is based on a simple and intuitive semantics and provides uniform tools for lightweight versions of well-known forms of nonmonotonic reasoning. In addition, it is tractable w.r.t. data complexity and captures PTIME queries, so can be used in real-world applications.

    Reasoning in 4QL* is based on well-supported models. We simplify and at the same time generalize previous definitions of well-supported models and develop a new algorithm for computing such models.

  • 259.
    Mangaraj, Swadhin K
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Extension of the SkePU Skeleton ProgrammingFramework for Multi-core CPU and Multi-GPU Systems for MPI-based Clusters2013Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    SkePU (Skeleton Programming Framework for Multi-core CPU and Multi-GPU Systems) is a parallel computing framework developed by Johan Enmyren and Christoph Kessler at Linköpings Universitet. This C++ template library provides a simple and unified interface for specifying data-parallel computations with the help of skeletons and is targeted to multiple backends e.g. for a sequential CPU, parallel CPUs using MPI and OpenMP or GPUs using CUDA and OpenCL. SkePU is comprised of seven data-parallel skeletons and one task-parallel skeleton and these skeletons use two types of containers: vector and matrix to model real-life parallel applications. In this thesis, we address the extension of the SkePU framework by extending the matrix container (which stores 2-D data values) that can efficiently use the existing skeletons to develop parallel scientific applications on large-scale clusters using MPI. This piece of work focuses on the distribution of the matrix among the participating processes which after receiving their share of data can execute the application in parallel. This work covers all of the seven data-parallel skeletons. Each skeleton has been tested with a small application program. In addition to measurement of performance improvement from the application program’s execution time, we have also done a communication cost analysis for all skeletons with MPI using the LogGP model. In order to evaluate and test the operational efficiency of the extension, we have considered a PDE solver application. Through this application, we have demonstrated the performance gain and scalability of the extended framework. The performance improvement was more when computational load dominates the memory I/O operations. The results show that using the extension can serve as a viable approach while implementing real-life parallel applications on large-scale clusters.

  • 260.
    Marián Santos, Javier
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Monkey Gamer: Automatic Profiling of Android Games2013Självständigt arbete på avancerad nivå (magisterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Due to the huge amount of smart-phone applications available nowadays,there is a need to check them in order to know if they are trustworthy, efficientand reliable. Furthermore, research on smart-phones is really intensive,so it is important to be able to easily profile applications and collect datathat researchers can use. In this thesis we have focused on Android gamesas they represent a big portion of Android applications and Android is themost used mobile operative system nowadays.

    The thesis work can be divided in two main tasks. The first task consistsof research on Android games in order to know how they are developed,which game design engines are used nowadays and how can we automatisethe execution of Android applications and, in particular, games. The secondstep consists of development of a program called Monkey Gamer that canplay Android games automatically and collect execution traces of the game. The Monkey Gamer analyses the screen shown on a device, recognises theplaces where the user should touch, and interacts with them. Then, consideringeach screen as a state of a state machine, the program tries to coverthe whole game, generating the highest possible number of execution traces.

    In order to test our solution we have compared the traces generated bythe Monkey Gamer with the ones obtained by some real players, achievinga significant similarity. The tests were executed on three games, coveringdifferent categories and implementation solutions.

  • 261.
    Martinsson, Emil
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Extending CompactRIO connectivity through Anybus CompactCom2014Självständigt arbete på grundnivå (högskoleexamen), 10,5 poäng / 16 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This thesis report describes an exploratory work for a network communication modules to be used together with the CompactRIO system, a system used to control or monitor industrial machinery. This thesis was carried out by integrating the existing ABCC module series, which is a communication solution that can be used to control or observe industrial machinery, into a CompactRIO module. The report describes how the implementation has been carried out and describes the parts that were implemented and give the company, WireFlow AB, a good basis for future development.

    The result shows that it is possible to integrate the ABCC modules in cRIO both in terms of hardware and software integrating. The thesis delivered a working cRIO prototype to the company together with adriver developed in LabVIEW.

  • 262.
    Martucci, Leonardo A.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Contributions of LiU/ADIT to Informational Privacy2012Ingår i: Advances in secure and networked information systems: the ADIT perspective ; Festschrift in honor of professor Nahid Shahmehri / [ed] Patrick Lambrix, Linköping: Linköping University Electronic Press, 2012, s. 145-155Kapitel i bok, del av antologi (Övrigt vetenskapligt)
    Abstract [en]

    In this article we provide an overview of the contributions of LiU/ADIT to the field of informational privacy. We refer to some recent publications of our group in the area related to Cloud Computing and the Smart Grid. Furthermore, we revisit our results in the field of privacy in participatory sensing, which is a new paradigm that is grounded on the ubiquitous presence of sensors in personal devices, such as smart phones.

  • 263.
    Meher, Pramod Kumar
    et al.
    Independent Hardware Consultant.
    Chang, Chip-Hong
    Nanyang Technological University, Singapore, Singapore.
    Gustafsson, Oscar
    Linköpings universitet, Institutionen för systemteknik, Datorteknik. Linköpings universitet, Tekniska fakulteten.
    Vinod, A.P.
    Nanyang Technological University, Singapore, Singapore.
    Faust, Mattias
    mfnet gmbh, Switzerland.
    Shift‐Add Circuits for Constant Multiplications2017Ingår i: Arithmetic Circuits for DSP Applications / [ed] Pramod Kumar Meher, Thanos Stouraitis, John Wiley & Sons, 2017, s. 33-76Kapitel i bok, del av antologi (Övrigt vetenskapligt)
    Abstract [en]

    The optimization of shift‐and‐add network for constant multiplications is found to have great potential for reducing the area, delay, and power consumption of implementation of multiplications in several computation‐intensive applications not only in dedicated hardware but also in programmable computing systems. To simplify the shift‐and‐add network in single constant multiplication (SCM) circuits, this chapter discusses three design approaches, including direct simplification from a given number representation, simplification by redundant signed digit (SD) representation, and simplification by adder graph. Examples of the multiple constant multiplication (MCM) methods are constant matrix multiplication, discrete cosine transform (DCT) or fast Fourier transform (FFT), and polyphase finite impulse response (FIR) filters and filter banks. The given constant multiplication methods can be used for matrix multiplications and inner‐product; and can be applied easily to image/video processing and graphics applications. The chapter further discusses some of the shortcomings in the current research on constant multiplications, and possible scopes of improvement.

  • 264.
    Mehrpouyan, Hoda
    Linköpings universitet, Institutionen för datavetenskap.
    Model-Based Hazard Analysis of Undesirable Environmental and Components Interaction2011Självständigt arbete på avancerad nivå (masterexamen), 30 poäng / 45 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Identifying the detrimental effect of environmental factors and subsystem interactions are one of themost challenging aspects of early hazard assessment in the design of complex safety critical systems.Therefore, a complete understanding of potential failure effects before the catastrophe happens is a verydifficult task. The thesis proposes a model-based hazard analysis procedure for early identification ofpotential safety issues caused by unexpected environmental factors and subsystem interactions within acomplex safety critical system. The proposed methodology maps hazard and vulnerability modes tospecific components in the system and analyzes the hazard propagation paths for risk control andprotection strategies. The main advantage of the proposed method is the ability to provide the designerswith means to use low-fidelity, high level models to identify hazardous interactions. Using thistechnique, designers can examine the collective impacts of environmental and subsystem risks onoverall system during early stages of design and develop a hazard mitigation strategy.

  • 265.
    Meier, Michael
    et al.
    University of Freiburg, Germany.
    Schmidt, Michael
    University of Freiburg, Germany.
    Wei, Fang
    University of Freiburg, Germany.
    Lausen, Georg
    University of Freiburg, Germany.
    Semantic query optimization in the presence of types2013Ingår i: Journal of computer and system sciences (Print), ISSN 0022-0000, E-ISSN 1090-2724, Vol. 79, nr 6, s. 937-957Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Both semantic and type-based query optimization rely on the idea that queries may exhibit non-trivial rewritings if the state space of the database is restricted. While these two problems have always been studied as separate problems in previous work, in this paper we present a unifying, logic-based query optimization framework that builds upon the classical chase algorithm and brings both problems together. As a major challenge, our novel setting requires chasing conjunctive queries with union and negation in the presence of dependencies containing negation and disjunction. Tackling this problem, we study the applicability of the chase in this setting, develop novel conditions that guarantee its termination, identify fragments for which minimal query computation (w.r.t. a generic cost function) is always possible, and investigate the complexity of related decision problems.

  • 266.
    Mellqvist, Tobias
    et al.
    Linköpings universitet, Institutionen för systemteknik, Datorteknik.
    Kanders, Hans
    Linköpings universitet, Institutionen för systemteknik, Datorteknik.
    One Million-Point FFT2018Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    The goal of this thesis has been to implement a hardware architecture for FPGA that calculates the fast Fourier transform (FFT) of a signal using one million samples. The FFT has been designed using a single-delay feedback architecture withrotators and butterflies, including a three-stage rotator with one million rotation angles. The design has been implemented onto a single FPGA and has a throughput of 233 Msamples/s. The calculated FFT has high accuracy with a signal to quantization noise ratio (SQNR) of 95.6 dB.

  • 267.
    Melot, Nicolas
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Energy-Efficient Computing over Streams with Massively Parallel Architectures2015Licentiatavhandling, monografi (Övrigt vetenskapligt)
    Abstract [en]

    The rise of many-core processor architectures in the high-performance computing market answers to a constantly growing need of processing power to solve more and more challenging problems such as the ones in computing for big data. Fast computation is more and more limited by the very high power required and the management of the considerable heat produced. Many programming models compete to take prot of many-core architectures to improve both execution speed and energy consumption, each with their advantages and drawbacks. The work described in this thesis is based on the dataflow computing approach and investigates the benets of a carefully designed pipelined execution of streaming applications, focusing on particular on off- and on-chip memory accesses. We implement classic and on-chip pipelined versions of mergesort for the SCC. We see how the benets of the on-chip pipelining technique are bounded by the underlying architecture, and we explore the problem of ne tuning streaming applications for manycore architectures to optimize for energy given a throughput budget. We propose a novel methodology to compute schedules optimized for energy eciency for a fixed throughput target. We introduce Schedeval, a tool to test schedules of communicating streaming tasks under throughput constraints for the SCC. We show  that streaming applications based on Schedeval compete with specialized implementations and we use Schedeval to demonstrate performance dierences between schedules that are otherwise considered as equivalent by a simple model.

  • 268.
    Melot, Nicolas
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Avdic, Kenan
    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
    FernUniversitat in Hagen, Fac. of Math. and Computer Science, Hagen, Germany.
    Memory-intensive parallel computing on the Single Chip Cloud Computer: A case study with Mergesort2011Konferensbidrag (Refereegranskat)
    Abstract [en]

    The Single Chip Cloud computer (SCC) is an experimental processor from Intel Labs with 48 cores connected with a 2D mesh on-chip network. We evaluate the performance of SCC regarding off-chip memory accesses and communication capabilities. As benchmark, we use the merging phase of mergesort, a representative of a memory access intensive algorithm. Mergesort is parallelized and adapted in 4 variants, each leveraging different features of the SCC, in order to assess and compare their performance impact. Our results motivate to consider on-chip pipelined mergesort on SCC, which is an issue of ongoing work.

  • 269.
    Melot, Nicolas
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Avdic, Kenan
    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
    Fern Universität in Hagen, Fac. of Math. and Computer Science, Hagen, Germany.
    Parallel sorting on Intel Single-Chip Cloud computer2011Ingår i: 3rd Many-core Applications ResearchCommunity (MARC) Symposium / [ed] Diana Göhringer, Michael Hübner and Jürgen Becker, Karlsruhe: KIT Scientific Publishing , 2011, , s. 11s. 107-110Konferensbidrag (Refereegranskat)
    Abstract [en]

    The Single-Chip Cloud Computer (SCC) is an experimental processor created by Intel Labs. It comprises 48 x86 cores linked by an on-chip high performance network, as well as four DDR3 memory controllers to access an off-chip main memory of up to 64GiB. This work evaluates the performance of the SCC when accessing the off-chip memory. The focus of this study is not on taxing the bare hardware. Instead, we are interested in the performance of applications that run on the Linux operating system and use the SCC as it is provided. We see that the per-core read memory bandwidth is largely independent of the number of cores accessing the memory simultaneously, but that the write memory access performance drops when more cores write simultaneously to the memory. In addition, the global and per-core memory bandwidth, both writing and reading, depends strongly on the memory access pattern.

  • 270.
    Melot, Nicolas
    et al.
    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, Joerg
    FernUniversität in Hagen, Germany (Parallelität und VLSI).
    Eitschberger, Patrick
    FernUniversität in Hagen, Germany (Parallelität und VLSI).
    Fast Crown Scheduling Heuristics for Energy-Efficient Mapping and Scaling of Moldable Streaming Tasks on Many-Core Systems2015Ingår i: ACM Transactions on Architecture and Code Optimization (TACO), ISSN 1544-3566, Vol. 11, nr 4, s. 62-Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Exploiting effectively massively parallel architectures is a major challenge that stream programming can help facilitate. We investigate the problem of generating energy-optimal code for a collection of streaming tasks that include parallelizable or moldable tasks on a generic manycore processor with dynamic discrete frequency scaling. Streaming task collections differ from classical task sets in that all tasks are running concurrently, so that cores typically run several tasks that are scheduled round-robin at user level in a data-driven way. A stream of data flows through the tasks and intermediate results may be forwarded to other tasks, as in a pipelined task graph. In this article, we consider crown scheduling, a novel technique for the combined optimization of resource allocation, mapping, and discrete voltage/frequency scaling for moldable streaming task collections in order to optimize energy efficiency given a throughput constraint. We first present optimal offline algorithms for separate and integrated crown scheduling based on integer linear programming (ILP). We make no restricting assumption about speedup behavior. We introduce the fast heuristic Longest Task, Lowest Group (LTLG) as a generalization of the Longest Processing Time (LPT) algorithm to achieve a load-balanced mapping of parallel tasks, and the Height heuristic for crown frequency scaling. We use them in feedback loop heuristics based on binary search and simulated annealing to optimize crown allocation.

    Our experimental evaluation of the ILP models for a generic manycore architecture shows that at least for small and medium-sized streaming task collections even the integrated variant of crown scheduling can be solved to optimality by a state-of-the-art ILP solver within a few seconds. Our heuristics produce makespan and energy consumption close to optimality within the limits of the phase-separated crown scheduling technique and the crown structure. Their optimization time is longer than the one of other algorithms we test, but our heuristics consistently produce better solutions.

  • 271.
    Melot, Nicolas
    et al.
    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
    Fern Universitat in Hagen, Fac. of Math. and Computer Science, Hagen, Germany.
    Efficient On-Chip Pipelined Streaming Computations on Scalable Manycore Architectures2012Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    Performance of manycore processors is limited by programs' use of off-chip main memory. Streaming computation organized in a pipeline limits accesses to main memory to tasks at boundaries of the pipeline to read or write to main memory. The Single Chip Cloud computer (SCC) offers 48 cores linked by a high-speed on-chip network, and allows the implementation of such on-chip pipelined technique. We assess the performance and constraints provided by the SCC and investigate on on-chip pipelined mergesort as a case study for streaming computations. We found that our on-chip pipelined mergesort yields significant speedup over classic parallel mergesort on SCC. The technique should bring improvement in power consumption and should be portable to other manycore, network-on-chip architectures such as Tilera's processors.

  • 272.
    Mengist, Alachew
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Asghar, Adeel
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Pop, Adrian
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Fritzson, Peter
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Braun, Willi.
    Dept Mathematics and Engineering, University of Applied Sciences, Germany.
    Siemers, Alexander
    SKF, Göteborg, Sweden.
    Fritzson, Dag
    SKF, Göteborg, Sweden.
    An Open-Source Graphical Composite Modeling Editor and Simulation Tool Based on FMI and TLM Co-Simulation2015Ingår i: Proceedings of the 11th International Modelica Conference: Versailles, France, September 21-23, 2015 / [ed] Peter Fritzson, Hilding Elmqvist, Linköping: Linköping University Electronic Press, 2015, s. 181-188Konferensbidrag (Refereegranskat)
    Abstract [en]

    A common situation in industry is that a system model (here a composite model) is composed of several sub-models which may have been developed using different tools. FMI is one important technology for exporting/importing models between tools and/or connecting them via co-simulation. TLM based modeling and co-simulation is another important technique for modeling, connecting, and simulation of especially mechanical systems, which is simple, numerically stable, and efficient. A number of tool-specific simulation models, such as Modelica models, SimuLink models, Adams models, BEAST models, etc., have successfully been connected and simulated using TLM based co-simulation. However, previously there was no general open source tool for creation, graphic editing, and simulation of composite models connected via FMI or TLM based co-simulation. In this paper we present a graphical composite model editor based on OpenModelica which is integrated with the OpenModelica and the SKF TLM co-simulation frameworks to support both FMI and TLM based composite model editing and simulation. The editor supports creating, viewing and editing a composite model both in textual and graphical representation. The system supports simulation of composite models consisting of sub-models created using different tools.

  • 273.
    Mettler, Tobias
    et al.
    University of Lausanne, Switzerland.
    Vimarlund, Vivian
    Linköpings universitet, Institutionen för datavetenskap, Interaktiva och kognitiva system. Linköpings universitet, Tekniska fakulteten.
    All that Glitters is not Gold: Six Steps Before Selecting and Prioritizing e-Health Services2017Ingår i: Journal of medical systems, ISSN 0148-5598, E-ISSN 1573-689X, Vol. 41, nr 10, artikel-id 154Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Since the market for e-health applications is constantly growing, it is getting an ever more complex endeavor to select and prioritize the right service offering given a particular situation. In examining the extant literature, it was revealed that little emphasis is actually placed on how to analyze contextual or environmental factors prior to the selection and prioritization of e-health services. With this paper, we therefore propose a formative framework consisting of six fundamental yet very pragmatic steps that may support decision makers in identifying the most important contextual pre-requisites that e-health services need to fulfill in order to be considered as effective for their environment to be implemented.

  • 274.
    Mo Eriksson, Anton
    et al.
    Linköpings universitet, Institutionen för datavetenskap.
    Dunström, Hampus
    Linköpings universitet, Institutionen för datavetenskap.
    Measuring Architectural Degeneration: In Systems Written in the Interpreted Dynamically Typed Multi-Paradigm Language Python2019Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Architectural degeneration is an ever-present threat to software systems with no exception based on the domain or tools used. This thesis focus on the architectural degeneration in systems written in multi-paradigm run-time evaluated languages like Python. The focus on Python in this kind of investigation is to our knowledge the first of its kind; thus the thesis investigates if the methods for measuring architectural degeneration also applies to run-time evaluated languages like Python as believed by other researchers. Whom in contrast to our research have only researched this phenomenon in systems written in compiled languages such as Java, C, C++ and C#. In our research a tool PySmell has been developed to recover architectures and identify the presence of architectural smells in a system. PySmell has been used and evaluated on three different projects Django, Flask and PySmell itself. The results of PySmell are promising and of great interest but in need of further investigating and fine-tuning to reach the same level as the architectural recovery tools available for compiled languages. The thesis presents the first step into this new area of detecting architectural degeneration in interpreted languages, revealing issues such as that of extracting dependencies and how that may affect the architectural smell detection.

  • 275.
    Moghadam, Afshin Hemmati
    et al.
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Gebremedhin, Mahder
    Linköpings universitet, Institutionen för datavetenskap, PELAB - Laboratoriet för programmeringsomgivningar. Linköpings universitet, Tekniska högskolan.
    Stavåker, Kristian
    Linköpings universitet, Institutionen för datavetenskap, PELAB - Laboratoriet för programmeringsomgivningar. Linköpings universitet, Tekniska högskolan.
    Fritzson, Peter
    Linköpings universitet, Institutionen för datavetenskap, PELAB - Laboratoriet för programmeringsomgivningar. Linköpings universitet, Tekniska högskolan.
    Simulation and benchmarking of Modelica models on multi-core architectures with explicit parallel algorithmic language extensions2011Ingår i: Fourth Swedish Workshop on Multi-Core Computing MCC-2011 / [ed] Kessler, Christoph, 2011, Vol. S. 109-114, s. 109-114Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    In this paper we introduce new parallel programming language construcructs which can be used in the algorithmic parts of Modelica models, and we present a benchmark test suite of suitable algorithmic Modelica models that makes use of the new constructs (such as models containing large matrix computations). We provide measurements of simulating three models fraom this benchmark test suite using single-core and multi-core CPUs as well as GPUs. 

  • 276.
    Mohan, Sibin
    et al.
    Univ Illinois, IL 61801 USA.
    Asplund, Mikael
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Bloom, Gedare
    Howard Univ, DC 20059 USA.
    Sadeghi, Ahmad-Reza
    Tech Univ Darmstadt, Germany.
    Ibrahim, Ahmad
    Tech Univ Darmstadt, Germany.
    Salajageh, Negin
    Visa Res, CA USA.
    Griffioen, Paul
    Carnegie Mellon Univ, PA 15213 USA.
    Sinopoli, Bruno
    Carnegie Mellon Univ, PA 15213 USA.
    Special Session: The Future of IoT Security2018Ingår i: 2018 PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON EMBEDDED SOFTWARE (EMSOFT), IEEE , 2018Konferensbidrag (Refereegranskat)
    Abstract [en]

    The Internet-of-Things (IoT) is a large and complex domain. These systems are often constructed using a very diverse set of hardware, software and protocols. This, combined with the ever increasing number of IoT solutions/services that are rushed to market means that most such systems are rife with security holes. Recent incidents (e.g., the Mirai botnet) further highlight such security issues. With emerging technologies such as blockchain and software-defined networks (SDNs), new security solutions are possible in the IoT domain. In this paper we will explore future trends in IoT security: (a) the use of blockchains in IoT security, (b) data provenance for sensor information, (c) reliable and secure transport mechanisms using SDNs (d) scalable authentication and remote attestation mechanisms for IoT devices and (e) threat modeling and risk/maturity assessment frameworks for the domain.

  • 277.
    Monshizadeh, Mehrnoosh
    et al.
    Nokia Bell Labs, Finland; Aalto University, Finland.
    Khatri, Vikramajeet
    Nokia Bell Labs, Finland.
    Gurtov, Andrei
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    NFV Security Considerations for Cloud-Based Mobile Virtual Network Operators2016Ingår i: 2016 24TH INTERNATIONAL CONFERENCE ON SOFTWARE, TELECOMMUNICATIONS AND COMPUTER NETWORKS (SOFTCOM), IEEE , 2016, s. 228-232Konferensbidrag (Refereegranskat)
    Abstract [en]

    Cloud computing offers benefits of sharing computing and network resources among multiple mobile network operators. To utilize such benefits, in earlier paper we proposed a platform called telecommunication network as a service (TaaS). Sharing of such resources in cloud technology affects security of whole mobile network in general and software defined network (SDN) amp; network functions virtualization (NFV) in particular. In this paper, we have analyzed open platform for network functions virtualization (OPNFV) activities and compared them with TaaS concept to find commonalities and see how well it addresses security concerns outlined for TaaS. Through a comparison we show OPNFV security doesnt cover application security at all, however it partially covers data security and considerably covers hypervisor, SDN amp; NFV security. Therefore, OPNFV security needs to be revised in areas of data and application domain specially to meet the security requirements for TaaS. Furthermore, we conclude that our proposed TaaS platform implements at least current security requirements outlined in OPNFV specification.

  • 278.
    Moreno, Rodrigo
    et al.
    Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV. Linköpings universitet, Institutionen för medicin och hälsa, Avdelningen för radiologiska vetenskaper. Linköpings universitet, Hälsouniversitetet.
    Garcia, Miguel Angel
    Autonomous University of Madrid, Spain.
    Puig, Domenec
    Rovira i Virgili University, Spain.
    Tensor Voting for Robust Color Edge Detection2014Ingår i: Advances in Low-Level Color Image Processing / [ed] M. Emre Celebi and Bogdan Smolka, Springer Netherlands, 2014, s. 279-301Kapitel i bok, del av antologi (Refereegranskat)
    Abstract [en]

    This chapter proposes two robust color edge detection methods based on tensor voting. The first method is a direct adaptation of the classical tensor voting to color images where tensors are initialized with either the gradient or the local color structure tensor. The second method is based on an extension of tensor voting in which the encoding and voting processes are specifically tailored to robust edge detection in color images. In this case, three tensors are used to encode local CIELAB color channels and edginess, while the voting process propagates both color and edginess by applying perception-based rules. Unlike the classical tensor voting, the second method considers the context in the voting process. Recall, discriminability, precision, false alarm rejection and robustness measurements with respect to three different ground-truths have been used to compare the proposed methods with the state-of-the-art. Experimental results show that the proposed methods are competitive, especially in robustness. Moreover, these experiments evidence the difficulty of proposing an edge detector with a perfect performance with respect to all features and fields of application.

  • 279.
    Moses, Andrew
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Natural Interaction Programming with Microsoft Kinect2011Självständigt arbete på avancerad nivå (yrkesexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This report has the purpose of exploring the area of developing a natural interaction game using Microsoft Kinect. The launch of Kinect for Microsoft Xbox 360 has given us hardware for tracking humans, face recognition, speech recognition and 3D reconstruction for a relatively cheap price. This has created other areas of usage for Kinect than just in the area of games for Xbox. In this report I find out which development tools that are available today for developing applications for the PC platform and what they offer. I also choose one of them and develop a game with it with the purpose of evaluating the tool and also for getting the experience of creating an application with a natural user interface.

    The report is also part of a pre-study to introduce natural user interface applications into a game course at the university. This raises some requirements on the tools and therefore many of the discussions and results are with those requirements in mind. Those requirements being mainly that the tools should be available on the Windows platform and that they should be easy to use.

    The results shows that the area of developing natural interaction applications is new and therefore the tools available today are not totally mature yet. There are free tools from open source communities and tools from companies that you have to purchase to use. Both of them are trying to find their own way when it comes to the features and distribution of the tools and therefore which way to take is not obvious.

    Also developing a natural user interface is not always that straight forward. When there are no buttons available at all, it changes what you can do and how you do things. I will share my experiences and thoughts of both the development tools and the game I created throughout the report.

  • 280.
    Mudduluru, Sandhya
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Investigation of Test-Driven Development based on Mock Objects for Non-OO Languages2012Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    In traditional software development, bug detection or testing comes as an afterthought. However, bugs are difficult to detect in the later stages of software development that result in long debugging time. Usually, bugs are left out because of higher concentration on development effort, leaving lesser time for testing. Test-Driven Development (TDD) is a software development process that can reduce the debugging time by catching most of the bugs during development. The development is carried on in small and repeated steps based on test cases. However, TDD is designed to work for object-oriented languages. This thesis investigates the suitability of TDD for non-Object Oriented (OO) languages such as C. TDD can be used with C language with the help of stubbing concept. This thesis also evolves the concepts of stubs and mocks in TDD to be used with C to solve dependency related problems. Finally this thesis analyses some frameworks for TDD in C and provides the trade-offs between them. 

  • 281.
    Muneer, Imran
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Systematic Review on Automated Testing (Types, Effort and ROI)2014Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Software organizations always want to build software by minimizing their resources to reduce overall cost and by maintaining high quality to produce reliable software. Software testing helps us to achieve these goals in this regard. Software testing can be manual or automated. Manual testing is a very expensive activity. It takes much time to write test cases and run them one by one. It can be error-prone due to much involvement of human throughout the process. Automated testing reduces the testing time which results in reduction of overall software cost as well as it provides other benefits i.e. early time to market, improved quality. Organizations are willing to invest in test automation. Before investment, they want to know the expected cost and benefits for AST. Effort is the main factor, which increase the cost of testing.  

     

    In this thesis, a systematic review have been conducted which identifies and summarizes  all the retrieved research concerning the automated testing types, effort estimation and return on investment (ROI) / cost-benefit analysis for automated testing. To conduct the systematic review, the author has developed a comprehensive plan which follows the procedure presented in [15]. This plan provides guidance to identify relevant research articles of a defined period. After the identification of research articles, it collects, evaluates and then interprets all the retrieved data about automated testing types, effort estimation and ROI. The results have been presented in statistical and descriptive form which provides different aspects of the data.  

     

    The statistical results have been presented with the help of tables and graphs which show different aspects of data i.e. any gaps in research work of automated testing, number of articles for each testing type. The answers of the questions have been presented in descriptive form. The descriptive results show 22 automated testing types, 17 Industrial case studies out of 60 studies, benefits of automated testing and effort estimation models. The discussion part highlighted some important facts about the retrieved data and provides practical implications for conducting systematic reviews. Finally it is concluded that systematic reviews are good means of finding and analyzing research data about a topic, phenomena and area of interest. It also provides support to researchers for conducting and investigating more research.  

  • 282.
    Muric, Dino
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Utveckling av mobilapplikation för övervakning och larmhantering2012Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Netadmin Systems är ett Linköpingsbaserat IT-företag där huvudprodukten NETadmin är ett Operation support system/Business support system (OSS/BSS) som i huvudsak används i öppna nät för bl.a. kund- och lagerhantering, provisionering, övervakning och ärendehantering. Ett växande behov finns att göra det möjligt att använda övervakningssystemet via mobila enheter för att kunna felsöka och hantera driftstörningar effektivt.

    Syftet med rapporten är att undersöka hur övervakningssystemet kan göras tillgängligt på Android samt att ta fram en prototypapplikation för hantering av grundläggande övervakning. Genom fallstudien som har genomförts har slutsatsen dragits att Netadmin API är lämpligt för kommunikation via mobila enheter men att API behöver vidareutvecklas med ytterligarefunktioner. De viktigaste av dessa har implementerats och arbetet har även mynnat ut i en applikationsprototyp för Android.

    Genom utvecklingen av denna applikation ges Netadmins kunder möjlighet att hantera övervakningssystemet via mobila enheter.

  • 283.
    Muthumanickam, Prithiviraj
    et al.
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Vrotsou, Katerina
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Cooper, Matthew
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Johansson, Jimmy
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Shape Grammar Extraction for Efficient Query-by-Sketch Pattern Matching in Long Time Series2016Konferensbidrag (Refereegranskat)
    Abstract [en]

    Long time-series, involving thousands or even millions of time steps, are common in many application domains but remain very difficult to explore interactively. Often the analytical task in such data is to identify specific patterns, but this is a very complex and computationally difficult problem and so focusing the search in order to only identify interesting patterns is a common solution. We propose an efficient method for exploring user-sketched patterns, incorporating the domain expert’s knowledge, in time series data through a shape grammar based approach. The shape grammar is extracted from the time series by considering the data as a combination of basic elementary shapes positioned across different am- plitudes. We represent these basic shapes using a ratio value, perform binning on ratio values and apply a symbolic approximation. Our proposed method for pattern matching is amplitude-, scale- and translation-invariant and, since the pattern search and pattern con- straint relaxation happen at the symbolic level, is very efficient permitting its use in a real-time/online system. We demonstrate the effectiveness of our method in a case study on stock market data although it is applicable to any numeric time series data.

  • 284.
    Muthumanickam, Prithiviraj
    et al.
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Vrotsou, Katerina
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Vitoria, Aida
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Johansson, Jimmy
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten. Linköpings universitet, Centrum för klimatpolitisk forskning, CSPR.
    Cooper, Matthew
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Identification of Temporally Varying Areas of Interest in Long-Duration Eye-Tracking Data Sets2019Ingår i: IEEE Transactions on Visualization and Computer Graphics, ISSN 1077-2626, E-ISSN 1941-0506, s. 87-97Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Eye-tracking has become an invaluable tool for the analysis of working practices in many technological fields of activity. Typically studies focus on short tasks and use static expected areas of interest (AoI) in the display to explore subjects’ behaviour, making the analyst’s task quite straightforward. In long-duration studies, where the observations may last several hours over a complete work session, the AoIs may change over time in response to altering workload, emergencies or other variables making the analysis more difficult. This work puts forward a novel method to automatically identify spatial AoIs changing over time through a combination of clustering and cluster merging in the temporal domain. A visual analysis system based on the proposed methods is also presented. Finally, we illustrate our approach within the domain of air traffic control, a complex task sensitive to prevailing conditions over long durations, though it is applicable to other domains such as monitoring of complex systems. 

  • 285.
    Mårtensson, Emil
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    Design and development of a plugin-based architecture on an embedded system2013Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
  • 286.
    Nagubadi, RadhaKrishna
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    K Shortest Path Implementation2013Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    The problem of computing K shortest loopless paths, or ranking of the K shortest loopless paths between a pair of given vertices in a network is a well-studied generalization of shortest path problem. The K shortest paths problem determines not only one shortest path but the K best shortest paths from s to t in an increasing order of weight of the paths.

    Yen’s algorithm is known to be the efficient and widely used algorithm for determining K shortest loopless paths. Here, we introduce a new algorithm by modifying the Yen’s algorithm in the following way: instead of removing the vertices and the edges from the graph, we store them in two different sets. Then we modified the Dijkstra’s algorithm by taking these two sets into consideration. Thus the algorithm applies glass box methodology by using the modified Dijkstra’s algorithm for our dedicated purpose. Thus the efficiency is improved. The computational results conducted over different datasets, shows the proposed algorithm has better performance results.

  • 287. Nguyen, Linh Anh
    et al.
    Nguyen, Thi-Bich-Loc
    Szalas, Andrzej
    Linköpings universitet, Institutionen för datavetenskap, KPLAB - Laboratoriet för kunskapsbearbetning. Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem.
    HornDL: An Expressive Horn Description Logic with PTime Data Complexity2013Ingår i: Web Reasoning and Rule Systems / [ed] Wolfgang Faber, Domenico Lembo, Springer Berlin/Heidelberg, 2013, s. 259-264Konferensbidrag (Refereegranskat)
    Abstract [en]

    We introduce a Horn description logic called Horn-DL, which is strictly and essentially richer than Horn- SROIQ , while still has PTime data complexity. In comparison with Horn- SROIQ , HornDL additionally allows the universal role and assertions of the form irreflexive (s), ¬s(a,b) , a≐̸b . More importantly, in contrast to all the well-known Horn fragments EL , DL-Lite, DLP, Horn- SHIQ , Horn- SROIQ of description logics, HornDL allows a form of the concept constructor “universal restriction” to appear at the left hand side of terminological inclusion axioms. Namely, a universal restriction can be used in such places in conjunction with the corresponding existential restriction. In the long version of this paper, we present the first algorithm with PTime data complexity for checking satisfiability of HornDL knowledge bases.

  • 288.
    Nguyen, Linh Anh
    et al.
    University of Warsaw, Poland.
    Szalas, Andrzej
    Linköpings universitet, Institutionen för datavetenskap, KPLAB - Laboratoriet för kunskapsbearbetning. Linköpings universitet, Tekniska högskolan. University of Warsaw, Poland.
    On the Horn Fragments of Serial Regular Grammar Logics with Converse2013Ingår i: Advanced Methods and Technologies for Agent and Multi-Agent Systems: Proceedings of the 7th KES Conference on Agent and Multi-Agent Systems - Technologies and Applications (KES-AMSTA 2013) / [ed] Dariusz Barbucha, Manh Thanh Le, Robert J. Howlett, Lakhmi C. Jain, IOS Press, 2013, s. 225-234Konferensbidrag (Refereegranskat)
    Abstract [en]

    We study Horn fragments of serial multimodal logics which are characterized by regular grammars with converse. Such logics are useful for reasoning about epistemic states of multiagent systems as well as similarity-based approximate reasoning. We provide the first algorithm with PTIME data complexity for checking satisfiability of a Horn knowledge base in a serial regular grammar logic with converse.

  • 289.
    Nguyen, Nam-Phong
    et al.
    Queens University of Belfast, North Ireland.
    Duong, Trung Q
    Queens University of Belfast, North Ireland.
    Ngo, Hien Quoc
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska fakulteten. Queens University of Belfast, North Ireland.
    Hadzi-Velkov, Zoran
    St Cyril & Methodius Univ, Skopje, Macedonia.
    Shu, Lei
    Guangdong University of Petrochem Technology, Peoples R China.
    Secure 5G Wireless Communications: A Joint Relay Selection and Wireless Power Transfer Approach2016Ingår i: IEEE Access, E-ISSN 2169-3536, Vol. 4, s. 3349-3359Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this paper, we investigate the secrecy performance of an energy harvesting relay system, where a legitimate source communicates with a legitimate destination via the assistance of multiple trusted relays. In the considered system, the source and relays deploy the time-switching-based radio frequency energy harvesting technique to harvest energy from a multi-antenna beacon. Different antenna selection and relay selection schemes are applied to enhance the security of the system. Specifically, two relay selection schemes based on the partial and full knowledge of channel state information, i. e., optimal relay selection and partial relay selection, and two antenna selection schemes for harvesting energy at source and relays, i. e., maximizing energy harvesting channel for the source and maximizing energy harvesting channel for the selected relay, are proposed. The exact and asymptotic expressions of secrecy outage probability in these schemes are derived. We demonstrate that applying relay selection approaches in the considered energy harvesting system can enhance the security performance. In particular, optimal relay selection scheme outperforms partial relay selection scheme and achieves full secrecy diversity order, regardless of energy harvesting scenarios.

  • 290.
    Nguyen, Nam-Phong
    et al.
    Queens University of Belfast, North Ireland, UK.
    Kundu, Chinmoy
    Queens University of Belfast, North Ireland, UK.
    Quoc Ngo, Hien
    Linköpings universitet, Tekniska fakulteten. Queens University of Belfast, North Ireland, UK.
    Dong, Trung Q
    Queens University of Belfast, North Ireland, UK.
    Canberk, Berk
    Istanbul Technical University, Turkey.
    Secure Full-Duplex Small-Cell Networks in a Spectrum Sharing Environment2016Ingår i: IEEE Access, E-ISSN 2169-3536, IEEE Access, ISSN 2169-3536, Vol. 4, s. 3087-3099Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this paper, we propose three relay selection schemes for full-duplex heterogeneous networks in the presence of multiple cognitive radio eavesdroppers. In this setup, the cognitive small-cell nodes (secondary network) can share the spectrum licensed to the macro-cell system (primary network) on the condition that the quality-of-service of the primary network is always satisfied subjected to its outage probability constraint. The messages are delivered from one small-cell base station to the destination with the help of full-duplex small-cell base stations, which act as relay nodes. Based on the availability of the networks channel state information at the secondary information source, three different selection criteria for full-duplex relays, namely: 1) partial relay selection; 2) optimal relay selection; and 3) minimal self-interference relay selection, are proposed. We derive the exact closed-form and asymptotic expressions of the secrecy outage probability for the three criteria under the attack of non-colluding/colluding eavesdroppers. We demonstrate that the optimal relay selection scheme outperforms the partial relay selection and minimal self-interference relay selection schemes at the expense of acquiring full channel state information knowledge. In addition, increasing the number of the full-duplex small-cell base stations can improve the security performance. At the illegitimate side, deploying colluding eavesdroppers and increasing the number of eavesdroppers put the confidential information at a greater risk. Besides, the transmit power and the desire outage probability of the primary network have great influences on the secrecy outage probability of the secondary network.

  • 291.
    Nguyen Viet, Hung
    Linköpings universitet, Institutionen för datavetenskap, PELAB - Laboratoriet för programmeringsomgivningar. Linköpings universitet, Tekniska högskolan.
    Model based safety assessmentfor safety critical system2012Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Nowadays, model-based diagnosis plays an important role in many systems fromsimple to complex, especially systems with high demand of safety. Inavionics/aerospace systems, the large distance from the vehicle to earth makes themaintenance process difficult. As a result, in this field model-based diagnosis hasbecome a major method for fault identification and recovering and NASA AmesResearch Center has developed the advanced diagnostics and prognostics testbed(ADAPT) as a platform for experimenting and comparing the results of differentdiagnosis technologies and tools.

    This study reviews the theory of model-based diagnosis and how it is employed inavionics systems. The diagnosis system in our study consists of a set of sensorsmonitoring different parameter of electrical components in the system to detect andlocate faults. In the scope of this study, we focus on detecting drift fault of electricalcomponents’ parameter such as values of voltage, current and resistor. Two approachesare used for detecting this kind of fault: CUSUM chart V-mask method and Shewhartvariable control chart. The application which is built based on these approaches will berun on ADAPT and the result will be showed and discussed.

  • 292.
    Nielsen, Emil
    Linköpings universitet, Institutionen för systemteknik, Datorteknik. Linköpings universitet, Tekniska fakulteten.
    Performance Evaluation of an easily retargeted C compiler using the LLVM framework2015Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    When considering processor architectures (either existing ones or when developing new ones), native code for functional testing and performance evaluation will generally be required. In theory, the work load involved in developing such code can be alleviated by compiling existing test cases written in a higher level language.

    This thesis focuses on evaluating the feasibility of this approach by developing a basic C compiler using the LLVM framework and porting it to a number of architectures, finishing by comparing the performance of the compiled code with existing results obtained using the CoreMark benchmark. The resulting comparison can serve as a guideline when deciding which approach to choose when taking on a new architecture. The developed compiler and its back end ports can also serve as reference implementations.

    While not conclusive, the final results indicate that the approach is highly feasible for certain applications on certain architectures.

  • 293.
    Niknafs, Mina
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Ukhov, Ivan
    Gears Leo AB, Sweden.
    Eles, Petru Ion
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Peng, Zebo
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Runtime Resource Management with Workload Prediction2019Ingår i: PROCEEDINGS OF THE 2019 56TH ACM/EDAC/IEEE DESIGN AUTOMATION CONFERENCE (DAC), ASSOC COMPUTING MACHINERY , 2019Konferensbidrag (Refereegranskat)
    Abstract [en]

    Modern embedded platforms need sophisticated resource managers in order to utilize the heterogeneous computational resources efficiently. Moreover, such platforms are exposed to fluctuating workloads unpredictable at design time. In such a context, predicting the incoming workload might improve the efficiency of resource management. But is this true? And, if yes, how significant is this improvement? How accurate does the prediction need to be in order to improve decisions instead of doing harm? By proposing a prediction-based resource manager aimed at minimizing energy consumption while meeting task deadlines and by running extensive experiments, we try to answer the above questions.

  • 294.
    Niknafs, Mina
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Ukhov, Ivan
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Eles, Petru Ion
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Peng, Zebo
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Two-Phase Interarrival Time Prediction for Runtime Resource Management2017Ingår i: 2017 EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN (DSD), IEEE , 2017, s. 524-528Konferensbidrag (Refereegranskat)
    Abstract [en]

    Platforms that are based on heterogeneous architectures require an intelligent resource manager. An intelligent resource manager should be able to accurately predict the future workload of the system at hand and take it into consideration. In this paper, we show that there exist patterns in the interarrival times of resource requests, and that these patterns can be used for modeling and prediction of the future arrivals. To this end, we develop a two-phase machine-learning-based framework and apply it to real data. First, in the offline phase of our framework, the interarrival times are clustered based on a number of extracted features, and then an adequate modeling and prediction method is selected for each detected cluster. It is shown that, due to the intricate and varied nature of interarrival times, a universal modeling and prediction method does not provide optimal results, and a customized method should be applied to each of the detected clusters. Second, in the runtime phase of our framework, the results provided from the offline phase are used to perform computationally cheap prediction. The experimental results show that our approach has a prediction error below 12% and provides an error reduction of more than 17% in comparison with a straightforward method.

  • 295.
    Niknafs, Mina
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Ukhov, Ivan
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Eles, Petru Ion
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Peng, Zebo
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Workload Prediction for Runtime Resource Management2017Ingår i: 2017 IEEE NORDIC CIRCUITS AND SYSTEMS CONFERENCE (NORCAS): NORCHIP AND INTERNATIONAL SYMPOSIUM OF SYSTEM-ON-CHIP (SOC), IEEE , 2017Konferensbidrag (Refereegranskat)
    Abstract [en]

    An intelligent resource manager is an essential part of platforms based on heterogeneous architectures. The resource manager should be able to accurately predict the future workload of the system at hand and take it into consideration for making decisions. In this paper, we study a large computer cluster and show that there exist patterns in the sequence of applications that each user runs over time, and that these patterns can be used for modeling and prediction of the applications that will be requested in the future. To this end, we develop a predictive technique based on the n-gram model. It is shown that, due to the varied nature of application sequences of different users, a universal model does not provide optimal results, and a customized model should be constructed for each user. The experimental results show that the straightforward methods have a prediction accuracy below 16% when assessed on a real-life data set. Our technique provides an accuracy improvement of more than 51% in comparison with the straightforward method.

  • 296.
    Nilsson, Anton
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Accessing a web based business systemthrough a smartphone, a risk analysis2015Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This thesis project has been performed at (and for) a company named Strödata. The purpose of the project has been to perform a risk analysis on Strödata’s web based business system, and specifically analyze how access to the business system through smartphones would affect the risks posed to the system. This has been done to help decide if smartphone access should be enabled. An implementation of a web application which is suited for use on a smartphone has also been developed, as a proof-of-concept, to grant access to a limited part of the business system. The method used to perform the risk analysis has been CORAS, as presented by Braber et al in [1]. CORAS is a risk analysis method designed with IT-systems specifically in mind. The method is divided into seven steps. The new web application is an ASP.NET MVC3 site that uses JavaScript, jQuery and Ajax-JSON.

    The risk analysis showed, among other things, that the benefits of enabling smartphone access to the business system are larger than the risks it introduces. Smartphone access also opens up many new possibilities to implement interesting new features or improve old ones. The risk analysis also showed that there are risks to the system that need to be dealt with. For these, risks treatments were identified to lessen their probabilities and/or their consequences should they occur. Some treatments were completely successful in eliminating the risks they treat, others were not. However, the treatments that were not completely successful did reduce the risks far enough that perhaps they should be re-evaluated as un-/acceptable.

    The conclusions that can be drawn from this thesis project are that although enabling smartphone access to the business system introduces new risks to the system, the access also reduces certain risks. How costly the new risks are and how much the access reduces risks varies from company to company and from system to system. For Strödata, the reduction to certain risks was large enough to outweigh the new risks that would be introduced. Regarding the possibility to implement smartphone access to the business system, it is possible using more modern technologies, methods and frameworks; such as those mentioned above.

  • 297.
    Nilsson, Samuel
    Linköpings universitet, Institutionen för datavetenskap, Interaktiva och kognitiva system.
    Implementation of a Continuous Integration and Continuous Delivery System for Cross-Platform Mobile Application Development2016Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    When working in software development teams, there are challenges when it comes to always keeping the software stable and reliable. Continuous integration are frequently used to increase the stability and reliability. Extensive research has been performed on the matter of development processes of continuous integration, but there are no consensus on how systems to support continuous integration should be implemented for best results. In this report a continuous integration system is implemented based on best practices and to support the general continuous integration development process, by using Jenkins and other open source tools. The system is adapted to work well with the cross-platform mobile development framework CoffeeMaker developed by VISIARC AB and the general needs of the company. In order to roughly estimate the increased developer productivity and product quality when introducing the system, a questionnaire that discusses the system and working habits was sent out to the developers. The evaluation lead to the conclusion that the productivity would improve by approximately 30-60 minutes per week and developer. It also lead to the conclusion that the quality of their developed applications would most probably increase by introducing such a system.

  • 298.
    Nilsson, Sara
    et al.
    Linköpings universitet, Institutionen för ekonomisk och industriell utveckling, Industriell miljöteknik. Linköpings universitet, Tekniska fakulteten.
    Buffoni, Lena
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Sandahl, Kristian
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Johansson, Hanna
    Linköpings universitet, Institutionen för datavetenskap, Interaktiva och kognitiva system. Linköpings universitet, Tekniska fakulteten.
    Tahir Sheikh, Bilal
    Empirical Study of Requirements Engineering in Cross Domain Development2018Ingår i: DS 92: Proceedings of the DESIGN 2018 15th International Design Conference / [ed] Dorian Marjanović, Mario Štorga, Stanko Škec, Nenad Bojčetić and Neven Pavković, Glasgow: The Design Society , 2018, Vol. 92, s. 857-868Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    Shortened time-to-market cycles and increasingly complex systems are just some of the challenges faced by industry. The requirement engineering process needs to adapt to these challenges in order to guarantee that the end product fulfils the customer expectations as well as the necessary safety norms. The goal of this paper is to investigate the way engineers work in practice with the requirement engeneering processes at different stages of the development, with a particular focus on the use of requirements in cross domain development and to compare this to the existing theory in the domain.

  • 299.
    Nilsson, Sebastian
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Ett modulärt pluginramverk2013Självständigt arbete på grundnivå (kandidatexamen), 10,5 poäng / 16 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    I denna rapport presenteras ett existerande system som kan hantera paketerade program (“building blocks”) modulärt. Systemet tillämpas på produkten iipax. Ett building block är en enhet (”plugin”) som kan förflyttas mellan iipax-projekt. Systemet automatiserar konfigurationsförändring ochtillåter utvecklare att enkelt använda resurser som b.la. objectbase och messagebundles till funktionalitet i iipax. Det är möjligt att styra vilka filer som ska till klient respektive server. Systemet tillåter återanvändning av kodmellan iipax-projekt samt reducerar utvecklarens konfigurationsarbete till endast en fil.

  • 300.
    Nissa Holmgren, Robert
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Automated Measurement and Change Detection of an Application’s Network Activity for Quality Assistance2014Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Nätverksaktivitet är ett viktigt kvalitetsmått för mobilappar. Mobilanvändare begränsas ofta av långsamma nätverk, låg månatlig trafikkvot och höga roamingavgifter. Företag som vill ha konkurrenskraftiga appar behöver vara medveten om deras nätverksaktivitet och förändringar av den.

    Snabb återkoppling för effekten av kodändringar är vitalt för agil programutveckling. För att underrätta intressenter om ändringar när de händer utan att vara avskräckande dyrt med avseende på arbetskraft måste ändringsdetekteringen vara fullständigt automatiserad. För att ytterligare minska arbetskostnaderna för ändringsdetektering av nätverksaktivitet måste detekteringssystemet vara snabbt att konfigurera, hålla en låg grad av felaktig detektering samtidigt som den lyckas identifiera stora ändringar.

    Den här uppsatsen föreslår ett automatiserat förändringsdetekteringsverktyg för nätverksaktivitet för att snabbt meddela stakeholders med relevant information för påbörjan av grundorsaksanalys när en ändring som påverkar nätverksaktiviteten introduceras. Med hjälp av mätningar på Spotifys iOS-app visar vi att verktyget når en låg grad av felaktiga detekteringar medan den identifierar ändringar i nätverksaktiviteten även för appar med så dynamisk nätverksanvändning som Spotify.

3456789 251 - 300 av 427
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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