2018 International Symposium on Programming and Systems (ISPS)最新文献

{"title":"Secure and lightweight biometric-based remote patient authentication scheme for home healthcare systems","authors":"Mohamed Mohammedi, Mawloud Omar, Wassila Aitabdelmalek, Abla Mansouri, A. Bouabdallah","doi":"10.1109/ISPS.2018.8379017","DOIUrl":"https://doi.org/10.1109/ISPS.2018.8379017","url":null,"abstract":"Recently, the home healthcare system has emerged as one of the most useful technology for e-healthcare. Contrary to classical recording methods of patient's medical data, which are, based on paper documents, nowadays all this sensitive data can be managed and forwarded through digital systems. These make possible for both patients and healthcare workers to access medical data or receive remote medical treatment using wireless interfaces whenever and wherever. However, simplifying access to these sensitive and private data can directly put patient's health and life in danger. In this paper, we propose a secure and lightweight biometric-based remote patient authentication scheme using elliptic curve encryption through which two mobile healthcare system communication parties could authenticate each other in public mobile healthcare environments. The security and performance analysis demonstrate that our proposal achieves better security than other concurrent schemes, with lower storage, communication and computation costs.","PeriodicalId":294761,"journal":{"name":"2018 International Symposium on Programming and Systems (ISPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129781618","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An improved K-means cluster-based routing scheme for wireless sensor networks","authors":"M. Lehsaini, Meriem Bouchra Benmahdi","doi":"10.1109/ISPS.2018.8379004","DOIUrl":"https://doi.org/10.1109/ISPS.2018.8379004","url":null,"abstract":"In wireless sensor networks (WSNs), clustering routing schemes have been widely used to reduce energy consumption. In this context, the key point in such topology is how to generate clusters and select cluster-heads to improve network performance. One of solutions is to select cluster-heads alternately because the latter consume more energy due to some extra load for various activities such as data collection, data aggregation, and communication of the aggregated data to the base station. However, most of the cluster-based solutions proposed in the literature do not take into account the generation of balanced clusters with cluster-heads having more residual energy and closer to the members of their corresponding clusters. In this paper, we propose two cluster-based routing schemes. The first is based on K-means approach and the second is an improved version of K-means approach. The latter generates balanced clusters, which allows to distribute the load equitably among the cluster-heads. Simulation results show that the proposed routing schemes balance the energy consumption among the cluster-heads, and significantly improves the network lifetime compared to LEACH (Low Energy Adaptive Clustering Hierarchy) protocol.","PeriodicalId":294761,"journal":{"name":"2018 International Symposium on Programming and Systems (ISPS)","volume":"102 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113996490","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Towards privacy and ownership preserving of outsourced health data in IoT-cloud context","authors":"Youcef Ould-Yahia, S. Bouzefrane, H. Boucheneb","doi":"10.1109/ISPS.2018.8379018","DOIUrl":"https://doi.org/10.1109/ISPS.2018.8379018","url":null,"abstract":"In this paper, we propose a novel data-owner centric privacy model for in-home-monitoring applications, that implements a promising attribute-based encryption (ABE) to reinforce the data-owner access control and the security of anonymous data access. This proposed protocol avoids threats from curious cloud service providers. Unlike other schemes that implement ABE by outsourcing the heavy computational tasks such as encryption and decryption processes, we propose a framework in which we externalize the complete ABE-encryption algorithms to avoid complex outsourcing process and use well know efficient symmetric encryption in constrained devices. We have performed an experimental analysis to show how much gain allows such offloading.","PeriodicalId":294761,"journal":{"name":"2018 International Symposium on Programming and Systems (ISPS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117055276","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Rule-based approach for detecting dirty data in discharge summaries","authors":"L. Rabia, Idir Amine Amarouche, Kadda Beghdad Bey","doi":"10.1109/ISPS.2018.8379015","DOIUrl":"https://doi.org/10.1109/ISPS.2018.8379015","url":null,"abstract":"Hospital Information Systems (HIS) are responsible for the production, analysis and dissemination of different data in hospital facilities. As the availability of these data increases, it also heightens the problem of data quality. Indeed, despite the fact that several solutions are developed to deal with data quality, the dirty data persist. In this context, HIS would be provided by an accurate solution for dirty data detection and resolution. The present paper proposes a rule-based approach for both describing a subset's dirty data occurring in Discharge Data Summaries, called. Discharge Dirty Data Summaries (D3S) and assisting health practitioners in repairing it. Precisely, the proposed solution provides an automatic-way to deal with D3S. An empirical evaluation of the proposed approach with real clinical data provides preliminary evidence for the effectiveness of our proposal.","PeriodicalId":294761,"journal":{"name":"2018 International Symposium on Programming and Systems (ISPS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124955505","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Adaptive credit-based stimulation scheme for dealing with smart selfish nodes in mobile ad hoc network","authors":"Mahdi Bounouni, L. Bouallouche-Medjkoune","doi":"10.1109/ISPS.2018.8379006","DOIUrl":"https://doi.org/10.1109/ISPS.2018.8379006","url":null,"abstract":"Mobile ad hoc network (MANET) assumes that all mobile nodes are cooperative. However, this cooperation cannot be assured due to MANET features such limited resources of nodes and network openness. Since mobile nodes are constrained in term of energy, nodes may behave selfishly by refusing to forward packets for the benefits of other nodes in order save their energy. Credit-based schemes and reputation-based schemes have been proposed to deal with selfish nodes. Although these schemes can stimulate the cooperation of selfish nodes, they fail to detect smart selfish nodes dropping packets at a low rate in order to avoid being considered as selfish, while at the same time to use network resources freely. In this paper, we address the problem of smart selfish nodes by proposing a new adaptive credit-based stimulation scheme, called NADS. In NADS scheme, each node maintains a credit-account for each neighbor. The price and the reward of each packet relayed depend on the cooperation level of nodes. The proposed scheme is designed to perform in a fully distributed fashion without involving any central authority. The simulation results show that NADS scheme reduces the selfish delivery ratio and the exclusion times of selfish nodes in comparison to OCEAN an EAACK scheme.","PeriodicalId":294761,"journal":{"name":"2018 International Symposium on Programming and Systems (ISPS)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128328352","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Towards customizable networks","authors":"T. Taleb","doi":"10.1109/isps.2018.8378958","DOIUrl":"https://doi.org/10.1109/isps.2018.8378958","url":null,"abstract":"The telecom industry keeps reinventing itself. Soon, the world will be experiencing the 5th generation mobile networks (5G). These 5G mobile systems are expected to meet different strict requirements beyond the traditional operator use cases. Major obstacles to overcome in 5G systems are principally the highly-centralized architecture of mobile networks along with the static provisioning and configuration of network nodes built on dedicated hardware components. This has resulted in lack of elasticity and flexibility in deployment of mobile networks; rendering their run-time management costly, cumbersome and time-consuming. On the other hand, mobile networks are nowadays architected to serve all mobile users; ensuring some degree of service-level differentiation, by making decisions on different user profiles, but with no specific tailoring of the functioning to the specific user needs. However, statistics demonstrate that users do not behave all in the same way. Furthermore, a single mobile network usually ensures the communication for all service types, regardless of the suitability of its available functionality to deliver these services with acceptable Quality of Experience and network efficiency. It becomes then apparent that having the same mobile network architecture serving all mobile users, let alone all mobile applications, despite the diversity they exhibit in their attitudinal response to mobile services, have to be rethought. 5G systems need to accommodate elasticity, flexibility, dynamicity, scalability, manageability, agility and customization along with different levels of service delivery parameters according with the service requirements. For this purpose, different requirements have to be met and numerous associated challenges have to be subsequently tackled. This keynote will touch upon the recent trends the mobile telecommunications market is experiencing and discuss the challenges these trends are representing to mobile network operators. To cope with these trends, the keynote will then showcase the feasibility of on-demand creation of cloud-based elastic mobile networks, along with their lifecycle management. The keynote will introduce a set of technologies and key architectural elements to realize such vision, turning end-to-end mobile networking into software engineering. The keynote will particularly showcase the need for the deep customization of mobile networks at different granularity levels: per network, per application, per group of users, per individual users and even per data of users. The keynote will also assess the potential of Network Function Virtualization, Software Defined Networking and Network Slicing to provide the appropriate customization and highlights the technology challenges. The keynote will also elaborate on a high level architectural solution addressing a massive multi-slice environment.","PeriodicalId":294761,"journal":{"name":"2018 International Symposium on Programming and Systems (ISPS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125827956","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Recommendation diversification using a weighted similarity measure in user based collaborative filtering","authors":"ChemsEddine Berbague, Nour El-islam Karabadji, H. Seridi","doi":"10.1109/ISPS.2018.8379011","DOIUrl":"https://doi.org/10.1109/ISPS.2018.8379011","url":null,"abstract":"In real world e-commerce applications, users express partially their preference in aim of getting back automatically valuable recommendations. The importance of that process has known an increasing development due to the high number of available products under the trade which influences negatively user choice making. The collaborative filtering approach consists of mining users/items data to model the preferences in the form of common profiles. Since ratings prediction is computed by aggregating neighbors ratings, the predictions could be calculated by performing a based similarity neighborhood selection. In this paper, we propose a weighted similarity measure as an alternative to the conventional similarity metrics used in the collaborative filtering. The proposed weights have improved novelty, diversity metrics as well as recommendation accuracy metrics. We have compared our proposed model against memory user based collaborative filtering.","PeriodicalId":294761,"journal":{"name":"2018 International Symposium on Programming and Systems (ISPS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127598623","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Graphical notation and tool to design JCSP programs","authors":"Moncef Trima, T. Benouhiba","doi":"10.1109/ISPS.2018.8379013","DOIUrl":"https://doi.org/10.1109/ISPS.2018.8379013","url":null,"abstract":"Java for CSP (JCSP) is a library based on Communicating Sequential Processes (CSP) which is a formalism used for describing and formally verifying concurrent systems at a high level of abstraction. JCSP does not require advanced mathematical skills. However, the design, verification and test of JCSP systems can be hindered when done at the source code level. In this paper, we suggest an intermediate level of abstraction between CSP and JCSP in the form of a graphical notation close to JCSP components. This enables reasoning about the behavior of the developed system by using a familiar, abstract and yet executable notation. Hence, CSP models can still be abstracted when a formal verification is required, and the translation to JCSP code is simplified. A prototype tool supporting the notation is presented together with a design example. The tool enables the reuse of designed models as new building blocks, which may accelerate the design process.","PeriodicalId":294761,"journal":{"name":"2018 International Symposium on Programming and Systems (ISPS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132278944","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Predator prey optimizer and DTCWT for multimodal medical image fusion","authors":"Hassiba Talbi, M. Kholladi","doi":"10.1109/ISPS.2018.8379023","DOIUrl":"https://doi.org/10.1109/ISPS.2018.8379023","url":null,"abstract":"In this paper, we propose a hybrid algorithm of Predator Prey Optimizer (PPO) with a multi-resolution transform, Dual Tree Complex Wavelet Transform (DTCWT). This hybridizing approach, which combine positive features of the two algorithms, aims to solve the problem of multimodal medical image fusion. The source images to be fused are decomposed by this new algorithm into high-frequency and low-frequency coefficients. Then we proceed by fusing these two types of coefficients in different manners: high-frequency coefficients are fused by the absolute maximum method and the low-frequency coefficients are fused by weighted average method in which the weights are estimated and optimized by the predator prey optimizer to gain optimal result. We demonstrate by the experiments that this algorithm provides a robust and efficient way to fuse multimodal medical images compared to existing Wavelet Transform algorithms because it gives promising results and it is better to obtain more information in fused image.","PeriodicalId":294761,"journal":{"name":"2018 International Symposium on Programming and Systems (ISPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130154032","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A collaborative recommendation system for location based social networks","authors":"Abdelkader Belkhir, F. M. Bouyakoub, Mohamed Boubenia","doi":"10.1109/ISPS.2018.8379012","DOIUrl":"https://doi.org/10.1109/ISPS.2018.8379012","url":null,"abstract":"We propose a trust-aware collaborative filtering for the recommendation of services in a mobile scenario. We used Jaccard measure to select user's neighborhood containing the most similar users in terms of interests, and exploited the explicit social links existing between users in social networks as trust information, in order to optimize the quality of the neighborhood. We also propose to use an early proposed similarity measure, QSim, to compare profiles.","PeriodicalId":294761,"journal":{"name":"2018 International Symposium on Programming and Systems (ISPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122664947","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}