{"title":"A cooperative solver for single machine total weighted tardiness scheduling problem","authors":"Lamiche Chaabane","doi":"10.1109/ISPS.2018.8379016","DOIUrl":"https://doi.org/10.1109/ISPS.2018.8379016","url":null,"abstract":"In this paper, we aim to present a novel efficient approach called improved genetic simulated annealing algorithm (IGASA) in order to minimize the total weighted tardiness of n jobs on a single machine, which is recognized in the literature as a strong NP-hard Problem. The proposed model takes advantages of the genetic algorithm (GA) as a global search strategy and the capability of the improved simulated annealing (ISA) technique to improve solution quality in local regions. Experimental results on a set of benchmarks demonstrated the potent of our developed algorithm to find a good solutions which are significantly outperforms some other published works.","PeriodicalId":401258,"journal":{"name":"2017 First International Conference on Embedded & Distributed Systems (EDiS)","volume":"120 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":"116356874","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}
Khalil Ibrahim Hamzaoui, M. Berrajaa, M. Azizi, G. Lipari, Pierre Boulet
{"title":"An experimental methodology for modeling the energy consumption of mobile devices","authors":"Khalil Ibrahim Hamzaoui, M. Berrajaa, M. Azizi, G. Lipari, Pierre Boulet","doi":"10.1109/EDIS.2017.8284036","DOIUrl":"https://doi.org/10.1109/EDIS.2017.8284036","url":null,"abstract":"Energy consumption is the result of interactions between hardware, software, users, and the application environment. Optimization of energy consumption has become crucial, energy metric is considered a critical metric, so it is important knowing how to measure and understand how energy is consumed on mobile devices. Accurate knowledge will allow us to propose different solutions to reduce energy consumption in order to improve the user experience. In this paper we propose an experimental methodology to build a model of the energy consumption of an application. We show in this paper how to build a simple predictive model of the energy consumption of an unconnected application based on precise measurements.","PeriodicalId":401258,"journal":{"name":"2017 First International Conference on Embedded & Distributed Systems (EDiS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134044495","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}
Pierre-Yves Péneau, D. Novo, Florent Bruguier, G. Sassatelli, A. Gamatie
{"title":"Performance and energy assessment of last-level cache replacement policies","authors":"Pierre-Yves Péneau, D. Novo, Florent Bruguier, G. Sassatelli, A. Gamatie","doi":"10.1109/EDIS.2017.8284032","DOIUrl":"https://doi.org/10.1109/EDIS.2017.8284032","url":null,"abstract":"The Last-Level Cache (LLC) is a critical component of the memory hierarchy which has a direct impact on performance. Whenever a data requested by a processor core is not found in the cache a transaction to the main memory is initiated, which results in both performance and energy penalties. Decreasing LLC miss rate therefore lowers external memory transactions which is beneficial both power and performance-wise. The cache replacement policy has a direct impact on the miss rate. It is responsible of data eviction of cache lines whenever the cache runs full. Thus, a good policy should evict data that will be re-used in a distant-future, and favour data that are likely to be accessed in the near-future. The most common cache replacement policy is the Least-Recently Used (LRU) strategy. It has been used for years and is cheaper in terms of hardware implementation. However, researchers have shown that LRU is not the most efficient policy from a performance point of view, and is further largely sub-optimal compared to the best theoretical strategy. In this paper, we analyze a number of cache replacement policies that have been proposed over the last decade and carry out evaluations reporting performance and energy.","PeriodicalId":401258,"journal":{"name":"2017 First International Conference on Embedded & Distributed Systems (EDiS)","volume":"275 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133871121","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":"How could compile-time program analysis help leveraging emerging NVM features?","authors":"Rabab Bouziane, Erven Rohou, A. Gamatie","doi":"10.1109/EDIS.2017.8284031","DOIUrl":"https://doi.org/10.1109/EDIS.2017.8284031","url":null,"abstract":"Beyond the fact of generating machine code, compilers play a critical role in delivering high performance, and more recently high energy efficiency. For decades, the memory technology of target systems has consisted in SRAM at cache level, and DRAM for main memory. Emerging non-volatile memories (NVMs) open up new opportunities, along with new design challenges. In particular, the asymmetric cost of read/write accesses calls for adjusting existing techniques in order to efficiently exploit NVMs. In addition, this technology makes it possible to design memories with cheaper accesses at the cost of lower data retention times. These features can be exploited at compile time to derive better data mappings according to the application and data retention characteristics. We review a number of compile-time analysis and optimization techniques, and how they could apply to systems in presence of NVMs. In particular, we consider the case of the reduction of the number of writes, and the analysis of variables lifetime for memory bank assignment of program variables.","PeriodicalId":401258,"journal":{"name":"2017 First International Conference on Embedded & Distributed Systems (EDiS)","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116573388","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 new framework for web service discovery in distributed environments","authors":"Nadia Ben Seghir, O. Kazar","doi":"10.1109/EDIS.2017.8284046","DOIUrl":"https://doi.org/10.1109/EDIS.2017.8284046","url":null,"abstract":"Web services are meaningful only if potential users may find and execute them. Universal Description Discovery and Integration (UDDI) help businesses, organizations, and other Web Services providers to discover and reach to the service(s) by providing the URI of the WSDL file. However, it does not offer a mechanism to choose a Web service based on its quality. The standard also lacks of sufficient semantic description in the content of Web services, this lack makes it difficult to find and compose suitable Web services during analysis, search, and matching processes. In addition, a central UDDI suffers from one centralized point problem and the high cost of maintenance. To get around these problems, the authors propose in this paper a novel framework based on mobile agent and metadata catalogue for WS discovery. Our approach is based on user profile in order to discover appropriate WS, meeting customer requirements, in less time and taking into account the QoS properties.","PeriodicalId":401258,"journal":{"name":"2017 First International Conference on Embedded & Distributed Systems (EDiS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115001630","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}
Soraya Cheriguene, Nabiha Azizi, H. Djellali, Oulfa Bunakhla, M. Aldwairi, Amel Ziani
{"title":"New computer aided diagnosis system for glaucoma disease based on twin support vector machine","authors":"Soraya Cheriguene, Nabiha Azizi, H. Djellali, Oulfa Bunakhla, M. Aldwairi, Amel Ziani","doi":"10.1109/EDIS.2017.8284039","DOIUrl":"https://doi.org/10.1109/EDIS.2017.8284039","url":null,"abstract":"Glaucoma is a group of eye diseases that cause an irreparable decrease in the view field which is the second most common and leading causes of blindness among retinal diseases. Computer aided diagnosis (CAD) system is an emerging field in medical informatics which has high importance for providing prognosis of diseases. Research efforts have reported with increasing confirmation that the twin support vector machines (TWSVM) have greater accurate diagnosis ability. The goal of TWSVM is to construct two non-parallel planes for each class such that each hyper-plane is closer to one of two classes and as far as possible from the other one. In this paper, we propose a new CAD system for glaucoma diagnosis using TWSVM and three heterogeneous families of feature extraction. In this work, we have used 169 images to classify into normal and glaucoma classes. The performance of the method is evaluated using classification accuracy, sensitivity, specificity and receiver operating characteristic (ROC) curves. The results show that the highest classification accuracy (98,53%) is obtained for the TWSVM using Gaussian kernel function, and this is very promising compared to the SVM results.","PeriodicalId":401258,"journal":{"name":"2017 First International Conference on Embedded & Distributed Systems (EDiS)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124172419","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":"Hybrid PSO-TS approach for solving the quadratic three-dimensional assignment problem","authors":"Imène Ait Abderrahim, Lakhdar Loukil","doi":"10.1109/EDIS.2017.8284041","DOIUrl":"https://doi.org/10.1109/EDIS.2017.8284041","url":null,"abstract":"The quadratic three-dimensional assignment problem (Q3AP) is a generalization of the well-known quadratic assignment problem (QAP). Unlike QAP which has been extensively studied by the combinatorial optimization community, few works have been devoted to the resolution of the Q3AP which is proved to be an NP-hard problem. In this paper, a particle swarm optimization algorithm hybridized with a tabu search is presented to solve the quadratic three-dimensional assignment problem.","PeriodicalId":401258,"journal":{"name":"2017 First International Conference on Embedded & Distributed Systems (EDiS)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114406527","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":"The use of an efficient QRS detection algorithm for the compression of ECG signals with large QRS waves","authors":"Imene Soussi, M. Ouslim","doi":"10.1109/EDIS.2017.8284034","DOIUrl":"https://doi.org/10.1109/EDIS.2017.8284034","url":null,"abstract":"Recently, the development of storage and transmission technologies and the evolution of information systems, require the handling of large amount of data. Hence, data compression has become essential for both storage and transmission. In this paper, we investigate the influence of an efficient QRS detection technique on the compression quality of a new proposed compression method, in the case of the ECG signals with large QRS waves. The proposed compression method is based on the singular value decomposition and the vector quantization, a compensation technique of the residual reconstruction error is also proposed for the reduction of the reconstruction error. We conducted several tests using arrhythmia database of the Massachusetts Institute of Technology-Beth Israel Hospital. The obtained results are very satisfactory, whether in the case of ECG signals with wide or narrow QRS waves. A compression ratio of 102.54 was reached for a low reconstruction error.","PeriodicalId":401258,"journal":{"name":"2017 First International Conference on Embedded & Distributed Systems (EDiS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115034382","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":"Named entity recognition for Psychological domain: Challenges in document annotation for the Arabic Language","authors":"Kheira Lakel, F. Bendella, Samira Benkhadda","doi":"10.1109/EDIS.2017.8284028","DOIUrl":"https://doi.org/10.1109/EDIS.2017.8284028","url":null,"abstract":"The named entity extraction to improve not only the keyword search but become an essential element for semantic annotation and it opened the door for recognition of medical named entities which is a difficult task for the extraction of information and understanding of the natural language. Considerable work has been done for the semantic annotation of the biomedical text, in particular English, thanks to the variety of tools available for this language. In this article we propose an approach for the semantic annotation of psychological texts in Arabic based on the named entity. Two techniques were applied for the recognition processes: the first requirement prior to the technique was completely dependent on direct identification with the utilization of gazetteers and the second technique is a rule-based model in which rules are techniques were put constructed on the basis of a gazetteers list. Experiments yield the overall Fmeasure values of 86,407.","PeriodicalId":401258,"journal":{"name":"2017 First International Conference on Embedded & Distributed Systems (EDiS)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127099854","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 weighted minimal fully adaptive congestion aware routing algorithm for Network on Chip","authors":"Habib Chawki Touati, Fateh Boutekkouk","doi":"10.1109/EDIS.2017.8284033","DOIUrl":"https://doi.org/10.1109/EDIS.2017.8284033","url":null,"abstract":"One of the commonly known issues that contribute to performance degradation in on-chip communication is congestion, by stalling data packets and increasing average latency. The most efficient way to limit its effect is through the implementation of a reliable congestion aware routing scheme, that helps select the less congested routes for packet transmission. In this paper, a novel weighted minimal fully adaptive congestion aware routing algorithm for network on chip is presented. Instead of leveraging congestion-related information along each dimension separately, the proposed scheme investigates congestion along both dimensions at once, and offers a compromise between locally and globally aware routing in mesh-based NoC. Experimental results show that the proposed algorithm outperforms its peers with regard to average network latency and throughput.","PeriodicalId":401258,"journal":{"name":"2017 First International Conference on Embedded & Distributed Systems (EDiS)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128243590","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}