Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905552
Mohammed Rida Ech-Charrat, K. Amechnoue
In this study, we are interested in the reusable containers management (e.g gases bottles, pallets, maritime containers, etc.). In this context, we address a dynamic reusable containers planning problem in a close-loop supply chain to optimize reusable containers collect, exploitation, storage and redistribution under environmental constraint in the context of reverse logistic. We propose firstly a new mixed integer programming model that helps practitioners to determine the delivered, collected, stored quantities of reusable containers on each period of the planning horizon under a carbon emission constraint. Secondly we introduce a hybrid approach based on the genetic algorithms to solve the problem. The numerical results have shown that developed hybrid approach generates high-quality solutions in a moderate computational time.
{"title":"Dynamic hybrid approach for reusable containers management in a close-loop supply chain","authors":"Mohammed Rida Ech-Charrat, K. Amechnoue","doi":"10.1109/ICMCS.2016.7905552","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905552","url":null,"abstract":"In this study, we are interested in the reusable containers management (e.g gases bottles, pallets, maritime containers, etc.). In this context, we address a dynamic reusable containers planning problem in a close-loop supply chain to optimize reusable containers collect, exploitation, storage and redistribution under environmental constraint in the context of reverse logistic. We propose firstly a new mixed integer programming model that helps practitioners to determine the delivered, collected, stored quantities of reusable containers on each period of the planning horizon under a carbon emission constraint. Secondly we introduce a hybrid approach based on the genetic algorithms to solve the problem. The numerical results have shown that developed hybrid approach generates high-quality solutions in a moderate computational time.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123917549","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}
Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905623
Ali Kamouch, A. Chaoub, Z. Guennoun
In this paper, we consider a multi-relay cooperative network assisted by the Automatic Repeat reQuest mechanism. In particular, the source node broadcasts the encoded stream to a set of relaying nodes and a relay will be chosen at each retransmission round to assist the source to convey the same stream to the common destination. Afterwards, we develop a semi-analytical method to compute the exact end-to-end outage probability, average delay and throughput metrics for the general case where the relays are positioned at various locations. This analytical method is corroborated by extensive simulation results to prove the accuracy of the proposed formulation. Further, we assess the performance of several relay-placement and power allocation configurations to find the optimal scheme.
{"title":"Optimum relay location and power allocation of cooperative decode-and-forward dual-hop ARQ networks","authors":"Ali Kamouch, A. Chaoub, Z. Guennoun","doi":"10.1109/ICMCS.2016.7905623","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905623","url":null,"abstract":"In this paper, we consider a multi-relay cooperative network assisted by the Automatic Repeat reQuest mechanism. In particular, the source node broadcasts the encoded stream to a set of relaying nodes and a relay will be chosen at each retransmission round to assist the source to convey the same stream to the common destination. Afterwards, we develop a semi-analytical method to compute the exact end-to-end outage probability, average delay and throughput metrics for the general case where the relays are positioned at various locations. This analytical method is corroborated by extensive simulation results to prove the accuracy of the proposed formulation. Further, we assess the performance of several relay-placement and power allocation configurations to find the optimal scheme.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116030662","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}
Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905538
Mohamed Abouzahir, R. Latif, A. Tajer, A. Elouardi, S. Bouaziz
In this paper we evaluate the promise held by low-power embedded architectures to implement SLAM (Simultaneous Localization and Mapping) algorithms. We map and implement 4 SLAM algorithms, that find utility in very different robot applications and autonomous navigation, on an embedded architecture. Our results show that low-power embedded architectures are indeed, sometimes, attractive alternative for some SLAM algorithms. At the same time, efficient software optimizations are mandatory to allow a real-time execution.
{"title":"Localization and Mapping algorithms implemented on a low-power embedded architectures: A case study","authors":"Mohamed Abouzahir, R. Latif, A. Tajer, A. Elouardi, S. Bouaziz","doi":"10.1109/ICMCS.2016.7905538","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905538","url":null,"abstract":"In this paper we evaluate the promise held by low-power embedded architectures to implement SLAM (Simultaneous Localization and Mapping) algorithms. We map and implement 4 SLAM algorithms, that find utility in very different robot applications and autonomous navigation, on an embedded architecture. Our results show that low-power embedded architectures are indeed, sometimes, attractive alternative for some SLAM algorithms. At the same time, efficient software optimizations are mandatory to allow a real-time execution.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122853101","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}
Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905547
S. Zerrik, D. E. Ouadghiri, M. Bakhouya
Software-defined networking (SDN) are the rising technology in near future to build programmable networks as a way to simplify the evolution of networks. It is a new networking paradigm with the main aim is to decouple forwarding hardware from control decisions. Several SDN architectures have been recently proposed and evaluated. Performance evaluation of these architectures, to study their scalability, was mainly performed using either simulations or experiments. Generally, experimenting with a real system is ex-pensive or impossible. Simulations are extremely slow especially for large systems and provide little insight on how different design parameters affect the actual performance. Therefore, modeling is more effective for evaluating and optimizing SDN architectures prior their implementation. In this paper, we used Network Calculus to study two typical SDN control plane structures, including centralized, hierarchical with 2level. The model describes the behavior of switches and controllers and allows extracting some performance metrics, mainly the delay and backlog.
{"title":"Performance evaluation of software-defined networking architectures using Network Calculus","authors":"S. Zerrik, D. E. Ouadghiri, M. Bakhouya","doi":"10.1109/ICMCS.2016.7905547","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905547","url":null,"abstract":"Software-defined networking (SDN) are the rising technology in near future to build programmable networks as a way to simplify the evolution of networks. It is a new networking paradigm with the main aim is to decouple forwarding hardware from control decisions. Several SDN architectures have been recently proposed and evaluated. Performance evaluation of these architectures, to study their scalability, was mainly performed using either simulations or experiments. Generally, experimenting with a real system is ex-pensive or impossible. Simulations are extremely slow especially for large systems and provide little insight on how different design parameters affect the actual performance. Therefore, modeling is more effective for evaluating and optimizing SDN architectures prior their implementation. In this paper, we used Network Calculus to study two typical SDN control plane structures, including centralized, hierarchical with 2level. The model describes the behavior of switches and controllers and allows extracting some performance metrics, mainly the delay and backlog.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116854898","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}
Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905631
F. Fourati, Mohamed Tahar Bhiri, R. Robbana
The automatic planning community of Artificial Intelligence AI have developed a de facto standard language for PDDL, producing formal modeling of Planning problems. Equally it have conceived and produced tools called planners to automatically generate plans for PDDL descriptions. But the verification and validation of PDDL descriptions is little treated topic. In this paper, we shall treat this issue through the Event-B formal method. We illustrate the contribution of the static analysis tools associated with Event-B (provers, model checker, animator, and simulator) for verification and validation of PDDL descriptions.
{"title":"Verification and validation of PDDL descriptions using Event-B formal method","authors":"F. Fourati, Mohamed Tahar Bhiri, R. Robbana","doi":"10.1109/ICMCS.2016.7905631","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905631","url":null,"abstract":"The automatic planning community of Artificial Intelligence AI have developed a de facto standard language for PDDL, producing formal modeling of Planning problems. Equally it have conceived and produced tools called planners to automatically generate plans for PDDL descriptions. But the verification and validation of PDDL descriptions is little treated topic. In this paper, we shall treat this issue through the Event-B formal method. We illustrate the contribution of the static analysis tools associated with Event-B (provers, model checker, animator, and simulator) for verification and validation of PDDL descriptions.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126918176","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}
Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905560
Omar El Maleky, F. Abdelouahab, M. Essaaidi, Laila Ajana
This paper present a reconfigurable T-shaped antenna how can operate easily at seven frequencies in S-band, the switching technique consist of an equivalent approach to PIN Diode it is to change the state of the distribution of current by insert a simple micro strip line in different positions, the simulated and de measured prototype frequency is respectively 3.12 GHz, 3.2 GHz, 3.31 GHz, 3.44 GHz, 3.56 GHz, 3.76 GHz, 4 GHz. The antenna is fabricated using FR4 substrate with relative permittivity of 4.4 and pert tangent of 0.02.
{"title":"Reconfigurable T-shaped antenna for S-band applications","authors":"Omar El Maleky, F. Abdelouahab, M. Essaaidi, Laila Ajana","doi":"10.1109/ICMCS.2016.7905560","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905560","url":null,"abstract":"This paper present a reconfigurable T-shaped antenna how can operate easily at seven frequencies in S-band, the switching technique consist of an equivalent approach to PIN Diode it is to change the state of the distribution of current by insert a simple micro strip line in different positions, the simulated and de measured prototype frequency is respectively 3.12 GHz, 3.2 GHz, 3.31 GHz, 3.44 GHz, 3.56 GHz, 3.76 GHz, 4 GHz. The antenna is fabricated using FR4 substrate with relative permittivity of 4.4 and pert tangent of 0.02.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"29 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114036551","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}
Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905519
Taoufiq Ait Benrami, Y. Jabrane, J. Antari, R. Iqdour
The Weighted Despreading Sequences are deployed for an optimal use in Multiple Access Interference annulation caused by users multiple access to the channel. Our paper's aim is to develop a simple method based on Wavelet Networks to calculate these WDS MC-DS/CDMA system. As illustrated by simulations, the proposed technique is an ideal alternative for MAI cancellation with BPSK modulation in AWGN channel.
{"title":"Wavelet Networks for MAI cancellation in MC-DS/CDMA","authors":"Taoufiq Ait Benrami, Y. Jabrane, J. Antari, R. Iqdour","doi":"10.1109/ICMCS.2016.7905519","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905519","url":null,"abstract":"The Weighted Despreading Sequences are deployed for an optimal use in Multiple Access Interference annulation caused by users multiple access to the channel. Our paper's aim is to develop a simple method based on Wavelet Networks to calculate these WDS MC-DS/CDMA system. As illustrated by simulations, the proposed technique is an ideal alternative for MAI cancellation with BPSK modulation in AWGN channel.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124878382","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}
Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905613
Amal Benfateh, Fatima Gharnati, T. Agouti
Cloud computing is a new terminology that was added to IT jargon in early 2007. Thus it becomes an emerging computing paradigm which offers a lot of advantages such as economy scale, flexibility and convenience. But it raises major issues about security. In present paper, we focus on risk assessment by using an intelligent software agent to develop an immune system of cloud.
{"title":"ISA-based model for risk assessment in cloud computing environment","authors":"Amal Benfateh, Fatima Gharnati, T. Agouti","doi":"10.1109/ICMCS.2016.7905613","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905613","url":null,"abstract":"Cloud computing is a new terminology that was added to IT jargon in early 2007. Thus it becomes an emerging computing paradigm which offers a lot of advantages such as economy scale, flexibility and convenience. But it raises major issues about security. In present paper, we focus on risk assessment by using an intelligent software agent to develop an immune system of cloud.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132901356","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}
Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905553
Y. Mouzouna, H. Nasraoui, A. Mouhsen, J. Aoufi, G. Chababi
In this paper we use the paper as a substrate for the design of UHF RFID Tag. The paper use is intended to reduce the cost of manufacturing tags and also preserve the environment because the paper is a ubiquitous material with low cost and friend of the environment which will facilitate deployment of the RFID system at large scale. The design is a meander antenna, which will reduce the size of the design, which can be used on small object, mounted on a Kodak photo paper substrate.
{"title":"Miniaturized meander antenna using low cost paper substrate","authors":"Y. Mouzouna, H. Nasraoui, A. Mouhsen, J. Aoufi, G. Chababi","doi":"10.1109/ICMCS.2016.7905553","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905553","url":null,"abstract":"In this paper we use the paper as a substrate for the design of UHF RFID Tag. The paper use is intended to reduce the cost of manufacturing tags and also preserve the environment because the paper is a ubiquitous material with low cost and friend of the environment which will facilitate deployment of the RFID system at large scale. The design is a meander antenna, which will reduce the size of the design, which can be used on small object, mounted on a Kodak photo paper substrate.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131113718","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}
Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905587
Marouane Birjali, A. B. Hssane, M. Erritali
Document similarity measures between documents and queries has been extensively studied in information retrieval. Measuring the similarity of documents are crucial components of many text-analysis tasks, including information retrieval, document classification, and document clustering. However, there are a growing number of tasks that require computing the similarity between two very short segments of text. There exist a large number of composed documents in a large amount of corpus. Most of them are required to compute the similarity for validation. In this paper, we propose our approach of measuring similarity between documents in large amount of corpus. For evaluation, we compare the proposed approach with other approaches previously presented by using our new MapReduce algorithm. Simulation results, on Hadoop framework, show that our new MapReduce algorithm outperforms the classical ones in term of running time performance and increases the value of the similarity.
{"title":"Measuring documents similarity in large corpus using MapReduce algorithm","authors":"Marouane Birjali, A. B. Hssane, M. Erritali","doi":"10.1109/ICMCS.2016.7905587","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905587","url":null,"abstract":"Document similarity measures between documents and queries has been extensively studied in information retrieval. Measuring the similarity of documents are crucial components of many text-analysis tasks, including information retrieval, document classification, and document clustering. However, there are a growing number of tasks that require computing the similarity between two very short segments of text. There exist a large number of composed documents in a large amount of corpus. Most of them are required to compute the similarity for validation. In this paper, we propose our approach of measuring similarity between documents in large amount of corpus. For evaluation, we compare the proposed approach with other approaches previously presented by using our new MapReduce algorithm. Simulation results, on Hadoop framework, show that our new MapReduce algorithm outperforms the classical ones in term of running time performance and increases the value of the similarity.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127660326","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：