hh.sePublikationer
Ändra sökning
Avgränsa sökresultatet
1234567 1 - 50 av 920
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • 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.
  • 1.
    Abdulrazzaq, Mohammed
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Wei, Yuan
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Industrial Control System (ICS) Network Asset Identification and Risk Management2018Självständigt arbete på avancerad nivå (magisterexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Setting against the significant background of Industrial 4.0, the Industrial Control System (ICS) accelerates and enriches the upgrade the existing production infrastructure. To make the infrastructures “smart”, huge parts of manual operations have been automated in this upgrade and more importantly, the isolated controlled processes have been connected through ICS. This has also raised the issues in asset management and security concerns. Being the starting point of securing the ICS, the asset identification is, nevertheless, first dealt by exploring the definition of assets in the ICS domain due to insufficient documentation and followed by the introduction of ICS constituents and their statuses in the whole network. When the definition is clear, a well-received categorization of assets in the ICS domain is introduced, while mapping out their important attributes and their significance relating the core of service they perform. To effectively tackle the ever-increasing amount of assets, identification approaches are compared and a case study was performed to test the effectiveness of two open source software. Apart from the identification part, this thesis describes a framework for efficient asset management from CRR. The four cyclic modules proposed give an overview on how the asset management should be managed according the dynamics of the assets in the production environment.

  • 2.
    Aceto, L.
    et al.
    School of Computer Science, Reykjavik University, Iceland.
    Birgisson, A.
    Department of Computer Science and Engineering, Chalmers University of Technology, Sweden.
    Ingolfsdottir, A.
    School of Computer Science, Reykjavik University, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, TU/Eindhoven, Eindhoven, Netherlands.
    Decompositional Reasoning about the History of Parallel Processes2011Ingår i: Fundamentals of software engineering: revised selected papers, Heidelberg: Springer Berlin/Heidelberg, 2011, Vol. 4171, s. 32-47Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper presents a decomposition technique for Hennessy-Milner logic with past and its extension with recursively defined formulae. In order to highlight the main ideas and technical tools, processes are described using a subset of CCS with parallel composition, nondeterministic choice, action prefixing and the inaction constant. The study focuses on developing decompositional reasoning techniques for parallel contexts in that language. © 2012 Springer-Verlag.

  • 3.
    Aceto, L.
    et al.
    School of Computer Science, Reykjavík University, Kringlan 1, 103 Reykjavík, Iceland.
    Fokkink, W. J.
    Department of Computer Science, Vrije Universiteit Amsterdam, 1081 HV Amsterdam, Netherlands.
    Ingólfsdóttir, A.
    School of Computer Science, Reykjavík University, Kringlan 1, 103 Reykjavík, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, 5600 MB Eindhoven, Netherlands.
    Lifting non-finite axiomatizability results to extensions of process algebras2010Ingår i: Acta Informatica, ISSN 0001-5903, E-ISSN 1432-0525, Vol. 47, nr 3, s. 147-177Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioural (pre)congruences over process algebras from old ones. The proposed technique is based on a variation on the classic idea of reduction mappings. In this setting, such reductions are translations between languages that preserve sound (in)equations and (in)equational provability over the source language, and reflect families of (in)equations responsible for the non-finite axiomatizability of the target language. The proposed technique is applied to obtain a number of new non-finite axiomatizability theorems in process algebra via reduction to Moller's celebrated non-finite axiomatizability result for CCS. The limitations of the reduction technique are also studied. In particular, it is shown that prebisimilarity is not finitely based over CCS with the divergent process Ω, but that this result cannot be proved by a reduction to the non-finite axiomatizability of CCS modulo bisimilarity. This negative result is the inspiration for the development of a sharpened reduction method that is powerful enough to show that prebisimilarity is not finitely based over CCS with the divergent process Ω. © 2010 Springer-Verlag.

  • 4.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS-101 Reykjavik, Iceland.
    Birgisson, Arnar
    Department of Computer Science and Engineering, Chalmers University of Technology, Sweden.
    Ingolfsdottir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS-101 Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Reniers, Michel A.
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Rule Formats for Determinism and Idempotence2012Ingår i: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 77, s. 889-907Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Determinism is a semantic property of (a fragment of) a language that specifies that a program cannot evolve operationally in several different ways. Idempotence is a property of binary composition operators requiring that the composition of two identical specifications or programs will result in a piece of specification or program that is equivalent to the original components. In this paper, we propose (related) meta-theorems for guaranteeing the determinism and idempotence of binary operators. These meta-theorems are formulated in terms of syntactic templates for operational semantics, called rule formats. In order to obtain a powerful rule format for idempotence, we make use of the determinism of certain transition relations in the definition of the format for idempotence. We show the applicability of our formats by applying them to various operational semantics from the literature. © 2010 Elsevier B.V. All rights reserved.

  • 5.
    Aceto, Luca
    et al.
    School of Computer Science, Reykjavik University, Iceland.
    Birgisson, Arnar
    School of Computer Science, Reykjavik University, Iceland & Department of Computer Science and Engineering, Chalmers University of Technology, Sweden.
    Ingólfsdóttir, Anna
    School of Computer Science, Reykjavik University, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, TU/Eindhoven, Eindhoven, Netherlands.
    Decompositional Reasoning about the History of Parallel Processes2010Rapport (Övrigt vetenskapligt)
    Abstract [en]

    Decompositional reasoning aims at automatically decomposing a global property of a composite system into local properties of (possibly unknown) components. In concurrency theory, decompositional reasoning techniques date back to the seminal work of Larsen and Liu in the late 1980s and early 1990s. However, we are not aware of any such decomposition technique that applies to reasoning about the "past". In this paper, we address this problem and present a decomposition technique for Hennessy-Milner logic with past and its extension with recursively defined formulae. As a language for processes, we use a subset of Milner's CCS with parallel composition, non-deterministic choice, action prefixing and the inaction constant. We focus on developing decompositional reasoning techniques for parallel contexts in that language.

  • 6.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland.
    Cimini, Matteo
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland.
    Ingolfsdottir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Reniers, Michel A.
    Department of Mechanical Engineering, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Rule Formats for Distributivity2012Ingår i: Theoretical Computer Science, ISSN 0304-3975, E-ISSN 1879-2294, Vol. 458, s. 1-28Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain binary operators are left distributive with respect to a set of binary operators. Examples of left-distributivity laws from the literature are shown to be instances of the provided formats. Some conditions ensuring the invalidity of the left-distributivity law are also offered. © 2012 Elsevier B.V. All rights reserved.

  • 7.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland.
    Cimini, Matteo
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland.
    Ingolfsdottir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Reniers, Michel A.
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    SOS Rule Formats for Zero and Unit Elements2011Ingår i: Theoretical Computer Science, ISSN 0304-3975, E-ISSN 1879-2294, Vol. 412, nr 28, s. 3045-3071Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain constants act as left or right unit/zero elements for a set of binary operators. Examples of left and right zero, as well as unit, elements from the literature are shown to fit the rule formats offered in this study. © 2011 Elsevier B.V. All rights reserved.

  • 8.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Cimini, Matteo
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Ingólfsdóttir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Reniers, Michael A.
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    On Rule Formats for Zero and Unit Elements2010Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This paper proposes a rule format for Structural Operational Semantics guaranteeing that certain constants act as left or right zero elements for a set of binary operators. Our design approach is also applied to reformulate an earlier rule format for unit elements developed by some of the authors. Examples of left and right zero, as well as unit, elements from the literature are shown to be checkable using the provided formats.

  • 9.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Cimini, Matteo
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Ingólfsdóttir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Reniers, Michael A.
    Department of Mechanical Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Rule Formats for Distributivity2010Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain binary operators are left distributive with respect to a set of binary operators. Examples of left-distributivity laws from the literature are shown to be instances of the provided formats.

  • 10.
    Aceto, Luca
    et al.
    School of Computer Science, Reykjavik University, Iceland.
    Cimini, Matteo
    School of Computer Science, Reykjavik University, Iceland.
    Ingólfsdóttir, Anna
    School of Computer Science, Reykjavik University, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Reniers, Michel A.
    Department of Mechanical Engineering, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Rule Formats for Distributivity2011Ingår i: Language and Automata Theory and Applications: 5th International Conference : Proceedings / [ed] Adrian Horia Dediu, Heidelberg: Springer Berlin/Heidelberg, 2011, Vol. 6638, s. 79-90Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain binary operators are left distributive with respect to a set of binary operators. Examples of left-distributivity laws from the literature are shown to be instances of the provided formats. © 2011 Springer-Verlag.

  • 11.
    Aceto, Luca
    et al.
    Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.
    Fokkink, Wan
    Vrije Universiteit Amsterdam, NL-1081HV, The Netherlands.
    Ingólfsdóttir, Anna
    Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.
    Mousavi, Mohammad Reza
    Eindhoven University of Technology, NL-5600MB Eindhoven, The Netherlands.
    Lifting non-finite axiomatizability results to extensions of process algebras2008Ingår i: Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008 / [ed] Ausiello, G, Karhumaki, J, Mauri, G, Ong, L, New York: Springer-Verlag New York, 2008, Vol. 273, s. 301-316Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics over process algebras from old ones. The proposed technique is based on a variation on the classic idea of reduction mappings. In this setting, such reductions are translations between languages that preserve sound (in)equations and (in)equational proofs over the source language, and reflect families of (in)equations responsible for the non-finite axiomatizability of the target language. The proposed technique is applied to obtain a number of new non-finite axiomatizability theorems in process algebra via reduction to Moller’s celebrated non-finite axiomatizability result for CCS. The limitations of the reduction technique are also studied.

  • 12.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Fokkink, Wan J.
    Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands.
    Ingólfsdóttir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Lifting non-finite axiomatizability results to extensions of process algebras2008Rapport (Övrigt vetenskapligt)
  • 13.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Goriac, Eugen-Ioan
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Ingolfsdottir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Reniers, Michel A.
    Department of Mechanical Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Exploiting Algebraic Laws to Improve Mechanized Axiomatizations2013Ingår i: Algebra and Coalgebra in Computer Science: 5th International Conference, Calco 2013, Warsaw, Poland, September 2013, Proceedings, Berlin: Springer Berlin/Heidelberg, 2013, s. 36-50Konferensbidrag (Refereegranskat)
    Abstract [en]

    In the field of structural operational semantics (SOS), there have been several proposals both for syntactic rule formats guaranteeing the validity of algebraic laws, and for algorithms for automatically generating ground-complete axiomatizations. However, there has been no synergy between these two types of results. This paper takes the first steps in marrying these two areas of research in the meta-theory of SOS and shows that taking algebraic laws into account in the mechanical generation of axiomatizations results in simpler axiomatizations. The proposed theory is applied to a paradigmatic example from the literature, showing that, in this case, the generated axiomatization coincides with a classic hand-crafted one. © 2013 Springer-Verlag Berlin Heidelberg.

  • 14.
    Aceto, Luca
    et al.
    School of Computer Science, Reykjavík University, Kringlan 1, 103 Reykjavík, Iceland.
    Ingólfsdóttir, A.
    School of Computer Science, Reykjavík University, Kringlan 1, 103 Reykjavík, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, 5600 MB Eindhoven, Netherlands.
    Reniers, M. A.
    Algebraic properties for free!2009Ingår i: Bulletin of the European Association for Theoretical Computer Science, ISSN 0252-9742, Vol. 99, s. 81-103Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Algebraic properties specify some natural properties of programming and specification constructs. This paper provides an overview of techniques to guarantee or generate algebraic properties of language constructs by investigating the syntactic shape of the deduction rules defining their operational semantics.

  • 15.
    Aceto, Luca
    et al.
    Department of Computer Science, Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.
    Ingólfsdóttir, Anna
    Department of Computer Science, Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.
    Impossibility results for the equational theory of timed CCS2007Ingår i: Algebra and Coalgebra in Computer Science: Second International Conference, CALCO 2007, Bergen, Norway, August 20-24, 2007. Proceedings, Berlin: Springer Berlin/Heidelberg, 2007, Vol. 4624, s. 80-95Konferensbidrag (Refereegranskat)
    Abstract [en]

    We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR'90. Common to Wang Yi's paper, we particularly focus on a class of linearly-ordered time domains exemplified by the positive real or rational numbers. We show that, even when the set of basic actions is a singleton, there are parallel Timed CCS processes that do not have any sequential equivalent and thus improve on the Gap Theorem for Timed CCS presented by Godskesen and Larsen in FSTTCS'92. Furthermore, we show that timed bisimilarity is not finitely based both for single-sorted and two-sorted presentations of Timed CCS. We further strengthen this result by showing that, unlike in some other process algebras, adding the untimed or the timed left-merge operator to the syntax and semantics of Timed CCS does not solve the axiomatizability problem.

  • 16.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Ingólfsdóttir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Reniers, Michel A.
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    A Rule Format for Unit Elements2009Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This paper offers a meta-theorem for languages with a Structural Operational Semantics (SOS) in the style of Plotkin. Namely, it proposes a generic rule format for SOS guaranteeing that certain constants act as left- or right-unit elements for a set of binary operators. We show the generality of our format by applying it to a wide range of operators from the literature on process calculi.

  • 17.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University Kringlan 1, IS-103 Reykjavik, Iceland.
    Ingólfsdóttir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University Kringlan 1, IS-103 Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology P.O. Box 513, NL-5600 MB Ei ndhoven, The Netherlands.
    Reniers, Michel A.
    Department of Computer Science, Eindhoven University of Technology P.O. Box 513, NL-5600 MB Ei ndhoven, The Netherlands.
    A rule format for unit elements2010Ingår i: SOFSEM 2010: Theory and Practice of Computer Science: Proceedings / [ed] VanLeeuwen, J, Muscholl, A, Peleg, D, Pokorny, J, Rumpe, B, Berlin: Springer Berlin/Heidelberg, 2010, Vol. 5901, s. 141-152Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper offers a meta-theorem for languages with a Structural Operational Semantics (SOS) in the style of Plotkin. Namely, it proposes a generic rule format for SOS guaranteeing that certain constants act as left- or right-unit elements for a set of binary operators. We show the generality of our format by applying it to a wide range of operators from the literature on process calculi.

  • 18.
    Aceto, Luca
    et al.
    Reykjavik University, Reykjavik, Iceland.
    Mousavi, Mohammad RezaEindhoven University of Technology, Eindhoven, The Netherlands.
    Proceedings First International Workshop on Process Algebra and Coordination2011Proceedings (redaktörskap) (Övrigt vetenskapligt)
    Abstract [en]

    Process algebra provides abstract and rigorous means for studying communicating concurrent systems. Coordination languages also provide abstract means for the specifying and programming communication of components. Hence, the two fields seem to have very much in common and the link between these two research areas have been established formally by means of several translations, mainly from coordination languages to process algebras. There have also been proposals of process algebras whose communication policy is inspired by the one underlying coordination languages. The aim of this workshop was to push the state of the art in the study of the connections between process algebra and coordination languages by bringing together experts as well as young researchers from the two fields to communicate their ideas and findings. It includes both contributed and invited papers that have been presented during the one day meeting on Process Algebra and Coordination (PACO 2011) which took place on June 9, 2011 in Reykjavik, Iceland.

  • 19.
    Aerts, Arend
    et al.
    Control Systems Technology Group, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Mousavi, Mohammad Reza
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Reniers, Michel A.
    Control Systems Technology Group, Eindhoven University of Technology, Eindhoven, The Netherlands.
    A Tool Prototype for Model-Based Testing of Cyber-Physical Systems2015Ingår i: Theoretical Aspects of Computing – ICTAC 2015: 12th International Colloquium Cali, Colombia, October 29–31, 2015, Proceedings / [ed] Martin Leucker, Camilo Rueda, and Frank D. Valencia, Cham: Springer, 2015, Vol. 9399, s. 563-572Konferensbidrag (Refereegranskat)
    Abstract [en]

    We report on a tool prototype for model-based testing of cyber-physical systems. Our starting point is a hybrid-system model specified in a domain-specific language called Acumen. Our prototype tool is implemented in Matlab and covers three stages of model-based testing, namely, test-case generation, test-case execution, and conformance analysis. We have applied our implementation to a number of typical examples of cyber-physical systems in order to analyze its applicability. In this paper, we report on the result of applying the prototype tool on a DC-DC boost converter. © Springer International Publishing Switzerland 2015

  • 20.
    Aerts, Arend
    et al.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Reniers, Michel A.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Mousavi, Mohammad Reza
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Model-Based Testing of Cyber-Physical Systems2016Ingår i: Cyber-Physical Systems: Foundations, Principles and Applications / [ed] H. Song, D.B. Rawat, S. Jeschke, and Ch. Brecher, Saint Louis: Elsevier, 2016, s. 287-304Kapitel i bok, del av antologi (Refereegranskat)
    Abstract [en]

    Cyber-physical systems (CPSs) are the result of the integration of connected computer systems with the physical world. They feature complex interactions that go beyond traditional communication schemes and protocols in computer systems. One distinguished feature of such complex interactions is the tight coupling between discrete and continuous interactions, captured by hybrid system models.

    Due to the complexity of CPSs, providing rigorous and model-based analysis methods and tools for verifying correctness of such systems is of the utmost importance. Model-based testing (MBT) is one such verification technique that can be used for checking the conformance of an implementation of a system to its specification (model).

    In this chapter, we first review the main concepts and techniques in MBT. Subsequently, we review the most common modeling formalisms for CPSs, with focus on hybrid system models. Subsequently, we provide a brief overview of conformance relations and conformance testing techniques for CPSs. © 2017 Elsevier Inc. All rights reserved.

  • 21.
    Afrim, Cerimi
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Norén, Joakim
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Motåtgärder vid IT-forensisk liveanalys2011Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Liveanalys är ett begrepp som i detta arbete innebär att man undersöker ett datorsystem under tiden det är igång. Detta kan göras av flera skäl, t.ex. när det är risk för att kryptering finns på systemet vilket kan aktiveras när det stängs ner. Annars är det vanligt om man vill undersöka nätverkskopplingar, aktiva processer eller andra företeelser som kan vara volatila, dvs. försvinner när systemet stängs ner. Detta arbete kommer att ha fokus på motåtgärder vid forensisk liveanalys och redogöra för olika metoder och strategier som kan användas för dessa motåtgärder. Vi har bland annat skrivit ett program som automatiskt stänger ner systemet när man sätter i ett USB-minne eller annan media. Dessa media är oftast de man har sina forensiska program på när man ska göra en liveanalys. Andra viktiga element i arbetet är användning av kryptering, tidstämplar och sabotagekod för att försvåra liveanalysen. Vår analys i ämnet visar att det är relativt enkelt att förhindra att en liveanalys kan utföras på ett tillförlitligt sätt.

  • 22.
    Agelis, Sacki
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Jacobsson, Sofia
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Jonsson, Magnus
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Alping, Arne
    Ericsson Microwave Systems, Mölndal, Sweden.
    Ligander, Per
    Ericsson Microwave Systems, Mölndal, Sweden.
    Modular interconnection system for optical PCB and backplane communication2002Ingår i: Parallel and Distributed Processing Symposium., Proceedings International, IPDPS 2002, Abstracts and CD-ROM, Los Alamitos, Calif.: IEEE Press, 2002, s. 245-250Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper presents a way of building modular systems with a powerful optical interconnection network. Each module, placed on a Printed Circuit Board (PCB), has a generic optical communication interface with a simple electronic router. Together with optical switching using micro-electromechanical system (MEMS) technology, packet switching over reconfigurable topologies is possible. The interconnection system gives the possibility to integrate electronics with optics without changing existing PCB technology. Great interest from industry is therefore expected and the cost advantages are several: reuse of module designs, module upgrades without changing the PCB, low-cost conventional PCB technology, etc. In the version described in this paper, the interconnection system has 48 bidirectional optical channels for intra-PCB communication on each board. For inter-PCB communication, a backplane with 192 bidirectional optical channels supports communication between twelve PCBs. With 2.5 Gbit/s per optical channel in each direction, the aggregated intra-PCB bit rate is 120 Gbit/s full duplex (on each PCB) while the aggregated inter-PCB bit rate is 480 Gbit/s full duplex. A case study shows the feasibility of the interconnection system in a parallel processing system for radar signal processing.

  • 23.
    Agelis, Sacki
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Jonsson, Magnus
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Optoelectronic router with a reconfigurable shuffle network based on micro-optoelectromechanical systems2004Ingår i: Journal of Optical Networking, ISSN 1536-5379, Vol. 4, nr 1, s. 1-10Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    An optoelectronic router with a shuffle exchange network is presented and enhanced by the addition of micro-optoelectromechanical systems (MOEMS) in the network to add the ability to reconfigure the shuffle network. The MOEMS described here are fully connected any-to-any crossbar switches. The added reconfigurability provides the opportunity to adapt the system to different common application characteristics. Two representative application models are described: The first has symmetric properties, and the second has asymmetric properties. The router system is simulated with the specified applications and an analysis of the results is carried out. By use of MOEMS in the optical network, and thus reconfigurability, greater than 50% increased throughput performance and decreased average packet delay are obtained for the given application. Network congestion is avoided throughout the system if reconfigurability is used.

  • 24.
    Agelis, Sacki
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Jonsson, Magnus
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Optoelectronic router with MOEMS–based reconfigurable shuffle network2004Konferensbidrag (Refereegranskat)
  • 25.
    Ahlqvist Nilsson, Petra
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Svensson Tynkkynen, Carolin
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Förslag på design av digitala knuffar för vägledning2019Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Allt fler beslut tas i samband med skärmar, bland annat på grund av den ständigt växande e-handeln. När människor tar beslut påverkas de av hur valmiljön är utformad samt av heuristikeroch fördomar, vilka är mentala genvägar. Människor influeras av heuristiker och fördomar dådet ofta är svårt för dem att ta beslut som grundas på all information som presenteras. Knuffarär ett sätt att vägleda människor till att göra specifika val utan att sätta begränsningar för derasfrihet och har företrädesvis använts i icke-digitala kontexter, men har nu även introduceratsinom informatik. För att knuffar ska kunna utvecklas och användas digitalt är det dock viktigtmed kunskap om hur människor gör val samt om den påverkan knuffar har. Även tidigareforskning om digitala knuffar efterfrågar studier om hur digitala knuffar kan designas och omderas påverkan på människors val online. Då knuffar är ett relativt nytt begrepp inom informatik, och att fler studier om ämnetefterfrågas, undersöker denna studie hur digitala knuffar kan designas för att vägledamänniskor till hållbara val på nätet. Studien utfördes med en designorienterad forskningsansatsdär digitala knuffar designades utifrån fyra olika heuristiker och fördomar. Knuffarnaapplicerades sedan på en e-handelssida och testades med hjälp av en prototyp. Processen fördesign och utvärdering av de digitala knuffarna itererades fyra eller fem gånger för attexplorativt testa olika sätt att designa knuffarna på relaterat till forskningsfrågan. Studien bidrarmed ett antal förslag för hur digitala knuffar kan designas utifrån heuristiker och fördomar medfokus på vägledning och hållbarhet.

  • 26.
    Ahlström, Tove
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Kaikkonen, Amanda
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Hur kan ett e-hälsostöd designas för att främja inre motivation till fysisk rehabilitering?2019Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    På grund av ett ökat vårdbehov är fysisk rehabilitering ett område där det finns ett växande behov för implementation av e-hälsostöd. En icke fullföljd rehabiliteringsplan kan potentiellt leda till att en patients smärtor eller besvär inte förbättras som planerat. Detta kan leda till att patienten behöver mer rehabiliteringsvård än vad som hade krävts om rehabiliteringsplanen hade fullföljts från början. Förutom att detta blir en kostnad för patienterna själva, innebär det dessutom en extra kostnad för vården. Motivation räknas som en av de främsta aspekterna att ta hänsyn till, eftersom det influerar människors förmåga och vilja att göra något. Om motivationsaspekten ignoreras vid designandet av ett digitalt stöd i ett rehabiliteringssammanhang, finns risk att designen inte innehar de funktioner som kan bli avgörande för att användaren ska använda det digitala stödet. Även om rehabiliteringspatienter förses med korrekta övningar från fysioterapeuter utför de inte sina övningar, vilket kan bero på deras brist på inre motivation. Trots detta dilemma finns idag få studier som undersöker hur ett digitalt stöd kan designas för att främja inre motivation i ett rehabiliteringssammanhang. Studien ämnade därför att undersöka hur ett digitalt stöd kan designas för att främja inre motivation i ett fysiskt rehabiliteringssammanhang. Frågeställningen undersöktes genom en designorienterad ansats. För att undersöka inre motivation konkretiseras begreppet till de tre grundläggande psykologiska behoven: autonomi, kompetens och samhörighet. Studien resulterade sedan i nio designförslag som informerade hur ett e-hälsostöd kan designas för att främja inre motivation genom att stödja de tre psykologiska behoven: autonomi, kompetens och samhörighet.

  • 27.
    Ahmed, Iftikhar
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Farooq, Muhammad
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Switched Multi-hop Priority Queued Networks-Influence of priority levels on Soft Real-time Performance2010Självständigt arbete på avancerad nivå (magisterexamen), 15 poäng / 22,5 hpStudentuppsats (Examensarbete)
    Abstract [en]

    In the last few years, the number of real-time applications has increased. These applications are sensitive and require the methods to utilize existing network capacity efficiently to meet performance requirements and achieve the maximum throughput to overcome delay, jitter and packet loss. In such cases, when the network needs to support highly interactive traffic like packet-switched voice, the network congestion is an issue that can lead to various problems. If the level of congestion is high enough, the users may not be able to complete their calls and have existing calls dropped or may experience a variety of delays that make it difficult to participate smooth conversation.

    In this paper, we investigate the effect of priority levels on soft real-time performance. We use the priority queues to help us manage the congestion, handle the interactive traffic and improve the over all performance of the system. We consider switched multi-hop network with priority queues. All the switches and end-nodes control the real-time traffic with “Earlier Deadline First” scheduling. The performance of the network is characterized in terms of the average delay, the deadline missing ratio and the throughput.

    We will analyze these parameters with both the bursty traffic and evenly distributed traffic. We will analyze different priority levels and will see how the increase in priority level increases the performance of the soft real-time system.

  • 28.
    Aichernig, Bernhard K.
    et al.
    Graz University of Technology, Graz, Austria.
    Mostowski, Wojciech
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Mousavi, Mohammad Reza
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES). Department of Informatics, University of Leicester, Leicester, UK.
    Tappler, Martin
    Graz University of Technology, Graz, Austria.
    Taromirad, Masoumeh
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Model Learning and Model-Based Testing2018Ingår i: Machine Learning for Dynamic Software Analysis: Potentials and Limits / [ed] Amel Bennaceur, Reiner Hähnle, Karl Meinke, Heidelberg: Springer, 2018, s. 74-100Konferensbidrag (Refereegranskat)
    Abstract [en]

    We present a survey of the recent research efforts in integrating model learning with model-based testing. We distinguished two strands of work in this domain, namely test-based learning (also called test-based modeling) and learning-based testing. We classify the results in terms of their underlying models, their test purpose and techniques, and their target domains. © Springer International Publishing AG

  • 29.
    Aires, Nibia
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    A guide to the Fortran programs to calculate inclusion probabilities for conditional Poisson sampling and Pareto pi ps sampling designs2004Ingår i: Computational statistics (Zeitschrift), ISSN 0943-4062, E-ISSN 1613-9658, Vol. 19, nr 3, s. 337-345Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Conditional Poisson Sampling and Pareto pips Sampling designs are sampling methods with fixed sample size and with inclusion probabilities proportional to given size measures.. Algorithms were introduced to calculate first and second exact inclusion probabilities for both schemes. Methods were also provided to adjust the parameters to get predetermined inclusion probabilities. In this paper, the Fortran procedures are introduced and documented. Moreover, guidelines are provided for their use as well as examples and the programs codes commented.

  • 30.
    Akram, Asif
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Value Creation in Digital Ecosystem – A Study of Remote Diagnostics2013Konferensbidrag (Refereegranskat)
    Abstract [en]

    The advancement of digital technologies is driving traditional product oriented businesses to move from selling product to selling solutions. In order to exploit business potentials from technology, it is necessary to understand the technological capacity and how it influences the value creation in the environment where it is deployed. I study remote diagnostics as an example of digital technology within the vehicle industry. I found that this technology provides potential to generate new value. To create this value, traditional product oriented organizations are required to create value in different way than traditional mode of creating value. In this paper, I show that how generative capacity of remote diagnostics technology creates value in digital ecosystem.

  • 31.
    Akram, Asif
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Människa och Informationsteknologi (MI-lab). University of Gothenburg, Gothenburg, Sweden.
    Value Network Transformation: Digital Service Innovation in the Vehicle Industry2016Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    Advancement in digital technology is rapidly changing the contemporary landscape of business and associated networks for manufacturing firms. Many traditional physical products are now being embedded with digital components, providing them digital capability to become digitized products. The digitization of physical products has become an important driver for digital service innovation within manufacturing industries. Such digital service innovation transforms value networks of manufacturing firms in various industries. While digitization of products and digital service innovation can be observed in many manufacturing industries, this thesis focuses on the transformation of value networks within the vehicle industry.

    This thesis is a collection of papers and a cover paper. The thesis reports from a collaborative project in the vehicle industry. The project explored new digital services for vehicles based on remote diagnostics technology. The exploration and conceptualization of digital services is investigated in a collaborative manner with participants from the vehicle industry. The results reflect that there is a paradigm shift for manufacturing firms digitizing their products, and stretching the business scope from product to solution oriented business.

    This thesis contributes to the existing literature on digital innovation with insights on the transformation of value networks in the vehicle industry. The research question addressed in this thesis is: How are value networks of manufacturing firms transformed by digital service innovation? To answer the question, this thesis conceptualizes how the value creating pattern of digitized products transforms value networks of manufacturing firms. A model is presented that reflects how the symbiotic value relationship between the digitized product and digital services transforms the roles, relationships and exchanges in the value networks of manufacturing firms. The model can serve as an analytical tool to further advance the knowledge on business aspects in digital innovation. This thesis contributes to practice by providing an understanding of how manufacturing firms can leverage value of digitized products and digital services in value networks.

  • 32.
    Akram, Asif
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Bergquist, Magnus
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS). University of Gothenburg.
    Åkesson, Maria
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Digital Visions vs. Product Practices: Understanding Tensions in Incumbent Manufacturing Firms2014Ingår i: Proceedings of the Annual Hawaii International Conference on System Sciences / [ed] Ralph H. Sprague, Jr., Los Alamitos, CA: IEEE Computer Society, 2014, s. 4516-4525Konferensbidrag (Refereegranskat)
    Abstract [en]

    Incumbent manufacturing firms face challenges when expanding their product focus with digital services. Such expansion creates tensions in organizations in the servitization process. While management visions and conceptualizes new service oriented businesses, the actual practice of implementing these service concepts is influenced by the product paradigmatic way of thinking in the organization. This dominant thinking creates tensions between business visions and business practice. We use the case of remote diagnostics services to provide insights into a manufacturing firm’s attempt to transform the dominant oriented business models into a new networked environment. We suggest that such acts that may or may not lead to transition are lingered by dominant logics related to the product focus. This indicates that firms are required to embed new logics into their existing practice in order to exploit the full potential of digital technology. © 2014 IEEE.

  • 33.
    Akram, Asif
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Människa och Informationsteknologi (MI-lab).
    Åkesson, Maria
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Människa och Informationsteknologi (MI-lab).
    Value Network Transformation By Digital Service Innovation In The Vehicle Industry2011Ingår i: Proceedings of the 15th Pacific Asia Conference on Information Systems | Pacific Asia Conference on Information Systems (PACIS), Brisbane, Australia: Association for Information Systems, 2011Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    This paper reports from preparations in an ongoing research study concerning how digital service innovation transforms value networks in the vehicle industry. The research study concerns digital services based on remote diagnostics systems. This digital service innovation in particular is of great importance since the vehicle industry has great potential to expand its business and found new and extended boundaries and relationships with other stakeholder in the networks they are attached to. Core challenges and opportunities for digital service innovation will lead us to the study of its influence on the business and innovation environment i.e. the value network. In this paper, we propose three propositions to study transformation from product oriented value networks to digital service oriented value networks.

  • 34.
    Alasjö, Alexander
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Sidokanalattack mot knappsats för elektroniskt passersystem2017Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Genom ett undersökande experiment med elektromagnetisk sidokanalattack mot en knappsats för ett kommersiellt passersystem påvisas att informationsläckage i sidokanaler är ett fortsatt aktuellt problem och hur det gör fysisk åtkomstkontroll sårbart genom avlyssning och kopiering av användaruppgifter.

    Med enkel radioutrustning kan knapptryckningar registreras och avkodas genom oönskad elektromagnetisk strålning och teoretiskt är det möjligt att genomföra avlyssningen på en längre distans med särskilt utformad antenn och anpassad mottagare.

    Rapporten diskuterar problematiken med emission security hos konsumentprodukter som i militära sammanhang benämns Tempest eller RÖS (röjande signaler) och kräver kostsamma tester för att detekteras och hanteras.

    I regelverk för EMC (elektromagnetisk kompatibilitet) behandlas elektriska apparaters och näts utstrålning och påverkan av elektromagnetiska vågor, men inte direkt hur information kan läcka från informationsteknologisk utrustning vilket denna rapport vill problematisera.

  • 35.
    Albinsson, John
    et al.
    Lund Univ, Dept Biomed Engn, S-22100 Lund, Sweden..
    Brorsson, Sofia
    Högskolan i Halmstad, Akademin för ekonomi, teknik och naturvetenskap, Rydberglaboratoriet för tillämpad naturvetenskap (RLAS).
    Rydén Ahlgren, Åsa
    Lund Univ, Dept Clin Sci, Clin Physiol & Nucl Med Unit, Malmo, Sweden..
    Cinthio, Magnus
    Lund Univ, Dept Biomed Engn, S-22100 Lund, Sweden..
    Improved tracking performance of lagrangian block-matching methodologies using block expansion in the time domain: In silico, phantom and invivo evaluations2014Ingår i: Ultrasound in Medicine and Biology, ISSN 0301-5629, E-ISSN 1879-291X, Vol. 40, nr 10, s. 2508-2520Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The aim of this study was to evaluate tracking performance when an extra reference block is added to a basic block-matching method, where the two reference blocks originate from two consecutive ultrasound frames. The use of an extra reference block was evaluated for two putative benefits: (i) an increase in tracking performance while maintaining the size of the reference blocks, evaluated using in silico and phantom cine loops; (ii) a reduction in the size of the reference blocks while maintaining the tracking performance, evaluated using in vivo cine loops of the common carotid artery where the longitudinal movement of the wall was estimated. The results indicated that tracking accuracy improved (mean - 48%, p<0.005 [in silico]; mean - 43%, p<0.01 [phantom]), and there was a reduction in size of the reference blocks while maintaining tracking performance (mean - 19%, p<0.01 [in vivo]). This novel method will facilitate further exploration of the longitudinal movement of the arterial wall. (C) 2014 World Federation for Ultrasound in Medicine & Biology.

  • 36.
    Aldén, Victoria
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Gunnarsson, Ebba
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Användningen av Robotic Process Automation i kommunala förvaltningars beslutsstödsprocesser: En studie om vilka konsekvenser som kan uppstå genom användningen av RPA och påverkan på kommunala beslutsstödsprocesser för försörjningsstöd2019Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Inom offentliga organisationer har det tidigare inte funnits en lag som tillåtit automatiserat beslutsstöd, det var först år 2018 som lagen förändrades. Tidigare forskning har fokuserat på automation inom privata näringslivet, vilket skapat en brist på forskning för offentliga organisationer. Efter lagförändringen har socialförvaltningar börjat automatisera beslutsunderlaget för försörjningsstöd i sina beslutsstödsprocesser. Automatiseringen sker genom användningen av mjukvarutekniken RPA (robotstyrd processautomation). RPA kan enbart hantera processer som är regelstyrda och strukturerade. Det tvingar socialförvaltningarna att definiera och strukturera upp sina beslutsstödsprocesser som tidigare utfördes manuellt av handläggarna. Det innefattar att konsekvenser uppstår och påverkar beslutsstödsprocessen, vilket leder fram till studiens frågeställning: Hur påverkas beslutsstödsprocessen i kommunala förvaltningar genom användningen av RPA? En kvalitativ metod har använts vid insamling av litteratur och empiri, för att kunna identifiera konsekvenserna och dess påverkan i beslutsstödsprocessen. De identifierade konsekvenserna som presenteras i studiens slutsats är uppdelade efter: Konsekvenser utifrån RPA och Konsekvenser utifrån handläggarna. Konsekvenserna som identifierats i studien har skiljt sig åt mellan de kommunala förvaltningarna, beroende på hur lagen har tolkats eller om RPA har börjat användas i kommunerna än.

  • 37.
    Alendal, Gunnar
    et al.
    NTNU, Gjøvik, Norway.
    Dyrkolbotn, Geir Olav
    NTNU, Gjøvik, Norway & Norwegian Defence Cyber Academy (NDCA), Jørstadmoen, Norway.
    Axelsson, Stefan
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Forensics acquisition – Analysis and circumvention of samsung secure boot enforced common criteria mode2018Ingår i: Digital Investigation. The International Journal of Digital Forensics and Incident Response, ISSN 1742-2876, E-ISSN 1873-202X, Vol. 24, nr Suppl., s. S60-S67Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The acquisition of data from mobile phones have been a mainstay of criminal digital forensics for a number of years now. However, this forensic acquisition is getting more and more difficult with the increasing security level and complexity of mobile phones (and other embedded devices). In addition, it is often difficult or impossible to get access to design specifications, documentation and source code. As a result, the forensic acquisition methods are also increasing in complexity, requiring an ever deeper understanding of the underlying technology and its security mechanisms. Forensic acquisition techniques are turning to more offensive solutions to bypass security mechanisms, through security vulnerabilities. Common Criteria mode is a security feature that increases the security level of Samsung devices, and thus make forensic acquisition more difficult for law enforcement. With no access to design documents or source code, we have reverse engineered how the Common Criteria mode is actually implemented and protected by Samsung's secure bootloader. We present how this security mode is enforced, security vulnerabilities therein, and how the discovered security vulnerabilities can be used to circumvent Common Criteria mode for further forensic acquisition. © 2018 The Author(s). Published by Elsevier Ltd on behalf of DFRWS.

  • 38.
    Alfredsson, Erika
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Bengtsson, Matilda
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Bluetooth-implementation för Netbiter EC3502014Självständigt arbete på grundnivå (högskoleexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    In industries today the demand for reading the state of industrial equipment and thus prevent machine breakdown, is increasing. The company HMS Industrial Networks AB has a product on the market, Netbiter EC350 that is used to read sensors and thus find out the condition of industrial equipment. By reporting scanned data to users through a cloud service, users can keep track of their equipment.

     

    When developing Netbiter EC350 a slot was made for a Bluetooth module to offer clients a wireless reading in future developments. In this project a prototype was made to show how this Bluetooth communication can be implemented.

     

    The goal of the project was to create a Bluetooth communication between a Bluetooth sensor and Netbiter EC350. A user interface was made to allow the user to read sensor values.

     

    The result of the project shows how a Bluetooth communication can be implemented to read sensors wireless and therefore it fulfills its purpose and goal. The user can find connectable Bluetooth devices, connect to a device and read measured values through a user interface.

     

    The prototype demonstrates how a Bluetooth communication with a Netbiter EC350 can be implemented and the project is therefore considered to be a good basis for future development.

  • 39.
    Ali Hamad, Rebeen
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), CAISR Centrum för tillämpade intelligenta system (IS-lab).
    Järpe, Eric
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), CAISR Centrum för tillämpade intelligenta system (IS-lab).
    Lundström, Jens
    JeCom Consulting, Halmstad, Sweden.
    Stability analysis of the t-SNE algorithm for human activity pattern data2018Konferensbidrag (Refereegranskat)
    Abstract [en]

    Health technological systems learning from and reacting on how humans behave in sensor equipped environments are today being commercialized. These systems rely on the assumptions that training data and testing data share the same feature space, and residing from the same underlying distribution - which is commonly unrealistic in real-world applications. Instead, the use of transfer learning could be considered. In order to transfer knowledge between a source and a target domain these should be mapped to a common latent feature space. In this work, the dimensionality reduction algorithm t-SNE is used to map data to a similar feature space and is further investigated through a proposed novel analysis of output stability. The proposed analysis, Normalized Linear Procrustes Analysis (NLPA) extends the existing Procrustes and Local Procrustes algorithms for aligning manifolds. The methods are tested on data reflecting human behaviour patterns from data collected in a smart home environment. Results show high partial output stability for the t-SNE algorithm for the tested input data for which NLPA is able to detect clusters which are individually aligned and compared. The results highlight the importance of understanding output stability before incorporating dimensionality reduction algorithms into further computation, e.g. for transfer learning.

  • 40.
    Ali, Hazem
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Patoary, Mohammad Nazrul Ishlam
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Design and Implementation of an Audio Codec (AMR-WB) using Dataflow Programming Language CAL in the OpenDF Environment2010Självständigt arbete på avancerad nivå (masterexamen), 30 poäng / 45 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Over the last three decades, computer architects have been able to achieve an increase in performance for single processors by, e.g., increasing clock speed, introducing cache memories and using instruction level parallelism. However, because of power consumption and heat dissipation constraints, this trend is going to cease. In recent times, hardware engineers have instead moved to new chip architectures with multiple processor cores on a single chip. With multi-core processors, applications can complete more total work than with one core alone. To take advantage of multi-core processors, we have to develop parallel applications that assign tasks to different cores. On each core, pipeline, data and task parallelization can be used to achieve higher performance. Dataflow programming languages are attractive for achieving parallelism because of their high-level, machine-independent, implicitly parallel notation and because of their fine-grain parallelism. These features are essential for obtaining effective, scalable utilization of multi-core processors.

    In this thesis work we have parallelized an existing audio codec - Adaptive Multi-Rate Wide Band (AMR-WB) - written in the C language for single core processor. The target platform is a multi-core AMR11 MP developer board. The final result of the efforts is a working AMR-WB encoder implemented in CAL and running in the OpenDF simulator. The C specification of the AMR-WB encoder was analysed with respect to dataflow and parallelism. The final implementation was developed in the CAL Actor Language, with the goal of exposing available parallelism - different dataflows - as well as removing unwanted data dependencies. Our thesis work discusses mapping techniques and guidelines that we followed and which can be used in any future work regarding mapping C based applications to CAL. We also propose solutions for some specific dependencies that were revealed in the AMR-WB encoder analysis and suggest further investigation of possible modifications to the encoder to enable more efficient implementation on a multi-core target system.

  • 41.
    Aljarbouh, Ayman
    et al.
    Centre de Recherche INRIA, Rennes, France.
    Zeng, Yingfu
    Rice University, Houston, Texas, United States.
    Duracz, Adam
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Caillaud, Benoît
    Centre de Recherche INRIA, Rennes, France.
    Taha, Walid
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES). Rice University, Houston, Texas, United States.
    Chattering-Free Simulation for Hybrid Dynamical Systems: Semantics and Prototype Implementation2016Ingår i: 2016 IEEE Intl Conference on Computational Science and Engineering (CSE) and IEEE Intl Conference on Embedded and Ubiquitous Computing (EUC) and 15th Intl Symposium on Distributed Computing and Applications for Business Engineering (DCABES) / [ed] Randall Bilof, Los Alamitos: IEEE Computer Society, 2016, s. 412-422, artikel-id 7982279Konferensbidrag (Refereegranskat)
    Abstract [en]

    Chattering is a fundamental phenomenon that is unique to hybrid systems, due to the complex interaction between discrete dynamics (in the form of discrete transitions) and continuous dynamics (in the form of time). In practice, simulating chattering hybrid systems is challenging in that simulation effectively halts near the chattering time point, as an infinite number of discrete transitions would need to be simulated. In this paper, formal conditions are provided for when the simulated models of hybrid systems display chattering behavior, and methods are proposed for avoiding chattering “on the fly” in runtime. We utilize dynamical behavior analysis to derive conditions for detecting chattering without enumeration of modes. We also present a new iterative algorithm to allow for solutions to be carried past the chattering point, and we show by a prototypical implementation how to generate the equivalent chattering-free dynamics internally by the simulator in the main simulation loop. The concepts are illustrated with examples throughout the paper. © 2016 IEEE.

  • 42.
    Alkhawaja, Abdel Rahman
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Sheibani, Hatem
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Security issues with Mobile IP2011Självständigt arbete på avancerad nivå (magisterexamen), 15 poäng / 22,5 hpStudentuppsats (Examensarbete)
    Abstract [en]

    With a rapid growth in wireless technology in recent years, Mobile IP has become very important for consumers and businesses by providing mobility based on IP addresses using several applications, which keep the employees connected with each others with critical information. In mobile IP the node can change its location by maintaining the same IP address and keep connected to the internet, which solves the issue of terminating the communication once it moves.

    Since Mobile IP uses open airwaves as a transmission medium, it is subject to the many security threats that are routed in mobile IP network .Protecting mobile IP from threats and attacks is one of the most challenging task now days. IPSec is a standard security protocol solution for TCP/IP network that provides security through Authentication, Encryption and data integrity services. Mobile IP data traffic can be secured by combining with IP Security (IPSec) protocol.

    This thesis describes Mobile IP operations, security threats, different existing methods for securing mobile IP and then IPSec standard, how it works and why IPSec is the best solution. This thesis also describes how to combine IPSec with a mobile IP to provide a solution called (SecMIP) that protects the mobile device’s communication from any threats. Finally it describes Mobile IPv6, binding update and associated security concern.

  • 43.
    Alm, Ilkoo
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Människa och Informationsteknologi (MI-lab).
    Johansson, Ingegerd
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Människa och Informationsteknologi (MI-lab).
    Cognitive aspects in visualisation of complex data2001Ingår i: CISST'2001: proceedings of the International Conference on Imaging Science, Systems, and Technology : Las Vegas, Nevada, USA, June 25-28, 2001 / [ed] Arabnia, H.R., Avalon, Athens, USA: CSREA Press, 2001, s. 633-638Konferensbidrag (Refereegranskat)
    Abstract [en]

    Information Visualization applications are dealing with fundamental difficulties related to overlap in cognitive models between designers and users, goal ambiguity, and accuracy in search strategies These difficulties are more obvious in applications aimed at reducing information overload by general users, than in applications aimed at visualising scientific data. General users have very likely quite different cognitive reference for approaching an abstract complex task, than designers. This can result in designs which can unintentionally increase information overload by users. In visualisation of scientific data the overlap of cognitive reference between specialists and designs is very likely much higher, but we need methods which can facilitate data exploration in real-time interaction. One possibility to facilitate exploration in a more or less systematic way is by means of metaphors which can support human perception in searching for patterns.

  • 44.
    Alonso-Fernandez, Fernando
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), CAISR Centrum för tillämpade intelligenta system (IS-lab).
    Bigun, Josef
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), CAISR Centrum för tillämpade intelligenta system (IS-lab).
    Eye Detection by Complex Filtering for Periocular Recognition2014Ingår i: 2nd International Workshop on Biometrics and Forensics (IWBF2014): Valletta, Malta (27-28th March 2014), Piscataway, NJ: IEEE Press, 2014, artikel-id 6914250Konferensbidrag (Refereegranskat)
    Abstract [en]

    We present a novel system to localize the eye position based on symmetry filters. By using a 2D separable filter tuned to detect circular symmetries, detection is done with a few ID convolutions. The detected eye center is used as input to our periocular algorithm based on retinotopic sampling grids and Gabor analysis of the local power spectrum. This setup is evaluated with two databases of iris data, one acquired with a close-up NIR camera, and another in visible light with a web-cam. The periocular system shows high resilience to inaccuracies in the position of the detected eye center. The density of the sampling grid can also be reduced without sacrificing too much accuracy, allowing additional computational savings. We also evaluate an iris texture matcher based on ID Log-Gabor wavelets. Despite the poorer performance of the iris matcher with the webcam database, its fusion with the periocular system results in improved performance. ©2014 IEEE.

  • 45.
    Alonso-Fernandez, Fernando
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), CAISR Centrum för tillämpade intelligenta system (IS-lab).
    Bigun, Josef
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), CAISR Centrum för tillämpade intelligenta system (IS-lab).
    Periocular Biometrics: Databases, Algorithms and Directions2016Ingår i: 2016 4th International Workshop on Biometrics and Forensics (IWBF): Proceedings : 3-4 March, 2016, Limassol, Cyprus, Piscataway, NJ: IEEE, 2016, artikel-id 7449688Konferensbidrag (Refereegranskat)
    Abstract [en]

    Periocular biometrics has been established as an independent modality due to concerns on the performance of iris or face systems in uncontrolled conditions. Periocular refers to the facial region in the eye vicinity, including eyelids, lashes and eyebrows. It is available over a wide range of acquisition distances, representing a trade-off between the whole face (which can be occluded at close distances) and the iris texture (which do not have enough resolution at long distances). Since the periocular region appears in face or iris images, it can be used also in conjunction with these modalities. Features extracted from the periocular region have been also used successfully for gender classification and ethnicity classification, and to study the impact of gender transformation or plastic surgery in the recognition performance. This paper presents a review of the state of the art in periocular biometric research, providing an insight of the most relevant issues and giving a thorough coverage of the existing literature. Future research trends are also briefly discussed. © 2016 IEEE.

  • 46.
    Alonso-Fernandez, Fernando
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), CAISR Centrum för tillämpade intelligenta system (IS-lab).
    Bigun, Josef
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), CAISR Centrum för tillämpade intelligenta system (IS-lab).
    Englund, Cristofer
    RISE Viktoria, Gothenburg, Sweden.
    Expression Recognition Using the Periocular Region: A Feasibility Study2018Ingår i: 2018 14th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS) / [ed] Gabriella Sanniti di Baja, Luigi Gallo, Kokou Yetongnon, Albert Dipanda, Modesto Castrillón-Santana & Richard Chbeir, Los Alamitos: IEEE Computer Society, 2018, s. 536-541Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper investigates the feasibility of using the periocular region for expression recognition. Most works have tried to solve this by analyzing the whole face. Periocular is the facial region in the immediate vicinity of the eye. It has the advantage of being available over a wide range of distances and under partial face occlusion, thus making it suitable for unconstrained or uncooperative scenarios. We evaluate five different image descriptors on a dataset of 1,574 images from 118 subjects. The experimental results show an average/overall accuracy of 67.0%/78.0% by fusion of several descriptors. While this accuracy is still behind that attained with full-face methods, it is noteworthy to mention that our initial approach employs only one frame to predict the expression, in contraposition to state of the art, exploiting several order more data comprising spatial-temporal data which is often not available.

  • 47.
    Alonso-Fernandez, Fernando
    et al.
    ATVS/Biometric Recognition Group, Escuela Politecnica Superior, Univ. Autonoma de Madrid, Spain.
    Bigun, Josef
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Fierrez, Julian
    ATVS/Biometric Recognition Group, Escuela Politecnica Superior, Univ. Autonoma de Madrid, Spain.
    Fronthaler, Hartwig
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Kollreider, Klaus
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Ortega-Garcia, Javier
    ATVS/Biometric Recognition Group, Escuela Politecnica Superior, Univ. Autonoma de Madrid, Spain.
    Fingerprint Recognition2009Ingår i: Guide to Biometric Reference Systems and Performance Evaluation / [ed] Dijana Petrovska-Delacrétaz, Gérard Chollet, Bernadette Dorizzi, London: Springer London, 2009, s. 51-88Kapitel i bok, del av antologi (Övrigt vetenskapligt)
    Abstract [en]

    First, an overview of the state of the art in fingerprint recognition is presented, including current issues and challenges. Fingerprint databases and evaluation campaigns, are also summarized. This is followed by the description of the BioSecure Benchmarking Framework for Fingerprints, using the NIST Fingerpint Image Software (NFIS2), the publicly available MCYT-100 database, and two evaluation protocols. Two research systems are compared within the proposed framework. The evaluated systems follow different approaches for fingerprint processing and are discussed in detail. Fusion experiments involving different combinations of the presented systems are also given. The NFIS2 software is also used to obtain the fingerprint scores for the multimodal experiments conducted within the BioSecure Multimodal Evaluation Campaign(BMEC’2007) reported in Chap.11.

  • 48.
    Alonso-Fernandez, Fernando
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), CAISR Centrum för tillämpade intelligenta system (IS-lab).
    Farrugia, Reuben
    University of Malta, Msida, Malta.
    Bigun, Josef
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), CAISR Centrum för tillämpade intelligenta system (IS-lab).
    Very Low-Resolution Iris Recognition Via Eigen-Patch Super-Resolution and Matcher Fusion2016Ingår i: 2016 IEEE 8th International Conference on Biometrics Theory, Applications and Systems (BTAS), Piscataway: IEEE, 2016, artikel-id 7791208Konferensbidrag (Refereegranskat)
    Abstract [en]

    Current research in iris recognition is moving towards enabling more relaxed acquisition conditions. This has effects on the quality of acquired images, with low resolution being a predominant issue. Here, we evaluate a super-resolution algorithm used to reconstruct iris images based on Eigen-transformation of local image patches. Each patch is reconstructed separately, allowing better quality of enhanced images by preserving local information. Contrast enhancement is used to improve the reconstruction quality, while matcher fusion has been adopted to improve iris recognition performance. We validate the system using a database of 1,872 near-infrared iris images. The presented approach is superior to bilinear or bicubic interpolation, especially at lower resolutions, and the fusion of the two systems pushes the EER to below 5% for down-sampling factors up to a image size of only 13×13.

  • 49.
    Alonso-Fernandez, Fernando
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), CAISR Centrum för tillämpade intelligenta system (IS-lab).
    Mikaelyan, Anna
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Bigun, Josef
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), CAISR Centrum för tillämpade intelligenta system (IS-lab).
    Compact Multi-scale Periocular Recognition Using SAFE Features2017Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we present a new approach for periocular recognition based on the Symmetry Assessment by Feature Expansion (SAFE) descriptor, which encodes the presence of various symmetric curve families around image key points. We use the sclera center as single key point for feature extraction, highlighting the object-like identity properties that concentrates to this unique point of the eye. As it is demonstrated, such discriminative properties can be encoded with a reduced set of symmetric curves. Experiments are done with a database of periocular images captured with a digital camera. We test our system against reference periocular features, achieving top performance with a considerably smaller feature vector (given by the use of a single key point). All the systems tested also show a nearly steady correlation between acquisition distance and performance, and they are also able to cope well when enrolment and test images are not captured at the same distance. Fusion experiments among the available systems are also provided.

  • 50.
    Aloulou, Hamdi
    et al.
    Institut Mines Telecom, Paris, France & Laboratory of Informatics, Robotics and Microelectronics, Montpellier, France.
    Abdulrazak, Bessam
    Laboratory of Informatics, Robotics and Microelectronics, Montpellier, France & University of Sherbrooke, Sherbrooke, Canada.
    Endelin, Romain
    Institut Mines Telecom, Paris, France & Laboratory of Informatics, Robotics and Microelectronics, Montpellier, France.
    Bentes, João
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), CAISR Centrum för tillämpade intelligenta system (IS-lab). Image and Pervasive Access Laboratory, Singapore, Singapore.
    Tiberghien, Thibaut
    Institut Mines Telecom, Paris, France & Image and Pervasive Access Laboratory, Singapore, Singapore.
    Bellmunt, Joaquim
    Institut Mines Telecom, Paris, France & Image and Pervasive Access Laboratory, Singapore, Singapore.
    Simplifying Installation and Maintenance of Ambient Intelligent Solutions Toward Large Scale Deployment2016Ingår i: Inclusive Smart Cities and Digital Health: 14th International Conference on Smart Homes and Health Telematics, ICOST 2016, Wuhan, China, May 25-27, 2016. Proceedings / [ed] Chang C.K., Jin H., Cao Y., Aloulou H., Mokhtari M., Chiari L., Heidelberg: Springer, 2016, s. 121-132Konferensbidrag (Refereegranskat)
    Abstract [en]

    Simplify deployment and maintenance of Ambient Intelligence solutions is important to enable large-scale deployment and maximize the use/benefit of these solutions. More mature Ambient Intelligence solutions emerge on the market as a result of an intensive investment in research. This research targets mainly the accuracy, usefulness, and usability aspects of the solutions. Still, possibility to adapt to different environments, ease of deployment and maintenance are ongoing problems of Ambient Intelligence. Existing solutions require an expert to move on-site in order to install or maintain systems. Therefore, we present in this paper our attempt to enable quick large scale deployment. We discuss lessons learned from our approach for automating the deployment process in order to be performed by ordinary people. We also introduce a solution for simplifying the monitoring and maintenance of installed systems. © Springer International Publishing Switzerland 2016.

1234567 1 - 50 av 920
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf