liu.seSök publikationer i DiVA
Ändra sökning
Avgränsa sökresultatet
45678910 301 - 350 av 496
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 301.
    Li, Huanyu
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Armiento, Rickard
    Linköpings universitet, Institutionen för fysik, kemi och biologi. Linköpings universitet, Tekniska fakulteten.
    Lambrix, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Extending Ontologies in the Nanotechnology Domain using Topic Models and Formal Topical Concept Analysis on Unstructured Text2019Ingår i: ISWC 2019 Satellites: Proceedings of the ISWC 2019 Satellite Tracks (Posters & Demonstrations, Industry, and Outrageous Ideas) co-located with 18th International Semantic Web Conference (ISWC 2019), CEUR Workshop Proceedings , 2019, s. 5-8Konferensbidrag (Refereegranskat)
    Abstract [en]

    In the data-driven workflows in the materials science domain, much of the data and knowledge is stored in different heterogeneous data sources maintained by different groups. This leads to a reduced availability of the data and poor interoperability between systems in this domain. Ontology-based techniques are an important way to reduce these problems and a number of efforts have started. In this paper, we use a phrase-based topic model approach and formal topical concept analysis on unstructured text in this domain to suggest additional concepts and axioms for the ontology that should be validated by a domain expert.

  • 302.
    Lin, Yezhi
    et al.
    Wenzhou Med Univ, Peoples R China.
    Jin, Xinyuan
    Wenzhou Univ, Peoples R China.
    Chen, Jiuqiang
    Wenzhou Med Univ, Peoples R China.
    Sodhro, Ali Hassan
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Pan, Zhifang
    Wenzhou Med Univ, Peoples R China.
    An analytic computation-driven algorithm for Decentralized Multicore Systems2019Ingår i: Future generations computer systems, ISSN 0167-739X, E-ISSN 1872-7115, Vol. 96, s. 101-110Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In the modern era, increasing numbers of cores per chip are applied for decentralized systems, but there is not any appropriate symbolic computation approach to construct multicore analytic approximation. Thus, it is essential to develop an efficient, simple and unified way for decentralized Adomian decomposition method to increase the potential speed of the multicore systems. In our paper, we present an innovative parallel algorithm of constructing analytic solutions for nonlinear differential system, which based on the Adomian-Rach double decomposition method and Rachs Adomian polynomials. Based on our algorithm, we further developed a user-friendly Python software package to construct analytic approximations of initial or boundary value problems. Finally, the scope of validity of our Python software package is illustrated by several different types of nonlinear examples. The obtained results demonstrate the effectiveness of our package by compared with exact solution and numeric method, the characteristics of each class of Adomian polynomials and the efficiency of parallel algorithm with multicore processors. We emphasis that the super-linear speedup may happens for the duration of constructing approximate solutions. So, it can be considered as a promising alternative algorithm of decentralized Adomian decomposition method for solving nonlinear problems in science and engineering. (C) 2019 Elsevier B.V. All rights reserved.

  • 303.
    Lind, Jonas
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Utveckling av internt Administrationssystem2014Självständigt arbete på grundnivå (högskoleexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Detta examensarbete är utfört åt Business Unit Ericsson Test Environment (BETE), i Linköping. BETE är den avdelning på Ericsson som är ansvarig för drift och underhåll av företagets Operation Support System (OSS). Deras administrationssystem var föråldrat och de ville att den skulle uppdateras och få nya funktioner. Informationen i den gamla databasen skulle behållas men överföras till en ny databas utan licenskostnader. Systemet behövde även en del där anställda kan hantera befintliga användare.

    Som programmeringsspråk valdes PHP för dess dynamiska möjligheter, plattformsoberoende och goda stöd för databaskopplingar. För lagring av data används en MySQL-databas eftersom den är gratis, täcker våra behov och är enkel att integrera med PHP.

    Resultatet blev en fullt funktionell version av BETEs interna administrationssytem som är klart för att tas i bruk. Denna rapport handlar om hur vi gått tillväga för att migrera databasen och förnya administrationssystemet, om vilka problem som uppstått och vilka lösningar som tagits fram.

  • 304.
    Linder, Tova
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Persson, Pontus
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Forsberg, Anton
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Danielsson, Jakob
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Carlsson, Niklas
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    On Using Crowd-sourced Network Measurements for Performance Prediction2016Ingår i: Proc. IEEE/IFIP Wireless On-demand Network Systems and Services Conference (IEEE/IFIP WONS), Cortina d'Ampezzo, Italy, Jan. 2016., IEEE Computer Society Digital Library, 2016, s. 1-8Konferensbidrag (Refereegranskat)
    Abstract [en]

    Geo-location-based bandwidth prediction together with careful download scheduling for mobile clients can be used to minimize download times, reduce energy usage, and improve streaming performance. Although crowd-sourced measurements provide an important prediction tool, little is known about the prediction accuracy and improvements such datasets can provide. In this paper we use a large-scale crowd-sourced dataset from Bredbandskollen, Sweden's primary speedtest service, to evaluate the prediction accuracy and achievable performance improvements with such data. We first present a scalable performance map methodology that allows fast insertion/retrieval of geo-sparse measurements, and use this methodology to characterize the Bredbandskollen usage. Second, we analyze the bandwidth variations and predictability of the download speeds observed within and across different locations, when accounting for various factors. Third, we evaluate the relative performance improvements achievable by users leveraging different subsets of measurements (capturing effects of limited sharing or filtering based on operator, network technology, or both) when predicting opportune locations to perform downloads. Our results are encouraging for both centralized and peer-to-peer performance map solutions. For example, most measurements are done in locations with many measurements and good prediction accuracy, and further improvements are possible through filtering (e.g., based on operator and technology) or limited information sharing.

  • 305.
    Lindström, Per
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Deep Imitation Learning on Spatio-Temporal Data with Multiple Adversarial Agents Applied on Soccer2019Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Recently, the availability of high quality and high resolution spatio-temporal data has increased for many sports. This enabled deep analysis of player behaviour and game strategy. This thesis investigates the assumption that game strategy is latent information in tracking data from soccer games and the possibility of modelling player behaviour with deep imitation learning. A possible application would be to perform counterfactual analysis, and switch an observed player in a real sequence, with a simulated player to asses alternative scenarios.

    An imitation learning application is implemented using recurrent neural networks. It is shown that the application is able to learn individual player behaviour and perform rollouts on previously unseen sequences.

  • 306.
    Liu, Qiang
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Dealing with Missing Mappings and Structure in a Network of Ontologies2011Licentiatavhandling, monografi (Övrigt vetenskapligt)
    Abstract [en]

    With the popularity of the World Wide Web, a large amount of data is generated and made available through the Internet everyday. To integrate and query this huge amount of heterogeneous data, the vision of Semantic Web has been recognized as a possible solution. One key technology for the Semantic Web is ontologies. Many ontologies have been developed in recent years. Meanwhile, due to the demand of applications using multiple ontologies,  mappings between entities of these ontologies are generated as well, which leads to the generation of ontology networks consisting of ontologies and mappings between these ontologies. However, neither developing ontologies nor finding mappings between ontologies is an easy task. It may happen that the ontologies are not consistent or complete, or the mappings between these ontologies are not correct or complete, or the resulting ontology network is not consistent. This may lead to problems when they are used in semantically-enabled applications.

    In this thesis, we address two issues relevant to the quality of the mappings and the structure in the ontology network. The first issue deals with the missing mappings between networked ontologies. Assuming existing mappings between ontologies are correct, we investigate whether and how to use these existing mappings, to find more mappings between ontologies. We propose and test several strategies of using the given correct mappings to align ontologies. The second issue deals with the missing structure, in particular missing is-a relations, in networked ontologies. Based on the assumption that missing is-a relations are a kind of modeling defects, we propose an ontology debugging approach to tackle this issue. We develop an algorithm for detecting missing is-a relations in ontologies, as well as algorithms which assist the user in repairing by generating and recommending possible ways of repairing and executing the repairing. Based on this approach, we develop a system and test its use and performance.

  • 307.
    Liu, Qiang
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Lambrix, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    A system for debugging missing is-a structure in networked ontologies2010Ingår i: Data Integration in the Life Sciences 7th International Conference, DILS 2010, Gothenburg, Sweden, August 25-27, 2010. Proceedings / [ed] Patrick Lambrix and Graham Kemp, Springer Berlin/Heidelberg, 2010, s. 50-57Konferensbidrag (Refereegranskat)
    Abstract [en]

    Ontologies are recognized as a key technology for semantics-based integration of the many available biomedical data sources. However, developing ontologies is not an easy task and the resulting ontologies may have defects affecting the results of ontology-based data integration and retrieval. In this paper we present a system for debugging ontologies regarding an important kind of modeling defects. Our system supports a domain expert to detect and repair missing is-a structure in ontologies in a semi-automatic way. The input for our system is a set of ontologies networked by correct mappings between their terms. Our tool uses the ontologies and mappings as domain knowledge to detect missing is-a relations in these ontologies. It also assists the user in repairing the ontologies by generating and recommending possible ways of repairing and executing the chosen repairing strategy. The detection and repairing phases can be interleaved. We present our approach, an implemented system as well as an experiment with two anatomy ontologies.

  • 308.
    Liu, Qiang
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Lambrix, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Debugging the missing is-a structure of networked ontologies2010Ingår i: The Semantic Web: Research and Applications 7th Extended Semantic Web Conference, ESWC 2010, Heraklion, Crete, Greece, May 30 – June 3, 2010, Proceedings, Part II / [ed] Lora Aroyo, Grigoris Antoniou, Eero Hyvönen, Annette ten Teije, Heiner Stuckenschmidt, Liliana Cabral, Tania Tudorache, Springer Berlin/Heidelberg, 2010, s. 478-482Konferensbidrag (Refereegranskat)
    Abstract [en]

    In parallel with the proliferation of ontologies and their use in semantically-enabled applications, the issue of finding and dealing with defects in ontologies has become increasingly important. Current work mostly targets detecting and repairing semantic defects in ontologies. In our work, we focus on another kind of severe defects, modeling defects, which require domain knowledge to detect and resolve. In particular, we are interested in detecting and repairing the missing structural relations (is-a hierarchy) in the ontologies. Our goal is to develop a system, which allows a domain expert to detect and repair the structure of ontologies in a semi-automatic way.

  • 309.
    Liyanage, Madhusanka
    et al.
    University of Oulu, Finland.
    Braeken, An
    Vrije University of Brussel, Belgium.
    Delia Jurcut, Anca
    University of Coll Dublin, Ireland.
    Ylianttila, Mika
    University of Oulu, Finland.
    Gurtov, Andrei
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten. ITMO University, Russia.
    Secure communication channel architecture for Software Defined Mobile Networks2017Ingår i: Computer Networks, ISSN 1389-1286, E-ISSN 1872-7069, Vol. 114, s. 32-50Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    A Software-Defined Mobile Network (SDMN) architecture is proposed to enhance the performance, flexibility, and scalability of todays telecommunication networks. However, SDMN features such as centralized controlling, network programmability, and virtualization introduce new security challenges to telecommunication networks. In this article, we present security challenges related to SDMN communication channels (i.e., control and data channel) and propose a novel secure communication channel architecture based on Host Identity Protocol (HIP). IPsec tunneling and security gateways are widely utilized in present-day mobile networks to secure backhaul communication channels. However, the utilization of legacy IPsec mechanisms in SDMNs is challenging due to limitations such as distributed control, lack of visibility, and limited scalability. The proposed architecture also utilizes IPsec tunnels to secure the SDMN communication channels by eliminating these limitations. The proposed architecture is implemented in a testbed and we analyzed its security features. The performance penalty of security due to the proposed security mechanisms is measured on both control and data channels. (C) 2017 Elsevier B.V. All rights reserved.

  • 310.
    Liyanage, Madhusanka
    et al.
    University of Oulu, Finland.
    Bux Abro, Ahmed
    VMware, CA USA.
    Ylianttila, Mika
    University of Oulu, Finland.
    Gurtov, Andrei
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten. ITMO University, Russia.
    Opportunities and Challenges of Software-Defined Mobile Networks in Network Security2016Ingår i: IEEE Security and Privacy, ISSN 1540-7993, E-ISSN 1558-4046, Vol. 14, nr 4, s. 34-44Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    To transform rigid and disparate legacy mobile networks into scalable and dynamic ecosystems, software-defined mobile network (SDMN) architecture integrates software-defined networks, network functions virtualization, and cloud computing principles. However, because SDMN architecture separates control and data planes, it can introduce new security challenges.

  • 311.
    Liyanage, Madhusanka
    et al.
    Univ Oulu, Finland.
    Ylianttila, Mika
    Univ Oulu, Finland.
    Gurtov, Andrei
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Enhancing Security, Scalability and Flexibility of Virtual Private LAN Services2017Ingår i: 2017 IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY (CIT), IEEE , 2017, s. 286-291Konferensbidrag (Refereegranskat)
    Abstract [en]

    Ethernet based VPLS (Virtual Private LAN Service) networks are now becoming attractive in many enterprise applications due to simple, protocol-independent and cost efficient operation. However, new VPLS applications demand additional requirements, such as elevated security, enhanced scalability and improved flexibility. This paper summarized the results of a thesis which focused to increase the scalability, flexibility and compatibility of secure VPLS networks. First, we propose a scalable secure flat-VPLS architecture based on Host Identity Protocol (HIP) to increase the forwarding and security plane scalability. Then, a secure hierarchical-VPLS architecture has been proposed by extending the previous proposal to achieve control plane scalability as well. To solve the compatibility issues of Spanning Tree Protocol (STP) in VPLS networks, a novel Distributed STP (DSTP) is proposed. Lastly, we propose a novel SDN (Software Defined Networking) based VPLS (SoftVPLS) architecture to overcome tunnel management limitations in legacy secure VPLS architectures. Simulation models and testbed implementations are used to verify the performance of proposed solutions.

  • 312.
    Liyanage, Madhusanka
    et al.
    Univ Oulu, Finland.
    Ylianttila, Mika
    Univ Oulu, Finland.
    Gurtov, Andrei
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Fast Transmission Mechanism for Secure VPLS Architectures2017Ingår i: 2017 IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY (CIT), IEEE , 2017, s. 192-196Konferensbidrag (Refereegranskat)
    Abstract [en]

    Ethernet based secure VPLS (Virtual Private LAN Services) networks require to establish full mesh of VPLS tunnels between the customer sites. However, the tunnel establishment between geographically distant customer sites introduces a significantly high delay to the user traffic transportation. In this article, we propose a novel fast transmission mechanism for secure VPLS architectures to reduce the waiting time before transmitting the data and the average data transmission delay between geographically distant customer sites. The performance of proposed mechanism is analyzed by using a simulation model and a testbed implementation.

  • 313.
    Liyanage, Madhusanka
    et al.
    Univ Oulu, Finland.
    Ylianttila, Mika
    Univ Oulu, Finland.
    Gurtov, Andrei
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Software Defined VPLS Architectures: Opportunities and Challenges2017Ingår i: 2017 IEEE 28TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR, AND MOBILE RADIO COMMUNICATIONS (PIMRC), IEEE , 2017Konferensbidrag (Refereegranskat)
    Abstract [en]

    Virtual Private LAN Services (VPLS) is an Ethernet based VPN (Virtual Private Network) service which provides protocol independent and high speed multipoint-to-multipoint connectivity. In this article, we discuss the possibility to use emerging networks concepts such as Software Defined Networking (SDN) and Network Function Virtualization (NFV) to improve the performance, flexibility and adaptability of VPLS networks. SDN and NFV based VPLS (SoftVPLS) architectures offer new features such as centralized control, network programmability and abstraction to improve the performance, flexibility and automation of traffic, security and network management functions for future VPLS networks.

  • 314.
    Ljung, Dennis
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Carlsson, Niklas
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Lambrix, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Player Pairs Valuation in Ice Hockey2018Ingår i: Proceedings of the 5th Workshop on Machine Learning and Data Mining for Sports Analytics: co-located with 2018 European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD 2018) / [ed] Ulf Brefeld, Jesse Davis, Jan Van Haaren, Albrecht Zimmermann, Cham: Springer, 2018, Vol. 11330, s. 82-92Konferensbidrag (Refereegranskat)
    Abstract [en]

    To overcome the shortcomings of simple metrics for evaluating player performance, recent works have introduced more advanced metrics that take into account the context of the players’ actions and perform look-ahead. However, as ice hockey is a team sport, knowing about individual ratings is not enough and coaches want to identify players that play particularly well together. In this paper we therefore extend earlier work for evaluating the performance of players to the related problem of evaluating the performance of player pairs. We experiment with data from seven NHL seasons, discuss the top pairs, and present analyses and insights based on both the absolute and relative ice time together.

  • 315.
    Lundberg, Karl Johan
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Investigating the current state of securityfor small sized web applications2012Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    It is not uncommon to read about hacker attacks in the newspaper today. The hackers are targeting governments and enterprises, and motives vary. It may be political or economic reasons, or just to gain reputation. News about smaller systems is, unsurprisingly, not as common. Does this mean that security is less relevant of smaller systems? This report investigates the threat model of smaller web applications, to answer that very question.Different attacks are described in the detail needed for explaining their threat but the intention is not to teach the reader to write secure code. The report does, however, provide the reader with a rich source of references for that purpose. After describing some of the worst threats, the general cloud threat model is analyzed. This is followed by a practical analysis of a cloud system, and the report is closed with general strategies for countering threats.The severe destruction that a successful attack may cause and the high prevalence of those attacks motivates some security practices to be performed whenever software is produced. Attacks against smaller companies are more common now than ever before

  • 316.
    M Pena, Jose
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Every LWF and AMP Chain Graph Originates from a Set of Causal Models2015Ingår i: SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, ECSQARU 2015, SPRINGER-VERLAG BERLIN , 2015, Vol. 9161, s. 325-334Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper aims at justifying LWF and AMP chain graphs by showing that they do not represent arbitrary independence models. Specifically, we show that every chain graph is inclusion optimal wrt the intersection of the independence models represented by a set of directed and acyclic graphs under conditioning. This implies that the independence model represented by the chain graph can be accounted for by a set of causal models that are subject to selection bias, which in turn can be accounted for by a system that switches between different regimes or configurations.

  • 317.
    Mahanti, Aniket
    et al.
    University of Auckland, New Zealand.
    Carlsson, Niklas
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Arlitt, Martin
    University of Calgary, Canada.
    Williamson, Carey
    University of Calgary, Canada.
    Characterizing Cyberlocker Traffic Flows2012Ingår i: IEEE Conference on Local Computer Networks (LCN) 2012, IEEE , 2012, s. 410-418Konferensbidrag (Refereegranskat)
    Abstract [en]

    Cyberlockers have recently become a very popular means of distributing content. Today, cyberlocker traffic accounts for a non-negligible fraction of the total Internet traffic volume, and is forecasted to grow significantly in the future. The underlying protocol used in cyberlockers is HTTP, and increased usage of these services could drastically alter the characteristics of Web traffic. In light of the evolving nature of Web traffic, updated traffic models are required to capture this change. Despite their popularity, there has been limited work on understanding the characteristics of traffic flows originating from cyberlockers. Using a year-long trace collected from a large campus network, we present a comprehensive characterization study of cyberlocker traffic at the transport layer. We use a combination of flow-level and host-level characteristics to provide insights into the behavior of cyberlockers and their impact on networks. We also develop statistical models that capture the salient features of cyberlocker traffic. Studying the transport-layer interaction is important for analyzing reliability, congestion, flow control, and impact on other layers as well as Internet hosts. Our results can be used in developing improved traffic simulation models that can aid in capacity planning and network traffic management.

  • 318.
    Mahanti, Aniket
    et al.
    University of Calgary, Canada.
    Carlsson, Niklas
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Mahanti, Anirban
    NICTA, Eveleigh, New South Wales, Australia.
    Arlitt, Martin
    University of Calgary, Canada.
    Williamson, Carey
    University of Calgary, Canada.
    A Tale of the Tails: Power-laws in Internet Measurements2013Ingår i: IEEE Network, ISSN 0890-8044, E-ISSN 1558-156X, Vol. 27, nr 1, s. 59-64Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Power-laws are ubiquitous in the Internet and its applications. In this survey article, we provide a review of such properties in Internet measurements. First, we give definitions of power-law distributions, such as Pareto and Zipf, while also reviewing heavy tails and long tails, and discussing a well-known model for understanding power-law behaviour in computer networks. Second, we present several examples of Internet workload properties exhibiting power-law behaviour. Finally, we explore several implications of power-law in computer networks. Using examples from past and present, we review how researchers have studied and exploited power-law properties. We observe that despite the challenges posed, power-laws have been effectively leveraged by researchers to improve the design and performance of Internet-based systems.

  • 319.
    Mahanti, Aniket
    et al.
    University of Calgary, Canada.
    Carlsson, Niklas
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Williamson, Carey
    University of Calgary, Canada.
    Content Sharing Dynamics in the Global File Hosting Landscape2012Ingår i: Proc. IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2012, IEEE , 2012, s. 219-228Konferensbidrag (Refereegranskat)
    Abstract [en]

    We present a comprehensive longitudinal characterization study of the dynamics of content sharing in the global file hosting landscape. We leverage datasets collected from multiple vantage points that allow us to understand how usage of these services evolve over time and how traffic is directed into and out of these sites. We analyze the characteristics of hosted content in the public domain, and investigate the dissemination mechanisms of links. To the best of our knowledge, this is the largest detailed characterization study of the file hosting landscape from a global viewpoint.

  • 320. Mahanti, Aniket
    et al.
    Williamson, Carey
    Carlsson, Niklas
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Characterizing the File Hosting Service Ecosystem2010Ingår i: Proc. ACM CoNEXT Student Workshop (CoNEXT ’10), New York, USA: ACM , 2010, s. 3:1-3:2Konferensbidrag (Refereegranskat)
    Abstract [en]

    File Hosting Services (FHS) such as Rapidshare and Mega-upload have recently become popular. The decline of P2P file sharing has prompted various services including FHS to replace it. We propose a comprehensive multi-level characterization of the FHS ecosystem. We devise a measurement framework to collect datasets from multiple vantage points. To the best of our knowledge, this work is the first to characterize the FHS ecosystem. The work will highlight the content, usage, performance, infrastructure, and quality of service characteristics of FHS. FHS can have significant implications on Internet traffic, if these services were to supplant P2P as the dominant content sharing technology.

  • 321.
    Mahanti, Aniket
    et al.
    University of Calgary.
    Williamson, Carey
    University of Calgary.
    Carlsson, Niklas
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Arlitt, Martin
    University of Calgary.
    Mahanti, Anirban
    NICTA, Australia .
    Characterizing the file hosting ecosystem: A view from the edge2011Ingår i: Performance evaluation (Print), ISSN 0166-5316, E-ISSN 1872-745X, Vol. 68, nr 11, s. 1085-1102Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We present a comprehensive, longitudinal characterization study of the file hosting ecosystem using HTTP traces collected from a large campus network over a one-year period. We performed detailed multi-level analysis of the usage behavior, infrastructure properties, content characteristics, and user-perceived performance of the top five services in terms of traffic volume, namely RapidShare, Megaupload, zSHARE, MediaFire, and Hotfile. We carefully devised methods to identify user clickstreams in the HIP traces, including the identification of free and premium user instances, as well as the identification of content that is split into multiple pieces and downloaded using multiple transactions. Throughout this characterization, we compare and contrast these services with each other as well as with peer-to-peer file sharing and other media sharing services.

  • 322.
    Manfred, Hauswirth
    et al.
    National University of Ireland, Galway, Ireland.
    Montresor, AlbertoUniverity of Trento, Italy.Shahmehri, NahidLinköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.Klaus, WehrleRWTH Aachen, Germany.Wierzbbicki, AdamPolish-Japanese Institute of Information Technology, Poland.
    Proceedings of the Seventh International Conference on Peer-to-Peer Computing2007Proceedings (redaktörskap) (Övrigt vetenskapligt)
  • 323.
    Manzoor, Ahsan
    et al.
    Univ Oulu, Finland.
    Porambage, Pawani
    Univ Oulu, Finland.
    Liyanage, Madhsanka
    Univ Oulu, Finland.
    Ylianttila, Mika
    Univ Oulu, Finland.
    Gurtov, Andrei
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    DEMO: Mobile Relay Architecture for Low-Power IoT Devices2018Ingår i: 2018 IEEE 19TH INTERNATIONAL SYMPOSIUM ON A WORLD OF WIRELESS, MOBILE AND MULTIMEDIA NETWORKS (WOWMOM), IEEE , 2018Konferensbidrag (Refereegranskat)
    Abstract [en]

    Internet of Things (IoT) devices need pervasive and secure connections to transfer the aggregated data to the central servers located in remote clouds where the collected data further processed and stored. However, most low-power IoT devices cannot transmit the collected the data directly to such servers due the limited transmission power and range. Thus, third-party devices such as smart mobile phones are used as a relay to establish the communication link between IoT devices and the cloud server. This paper demonstrates a mobile-based relay assistance solution for secure end-to-end connectivity between low-power IoT sensors and cloud servers by using Bluetooth Low Energy (BLE) technology. The prototype implementation verifies the technical readiness of the proposed solution.

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

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

  • 325.
    Martucci, Leonardo
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Zuccato, Albin
    TeliaSonera, Stockholm, Sweden.
    Smeets, Ben
    Ericsson Research, Lund, Sweden.
    Habib, Sheikh M.
    Technische Universität at Darmstadt, Germany.
    Johansson, Thomas
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Shahmehri, Nahid
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Privacy, Security and Trust in Cloud Computing: The Perspective of the Telecommunication Industry2012Ingår i: Ubiquitous Intelligence & Computing and 9th International Conference on Autonomic & Trusted Computing (UIC/ATC), 2012, IEEE COMPUTER SOC , 2012, s. 627-632Konferensbidrag (Refereegranskat)
    Abstract [en]

    The telecommunication industry has been successful in turning the Internet into a mobile service and stimulating the creation of a new set of networked, remote services. In this paper we argue that embracing cloud computing solutions is fundamental for the telecommunication industry to remain competitive. However, there are legal, regulatory, business, market-related and technical challenges that must be considered. In this paper we list such challenges and define a set of privacy, security and trust requirements that must be taken into account before cloud computing solutions can be fully integrated and deployed by telecommunication providers.

  • 326.
    McCambridge, Jim
    et al.
    Linköpings universitet, Institutionen för medicin och hälsa. Linköpings universitet, Hälsouniversitetet. London School of Hygiene and Tropical Medicine, London, UK, England.
    Bendtsen, Marcus
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Karlsson, Nadine
    Linköpings universitet, Institutionen för medicin och hälsa, Avdelningen för samhällsmedicin. Linköpings universitet, Hälsouniversitetet.
    White, Ian R.
    Institute Public Heatlh, England .
    Bendtsen, Preben
    Linköpings universitet, Institutionen för medicin och hälsa, Avdelningen för samhällsmedicin. Linköpings universitet, Hälsouniversitetet. Östergötlands Läns Landsting, Närsjukvården i centrala Östergötland, Akutkliniken. Östergötlands Läns Landsting, Närsjukvården i västra Östergötland, Medicinska specialistkliniken .
    Alcohol assessment and feedback by e-mail for university student hazardous and harmful drinkers: study protocol for the AMADEUS-2 randomised controlled trial2013Ingår i: BMC Public Health, ISSN 1471-2458, E-ISSN 1471-2458, Vol. 13, nr 949Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Background: Alcohol is responsible for a large and growing proportion of the global burden of disease, as well as being the cause of social problems. Brief interventions are one component of comprehensive policy measures necessary to reduce these harms. Brief interventions increasingly take advantage of the Internet to reach large numbers of high risk groups such as students. The research literature on the efficacy and effectiveness of online interventions is developing rapidly. Although many studies show benefits in the form of reduced consumption, other intervention studies show no effects, for reasons that are unclear. Sweden became the first country in the world to implement a national system in which all university students are offered a brief online intervention via an e-mail. Methods/Design: This randomized controlled trial (RCT) aims to evaluate the effectiveness of this national system comprising a brief online intervention among university students who are hazardous and harmful drinkers. This study employs a conventional RCT design in which screening to determine eligibility precedes random allocation to immediate or delayed access to online intervention. The online intervention evaluated comprises three main components; assessment, normative feedback and advice on reducing drinking. Screening is confined to a single question in order to minimise assessment reactivity and to prevent contamination. Outcomes will be evaluated after 2 months, with total weekly alcohol consumption being the primary outcome measure. Invitations to participate are provided by e-mail to approximately 55,000 students in 9 Swedish universities. Discussion: This RCT evaluates routine service provision in Swedish universities via a delay in offer of intervention to the control group. It evaluates effects in the key population for whom this intervention has been designed. Study findings will inform the further development of the national service provision.

  • 327.
    McCambridge, Jim
    et al.
    London School Hyg and Trop Med, England .
    Bendtsen, Marcus
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Karlsson, Nadine
    Linköpings universitet, Institutionen för medicin och hälsa, Avdelningen för samhällsmedicin. Linköpings universitet, Hälsouniversitetet.
    White, Ian R.
    Institute Public Heatlh, England .
    Nilsen, Per
    Linköpings universitet, Institutionen för medicin och hälsa, Avdelningen för hälso- och sjukvårdsanalys. Linköpings universitet, Hälsouniversitetet.
    Bendtsen, Preben
    Linköpings universitet, Institutionen för medicin och hälsa, Avdelningen för samhällsmedicin. Linköpings universitet, Hälsouniversitetet. Östergötlands Läns Landsting, Närsjukvården i centrala Östergötland, Akutkliniken. Östergötlands Läns Landsting, Närsjukvården i västra Östergötland, Medicinska specialistkliniken .
    Alcohol assessment and feedback by email for university students: main findings from a randomised controlled trial2013Ingår i: British Journal of Psychiatry, ISSN 0007-1250, E-ISSN 1472-1465, Vol. 203, nr 5, s. 334-340Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Background less thanbrgreater than less thanbrgreater thanBrief interventions can be efficacious in changing alcohol consumption and increasingly take advantage of the internet to reach high-risk populations such as students. less thanbrgreater than less thanbrgreater thanAims less thanbrgreater than less thanbrgreater thanTo evaluate the effectiveness of a brief online intervention, controlling for the possible effects of the research process. less thanbrgreater than less thanbrgreater thanMethod less thanbrgreater than less thanbrgreater thanA three-arm parallel groups design was used to explore the magnitude of the feedback and assessment component effects. The three groups were: alcohol assessment and feedback (group 1); alcohol assessment only without feedback (group 2); and no contact, and thus neither assessment nor feedback (group 3). Outcomes were evaluated after 3 months via an invitation to participate in a brief cross-sectional lifestyle survey. The study was undertaken in two universities randomising the email addresses of all 14 910 students (the AMADEUS-1 study, trial registration: ISRCTN28328154). less thanbrgreater than less thanbrgreater thanResults less thanbrgreater than less thanbrgreater thanOverall, 52% (n=7809) of students completed follow-up, with small differences in attrition between the three groups. For each of the two primary outcomes, there was one statistically significant difference between groups, with group 1 having 3.7% fewer risky drinkers at follow-up than group 3 (P=0.006) and group 2 scoring 0.16 points lower than group 3 on the three alcohol consumption questions from the Alcohol Use Disorders Identification Test (AUDIT-C) (P = 0.039). less thanbrgreater than less thanbrgreater thanConclusions less thanbrgreater than less thanbrgreater thanThis study provides some evidence of population-level benefit attained through intervening with individual students.

  • 328.
    Meland, Per Håkon
    et al.
    SINTEF ICT Norway.
    Ardi, Shanai
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Jensen, Jostein
    SINTEF ICT Norway.
    Rios, Erkoden
    European Software Institute, Spain.
    Sanchez, Txus
    European Software Institute, Spain.
    Shahmehri, Nahid
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Tøndel, Inger Anne
    SINTEF ICT Norway.
    An architectural foundation for security model sharing and reuse2009Ingår i: ARES Workshop on Secure Software Engineering,2009, IEEE Computer Society Press , 2009, s. 823-828Konferensbidrag (Refereegranskat)
    Abstract [en]

    Within the field of software security we have yet to find efficient ways on how to learn from past mistakes and in- tegrate security as a natural part of software development. This situation can be improved by using an online reposi- tory, the SHIELDS SVRS, that facilitates fast and easy inter- change of security artefacts between security experts, soft- ware developers and their assisting tools. Such security artefacts are embedded in or represented as security mod- els containing the needed information to detect, remove and prevent vulnerabilities in software, independent of the ap- plied development process. The purpose of this paper is to explain the main reference architecture description of the repository and the more general tool stereotypes that can communicate with it.

  • 329.
    Mitra, Siddharth
    et al.
    Indian Institute Technology Delhi.
    Agrawal, Mayank
    Indian Institute Technology Delhi.
    Yadav, Amit
    Indian Institute Technology Delhi.
    Carlsson, Niklas
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Eager, Derek
    University of Saskatchewan.
    Mahanti, Anirban
    NICTA.
    Characterizing Web-Based Video Sharing Workloads2011Ingår i: ACM TRANSACTIONS ON THE WEB, ISSN 1559-1131, Vol. 5, nr 2Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Video sharing services that allow ordinary Web users to upload video clips of their choice and watch video clips uploaded by others have recently become very popular. This article identifies invariants in video sharing workloads, through comparison of the workload characteristics of four popular video sharing services. Our traces contain metadata on approximately 1.8 million videos which together have been viewed approximately 6 billion times. Using these traces, we study the similarities and differences in use of several Web 2.0 features such as ratings, comments, favorites, and propensity of uploading content. In general, we find that active contribution, such as video uploading and rating of videos, is much less prevalent than passive use. While uploaders in general are skewed with respect to the number of videos they upload, the fraction of multi-time uploaders is found to differ by a factor of two between two of the sites. The distributions of lifetime measures of video popularity are found to have heavy-tailed forms that are similar across the four sites. Finally, we consider implications for system design of the identified invariants. To gain further insight into caching in video sharing systems, and the relevance to caching of lifetime popularity measures, we gathered an additional dataset tracking views to a set of approximately 1.3 million videos from one of the services, over a twelve-week period. We find that lifetime popularity measures have some relevance for large cache (hot set) sizes (i.e., a hot set defined according to one of these measures is indeed relatively "hot"), but that this relevance substantially decreases as cache size decreases, owing to churn in video popularity.

  • 330.
    Moghadasin, Babak
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    An Approach on Learning Multivariate Regression Chain Graphs from Data2013Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    The necessity of modeling is vital for the purpose of reasoning and diagnosing in complex systems, since the human mind might sometimes have a limited capacity and an inability to be objective. The chain graph (CG) class is a powerful and robust tool for modeling real-world applications. It is a type of probabilistic graphical models (PGM) and has multiple interpretations. Each of these interpretations has a distinct Markov property. This thesis deals with the multivariate regression chain graph (MVR-CG) interpretation. The main goal of this thesis is to implement and evaluate the results of the MVR-PC-algorithm proposed by Sonntag and Peña in 2012. This algorithm uses a constraint based approach used in order to learn a MVR-CG from data.In this study the MRV-PC-algorithm is implemented and tested to see whether the implementation is correct. For this purpose, it is run on several different independence models that can be perfectly represented by MVR-CGs. The learned CG and the independence model of the given probability distribution are then compared to ensure that they are in the same Markov equivalence class. Additionally, for the purpose of checking how accurate the algorithm is, in learning a MVR-CG from data, a large number of samples are passed to the algorithm. The results are analyzed based on number of nodes and average number of adjacents per node. The accuracy of the algorithm is measured by the precision and recall of independencies and dependencies.In general, the higher the number of samples given to the algorithm, the more accurate the learned MVR-CGs become. In addition, when the graph is sparse, the result becomes significantly more accurate. The number of nodes can affect the results slightly. When the number of nodes increases it can lead to better results, if the average number of adjacents is fixed. On the other hand, if the number of nodes is fixed and the average number of adjacents increases, the effect is more considerable and the accuracy of the results dramatically declines. Moreover the type of the random variables can affect the results. Given the samples with discrete variables, the recall of independencies measure would be higher and the precision of independencies measure would be lower. Conversely, given the samples with continuous variables, the recall of independencies would be less but the precision of independencies would be higher.

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

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

  • 332.
    Montresor, Alberto
    et al.
    University of Trento, Italy.
    Wierzbicki, AdamPolish-Japanese Institute of Information Technology, Poland.Shahmehri, NahidLinköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing2006Proceedings (redaktörskap) (Övrigt vetenskapligt)
  • 333.
    Mounagurusamy, Purani
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Parsing AQL Queries into SQL Queries using ANTLR2015Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    An Electronic Health Record is a collection of each patient’s health information which is stored electronically or in digital format. openEHR is an open standard specification for electronic health record data. openEHR has a method for querying a set of clinical data using the Archetype Query Language (AQL). 

    The EHR data is in XML format and this format is a tree like structure. Since XML databases were considerably slower, AQL needs to be translated to another query language. Researchers have already investigated translating AQL to XQuery and tested the performance. Since the performance was not satisfactory, we now investigate translating AQL to SQL.

    AQL queries are translated to SQL queries using the ANTLR tool. The translation is implemented in Java language. The AQL queries which are translated into SQL queries are also tested in this thesis work. Finally, the result is to get the corresponding SQL query for any given AQL query.

  • 334.
    Muzammal, Muhammad
    et al.
    Bahria Univ, Pakistan.
    Talat, Romana
    Bahria Univ, Pakistan.
    Sodhro, Ali Hassan
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Pirbhulal, Sandeep
    Chinese Acad Sci, Peoples R China.
    A multi-sensor data fusion enabled ensemble approach for medical data from body sensor networks2020Ingår i: Information Fusion, ISSN 1566-2535, E-ISSN 1872-6305, Vol. 53, s. 155-164Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Wireless Body Sensor Network (BSNs) are wearable sensors with varying sensing, storage, computation, and transmission capabilities. When data is obtained from multiple devices, multi-sensor fusion is desirable to transform potentially erroneous sensor data into high quality fused data. In this work, a data fusion enabled Ensemble approach is proposed to work with medical data obtained from BSNs in a fog computing environment. Daily activity data is obtained from a collection of sensors which is fused together to generate high quality activity data. The fused data is later input to an Ensemble classifier for early heart disease prediction. The ensembles are hosted in a Fog computing environment and the prediction computations are performed in a decentralised manners. The results from the individual nodes in the fog computing environment are then combined to produce a unified output. For the classification purpose, a novel kernel random forest ensemble is used that produces significantly better quality results than random forest. An extensive experimental study supports the applicability of the solution and the obtained results are promising, as we obtain 98% accuracy when the tree depth is equal to 15, number of estimators is 40, and 8 features are considered for the prediction task.

  • 335.
    Månsson, Per
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Database analysis and managing large data sets in a trading environment2014Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Start-up companies today tend to find a need to scale up quickly and smoothly, to cover quickly increasing demands for the services they create. It is also always a necessity to save money and finding a cost-efficient solution which can meet the demands of the company.

    This report uses Amazon Web Services for infrastructure. It covers hosting databases on Elastic Computing Cloud, the Relational Database Serviceas well as Amazon DynamoDB for NoSQL storage are compared, benchmarked and evaluated.

  • 336.
    Mårdsjö, Jon
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Security concerns regarding connected embedded systems2013Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Embedded systems have been present in our daily lives for some time, but trends clearly show a rise in inter-connectivity in such devices. This presents promising new applications and possibilities, but also opens up a lot attack surface. Our goal in this thesis is to find out how you can develop such interconnected embedded systems in a way that guarantees the three major components of information security: Confidentialy, Integrity and Availability. The main focus of security is networked security. In this thesis, a dual approach is taken: investigate the development process of building secure systems, and perform such an implementation. The artifacts produced as byproducts, the software itself, deployment instructions and lessons learned are all presented. It is shown that the process used helps businesses find a somewhat deterministic approach to security, have a higher level of confidence, helps justify the costs that security work entails and helps in seeing security as a business decision. Embedded systems were also shown to present unforeseen obstacles, such as how the lack of a motherboard battery clashes with X.509. In the end, a discussion is made about how far the system can guarantee information security, what problems still exist and what could be done to mitigate them.

  • 337.
    Müssener, Ulrika
    et al.
    Linköpings universitet, Institutionen för medicin och hälsa, Avdelningen för samhällsmedicin. Linköpings universitet, Medicinska fakulteten.
    Bendtsen, Marcus
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Karlsson, Nadine
    Linköpings universitet, Institutionen för medicin och hälsa, Avdelningen för samhällsmedicin. Linköpings universitet, Medicinska fakulteten.
    White, Ian R.
    Cambridge Institute Public Heatlh, England.
    Mccambridge, James
    Linköpings universitet, Institutionen för medicin och hälsa, Avdelningen för samhällsmedicin. Linköpings universitet, Medicinska fakulteten. University of York, England.
    Bendtsen, Preben
    Linköpings universitet, Institutionen för medicin och hälsa, Avdelningen för samhällsmedicin. Linköpings universitet, Medicinska fakulteten. Region Östergötland, Närsjukvården i västra Östergötland, Medicinska specialistkliniken.
    Effectiveness of Short Message Service Text-Based Smoking Cessation Intervention Among University Students A Randomized Clinical Trial2016Ingår i: JAMA Internal Medicine, ISSN 2168-6106, E-ISSN 2168-6114, Vol. 176, nr 3, s. 321-328Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    IMPORTANCE Smoking is globally the most important preventable cause of ill health and death. Mobile telephone interventions and, in particular, short message service (SMS) text messaging, have the potential to overcome access barriers to traditional health services, not least among young people. OBJECTIVE To determine the effectiveness of a text-based smoking cessation intervention among young people. DESIGN, SETTING, AND PARTICIPANTS A single-blind, 2-arm, randomized clinical trial (Nicotine Exit [NEXit]) was conducted from October 23, 2014, to April 17, 2015; data analysis was performed from April 23, 2014, to May 22, 2015. Participants included daily or weekly smokers willing to set a quit date within 1 month of enrollment. The study used email to invite all college and university students throughout Sweden to participate. INTERVENTIONS The NEXit core program is initiated with a 1- to 4-week motivational phase during which participants can choose to set a stop date. The intervention group then received 157 text messages based on components of effective smoking cessation interventions for 12 weeks. The control group received 1 text every 2 weeks thanking them for participating in the study, with delayed access to the intervention. MAIN OUTCOMES AND MEASURES The primary outcomes were self-reported prolonged abstinence (not having smoked >5 cigarettes over the past 8 weeks) and 4-week point prevalence of complete smoking cessation shortly after the completion of the intervention (approximately 4 months after the quit date). RESULTS A total of 1590 participants, mainly between 21 and 30 years of age, were randomized into the study; 827 (573 [69.3%] women) were allocated to the intervention group and 763 (522 [68.4%] women) were included in the control group. Primary outcome data were available for 783 (94.7%) of the intervention group and 719 (94.2%) of the control group. At baseline, participants were smoking a median (range) of 63 (1-238) and 70 (2-280) cigarettes per week, respectively. Eight-week prolonged abstinence was reported by 203 participants (25.9%) in the intervention group and 105 (14.6%) in the control group; 4-week point prevalence of complete cessation was reported by 161 (20.6%) and 102 (14.2%) participants, respectively, a mean (SD) of 3.9 (0.37) months after the quit date. The adjusted odds ratios (95% CIs) for these findings were 2.05 (1.57-2.67) and 1.56 (1.19-2.05), respectively. CONCLUSIONS AND RELEVANCE With the limitation of assessing only the short-term effect of the intervention, the effects observed in this trial are comparable with those for traditional smoking cessation interventions. The simple NEXit intervention has the potential to improve the uptake of effective smoking cessation interventions.

  • 338.
    Müssener, Ulrika
    et al.
    Linköpings universitet, Institutionen för medicin och hälsa, Avdelningen för samhällsmedicin. Linköpings universitet, Hälsouniversitetet.
    Bendtsen, Marcus
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Karlsson, Nadine
    Linköpings universitet, Institutionen för medicin och hälsa, Avdelningen för samhällsmedicin. Linköpings universitet, Hälsouniversitetet.
    White, Ian R.
    Cambridge Institute of Public Health.
    McCambridge, Jim
    University of York.
    Bendtsen, Preben
    Linköpings universitet, Institutionen för medicin och hälsa, Avdelningen för samhällsmedicin. Linköpings universitet, Hälsouniversitetet. Östergötlands Läns Landsting, Närsjukvården i västra Östergötland, Medicinska specialistkliniken .
    SMS-based smoking cessation intervention among university students: study protocol for a randomised controlled trial (NEXit trial)2015Ingår i: Trials, ISSN 1745-6215, E-ISSN 1745-6215, Vol. 16, artikel-id 140Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Background: Most smoking efforts targeting young people have so far been focused on prevention of initiation, whereas smoking cessation interventions have largely been targeted towards adult populations. Thus, there is limited evidence for effective smoking cessation interventions in young people, even though many young people want to quit smoking. Mobile communication technology has the potential to reach large numbers of young people and recent text-based smoking cessation interventions using phones have shown promising results. Methods/design: The study aims to evaluate a newly developed text-based smoking cessation intervention for students in colleges and universities in Sweden. The design is a randomised controlled trial (RCT) with a delayed/waiting list intervention control condition. The trial will be performed simultaneously in all colleges and universities served by 25 student health care centres in Sweden. Outcomes will be evaluated after 4 months, with 2 cessation primary outcomes and 4 secondary outcomes. After outcome evaluation the control group will be given access to the intervention. Discussion: The study will examine the effectiveness of a stand-alone SMS text-based intervention. The intervention starts with a motivational phase in which the participants are given an opportunity to set a quit date within 4 weeks of randomisation. This first phase and the subsequent core intervention phase of 12 weeks are totally automated in order to easily integrate the intervention into the daily routines of student and other health care settings. As well as providing data for the effectiveness of the intervention, the study will also provide data for methodological analyses addressing a number issues commonly challenging in Internet-based RCTs. For example, an extensive follow-up strategy will be used in order to evaluate the use of repeated attempts in the analysis, and in particular to explore the validity of a possible missing not at random assumption that the odds ratio between the primary outcome and response is the same at every attempt.

  • 339.
    Müssener, Ulrika
    et al.
    Linköpings universitet, Institutionen för medicin och hälsa, Avdelningen för samhällsmedicin. Linköpings universitet, Medicinska fakulteten.
    Bendtsen, Marcus
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Mccambridge, James
    Linköpings universitet, Institutionen för medicin och hälsa, Avdelningen för samhällsmedicin. Linköpings universitet, Medicinska fakulteten. University of York, England.
    Bendtsen, Preben
    Linköpings universitet, Institutionen för medicin och hälsa, Avdelningen för samhällsmedicin. Linköpings universitet, Medicinska fakulteten. Region Östergötland, Närsjukvården i västra Östergötland, Medicinska specialistkliniken.
    User satisfaction with the structure and content of the NEXit intervention, a text messaging-based smoking cessation programme2016Ingår i: BMC Public Health, ISSN 1471-2458, E-ISSN 1471-2458, Vol. 16, artikel-id 1179Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Background: Smoking is still the leading cause of preventable ill health and death. There is a limited amount of evidence for effective smoking cessation interventions among young people. To address this, a text messaging-based smoking cessation programme, the NEXit intervention, was developed. Short-term effectiveness, measured immediately after the 12-week intervention revealed that 26% of smokers in the intervention group had prolonged abstinence compared with 15% in the control group. The present study was performed to explore the users experiences of the structure and content of the intervention in order to further develop the intervention. Methods: Students participating in the main NEXit randomized controlled trial were invited to grade their experiences of the structure and content of the intervention after having completed follow-up. The participants received an e-mail with an electronic link to a short questionnaire. Descriptive analysis of the distribution of the responses to the questionnaire was performed. Free-text comments to 14 questions were analysed. Results: The response rate for the user feedback questionnaire was 35% (n = 289/827) and 428 free-text comments were collected. The first motivational phase of the intervention was appreciated by 55% (158/289) of the participants. Most participants wanted to quit smoking immediately and only 124/289 (43%) agreed to have to decide a quit-date in the future. Most participants 199/289 (69%) found the content of the messages in the core programme to be very good or good, and the variability between content types was appreciated by 78% (224/289). Only 34% (97/289) of the participants thought that all or nearly all messages were valuable, and some mentioned that it was not really the content that mattered, but that the messages served as a reminder about the decision to quit smoking. Conclusions: The programme was largely perceived satisfactory in most aspects concerning structure and content by young people and most participants stated that they would recommend it to a friend who wants to quit smoking. The motivational phase might be worth shortening and the number of messages around the quit date itself reduced. Shorter messages seemed to be more acceptable.

  • 340.
    Nadim Parvez, Khandoker
    et al.
    North South University, Bangladesh .
    Williamson, Carey
    University of Calgary, Canada .
    Mahanti, Anirban
    National ICT Australia NICTA, Australia .
    Carlsson, Niklas
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Insights on Media Streaming Progress Using BitTorrent-Like Protocols for On-Demand Streaming2012Ingår i: IEEE/ACM Transactions on Networking, ISSN 1063-6692, E-ISSN 1558-2566, Vol. 20, nr 3, s. 637-650Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This paper develops analytical models that characterize the behavior of on-demand stored media content delivery using BitTorrent-like protocols. The models capture the effects of different piece selection policies, including Rarest-First, two variants of In-Order, and two probabilistic policies (Portion and Zipf). Our models provide insight into system behavior and help explain the sluggishness of the system with In-Order streaming. We use the models to compare different retrieval policies across a wide range of system parameters, including peer arrival rate, upload/download bandwidth, and seed residence time. We also provide quantitative results on the startup delays and retrieval times for streaming media delivery. Our results provide insights into the design tradeoffs for on-demand media streaming in peer-to-peer networks. Finally, the models are validated using simulations.

  • 341.
    Nagubadi, RadhaKrishna
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    K Shortest Path Implementation2013Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

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

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

  • 342.
    Nikolaevskiy, Ilya
    et al.
    Aalto University, Finland.
    Lukyanenko, Andrey
    Aalto University, Finland.
    Polishchuk, Tatiana
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Polishchuk, Valentin
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Gurtov, Andrei
    Aalto University, Finland; Helsinki Institute Informat Technology, Finland; ITMO University, Russia.
    isBF: Scalable in-packet bloom filter based multicast2015Ingår i: Computer Communications, ISSN 0140-3664, E-ISSN 1873-703X, Vol. 70, s. 79-85Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Bloom filter (BF) based forwarding was proposed recently in several protocol alternatives to IP multicast. Some of these protocols avoid the state in intermediate routers and leave the burden of scalability management to the multicast source and end-hosts. Still, the existing BF-based protocols have scalability limitations and require explicit network management as well as non-trivial functionality from the network components. In this work we address the scalability limitations of the BF-based forwarding protocols by partitioning endhosts into clusters. We propose several algorithms to do the partitioning so as to decrease the overall traffic in the network. We evaluate our algorithms in a real Internet topology, demonstrating the ability of the proposed design to save up to 70% of traffic volume in the large-scale topology for big groups of subscribers, and up to 30% for small groups. (C) 2015 Elsevier B.V. All rights reserved.

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

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

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

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

  • 344.
    Nilsson, Roland
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för fysik, kemi och biologi, Biologiska Beräkningar.
    Peña, Jose M.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Björkegren, Johan
    Computional Medicine group KI.
    Tegnér, Jesper
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för fysik, kemi och biologi, Biologiska Beräkningar.
    Consistent feature selection for pattern recognition in polynomial time2007Ingår i: Journal of machine learning research, ISSN 1532-4435, E-ISSN 1533-7928, Vol. 8, s. 589-612Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We analyze two different feature selection problems: finding a minimal feature set optimal for classification (MINIMAL-OPTIMAL) vs. finding all features relevant to the target variable (ALL-RELEVANT). The latter problem is motivated by recent applications within bioinformatics, particularly gene expression analysis. For both problems, we identify classes of data distributions for which there exist consistent, polynomial-time algorithms. We also prove that ALL-RELEVANT is much harder than MINIMAL-OPTIMAL and propose two consistent, polynomial-time algorithms. We argue that the distribution classes considered are reasonable in many practical cases, so that our results simplify feature selection in a wide range of machine learning tasks.

  • 345.
    Nilsson, Roland
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för fysik, kemi och biologi, Biologiska Beräkningar.
    Peña, Jose M.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Björkegren, Johan
    Computional Medicin group KI.
    Tegnér, Jesper
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för fysik, kemi och biologi, Biologiska Beräkningar.
    Detecting Multivariate Differentially Expressed Genes2007Ingår i: BMC Bioinformatics, ISSN 1471-2105, E-ISSN 1471-2105, Vol. 8:150Artikel i tidskrift (Refereegranskat)
  • 346.
    Nilsson, Roland
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för fysik, kemi och biologi, Biologiska Beräkningar.
    Peña, Jose M.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Björkegren, Johan
    Karolinska universitetssjukhuset.
    Tegnér, Jesper
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för fysik, kemi och biologi, Biologiska Beräkningar.
    Evaluating feature selection for SVMs in high dimensions2006Ingår i: 17th European Conference on Machine Learning,2006, Berlin: Springer , 2006, s. 719-Konferensbidrag (Refereegranskat)
  • 347.
    Nissa Holmgren, Robert
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Automated Measurement and Change Detection of an Application’s Network Activity for Quality Assistance2014Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [sv]

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

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

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

  • 348.
    Norberg, Emil
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Evaluation of Using Secure Enclaves in Virtualized Radio Environments2019Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Virtual Network Functions (VNFs) are software applications that process network packets in virtualized environments such as clouds. Using VNFs to process network traffic inside a cloud, which could be controlled by a third-party, exposes the secrets that are stored within the VNFs to a significant amount of threats. Trusted Execution Environments (TEEs) are hardware technologies dedicated to protect software from other malicious applications and users. Open Enclave and Asylo are two SDKs that decouple software and hardware and enable developers to build applications that utilize TEEs without creating hardware dependencies. Open Enclave and Asylo are still in an early stage of development, Asylo in particular. The impact of integrating Open Enclave and Asylo to VNFs from a security and performance perspective was addressed by performing a risk assessment and running performance experiments. The identified vulnerabilities in VNFs were mitigated by using available security properties from TEEs. The results show that protecting VNFs with Open Enclave and Asylo mitigate a significant amount of threats. However, the VNFs suffer from a performance penalty when using TEEs, and are still vulnerable to side-channel and Denial-of-Service attacks.

  • 349.
    Nsolo, Edward
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Prediction models for soccer sports analytics2018Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
  • 350.
    Nsolo, Edward
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Lambrix, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Carlsson, Niklas
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Player Valuation in European Football2019Ingår i: Proceedings of the 5th Workshop on Machine Learning and Data Mining for Sports Analytics: co-located with 2018 European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD 2018) / [ed] Ulf Brefeld, Jesse Davis, Jan Van Haaren, Albrecht Zimmermann, Cham: Springer, 2019, Vol. 11330, s. 42-54Konferensbidrag (Refereegranskat)
    Abstract [en]

    As the success of a team depends on the performance of individual players, the valuation of player performance has become an important research topic. In this paper, we compare and contrast which attributes and skills best predict the success of individual players in their positions in five European top football leagues. Further, we evaluate different machine learning algorithms regarding prediction performance. Our results highlight features distinguishing top-tier players and show that prediction performance is higher for forwards than for other positions, suggesting that equally good prediction of defensive players may require more advanced metrics.

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