@article {Ounasser202245,
	title = {Generative and Autoencoder Models for Large-Scale Mutivariate Unsupervised Anomaly Detection},
	journal = {Smart Innovation, Systems and Technologies},
	volume = {237},
	year = {2022},
	note = {cited By 0},
	pages = {45-58},
	abstract = {Anomaly detection is a major problem that has been well studied in various fields of research and fields of application. In this paper, we present several methods that can be built on existing deep learning solutions for unsupervised anomaly detection, so that outliers can be separated from normal data in an efficient manner. We focus on approaches that use generative adversarial networks (GAN) and autoencoders for anomaly detection. By using these deep anomaly detection techniques, we can overcome the problem that we need to have a large-scale anomaly data in the learning phase of a detection system. So, we compared various methods of machine based and deep learning anomaly detection with its application in various fields. This article used seven available datasets. We report the results on anomaly detection datasets, using performance metrics, and discuss their performance on finding clustered and low density anomalies. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.},
	keywords = {Anomaly detection, Auto encoders, Deep learning, Detection system, Generative adversarial networks, ITS applications, Large-scales, Learning phasis, Performance, Performance metrices, Unsupervised anomaly detection},
	doi = {10.1007/978-981-16-3637-0_4},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85116885193\&doi=10.1007\%2f978-981-16-3637-0_4\&partnerID=40\&md5=d381663c0ba073f5139a00cbfe2819c8},
	author = {Ounasser, N. and Rhanoui, M. and Mikram, M. and Asri, B.E.}
}
@article {AitTemghart2021335,
	title = {Game Theoretic Approaches to Mitigate Cloud Security Risks: An Initial Insight},
	journal = {Lecture Notes in Business Information Processing},
	volume = {416 LNBIP},
	year = {2021},
	note = {cited By 1},
	pages = {335-347},
	abstract = {Cloud computing is one of the most promising innovations impacting data storage and processing. And with it, clients rely on the IT solutions offered by an external provider instead of on-premise applications. Despite its enormous impacts, customers are still reluctant to outsource their business processes because of security concerns. As data is typically stored and governed by cloud vendors, users need to deal with security issues linked to the loss of control over their sensitive data. Cloud providers need to implement the appropriate security measures that might attract more clients while making the minimum investment. While used in various disciplines, game theory has recently expanded to investigate the effect of the defenders{\textquoteright} and attackers{\textquoteright} behaviors on strategic decision-making. This study aims to develop insights into how game theory can develop better security policies in cloud computing. First, we perform threat modeling to identify the potential threats facing cloud. Second, we identify the limitations of existing game based solutions and then suggest an improved model define an adequate strategy that would figure out the right balance between the required security level and the profit margins. Besides, we present future directions that can be explored to build highly reliable and optimal strategies for cloud services. {\textcopyright} 2021, Springer Nature Switzerland AG.},
	keywords = {Business Process, Cloud computing, Cloud securities, Computation theory, Computer games, Data privacy, Decision making, Decision theory, Digital storage, Game theory, Information analysis, Optimal strategies, Potential threats, Security issues, Security measure, Security policy, Strategic decision making},
	doi = {10.1007/978-3-030-76508-8_24},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85111082922\&doi=10.1007\%2f978-3-030-76508-8_24\&partnerID=40\&md5=1619b858093bfb251eb24a3209534772},
	author = {Ait Temghart, A. and Ait Omar, D. and Outanoute, M. and Marwan, M.}
}
@article {ElHafidy2021,
	title = {Gamified mobile applications for improving driving behavior: A systematic mapping study},
	journal = {Mobile Information Systems},
	volume = {2021},
	year = {2021},
	note = {cited By 4},
	abstract = {Many research works and official reports approve that irresponsible driving behavior on the road is the main cause of accidents. Consequently, responsible driving behavior can significantly reduce accidents{\textquoteright} number and severity. Therefore, in the research area as well as in the industrial area, mobile technologies are widely exploited in assisting drivers in reducing accident rates and preventing accidents. For instance, several mobile apps are provided to assist drivers in improving their driving behavior. Recently and thanks to mobile cloud computing, smartphones can benefit from the computing power of servers in the cloud for executing machine learning algorithms. Therefore, many mobile applications of driving assistance and control are based on machine learning techniques to adjust their functioning automatically to driver history, context, and profile. Additionally, gamification is a key element in the design of these mobile applications that allow drivers to develop their engagement and motivation to improve their driving behavior. To have an overview concerning existing mobile apps that improve driving behavior, we have chosen to conduct a systematic mapping study about driving behavior mobile apps that exist in the most common mobile apps repositories or that were published as research works in digital libraries. In particular, we should explore their functionalities, the kinds of collected data, the used gamification elements, and the used machine learning techniques and algorithms. We have successfully identified 220 mobile apps that help to improve driving behavior. In this work, we will extract all the data that seem to be useful for the classification and analysis of the functionalities offered by these applications. {\textcopyright} 2021 Abderrahim El hafidy et al.},
	keywords = {Accidents, Computing power, Digital libraries, Driving assistance, Driving behavior, Gamification, Industrial area, Industrial research, Learning algorithms, Machine learning, Machine learning techniques, Mapping, Mobile applications, Mobile cloud computing, Mobile computing, Mobile Technology, Systematic mapping studies},
	doi = {10.1155/2021/6677075},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85114117887\&doi=10.1155\%2f2021\%2f6677075\&partnerID=40\&md5=6ad1b624deabb49917039716eb133f13},
	author = {El Hafidy, A. and Rachad, T. and Idri, A. and Zellou, A.}
}
@article {Tali2021403,
	title = {Grid voltage estimation based on an adaptive linear neural network for pv-Active power filter control strategy},
	journal = {Journal Europeen des Systemes Automatises},
	volume = {54},
	number = {3},
	year = {2021},
	note = {cited By 0},
	pages = {403-410},
	abstract = {To enhance the power quality in electric power systems, active power filter can be successfully used for harmonics mitigation and reactive power compensation. In this paper, a new approach using novel direct power control PDPC based on grid voltages estimation is proposed to improve the dynamic performance of shunt active power filter and reduce the system cost and robustness by minimizing the number of sensors in grid connected PV system. The grid voltages are estimated online by using an adaptive linear neural network (ADALINE) and the proposed PDPC is based on the extended pq theory. According to the simulation results, the proposed control strategy using a voltage estimator instead of voltage sensors not only reduce the size and cost but the reliability of the active power filter PV-APF is improved under normal and severe grid voltage conditions. {\textcopyright} 2021 Lavoisier. All rights reserved.},
	doi = {10.18280/JESA.540303},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85109586988\&doi=10.18280\%2fJESA.540303\&partnerID=40\&md5=8bb6730393cdd9c5f33dff773a320bd6},
	author = {Tali, M. and Essadki, A. and Nasser, T.}
}
@article {Sardi2020931,
	title = {Gamified e-Health Solution to Promote Postnatal Care in Morocco},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {12252 LNCS},
	year = {2020},
	note = {cited By 0},
	pages = {931-946},
	abstract = {The postnatal period is a critical phase in both the lives of the mothers and the newborns. Due to all the inherent changes that occur during this period, quality care is crucial during this period to enhance the wellbeing of the mothers and the newborns. In Morocco, the neglection of postnatal care services are often associated to poor communication, financial difficulties and cultural barriers. Mobile technology constitutes therefore a promising approach to bridge this gap and promote postnatal care. In order to improve the effectiveness of mobile technology, gamification has become a powerful feature to boost motivation and induce fun and interactivity into the mobile solutions{\textquoteright} tasks. Based on a previous review on mobile applications for postnatal care available in app repositories, a set of requirements have been identified to build a comprehensive mobile solution that cater the needs of both the mothers and the newborns. These requirements have, then, been enriched with real needs elicited at maternity Les orangers that belongs to the University Hospital Avicenne of Rabat. Along with the functional and non-functional requirements, gamification aspects have been also analyzed. After the analysis and design phases, a pilot version of the solution called {\textquoteleft}Mamma\&Baby{\textquoteright} has been implemented using android framework. {\textquoteleft}Mamma\&Baby{\textquoteright} is a mobile solution dedicated to assist new mothers during their postnatal period. As future work, it is expected to fully integrate the gamification elements into the solution and conduct an empirical evaluation of the overall quality and the potential of the solution with real puerperal women. {\textcopyright} 2020, Springer Nature Switzerland AG.},
	keywords = {E-health solutions, Empirical evaluations, Financial difficulties, Gamification, Mobile applications, Mobile solutions, Mobile Technology, Non-functional requirements, Overall quality, Quality control, Telecommunication equipment},
	doi = {10.1007/978-3-030-58811-3_66},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85092252943\&doi=10.1007\%2f978-3-030-58811-3_66\&partnerID=40\&md5=2a3490959b88f98611929a0ad0efd78b},
	author = {Sardi, L. and Idri, A. and Rachad, T. and Redman, L. and Alami, H.}
}
@article {Korachi2020493,
	title = {General approach for formulating a digital transformation strategy},
	journal = {Journal of Computer Science},
	volume = {16},
	number = {4},
	year = {2020},
	note = {cited By 8},
	pages = {493-507},
	abstract = {To take advantage of information technologies, organizations need to define a clear strategy. Numerous works have provided definitions and phases of digital strategies. Some of these strategies are context-specific, while others deal with the common elements of digital strategies regardless of the digital transformation context. However, these works do not address a holistic approach. This raises ambiguity regarding digital strategy definitions and approaches. To eliminate this ambiguity, the current research tries to take advantage of existing digital strategies to propose a general digital strategy definition and build a general digital transformation approach. This work analyses various digital transformation strategies, to extract and classify their common elements in order to build a general approach that frame and drive the formulation of digital transformation strategies. To define such a general approach, the current paper analyses the effects of IT Governance and Management Strategy on the Digital Transformation Maturity. This analysis identified how IT Governance and Management Strategy can contribute to formulating a digital transformation strategy. Partial Least Square (PLS) was adopted in this research to develop an empirical evaluation for the case of 30 digital strategies and frameworks. Based on this empirical study several results have been presented in this work, namely: determination of a digital strategy definition and identification of a digital strategy approach. The proposed approach is composed of the following building blocks: Strategic Awareness, Business Strategic Planning, IT Organizational Structure, Steering committee, IT Prioritization Process, IT Investment Decisions, IT Strategic Planning, IT Budgeting, IT Reporting, IT Reaction Capacity and Management Strategy. {\textcopyright} 2020 Korachi Zineb and Bounabat Bouchaib.},
	doi = {10.3844/JCSSP.2020.493.507},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85089215075\&doi=10.3844\%2fJCSSP.2020.493.507\&partnerID=40\&md5=f078fe7456a6e96038b70d205dddec3f},
	author = {Korachi, Z. and Bounabat, B.}
}
@article {Yatribi2020,
	title = {Gradient-descent decoding of one-step majority-logic decodable codes},
	journal = {Physical Communication},
	volume = {39},
	year = {2020},
	note = {cited By 1},
	abstract = {In this paper, a new low-complexity gradient-descent based iterative majority-logic decoder (GD-MLGD) is proposed for decoding One-Step Majority-Logic Decodable (OSMLD) codes. We give a formulation of the decoding problem of binary OSMLD codes, as a maximization problem of a derivable objective function. The optimization problem is solved using a pseudo gradient-descent algorithm, which performs iteratively an update towards the optimal estimated codeword been transmitted, based on the first-order partial derivatives of each variable calculated in the previous iteration. The proposed decoding scheme achieves a fast convergence to an optimum codeword compared to other decoding techniques reviewed in this paper, at the cost of lower computational complexity. The quantized version (QGD-MLGD) is also proposed in order to further reduce the computational complexity. Simulation results show that the proposed decoding algorithms outperform all the existing majority-logic decoding schemes, and also various gradient-descent based bit-flipping algorithms, and performs nearly close to the belief propagation sum{\textendash}product (BP-SP) decoding algorithm of LDPC codes, especially for high code lengths, providing an efficient trade-off between performance and decoding complexity. Moreover, the proposed quantized algorithm has shown to perform better than all the existing decoding techniques. The proposed decoding algorithms have shown to be suitable for ultra reliable, low latency and energy-constrained communication systems where both high performances and low-complexity are required. {\textcopyright} 2020 Elsevier B.V.},
	keywords = {AWGN channel, Backpropagation, Computational complexity, Computer circuits, Decoding complexity, Difference sets, Economic and social effects, Electronic trading, Gradient descent, Gradient methods, Iterative decoding, LDPC codes, Majority logic, Majority logic decoding, Maximum likelihood, Maximum likelihood decoding, Optimization, OSMLD codes},
	doi = {10.1016/j.phycom.2019.100999},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85077749482\&doi=10.1016\%2fj.phycom.2019.100999\&partnerID=40\&md5=830156cfb12a8ec3dbff2e002b3ade63},
	author = {Yatribi, A. and Belkasmi, M. and Ayoub, F.}
}
@article {YATRIBI2020100999,
	title = {Gradient-descent decoding of one-step majority-logic decodable codes},
	journal = {Physical Communication},
	volume = {39},
	year = {2020},
	pages = {100999},
	abstract = {In this paper, a new low-complexity gradient-descent based iterative majority-logic decoder (GD-MLGD) is proposed for decoding One-Step Majority-Logic Decodable (OSMLD) codes. We give a formulation of the decoding problem of binary OSMLD codes, as a maximization problem of a derivable objective function. The optimization problem is solved using a pseudo gradient-descent algorithm, which performs iteratively an update towards the optimal estimated codeword been transmitted, based on the first-order partial derivatives of each variable calculated in the previous iteration. The proposed decoding scheme achieves a fast convergence to an optimum codeword compared to other decoding techniques reviewed in this paper, at the cost of lower computational complexity. The quantized version (QGD-MLGD) is also proposed in order to further reduce the computational complexity. Simulation results show that the proposed decoding algorithms outperform all the existing majority-logic decoding schemes, and also various gradient-descent based bit-flipping algorithms, and performs nearly close to the belief propagation sum{\textendash}product (BP-SP) decoding algorithm of LDPC codes, especially for high code lengths, providing an efficient trade-off between performance and decoding complexity. Moreover, the proposed quantized algorithm has shown to perform better than all the existing decoding techniques. The proposed decoding algorithms have shown to be suitable for ultra reliable, low latency and energy-constrained communication systems where both high performances and low-complexity are required.},
	keywords = {AWGN channels, Decoding complexity, Difference-set codes, Finite geometry LDPC codes, Gradient-descent decoding, Iterative majority-logic decoding, Maximum likelihood decoding, OSMLD codes},
	issn = {1874-4907},
	doi = {https://doi.org/10.1016/j.phycom.2019.100999},
	url = {https://www.sciencedirect.com/science/article/pii/S1874490719306184},
	author = {Anouar Yatribi and Mostafa Belkasmi and Fouad Ayoub}
}
@conference {Abdellatif2019,
	title = {Graph-Based Computing Resource Allocation for Mobile Blockchain},
	booktitle = {Proceedings - 2018 International Conference on Wireless Networks and Mobile Communications, WINCOM 2018},
	year = {2019},
	note = {cited By 0},
	doi = {10.1109/WINCOM.2018.8629599},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85062817982\&doi=10.1109\%2fWINCOM.2018.8629599\&partnerID=40\&md5=64a9c993d336cb3ae9644691ba7d0db6},
	author = {Abdellatif, K. and Abdelmouttalib, C.}
}
@conference {Sarhani2018,
	title = {Generalization enhancement of support vector regression in electric load forecasting with model selection},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2018},
	doi = {10.1145/3230905.3230947},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85053484922\&doi=10.1145\%2f3230905.3230947\&partnerID=40\&md5=a29a4cececf76f665c91e09b16ba8692},
	author = {Sarhani, M. and Afia, A.E.}
}
@article {Souidi20181,
	title = {Geographic forwarding rules to reduce broadcast redundancy in mobile ad hoc wireless networks},
	journal = {Personal and Ubiquitous Computing},
	year = {2018},
	pages = {1-11},
	doi = {10.1007/s00779-018-1137-2},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85046544087\&doi=10.1007\%2fs00779-018-1137-2\&partnerID=40\&md5=6c36decf0a636de5c2e0472ac7d6cf4e},
	author = {Souidi, M. and Habbani, A. and Berradi, H. and El Mahdi, F.}
}
@conference {Riane20181,
	title = {A graph-based approach for composite infrastructure service deployment in multi-cloud environment},
	booktitle = {Proceedings - 2018 International Conference on Advanced Communication Technologies and Networking, CommNet 2018},
	year = {2018},
	pages = {1-7},
	doi = {10.1109/COMMNET.2018.8360254},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85048314837\&doi=10.1109\%2fCOMMNET.2018.8360254\&partnerID=40\&md5=2b424ac7a7629c17066d7393e375e846},
	author = {Riane, D. and Ettalbi, A.}
}
@conference {Oualhaj20181,
	title = {Graph-Based MDP to Mobile Source with Energy Harvesting in Delay Tolerant Networks System},
	booktitle = {2017 IEEE Global Communications Conference, GLOBECOM 2017 - Proceedings},
	volume = {2018-January},
	year = {2018},
	pages = {1-6},
	doi = {10.1109/GLOCOM.2017.8253948},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85046359869\&doi=10.1109\%2fGLOCOM.2017.8253948\&partnerID=40\&md5=ad621053c85f2d4d1fe75a91423a6718},
	author = {Oualhaj, O.A. and Elmachkour, M. and Kobbane, A. and Ben-Othman, J.}
}
@conference {Lhazmir20181,
	title = {Green opportunistic access for cognitive radio networks: A regret matching based approach},
	booktitle = {Proceedings - 2018 International Conference on Advanced Communication Technologies and Networking, CommNet 2018},
	year = {2018},
	pages = {1-6},
	doi = {10.1109/COMMNET.2018.8360261},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85048334349\&doi=10.1109\%2fCOMMNET.2018.8360261\&partnerID=40\&md5=74465a0ecf291e5fb7822c88709e0c5b},
	author = {Lhazmir, S. and Elmachkour, M. and Kobbane, A.}
}
@conference {Mourchid20171315,
	title = {A game-theoretic approach for non-overlapping communities detection},
	booktitle = {2017 13th International Wireless Communications and Mobile Computing Conference, IWCMC 2017},
	year = {2017},
	note = {cited By 1},
	pages = {1315-1320},
	abstract = {In this paper, we propose a game-theoretic approach to find the community structure in complex networks based on a non-cooperative game. This approach optimizes a node-based modularity for non-overlapping communities. Experiments show that our approach is effective to discover non-overlapping communities and obtain high values of modularity and Normalized Mutual Information (NMI) for real-world and synthetic networks in a reasonable time. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/IWCMC.2017.7986475},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85027835444\&doi=10.1109\%2fIWCMC.2017.7986475\&partnerID=40\&md5=b0751b99b8a2552e780d327bef409ddf},
	author = {Mourchid, F. and Kobbane, A. and Ben Othman, J. and El Koutbi, M.}
}
@article {Sardi2017165,
	title = {Gamified mobile blood donation applications},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {10208 LNCS},
	year = {2017},
	note = {cited By 1},
	pages = {165-176},
	abstract = {Unpaid blood donation is a selfless act of citizenship and the usage of gamification elements in blood donation apps can enhance the donors{\textquoteright} experience, especially among youth. This paper analyses the functionalities and explores gamification elements of the existing blood donation apps in the mobile market. A search in Google Play, Apple Apps store, Blackberry App World, and Windows Mobile App store was performed to select 10 gamified BD apps with three duplicates out of 801 pinpointed. The results show that the majority of the blood donation apps selected do not support multiple languages and that the predominant authentication methods are traditional and social logins. Moreover, all the apps were intended for more than one purpose among helping users to find donors and blood centres, track their records and check their eligibility to donate. Most apps installed include notification features and built-in geolocation services to instantly inform the users of donation need in nearby locations. Badges and redeemable points were the most recurrent gamification elements in the blood donation apps selected. There is a need for better incentives in order to not only retain the potential donors but also to recruit non-willing ones. {\textcopyright} Springer International Publishing AG 2017.},
	doi = {10.1007/978-3-319-56148-6_14},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85018706816\&doi=10.1007\%2f978-3-319-56148-6_14\&partnerID=40\&md5=0e71bd08afeb528b9c0f612b667abd3d},
	author = {Sardi, L. and Idri, A. and Fernandez-Aleman, J.L.}
}
@article {Saif2017210,
	title = {GENAUM: New semantic distributed search engine},
	journal = {Journal of Mobile Multimedia},
	volume = {13},
	number = {3-4},
	year = {2017},
	note = {cited By 0},
	pages = {210-221},
	abstract = {The rapid development of services based on distributed architectures is now emerging as important items that transform mode of communication, and the exponential growth of the Web makes a strong pressure on technologies, for a regular improvement of performance, so it{\textquoteright}s irresistible to use distributed architectures and techniques for the search and information retrieval on the Web, to provide more relevant search result, in minimum possible time. This paper discuss some solutions researchers are working on, to make search engines more faster and more intelligent, specifically by considering the semantic context of users and documents, and the use of distributed architectures. This paper also presents the overall architecture of GENAUM; the collaborative, semantic and distributed search engine, based on a network of agents, which is the core part of the system. The functionality of GENAUM is spread across multiple agents, to fulfill user{\textquoteright}s performance expectations. At the end of this paper, some preliminary experimental results are presented, that attempts to test the user modeling process of GENAUM, using reference ontology. {\textcopyright} Rinton Press.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85040242169\&partnerID=40\&md5=21e9c1f654b188cfb9b0bcd523769494},
	author = {Saif, I. and Doukkali, A.S. and Enaanai, A. and Benlahmar, E.H.}
}
@conference {ElBassiti20171097,
	title = {Generic innovation designing -GenID- Framework: Towards a more systematic approach to innovation management},
	booktitle = {Proceedings of the European Conference on Knowledge Management, ECKM},
	volume = {2},
	year = {2017},
	note = {cited By 0},
	pages = {1097-1106},
	abstract = {To achieve sustainable success in the global market, modern organizations need to be flexible and fast in their reaction to change, which depends on their ability to innovate, not just occasionally but systematically. Despite countless efforts and spending, many organizations feel they are not making the most of their innovation potential and resources and don{\textquoteright}t generate desirable profit. This problem does not lie in a lack of ideas, but more in a structured approach to innovation. Believing that most pressing problems organizations face today are characterized by unprecedented levels of complexity and interdependence leads to breakdown the conventional problem-solving paradigm. However, a structured approach to innovation management could be criticized as it may lead to rigidity and hamper creativity. Thus, there is a need to allow a trade-off between granting conditions for creativity, so new ideas can flourish, and at the same time keeping a systematic approach to smooth social cohesion, facilitate the pool of resources and promote the creation of a collaborative community. From the exploration of the distinguishing characteristics of the new economy and the new millenary, this paper provides the foundation of a systematic framework to innovation management. Based on the complexity and structuration theories, the concept "Innovation" has been formalized in two generic models: (1) Innovation Activities Model providing an integrated view of interactions involved within an innovation context, (2) Innovation Lifecycle Model portraying the major milestones over an innovation journey. These constructs has been assessed through an online survey designed to gather qualitative data. {\textcopyright} The Authors, 2017.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85035206916\&partnerID=40\&md5=2b32e9c5fe0b744d39d7f634493360b5},
	author = {El Bassiti, L. and El Haiba, M. and Ajhoun, R.}
}
@conference {Afia2017,
	title = {A global mapping of the Moroccan supply chain of hospital drugs, and a simulation of the dispensation process},
	booktitle = {ACM International Conference Proceeding Series},
	volume = {Part F129474},
	year = {2017},
	note = {cited By 0},
	abstract = {Pharmaceuticals are an important component of the health system activity. Their contribution to improving the health status is vital. To ensure sound management of the pharmaceutical products logistics (orders, delivery, storage and distribution), a new procurement strategy has been adopted by Morocco in 2012. This strategy is based on a centralized procurement, by which the purchase is grouped by anticipation (the budget for the year in progress / the exercise of the following year), and a decentralized storage and distribution allowing the territory stratification in eight regional depots: Berrechid, Oujda, Al-Hoceima, Laayoune, Agadir, Marrakech, Meknes and Tangier. The challenges this environment is facing justify the focus on this research subject, and the contribution of this work includes a global mapping of the Moroccan supply chain of hospital drugs, and a simulation of the dispensation process comparing the global and the nominative dispensation. {\textcopyright} 2017 Association for Computing Machinery.},
	doi = {10.1145/3090354.3090465},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85028455352\&doi=10.1145\%2f3090354.3090465\&partnerID=40\&md5=fbdb2614d215837a4276397094cfd697},
	author = {Afia, A.E. and Mezouar, H.}
}
@article {Elmouaatamid2017299,
	title = {Group authentication with fault tolerance for internet of things},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {10542 LNCS},
	year = {2017},
	note = {cited By 0},
	pages = {299-307},
	abstract = {With proliferation of the Internet of Things (IoT) applications, it is expected that 50 billion connected devices will be operating amongst us by 2020, so the normal authentication mechanism will be a big issue to handle to avoid causing a serious burden to server. As it is known, some devices could share the same characteristics such as the same geographical area, the same features. In this case, these devices could be in the same group and the group will be identify by an identity. Taking advantages from this mechanism, all devices can be authenticated at the same time using the group identity. Among group authentication issues are if a member device of the group cannot authenticate with the distributor of the group intentionally or unintentionally, the group loses its identity. This loss of identity causes the authentication failure of the other group devices. To solve this issue in IoT a fault tolerance scheme introduced for the group authentication architecture. Our algorithm of fault tolerance allows reconstructing the group authentication identity despite the lack of broken devices of the group. Indeed, reconstructing the group identity can be performed by using multi-secret sharing scheme based on an error correcting codes if a sufficient number of the group devices are available. {\textcopyright} Springer International Publishing AG 2017.},
	doi = {10.1007/978-3-319-68179-5_26},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85034585657\&doi=10.1007\%2f978-3-319-68179-5_26\&partnerID=40\&md5=4674daff52472a601af95361285646e1},
	author = {Elmouaatamid, O. and Lahmer, M. and Belkasmi, M.}
}
@article {Haoues2017886,
	title = {A guideline for software architecture selection based on ISO 25010 quality related characteristics},
	journal = {International Journal of Systems Assurance Engineering and Management},
	volume = {8},
	year = {2017},
	note = {cited By 0},
	pages = {886-909},
	abstract = {As the complexity of software increases, the choice of the appropriate software architecture becomes a critical task. This paper provides a guideline for selecting the appropriate software architecture based on pertinent ISO 25010 quality characteristics. The guideline was established through an analytical survey of 113 papers published from 2010 to 2014. Through this survey, we first identified a set of commonly used software architectures in the software engineering literature. Secondly, we applied the Formal Concept Analysis technique to classify each one of these architectures according to ISO 25010 quality characteristics. Finally, we identified the relationships among ISO 25010 quality characteristics, which in turn helped us to develop a guideline on how to select the appropriate software architecture with respect to ISO 25010 quality characteristics. In order to make sure about the validation of the proposed guideline, a survey with industrial experts is in progress. Data were collected from two companies working in the software development field (ST2i and Telnet). {\textcopyright} 2016, The Society for Reliability Engineering, Quality and Operations Management (SREQOM), India and The Division of Operation and Maintenance, Lulea University of Technology, Sweden.},
	doi = {10.1007/s13198-016-0546-8},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85034990679\&doi=10.1007\%2fs13198-016-0546-8\&partnerID=40\&md5=180857479792ea94cf87783efc8285da},
	author = {Haoues, M. and Sellami, A. and Ben-Abdallah, H. and Cheikhi, L.}
}
@conference {Gmira2016,
	title = {A game theoretic approach for an hybrid overlay-underlay spectrum access mode},
	booktitle = {2016 IEEE International Conference on Communications, ICC 2016},
	year = {2016},
	note = {cited By 0},
	abstract = {Cognitive radio is emerging as a promising technique to improve the utilization of the radio frequency spectrum in wireless networks. In this paper, we propose a hybrid CR (cognitive radio) system where underlay and overlay CR approaches are combined under SINR (Signal to Interference plus Noise Ratio) constraints. This new access type allows to optimize the spectrum sensing time with throughput improvement. The goal of this paper is to provide a new access mode in order to enhance the cognitive system performance while reducing the power spent for detecting the presence of the primary user and the spectrum holes. We consider the problem of spectrum sharing among primary (or licensed) users (PUs) and secondary (or unlicensed) users (SUs). In this scheme, the spectrum allocation problem is modeled as a non cooperative game, with each CR user acting as a player. Nash equilibrium is considered as the solution of this game. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ICC.2016.7511026},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84981337899\&doi=10.1109\%2fICC.2016.7511026\&partnerID=40\&md5=b33c0dff4da1e3292042d7b39a65c27e},
	author = {Gmira, S.a and Kobbane, A.a and Sabir, E.b and Ben-Othman, J.c}
}
@conference { ISI:000390993202059,
	title = {A Game Theoretic Approach for an Hybrid Overlay-Underlay Spectrum Access Mode},
	booktitle = {2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC)},
	series = {IEEE International Conference on Communications},
	year = {2016},
	note = {IEEE International Conference on Communications (ICC), Kuala Lumpur, MALAYSIA, MAY 22-27, 2016},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Cognitive radio is emerging as a promising technique to improve the utilization of the radio frequency spectrum in wireless networks. In this paper, we propose a hybrid CR (cognitive radio) system where underlay and overlay CR approaches are combined under SINR (Signal to Interference plus Noise Ratio) constraints. This new access type allows to optimize the spectrum sensing time with throughput improvement. The goal of this paper is to provide a new access mode in order to enhance the cognitive system performance while reducing the power spent for detecting the presence of the primary user and the spectrum holes. We consider the problem of spectrum sharing among primary (or {\textquoteleft}{\textquoteleft}licensed{{\textquoteright}{\textquoteright}}) users (PUs) and secondary (or {\textquoteleft}{\textquoteleft}unlicensed{{\textquoteright}{\textquoteright}}) users (SUs). In this scheme, the spectrum allocation problem is modeled as a non cooperative game, with each CR user acting as a player. Nash equilibrium is considered as the solution of this game.},
	isbn = {978-1-4799-6664-6},
	issn = {1550-3607},
	author = {Gmira, Sara and Kobbane, Abdellatif and Sabir, Essaid and Ben-Othman, Jalel}
}
@conference { ISI:000392439200016,
	title = {Generalization of capacitated p-median location problem: modeling and resolution},
	booktitle = {PROCEEDINGS OF THE 3RD IEEE INTERNATIONAL CONFERENCE ON LOGISTICS OPERATIONS MANAGEMENT (GOL{\textquoteright}16)},
	year = {2016},
	note = {3rd IEEE International Conference on Logistics Operations Management (GOL), Fes, MOROCCO, MAY 23-25, 2016},
	publisher = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE},
	organization = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE},
	abstract = {The capacitated p-median location problem (CPMP) is very famous in literature and widely used within industry scope. However, in some cases, this location problem variant has poor management of capacity resources. In fact, the capacity used by facilities is fixed and not dependent on customers{\textquoteright} demands. The budget constraint Multi-Capacitated Location Problem (MCLP), considered in that paper, is a generalization of the CPMP problem, it is characterized by allowing each facility to be open with different capacities. In this paper, we will discuss the mathematical modeling of the MCLP problem, then we suggest adapted solving methods. To do this, we propose to solve the MCLP problem using Branch and Cut method. This exact solving method well-known, will serve us to test and validate our new problem formulation. Then we will build one heuristic algorithm, well adapted to our problem, it will be called GCDF (Greatest Customer Demand First). For improving solution quality, the LNS method will complete the GCDF. Computational results are presented at the end using instances that we have created under some criteria of difficulties or adapted from those of p-median problems available in literature. The GCDF{*} (GCDF improved) algorithm is fast and provides good results for most degree of difficulty instances, but it is unreliable for very specific cases. To remedy this problem, the method must start with a basic feasible solution determined by one of the reliable method such as Branch and Bound.},
	isbn = {978-1-4673-8571-8},
	author = {El Amrani, Mohammed and Benadada, Youssef and Gendron, Bernard},
	editor = {Alaoui, AE and Benadada, Y and Boukachour, J}
}
@conference {Amrani2016,
	title = {Generalization of capacitated p-median location problem: Modeling and resolution},
	booktitle = {Proceedings of the 3rd IEEE International Conference on Logistics Operations Management, GOL 2016},
	year = {2016},
	note = {cited By 0},
	abstract = {The capacitated p-median location problem (CPMP) is very famous in literature and widely used within industry scope. However, in some cases, this location problem variant has poor management of capacity resources. In fact, the capacity used by facilities is fixed and not dependent on customers{\textquoteright} demands. The budget constraint Multi-Capacitated Location Problem (MCLP), considered in that paper, is a generalization of the CPMP problem, it is characterized by allowing each facility to be open with different capacities. In this paper, we will discuss the mathematical modeling of the MCLP problem, then we suggest adapted solving methods. To do this, we propose to solve the MCLP problem using Branch and Cut method. This exact solving method well-known, will serve us to test and validate our new problem formulation. Then we will build one heuristic algorithm, well adapted to our problem, it will be called GCDF (Greatest Customer Demand First). For improving solution quality, the LNS method will complete the GCDF. Computational results are presented at the end using instances that we have created under some criteria of difficulties or adapted from those of p-median problems available in literature. The GCDF (GCDF improved) algorithm is fast and provides good results for most degree of difficulty instances, but it is unreliable for very specific cases. To remedy this problem, the method must start with a basic feasible solution determined by one of the reliable method such as Branch and Bound. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/GOL.2016.7731674},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85002428361\&doi=10.1109\%2fGOL.2016.7731674\&partnerID=40\&md5=22a51daec1a55776484f33f5ea5ed3a0},
	author = {Amrani, M.E.a and Benadada, Y.a and Gendron, B.b}
}
@article { ISI:000391110500010,
	title = {Good Quasi-Cyclic Codes from Circulant Matrices Concatenation using a Heuristic Method},
	journal = {INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS},
	volume = {7},
	number = {9},
	year = {2016},
	month = {SEP},
	pages = {63-68},
	abstract = {In this paper we present a method to search q circulant matrices; the concatenation of these circulant matrices with circulant identity matrix generates quasi-cyclic codes with high various code rate q/(q+1) (q an integer). This method searches circulant matrices in order to find the good quasi-cyclic code (QCC) having the largest minimum distance. A modified simulated annealing algorithm is used as an evaluator tool of the minimum distance of the obtained QCC codes. Based on this method we found 16 good quasi-cyclic codes with rates (1/2, 2/3 and 3/4), their estimated minimum distance reaches the lower bounds of codes considered to be the better linear block codes in Brouwer{\textquoteright}s database.},
	issn = {2158-107X},
	author = {Aylaj, Bouchaib and Belkasmi, Mostafa and Nouh, Said and Zouaki, Hamid}
}
@article { ISI:000379694400006,
	title = {Group vertical handoff management in heterogeneous networks},
	journal = {WIRELESS COMMUNICATIONS \& MOBILE COMPUTING},
	volume = {16},
	number = {10},
	year = {2016},
	month = {JUL},
	pages = {1256-1270},
	abstract = {Traditional vertical handover schemes postulate that vertical handovers (VHOs) of users come on an individual basis. This enables users to know previously the decision already made by other users, and then the choice will be accordingly made. However, in case of group mobility, almost all VHO decisions of all users, in a given group (e.g., passengers on board a bus or a train equipped with smart phones or laptops), will be made at the same time. This concept is called group vertical handover (GVHO). When all VHO decisions of a large number of users are made at the same time, the system performance may degrade and network congestion may occur. In this paper, we propose two fully decentralized algorithms for network access selection, and that is based on the concept of congestion game to resolve the problem of network congestion in group mobility scenarios. Two learning algorithms, dubbed Sastry Algorithm and Q-Learning Algorithm, are envisioned. Each one of these algorithms helps mobile users in a group to reach the nash equilibrium in a stochastic environment. The nash equilibrium represents a fair and efficient solution according to which each mobile user is connected to a single network and has no intention to change his decision to improve his throughput. This shall help resolve the problem of network congestion caused by GVHO. Simulation results validate the proposed algorithms and show their efficiency in achieving convergence, even at a slower pace. To achieve fast convergence, we also propose a heuristic method inspired from simulated annealing and incorporated in a hybrid learning algorithm to speed up convergence time and maintain efficient solutions. The simulation results also show the adaptability of our hybrid algorithm with decreasing step size-simulated annealing (DSS-SA) for high mobility group scenario. Copyright (c) 2015 John Wiley \& Sons, Ltd.},
	issn = {1530-8669},
	doi = {10.1002/wcm.2599},
	author = {Walid, Abdellaziz and Kobbane, Abdellatif and Mabrouk, Abdelfettah and Sabir, Essaid and Taleb, Tarik and El Koutbi, Mohammed}
}
@article {Walid20161256,
	title = {Group vertical handoff management in heterogeneous networks},
	journal = {Wireless Communications and Mobile Computing},
	volume = {16},
	number = {10},
	year = {2016},
	note = {cited By 0},
	pages = {1256-1270},
	abstract = {Traditional vertical handover schemes postulate that vertical handovers (VHOs) of users come on an individual basis. This enables users to know previously the decision already made by other users, and then the choice will be accordingly made. However, in case of group mobility, almost all VHO decisions of all users, in a given group (e.g., passengers on board a bus or a train equipped with smart phones or laptops), will be made at the same time. This concept is called group vertical handover (GVHO). When all VHO decisions of a large number of users are made at the same time, the system performance may degrade and network congestion may occur. In this paper, we propose two fully decentralized algorithms for network access selection, and that is based on the concept of congestion game to resolve the problem of network congestion in group mobility scenarios. Two learning algorithms, dubbed Sastry Algorithm and Q-Learning Algorithm, are envisioned. Each one of these algorithms helps mobile users in a group to reach the nash equilibrium in a stochastic environment. The nash equilibrium represents a fair and efficient solution according to which each mobile user is connected to a single network and has no intention to change his decision to improve his throughput. This shall help resolve the problem of network congestion caused by GVHO. Simulation results validate the proposed algorithms and show their efficiency in achieving convergence, even at a slower pace. To achieve fast convergence, we also propose a heuristic method inspired from simulated annealing and incorporated in a hybrid learning algorithm to speed up convergence time and maintain efficient solutions. The simulation results also show the adaptability of our hybrid algorithm with decreasing step size-simulated annealing (DSS-SA) for high mobility group scenario. Copyright {\textcopyright} 2015 John Wiley \& Sons, Ltd. Copyright {\textcopyright} 2015 John Wiley \& Sons, Ltd.},
	doi = {10.1002/wcm.2599},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930151466\&doi=10.1002\%2fwcm.2599\&partnerID=40\&md5=a91b7ce3e8af4694e732a00f04f01d95},
	author = {Walid, A.a and Kobbane, A.a and Mabrouk, A.a and Sabir, E.b and Taleb, T.c and El Koutbi, M.a}
}
@conference { ISI:000381477900097,
	title = {A Game Theory-Based Approach for Robots Deploying Wireless Sensor Nodes},
	booktitle = {2015 INTERNATIONAL WIRELESS COMMUNICATIONS \& MOBILE COMPUTING CONFERENCE (IWCMC)},
	series = {International Wireless Communications and Mobile Computing Conference},
	year = {2015},
	note = {11th IEEE International Wireless Communications and Mobile Computing Conference (IEEE IWCMC), Dubrovnik, CROATIA, AUG 24-25, 2015},
	pages = {557-562},
	publisher = {IEEE; IEEE Croatia Sect; Univ Dubrovnik},
	organization = {IEEE; IEEE Croatia Sect; Univ Dubrovnik},
	abstract = {Wireless Sensor Networks (WSNs) are deployed in many fields of application. Depending on the application requirements, sensor nodes can either be mobile and autonomous or static. In both cases, they are able to cooperate together in order to monitor a given area or some given Points of Interest (PoIs). Static sensor nodes need one or several agent(s) (humans or robots) to deploy them. In this paper, we focus on the deployment of static sensor nodes in an area containing obstacles, using two mobile robots. We want to minimize the time needed by the two robots to deploy all the sensor nodes and to return to their starting position. We require that each sensor node is placed at a PoI position, no PoI position is empty and no PoI position is occupied by more than one sensor node. The problem consists in determining the best strategy for each robot in order to meet these constraints. We adopt a game theory approach to solve this problem.},
	isbn = {978-1-4799-5344-8},
	issn = {2376-6492},
	author = {Khoufi, Ines and Minet, Pascale and Koulali, Mohamed-Amine and Erradi, Mohammed}
}
@conference {Khoufi2015557,
	title = {A game theory-based approach for robots deploying wireless sensor nodes},
	booktitle = {IWCMC 2015 - 11th International Wireless Communications and Mobile Computing Conference},
	year = {2015},
	note = {cited By 1},
	pages = {557-562},
	abstract = {Wireless Sensor Networks (WSNs) are deployed in many fields of application. Depending on the application requirements, sensor nodes can either be mobile and autonomous or static. In both cases, they are able to cooperate together in order to monitor a given area or some given Points of Interest (PoIs). Static sensor nodes need one or several agent(s) (humans or robots) to deploy them. In this paper, we focus on the deployment of static sensor nodes in an area containing obstacles, using two mobile robots. We want to minimize the time needed by the two robots to deploy all the sensor nodes and to return to their starting position. We require that each sensor node is placed at a PoI position, no PoI position is empty and no PoI position is occupied by more than one sensor node. The problem consists in determining the best strategy for each robot in order to meet these constraints. We adopt a game theory approach to solve this problem. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/IWCMC.2015.7289144},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84949491266\&doi=10.1109\%2fIWCMC.2015.7289144\&partnerID=40\&md5=1f85f3af906970d1ae54fbb89ee6ec33},
	author = {Khoufi, I.a and Minet, P.a and Koulali, M.-A.b and Erradi, M.c}
}
@conference {Annouch2015,
	title = {Gas-filling stations procurement problem with time windows using a heterogeneous fleet of full tankers},
	booktitle = {2015 10th International Conference on Intelligent Systems: Theories and Applications, SITA 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {In this paper, we address the problem of procurement related to the supply of liquefied petroleum gas (LPG). We are interested in the issue of shipping large quantities of bulk gas (butane and propane) from storage terminals to filling stations storage capacities using a fleet of tankers. The procurement goal is the assignment of quantities of gas to be transferred for each filling station; then, the shipping of these quantities with a heterogeneous fleet of tankers which respects the time schedule of those stations. After a review of literature for the classes of vehicle routing problem with backhauls in oil and gas procurement problems, we will present an integer linear programming formulation (ILP), then, we attempt to solve the problem using a solver, following this by testing and discussing results. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/SITA.2015.7358387},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962464691\&doi=10.1109\%2fSITA.2015.7358387\&partnerID=40\&md5=cc982aff48cd7feee13855a979efa66d},
	author = {Annouch, A. and Bellabdaoui, A.}
}
@conference { ISI:000380409500013,
	title = {Gas-filling stations procurement problem with time windows using a heterogeneous fleet of full tankers},
	booktitle = {2015 10TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS: THEORIES AND APPLICATIONS (SITA)},
	year = {2015},
	note = {10th International Conference on Intelligent Systems - Theories and Applications (SITA), ENSIAS, Rabat, MOROCCO, OCT 20-21, 2015},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In this paper, we address the problem of procurement related to the supply of liquefied petroleum gas (LPG). We are interested in the issue of shipping large quantities of bulk gas (butane and propane) from storage terminals to filling stations storage capacities using a fleet of tankers. The procurement goal is the assignment of quantities of gas to be transferred for each filling station; then, the shipping of these quantities with a heterogeneous fleet of tankers which respects the time schedule of those stations. After a review of literature for the classes of vehicle routing problem with backhauls in oil and gas procurement problems, we will present an integer linear programming formulation (ILP), then, we attempt to solve the problem using a solver, following this by testing and discussing results.},
	isbn = {978-1-5090-0220-7},
	author = {Annouch, Anouar and Bellabdaoui, Adil}
}
@article {Sbai2015111,
	title = {Generating services supporting variability from configurable process models},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {72},
	number = {1},
	year = {2015},
	note = {cited By 0},
	pages = {111-124},
	abstract = {Today, a PAIS (Process-Aware Information System) is the broadly adopted information system by enterprises, which aims to define how to use services and business processes to achieve the business goals of enterprises. For this purpose, research work in PAIS was interested in aligning business processes and services in order to achieve a good connection between business process models as represented in the process layer, and service models as represented in the application layer In this context, to improve the reuse of business processes and services, the concepts of configurable process models and configurable services (which support variability) have emerged as new leading edge concepts for improving reuse. Indeed, variability refers to the characteristic of a system to adapt, specialize and configure itself with the context of use. More recently, configurable process models become the most popular solution to deal with adaptability in a PAIS. This has increased the research focus in how to extract services from configurable process models. Several approaches have developed solutions for proposing services generation from business process. However, generating configurable services from configurable process model has been neglected in the context of PAIS. In this paper, we propose an MDA approach for an automatic generation of configurable service models from configurable process models. {\textcopyright} 2005 - 2015 JATIT \& LLS. All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84922695803\&partnerID=40\&md5=c3ae357bd43958ac23a5336e13ba61e6},
	author = {Sba{\"\i}, H. and Fredj, M. and Chakir, B.}
}
@article {Laghouaouta2015461,
	title = {A generic traceability framework for model composition operation},
	journal = {Lecture Notes in Business Information Processing},
	volume = {214},
	year = {2015},
	note = {cited By 0},
	pages = {461-475},
	abstract = {In order to handle complexity, model driven engineering aims at building systems by developing several models, where each model represents a specific concern of the system. In this context, designers need mechanisms to validate, synchronize and understand interactions between those perspectives. Model composition deals with these issues but remains a complex task. For these reasons, we believe that a strong traceability mechanism is a key factor to handle relationships between models and manage the complexity of the composition operation. This paper describes a generic approach to keep track of the model composition operation. We also define a traces generation process to adapt our proposal to any specific composition language. Finally, an example is presented to illustrate our contributions. {\textcopyright} Springer International Publishing Switzerland 2015},
	doi = {10.1007/978-3-319-19237-6_29},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84937468107\&doi=10.1007\%2f978-3-319-19237-6_29\&partnerID=40\&md5=70fd5914c3cd727e75134079e8031585},
	author = {Laghouaouta, Y.a and Anwar, A.b and Nassar, M.a and Bruel, J.-M.c}
}
@conference {Belghiti2015425,
	title = {Green opportunistic access for CRN with selfish users using coalitional game approach in partition form},
	booktitle = {Colloquium in Information Science and Technology, CIST},
	volume = {2015-January},
	number = {January},
	year = {2015},
	note = {cited By 2},
	pages = {425-429},
	abstract = {We study energy conservation and system performance of decentralized cognitive radio network with cognitive users. Every cognitive radio (CR) user needs to sense the channel to send data, if the channel is unoccupied by a licensed user only one winner transmits its data. Hence, all other users waste their energy in sensing the licensed bands and in negotiating the resource access without managing to transmit data packets. We formulate the sensing-energy tradeoff problem for distributed cognitive radio network as a coalition formation game. Our contribution is to apply the coalitional game design to the most important phases of cognitive radio network (CRN): sensing and data transmission. The concept of coalitional game may enforce the cooperative behavior of CR users in order to improve the system performance (energy and delay.). The network is modeled using a coalitional game in partition form with non transferable utility (NTU). After forming coalitions, no CR user in those coalitions aim to change its position. Indeed, the members of this coalition will cooperate both in sensing and access phases to improve system performance. The selfish behavior becomes evident when the cognitive users are constrained to send their data in a short delay and with a minimum of energy consumption. Our proposed algorithm explains how the selfish atittude of the cognitive user leds to join the coalition that increases its individual gain, and tacitly to improve the performance of the entire system. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/CIST.2014.7016658},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938054783\&doi=10.1109\%2fCIST.2014.7016658\&partnerID=40\&md5=c2614efbd91a53116fb15f05bc9c369d},
	author = {Belghiti, I.D.a and Elmachkour, M.b and Berrada, I.a and Kobbane, A.b}
}
@conference {Slimani2014168,
	title = {Game theory to control logistic costs in a two-echelon supply chain},
	booktitle = {Proceedings of 2nd IEEE International Conference on Logistics Operations Management, GOL 2014},
	year = {2014},
	note = {cited By 4},
	pages = {168-170},
	abstract = {As a mathematical tool of the decision maker, game theory is an essential methodology to analyze and solve situations where the decision of each rational agent, called player, affects the other agent{\textquoteright}s payoff. Indeed, in this work game theory is used to analyze an inventory and transportation optimization problem within a supply chain composed of two agents: a retailer who faces a random demand of a final product and his supplier of raw materials that is also responsible of the transportation function. Since the retailer is closer to the market and has a better view of demand forecasts careful attention given to Information sharing and its impacts. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/GOL.2014.6887435},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84908632329\&doi=10.1109\%2fGOL.2014.6887435\&partnerID=40\&md5=059b1ee51ffe9bf41468fce7e9cd9ed5},
	author = {Slimani, I. and Achchab, S.}
}
@conference { ISI:000346582400026,
	title = {Game theory to control logistic costs in a two-echelon supply chain},
	booktitle = {PROCEEDINGS OF 2014 2ND IEEE INTERNATIONAL CONFERENCE ON LOGISTICS AND OPERATIONS MANAGEMENT (GOL 2014)},
	year = {2014},
	note = {2nd IEEE International Conference on Logistics Operations Management (GOL), Rabat, MOROCCO, JUN 05-07, 2014},
	pages = {168-171},
	publisher = {IEEE; Mohammed VI Souissi Univ, ENSIAS Sch; Univ Le Havre; Sidi Mohamed Ben Abdellah Univ, FST},
	organization = {IEEE; Mohammed VI Souissi Univ, ENSIAS Sch; Univ Le Havre; Sidi Mohamed Ben Abdellah Univ, FST},
	abstract = {As a mathematical tool of the decision maker, game theory is an essential methodology to analyze and solve situations where the decision of each rational agent, called player, affects the other agent{\textquoteright}s payoff. Indeed, in this work game theory is used to analyze an inventory and transportation optimization problem within a supply chain composed of two agents: a retailer who faces a random demand of a final product and his supplier of raw materials that is also responsible of the transportation function. Since the retailer is closer to the market and has a better view of demand forecasts careful attention given to Information sharing and its impacts.},
	isbn = {978-1-4799-4650-1},
	author = {Slimani, Ilham and Achchab, Said},
	editor = {Benadada, Y}
}
@article {Mabrouk20141417,
	title = {Gateways{\textquoteright} mobility increases the capacity of communication in VANETs: Routing algorithm based on congestion game},
	journal = {International Review on Computers and Software},
	volume = {9},
	number = {8},
	year = {2014},
	note = {cited By 2},
	pages = {1417-1425},
	abstract = {Vehicular Ad Hoc Network (VANET) is considered as a special application of Mobile Ad Hoc Networks in road traffic, which can autonomously organize networks without infrastructure. VANETs enable vehicles on the road to communicate with each other and with road infrastructure using wireless capabilities. In the last few years, extensive research provided several routing algorithms to extend Internet connectivity to VANETs through fixed gateways installed along the road. However, most of these algorithms have not been effective because of the high mobility of vehicles in the road. In this paper, we propose a routing algorithm which based both on the congestion game to resolve the problem of network congestion and on mobile gateways to resolve the problem of high mobility in VANET. Therefore, the proposed algorithm is a prediction done by each node in the network that helps them to reach the optimal route to access Internet. Simulation results validate the algorithm and show its robustness under two scenarios. In the first one, we examine the algorithm with fixed gateways installed along the road to validate the connectivity to the Internet. Whilst in the second scenario, we examine the algorithm with mobile gateways to show the effectiveness of gateways{\textquoteright} mobility on the capacity of communication and the Internet access in VANETs. {\textcopyright} 2014 Praise Worthy Prize S.r.l. - All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84908347271\&partnerID=40\&md5=359209fd84ed425637bce48a01410d6b},
	author = {Mabrouk, A.a and Senhadji, M.b and Walid, A.a and Kobbane, A.b and El Koutbi, M.a}
}
@conference {Koudougnon2014118,
	title = {A Genetic Algorithms based detector for MIMO STBC systems},
	booktitle = {WCCCS 2014 - Proceedings; 2014 5th Workshop on Codes, Cryptography and Communication Systems},
	year = {2014},
	note = {cited By 0},
	pages = {118-123},
	abstract = {This paper proposes a new STBC MIMO detector based on Genetic Algorithms (GA) that can approach the performances of an optimal detector based on the maximum likekihood dtector (MLD). This detector is a hybridization between the GA and a linear detector such as ZF or MMSE detector. The optimization of the parameters of the GA can significantly improve performances. Our detector was compared with other equivalent detectors. The results show that our proposed algorithm gives better performance. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/WCCCS.2014.7107906},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84983119233\&doi=10.1109\%2fWCCCS.2014.7107906\&partnerID=40\&md5=a83799f8aa9373bdc7b5106c86a7ddc0},
	author = {Koudougnon, H. and Azouaoui, A. and Belkasmi, M.}
}
@article {10001634720141101,
	title = {A Graph Based Approach to Trace Models Composition.},
	journal = {Journal of Software (1796217X)},
	volume = {9},
	number = {11},
	year = {2014},
	pages = {2813 - 2822},
	abstract = {A model driven engineering process involves different and heterogeneous models that represent various perspectives of the system under development. The model composition operation allows combining those sub-models into an integrated view, but remains a tedious activity. For that, traceability information must be maintained to comprehend the composition effects and better manage the operation itself. Against this context, the current paper describes a framework for model composition traceability. We consider the traces generation concern as a crosscutting concern where the weaving mechanism is performed using graph transformations. A composition specification case study is presented to illustrate our contribution. [ABSTRACT FROM AUTHOR]},
	keywords = {aspect oriented modeling, Computer engineering, Computer simulation, Graph theory, graph transformation, Heterogeneous computing, Information theory, model composition, model transformation, traceability},
	issn = {1796217X},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=100016347\&site=ehost-live},
	author = {Laghouaouta, Youness and Anwar, Adil and Nassar, Mahmoud and Coulette, Bernard}
}
@article {Belghiti20141705,
	title = {Green cognitive radio networks by using coalitional game approach in partition form},
	journal = {International Review on Computers and Software},
	volume = {9},
	number = {10},
	year = {2014},
	note = {cited By 1},
	pages = {1705-1711},
	abstract = {Green energy in cognitive radio (CR) network is capable of liberating the networkfrom energy constraints, the energy is lost when CR users sense and utilize the unused spectrum for data communications. Green energy in CR increases the network availability and so prolongs developing network applications. The CR network performances seriously based on exploiting the available spectrum without losing energy and wasting time. In our work, a coalitional game approach is applied to enhance system performances, we study the coalitional formation process in partition form with transferable utility (TU). In our paper a new coalition value formula is proposed based on the data transmission rate and energy efficiency. Our approach uses the Shapley value to evaluate the users utilities in coalitions. We use a strategic learning algorithm to learn the Nash equilibrium, a theoretical proof of convergence is defined. Finally, we provide numerical results to validate the proposed approach. Coalitional game tool improves secondary users battery life and network performances. {\textcopyright} 2014 Praise Worthy Prize S.r.l. - All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84918782340\&partnerID=40\&md5=2dcb30a3548e9b41ff19878909e32377},
	author = {Belghiti, I.D.a and Elmachkour, M.b and Berrada, I.a and Omari, L.a}
}
@conference {Elmachkour20145372,
	title = {Green opportunistic access for cognitive radio networks: A minority game approach},
	booktitle = {2014 IEEE International Conference on Communications, ICC 2014},
	year = {2014},
	note = {cited By 6},
	pages = {5372-5377},
	abstract = {We investigate energy conservation and system performance of decentralized resource allocation scheme in cognitive radio networks thoroughly based on secondary users competitive behavior. Indeed, the contention on data channel unoccupied by licensed user leads to a single winner, but also involves a loss of energy of all nodes. In this paper, we apply minority game (MG) to the most important phase from the opportunistic spectrum access (OSA) process: the sensing phase. We attempt to carry out a cooperation in a non-cooperative environment with no information exchange. We study the Nash equilibrium solution for pure and fully mixed strategies, and we use distributed learning algorithms enabling cognitive users to learn the Nash equilibrium. Finally, we provide numerical results to validate the proposed approach. The resource allocation based on minority game approach improves secondary users battery life and the performance of the network. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/ICC.2014.6884175},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84907000432\&doi=10.1109\%2fICC.2014.6884175\&partnerID=40\&md5=13fd149d57c8c1d76ace2aecdcd1d08a},
	author = {Elmachkour, M.a and Daha, I.b and Sabir, E.c and Kobbane, A.a d and Ben-Othman, J.d}
}
@conference { ISI:000366666805090,
	title = {Green Opportunistic Access for Cognitive Radio Networks: A Minority Game Approach},
	booktitle = {2014 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC)},
	series = {IEEE International Conference on Communications},
	year = {2014},
	note = {IEEE International Conference on Communications (ICC), Sydney, AUSTRALIA, JUN 10-14, 2014},
	pages = {5372-5377},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We investigate energy conservation and system performance of decentralized resource allocation scheme in cognitive radio networks thoroughly based on secondary users competitive behavior. Indeed, the contention on data channel unoccupied by licensed user leads to a single winner, but also involves a loss of energy of all nodes. In this paper, we apply minority game (MG) to the most important phase from the opportunistic spectrum access (OSA) process: the sensing phase. We attempt to carry out a cooperation in a non-cooperative environment with no information exchange. We study the Nash equilibrium solution for pure and fully mixed strategies, and we use distributed learning algorithms enabling cognitive users to learn the Nash equilibrium. Finally, we provide numerical results to validate the proposed approach. The resource allocation based on minority game approach improves secondary users battery life and the performance of the network.},
	isbn = {978-1-4799-2003-7},
	issn = {1550-3607},
	author = {Elmachkour, Mouna and Daha, Imane and Sabir, Essaid and Kobbane, Abdellatif and Ben-Othman, Jalel},
	editor = {Jamalipour, A and Deng, DJ}
}
@conference { ISI:000371484600074,
	title = {Green opportunistic access for CRN with selfish users using Coalitional game Approach in partition form},
	booktitle = {2014 THIRD IEEE INTERNATIONAL COLLOQUIUM IN INFORMATION SCIENCE AND TECHNOLOGY (CIST{\textquoteright}14)},
	series = {Colloquium in Information Science and Technology},
	year = {2014},
	note = {3rd IEEE International Colloquium on Information Science and Technology (CIST), Tetouan, MOROCCO, OCT 20-22, 2014},
	pages = {425-429},
	publisher = {IEEE; IEEE Comp Soc; IEEE Commun Soc; IEEE Morocco Sect; IEEE Morocco Comp \& Commun Joint Chapter; UAE IEEE Student Branch; Univ Abdelmalek Essaadi; ENSA Tetouan},
	organization = {IEEE; IEEE Comp Soc; IEEE Commun Soc; IEEE Morocco Sect; IEEE Morocco Comp \& Commun Joint Chapter; UAE IEEE Student Branch; Univ Abdelmalek Essaadi; ENSA Tetouan},
	abstract = {We study energy conservation and system performance of decentralized cognitive radio network with cognitive users. Every cognitive radio (CR) user needs to sense the channel to send data, if the channel is unoccupied by a licensed user only one winner transmits its data. Hence, all other users waste their energy in sensing the licensed bands and in negotiating the resource access without managing to transmit data packets. We formulate the sensing-energy tradeoff problem for distributed cognitive radio network as a coalition formation game. Our contribution is to apply the coalitional game design to the most important phases of cognitive radio network (CRN): sensing and data transmission. The concept of coalitional game may enforce the cooperative behavior of CR users in order to improve the system performance (energy and delay..). The network is modeled using a coalitional game in partition form with non transferable utility (NTU). After forming coalitions, no CR user in those coalitions aim to change its position. Indeed, the members of this coalition will cooperate both in sensing and access phases to improve system performance. The selfish behavior becomes evident when the cognitive users are constrained to send their data in a short delay and with a minimum of energy consumption. Our proposed algorithm explains how the selfish atittude of the cognitive user leds to join the coalition that increases its individual gain, and tacitly to improve the performance of the entire system.},
	isbn = {978-1-4799-5979-2},
	issn = {2327-185X},
	author = {Belghiti, Imane Daha and Elmachkour, Mouna and Berrada, Ismail and Kobbane, Abdellatif},
	editor = {ElMohajir, M and AlAchhab, M and Chahhou, M}
}
@article {Elmachkour2014150,
	title = {The greening of spectrum sensing: A minority game-based mechanism design},
	journal = {IEEE Communications Magazine},
	volume = {52},
	number = {12},
	year = {2014},
	note = {cited By 5},
	pages = {150-156},
	abstract = {Cognitive radio technology allows the reuse of the underutilized frequency spectrum on an opportunistic and non-interfering basis by means of introducing, besides the legitimate primary users of the spectrum, a new kind of users called cognitive or secondary users. Thus, reliable spectrum sensing is critical to dynamically detect available licensed frequency bands and mitigate the primary signals, but it remains realistically difficult to carry out. In fact, although distributed collaborative sensing has turned out to be fruitful for the cognitive radio environment, its accuracy is often affected by the selfish and autonomous behavior of users. In this article, we model distributed spectrum sensing and channel allocation as a non-cooperative game, and apply the minority game to bring forth and study the cooperative behavior of users. The novelty brought by our study consists of alleviating the number of users contending for primary channels by giving them the opportunity to choose between the two, either sensing the channel or being inactive during the time slot. To address the trade-off faced by the SUs, we evaluate the performance of two secondary systems in a green communications context: energy consumption and transmission delay. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/MCOM.2014.6979967},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84919712749\&doi=10.1109\%2fMCOM.2014.6979967\&partnerID=40\&md5=72e3daa3f2e577d4633668e3bd67f25a},
	author = {Elmachkour, M.a and Sabir, E.b and Kobbane, A.a and Ben-Othman, J.c and El Koutbi, M.a}
}
@article { ISI:000348218400023,
	title = {The Greening of Spectrum Sensing: A Minority Game-Based Mechanism Design},
	journal = {IEEE COMMUNICATIONS MAGAZINE},
	volume = {52},
	number = {12},
	year = {2014},
	month = {DEC},
	pages = {150-156},
	abstract = {Cognitive radio technology allows the reuse of the underutilized frequency spectrum on an opportunistic and non-interfering basis by means of introducing, besides the legitimate primary users of the spectrum, a new kind of users called cognitive or secondary users. Thus, reliable spectrum sensing is critical to dynamically detect available licensed frequency bands and mitigate the primary signals, but it remains realistically difficult to carry out. In fact, although distributed collaborative sensing has turned out to be fruitful for the cognitive radio environment, its accuracy is often affected by the selfish and autonomous behavior of users. In this article, we model distributed spectrum sensing and channel allocation as a non-cooperative game, and apply the minority game to bring forth and study the cooperative behavior of users. The novelty brought by our study consists of alleviating the number of users contending for primary channels by giving them the opportunity to choose between the two, either sensing the channel or being inactive during the time slot. To address the trade-off faced by the SUs, we evaluate the performance of two secondary systems in a green communications context: energy consumption and transmission delay.},
	issn = {0163-6804},
	author = {Elmachkour, Mouna and Sabir, Essaid and Kobbane, Abdellatif and Ben-Othman, Jalel and El Koutbi, Mohammed}
}
@conference { ISI:000350287800014,
	title = {A Generic Metamodel for Adaptable Service Oriented Systems Modeling using DSM Approach},
	booktitle = {2013 3RD INTERNATIONAL SYMPOSIUM ISKO-MAGHREB},
	year = {2013},
	note = {ISKO-Maghreb 3rd International Symposium, Marrakech, MOROCCO, NOV 08-09, 2013},
	publisher = {ISKO},
	organization = {ISKO},
	abstract = {CAC (context aware computing) has recently emerged as a new computing paradigm promising adaptable systems development. Context awareness for services oriented systems (SOS) raises many challenges. Particularly, the challenge of engineering such systems which consists of the definition of modeling approaches, processes, techniques and tools to facilitate construction of these systems. In this paper, we propose a generic metamodel for Adaptable, Domain Specific and Service Oriented Systems. Our metamodel aims to facilitate the creation of Domain Specific Language (DSL) for adaptable and service oriented architecture. For a specific domain the language developer must produce their specific service metamodel based on our generic service metamodel.},
	isbn = {978-1-4799-3392-1},
	author = {Lethrech, M. and Elmagrouni, I. and Nassar, M. and Kriouile, A. and Kenzi, A.}
}
@conference {Lethrech2013,
	title = {A generic metamodel for adaptable service oriented systems modeling using DSM approach},
	booktitle = {2013 3rd International Symposium ISKO-Maghreb},
	year = {2013},
	note = {cited By 0},
	abstract = {CAC (context aware computing) has recently emerged as a new computing paradigm promising adaptable systems development. Context awareness for services oriented systems (SOS) raises many challenges. Particularly, the challenge of engineering such systems which consists of the definition of modeling approaches, processes, techniques and tools to facilitate construction of these systems. In this paper, we propose a generic metamodel for Adaptable, Domain Specific and Service Oriented Systems. Our metamodel aims to facilitate the creation of Domain Specific Language (DSL) for adaptable and service oriented architecture. For a specific domain the language developer must produce their specific service metamodel based on our generic service metamodel. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/ISKO-Maghreb.2013.6728120},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84894115518\&doi=10.1109\%2fISKO-Maghreb.2013.6728120\&partnerID=40\&md5=b73bcb5b1c16fdba7c60512808a95537},
	author = {Lethrech, M.a and Elmagrouni, I.a and Nassar, M.a and Kriouile, A.a and Kenzi, A.b}
}
@conference {Benamar20135,
	title = {Gradient-based time to contact on paracatadioptric camera},
	booktitle = {2013 IEEE International Conference on Image Processing, ICIP 2013 - Proceedings},
	year = {2013},
	note = {cited By 2},
	pages = {5-9},
	abstract = {The problem of time to contact or time to collision (TTC) estimation is largely discussed in perspective images. However, a few works have dealt with images of catadioptric sensors despite of their utility in robotics applications. The objective of this paper is to develop a novel model for estimating TTC with catadioptric images relative to a planar surface, and to demonstrate that TTC can be estimated only with derivative brightness and image coordinates. This model, called {\textquoteright}gradient based time to contact{\textquoteright}, does not need high processing such as explicit estimation of optical flow and feature detection and/or tracking. The proposed method allows to estimate TTC and gives additional information about the orientation of planar surface. It was tested on simulated and real datasets. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/ICIP.2013.6738002},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84897697160\&doi=10.1109\%2fICIP.2013.6738002\&partnerID=40\&md5=2d096a6f98a59c3c442f3c24ffca4bbc},
	author = {Benamar, F.a d and El Fkihi, S.a b and Demonceaux, C.c and Mouaddib, E.d and Aboutajdine, D.a}
}
@conference { ISI:000351597600002,
	title = {GRADIENT-BASED TIME TO CONTACT ON PARACATADIOPTRIC CAMERA},
	booktitle = {2013 20TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP 2013)},
	series = {IEEE International Conference on Image Processing ICIP},
	year = {2013},
	note = {20th IEEE International Conference on Image Processing (ICIP), Melbourne, AUSTRALIA, SEP 15-18, 2013},
	pages = {5-9},
	publisher = {Inst Elect \& Elect Engineers; IEEE Signal Proc Soc},
	organization = {Inst Elect \& Elect Engineers; IEEE Signal Proc Soc},
	abstract = {The problem of time to contact or time to collision (TTC) estimation is largely discussed in perspective images. However, a few works have dealt with images of catadioptric sensors despite of their utility in robotics applications. The objective of this paper is to develop a novel model for estimating TTC with catadioptric images relative to a planar surface, and to demonstrate that TTC can be estimated only with derivative brightness and image coordinates. This model, called {\textquoteleft}{\textquoteleft}gradient based time to contact{{\textquoteright}{\textquoteright}}, does not need high processing such as explicit estimation of optical flow and feature detection and/or tracking. The proposed method allows to estimate TTC and gives additional information about the orientation of planar surface. It was tested on simulated and real datasets.},
	isbn = {978-1-4799-2341-0},
	issn = {1522-4880},
	author = {Benamar, F. and El Fkihi, S. and Demonceaux, C. and Mouaddib, E. and Aboutajdine, D.}
}
@article {Anwar20131,
	title = {A graphical specification of model composition with triple graph grammars},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {7706 LNCS},
	year = {2013},
	note = {cited By 1},
	pages = {1-18},
	abstract = {The concept of model is widely used in the MDE approach in order to represent several software artifacts, which are handled by different development teams throughout the software life cycle. Management of these models requires the definition of a set of model management operators such as the composition operation. This is generally an operation, which is dedicated to merge a number of models in order to create one (or more) incorporated model and which depends on the application context. The current work focuses on the description of a formal approach for model composition where the composition is specified by a set of graph transformation rules over UML-compliant models. The semantics of our composition operator is defined using triple graph grammars (TGGs) formalism. Furthermore, we present a composition scheme interpreted by a three-steps composition process: matching, checking and merging. {\textcopyright} 2013 Springer-Verlag.},
	doi = {10.1007/978-3-642-38209-3_1},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84883434558\&doi=10.1007\%2f978-3-642-38209-3_1\&partnerID=40\&md5=d6c0f27b3631bd269a86415547a1dcb1},
	author = {Anwar, A.a and Benelallam, A.b and Nassar, M.b and Coulette, B.c}
}
@conference { ISI:000324984400067,
	title = {GUI Code Generation for Android Applications Using a MDA Approach},
	booktitle = {PROCEEDINGS OF 2012 INTERNATIONAL CONFERENCE ON COMPLEX SYSTEMS (ICCS12)},
	year = {2012},
	note = {1st International Conference on Complex Systems (ICCS), Agadir, MOROCCO, NOV 05-06, 2012},
	pages = {393-398},
	abstract = {Developing applications for mobile platforms is a compound task, due to variability of mobile OSs and the number of different devices that need to be supported. Model-Driven Architecture (MDA) approach could provide a possible solution to provide an automated way to generate a Graphical User Interface (GUI) for such applications. In this paper, we propose an approach based on MDA, to generate GUI for mobile applications on smartphones. The adopted approach consists of three main steps (i) analyzing and modeling the GUI under UML; (ii) transforming the obtained diagrams to a simplified XMI schema using JDOM API; and (iii) generating the GUI based on MDA. Our method has the advantages to generate automatically GUI for several platforms, and gives a graphical way for designing in UML.},
	isbn = {978-1-4673-4766-2},
	author = {Sabraoui, Ayoub and El Koutbi, Mohammed and Khriss, Ismail},
	editor = {Essaaidi, M and Nemiche, M}
}
@conference {Sabraoui2012,
	title = {GUI code generation for Android applications using a MDA approach},
	booktitle = {Proceedings of 2012 International Conference on Complex Systems, ICCS 2012},
	year = {2012},
	note = {cited By 0},
	doi = {10.1109/ICoCS.2012.6458567},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84874457236\&doi=10.1109\%2fICoCS.2012.6458567\&partnerID=40\&md5=a1e6336bcd6c0c33f76c4ff1126d0517},
	author = {Sabraoui, A. and Koutbi, M.E. and Khriss, I.}
}
@article {Berbia201135,
	title = {Genetic Algorithm for decoding linear codes over awgn and fading channels},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {30},
	number = {1},
	year = {2011},
	note = {cited By 0},
	pages = {35-41},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84860407864\&partnerID=40\&md5=032b7cf7b41aa626071a6c25b09716cf},
	author = {Berbia, H. and Elbouanani, F. and Romadi, R. and Benazza, H. and Belkasmi, M.}
}
@conference {Azouaoui2011,
	title = {A genetic algorithm to search of good double-circulant codes},
	booktitle = {International Conference on Multimedia Computing and Systems -Proceedings},
	year = {2011},
	note = {cited By 2},
	doi = {10.1109/ICMCS.2011.5945582},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79961229274\&doi=10.1109\%2fICMCS.2011.5945582\&partnerID=40\&md5=f33d2b1f9eced1a4a2448d6a0986b0d1},
	author = {Azouaoui, A. and Askali, M. and Belkasmi, M.}
}
@conference {Enneya2009327,
	title = {A game theory approach for enhancing QoS-aware routing in mobile ad hoc networks},
	booktitle = {2009 1st International Conference on Networked Digital Technologies, NDT 2009},
	year = {2009},
	note = {cited By 5},
	pages = {327-333},
	doi = {10.1109/NDT.2009.5272153},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-70450186591\&doi=10.1109\%2fNDT.2009.5272153\&partnerID=40\&md5=ad4cf8e5abf1cfb627bffe71394afa94},
	author = {Enneya, N. and Elmeziane, R. and Elkoutbi, M.}
}
@conference { ISI:000279656200056,
	title = {Game Theory Approach for Enhancing QoS-Aware Routing in Mobile Ad hoc Networks},
	booktitle = {NDT: 2009 FIRST INTERNATIONAL CONFERENCE ON NETWORKED DIGITAL TECHNOLOGIES},
	year = {2009},
	note = {1st International Conference on Networked Digital Technologies (NDT 2009), VSB Tech Univ Ostrava, Fac Elect Engn \& Comp Sci, Ostrava, CZECH REPUBLIC, JUL 28-31, 2009},
	pages = {327-333},
	publisher = {IEEE Commun Soc},
	organization = {IEEE Commun Soc},
	abstract = {The dynamic nature of Mobile Ad hoc Networks (MANETs) is attributed to several inherent characteristics, such as variable link behavior, node movements and changing network topology. Providing Quality of Service (QoS) in such a dynamic environment is very difficult. QoS-aware routing is one of the QoS support that provides QoS at the network layer In the presence of high mobility, this QoS solution can be down. Furthermore, taking mobility in consideration can enhance and guarantee it. In this paper, we propose a cooperative game theory approach to extract a core in MA NET that is stable in terms of mobility. This core is a subset of MANET mobile nodes where his mobility is less and stable. The selection of paths by the QoS-aware routing protocols through this extracted core can be ensure more the provided QoS in time.},
	isbn = {978-1-4244-4614-8},
	author = {Enneya, Nourddine and Elmeziane, Rachid and Elkoutbi, Mohammed}
}
@conference { ISI:000289870300013,
	title = {GDCoS: A Group Dedicated Class of Service for QoS Multicast Provisioning in ISP Communication Networks},
	booktitle = {2009 FIRST INTERNATIONAL CONFERENCE ON EVOLVING INTERNET (INTERNET 2009)},
	year = {2009},
	note = {1st International Conference on Evolving Internet, Cannes, FRANCE, AUG 23-29, 2009},
	pages = {77-82},
	abstract = {Offering new Multicast Services supporting Quality of Service becomes essential for an Internet Service Provider at the worldwide level. The {\textquoteleft}{\textquoteleft}IP Multicasr technology is stable, but scalability of {\textquoteleft}{\textquoteleft}Quality of Service multicast{{\textquoteright}{\textquoteright}} is further from being solved, since scalability problems appear with the increasing number of concurrently active multicast groups. In this paper, we propose a framework that offers Quality of Service enabled multicast. We start with discussing the drawbacks of Quality of Service policies that are currently adopted by Service Providers, and point out their real needs from a multicast view point. In our approach, a Service Provider will propose an independent Class of Service dedicated to multicast applications. We describe the properties of this {\textquoteleft}{\textquoteleft}Dedicated Class of Service{{\textquoteright}{\textquoteright}}, and associate {\textquoteleft}{\textquoteleft}Admission Control{{\textquoteright}{\textquoteright}} mechanisms. We discuss the advantages of our approach, based on multicast extensions and adaptations of Diffserv model. Implementation issues are also presented in an MPIS environment. We conclude, through a case study, that it is possible to dedicate a class of service for multicast traffic.},
	isbn = {978-1-4244-4718-3},
	author = {El Kettani, Mohamed Dafir Ech-Cherif and Khatib, AbdelAli},
	editor = {Borcoci, E and McKee, S and Bogliolo, A and Dini, O}
}
@conference {Ech-CherifElKettani200977,
	title = {GDCoS: A Group Dedicated Class of Service for QoS multicast provisioning in ISP communication networks},
	booktitle = {1st International Conference on Evolving Internet, INTERNET 2009},
	year = {2009},
	note = {cited By 1},
	pages = {77-82},
	doi = {10.1109/INTERNET.2009.19},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-71249105711\&doi=10.1109\%2fINTERNET.2009.19\&partnerID=40\&md5=dea3436aa5651978833ac72fb615248e},
	author = {Ech-Cherif El Kettani, M.D. and Khatib, A.}
}
@conference { ISI:000241429800054,
	title = {Galois{\textquoteright} lattice for video navigation in a DBMS},
	booktitle = {MULTIMEDIA CONTENT REPRESENTATION, CLASSIFICATION AND SECURITY},
	series = {LECTURE NOTES IN COMPUTER SCIENCE},
	volume = {4105},
	year = {2006},
	note = {International Workshop on Multimedia Content Representation, Classification and Security (MRCS 2006), Istanbul, TURKEY, SEP 11-13, 2006},
	pages = {418-425},
	publisher = {Int Assoc Pattern Recognit; Istanbul Tech Univ; TUBITAK},
	organization = {Int Assoc Pattern Recognit; Istanbul Tech Univ; TUBITAK},
	abstract = {Digital visual media encounters many problems related to storage, representation, querying and visual presentation. In this paper, we propose a technique for the retrieval of video from a database on the basis of video shots classified by a Galois{\textquoteright} lattice. The result is a kind of hypermedia that combines both classification and visualization properties in order to navigate between key frames and video segments.},
	isbn = {3-540-39392-7},
	issn = {0302-9743},
	author = {Mbaye, Ibrahima and Martinez, Jose and Thami, Rachid Oulad Haj},
	editor = {Gunsel, B and Jain, AK and Tekalp, AM and Sankur, B}
}
