Ändra sökning
Avgränsa sökresultatet
1234567 101 - 150 av 941
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • 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.
  • 101.
    Bomark, Peter
    et al.
    Luleå tekniska universitet, Institutionen för teknikvetenskap och matematik, Träteknologi.
    Evertsen, Gunn
    Northern Research Institute.
    Brox, Ellen
    Northern Research Institute.
    Hirche, Johannes
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Yliräisänen-Seppänen, Pia
    Rovaniemi University of Applied Sciences.
    A prototype social learning platform for children with diabetes type 12012Ingår i: Proceeding of the 16th International Academic MindTrek Conference 2012: Envision Future Media Environments, New York: Association for Computing Machinery, Inc. , 2012, s. 211-213Konferensbidrag (Refereegranskat)
    Abstract [en]

    Children diagnosed with diabetes type 1 are bombarded with information and have a hard time understanding it all. Existing information material consists mostly ofbrochures and textbooks, giving little opportunity for testing and trial-and-error without consequences. A social platform with learning games gives the children an opportunity to experiment and find peer support, which is important for coping with a life long disease.

  • 102.
    Bomark, Peter
    et al.
    Luleå tekniska universitet, Institutionen för teknikvetenskap och matematik, Träteknik.
    Hirche, Johannes
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Hagman, Olle
    Luleå tekniska universitet, Institutionen för teknikvetenskap och matematik, Träteknik.
    Colour visualisation of real virtual timber using image quilting2015Ingår i: European Journal of Wood and Wood Products, ISSN 0018-3768, E-ISSN 1436-736X, Vol. 73, nr 6, s. 837-839Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    When presenting images of wood obtained through x-ray computed tomography to an audience inexperienced in interpreting radiological images, explaining the correspondence between mass attenuation and features of wood could be time consuming and confusing. Realistically colourised attenuation images might be a suitable option in order to facilitate understanding of the images. Mass attenuation and colour of wood does not have a simple correlation, so naive grey-scale to colour conversion does not work. This paper describes how image quilting can be used to transfer colour information from a image pair where both mass attenuation and colour is known to a target mass attenuation image. An example of this method applied on scots pine shows that it is capable of retaining the major structures of wood, such as year rings and knots. The method could allow for easier understanding of simulation studies where logs scanned using x-ray computed tomography are virtually sawn.

  • 103.
    Booth, Todd
    et al.
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Andersson, Karl
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Critical Infrastructure Network DDoS Defense, via Cognitive Learning2017Ingår i: / [ed] Pietro Manzoni, Universitat Politècnica de València, Spain, Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE), 2017Konferensbidrag (Refereegranskat)
    Abstract [en]

    Some public and private services are called part of the Critical Infrastructure (CI), which are considered as the most important services to protect the functioning of a society and the economy.  Many CIs provide services via the Internet and thus cyber-attacks can be performed remotely.  It is now very simple and free to find and download software, which automates performing cyber-attacks.  A recent example is that two teenagers, with close to no security knowledge, created an on-line business. They would run cyber-attacks (online booter service called vDOS, as reported by Brian Krebs) for a small fee. They reportedly earned over 600,000 USD in a short period of time by conducting a large number of automated DDoS cyber-attacks. Then Krebs was retaliated against, and the highest DDoS attack bandwidth ever recorded, 620 Gbps, was launched against Krebs. In this paper we show how cognitive learning can be used to significantly mitigate any effects of DDoS network attacks, against the critical infrastructure.

    Ladda ner fulltext (pdf)
    fulltext
  • 104.
    Booth, Todd
    et al.
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Andersson, Karl
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap. Luleå tekniska universitet, Institutionen för system- och rymdteknik, CDT.
    Elimination of DoS UDP Reflection Amplification Bandwidth Attacks, Protecting TCP Services2015Ingår i: Future Network Systems and Security: First International Conference, FNSS 2015, Paris, France, June 11-13, 2015, Proceedings / [ed] Robin Doss; Selwyn Piramuthu; Wei Zhou, Encyclopedia of Global Archaeology/Springer Verlag, 2015, s. 1-15Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we propose a solution to eliminate a popular type of Denial of Service (DoS) attack, which is a DoS amplification attack. Note that a DoS is a subset of of DDoS. Our solution protects servers running any number of TCP services. This paper is focused on the most popular type of DoS amplification attack, which uses the UDP protocol. Via DoS UDP amplification attacks, an attacker can send a 1 Gbps traffic stream to reflectors. The reflectors will then send up 556 times that amount (amplified traffic) to the victim’s server. So just ten PCs, each sending 10Mbps, can send 55 Gbps indirectly, via reflectors, to a victim’s server. Very few ISP customers have 55 Gpbs provisioned. Expensive and complex solutions exist. However our elimination techniques can be implemented very quickly, easily and at an extremely low cost.

  • 105.
    Booth, Todd
    et al.
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Andersson, Karl
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap. Luleå tekniska universitet, Institutionen för system- och rymdteknik, CDT.
    Network Security of Internet Services: Eliminate DDoS Reflection Amplification Attacks2015Ingår i: Journal of Internet Services and Information Security (JISIS), ISSN 2182-2069, E-ISSN 2182-2077, Vol. 5, nr 3, s. 58-79, artikel-id 5Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Our research problem is that there are a large number of successful network reflection DDoS attacks. Via a UDP Reflection Attack, an attacker can send just 1 Gb/s of payload to innocent servers, and it is these servers which then can send over 4,600 times the payload to the victim! There are very expensive and complex solutions in use today, however most all of these on premise solutions can be easily circumvented. The academic community has not adequately addressed this research problem. We have created a new Internet services network security surface attack mitigation methodology. Our novel design patterns will help organizations improve the price/performance of their anti-network reflection solution by 100 times, as compared to common on premise solutions. Our analysis and results confirm that our solution is viable. Our novel solution is based on stateless IP packet header filtering firewalls (which can be implemented mostly in hardware due to their simplicity). We have reduced and in some cases eliminated the need for researchers to even try and find new ways to filter the same traffic via more complex, software driven stateful solutions.

    Ladda ner fulltext (pdf)
    fulltext
  • 106.
    Booth, Todd
    et al.
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Andersson, Karl
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap. Luleå tekniska universitet, Centrum för säkerhet i samhälle och kritiska infrastrukturer.
    Stronger Authentication for Password Credential Internet Services2017Ingår i: Proceedings of the 2017 Third Conference on Mobile and Secure Services (MOBISECSERV) / [ed] Pascal Urien, Selwyn Piramuthu, Piscataway, NJ: IEEE conference proceedings, 2017, s. 41-45, artikel-id 7886566Konferensbidrag (Refereegranskat)
    Abstract [en]

    Most Web and other on-line service providers (”Inter- net Services”) only support legacy ID (or email) and password (ID/PW) credential authentication. However, there are numerous vulnerabilities concerning ID/PW credentials. Scholars and the industry have proposed several improved security solutions, such as MFA, however most of the Internet Services have refused to adopt these solutions. Mobile phones are much more sensitive to these vulnerabilities (so this paper focuses on mobile phones). Many users take advantage of password managers, to keep track of all their Internet Service profiles. However, the Internet Service profiles found in password managers, are normally kept on the PC or mobile phone’s disk, in an encrypted form. Our first contribution is a design guideline, whereby the Internet Service profiles never need to touch the client’s disk. Most users would benefit, if they had the ability to use MFA, to login to a legacy Internet Service, which only supports ID/PW credential authentication. Our second contribution is a design guideline, whereby users can choose, for each legacy ID/PW Internet Service, which specific MFA they wish to use. We have also presenting conceptual design guidelines, showing that both of our contributions are minor changes to existing password managers, which can be implemented easily with low overhead.

    Ladda ner fulltext (pdf)
    fulltext
  • 107.
    Boytsov, Andrey
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Context reasoning, context prediction and proactive adaptation in pervasive computing systems2011Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    The paradigm of pervasive computing aims to integrate the computing technologies in a graceful and transparent manner, and make computing solutions available anywhere and at any time. Different aspects of pervasive computing, like smart homes, smart offices, social networks, micromarketing applications, PDAs, etc. are becoming a part of everyday life. Context of pervasive computing system is any piece of information that can be of possible interest to the system. Context often includes location, time, activity, surroundings, etc. One of the core features of pervasive computing systems is context awareness – the ability to use context information to the benefit of the system. The thesis proposes a set of context prediction and situation prediction methods on top of enhanced situation awareness mechanisms. Being aware of the future context enables a pervasive computing system to choose the most efficient strategies to achieve its stated objectives and therefore a timely response to the upcoming situation can be provided. This thesis focuses on the challenges of context prediction, but in order to become really efficient and useful, context prediction approaches need to be gracefully integrated with different other aspects of reasoning about the context. This thesis proposes a novel integrated approach for proactively working with context information. In order to become efficient, context prediction should be complemented with proper acting on predicted context, i.e. proactive adaptation. The majority of current approaches to proactive adaptation solves context prediction and proactive adaptation problems in sequence. This thesis identifies the shortcomings of that approach, and proposes an alternative solution based on reinforcement learning techniques. The concept of situation provides useful generalization of context data and allows eliciting the most important information from the context. The thesis proposes, justifies and evaluates improved situation modeling methods that allow covering broader range of real-life situations of interest and efficiently reason about situation relationships. The context model defines the pervasive computing system’s understanding of its internal and external environments, and determines the input for context prediction solutions. This thesis proposes novel methods for formal verification of context and situation models that can help to build more reliable and dependable pervasive computing systems and avoid the inconsistent context awareness, situation awareness and context prediction results. The architecture of pervasive computing system integrates all the aspects of context reasoning and governs the interaction and collaboration between different context processing mechanisms. This thesis proposes, justifies and evaluates the architectural support for context prediction methods. The novel architectural solutions allow encapsulating various practical issues and challenges of pervasive computing systems and handling them on low levels of context processing, therefore, supporting the efforts for efficient context prediction and proactive adaptation.

    Ladda ner fulltext (pdf)
    FULLTEXT01
  • 108.
    Boytsov, Andrey
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Situation awareness in pervasive computing systems: reasoning, verification, prediction2013Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    The paradigm of pervasive computing aims to integrate the computing technologies in a graceful and transparent manner, and make computing solutions available anywhere and at any time. Different aspects of pervasive computing, like smart homes, smart offices, social networks, micromarketing applications, PDAs are becoming a part of everyday life.Context can be defined as information that can be of possible interest to the system. Context often includes location, time, activity, surroundings among other attributes. One of the core features of pervasive computing systems is context awareness – the ability to use context to improve the performance of the system and make its behavior more intelligent.Situation awareness is related to context awareness, and can be viewed as the highest level of context generalization. Situations allow eliciting the most important information from context. For example, situations can correspond to locations of interest, actions and locomotion of the user, environmental conditions.The thesis proposes, justifies and evaluates situation modeling methods that allow covering broad range of real-life situations of interest and reasoning efficiently about situation relationships. The thesis also addresses and contributes to learning the situations out of unlabeled data. One of the main challenges of that approach is understanding the meaning of a newly acquired situation and assigning a proper label to it. This thesis proposes methods to infer situations from unlabeled context history, as well as methods to assign proper labels to the inferred situations. This thesis proposes and evaluates novel methods for formal verification of context and situation models. Proposed formal verification significantly reduces misinterpretation and misdetection errors in situation aware systems. The proper use of verification can help building more reliable and dependable pervasive computing systems and avoid the inconsistent context awareness and situation awareness results. The thesis also proposes a set of context prediction and situation prediction methods on top of enhanced situation awareness mechanisms. Being aware of the future situations enables a pervasive computing system to choose the most efficient strategies to achieve its stated objectives and therefore a timely response to the upcoming situation can be provided. In order to become efficient, situation prediction should be complemented with proper acting on prediction results, i.e. proactive adaptation. This thesis proposes proactive adaptation solutions based on reinforcement learning techniques, in contrast to the majority of current approaches that solve situation prediction and proactive adaptation problems sequentially. This thesis contributes to situation awareness field and addresses multiple aspects of situation awareness.The proposed methods were implemented as parts of ECSTRA (Enhanced Context Spaces Theory-based Reasoning Architecture) framework. ECSTRA framework has proven to be efficient and feasible solution for real life pervasive computing systems

    Ladda ner fulltext (pdf)
    FULLTEXT01
  • 109. Boytsov, Andrey
    et al.
    Zaslavsky, Arkady
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Context prediction in pervasive computing systems: achievements and challenges2010Ingår i: Supporting real time decision-making: the role of context in decision support on the move, New York: Encyclopedia of Global Archaeology/Springer Verlag, 2010, s. 35-63Kapitel i bok, del av antologi (Övrigt vetenskapligt)
  • 110.
    Boytsov, Andrey
    et al.
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Zaslavsky, Arkady
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Correctness Analysis and Verification of Fuzzy Situations in Situation Aware Pervasive Computing Systems2013Rapport (Övrigt vetenskapligt)
    Abstract [en]

    Context awareness is one of the central features of pervasive computing systems. From pervasive computing perspective a situation can be defined as external semantic interpretation of context. Situation awareness aims to infer situations out of context. Developing situation awareness is a challenging task, which can be significantly hampered by errors during design stage. In this article we propose a novel method for verification of fuzzy situation definitions. Fuzzy logic is a powerful mechanism for reasoning in pervasive computing systems and verification of situation models is a new method of formally ensuring correctness of context awareness and situation awareness. Verification is applied at the design time to check that definitions of situations are error-free. Verification approach allows developers to rigorously specify expected relationships between situations and then formally check that definitions of situations comply with expected relationships. If an error is found, then additional task is to find counterexamples - particular context attribute values, which can cause situation awareness inconsistency. Counterexamples provide additional insight into the cause of error and help repairing situation definitions. We also discuss a method to formalize requirements, as well as propose and formally prove the novel verification algorithm for fuzzy situation models. Last, but not least, we analyze theoretical and practical complexity of the proposed solution.

    Ladda ner fulltext (pdf)
    FULLTEXT01
  • 111.
    Boytsov, Andrey
    et al.
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Zaslavsky, Arkady
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    ECSTRA: Distributed context reasoning framework for pervasive computing systems2011Ingår i: Smart Spaces and Next Generation Wired/Wireless Networking: 11th International Conference, NEW2AN 2011, and 4th Conference on Smart Spaces, ruSMART 2011, St. Petersburg, Russia, August 22-25, 2011. Proceedings / [ed] Sergey Balandin; Yevgeni Koucheryavy; Honglin Hu, Springer Science+Business Media B.V., 2011, s. 1-13Konferensbidrag (Refereegranskat)
    Abstract [en]

    Pervasive computing solutions are now being integrated into everyday life. Pervasive computing systems are deployed in homes, offices, hospitals, universities. In this work we present ECSTRA – Enhanced Context Spaces Theory-based Reasoning Architecture. ECSTRA is a context awareness and situation awareness framework that aims to provide a comprehensive solution to reason about the context from the level of sensor data to the high level situation awareness. Also ECSTRA aims to fully take into account the massively multiagent distributed nature of pervasive computing systems. In this work we discuss the architectural features of ECSTRA, situation awareness approach and collaborative context reasoning. We also address the questions of multi-agent coordination and efficient sharing of reasoning information. ECSTRA enhancements related to those problems are discussed. Evaluation of proposed features is also discussed.

  • 112.
    Boytsov, Andrey
    et al.
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Zaslavsky, Arkady
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Extending context spaces theory by proactive adaptation2010Ingår i: Smart spaces and next generation Wired/Wireless networking: third Conference on Smart Spaces, ruSMART 2010, and 10th international conference, NEW2AN 2010, St. Petersburg, Russia, August 23-25, 2010 ; proceedings / [ed] Sergey Balandin; Roman Dunaytsev; Yevgeni Koucheryavy, Encyclopedia of Global Archaeology/Springer Verlag, 2010, s. 1-12Konferensbidrag (Refereegranskat)
    Abstract [en]

    Context awareness is one of the core features of pervasive computing systems. Pervasive systems can also be improved by smart application of context prediction. This paper addresses subsequent challenge of how to act according to predicted context in order to strengthen the system. Novel reinforcement learning based architecture is proposed to overcome the drawbacks of existing approaches to proactive adaptation. Context spaces theory is used as an example of how existing context awareness systems can be enhanced to achieve proactive adaptation. This recently developed theory addresses problems related to sensors uncertainty and high-level situation reasoning and it can be enhanced to achieve efficient proactive adaptation as well. This article also discusses implementation options and possible testbed to evaluate the solutions

  • 113.
    Boytsov, Andrey
    et al.
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Zaslavsky, Arkady
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Formal verification of context and situation models in pervasive computing2013Ingår i: Pervasive and Mobile Computing, ISSN 1574-1192, E-ISSN 1873-1589, Vol. 9, nr 1, s. 98-117Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Pervasive computing is a paradigm that focuses on availability of computer resources anytime anywhere for any application and supports non-intrusive integration of computing services into everyday life. Context awareness is the core feature of pervasive computing. High-level context awareness can be enhanced by situation awareness that represents the ability to detect and reason about the real-life situations. In this article we propose, analyze and validate the formal verification method for situation definitions and demonstrate its feasibility and efficiency. Situations are often defined manually by domain experts and are, therefore, susceptible to definition inconsistencies and possible errors, which in turn can cause situation reasoning problems. The proposed method takes as an input properties of situations and dependencies among them as well as situation definitions in terms of low-level context features, and then either formally proves that the definitions do comply with the expected properties, or provides a complete set of counterexamples — context parameters that prove situation inconsistency. Evaluation and complexity analysis of the proposed approach are also presented and discussed. Examples and evaluation results demonstrate that the proposed approach can be used to verify real-life situation definitions, and detect non-obvious errors in situation specifications.

  • 114.
    Boytsov, Andrey
    et al.
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Zaslavsky, Arkady
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Formal Verification of the Context Model: Enhanced Context Spaces Theory Approach2011Rapport (Övrigt vetenskapligt)
    Abstract [en]

    Pervasive computing is a paradigm that focuses on availability and non-intrusive integration of computing services into everyday life. Context awareness is the basic principle of pervasive computing. The important part of high-level context awareness is situation awareness – the ability to detect and reason about the real-life situations. The specifications of situations are often carried out manually by the experts. Therefore, the specification errors can be introduced. The specification errors cause the situation reasoning problems and context model inconsistency. In this article we propose and analyze the approach for formal verification of the situation definitions. Our solution uses as an input the situation specification in terms of low-level context features and the properties under verification, and then either formally proves that the specifications do comply with the expected property, or provide all possible counterexamples – the context conditions that will lead to situation awareness inconsistency. Evaluation and the complexity analysis of the proposed approach are also discussed.

    Ladda ner fulltext (pdf)
    FULLTEXT01
  • 115.
    Boytsov, Andrey
    et al.
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Zaslavsky, Arkady
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    From sensory data to situation awareness: enhanced context spaces theory approach2011Ingår i: Ninth International Conference on Dependable, Autonomic and Secure Computing (DASC), Piscataway, NJ: IEEE Communications Society, 2011, s. 207-214Konferensbidrag (Refereegranskat)
    Abstract [en]

    High-level context awareness can be significantly improved by the recognition of real-life situations. The theory of context spaces is a context awareness approach that uses spatial metaphors to provide integrated mechanisms for both low-level and high-level context awareness and situation awareness. Taking context spaces theory situation awareness as a baseline, we propose and analyze the enhanced situation awareness techniques, which allow us to reason about broad class of real-life situations. We also improve reasoning about the relationships between situations, and discuss how it relates to newly proposed situation awareness approaches. Practical evaluation of the results is also discussed.

  • 116.
    Boytsov, Andrey
    et al.
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Zaslavsky, Arkady
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Abdallah, Zahraa
    Caulfield School of Information Technology, Monash University.
    Where have you been?: Using location clustering and context awareness to understand places of interest2012Ingår i: Internet of things, smart spaces, and next generation networking: 12th international conference, NEW2AN 2012, and 5th Conference on Smart Spaces, ruSMART 2012, St. Petersburg, Russia, August 27-29, 2012 : proceedings / [ed] Sergey Andreev; Yevgeni Koucheryavy ; Sergey Balandin, Heidelberg: Encyclopedia of Global Archaeology/Springer Verlag, 2012, s. 51-62Konferensbidrag (Refereegranskat)
    Abstract [en]

    Mobile devices have access to multiple sources of location data, but at any particular time often only a fraction of the location information sources is available. Fusion of location information can provide reliable real-time location awareness on the mobile phone. In this paper we propose and evaluate a novel approach to detecting the places of interest based on density-based clustering. We address both extracting the information about relevant places from the combined location information, and detecting the visits to known places in the real time. In this paper we also propose and evaluate ContReMAR application - an application for mobile context and location awareness. We use Nokia MDC dataset to evaluate our findings, find the proper configuration of clustering algorithm and refine various aspects of place detection

  • 117.
    Boytsov, Andrey
    et al.
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Zaslavsky, Arkady
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Synnes, Kåre
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Extending context spaces theory by predicting run-time context2009Ingår i: Smart Spaces and Next Generation Wired/Wireless Networking: 9th International Conference, NEW2AN 2009 and Second Conference on Smart Spaces, ruSMART 2009, St. Petersburg, Russia, September 15-18, 2009. Proceedings / [ed] Sergey Balandin; Dmitri Moltchanev; Yevgeni Koucheryavy, Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2009, s. 8-21Konferensbidrag (Refereegranskat)
    Abstract [en]

    Context awareness and prediction are important for pervasive computing systems. The recently developed theory of context spaces addresses problems related to sensor data uncertainty and high-level situation reasoning. This paper proposes and discusses componentized context prediction algorithms and thus extends the context spaces theory. This paper focuses on two questions: how to plug-in appropriate context prediction techniques, including Markov chains, Bayesian reasoning and sequence predictors, to the context spaces theory and how to estimate the efficiency of those techniques. The paper also proposes and presents a testbed for testing a variety of context prediction methods. The results and ongoing implementation are also discussed.

  • 118.
    Brihage, Filip
    Luleå tekniska universitet, Institutionen för konst, kommunikation och lärande, Medier, ljudteknik och teater.
    Comparison between binaural reproduction methods for auditory distance perception in virtual reality2019Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    In recent years, virtual reality (VR) has become more common within the media industry and with its increasing popularity, spatial audio reproduction methods such as ambisonics have got more attention. But how humans perceive auditory events in VR is an ongoing research topic and there is a need for keep evaluating the reproduction methods used for it.

    Even though humans’ auditory distance perception in natural and laboratory conditions has been investigated in many previous studies, little has been made in VR environments. Thus, there is a need for keep investigating how humans estimate sound source distances in VR and which recording techniques that results in most accurate estimations.

    This study aimed to investigate human’s accuracy in sound source distance estimations in VR, when sound sources have been recorded with an artificial head or first-order ambisonic (FOA) microphone. Three different reproductions methods were used in the study: artificial head, FOA-tracked binaural and FOA-static binaural. In a VR environment, twenty-three subjects were asked to position a virtual loudspeaker at the same position as a sound source. The results showed no significant differences between the three reproduction methods. In the results it was also shown that the subjects clearly overestimated the sound source distances. A possible reason is that the subjects underestimated the size of the virtual environment.                      

    Ladda ner fulltext (pdf)
    fulltext
  • 119.
    Brox, Ellen
    et al.
    Northern Research Institute.
    Evertsen, Gunn
    Northern Research Institute.
    Bomark, Peter
    Luleå tekniska universitet, Institutionen för teknikvetenskap och matematik, Träteknologi.
    Hirche, Johannes
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Yliräisänen-Seppänen, Pia
    Rovaniemi University of Applied Sciences.
    User centric social diabetes game design for children2012Ingår i: Proceeding of the 16th International Academic MindTrek Conference 2012: Envision Future Media Environments, New York: Association for Computing Machinery, Inc. , 2012, s. 291-293Konferensbidrag (Refereegranskat)
    Abstract [en]

    Children recently diagnosed with diabetes type 1 require lots ofinformation and feel scared, alone and different. Most of theexisting educational material is on paper. Games with relevantlearning content are mainly small minigames in English. There isa need for more material with a focus on user needs, particularlylearning–by-doing material. Peer support is known to beimportant for this user group. We present a concept for a sociallearning game that is engaging and fun for diabetic children.

  • 120.
    Brännström, Robert
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Mobility management in heterogeneous access networks2007Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    This thesis proposes, describes and validates solutions to enhance mobility in heterogeneous access networks. Wireless access networks have become available almost everywhere and current research strives to make them pervasive. Users having wireless access to the Internet are driving the demand for mobile and heterogeneous solutions where services could be accessed from anywhere, any time and from any device. Future wireless connectivity will be provided through a mix of coexisting heterogeneous access network technologies. To enhance mobility in heterogeneous networks this thesis focuses on mobility management systems and connectivity of wireless multi-hop ad hoc networks to the Internet. In a wireless environment with overlapping service areas, mobile nodes need to select which gateway(s) to use to access the wireless infrastructure. The metrics used to select the point of attachment within an access technology are insufficient to compare the capacity of different technologies or multi-hop routes. This thesis proposes, describes and validates solutions to calculating network layer metrics and using them in gateway selection and handover decisions. To enable connectivity of a mobile ad hoc network (MANET) to the Internet, a gateway must bridge the wired single-hop and wireless multi-hop approaches. A MANET enables connectivity to more than one gateway at a time and combined with multihoming it provides seamless handover between subnets. The gateway selection and handover decisions are complicated by the multihoming capabilities. Connectivity to Internet services makes it important to maintain the efficient route to the gateway. It is also important to identify the location of a destination to separate the management of Internet and intra MANET destinations. This thesis proposes,describes and validates solutions to deploying multihomed mobility into MANETs and thereby handling multi-hop gateway discovery, registration of multiple gateways and tunneling to selected gateway(s). The solution maintains gateway connectivity in MANETs by installing routes to gateways using advertisements and manages route discovery based on the destination locality. Both applications with mobility awareness (e.g. SIP phones) and those without it must be supported by a mobility management system. The existence of network layer mobility management can enhance an application layer system. This thesis proposes, describes and validates deployment of a mobility management system with support of both application and network layer mobility. With wireless access networks some technologies might not support some types of applications and a single technology might not cope with all the application demands from a mobile node. Thus the control of individual traffic flows could be used to share the load on multiple access technologies and to direct flows over specified technologies. This thesis proposes, describes and validates solutions to identification and mobility management of individual traffic flows in a heterogeneous network environment. Finally this thesis proposes, describes and validates a deployment proposal of route evaluation and flow control to enable load balancing in wireless multi-hop networks.

    Ladda ner fulltext (pdf)
    FULLTEXT01
  • 121.
    Brännström, Robert
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Network-layer mobility in wireless ad hoc access networks2005Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    This thesis proposes and discusses solutions to enable network-layer mobility in wireless ad hoc access networks. The deployment of wireless access networks has made them ubiquitous and current research strives to make them pervasive. Users having wireless access to wired IP networks and the Internet are driving the demand for mobile and heterogeneous solutions. To enable all kinds of mobility in heterogeneous All-IP networks there are many issues to be solved. This thesis focuses on network-layer mobility and connectivity of wireless multi-hop ad hoc networks to the Internet. In a wireless environment with overlapping service areas, mobile hosts need to select which gateway(s) to use to access the wireless infrastructure. The signal-to-noise ratio of an access point, which is part of a wireless LAN, does not reflect the number of attached hosts or the traffic between them. The throughput of the access point could be low while the signal is strong. At the same time an access point with weaker signal could allow higher throughput. In ad hoc routing, hop count is the most common metric and the selection of a route to a gateway is affected by the same utilization problem. This could lead to a situation where a short route is used by more hosts and performing worse than a longer route serving fewer hosts. This thesis proposes and discusses solutions to calculating network-layer metrics and using them in gateway selection and handover decisions. To enable connectivity of a mobile ad hoc network (MANET) to the Internet, a gateway must support the wired single-hop and wireless multi-hop approaches. To deploy network-layer mobility in a MANET, the Mobile IP protocol needs to be adapted for the multi-hop environment. A MANET enables connectivity to more than one gateway at a time and combined with multihoming it provides seamless handover between subnets. The gateway selection and handover decisions are complicated by the multihoming capabilities. This thesis proposes and discusses solutions to deploying multihomed mobility into MANETs and thereby handling multi-hop gateway discovery, registration of multiple gateways and tunneling to selected gateway(s). Traffic patterns in wired LANs generally follow the 80/20 ratio of Internet destined vs. local traffic. The same traffic patterns generally hold true for wireless hosts. Therefore it is important to maintain the route to the gateway for the Internet destined traffic. This thesis proposes and discusses a solution to maintaining gateway connectivity in MANETs by installing routes to gateways using advertisements. Deciding the locality of a peer and setting up the forwarding route differs between single-hop and multi-hop networks. In single-hop networks a source matches the destination prefix with its own to decide what forwarding policy to use. Local traffic is sent directly to the destination with the link- layer protocol while global traffic is forwarded to a default gateway. In multi-hop networks the ad hoc routing protocol finds the route to a destination either proactively or on-demand. This thesis proposes and discusses a solution to deciding on the mobile host destination locality in a MANET.

    Ladda ner fulltext (pdf)
    FULLTEXT01
  • 122.
    Brännström, Robert
    et al.
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    E, Ruwini Kodikara
    Monash University, Melbourne, VIC.
    Åhlund, Christer
    Zaslavsky, Arkady
    Mobility management for multiple diverse applications in heterogeneous wireless networks2006Ingår i: New technologies for consumer networking and communications: eliminating boundaries: 2006 3rd IEEE Consumer Communications and Networking Conference ; CCNC 2006 ; Harrah's Las Vegas Casino & Hotel, Las Vegas, Nevada, USA, 8 - 10 January 2006, Piscataway, NJ: IEEE Communications Society, 2006, s. 818-822Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper presents a mobility management solution to support both applications who are mobility-aware and those who are not. Mobility management in heterogeneous network environments needs to address the double meaning of the IP address as an endpoint identifier and a location identifier. Application-layer mobility use a non-IP endpoint identifier (e.g. user @ realm) while network-layer mobility uses a fixed home IPaddress as endpoint identifier. The resolving of the endpoint identifier to a temporary unicast IP address as location identifier needs support from a mobility management system. This paper proposes a mobility support system that integrates the benefits of application-layer SIP mobility with network-layer MIP mobility. A cross-layer information system provides context for mobility adaptation. Context awareness enhances handover decisions, transport performance and media adoption. The network-layer mobility supports the application to locate the destination ondemand for the initial setup of the sessions. The paper includes an initial evaluation of the network-layer mobility part of the solution.

    Ladda ner fulltext (pdf)
    FULLTEXT01
  • 123.
    Brännström, Robert
    et al.
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Granlund, Daniel
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Sensor monitoring of bridge movement: a system architecture2011Ingår i: Proceedings of The 36th IEEE Conference on Local Computer Networks (LCN): 5th IEEE Workshop On User MObility and VEhicular Networks, IEEE Communications Society, 2011, s. 797-800Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper describes a sensor-based accelerometermonitoring system for bridge monitoring. A system with 18 sensors will be mounted on a 130-meter long cable-strayed bridge that is built during the summer of 2011. In order to monitor the natural frequency of the bridge (including vibrations and damping) the system should manage accelerometer readings at 50 Hz. The communication channel, sample rate requirements and number of sensors put limitations on the system architecture.

  • 124.
    Brännström, Robert
    et al.
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Åhlund, Christer
    Andersson, Karl
    Granlund, Daniel
    Multimedia flow mobility in heterogeneous networks using multihomed mobile IP2007Ingår i: Journal of Mobile Multimedia, ISSN 1550-4646, E-ISSN 1550-4654, Vol. 3, nr 3, s. 218-234Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Communication in next generation networks will use multiple access technologies, creating a heterogeneous network environment. To enable end-user terminals to move between access networks with minimal disruption, the terminals should be able to maintain multiple active network connections. Such a multihomed mobile host will experience differences in capabilities and coverage area depending on the access technologies. This paper proposes and evaluates an extension to Mobile IP enabling multihoming, regardless of the access technology. Mobility of multimedia communication in this environment should adapt to changing conditions and be based on dynamic measurements and user preferences. The proposed architecture gives opportunities for mobile multimedia applications to use multiple access networks simultaneously and the possibility to move individual flows between access networks and between user devices. Media flows are identified by destination IP address, protocol and port number. Evaluation results are presented both from a simulation study and from a real world prototype implementation using three different wireless access technologies: 802.11, UMTS and 802.16-2004.

  • 125.
    Brännström, Robert
    et al.
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Åhlund, Christer
    Kodikara, E. Ruwini
    Zaslavsky, Arkady
    Implementing global connectivity and mobility support in a wireless multi-hop ad hoc network2006Ingår i: Proceedings of the 4th Asian International Mobile Computing Conference: AMOC 2006, 2006, artikel-id 100-063Konferensbidrag (Refereegranskat)
    Abstract [en]

    Pervasive access to the Internet is driven by users who want wireless connectivity to ad hoc as well as infrastructure networks. Multi-hop wireless connectivity widens the coverage areas of access networks and enables two-way wireless traffic into previously dead-spot areas. This paper addresses network mobility issues, which are essential for roaming users who connect to the Internet through wireless access networks. We propose to support connectivity to wired infrastructure through multiple gateways with possibly different capabilities and utilization. Increased network performance can be achieved by adapting to variations in performance and coverage and by switching between gateways when beneficial. We present an efficient solution to enable ad hoc access to the Internet as well as interoperation of reactive routing protocols with Mobile IP. Our solution combines the benefits of proactive agent advertisement and reactive route discovery into a flexible multi-hop access network. We also discuss wireless network metrics that can be used for more intelligent decision making on gateway selection. The feasibility of our approach is validated by simulation and implementation.

    Ladda ner fulltext (pdf)
    fulltext
  • 126.
    Brännström, Robert
    et al.
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Åhlund, Christer
    Zaslavsky, Arkady
    Maintaining gateway connectivity in multi-hop ad hoc networks2005Ingår i: Proceedings: the IEEE Conference on Local Computer Networks, 30th anniversary : Sydney, Australia, November 15 - 17, 2005, Los Alamitos, Calif: IEEE Computer Society Press , 2005, s. 682-689Konferensbidrag (Refereegranskat)
    Abstract [en]

    The need for maintaining gateway connectivity in an ad hoc access network is vital considering the 80/20 ratio of Internet traffic. There are several proposals of how to integrate gateway forwarding strategies but they all rely on the route discovery procedure of reactive routing protocols. We propose a proactive approach to avoid the delay of the route discovery process. Mobile IP is often suggested to handle macro mobility and we use the advertisements periodically sent by the gateway to update routing tables in the ad hoc network. Since advertisements may arrive to a mobile host through multiple paths, it is important to keep track of the best path to each gateway. We demonstrate the use of a proposed dynamic metric and how to handle location of correspondent hosts. A simulation study demonstrates the usefulness and efficiency of our approach.

    Ladda ner fulltext (pdf)
    FULLTEXT01
  • 127.
    Brännström, Robert
    et al.
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Åhlund, Christer
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Zaslavsky, Arkady
    School of Computer Science & Software Engineering, Monash University, Melbourne, Australia.
    Port-based Multihomed Mobile IPv6: Load-balancing in Mobile Ad hoc Networks2007Ingår i: Proceedings of the 32nd IEEE Conference on Local Computer Networks LCN 2007, Piscataway, NJ: IEEE Communications Society, 2007, s. 269-271Konferensbidrag (Refereegranskat)
    Abstract [en]

    With today's heterogeneous access to the Internet, users will move between wired and wireless environments and between infrastructure mode and ad hoc mode of wireless communication. When a mobile node moves from an infrastructure connection and connects multihop to an Internet gateway, the performance will degrade and it may not be able to send all of its traffic via a single gateway. This highlights the need of load-balancing between Internet gateways, especially since the behavior of users today involves a multitude of parallel activities generating multiple flows. This paper proposes a solution that enables distribution of individual traffic flows via different Internet gateways instead of using one single gateway. The proposal includes extensions to Mobile IP in order to handle flow mobility bindings. The performance of the solution is verified by simulation studies.

  • 128. Burstein, F.
    et al.
    Cowie, J.
    Zaslavsky, Arkady
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Pedro, J. San
    Support for real-time decision making in mobile financial applications2008Ingår i: Handbook on Decision Support Systems 2: Variations, Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2008, s. 81-106Kapitel i bok, del av antologi (Övrigt vetenskapligt)
  • 129.
    Burstein, Frada
    et al.
    Monash University, Melbourne, VIC.
    Brézillon, PatrickUPMC.Zaslavsky, ArkadyLuleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Supporting real time decision-making: the role of context in decision support on the move2010Samlingsverk (redaktörskap) (Övrigt vetenskapligt)
  • 130.
    Burstein, Frada
    et al.
    Monash University, Caulfield East, VIC, Australia.
    Cowie, Julie
    Department of Computing Science and Mathematics, University of Stirling, Stirling, UK.
    Zaslavsky, Arkady
    Monash University, Caulfield East, VIC, Australia.
    Pedro, Jocelyn San
    Group Market Risk, National Australia Bank Limited, Melbourne, Australia.
    Support for real-time decision making in mobile financial applications2008Ingår i: Information Systems and E-Business Management, ISSN 1617-9846, E-ISSN 1617-9854, Vol. 6, nr 3, s. 257-278Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Mobile users making real-time decisions based on current information need confidence that their context has been taken into consideration in producing the system's recommendations. This chapter reviews current use of mobile technologies for context-aware real-time decision support. Specifically, it describes a framework for assessing the impact of mobility in decision making. The framework uses dynamic context model of data quality to represent uncertainties in the mobile decision-making environment. This framework can be used for developing visual interactive displays for communicating to the user relevant changes in data quality when working in mobile environments. As an illustration, this chapter proposes a real-time decision support procedure for on-the-spot assistance to the mobile consumer when choosing the best payment option to efficiently manage their budget. The proposed procedure is based on multi-attribute decision analysis, scenario reasoning, and a quality of data framework. The feasibility of the approach is demonstrated with a mobile decision-support system prototype implementation.

  • 131.
    Bähr, Matthias
    et al.
    Citysax.
    Haag, Claus
    Haag Rehatechnik GmbH & Co. KG.
    Hofstetter, Gebhard
    Sunrise Medical GmbH & Co. KG.
    Koury, Maher
    HMM Diagnostics GmbH.
    Kurz, Daniel
    Metaio GmbH.
    Winkler, Andreas
    Sophia mit P. S. Südbayern gGmbH.
    Wessig, Kerstin
    Ludwig-Maximilians-Universität, München.
    Siegrist, Monika
    Technische Unviersität München.
    Pressler, Axel
    Technische Unviersität München.
    Diewald, Stefan
    Technische Unviersität München.
    Kranz, Matthias
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Roalter, Luis
    Technische Unviersität München.
    Linner, Thomas
    Technische Unviersität München.
    Klein, Sarah
    Technische Unviersität München.
    Bock, Thomas
    Technische Unviersität München.
    PASSAge - Personalized Mobility, Assistance and Service Systems in an Ageing Society: PASSAge - Personalisierte Mobilität, Assistenz und Service Systeme in einer alternden Gesellschaft2013Ingår i: Lebensqualität im Wandel von Demografie und Technik (AAL 2013): 6. Deutschen AAL-Kongress, VDE-Verlag , 2013Konferensbidrag (Refereegranskat)
    Abstract [en]

    The demographic change in modern societies has a significant impact on the future planning of self-determined mobility and mobility means. An optimized accessibility of the means of transportation is required, as well as their connection towards buildings and residences. These connections have to be modular and compatible to the mobility means of the users. Barrier-free accessibility according to the existing norms can address these problems only partially. Broader and holistic concepts are needed here. The project PASSAge aims at the implementation of seamless mobility chains that smoothly connect private, semi-public and public space. Mobility shall be ensured by the extension of existing mobility means with user-oriented components. The project follows the approach to complement the barrier-free access and usage of public transportation with mostly electrically powered compact vehicles and micro vehicles. These have to be adopted by physical means and information technology means to residences and building structures. The goal is to develop a flexible socio-technical infrastructure with a multitude of mobility means and modular building, thus creating synergy effects. Core to this approach is the development of business models, which allow for and ensure the allocation and co-ordination of mobility services. Interfaces will be created for all compact vehicles and micro vehicles that extend their functionality both digitally and physically and thereby enable their ubiquitous connection to the envisioned services.

    Ladda ner fulltext (pdf)
    FULLTEXT01
  • 132.
    Börjesson, Mikael
    et al.
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Nilsson, Michael
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, CDT.
    Schelén, Olov
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Andersson, Karl
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Nolin, Marie
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, CDT.
    Project: Cloudberry Datacenters2014Övrigt (Övrig (populärvetenskap, debatt, mm))
  • 133.
    Cai, H.
    et al.
    School of Software, Shanghai JiaoTong University, Shanghai, China.
    Gu, Y.
    School of Software, Shanghai JiaoTong University, Shanghai, China.
    Vasilakos, Athanasios
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Xu, B.
    College of Economics and Management, Shanghai JiaoTong University, Shanghai, China.
    Zhou, J.
    School of Software, Shanghai JiaoTong University, Shanghai, China.
    Model-Driven Development Patterns for Mobile Services in Cloud of Things2018Ingår i: IEEE Transactions on Cloud Computing, ISSN 2168-7161, Vol. 6, nr 3, s. 771-784, artikel-id 7399727Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Cloud of Things (CoT) is an integration of Internet of Things (IoT) and cloud computing for intelligent and smart application especially in mobile environment. Model Driven Architecture (MDA) is used to develop Software as a Service (SaaS) so as to facilitate mobile application development by relieving developers from technical details. However, traditional service composition or mashup are somewhat unavailable due to complex relations and heterogeneous deployed environments. For the purpose of building cloud-enabled mobile applications in a configurable and adaptive way, Model-Driven Development Patterns based on semantic reasoning mechanism are provided towards CoT application development. Firstly, a meta-model covering both multi-view business elements and service components are provided for model transformation. Then, based on formal representation of models, three patterns from different tiers of Model-View-Controller (MVC) framework are used to transform business models into service component system so as to configure cloud services rapidly. Lastly, a related software platform is also provided for verification. The result shows that the platform is applicable for rapid system development by means of various service integration patterns. 

  • 134.
    Cai, Hongming
    et al.
    School of Software, Shanghai Jiao Tong University.
    Vasilakos, Athanasios
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Web of Things Data Storage2017Ingår i: Managing the Web of Things: Linking the Real World to the Web, Elsevier, 2017, s. 325-354Kapitel i bok, del av antologi (Refereegranskat)
    Abstract [en]

    With the wide spread of Web of Things (WoT) technology, massive data are generated by huge amounts of distributed sensors and different applications. WoT related applications have emerged as an important area for both engineers and researchers. As a consequence, how to acquire, integrate, store, process and use these data has become an urgent and important problem for enterprises to achieve their business goals. Based on data processing functional analysis, a framework is provided to identify the representation, management, and disposing areas of WoT data. Several associated functional modules are defined and described in terms of their key characteristics and capabilities. Then, current researches in WoT applications are organized and compared to show the state-of-the-art achievements in literature from the view of data processing process. Next, some WoT storage techniques are discussed to enable WoT applications to move into cloud platforms. Lastly, based on application requirement analysis, some future technical tendencies are also proposed.

  • 135.
    Cai, Hongming
    et al.
    School of Software, Shanghai Jiao Tong University.
    Xu, Boyi
    College of Economics and Management, Shanghai Jiao Tong University.
    Jiang, Lihong
    School of Software, Shanghai Jiao Tong University.
    Vasilakos, Athanasios
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    IoT-Based Big Data Storage Systems in Cloud Computing: Perspectives and Challenges2017Ingår i: IEEE Internet of Things Journal, ISSN 2327-4662, Vol. 4, nr 1, s. 75-87, artikel-id 7600359Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Internet of Things (IoT) related applications have emerged as an important field for both engineers and researchers, reflecting the magnitude and impact of data-related problems to be solved in contemporary business organizations especially in cloud computing. This paper first provides a functional framework that identifies the acquisition, management, processing and mining areas of IoT big data, and several associated technical modules are defined and described in terms of their key characteristics and capabilities. Then current research in IoT application is analyzed, moreover, the challenges and opportunities associated with IoT big data research are identified. We also report a study of critical IoT application publications and research topics based on related academic and industry publications. Finally, some open issues and some typical examples are given under the proposed IoT-related research framework

  • 136.
    Cao, Liang
    et al.
    Nanjing University of Posts and Telecommunications, China.
    Wang, Yufeng
    Nanjing University of Posts and Telecommunications, China.
    Zhang, Bo
    Nanjing University of Posts and Telecommunications, China.
    Jin, Qun
    Waseda University, Japan.
    Vasilakos, Athanasios
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    GCHAR: An efficient Group-based Context–aware human activity recognition on smartphone2018Ingår i: Journal of Parallel and Distributed Computing, ISSN 0743-7315, E-ISSN 1096-0848, Vol. 118, nr part-1, s. 67-80Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    With smartphones increasingly becoming ubiquitous and being equipped with various sensors, nowadays, there is a trend towards implementing HAR (Human Activity Recognition) algorithms and applications on smartphones, including health monitoring, self-managing system and fitness tracking. However, one of the main issues of the existing HAR schemes is that the classification accuracy is relatively low, and in order to improve the accuracy, high computation overhead is needed. In this paper, an efficient Group-based Context-aware classification method for human activity recognition on smartphones, GCHAR is proposed, which exploits hierarchical group-based scheme to improve the classification efficiency, and reduces the classification error through context awareness rather than the intensive computation. Specifically, GCHAR designs the two-level hierarchical classification structure, i.e., inter-group and inner-group, and utilizes the previous state and transition logic (so-called context awareness) to detect the transitions among activity groups. In comparison with other popular classifiers such as RandomTree, Bagging, J48, BayesNet, KNN and Decision Table, thorough experiments on the realistic dataset (UCI HAR repository) demonstrate that GCHAR achieves the best classification accuracy, reaching 94.1636%, and time consumption in training stage of GCHAR is four times shorter than the simple Decision Table and is decreased by 72.21% in classification stage in comparison with BayesNet.

  • 137.
    Casselgren, Johan
    et al.
    Luleå tekniska universitet, Institutionen för teknikvetenskap och matematik, Strömningslära och experimentell mekanik.
    Bodin, Ulf
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Reusable road condition information system for traffic safety and targeted maintenance2017Ingår i: IET Intelligent Transport Systems, ISSN 1751-956X, E-ISSN 1751-9578, Vol. 11, nr 4, s. 230-238Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Driver awareness of current winter road conditions (RCs) is known to affect the frequency of accidents due to sudden changes in these conditions. For example, partially icy roads that appear during autumn in northern areas typically result in collisions and ditch runs unless the drivers are generally aware of the situation. Availing motorists who drive under winter RCs of enhanced information is therefore highly desirable to increase their awareness of hazardous driving conditions. Such conditions need to be predicted ahead of time and presented to drivers before they attempt slippery road sections. Moreover, the identification of slippery RCs should quickly trigger targeted road maintenance to reduce the risk of accidents. This study presents a scalable and reusable collaborative intelligent transport system, herein referred to as an RC information system (RCIS). RCIS provides accurate RC predictions and forecasts based on RC measurements, road weather observations, and short-term weather forecasts. The prediction methods in the context of the distributed RCIS have been tested using a prototype implementation. These tests confirmed that these inputs could be combined into useful and accurate information about winter RCs that can be adapted for different types of users.

  • 138.
    Challa, Srinavi
    et al.
    Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad .
    Kumar Das, Ashok
    Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad .
    Odelu, Vanga
    Department of Computer Science and Engineering, Indian Institute of Information Technology Chittoor.
    Kumar, Neeraj
    Department of Computer Science and Engineering, Thapar University, Patiala .
    Kumari, Sari
    Department of Mathematics, Ch. Charan Singh University, Meerut .
    Khan, Muhammad Khurram
    Center of Excellence in Information Assurance, King Saud University, Riyadh.
    Vasilakos, Athanasios
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    An efficient ECC-based provably secure three-factor user authentication and key agreement protocol for wireless healthcare sensor networks2017Ingår i: Computers & electrical engineering, ISSN 0045-7906, E-ISSN 1879-0755, Vol. 69, s. 534-554Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We first show the security limitations of a recent user authentication scheme proposed for wireless healthcare sensor networks. We then present a provably secure three-factor user authentication and key agreement protocol for wireless healthcare sensor networks. The proposed scheme supports functionality features, such as dynamic sensor node addition, password as well as biometrics update, smart card revocation along with other usual features required for user authentication in wireless sensor networks. Our scheme is shown to be secure through the rigorous formal security analysis under the Real-Or-Random (ROR) model and broadly-accepted Burrows-Abadi-Needham (BAN) logic. Furthermore, the simulation through the widely-known Automated Validation of Internet Security Protocols and Applications (AVISPA) tool shows that our scheme is also secure. High security, and low communication and computation costs make our scheme more suitable for practical application in healthcare applications as compared to other related existing schemes.

  • 139.
    Channakeshava, Karthik
    et al.
    Virginia Tech, Blacksburg, Virginia.
    Phanse, Kaustubh
    DaSilva, Luiz A.
    Virginia Tech, Blacksburg, Virginia.
    Ravindran, Binoy
    Virginia Tech, Blacksburg, Virginia.
    Midkiff, Scott F.
    Virginia Tech, Blacksburg, Virginia.
    Jensen, E. Douglas
    MITRE Corporation, Bedford, MD.
    IP quality of service support for soft real-time applications2005Ingår i: Proceedings - RTN 2005, 4th Intl. Workshop on Real-Time Networks (formerly RTLIA: Palma de Mallorca, Spain, July 5, 2005 ; satellite event to ECRTS 2005, 6 - 8 July, Palma de Mallorca, Spain / [ed] Jörg Kaiser, Magdeburg: Otto-von-Guericke Univ , 2005Konferensbidrag (Refereegranskat)
    Abstract [en]

    To obtain acceptable timeliness performance for emerging large-scale distributed real-time control applications operating in large IP internetworks, a scalable quality of service (QoS) architecture is needed. In this paper, we propose a scalable QoS architecture (abbreviated as RTQoS) in support of real-time systems, one that implements real-time scheduling at end-hosts and stateless QoS in the core routers. We address challenges and explore potential benefits achieved by integrating network services with real-time systems, through the use of a network testbed. Experimental evaluation demonstrates the RTQoS architecture as a promising approach for soft real-time applications that are subject to time/utility function time constraints and utility accrual optimality criteria.

    Ladda ner fulltext (pdf)
    FULLTEXT01
  • 140.
    Chatterjee, Santanu
    et al.
    Research Center Imarat, Defence Research and Development Organization, Hyderabad 500 069, India.
    Roy, Sandip
    Department of Computer Science and Engineering Asansol Engineering College, Asansol 713 305, India.
    Kumar Das, Ashok
    Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad 500 032, India.
    Chattopadhyay, Samiran
    Department of Information Technology, Jadavpur University, Salt Lake City, Kolkata 700 098, India.
    Kumar, Neeraj
    Department of Computer Science and Engineering, Thapar University, Patiala, Punjab 147004, India.
    Vasilakos, Athanasios
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Secure Biometric-Based Authentication Schemeusing Chebyshev Chaotic Map for Multi-Server Environment2018Ingår i: IEEE Transactions on Dependable and Secure Computing, ISSN 1545-5971, E-ISSN 1941-0018, Vol. 15, nr 5, s. 824-839Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Multi-server environment is the most common scenario for a large number of enterprise class applications. In this environment, user registration at each server is not recommended. Using multi-server authentication architecture, user can manage authentication to various servers using single identity and password. We introduce a new authentication scheme for multi-server environments using Chebyshev chaotic map. In our scheme, we use the Chebyshev chaotic map and biometric verification along with password verification for authorization and access to various application servers. The proposed scheme is light-weight compared to other related schemes. We only use the Chebyshev chaotic map, cryptographic hash function and symmetric key encryption-decryption in the proposed scheme. Our scheme provides strong authentication, and also supports biometrics & password change phase by a legitimate user at any time locally, and dynamic server addition phase. We perform the formal security verification using the broadly-accepted AVISPA (Automated Validation of Internet Security Protocols and Applications) tool to show that the presented scheme is secure. In addition, we use the formal security analysis using the Burrows-Abadi-Needham (BAN) logic along with random oracle models and prove that our scheme is secure against different known attacks. High security and significantly low computation and communication costs make our scheme is very suitable for multi-server environments as compared to other existing related schemes.

  • 141.
    Chen, Feng
    et al.
    Parallel Computing Laboratory, Institute of Software Chinese Academy of Sciences, Beijing.
    Deng, Pan
    Parallel Computing Laboratory, Institute of Software Chinese Academy of Sciences, Beijing.
    Wan, Jiafu
    School of Mechanical and Automotive Engineering, South China University of Technology, Guangzhou.
    Zhang, Daqiang
    School of Software Engineering, Tongji University, Shanghai.
    Vasilakos, Athanasios
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Rong, Xiaohui
    Chinese Academy of Civil Aviation Science and Technology, Beijing.
    Data mining for the internet of things: Literature review and challenges2015Ingår i: International Journal of Distributed Sensor Networks, ISSN 1550-1329, E-ISSN 1550-1477, Vol. 2015, artikel-id 431047Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The massive data generated by the Internet of Things (IoT) are considered of high business value, and data mining algorithms can be applied to IoT to extract hidden information from data. In this paper, we give a systematic way to review data mining in knowledge view, technique view, and application view, including classification, clustering, association analysis, time series analysis and outlier analysis. And the latest application cases are also surveyed. As more and more devices connected to IoT, large volume of data should be analyzed, the latest algorithms should be modified to apply to big data. We reviewed these algorithms and discussed challenges and open research issues. At last a suggested big data mining system is proposed

  • 142.
    Chen, Jialu
    et al.
    Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China.
    Zhou, Jun
    Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China.
    Cao, Zhenfu
    Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China.
    Vasilakos, Athanasios
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap. Department of Computer Science and Technology, Fuzhou University, China.
    Dong, Xiaolei
    Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China..
    Choo, Kim-Kwang Raymond
    Department of Information Systems and Cyber Security, University of Texas at San Antonio, San Antonio, TX, USA.
    Lightweight Privacy-preserving Training and Evaluation for Discretized Neural Networks2020Ingår i: IEEE Internet of Things Journal, ISSN 2327-4662, Vol. 7, nr 4, s. 2663-2678Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Machine learning, particularly the neural network, is extensively exploited in dizzying applications. In order to reduce the burden of computing for resource-constrained clients, a large number of historical private datasets are required to be outsourced to the semi-trusted or malicious cloud for model training and evaluation. To achieve privacy preservation, most of the existing work either exploited the technique of public key fully homomorphic encryption (FHE) resulting in considerable computational cost and ciphertext expansion, or secure multiparty computation (SMC) requiring multiple rounds of interactions between user and cloud. To address these issues, in this paper, a lightweight privacy-preserving model training and evaluation scheme LPTE for discretized neural networks is proposed. Firstly, we put forward an efficient single key fully homomorphic data encapsulation mechanism (SFH-DEM) without exploiting public key FHE. Based on SFH-DEM, a series of atomic calculations over the encrypted domain including multivariate polynomial, nonlinear activation function, gradient function and maximum operations are devised as building blocks. Furthermore, a lightweight privacy-preserving model training and evaluation scheme LPTE for discretized neural networks is proposed, which can also be extended to convolutional neural network. Finally, we give the formal security proofs for dataset privacy, model training privacy and model evaluation privacy under the semi-honest environment and implement the experiment on real dataset MNIST for recognizing handwritten numbers in discretized neural network to demonstrate the high efficiency and accuracy of our proposed LPTE.

  • 143.
    Chen, Lin
    et al.
    Laboratorie Recherche Informatique (LRI-CNRS UMR 8623), Université Paris-Sud.
    Li, Yong
    Department of Electronic Engineering, Tsinghua University, Bejing.
    Vasilakos, Athanasios
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Oblivious Neighbor Discovery for Wireless Devices with Directional Antennas2016Ingår i: IEEE INFOCOM 2016: The 35th Annual IEEE International Conference on Computer Communications, San Francisco, 10-14 April 2016, Piscataway, NJ: IEEE Communications Society, 2016, artikel-id 7524570Konferensbidrag (Refereegranskat)
    Abstract [en]

    Neighbor discovery, the process of discovering all neighbors in a device's communication range, is one of the bootstrapping networking primitives of paramount importance and is particularly challenging when devices have directional antennas instead of omni-directional ones. In this paper, we study the following fundamental problem which we term as oblivious neighbor discovery: How can neighbor nodes with heterogeneous antenna configurations and without clock synchronization discover each other within a bounded delay in a fully decentralised manner without any prior coordination? We first establish a theoretical framework on oblivious neighbor discovery and establish the performance bound of any neighbor discovery protocol achieving oblivious discovery. Guided by the theoretical results, we then design an oblivious neighbor discovery protocol and prove that it achieves guaranteed oblivious discovery with order-minimal worst-case discovery delay in the asynchronous and heterogeneous environment. We further demonstrate how our protocol can be configured to achieve a desired trade-off between average and worst-case performance

  • 144.
    Chen, Lin
    et al.
    Laboratory Recherche Informatique (LRI-CNRS UMR 8623), Université Paris-Sud.
    Li, Yong
    Department of Electronic Engineering, Tsinghua University, Bejing.
    Vasilakos, Athanasios V.
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    On Oblivious Neighbor Discovery in Distributed Wireless Networks With Directional Antennas: Theoretical Foundation and Algorithm Design2017Ingår i: IEEE/ACM Transactions on Networking, ISSN 1063-6692, E-ISSN 1558-2566, Vol. 25, nr 4, s. 1982-1993Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Neighbor discovery, one of the most fundamental bootstrapping networking primitives, is particularly challenging in decentralized wireless networks where devices have directional antennas. In this paper, we study the following fundamental problem, which we term oblivious neighbor discovery: How can neighbor nodes with heterogeneous antenna configurations discover each other within a bounded delay in a fully decentralised manner without any prior coordination or synchronisation? We establish a theoretical framework on the oblivious neighbor discovery and the performance bound of any neighbor discovery algorithm achieving oblivious discovery. Guided by the theoretical results, we then devise an oblivious neighbor discovery algorithm, which achieves guaranteed oblivious discovery with order-minimal worst case discovery delay in the asynchronous and heterogeneous environment. We further demonstrate how our algorithm can be configured to achieve a desired tradeoff between average and worst case performance.

  • 145.
    Chen, Yifan
    et al.
    Southern University of Science and Technology.
    Nakano, Tadashi
    Osaka University.
    Kosmas, Panagiotis
    King’s College London.
    Yuen, Chau
    Singapore University of Technology and Design.
    Vasilakos, Athanasios
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Asvial, Muhamad
    University of Indonesia.
    Green Touchable Nanorobotic Sensor Networks2016Ingår i: IEEE Communications Magazine, ISSN 0163-6804, E-ISSN 1558-1896, Vol. 54, nr 11, s. 136-142Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Recent advancements in biological nanomachineshave motivated the research on nanoroboticsensor networks (NSNs), where thenanorobots are green (i.e., biocompatible andbiodegradable) and touchable (i.e., externallycontrollable and continuously trackable). In theformer aspect, NSNs will dissolve in an aqueousenvironment after finishing designated tasksand are harmless to the environment. In the latteraspect, NSNs employ cross-scale interfacesto interconnect the in vivo environment and itsexternal environment. Specifically, the in-messagingand out-messaging interfaces for nanorobotsto interact with a macro-unit are defined.The propagation and transient characteristicsof nanorobots are described based on the existingexperimental results. Furthermore, planningof nanorobot paths is discussed by taking intoaccount the effectiveness of region-of-interestdetection and the period of surveillance. Finally,a case study on how NSNs may be applied tomicrowave breast cancer detection is presented

  • 146.
    Cheng, Jie
    et al.
    Shannon Cognitive Computing Laboratory, Huawei Technologies Company, China.
    Liu, Yaning
    Harbin Institute of Technology Shenzhen Graduate School, China.
    Ye, Qiang
    University of Prince Edward Island, Charlottetown, Canada.
    Du, Hongwei
    Harbin Institute of Technology Shenzhen Graduate School, China.
    Vasilakos, Athanasios V.
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    DISCS: A Distributed Coordinate System Based on Robust Nonnegative Matrix Completion2017Ingår i: IEEE/ACM Transactions on Networking, ISSN 1063-6692, E-ISSN 1558-2566, Vol. 25, nr 2, s. 934-947Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Many distributed applications, such as BitTorrent, need to know the distance between each pair of network hosts in order to optimize their performance. For small-scale systems, explicit measurements can be carried out to collect the distance information. For large-scale applications, this approach does not work due to the tremendous amount of measurements that have to be completed. To tackle the scalability problem, network coordinate system (NCS) was proposed to solve the scalability problem by using partial measurements to predict the unknown distances. However, the existing NCS schemes suffer seriously from either low prediction precision or unsatisfactory convergence speed. In this paper, we present a novel distributed network coordinate system (DISCS) that utilizes a limited set of distance measurements to achieve high-precision distance prediction at a fast convergence speed. Technically, DISCS employs the innovative robust nonnegative matrix completion method to improve the prediction accuracy. Through extensive experiments based on various publicly-available data sets, we found that DISCS outperforms the state-of-the-art NCS schemes in terms of prediction precision and convergence speed, which clearly shows the high usability of DISCS in real-life Internet applications.

  • 147.
    Cherkaoui, S.
    et al.
    Université de Sherbrooke.
    Brännström, Robert
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    On-Move 2011: Message from the On-Move 2011 workshop chairs2011Övrigt (Övrigt vetenskapligt)
  • 148.
    Cherkaoui, S.
    et al.
    Sherbrooke University.
    Åhlund, Christer
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Welcome message from the ON-MOVE 2010 co-chairs2011Övrigt (Övrigt vetenskapligt)
  • 149.
    Cherkaoui, Soumaya
    et al.
    Sherbrooke University.
    Andersson, Karl
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Khoukhi, Lyes
    University of Technology of Troyes.
    Sahoo, Jagruti
    South Carolina State University.
    Johansson, Dan
    Umeå universitet.
    On-Move 2017 Message from the Chairs2017Ingår i: Proceedings: 2017 IEEE 42nd Conference on Local Computer Networks Workshops, LCN Workshops 2017, Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE), 2017, s. xv-, artikel-id 8110191Konferensbidrag (Refereegranskat)
  • 150.
    Chiu, Wei-Yu
    et al.
    Department of Electrical Engineering, National Tsing Hua University, Hsinchu, Taiwan.
    Sun, Hongjian
    Department of Engineering Durham University Durham, U.K.
    Wang, Chao
    Department of Computer Science University of Exeter, Innovation Center, Exeter, U.K.
    Vasilakos, Athanasios
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Guest Editorial: Special Issue on Computational Intelligence for Smart Energy Applications to Smart Cities2019Ingår i: IEEE Transactions on Emerging Topics in Computational Intelligence, E-ISSN 2471-285X, Vol. 3, nr 3, s. 173-176Artikel i tidskrift (Övrigt vetenskapligt)
    Abstract [en]

    The papers in this special section focus on computational intelligence for smart energy applications in smart cities. By 2050, more than half the world’s population is expected to live in urban regions. This rapid expansion of population in the cities of the future will lead to increasing demands on various infrastructures; the urban economics will play a major role in national economics. Cities must be competitive by providing smart functions to support high quality of life. There is thus an urgent need to develop smart cities that possess a number of smart components. Among them, smart energy is arguably the first infrastructure to be established because almost all systems require energy to operate. Smart energy refers to energy monitoring, prediction, use or management in a smart way. In smart cities, smart energy applications include smart grids, smart mobility, and smart communications. While realizing smart energy is promising to smart cities, it involves a number of challenges. The articles in this section aim to provide in-depth CI technologies that enable smart energy applications to smart cities.

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