Change search
Refine search result
45678910 301 - 350 of 803
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 301.
    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å University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Oblivious Neighbor Discovery for Wireless Devices with Directional Antennas2016In: IEEE INFOCOM 2016: The 35th Annual IEEE International Conference on Computer Communications, San Francisco, 10-14 April 2016, Piscataway, NJ: IEEE Communications Society, 2016, article id 7524570Conference paper (Refereed)
    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

  • 302.
    Ding, Ming
    et al.
    Data 61, Australia.
    Lopez-Perez, David
    Bell Labs Alcatel-Lucent.
    Xue, Ruiqi
    Shanghai Jiao Tong University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Chen, Wen
    Shanghai Key Lab of Navigation and Location Based Services, Shanghai Jiao Tong University, and School of Electronic Engineering and Automation, Guilin University of Electronic Technology.
    On Dynamic Time Division Duplex Transmissions for Small Cell Networks2016In: IEEE Transactions on Vehicular Technology, ISSN 0018-9545, E-ISSN 1939-9359, Vol. 65, no 11, p. 8933-8951Article in journal (Refereed)
    Abstract [en]

    otivated by the promising benefits of dynamic Time Division Duplex (TDD), in this paper, we use a unified framework to investigate both the technical issues of applying dynamic TDD in homogeneous small cell networks (HomSCNs), and the feasibility of introducing dynamic TDD into heterogeneous networks (HetNets). First, HomSCNs are analyzed, and a small cell BS scheduler that dynamically and independently schedules DL and UL subframes is presented, such that load balancing between the DL and the UL traffic can be achieved. Moreover, the effectiveness of various inter-link interference mitigation (ILIM) schemes as well as their combinations, is systematically investigated and compared. Besides, the interesting possibility of partial interference cancellation (IC) is also explored. Second, based on the proposed schemes, the joint operation of dynamic TDD together with cell range expansion (CRE) and almost blank subframe (ABS) in HetNets is studied. In this regard, scheduling polices in small cells and an algorithm to derive the appropriate macrocell traffic off-load and ABS duty cycle under dynamic TDD operation are proposed. Moreover, the full IC and the partial IC schemes are investigated for dynamic TDD in HetNets. The user equipment (UE) packet throughput performance of the proposed/discussed schemes is benchmarked using system-level simulations.

  • 303.
    Konstantinidis, Stathis
    et al.
    NORUT Northern research institute.
    Brox, Ellen
    NORUT Northern research institute.
    Kommervold, Per Egil
    NORUT Northern research institute.
    Hallberg, Josef
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Evertsen, Gunn
    NORUT Northern research institute.
    Hirche, Johannes
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Online Social Exergames for Seniors: Pillar of Gamification for Clinical Practice2016In: Handbook of Research on Holistic Perspectives in Gamification for Clinical Practice, IGI Global, 2016, p. 245-276Chapter in book (Refereed)
    Abstract [en]

    The population is getting older, and the resources for care will be even more limited in the future than they are now. There is thus an aim for the society that the seniors can manage themselves as long as possible, while at the same time keeping a high quality of life. Physical activity is important to stay fit, and social contact is important for the quality of life. This chapter aims to provide a state-of-the-art of online social exergames for seniors, providing glimpses of senior users’ opinions and games limitations. The importance of the motivational techniques will be emphasized, as well as the impact that the exergames have to seniors. It will contribute to the book objectives focusing on current state and practice in health games for physical training and rehabilitation and the use of gamification, exploring future opportunities and uses of gamification in eHealth and discussing the respective challenges and limitations.

  • 304.
    Sun, Jian
    et al.
    Beijing Engineering and Technology Center for Convergence Networks and Ubiquitous Services, School of Computer and Communication Engineering, University of Science and Technology Beijing.
    Liu, Tong
    Department of Information and Communication Engineering, Harbin Engineering University, Harbin.
    Wang, Xianxian
    Beijing Engineering and Technology Center for Convergence Networks and Ubiquitous Services, School of Computer and Communication Engineering, University of Science and Technology Beijing.
    Xing, Chengwen
    School of Information and Electronics, Beijing Institute of Technology, Beijing.
    Xiao, Hailin
    Key Laboratory of Cognitive Radio and Information Processing, Ministry of Education, Guilin University of Electronic Technology, Guilin.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Zhang, Zhogshan
    Beijing Engineering and Technology Research Center for Convergence Networks and Ubiquitous Services, University of Science and Technology.
    Optimal mode selection with uplink data rate maximization for D2D-aided underlaying cellular networks2016In: IEEE Access, E-ISSN 2169-3536, Vol. 4, p. 8844-8856, article id 7762100Article in journal (Refereed)
    Abstract [en]

    The device-to-device (D2D) communication has been regarded as an effective technique for complementing and enhancing the conventional cellular systems owing to its capability of substantially improving both the spectral and power efficiencies of wireless networks. However, the severe interference imposed on the conventional cellular users (CUs) by the geographically close-by D2D pairs may cause a significant performance erosion in the D2D-aided underlaying cellular networks (CNs). In this paper, performance analysis for the D2D-aided underlaying CNs in terms of throughput is provided. We first derive the closed-form expressions of the coverage probability for both the conventional cellular links and the D2D links, followed by giving out the approximated expressions of the ergodic data rate for both an individual cellular/D2D link and the whole underlaying network. Furthermore, the key parameters (e.g., the density of D2D users (DUs) or CUs, and the average geographical distance between a pair of D2D peers) significantly impacting the channel capacity are adaptively adjusted for maximizing the sum data rate of the proposed underlaying networks. In addition, both theoretical analysis and simulation results reveal the attainability of the maximal throughput by optimizing the critical parameters, such as the density of DUs, provided that the scale factor between the DUs and sum users (i.e., comprising both conventional CUs and DUs) can be effectively balanced subject to the constraints specified in the proposed scheme

  • 305.
    Lin, Di
    et al.
    School of Information and Software Engineering, University of Electronic Science and Technology of China, Chengdu.
    Yao, Yuanzhe
    School of Information and Software Engineering, University of Electronic Science and Technology of China, Chengdu.
    Labeau, Fabrice
    Department of Electrical and Computer Engineering, McGill University, Montreal.
    Tang, Yu
    School of Information and Software Engineering, University of Electronic Science and Technology of China, Chengdu.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Optimal Network QoS over the Internet of Vehicles for E-Health Applications2016In: International Journal of Mobile Information Systems, ISSN 1574-017X, E-ISSN 1875-905X, Vol. 2016, article id 5140486Article in journal (Refereed)
    Abstract [en]

    Wireless technologies are pervasive to support ubiquitous healthcare applications. However, a critical issue of using wireless communications under a healthcare scenario is the electromagnetic interference (EMI) caused by RF transmission, and a high level of EMI may lead to a critical malfunction of medical sensors. In consideration of EMI on medical sensors, we study the optimization of quality of service (QoS) within the whole Internet of vehicles for E-health and propose a novel model to optimize the QoS by allocating the transmit power of each user. Our results show that the optimal power control policy depends on the objective of optimization problems: a greedy policy is optimal to maximize the summation of QoS of each user, whereas a fair policy is optimal to maximize the product of QoS of each user. Algorithms are taken to derive the optimal policies, and numerical results of optimizing QoS are presented for both objectives and QoS constraints.

  • 306.
    Zhang, Yunquan
    et al.
    State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences, Beijing.
    Cao, Ting
    State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences, Beijing.
    Li, Shigang
    State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences, Beijing.
    Tian, Xinhui
    Advanced Computer Systems Research Center, Institute of Computing Technology, Chinese Academy of Sciences, Beijing.
    Yuan, Liang
    State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences, Beijing.
    Yia, Haipeng
    State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences, Beijing.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Parallel Processing Systems for Big Data: A Survey2016In: Proceedings of the IEEE, ISSN 0018-9219, E-ISSN 1558-2256, Vol. 104, no 11, p. 2114-2136Article in journal (Refereed)
    Abstract [en]

    The volume, variety, and velocity properties of big data and the valuable information it contains have motivated the investigation of many new parallel data processing systems in addition to the approaches using traditional database management systems (DBMSs). MapReduce pioneered this paradigm change and rapidly became the primary big data processing system for its simplicity, scalability, and fine-grain fault tolerance. However, compared with DBMSs, MapReduce also arouses controversy in processing efficiency, low-level abstraction, and rigid dataflow. Inspired by MapReduce, nowadays the big data systems are blooming. Some of them follow MapReduce's idea, but with more flexible models for general-purpose usage. Some absorb the advantages of DBMSs with higher abstraction. There are also specific systems for certain applications, such as machine learning and stream data processing. To explore new research opportunities and assist users in selecting suitable processing systems for specific applications, this survey paper will give a high-level overview of the existing parallel data processing systems categorized by the data input as batch processing, stream processing, graph processing, and machine learning processing and introduce representative projects in each category. As the pioneer, the original MapReduce system, as well as its active variants and extensions on dataflow, data access, parameter tuning, communication, and energy optimizations will be discussed at first. System benchmarks and open issues for big data processing will also be studied in this survey.

  • 307.
    Porras, Jari
    et al.
    Lappeenranta University of Technology.
    Seffah, Ahmed
    Lappeenranta University of Technology.
    Rondeau, Eric
    Université de Lorraine, Nancy.
    Andersson, Karl
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science. Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Distance- Spanning Technology.
    Klimova, Alexandra
    ITMO University.
    PERCCOM: A Master Program in Pervasive Computing and COMmunications for Sustainable Development2016In: 2016 IEEE 29th International Conference on Software Engineering Education and Training (CSEET): Dallas, TX, 5-6 April 2016, Piscataway, NJ: IEEE Communications Society, 2016, p. 204-212, article id 7474485Conference paper (Refereed)
    Abstract [en]

    This paper presents the Erasmus Mundus Joint Master Degree in Pervasive Computing and Communications for Sustainable Development (PERCCOM). This program brings together 11 academic partners and 8 industry partners to combine advanced Information and Communication Technologies (ICT) with environmental awareness to enable world-class education and unique competences for ICT professionals who can build cleaner, greener, more resource and energy efficient cyber-physical systems. First, this paper describes the rationale and motivations for ICT education for sustainability challenges. It then details the structure and contents of the programs including the courses offered at the three teaching locations (Nancy France, Lappeenranta Finland, and Lulea Sweden). The ways that the program has been running as well as students selection, their thesis works, involvement of industry, are also discussed. The program was built and managed using a solid academic standards and strategies student-centered learning.

  • 308.
    Thombre, Sumeet
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Islam, Raihan Ul
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Andersson, Karl
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science. Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Distance- Spanning Technology.
    Hossain, Mohammad Shahadat
    University of Chittagong.
    Performance Analysis of an IP based Protocol Stack for WSNs2016In: Proceedings of the 2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Piscataway, NJ: IEEE Communications Society, 2016, p. 691-696, article id 7562102Conference paper (Refereed)
    Abstract [en]

    Wireless sensor networks (WSNs) are the key enablers of the internet of things (IoT) paradigm. Traditionally, sensor network research has been to be unlike the internet, motivated by power and device constraints. The IETF 6LoWPAN draft standard changes this, defining how IPv6 packets can be efficiently transmitted over IEEE 802.15.4 radio links. Due to this 6LoWPAN technology, low power, low cost micro-controllers can be connected to the internet forming what is known as the wireless embedded internet. Another IETF recommendation, CoAP allows these devices to communicate interactively over the internet. The integration of such tiny, ubiquitous electronic devices to the internet enables interesting real-time applications. We evaluate the performance of a stack consisting of CoAP and 6LoWPAN over the IEEE 802.15.4 radio link using the Contiki OS and Cooja simulator, along with the CoAP framework Californium (Cf).

  • 309.
    Rao, Akhila
    et al.
    SICS Swedish ICT AB, Sweden.
    Schelén, Olov
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Lindgren, Anders
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science. SICS Swedish ICT AB, Sweden.
    Performance implications for IoT over information centric networks2016In: CHANTS '16: Proceedings of the Eleventh ACM Workshop on Challenged Networks, New York: ACM Digital Library, 2016, p. 57-62Conference paper (Refereed)
    Abstract [en]

    Information centric networking (ICN) is a proposal for a future in-ternetworking architecture that is more efficient and scalable. Whileseveral ICN architectures have been evaluated for networks carry-ing web and video traffic, the benefits and challenges it poses forInternet of Things (IoT) networks are relatively unexplored. In ourwork, we evaluate the performance implications for typical IoT net-work scenarios in the ICN paradigm. We study the behavior of in-network caching, introduce a way to make caching more efficientfor periodic sensor data, and evaluate the impact of presence andlocation of lossy wireless links in IoT networks. In this paper, wepresent and discuss the results of our evaluations on IoT networksperformed through emulations using a specific ICN architecture,namely, content centric networking (CCN). For example, we showthat the newly proposed UTS-LRU cache replacement strategy forimproved caching performance of time series content streams re-duces the number of messages transmitted by up to 16%. Our find-ings indicate that the performance of IoT networks using ICN areinfluenced by the content model and the nature of its links, and mo-tivates further studies to understand the performance implicationsin more varied IoT scenarios.

  • 310.
    Zhao, Xiaoxing
    et al.
    Beijing University of Posts and Telecommunications.
    Qiao, Yuanyuan
    Beijing University of Posts and Telecommunications.
    Si, Zhongwei
    Beijing University of Posts and Telecommunications.
    Yang, Jie
    Beijing University of Posts and Telecommunications.
    Lindgren, Anders
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Prediction of user app usage behavior from geo-spatial data2016In: GeoRich '16: Proceedings of the Third International ACM SIGMOD Workshop on Managing and Mining Enriched Geo-Spatial Data, New York: ACM Digital Library, 2016, p. 37-42, article id 7Conference paper (Refereed)
    Abstract [en]

    In the era of mobile Internet, a vast amount of geo-spatial data allows us to gain further insights into human activities, which is critical for Internet Services Providers (ISP) to provide better personalized services. With the pervasiveness of mobile Internet, much evidence show that human mobility has heavy impact on app usage behavior. In this paper, we propose a method based on machine learning to predict users' app usage behavior using several features of human mobility extracted from geo-spatial data in mobile Internet traces. The core idea of our method is selecting a set of mobility attributes (e.g. location, travel pattern, and mobility indicators) that have large impact on app usage behavior and inputting them into a classification model. We evaluate our method using real-world network traffic collected by our self-developed high-speed Traffic Monitoring System (TMS). Our prediction method achieves 90.3% accuracy in our experiment, which verifies the strong correlation between human mobility and app usage behavior. Our experimental results uncover a big potential of geo-spatial data extracted from mobile Internet

  • 311.
    Sun, Min-Te
    et al.
    Department of Computer Science and Information Engineering, National Central University, Taoyuan 320, Taiwan.
    Sakai, Kazuya
    Department of Information and Communication Systems, Tokyo Metropolitan University, 6-6 Asahigaoka, Hino, Tokyo.
    Ku, Wei-Shinn
    Department of Computer Science and Software Engineering, Auburn University, Auburn,.
    Lai, Ten H.
    Department of Computer Science and Engineering, The Ohio State University, Columbus, OH 43210.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Private and Secure Tag Access for Large-Scale RFID Systems2016In: IEEE Transactions on Dependable and Secure Computing, ISSN 1545-5971, E-ISSN 1941-0018, Vol. 13, no 6, p. 657-671Article in journal (Refereed)
    Abstract [en]

    The performance of key authentication and the degree of privacy in large-scale RFID systems are considered by manyresearchers as tradeoffs. Based on how keys are managed in the system, the privacy preserving tag authentications proposed in thepast can be categorized into tree-based and group-based approaches. While a tree-based approach achieves high performance in keyauthentication, it suffers from the issue of low privacy should a fraction of tags be compromised. On the contrary, while group-based keyauthentication is relatively invulnerable to compromise attacks, it is not scalable to a large number of tags. In this paper, we propose anew private tag authentication protocol based on skip lists, named randomized skip lists-based authentication (RSLA). Withoutsacrificing the authentication performance, RSLA provides a high privacy preserving mechanism. While RSLA provides the same levelof unpredictability-based-privacy and indistinguishability-based privacy compared with other structured key management approaches,our scheme achieves the highest system anonymity with good performance in key look up and update. In addition, the simulationresults match our analyses closely.

  • 312.
    Su, Guanming
    et al.
    Dolby Labs, Sunnyvale, CA.
    Su, Xiao
    Computer Engineering, San José State University.
    Bai, Yan
    Institute of Technology, University of Washington Tacoma.
    Wang, Mea
    Department of Computer Science, University of Calgary.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Wang, Haohong
    TCL Research America, San Jose.
    QoE in video streaming over wireless networks: perspectives and research challenges2016In: Wireless networks, ISSN 1022-0038, E-ISSN 1572-8196, Vol. 22, no 5, p. 1571-1593Article in journal (Refereed)
    Abstract [en]

    The deployment of 3G/LTE networks and advancements in smart mobile devices had led to high demand for multimedia streaming over wireless network. The rapid increasing demand for multimedia content poses challenges for all parties in a multimedia streaming system, namely, content providers, wireless network service providers, and smart device makers. Content providers and mobile network service providers are both striving to improve their streaming services while utilizing advancing technologies. Smart device makers endeavor to improve processing power and displays for better viewing experience. Ultimately, the common goal shared by content providers, network service providers, and smart device manufactures is to improve the QoE for users. QoE is both an objective and a subjective metric measuring the streaming quality experience by end users. It may be measured by streaming bitrate, playback smoothness, video quality metrics like Peak to Signal Noise Ratio, and other user satisfaction factors. There have been efforts made to improve the streaming experiences in all these aspects. In this paper, we conducted a survey on existing literatures on QoE of video streaming to gain a deeper and more complete understanding of QoE quality metrics. The goal is to inspire new research directions in defining better QoE and improving QoE in existing and new streaming services such as adaptive streaming and 3D video streaming

  • 313.
    Porambage, Pawani
    et al.
    University of Oulu.
    Ylianttila, Mika
    University of Oulu.
    Schmitt, Corinne
    University of Zürich.
    Kumar, Pardeep
    UiT, The Arctic University of Norway, Narvik.
    Gurtov, Andrei
    Aalto University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Quest for Privacy in the Internet of Things2016In: I E E E Cloud Computing, ISSN 2325-6095, Vol. 3, no 2, p. 36-45Article in journal (Refereed)
    Abstract [en]

    The Internet of Things (IoT) is the current evolutionary paradigm of networking and the key driving force toward a smart world. Although privacy in the IoT is highly regarded to ensure the protection of users and personal information from the perspective of individual or cooperative users, it's insufficiently studied. As members of the always-connected paradigm of the massive IoT world, people can scarcely control the disclosure of their personal information. The biggest challenge is to allow users to experience the best utilization of IoT-based products and services with the fewest privacy threats and failures. This article provides a holistic view of the challenges of and issues related to preserving IoT privacy, as well as the existing solutions. Privacy by design (PbD) is identified as the key solution for many IoT privacy issues. The article also discusses hot topics in IoT privacy and future research directions.

  • 314.
    Shah, Tejal
    et al.
    The University of New South Wales, Australia.
    Ali, Yavari
    School of Computer Science, RMIT university, Australia.
    Mitra, Karan
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Saguna, Saguna
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Jayaraman, Prem Prakash
    School of Software and Electrical Engineering, Swinburne University of Technology, Australia.
    Rabhi, Fethi
    School of Computer Science and Engineering, The University of New South Wales, Sydney, Australia.
    Ranjan, Rajiv
    School of Computing, Newcastle University, Newcastle, UK.
    Remote health care cyber-physical system: quality of service (QoS) challenges and opportunities2016In: IET Cyber-Physical Systems: Theory & Applications, ISSN 2398-3396, Vol. 1, no 1, p. 40-48Article in journal (Refereed)
    Abstract [en]

    There is a growing emphasis to find alternative non-traditional ways to manage patients to ease the burden on health care services largely fuelled by a growing demand from sections of population that is ageing. In-home remote patient monitoring applications harnessing technological advancements in the area of Internet of things (IoT), semantic web, data analytics, and cloud computing have emerged as viable alternatives. However, such applications generate large amounts of real-time data in terms of volume, velocity, and variety thus making it a big data problem. Hence, the challenge is how to combine and analyse such data with historical patient data to obtain meaningful diagnoses suggestions within acceptable time frames (considering quality of service (QoS)). Despite the evolution of big data processing technologies (e.g. Hadoop) and scalable infrastructure (e.g. clouds), there remains a significant gap in the areas of heterogeneous data collection, real-time patient monitoring, and automated decision support (semantic reasoning) based on well-defined QoS constraints. In this study, the authors review the state-of-the-art in enabling QoS for remote health care applications. In particular, they investigate the QoS challenges required to meet the analysis and inferencing needs of such applications and to overcome the limitations of existing big data processing tools.

  • 315.
    Shah, Tejal
    et al.
    School of Computer Science and Engineering, University of New South Wales.
    Yavari, Ali
    Royal Melbourne Institute of Technology, Melbourne.
    Mitra, Karan
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Saguna, Saguna
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Jayaraman, Prem Prakash
    RMIT University, Melbourne.
    Rabhi, Fethi
    University of New South Wales.
    Ranjan, Rajiv
    School of Computing Science, Newcastle University, Newcastle upon Tyne.
    Remote Healthcare Big Data Processing in Real-Time: Quality of Service Challenges and Opportunities2016In: Handbook on Big Data Technologies, Springer-Verlag GmbH , 2016Chapter in book (Refereed)
  • 316.
    Tang, Yang
    et al.
    Key Laboratory of Advanced Control and Optimization for Chemical Processes, Ministry of Education, East China University of Science and Technology, Shanghai.
    Gao, Huijun
    Research Institute of Intelligent Control and Systems, Harbin Institute of Technology.
    Du, Wei
    Key Laboratory of Advanced Control and Optimization for Chemical Processes, Ministry of Education, East China University of Science and Technology, Shanghai , Institute of Textiles and Clothing, The Hong Kong Polytechnic University.
    Lu, Jianquan
    Department of Mathematics, Southeast University Nanjing.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Kurths, Jûrgen
    Potsdam Institute for Climate Impact Research.
    Robust Multiobjective Controllability of Complex Neuronal Networks2016In: IEEE/ACM Transactions on Computational Biology & Bioinformatics, ISSN 1545-5963, E-ISSN 1557-9964, Vol. 13, no 4, p. 778-791Article in journal (Refereed)
    Abstract [en]

    This paper addresses robust multiobjective identification of driver nodes in the neuronal network of a cat’s brain, in which uncertainties in determination of driver nodes and control gains are considered. A framework for robust multiobjective controllability is proposed by introducing interval uncertainties and optimization algorithms. By appropriate definitions of robust multiobjective controllability, a robust nondominated sorting adaptive differential evolution (NSJaDE) is presented by means of the nondominated sorting mechanism and the adaptive differential evolution (JaDE). The simulation experimental results illustrate the satisfactory performance of NSJaDE for robust multiobjective controllability, in comparison with six statistical methods and two multiobjective evolutionary algorithms (MOEAs): nondominated sorting genetic algorithms II (NSGA-II) and nondominated sorting composite differential evolution (NSCDE). It is revealed that the existence of uncertainties in choosing driver nodes and designing control gains heavily affect the controllability of neuronal networks. We also unveil that driver nodes play a more drastic role than control gains in robust controllability. The developed NSJaDE and obtained results will shed light on the understanding of robustness in controlling realistic complex networks such as transportation networks, power grid networks and biological networks, etc.

  • 317.
    Hayajneh, Thaier
    et al.
    School of Engineering and Computing Sciences, New York Institute of Technology.
    Mohd, Bassam Jamil
    Computer Engineering Department, Hashemite University.
    Imran, Muhammad Al
    College of Computer and Information Sciences, Almuzahmiyah, King Saud University.
    Almashaqbeh, Ghada
    Computer Science Department, Columbia University, New York.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Secure Authentication for Remote Patient Monitoring with Wireless Medical Sensor Networks2016In: Sensors, ISSN 1424-8220, E-ISSN 1424-8220, Vol. 16, no 4, article id 424Article in journal (Refereed)
    Abstract [en]

    There is broad consensus that remote health monitoring will benefit all stakeholders in the healthcare system and that it has the potential to save billions of dollars. Among the major concerns that are preventing the patients from widely adopting this technology are data privacy and security. Wireless Medical Sensor Networks (MSNs) are the building blocks for remote health monitoring systems. This paper helps to identify the most challenging security issues in the existing authentication protocols for remote patient monitoring and presents a lightweight public-key-based authentication protocol for MSNs. In MSNs, the nodes are classified into sensors that report measurements about the human body and actuators that receive commands from the medical staff and perform actions. Authenticating these commands is a critical security issue, as any alteration may lead to serious consequences. The proposed protocol is based on the Rabin authentication algorithm, which is modified in this paper to improve its signature signing process, making it suitable for delay-sensitive MSN applications. To prove the efficiency of the Rabin algorithm, we implemented the algorithm with different hardware settings using Tmote Sky motes and also programmed the algorithm on an FPGA to evaluate its design and performance. Furthermore, the proposed protocol is implemented and tested using the MIRACL (Multiprecision Integer and Rational Arithmetic C/C++) library. The results show that secure, direct, instant and authenticated commands can be delivered from the medical staff to the MSN nodes

  • 318.
    Shu, Zhaogang
    et al.
    Fujian Agriculture and Forestry University, Fuzhou, China.
    Wan, Jiafu
    School of Mechanical and Automotive Engineering, South China University of Technology, Guangzhou , South China University of Technology, Guangzhou.
    Li, Di
    School of Mechanical and Automotive Engineering, South China University of Technology, Guangzhou , South China University of Technology, Guangzhou.
    Lin, Jiaxiang
    Fujian Agriculture and Forestry University, Fuzhou, China.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Imran, Muhammad Al
    College of Computer and Information Sciences, Almuzahmiyah, King Saud University.
    Security in Software-Defined Networking: Threats and Countermeasures2016In: Journal on spesial topics in mobile networks and applications, ISSN 1383-469X, E-ISSN 1572-8153, Vol. 21, no 5, p. 764-776Article in journal (Refereed)
    Abstract [en]

    In recent years, Software-Defined Networking (SDN) has been a focus of research. As a promising network architecture, SDN will possibly replace traditional networking, as it brings promising opportunities for network management in terms of simplicity, programmability, and elasticity. While many efforts are currently being made to standardize this emerging paradigm, careful attention needs to be also paid to security at this early design stage. This paper focuses on the security aspects of SDN. We begin by discussing characteristics and standards of SDN. On the basis of these, we discuss the security features as a whole and then analyze the security threats and countermeasures in detail from three aspects, based on which part of the SDN paradigm they target, i.e., the data forwarding layer, the control layer and the application layer. Countermeasure techniques that could be used to prevent, mitigate, or recover from some of such attacks are also described, while the threats encountered when developing these defensive mechanisms are highlighted.

  • 319.
    Niu, Hao
    et al.
    Institute of Industrial Science, University of Tokyo.
    Zhu, Nanhao
    CETC Group, GCI Science and Technology Co.
    Sun, Li
    Department of Information and Communications Engineering, Xi’an Jiaotong University, Xi’an.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Sezaki, Kaoru
    Institute of Industrial Science, University of Tokyo.
    Security-embedded opportunistic user cooperation with full diversity2016In: Wireless networks, ISSN 1022-0038, E-ISSN 1572-8196, Vol. 22, no 5, p. 1513-1522Article in journal (Refereed)
    Abstract [en]

    As a promising technique for wireless networks, cooperative communications is coming to maturity in both theory and practice. The main merit of the cooperation technique is its capability in providing additional transmission links to harvest the spatial diversity gain at the physical layer. However, due to the broadcast nature of wireless medium, the diversity gain can be also freely achieved at the potential eavesdropper if the cooperation is performed blindly. To solve this problem, we propose a security-embedded opportunistic user cooperation scheme (OUCS) in this paper. The OUCS first defines a concept called secrecy-providing capability (SPC) for both the source and the cooperative relays. By comparing the values of SPC of these nodes, the OUCS jointly decides whether to cooperate and with whom to cooperate from the perspective of physical layer security. The secrecy outage performance of the OUCS is then derived. From the results we prove that full diversity can be achieved (i.e., the diversity order is N + 1 for N cooperative relays), which outperforms existing alternatives. Finally, numerical results are provided to validate the theoretical analysis.

  • 320.
    Song, Qiang
    et al.
    College of Electrical Engineering, Henan University of Technology, Zhengzhou.
    Liu, Fang
    School of Information Engineering, Huanghuai University, Henan.
    Su, Housheng
    School of Automation, Huazhong University of Science and Technology, Wuhan.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Semi-global and global containment control of multi-agent systems with second-order dynamics and input saturation2016In: International Journal of Robust and Nonlinear Control, ISSN 1049-8923, E-ISSN 1099-1239, Vol. 36, no 16, p. 3460-3480Article in journal (Refereed)
    Abstract [en]

    This paper considers both semi-global and global containment control for a second-order multi-agent system that is composed by a network of identical harmonic oscillators or double integrators with multiple leaders and input saturation. A distributed low gain feedback algorithm is proposed to solve the semi-global containment control problem for the network whose topology is directed and initial condition is taken from any a priori given bounded set. In particular, by using a parametric Lyapunov equation approach, M-matrix properties and algebraic graph theory, an upper bound of the low gain parameter is estimated such that the low gain feedback matrix can be analytically determined without involving numerical computation. Furthermore, under the assumption that the induced subgraph formed by the followers is strongly connected and detail balanced, two linear feedback protocols are designed for coupled harmonic oscillators and coupled double integrators, respectively, to asymptotically achieve the global containment control of the network with any initial condition. Finally, numerical examples are given to illustrate the effectiveness of the theoretical results

  • 321.
    Handberg, Leif
    et al.
    Royal Institute of Technology (KTH), Stockholm.
    Gullström, Charlie
    Royal Institute of Technology, KTH Royal Institute of Technology, Department of Architecture.
    Kort, Joke
    TNO, Eemsgolaan 3, 9727 DW Groningen.
    Nyström, Jimmy
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    SharedSpaces Mingle2016In: CHI EA '16: Proceedings of the 2016 CHI Conference Extended Abstracts on Human Factors in Computing Systems, New York: ACM Digital Library, 2016, p. 269-272Conference paper (Refereed)
    Abstract [en]

    SharedSpaces is a WebRTC design prototype that creates a virtual media space where people can mingle and interact. Although you are in different locations, you appear side by side in front of a chosen backdrop. This interactive installation addresses spatial and social connectedness, stressing the importance of integrating architectural and spatial features to support complex social dynamics in mediated interaction. The tool engages users in manipulating their real-time video- streams, creatively co-designing a shared mediated space that fits a contextual need. It supports social dynamics by allowing users to draw and paint together and to move and resize video streams. Further, it enhances grounding and social cues by merging video- streams and space, representing users as if they were in the same space. Standard and easily available equipment is used. Recent user studies show that a seamless integration of space, social dynamics and shared activity benefits the experience of presence, naturalness, immersion/engagement and social connectedness

  • 322.
    Pace, Pasquale
    et al.
    University of Calabria.
    Loscri, Valeria
    Inria Lille-Nord Europe/FUN.
    Zheng, Zhengguo
    University of Sussex.
    Ruggeri, Guiseppe
    University Mediterranea of Reggio Calabria.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Smart Wireless Access Networks and Systems for Smart Cities2016In: Ad hoc networks, ISSN 1570-8705, E-ISSN 1570-8713, Vol. 43, p. 1-2Article in journal (Other academic)
  • 323.
    Kekely, Lukáš
    et al.
    CESNET a. l. e., Zikova 4, Prague.
    Kucera, Jan
    CESNET a. l. e., Zikova 4, Prague.
    Pus, Viktor
    CESNET a. l. e., Zikova 4, Prague.
    Korenek, Jan
    IT4Innovations Centre of Excellence, Faculty of Information Technology, Brno University of Technology.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Software defined monitoring of application protocols2016In: I.E.E.E. transactions on computers (Print), ISSN 0018-9340, E-ISSN 1557-9956, Vol. 65, no 2, p. 615-626, article id 7087363Article in journal (Refereed)
    Abstract [en]

    With the ongoing shift of network services to the application layer also the monitoring systems focus more on the data from the application layer. The increasing speed of the network links, together with the increased complexity of application protocol processing, require a new way of hardware acceleration. We propose a new concept of hardware acceleration for flexible flow-based application level traffic monitoring which we call Software Defined Monitoring. Application layer processing is performed by monitoring tasks implemented in the software in conjunction with a configurable hardware accelerator. The accelerator is a high-speed application-specific processor tailored to stateful flow processing. The software monitoring tasks control the level of detail retained by the hardware for each flow in such a way that the usable information is always retained, while the remaining data is processed by simpler methods. Flexibility of the concept is provided by a plugin-based design of both hardware and software, which ensures adaptability in the evolving world of network monitoring. Our high-speed implementation using FPGA acceleration board in a commodity server is able to perform a 100 Gb/s flow traffic measurement augmented by a selected application-level protocol analysis

  • 324.
    Wan, Jiafu
    et al.
    School of Mechanical and Automotive Engineering, South China University of Technology, Guangzhou.
    Tang, Shenglog
    School of Mechanical and Automotive Engineering, South China University of Technology, Guangzhou.
    Shu, Zhaogang
    Fujian Agriculture and Forestry University, Fuzhou, China, College of Computer and Information Sciences, Fujian Agriculture and Forestry University.
    Li, Di
    School of Mechanical and Automotive Engineering, South China University of Technology, Guangzhou.
    Wang, Shiyong
    School of Mechanical and Automotive Engineering, South China University of Technology, Guangzhou.
    Imran, Muhammad Al
    College of Computer and Information Sciences, Almuzahmiyah, King Saud University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Software-Defined Industrial Internet of Things in the Context of Industry 4.02016In: IEEE Sensors Journal, ISSN 1530-437X, E-ISSN 1558-1748, Vol. 16, no 20, p. 7373-7380Article in journal (Refereed)
  • 325.
    Handberg, Leif
    et al.
    Royal Institute of Technology.
    Gullström, Charlie
    Royal Institute of Technology, KTH Royal Institute of Technology, Department of Architecture.
    Kort, Joke
    TNO, Eemsgolaan 3, 9727 DW Groningen.
    Nyström, Jimmy
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Spatial and Social Connectedness in Web-based Work Collaboration2016In: CSCW '16 Companion: Proceedings of the 19th ACM Conference on Computer Supported Cooperative Work and Social Computing Companion, New York: ACM Digital Library, 2016, p. 45-48Conference paper (Refereed)
    Abstract [en]

    The work presented here seeks an integration of spatial and social features supporting shared activities, and engages users in multiple locations to manipulate realtime video-streams. Standard and easily available equipment is used together with the communication standard WebRTC. It adds a spatial quality of experience by representing the users anywhere on the screen, with easily changed diverse backdrops, inviting users to co-design a shared mediated space. User studies show that a seamless integration of space, social dynamics and shared activity benefits the experience of presence, naturalness, immersion/engagement and social connectedness. The results inform a discussion about spatial and social connectedness, stressing the importance of design to integrate architectural/spatial features and support complex social dynamics in mediated interaction

  • 326.
    Meng, Tong
    et al.
    Shanghai Key Laboratory of Scalable Computing and Systems, Department of Computer Science and Engineering, Shanghai Jiao Tong University.
    Wu, Fan
    Shanghai Key Laboratory of Scalable Computing and Systems, Department of Computer Science and Engineering, Shanghai Jiao Tong University.
    Yang, Zheng
    School of Software, Tsinghua University.
    Chen, Guihai
    Shanghai Key Laboratory of Scalable Computing and Systems, Department of Computer Science and Engineering, Shanghai Jiao Tong University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Spatial Reusability-Aware Routing in Multi-Hop Wireless Networks2016In: I.E.E.E. transactions on computers (Print), ISSN 0018-9340, E-ISSN 1557-9956, Vol. 65, no 1, p. 244-255Article in journal (Refereed)
    Abstract [en]

    In the problem of routing in multi-hop wireless networks, to achieve high end-to-end throughput, it is crucial to find the "best" path from the source node to the destination node. Although a large number of routing protocols have been proposed to find the path with minimum total transmission count/time for delivering a single packet, such transmission count/time minimizing protocols cannot be guaranteed to achieve maximum end-to-end throughput. In this paper, we argue that by carefully considering spatial reusability of the wireless communication media, we can tremendously improve the end-to-end throughput in multi-hop wireless networks. To support our argument, we propose spatial reusability-aware single-path routing (SASR) and anypath routing (SAAR) protocols, and compare them with existing single-path routing and anypath routing protocols, respectively. Our evaluation results show that our protocols significantly improve the end-to-end throughput compared with existing protocols. Specifically, for single-path routing, the median throughput gain is up to 60 percent, and for each source-destination pair, the throughput gain is as high as 5.3x; for anypath routing, the maximum per-flow throughput gain is 71.6 percent, while the median gain is up to 13.2 percent

  • 327.
    Liu, Tong
    et al.
    Shanghai Key Laboratory of Scalable Computing and Systems, Department of Computer Science and Engineering, Shanghai Jiao Tong University.
    Zhou, Yanmin
    Shanghai Key Laboratory of Scalable Computing and Systems, Department of Computer Science and Engineering, Shanghai Jiao Tong University.
    Zhang, Qian
    Department of Computer Science and Engineering, Hong Kong University of Science and Technology.
    Vasilakos, Athanasios
    Computer Science Department, Kuwait University.
    Stochastic Optimal Control for Participatory Sensing Systems with Heterogenous Requests2016In: I.E.E.E. transactions on computers (Print), ISSN 0018-9340, E-ISSN 1557-9956, Vol. 65, no 5, p. 1619-1631Article in journal (Refereed)
    Abstract [en]

    We consider the crucial problem of maximizing the system-wide performance which takes into account request processing throughput, smartphone user experience and system stability in a participatory sensing system with cooperative smartphones. Three important controls need to be made, i.e., 1) request admission control, 2) task allocation, and 3) task scheduling on smartphones. It is highly challenging to achieve the optimal system-wide performance, given arbitrary unknown arrivals of sensing requests, intrinsic tradeoff between request processing throughput and smartphone user experience degradation, and heterogenous requests. Little existing work has studied this crucial problem of maximizing the system-wide performance of a participatory sensing system as a whole. In response to the challenges, we propose an optimal online control approach to maximize the system-wide performance of a participatory sensing system. Exploiting the stochastic Lyapunov optimization techniques, it derives the optimal online control strategies for request admission control, task allocation and task scheduling on smartphones. The most salient feature of our approach is that the achieved system-wide performance is arbitrarily close to the optimum, despite unpredictable and arbitrary request arrivals. Rigorous theoretical analysis and comprehensive simulation evaluation jointly demonstrate the efficacy of our online control approach.

  • 328.
    Abdelaziz, Ahmed
    et al.
    Faculty of Computer Science and Information Technology, University of Malaya, Kuala Lumpur.
    Ang, Tanfong
    Faculty of Computer Science and Information Technology, University of Malaya, Kuala Lumpur.
    Sookhak, Mehdi
    Faculty of Computer Science and Information Technology, University of Malaya, Kuala Lumpur.
    Khan, Suleman
    Faculty of Computer Science and Information Technology, University of Malaya, Kuala Lumpur.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Liew, Cheesun
    Faculty of Computer Science and Information Technology, University of Malaya, Kuala Lumpur.
    Akhunzada, Adnan
    Faculty of Computer Science and Information Technology, University of Malaya, Kuala Lumpur.
    Survey on network virtualization using openflow: Taxonomy, opportunities, and open issues2016In: KSII Transactions on Internet and Information Systems, ISSN 1976-7277, Vol. 10, no 10, p. 4902-4932Article in journal (Refereed)
    Abstract [en]

    The popularity of network virtualization has recently regained considerable momentum because of the emergence of OpenFlow technology. It is essentially decouples a data plane from a control plane and promotes hardware programmability. Subsequently, OpenFlow facilitates the implementation of network virtualization. This study aims to provide an overview of different approaches to create a virtual network using OpenFlow technology. The paper also presents the OpenFlow components to compare conventional network architecture with OpenFlow network architecture, particularly in terms of the virtualization. A thematic OpenFlow network virtualization taxonomy is devised to categorize network virtualization approaches. Several testbeds that support OpenFlow network virtualization are discussed with case studies to show the capabilities of OpenFlow virtualization. Moreover, the advantages of popular OpenFlow controllers that are designed to enhance network virtualization is compared and analyzed. Finally, we present key research challenges that mainly focus on security, scalability, reliability, isolation, and monitoring in the OpenFlow virtual environment. Numerous potential directions to tackle the problems related to OpenFlow network virtualization are likewise discussed

  • 329.
    Normark, Carl Jörgen
    et al.
    Luleå University of Technology, Department of Business Administration, Technology and Social Sciences, Innovation and Design.
    Parnes, Peter
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Ek, Robert
    Luleå University of Technology, Department of Arts, Communication and Education, Music and dance.
    Andersson, Harald
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    The Extended Clarinet2016Conference paper (Refereed)
  • 330.
    Yan, Zheng
    et al.
    State Key Laboratory on Integrated Services Networks, Xidian University.
    Ding, Wenxiu
    State Key Laboratory of Integrated Services Networks, Xidian University.
    Niemi, Valtteri
    State Key Laboratory of Integrated Services Networks, Xidian University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Two Schemes of Privacy-Preserving Trust Evaluation2016In: Future generations computer systems, ISSN 0167-739X, E-ISSN 1872-7115, Vol. 62, p. 175-189Article in journal (Refereed)
    Abstract [en]

    Trust evaluation computes trust values by collecting and processing trust evidence. It plays an important role in trust management that automatically ensures trust relationships among system entities and enhances system security. But trust evidence collection and process may cause privacy leakage, which makes involved entities reluctant to provide personal evidence that is essential for trust evaluation. Current literature pays little attention to Privacy-Preserving Trust Evaluation (PPTE). Existing work still has many limitations, especially on generality, efficiency and reliability. In this paper, we propose two practical schemes to guard privacy of trust evidence providers based on additive homomorphic encryption in order to support a traditional class of trust evaluation that contains evidence summation. The first scheme achieves better computational efficiency, while the second one provides greater security at the expense of a higher computational cost. Accordingly, two trust evaluation algorithms are further proposed to flexibly support different application cases. Specifically, these algorithms can overcome attacks raised by internal malicious evidence providers to some extent even though the trust evaluation is partially performed in an encrypted form. Extensive analysis and performance evaluation show the security and effectivity of our schemes for potential application prospect and their efficiency to support big data process

  • 331.
    Qiao, Yuanyuan
    et al.
    Beijing Key Laboratory of Network System Architecture and Convergence, BUPT, Beijing.
    Zhang, Yanting
    Beijing Key Laboratory of Network System Architecture and Convergence, BUPT, Beijing.
    Lindgren, Anders
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Yang, Jie
    Beijing Key Laboratory of Network System Architecture and Convergence, BUPT, Beijing.
    Understanding Online Shopping and Offline Mobility Behavior in Urban Area from the View of Multilayer Network2016Conference paper (Refereed)
    Abstract [en]

    The interactive nature of the Internet offers many opportunities to increase the efficiency of online shopping by improving availability of product information, enabling direct multi-attribute comparisons, and reducing buyer search costs. A great body of research focuses on how consumers shop online or why and how online shopping impacts urban development, but the understanding of mutual influence between online and offline behavior of consumers remains somewhat underserved. This paper bridges that gap by quantifying the relationship between consumers' online shopping and offline mobility behavior. The results of the study give insights to further understand human behavior from both a cyber and real world point of view, which may help to place location based targeted advertisements, and plan commercial & retail centers in urban areas.

  • 332.
    Kikhia, Basel
    et al.
    Luleå University of Technology, Department of Health Sciences, Nursing Care.
    Stavropoulos, Thanos G.
    Information Technologies Institute, Centre for Research & Technology Hellas.
    Andreadis, Stelios
    Information Technologies Institute, Centre for Research & Technology Hellas.
    Karvonen, Niklas
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Kompatsiaris, Ioannis
    Information Technologies Institute, Centre for Research & Technology Hellas.
    Sävenstedt, Stefan
    Luleå University of Technology, Department of Health Sciences, Nursing Care.
    Pijl, Marten
    Personal Health Solutions, Philips Research.
    Melander, Catharina
    Luleå University of Technology, Department of Health Sciences, Nursing Care.
    Utilizing a Wristband Sensor to Measure the Stress Level for People with Dementia2016In: Sensors, ISSN 1424-8220, E-ISSN 1424-8220, Vol. 16, no 12, article id 1989Article in journal (Refereed)
    Abstract [en]

    Stress is a common problem that affects most people with dementia and their caregivers. Stress symptoms for people with dementia are often measured by answering a checklist of questions by the clinical staff who work closely with the person with the dementia. This process requires a lot of effort with continuous observation of the person with dementia over the long term. This article investigates the effectiveness of using a straightforward method, based on a single wristband sensor to classify events of "Stressed" and "Not stressed" for people with dementia. The presented system calculates the stress level as an integer value from zero to five, providing clinical information of behavioral patterns to the clinical staff. Thirty staff members participated in this experiment, together with six residents suffering from dementia, from two nursing homes. The residents were equipped with the wristband sensor during the day, and the staff were writing observation notes during the experiment to serve as ground truth. Experimental evaluation showed relationships between staff observations and sensor analysis, while stress level thresholds adjusted to each individual can serve different scenarios.

  • 333.
    Sarkar, Chayan
    et al.
    Delft University of Technology.
    Rao, Vijay S.
    Delft University of Technology.
    Prasad, R. Venkatesha
    Delft University of Technology.
    Das, Sankar Narayan
    IIT Kanpur.
    Misra, Sudip
    IIT Kharagpur.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    VSF: An Energy-Efficient Sensing Framework Using Virtual Sensors2016In: IEEE Sensors Journal, ISSN 1530-437X, E-ISSN 1558-1748, Vol. 16, no 12, p. 5046-5059, article id 7440786Article in journal (Refereed)
    Abstract [en]

    this paper, we describe virtual sensing framework (VSF), which reduces sensing and data transmission activities of nodes in a sensor network without compromising on either the sensing interval or data quality. VSF creates virtual sensors (VSs) at the sink to exploit the temporal and spatial correlations amongst sensed data. Using an adaptive model at every sensing iteration, the VSs can predict multiple consecutive sensed data for all the nodes with the help of sensed data from a few active nodes. We show that even when the sensed data represent different physical parameters (e.g., temperature and humidity), our proposed technique still works making it independent of physical parameter sensed. Applying our technique can substantially reduce data communication among the nodes leading to reduced energy consumption per node yet maintaining high accuracy of the sensed data. In particular, using VSF on the temperature data from IntelLab and GreenOrb data set, we have reduced the total data traffic within the network up to 98% and 79%, respectively. Corresponding average root mean squared error of the predicted data per node is as low as 0.36 degrees C and 0.71 degrees C, respectively. This paper is expected to support deployment of many sensors as part of Internet of Things in large scales.

  • 334.
    Hossain, Mohammad Shahadat
    et al.
    University of Chittagong.
    Andersson, Karl
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science. Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Distance- Spanning Technology.
    Naznin, Samina
    Department of Computer Science and Engineering, University of Chittagong.
    A Belief Rule Based Expert System to Diagnose Measles under Uncertainty2015In: Proceedings of the 2015 International Conference on Health Informatics and Medical Systems (HIMS'15) / [ed] Hamid R. Arabnia; Leonidas Deligiannidis; George Jandieri; Ashu M. G. Solo; Fernando G. Tinetti, CSREA Press, 2015, p. 17-23Conference paper (Refereed)
    Abstract [en]

    Measles is a highly infectious child disease that causes serious complications and death worldwide. Measles is generally diagnosed from its signs and symptoms by a physician, which cannot be measured with 100% certainty during the diagnosis process. Consequently, the traditional way of diagnosing measles from its signs and symptoms lacks the accuracy. Therefore, a belief rule-based inference methodology using evidential reasoning approach (RIMER), which is capable of handling various types of uncertainties has been used to develop an expert system to diagnose measles under uncertainty. The results, generated, from the system have been compared with the expert opinion as well as with a Fuzzy Logic based system. In both the cases, it has been found that the Belief Rule Based Expert (BRBES), presented in this paper, is more reliable and accurate.

  • 335.
    Beattie, Mark
    et al.
    Computer Science Research Institute and School of Computing and Mathematics, University of Ulster.
    Hallberg, Josef
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Nugent, Chris D.
    University of Ulster. School of Computing and Mathematics, University of Ulster, Computer Science Research Institute, University of Ulster.
    Synnes, Kåre
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Cleland, Ian
    University of Ulster. School of Computing and Mathematics.
    Lee, Sungyoung
    Ubiquitous Computing Laboratory, Kyung Hee University, Seocheon-dong, Giheung-gu.
    A Collaborative Patient-Carer Interface for Generating Home Based Rules for Self-Management2015In: Smart Homes and Health Telematics: 12th International Conference, ICOST 2014, Denver, CO, USA, June 25-27, 2014, Revised Papers / [ed] Cathy Bodine; Sumi Helal; Tao Gu; Mounir Mokhtari, New York: Encyclopedia of Global Archaeology/Springer Verlag, 2015, p. 93-102Conference paper (Refereed)
    Abstract [en]

    The wide spread prevalence of mobile devices, the decreasing costs of sensor technologies and increased levels of computational power have all lead to a new era in assistive technologies to support persons with Alzheimer’s disease. There is, however, still a requirement to improve the manner in which the technology is integrated into current approaches of care management. One of the key issues relating to this challenge is in providing solutions which can be managed by non-technically orientated healthcare professionals. Within the current work efforts have been made to develop and evaluate new tools with the ability to specify, in a non-technical manner, how the technology within the home environment should be monitored and under which conditions an alarm should be raised. The work has been conducted within the remit of a collaborative patient-carer system to support self-management for dementia. A visual interface has been developed and tested with 10 healthcare professionals. Results following a post evaluation of system usability have been presented and discussed.

  • 336.
    Liu, Kai
    et al.
    School of Electronics and Information Engineering, Beihang University, Beijing.
    Chang, Xiaoyang
    School of Electronics and Information Engineering, Beihang University, Beijing.
    Liu, Feng
    School of Electronics and Information Engineering, Beihang University, Beijing.
    Wang, Xin
    Shanghai Key Lab of Intelligent Information Processing, School of Computer Science, Fudan University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    A Cooperative MAC Protocol with Rapid Relay Selection for Wireless Ad hoc Networks2015In: Computer Networks, ISSN 1389-1286, E-ISSN 1872-7069, Vol. 91, p. 262-282Article in journal (Refereed)
    Abstract [en]

    We propose a cooperative MAC protocol with rapid relay selection (RRS-CMAC) to improve the cooperation efficiency and multiple access performance in wireless ad hoc networks. In this protocol, if the data rate between a sender and its recipient is low, an optimal relay is selected by a rate differentiation phase (RDP), priority differentiation phase (PDP), and contention resolution phase (CRP) for relays with the same priority. In the RDP, each contending relay determines its data rate level based on the data rate from the sender to itself and that from itself to the recipient, and then broadcasts busy tones to its neighbor nodes or senses the channel according to the values of its binary digits, which are determined by its data rate level. Relays with the highest data rate levels win and continue to the next phase. In PDP, these winning relays send busy tones or sense the channel according to their own priority values, with the highest priority relays winning in this phase. Then CRP is performed using k-round contention resolution (k-CR) to select a unique optimal relay. Relays sending busy tones earliest and for the longest duration proceed to the next round, while others, sensing a busy tone, subsequently withdraw from contention. A packet piggyback mechanism is adopted to allow data packet transmission without reservation if the winning relay has a packet to send, and the direct transmission rate to its recipient is high. This reduces reservation overhead and improves channel utilization. Both theoretical analysis and simulation results show that the throughput of the proposed protocol is better than those of the CoopMACA and 2rcMAC protocols.

  • 337.
    Sakai, Kazuya
    et al.
    Department of Information and Communication Systems, Tokyo Metropolitan University.
    Sun, Min-Te
    Department of Computer Science and Information Engineering, National Central University, Taoyuan.
    Ku, Wei-Shinn
    Department of Computer Science and Software Engineering, Auburn University.
    Lai, Ten H.
    Department of Computer Science and Engineering, The Ohio State University, Columbus.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    A Framework for the Optimal k-Coverage Deployment Patterns of Wireless Sensors2015In: IEEE Sensors Journal, ISSN 1530-437X, E-ISSN 1558-1748, Vol. 15, no 12, p. 7273-7283Article in journal (Refereed)
    Abstract [en]

    The strategy for node deployment to achieve multiple connectivity and coverage plays an important role in various wireless senor network applications. To alleviate the operational cost, the number of nodes to be deployed needs to be reduced. While the optimal k-connectivity deployment patterns (k <= 6) and the multiple k-coverage problem (k <= 3) have been extensively studied for 2-D networks, a general method to identify the optimal deployment pattern for any given sensor coverage requirement has yet to be found. Considering the ease of sensor deployment and operation, the deployment patterns should be identical and symmetric in the deployment region. This implies that the Voronoi diagram of the optimal deployment is a regular tessellation. Based on the fact that there exist only three regular tessellations, we propose a framework, namely, range elimination scheme (RES), to compute the optimal k-coverage deployment pattern for any given k value to accommodate various wireless sensor application requirements. We apply RES to show the optimal k-coverage deployment patterns for 4 <= k <= 9. Our analytical and simulation results show that our proposed framework successfully identifies the optimal deployment patterns and significantly reduces the number of sensors to be deployed

  • 338.
    Femminella, Marco
    et al.
    Department of Engineering, University of Perugia CNIT RU.
    Reali, Gianluca
    Department of Engineering, University of Perugia CNIT RU.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    A Molecular Communications Model for Drug Delivery2015In: IEEE Transactions on Nanobioscience, ISSN 1536-1241, E-ISSN 1558-2639, Vol. 14, no 8, p. 935-945Article in journal (Refereed)
    Abstract [en]

    This paper considers the scenario of a targeted drug delivery system, which consists of deploying a number of biological nanomachines close to a biological target (e.g., a tumor), able to deliver drug molecules in the diseased area. Suitably located transmitters are designed to release a continuous flow of drug molecules in the surrounding environment, where they diffuse and reach the target. These molecules are received when they chemically react with compliant receptors deployed on the receiver surface. In these conditions, if the release rate is relatively high and the drug absorption time is significant, congestion may happen, essentially at the receiver site. This phenomenon limits the drug absorption rate and makes the signal transmission ineffective, with an undesired diffusion of drug molecules elsewhere in the body. The original contribution of this paper consists of a theoretical analysis of the causes of congestion in diffusion-based molecular communications. For this purpose, it is proposed a reception model consisting of a set of pure loss queuing systems. The proposed model exhibits an excellent agreement with the results of a simulation campaign made by using the Biological and Nano-Scale communication simulator version 2 (BiNS2), a well-known simulator for molecular communications, whose reliability has been assessed through in vitro experiments. The obtained results can be used in rate control algorithms to optimally determine the optimal release rate of molecules in drug delivery applications

  • 339.
    Andersson, Karl
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science. Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Distance- Spanning Technology.
    Hossain, Mohammad Shahadat
    University of Chittagong.
    Thapa, Devinder
    Department of Information Systems, University of Agder.
    Zander, Pär-Ola
    Department of Communication and Psychology, Aalborg University.
    A Novel Framework of an Expert System by integrating Capability Approach and BRB to Evaluate E-Government Services2015In: Proceedings of eChallenges e-2015 Conference / [ed] Paul Cunningham; Miriam Cunningham, IIMC International Information Management Corporation Ltd , 2015, p. 1-12, article id 68Conference paper (Refereed)
    Abstract [en]

    Capability approach is hard to operationalize and capabilities are sometimes difficult to reduce into the individual level. We describe our approach to solve these problems paired with an adequate ICT infrastructure and believe that the impact of concrete eGovernment services will become more visible and available. Citizens can inspect it, professionals can target their re-engineering on failure cases, learn from best cases, and researchers can compare different types of eGovernment. The solving of operationalisation will also strengthen the capability approach, by extending its scope from macro theory towards more easy application on the institutional and organizational levels.

  • 340.
    Schelén, Olov
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Elragal, Ahmed
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Haddara, Moutaz
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    A roadmap for big-data research and education2015Report (Other academic)
    Abstract [en]

    The research area known as big data is characterized by the 3 V’s, which are vol- ume; variety; and velocity. Recently, also veracity and value have been associated with big data and that adds up to the 5 V’s. Big data related information systems (IS) are typically highly distributed and scalable in order to handle the huge datasets in organizations. Data processing in such systems includes creation, retrieval, storage, analysis, presentation, visualization, and any other activity that is typical for IS sys- tems. Big data is often associated with business analytics, cloud services, or industrial systems.This document presents a brief overview of the state of the art in selected topics of big data research, with the purpose of providing input to a roadmap for research and education at Lule ̊a University of Technology (LTU). The selection of topics is based on assessments of where LTU can make an impact based on current and anticipated research strengths and position with industry (e.g., process industry, data centers and cloud application providers). Topics include distributed systems, mobility, Internet of Things, and advanced analytics.

  • 341.
    Liu, Yuhong
    et al.
    Department of Information Science and Technology, Penn State Altoona.
    Sun, Yan
    Department of Electrical, Computer and Biomedical Engineering, University of Rhode Island.
    Ryoo, Jungwoo
    Department of Information Science and Technology, Penn State Altoona.
    Rizvi, Syed S.
    Department of Information Science and Technology, Penn State Altoona.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    A survey of security and privacy challenges in cloud computing: Solutions and future directions2015In: Journal of Computing Science and Engineering, ISSN 1976-4677, E-ISSN 2093-8020, Vol. 9, no 3, p. 119-133Article in journal (Refereed)
    Abstract [en]

    While cloud computing is gaining popularity, diverse security and privacy issues are emerging that hinder the rapid adoption of this new computing paradigm. And the development of defensive solutions is lagging behind. To ensure a secure and trustworthy cloud environment it is essential to identify the limitations of existing solutions and envision directions for future research. In this paper, we have surveyed critical security and privacy challenges in cloud computing, categorized diverse existing solutions, compared their strengths and limitations, and envisioned future research directions.

  • 342.
    Wang, Bin
    et al.
    School of Software, Shanghai Jiao Tong University.
    Qi, Zhengwei
    School of Software, Shanghai Jiao Tong University.
    Ma, Ruhui
    School of Software, Shanghai Jiao Tong University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Guan, Haibing
    School of Software, Shanghai Jiao Tong University.
    A survey on data center networking for cloud computing2015In: Computer Networks, ISSN 1389-1286, E-ISSN 1872-7069, Vol. 91, p. 528-547Article in journal (Refereed)
    Abstract [en]

    Data Center Networks (DCNs) are an essential infrastructure that impact the success of cloud computing. A scalable and efficient data center is crucial in both the construction and operation of stable cloud services. In recent years, the growing importance of data center networking has drawn much attention to related issues including connective simplification and service stability. However, existing DCNs lack the necessary agility for multi-tenant demands in the cloud, creating poor responsiveness and limited scalability. In this paper, we present an overview of data center networks for cloud computing and evaluate construction prototypes based on these issues. We provide, specifically, detailed descriptions of several important aspects: the physical architecture, virtualized infrastructure, and DCN routing. Each section of this work discusses and evaluates resolution approaches, and presents the use cases for cloud computing service. In our attempt to build insight relevant to future research, we also present some open research issues. Based on experience gained in both research and industrial trials, the future of data center networking must include careful consideration of the interactions between the important aspects mentioned above

  • 343.
    Mohd, Bassam Jamil
    et al.
    Computer Engineering Department, Hashemite University.
    Hayajneh, Thaier
    School of Engineering and Computing Sciences, New York Institute of Technology.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    A survey on lightweight block ciphers for low-resource devices: Comparative study and open issues2015In: Journal of Network and Computer Applications, ISSN 1084-8045, E-ISSN 1095-8592, Vol. 58, p. 73-93Article in journal (Refereed)
    Abstract [en]

    This paper investigates the lightweight block ciphers' implementations, which have received a fair amount of research for their essential security role in low-resource devices. Our objective is to present a comprehensive review of state-of-the-art research progress in lightweight block ciphers' implementation and highlight future research directions. At first, we present taxonomy of the cipher design space and accurately define the scope of lightweight ciphers for low-resource devices. Moreover, this paper discusses the performance metrics that are commonly reported in the literature when comparing cipher implementations. The sources of inaccuracies and deviations are carefully examined. In order to mitigate the confusion in the composite metrics, we developed a general metric which includes the basic metrics. Our analysis designated the energy/bit metric as the most appropriate metric for energy-constrained low-resource designs. Afterwards, the software and hardware implementations of the block cipher algorithms are surveyed, investigated, and compared. The paper selects the top performing ciphers in various metrics and suggests the Present cipher as a good reference for hardware implementations. What transpires from this survey is that unresolved research questions and issues are yet to be addressed by future research projects.

  • 344.
    Islam, Raihan Ul
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Andersson, Karl
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science. Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Distance- Spanning Technology.
    Hossain, Mohammad Shahadat
    University of Chittagong.
    A Web Based Belief Rule Based Expert System to Predict Flood2015In: Proceedings of the 17th International Conference on Information Integration and Web-based Applications & Services (iiWAS2015) / [ed] Maria Indrawan-Santiago; Matthias Steinbauer; Ismail Khalil; Gabriele Anderst-Kotsis, New York: Association for Computing Machinery (ACM), 2015, p. 19-26, article id 3Conference paper (Refereed)
    Abstract [en]

    Natural calamity disrupts our daily life and brings many sufferings in our life. Among the natural calamities, flood is one of the most catastrophic. Predicting flood helps us to take necessary precautions and save human lives. Several types of data (meteorological condition, topography, river characteristics, and human activities) are used to predict flood water level in an area. In our previous works, we proposed a belief rule based flood prediction system in a desktop environment. In this paper, we propose a web-service based flood prediction expert system by incorporating belief rule base with the capability of reading sensor data such as rainfall, river flow on real time basis. This will facilitate the monitoring of the various flood-intensifying factors, contributing in increasing the flood water level in an area. Eventually, the decision makers would able to take measures to control those factors and to reduce the intensity of flooding in an area.

  • 345.
    Karvonen, Niklas
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Activity recognition in resource-constrained pervasive systems2015Licentiate thesis, comprehensive summary (Other academic)
    Abstract [en]

    There is an increasing need for personalised and context-aware services in our everyday lives and we rely on mobile and wearable devices to provide such services. Data collected from these devices includes important information about users’ movements, locations, physiological status, and environment. This data can be analysed in order to recognise users’ activities and thus provide contextual information for services. Such activity recognition is an important tool for personalising and adapting assistive services and thereby increasing the usefulness of them.This licentiate thesis focuses on three important aspects for activity recognition usingwearable, resource constrained, devices in pervasive services. Firstly, it is investigated how to perform activity recognition unobtrusively by using a single tri-axial accelerometer. This involves finding the best combination of sensor placement and machine learning algorithm for the activities to be recognized. The best overall placement was found to be on the wrist using the random forest algorithm for detecting Strong-Light, Free-Bound and Sudden-Sustained movement activities belonging to the Laban Effort Framework.Secondly, this thesis proposes a novel machine learning algorithm suitable for resource-constrained devices commonly found in wearable and pervasive systems. The proposed algorithm is computationally inexpensive, parallelizable, has a small memory footprint, and is suitable for implementation in hardware. Due to this, it can reduce battery usage, increase responsiveness, and also make it possible to distribute the machine learning task, which enables balancing computational costs against data traffic costs. The proposed algorithm is shown to have a comparable accuracy to that of more advanced machine learning algorithms mainly for datasets with two classes.Thirdly, activity recognition is applied in a personalised and pervasive service for im-proving health and wellbeing. Two monitoring prototypes and one coaching prototype were proposed for achieving positive behaviour change. The three prototypes were evaluated in a user workshop with 12 users aging between 20 and 60. Participants of the workshop believed that the proposed health and wellbeing app is something people are likely to use on a permanent basis.By applying results from this thesis, systems can be made more energy efficient andless obtrusive while still maintaining a high activity recognition accuracy. It also shows that pervasive and wearable systems using activity recognition have the potential of relieving some problems in health and wellbeing that society face today.

  • 346.
    Fong, Simon
    et al.
    Department of Computer and Information Science, University of Macau.
    Ji, Jinyan
    Department of Computer and Information Science, Faculty of Science and Technology, University of Macau.
    Gong, Xueyuan
    Department of Computer and Information Science, University of Macau.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Advances of applying metaheuristics to data mining techniques2015In: Improving Knowledge Discovery through the Integration of Data Mining Techniques, Hershey, PA: IGI Global, 2015, p. 75-103Chapter in book (Refereed)
    Abstract [en]

    Metaheuristics have lately gained popularity among researchers. Their underlying designs are inspired by biological entities and their behaviors, e.g. schools of fish, colonies of insects, and other land animals etc. They have been used successfully in optimization applications ranging from financial modeling, image processing, resource allocations, job scheduling to bioinformatics. In particular, metaheuristics have been proven in many combinatorial optimization problems. So that it is not necessary to attempt all possible candidate solutions to a problem via exhaustive enumeration and evaluation which is computationally intractable. The aim of this paper is to highlight some recent research related to metaheuristics and to discuss how they can enhance the efficacy of data mining algorithms. An upmost challenge in Data Mining is combinatorial optimization that, often lead to performance degradation and scalability issues. Two case studies are presented, where metaheuristics improve the accuracy of classification and clustering by avoiding local optima.

  • 347.
    Zhang, Heng
    et al.
    School of Information Engineering, East China Jiaotong University.
    Liu, Yanli
    School of Information Engineering, East China Jiaotong University.
    Xiong, Nealnaixue
    Department of Business and Computer Science, Southwestern Oklahoma State University.
    Imran, Muhammad Al
    College of Computer and Information Sciences, Almuzahmiyah, King Saud University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    An improved similarity based adaptive step size glowworm algorithm2015In: Journal of Internet Technology, ISSN 1607-9264, E-ISSN 2079-4029, Vol. 16, no 5, p. 905-914Article in journal (Refereed)
    Abstract [en]

    This paper presents the similarity based adaptive step size glowworm swarm optimization algorithm (SBASS-GSO), an improved version of glowworm swarm optimization algorithm (GSO). The standard GSO algorithm lacks unified metric standard to different problems in the selection of neighbor set, which makes the algorithm converge slowly because of improper selection. Because the step size s is fixed, the oscillation phenomenon may occur in local search space, which leads to inferior search accuracy In SBASS-GSO algorithm, we change neighborhood definition base on the similarity not on the distance. The neighborhood is selected by computing average similarity, which provides priori knowledge for the adaptive size s. The dynamic size s is useful for removing oscillation phenomenon and improving the convergence speed. Experimental results demonstrate the efficacy of the proposed glowworm algorithm in capturing multiple optima of a series of complex test functions, such as Zakharov and Sphere functions. We also provide some comparisons of SBASS-GSO with GSO and verify the superiority in the precision and convergence speed.

  • 348.
    Wang, Meisong
    et al.
    Research School of Computer Science, ANU, Canberra.
    Jayaraman, Prem Prakash
    Caulfield School of Information Technology, Monash University, Monash University, Melbourne, VIC, CSIRO, Canberra.
    Ranjan, Rajiv
    CSIRO Computational Informatics, Canberra.
    Mitra, Karan
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Zhang, Miranda
    CSIRO Computational Informatics, Canberra.
    Li, Eddie
    Research School of Computer Science, ANU, Canberra.
    Khan, Samee Ullah
    North Dakota State University, Fargo.
    Pathan, Risat Mahmud
    Chalmers University of Technology, Telstra Corporation, Melbourne.
    Georgeakopoulos, Dimitros
    Royal Melbourne Institute of Technology, Melbourne.
    An Overview of Cloud Based Content Delivery Networks: Research Dimensions and State-of-the-Art2015In: Transactions on Large-Scale Data- and Knowledge-Centered Systems XX: Special Issue on Advanced Techniques for Big Data Management, Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2015, p. 131-158Chapter in book (Refereed)
    Abstract [en]

    Content distribution networks (CDNs) using cloud resources such as storage and compute have started to emerge. Unlike traditional CDNs hosted on private data centers, cloud-based CDNs take advantage of the geographical availability and the pay-as-you-go model of cloud platforms. The Cloud-based CDNs (CCDNs) promote content-delivery-as-a-service cloud model. Though CDNs and CCDNs share similar functionalities, introduction of cloud impose additional challenges that have to be addressed for a successful CCDN deployment. Several papers have tried to address the issues and challenges around CDN with varying degree of success. However, to the best of our knowledge there is no clear articulation of issues and challenges problems within the context of cloud-based CDNs. Hence, this paper aims to identify the open challenges in cloud-based CDNs. In this regard, we present an overview of cloud-based CDN followed by a detailed discussion on open challenges and research dimensions. We present a state-of-the-art survey on current commercial and research/academic CCDNs. Finally, we present a comprehensive analysis of current CCDNs against the identified research dimensions

  • 349.
    Alhamazani, Khalid
    et al.
    University of New South Wales, Sydney.
    Ranjan, Rajiv
    CSIRO, Canberra.
    Mitra, Karan
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Rabhi, Fethi
    University of New South Wales, Sydney.
    Jayaraman, Prem Prakash
    CSIRO, Canberra.
    Khan, Samee Ullah
    North Dakota State University, Fargo.
    Guabtni, Adnene
    NICTA, Sydney.
    Bhatnagar, Vasudha
    University of Delhi.
    An overview of the commercial cloud monitoring tools: research dimensions, design issues, and state-of-the-art2015In: Computing, ISSN 0010-485X, E-ISSN 1436-5057, Vol. 97, no 4, p. 357-377Article in journal (Refereed)
    Abstract [en]

    Cloud monitoring activity involves dynamically tracking the Quality of Service (QoS) parameters related to virtualized resources (e.g., VM, storage, network, appliances, etc.), the physical resources they share, the applications running on them and data hosted on them. Applications and resources configuration in cloud computing environment is quite challenging considering a large number of heterogeneous cloud resources. Further, considering the fact that at given point of time, there may be need to change cloud resource configuration (number of VMs, types of VMs, number of appliance instances, etc.) for meet application QoS requirements under uncertainties (resource failure, resource overload, workload spike, etc.). Hence, cloud monitoring tools can assist a cloud providers or application developers in: (i) keeping their resources and applications operating at peak efficiency, (ii) detecting variations in resource and application performance, (iii) accounting the service level agreement violations of certain QoS parameters, and (iv) tracking the leave and join operations of cloud resources due to failures and other dynamic configuration changes. In this paper, we identify and discuss the major research dimensions and design issues related to engineering cloud monitoring tools. We further discuss how the aforementioned research dimensions and design issues are handled by current academic research as well as by commercial monitoring tools.

  • 350.
    Simon, Miguel Gomez
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Jimenez, Lara Lorna
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Analysis of End-User programming platforms2015Report (Other academic)
    Abstract [en]

    End-user programming platforms allow end-users with and without programming experienceto build applications using a user-friendly graphical environment. This study reviews dif-ferent types of end-user platforms focusing on the features obtained from previous end-usersoftware engineering studies: What You See Is What You Get(WYSIWYG), What You TestIs What You Get (WTISWYG), how the learning by examples methodology is implementedand how the performance of end-user programmers is increased through reusable code. Thestudy also establishes the dierence between end-user programming platforms and tradi-tional programming platforms based on the programmer's interaction. In this report, a newin-between category is dened as End-User Professional Programming Platform, which rep-resents the end-user programming platforms that require the end-user programmer to havea certain programming knowledge. Finally, the research discusses current trends and de-nes new features for the future of end-user platforms, in particular the denition of a newconcept, which is What You SAy Is What You Get(WYSAIWYG).