@article {Wadghiri2022,
	title = {Ensemble blood glucose prediction in diabetes mellitus: A review},
	journal = {Computers in Biology and Medicine},
	volume = {147},
	year = {2022},
	note = {cited By 0},
	abstract = {Considering the complexity of blood glucose dynamics, the adoption of a single model to predict blood glucose level does not always capture the inter- and intra-patients{\textquoteright} context changes. Ensembles are a set of machine learning techniques combining multiple single learners to find a better variance/bias trade-off and hence improve the prediction accuracy. The present paper aims to review the state of the art in predicting blood glucose using ensemble methods with regard to 8 criteria: publication year and sources, datasets used to train/evaluate the models, types of ensembles used, single learners involved to construct ensembles, combination schemes used to aggregate the base learners, metrics and validation methods adopted to assess the performance of ensembles, reported overall performance of the predictors and accuracy comparison of ensemble techniques with single models. A systematic literature review has been conducted in order to analyze and synthetize primary studies published between 2000 and 2020 in six digital libraries. A total of 32 primary papers were selected and reviewed with regard to eight review questions. The results show that ensembles have gained wider interest during the last years and improved in general the performance compared with other single models. However, multiple gaps have been identified concerning the ensembles construction process and the performance metrics used. Several recommendations have been made in this regard to design accurate ensembles for blood glucose level prediction. {\textcopyright} 2022 Elsevier Ltd},
	keywords = {algorithm, Algorithms, Blood, Blood glucose, Blood glucose level, Data mining, Diabetes mellitus, Digital libraries, Economic and social effects, Ensemble methods, Forecasting, Glucose, glucose blood level, Glucose dynamics, human, Humans, Machine learning, Machine learning techniques, Machine-learning, Performance, Single models, Trade off},
	doi = {10.1016/j.compbiomed.2022.105674},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85132341147\&doi=10.1016\%2fj.compbiomed.2022.105674\&partnerID=40\&md5=05bd59c3726654494a4be346e4e6a682},
	author = {Wadghiri, M.Z. and Idri, A. and El Idrissi, T. and Hakkoum, H.}
}
@article {Gong20222761,
	title = {Intelligent Reflecting Surface Aided Secure Communications for NOMA Networks},
	journal = {IEEE Transactions on Vehicular Technology},
	volume = {71},
	number = {3},
	year = {2022},
	note = {cited By 2},
	pages = {2761-2773},
	abstract = {Intelligent reflecting surface (IRS) is deemed a promising technique for future wireless and mobile technologies due to its ability to reconfigure the radio propagation environment. In this paper, we analyze the physical layer security (PLS) of a downlink non-orthogonal multiple access (NOMA) network through an IRS intended for assisting the wireless transmission, taking into account the external and internal eavesdropping scenarios. Considering the hardware limitations, a 1-bit coding scheme is utilized to investigate the secrecy performance of the IRS-aided NOMA (IRS-NOMA) network. Exact and asymptotic expressions in terms of the secrecy outage probability (SOP) and the effective secrecy throughput (EST) are presented, which are in consideration of the imperfect successive interference cancellation (ipSIC) and perfect SIC (pSIC). Based on the analytical results, the secrecy diversity orders are related to the number of reflecting elements and EST ceilings are observed in the high SNR regime. Monte Carlo simulations are presented to corroborate the correctness of the analyses and illustrate that the IRS-NOMA scheme is superior in the secrecy outage performance to the IRS-aided orthogonal multiple access scheme. In addition, the SOP performance enhancement through the increased number of reflecting elements and the improvement of EST through proper target secrecy rate are also evidenced by the simulations. {\textcopyright} 1967-2012 IEEE.},
	keywords = {Communication system security, Imperfect successive interference cancelation, Intelligent reflecting surface, Intelligent systems, Monte Carlo methods, Multiple access, Network layers, Network security, Non-orthogonal, Non-orthogonal multiple access, Physical layer security, Radio waves, Reflecting surface, Security, Security systems, Signal to noise ratio, Silicon carbide, Successive interference cancellations, Wireless communications},
	doi = {10.1109/TVT.2021.3129075},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85120062177\&doi=10.1109\%2fTVT.2021.3129075\&partnerID=40\&md5=162cfe3aedcb6d973b10e9471ffd8b94},
	author = {Gong, C. and Yue, X. and Wang, X. and Dai, X. and Zou, R. and Essaaidi, M.}
}
@article {Wadghiri2021544,
	title = {Ensemble Regression for Blood Glucose Prediction},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {1365 AIST},
	year = {2021},
	note = {cited By 1},
	pages = {544-554},
	abstract = {Background: Predicting blood glucose present commonly many challenges when the designed models are tested under different contexts. Ensemble methods are a set of learning algorithms that have been successfully used in many medical fields to improve the prediction accuracy. This paper aims to review the typology of ensembles used in literature to predict blood glucose. Methods: 32 papers published between 2000 and 2020 in 6 digital libraries were selected and reviewed with regard to: years and publication sources, integrated factors and data sources used to collect the data and types of ensembles. Results: This review results found that this research topic is still recent but is gaining a growing interest in the last years. Ensemble models used often blood glucose, insulin, diet and exercise as input to predict blood glucose. Moreover, both homogeneous and heterogeneous ensembles have been investigated. Conclusions: An increasing interest have been devoted to blood glucose prediction using ensemble methods during the last decade. Several gaps regarding the design of the reviewed ensembles and the data collection process have been identified and recommendations have been formulated in this direction. {\textcopyright} 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	keywords = {Blood, Data acquisition, Data collection process, Designed models, Digital libraries, Ensemble methods, Ensemble models, Forecasting, Glucose, Heterogeneous ensembles, Information systems, Information use, Learning algorithms, Medical fields, Prediction accuracy, Research topics},
	doi = {10.1007/978-3-030-72657-7_52},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85105963359\&doi=10.1007\%2f978-3-030-72657-7_52\&partnerID=40\&md5=4ba83ca8e7ba5bae5fdcd172b58fb8e9},
	author = {Wadghiri, M.Z. and Idri, A. and Idrissi, T.E.}
}
@conference {Walid2021,
	title = {Modeling and optimization of anaerobic digestion: A review},
	booktitle = {E3S Web of Conferences},
	volume = {229},
	year = {2021},
	note = {cited By 2},
	abstract = {Anaerobic digestion is recognized as being an advantageous waste management technique representing a source of clean and renewable energy. However, biogas production through such practice is complex and it relies on the interaction of several factors including changes in operating and monitoring parameters. Enormous researchers have focused and gave their full attention to mathematical modeling of anaerobic digestion to get good insights about process dynamics, aiming to optimize its efficiency. This paper gives an overview of the different approaches applied to tackle this challenge including mechanistic and data-driven models. This review has led us to conclude that neural networks combined with metaheuristic techniques has the potential to outperform mechanistic and classical machine learning models. {\textcopyright} The Authors, published by EDP Sciences, 2021.},
	keywords = {Anaerobic digestion, Biogas production, Data-driven model, Machine learning models, Management techniques, Meta-heuristic techniques, Modeling and optimization, Monitoring parameters, Optimization, Renewable energies},
	doi = {10.1051/e3sconf/202122901022},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100132508\&doi=10.1051\%2fe3sconf\%2f202122901022\&partnerID=40\&md5=5d2367868bbe9ebe8e867ca9622eda34},
	author = {Walid, F. and El Fkihi, S. and Benbrahim, H. and Tagemouati, H.}
}
@article {Widad20215158,
	title = {Towards a context-driven transactional service selection mechanism in ubiquitous and pervasive environments},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {99},
	number = {21},
	year = {2021},
	note = {cited By 0},
	pages = {5158-5171},
	abstract = {Most prominent techniques and selection algorithms only support QoS settings for application services. However, the software, hardware, and network infrastructures underlying services and users application have a significant impact on the validation of transactional services. Additionally, users may have varying transactional requirements throughout the lifecycle of a service composition. Therefore, selection algorithms must take into account the context requirements and users transactional needs when selecting services. This has led us to explore the trail of a service selection mechanism based on a service description enriched by functional and transactional requirements, and context information. We propose a context-driven selection of transactional services by introducing a new selection algorithm CT2S based on a semantic matching mechanism. More precisely, we are interested in studying the response time of our CT2S algorithm vis-a-vis the rapidity requirements in pervasive environments. {\textcopyright} 2021 Little Lion Scientific},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85119263108\&partnerID=40\&md5=b02c257d675200678a14907a65f6413a},
	author = {Widad, E. and Driss, R. and Mahmoud, N.}
}
@article {Zou2021,
	title = {Wind turbine power curve modeling using an asymmetric error characteristic-based loss function and a hybrid intelligent optimizer},
	journal = {Applied Energy},
	volume = {304},
	year = {2021},
	note = {cited By 4},
	abstract = {Wind energy is one of the most promising solutions to energy crisis and environmental pollution, so it is being developed rapidly. Wind turbine power curves (WTPCs) play an important role in wind energy assessment, turbine condition monitoring, and power grid dispatching. However, there are two challenges in WTPC modeling: model selection and parameter optimization. Many parametric and non-parametric models have been developed to characterize WTPCs, but none can always perform the best due to the complex wind regimes. In this paper, considering the simple structure and interpretability of model parameters, a set of parametric WTPC models is constructed to adapt to the variability of wind regimes, and the optimal candidate will be selected from the set according to their performances. As to the process of parameter optimization, a novel loss function, which considers the asymmetric error characteristic of WTPC modeling, is proposed, and a hybrid intelligent optimization method named GWO-BSA, which makes full use of the advantages of grey wolf optimizer and backtracking search algorithm, is designed. Finally, a novel WTPC modeling strategy, which combines the candidate model set, error characteristic-based loss function, and GWO-BSA, is proposed to obtain better power curves. Experimental results show that (1) GWO-BSA shows faster convergence speed and higher optimization accuracy than single optimization algorithms; (2) the proposed error characteristic-based loss function has better performance than the commonly used symmetric loss functions; and (3) compared with some popular artificial intelligence-based models, the designed WTPC modeling strategy produces better WTPCs under different wind regimes. {\textcopyright} 2021 Elsevier Ltd},
	keywords = {alternative energy, Asymmetric error characteristic, Asymmetric errors, Condition monitoring, Curve fitting, Curve modeling, Electric load dispatching, Electric power transmission networks, energy efficiency, Energy policy, energy use, Error characteristic-based loss function, Error characteristics, Errors, hybrid, Hybrid optimization algorithm, Loss functions, Optimization, Power curves, power generation, Wind power, wind turbine, Wind turbine power, Wind turbine power curve modeling, Wind turbines},
	doi = {10.1016/j.apenergy.2021.117707},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85114406958\&doi=10.1016\%2fj.apenergy.2021.117707\&partnerID=40\&md5=2247666b1228f85e03abc68add3c45d2},
	author = {Zou, R. and Yang, J. and Wang, Y. and Liu, F. and Essaaidi, M. and Srinivasan, D.}
}
@conference {Wissal2020557,
	title = {Adaptive Enterprise Architecture: Initiatives and Criteria},
	booktitle = {7th International Conference on Control, Decision and Information Technologies, CoDIT 2020},
	year = {2020},
	note = {cited By 3},
	pages = {557-562},
	abstract = {Due mainly to digital transformation, enterprises are immersed in dynamic environments. They are dealing with internal and external changes (gradual or abrupt, frequent or occasional, in the short or long term) that impact various parts of their Enterprise Architecture. To cope with the requirements of this new digital era, agility and adaptation are compulsory. Though Enterprise Architecture (EA) was designed as a catalyst for change management, traditional Enterprise Architecture approaches do not rely on well-defined concepts, lack agility and are constrained by layered architecture (business layer, functional layer, deployment layer, etc.). Thus, a new generation of EA, allowing continuous self-improvement and proactive adaptation to better match the new conditions, is required. In this paper, we explore and investigate some approaches of EA that deal with change management. Then, we, particularly, note the various definitions of the notion of adaptive EA, according to literature. Finally, we suggest some criteria, regarding the adaptation of EA, to highlight the limitations of the approaches analyzed. {\textcopyright} 2020 IEEE.},
	keywords = {Adaptive enterprise, Change management, Control engineering, Digital transformation, Dynamic environments, enterprise architecture, Functional layer, Layered architecture, Proactive adaptations},
	doi = {10.1109/CoDIT49905.2020.9263891},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85098274425\&doi=10.1109\%2fCoDIT49905.2020.9263891\&partnerID=40\&md5=a1b2cd3899750d3829a4b6b9824d2970},
	author = {Wissal, D. and Karim, D. and Laila, K.}
}
@article {Amine2020,
	title = {Two-sided matching framework for optimal user association in 5G multi-RAT UDNs},
	journal = {International Journal of Communication Systems},
	volume = {33},
	number = {8},
	year = {2020},
	note = {cited By 2},
	abstract = {Recently, academic and industrial research communities are paying more explicit attention to the 5G multiple radio access technology ultra-dense networks (5G multi-RAT UDNs) for boosting network capacity, especially in UD urban zones. To this aim, in this paper, we intend to tackle the user association problem in 5G multi-RAT UDNs. By considering the decoupled uplink/downlink access (DUDA), we divide our user association problem into two distinct subproblems representing, respectively, the uplink and the downlink channels. Next, we formulated each one as a nonlinear optimization problem with binary variables. Then, to solve them, we were restricted by the hard complexity, as well as the hard feasibility of centralized user association schemes. Thus, to resolve our user association problem in a reasonable time and distributed manner, we formulated each subproblem as a many-to-one matching game based on matching theory. Next, we provide two fully distributed association algorithms to compute the uplink and downlink stable matching among user equipments (UEs) and base stations (BSs). Simulation results corroborate our theoretical model and show the effectiveness and improvement of our achieved results in terms of the overall network performance, quality of service (QoS), and energy efficiency (EE) of UEs. {\textcopyright} 2020 John Wiley \& Sons, Ltd.},
	keywords = {5G mobile communication systems, 5G multi-RAT UDNs, Association algorithms, decoupled uplink/downlink access (DUDA), energy efficiency, Game theory, Industrial research, Matching game, Matching theory, Network performance, Nonlinear programming, Optimization, Quality of service, Rats, Stable matching},
	doi = {10.1002/dac.4346},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85078931379\&doi=10.1002\%2fdac.4346\&partnerID=40\&md5=159a3a40021d6b340c2873e4db73e2ac},
	author = {Amine, M. and Kobbane, A. and Ben-Othman, J. and Walid, A.}
}
@conference {Brihi2019,
	title = {A New Profile-QoS Aware User Association Scheme for 5G Ultra-Dense W HetNets},
	booktitle = {2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings},
	year = {2019},
	note = {cited By 0},
	doi = {10.1109/GLOCOM.2018.8647695},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85063550006\&doi=10.1109\%2fGLOCOM.2018.8647695\&partnerID=40\&md5=a6cded91d78a47e09a4f9c639843c2d9},
	author = {Brihi, S. and Walid, A. and Ben-Othman, J. and El Koutbi, M.}
}
@conference {Assila2018213,
	title = {Achieving low-energy consumption in fog computing environment: A matching game approach},
	booktitle = {19th IEEE Mediterranean Eletrotechnical Conference, MELECON 2018 - Proceedings},
	year = {2018},
	pages = {213-218},
	doi = {10.1109/MELCON.2018.8379096},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85050157229\&doi=10.1109\%2fMELCON.2018.8379096\&partnerID=40\&md5=0250d5d03e5322d270460ae3af21ca94},
	author = {Assila, B. and Kobbane, A. and Walid, A. and El Koutbi, M.}
}
@book {Brisman2018301,
	title = {Climate apartheid and environmental refugees},
	series = {The Palgrave Handbook of Criminology and the Global South},
	year = {2018},
	pages = {301-321},
	doi = {10.1007/978-3-319-65021-0_16},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85045870954\&doi=10.1007\%2f978-3-319-65021-0_16\&partnerID=40\&md5=5e244e1e3c7d4185d8a670712984dee3},
	author = {Brisman, A. and South, N. and Walters, R.}
}
@conference {Amine2018,
	title = {New user association scheme based on multi-objective optimization for 5G ultra-dense multi-RAT HetNets},
	booktitle = {IEEE International Conference on Communications},
	volume = {2018-May},
	year = {2018},
	doi = {10.1109/ICC.2018.8422154},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85051424239\&doi=10.1109\%2fICC.2018.8422154\&partnerID=40\&md5=3572d774ac502ed9eb6c557554de3420},
	author = {Amine, M. and Walid, A. and Kobbane, A. and Ben-Othman, J.}
}
@article {Kale201825,
	title = {Novel threshold formulation for energy detection method to efficient spectrum sensing in cognitive radio},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {651},
	year = {2018},
	note = {cited By 0},
	pages = {25-35},
	abstract = {Cognitive radio (CR) is an upcoming technology in wireless communications. Available spectrum used by licensed user is called as primary user (PU). Unused licensed spectrum is called spectrum hole. CR i.e., unlicensed user is called as secondary user (SU). The important task to the CR is to efficiently use the available spectrum without disturbing PU. The success of CR depends on spectrum sensing efficiency. In energy detection method, we have compared the energy of the samples with threshold (denoted as λ). If the sample energy is greater than the threshold, we say the signal is present; otherwise, the signal is absent. This method does not require any prior information of the signal, so energy detection is a popular sensing method due to its simplicity. Through this paper, we would like to propose a novel threshold formulation for energy detection method to efficient spectrum sensing in cognitive radio. Proposed formulation avoids Q inverse function; also, this formulation is independent of number of samples. With rigorous analysis of the proposed formulation for different SNRs, it gives better results compared to other systems. {\textcopyright} 2018, Springer Nature Singapore Pte Ltd.},
	doi = {10.1007/978-981-10-6614-6_3},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85031409782\&doi=10.1007\%2f978-981-10-6614-6_3\&partnerID=40\&md5=95f99171fea31131b236024675f2c5d8},
	author = {Kale, R.S. and Wadhai, V.M. and Helonde, J.B.}
}
@conference {Amine20171245,
	title = {A many-to-many matching game in ultra-dense LTE HetNets},
	booktitle = {2017 13th International Wireless Communications and Mobile Computing Conference, IWCMC 2017},
	year = {2017},
	note = {cited By 0},
	pages = {1245-1250},
	abstract = {In this work, we focus our study to improving the energy efficiency of mobile cellular users in ultra-dense LTE HetNets. The hyper-dense co-channel deployment of indoor LTE small cell networks (SCNs) within LTE macro cell networks (MCNs) will aggravate the effect of cross-tier interferences caused by the uplink transmissions of macro-indoor users located inside the overlapping zones of small base station (SBS) coverage areas. Hence, degrading the uplink performance at the level of SBSs adopting closed access policy. In order to eliminate the severe cross-tier interferences, each SBS attempts to open the access for macro-indoor users that accept only the SBS with Max-SINR offer. This will lead to network congestion problems in several SCNs. Wherefore, we formulate our problem as a many-to-many matching game. Then, we introduce an algorithm that computes the optimal many-to-many stable matching which consist of assigning each macro-indoor user with multi-homing capabilities to the most suitable set of SBSs and vice versa based on their preference profiles. With regard to the conventional Max-SINR association scheme, our solution can effectively improve the energy efficiency of cellular users. Moreover, it can ensure load balancing in ultra-dense LTE HetNets. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/IWCMC.2017.7986463},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85027886532\&doi=10.1109\%2fIWCMC.2017.7986463\&partnerID=40\&md5=a4a95449b5ea20b54454dcf7b7bd1e59},
	author = {Amine, M. and Walid, A. and Kobbane, A. and Cherkaoui, S.}
}
@article {Walid201756,
	title = {Toward Eco-Friendly Smart Mobile Devices for Smart Cities},
	journal = {IEEE Communications Magazine},
	volume = {55},
	number = {5},
	year = {2017},
	note = {cited By 0},
	pages = {56-61},
	abstract = {It is expected that the incessant use of SBSs by indoor mobile users to achieve high data rate and high energy efficiency for their smart mobile devices will drive ultra dense deployment of SCNs within MCNs, specifically in future smart cities. However, SCN densification has a hard effect on the deterioration of the energy efficiency and QoS throughput of mobile users equipped with smart mobile devices like smartphones, laptops, PDAs, and tablets. This degradation is due to the severe cross-tier interferences occurring in ultra dense co-channel deployments of SCNs within MCNs. The present article intends to study the energy efficiency of mobile users for better battery life management of their smart mobile devices through minimal energy consumption during their uplink transmissions. The proposed solution, based on a fully decentralized algorithm for sharing time access executed by SBSs and multi-homing capabilities of macrocellular users, improves the energy efficiency of mobile users for better battery life, and keeps their QoS throughput requirements. Therefore, it leads to the eco-friendly smart mobile devices required in future smart cities. The results validate our proposed solution and show the improvement achieved compared to the conventional access control mechanisms. Furthermore, our scheme requires no coordination among SBSs and macro base stations, which reduces the huge signaling overhead when using cooperative schemes. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/MCOM.2017.1600271},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85019660063\&doi=10.1109\%2fMCOM.2017.1600271\&partnerID=40\&md5=72802ad5f91b7f2273d0c16e81e53251},
	author = {Walid, A. and Kobbane, A. and Ben-Othman, J. and El Koutbi, M.}
}
@conference { ISI:000388603102099,
	title = {Exploiting Multi-homing in Hyper Dense LTE Small-Cells Deployments},
	booktitle = {2016 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE},
	series = {IEEE Wireless Communications and Networking Conference},
	year = {2016},
	note = {IEEE Wireless Communications and Networking Conference (WCNC), Doha, QATAR, APR 03-07, 2016},
	publisher = {IEEE; IEEE Commun Soc},
	organization = {IEEE; IEEE Commun Soc},
	abstract = {It is expected that in two-tier LTE heterogeneous networks, an extensive deployment of small cell networks (SCNs) will take place in the near future, especially in dense urban zones; hence a hyper density of SCNs randomly distributed within macro cell networks (MCNs) will emerge with many overlapping zones of neighboring SCNs. Therefore, the problems of interferences in co-channel deployment will be more complicated and then the overall throughput of downlink will substantially decrease. In order to mitigate the effect of interferences in a hyper density of SCNs scenarios, a solution based on a fully distributed algorithm for sharing time access to SCNs and multi-homing capabilities of macro cellular users is proposed to improve the overall data rate of downlink and at the same time to satisfy QoS throughput requirements of macro and home cellular users. Our tentative scheme will also reduce the signaling overhead due to the absence of coordination among small base stations (SBSs) and macro base station (MBS). Results validate our solution and show the improvement attained in a hyper density of SCNs within MCNs compared to open, closed and shared time access mechanisms based on single network selection.},
	isbn = {978-1-4673-9814-5},
	issn = {1525-3511},
	author = {Walid, Abdellaziz and Sabir, Essaid and Kobbane, Abdellatif and Taleb, Tarik and El Koutbi, Mohammed}
}
@conference {Walid2016,
	title = {Exploiting multi-homing in hyper dense LTE small-cells deployments},
	booktitle = {IEEE Wireless Communications and Networking Conference, WCNC},
	volume = {2016-September},
	year = {2016},
	note = {cited By 0},
	abstract = {It is expected that in two-Tier LTE heterogeneous networks, an extensive deployment of small cell networks (SCNs) will take place in the near future, especially in dense urban zones; hence a hyper density of SCNs randomly distributed within macro cell networks (MCNs) will emerge with many overlapping zones of neighboring SCNs. Therefore, the problems of interferences in co-channel deployment will be more complicated and then the overall throughput of downlink will substantially decrease. In order to mitigate the effect of interferences in a hyper density of SCNs scenarios, a solution based on a fully distributed algorithm for sharing time access to SCNs and multi-homing capabilities of macro cellular users is proposed to improve the overall data rate of downlink and at the same time to satisfy QoS throughput requirements of macro and home cellular users. Our tentative scheme will also reduce the signaling overhead due to the absence of coordination among small base stations (SBSs) and macro base station (MBS). Results validate our solution and show the improvement attained in a hyper density of SCNs within MCNs compared to open, closed and shared time access mechanisms based on single network selection. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/WCNC.2016.7565055},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84989854253\&doi=10.1109\%2fWCNC.2016.7565055\&partnerID=40\&md5=36cda03e307b208f10f73e923e3e5b77},
	author = {Walid, A.a and Sabir, E.b and Kobbane, A.a and Taleb, T.c and Koutbi, M.E.a}
}
@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 {Amine2016133,
	title = {Matching game for green uplink in hyper dense LTE HeTNets},
	booktitle = {Proceedings - 2016 International Conference on Wireless Networks and Mobile Communications, WINCOM 2016: Green Communications and Networking},
	year = {2016},
	note = {cited By 0},
	pages = {133-139},
	abstract = {In this paper, we aim to improve the energy efficiency of cellular users located in hyper-dense co-channel deployments of LTE small cell Networks (SCNs), randomly distributed within LTE macro cell networks (MCNs). Avoiding the severe cross-Tier interferences at the small base stations (SBSs) levels caused by the uplink transmissions between the macro indoor users (which are inside the SBS coverage area) and the macro base station (MBS), ensuring load balancing, and improving energy efficiency are critical technical challenges in hyper-dense co-channel LTE SCNs deployments. As a solution, we formulate our problem as a matching game, then we propose the deferred acceptance algorithm to compute the optimal stable matching consisting of assigning each macro indoor user to the most suitable SBS and vice versa. Simulation results validate our solution, and show how it can effectively improve the energy efficiency of cellular users in hyper-dense LTE HetNets compared to the default Max-SINR association scheme. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/WINCOM.2016.7777204},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010465149\&doi=10.1109\%2fWINCOM.2016.7777204\&partnerID=40\&md5=cfdd0315adeb3a468a5382cae7b1ed26},
	author = {Amine, M. and Walid, A. and Oualhaj, O.A. and Kobbane, A.}
}
@conference { ISI:000391420400024,
	title = {Matching Game for Green Uplink in Hyper Dense LTE HeTNets},
	booktitle = {2016 INTERNATIONAL CONFERENCE ON WIRELESS NETWORKS AND MOBILE COMMUNICATIONS (WINCOM)},
	year = {2016},
	note = {International Conference on Wireless Networks and Mobile Communications (WINCOM), Fez, MOROCCO, OCT 26-29, 2016},
	pages = {P133-P139},
	publisher = {Univ Sidi Mohamed Ben Abdellah; FST FES; MobiTic; IEEE; IEEE Commun Soc; FSDM; ENSIAS; FST Mohammedia; CLusMed; TICSM Res Pole; Master Tec; CNRST; EBSA Fez; Mobit Assoc},
	organization = {Univ Sidi Mohamed Ben Abdellah; FST FES; MobiTic; IEEE; IEEE Commun Soc; FSDM; ENSIAS; FST Mohammedia; CLusMed; TICSM Res Pole; Master Tec; CNRST; EBSA Fez; Mobit Assoc},
	abstract = {In this paper, we aim to improve the energy efficiency of cellular users located in hyper-dense co-channel deployments of LTE small cell Networks (SCNs), randomly distributed within LTE macro cell networks (MCNs). Avoiding the severe cross-tier interferences at the small base stations (SBSs) levels caused by the uplink transmissions between the macro indoor users (which are inside the SBS coverage area) and the macro base station (MBS), ensuring load balancing, and improving energy efficiency are critical technical challenges in hyper-dense co-channel LTE SCNs deployments. As a solution, we formulate our problem as a matching game, then we propose the deferred acceptance algorithm to compute the optimal stable matching consisting of assigning each macro indoor user to the most suitable SBS and vice versa. Simulation results validate our solution, and show how it can effectively improve the energy efficiency of cellular users in hyper-dense LTE HetNets compared to the default Max-SINR association scheme.},
	isbn = {978-1-5090-3837-4},
	author = {Amine, Mariame and Walid, Abdellaziz and Ait Oualhaj, Omar and Kobbane, Abdellatif},
	editor = {ElKamili, M and Berrada, I and Badri, A and Ghennioui, H}
}
@conference {Walid20151168,
	title = {On improving network capacity for downlink and uplink of two-tier LTE-FDD networks},
	booktitle = {IWCMC 2015 - 11th International Wireless Communications and Mobile Computing Conference},
	year = {2015},
	note = {cited By 0},
	pages = {1168-1173},
	abstract = {A Long Term Evolution-Frequency Division Duplexing (LTE-FDD) small cell is one of the promising solutions for improving service quality and data rate in both the uplink and downlink of home users. Small cell (e.g., femtocell, picocell, microcell) is short range, low cost and low power base station installed by the indoor consumers. However, the avoidance of interferences is still an issue that needs to be addressed for successful deployment of small base stations (SBS) within existing macro cell networks mainly in co-channel deployment. Moreover, interferences are strongly dependent on the type of access control of small cells. Closed and open access are in conflict interests for macro users and home users in the uplink and downlink. To mitigate this conflict, we propose a fully distributed algorithm based on the shared time access and executed by LTE-FDD small cells, in order to reduce the effect of interferences, improve QoS of users, and maximize the overall capacity of downlink and uplink in two-tier LTE networks when small cells are deployed randomly. Simulation results validate our algorithm and show the improvement attained in offloading macro cell and satisfying QoS requirements of home users compared to the closed and open access mechanisms in both the uplink and downlink. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/IWCMC.2015.7289248},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84949503704\&doi=10.1109\%2fIWCMC.2015.7289248\&partnerID=40\&md5=3c58a33b86b3de8e31215575eda6ba0a},
	author = {Walid, A.a and Sabir, E.b and Kobbane, A.a and Taleb, T.c and El Koutbi, M.a}
}
@conference { ISI:000381477900200,
	title = {On Improving Network Capacity for Downlink and Uplink of Two-Tier LTE-FDD Networks},
	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 = {1168-1173},
	publisher = {IEEE; IEEE Croatia Sect; Univ Dubrovnik},
	organization = {IEEE; IEEE Croatia Sect; Univ Dubrovnik},
	abstract = {A Long Term Evolution-Frequency Division Duplexing (LTE-FDD) small cell is one of the promising solutions for improving service quality and data rate in both the uplink and downlink of home users. Small cell (e.g., femtocell, picocell, microcell) is short range, low cost and low power base station installed by the indoor consumers. However, the avoidance of interferences is still an issue that needs to be addressed for successful deployment of small base stations (SBS) within existing macro cell networks mainly in co-channel deployment. Moreover, interferences are strongly dependent on the type of access control of small cells. Closed and open access are in conflict interests for macro users and home users in the uplink and downlink. To mitigate this conflict, we propose a fully distributed algorithm based on the shared time access and executed by LTE-FDD small cells, in order to reduce the effect of interferences, improve QoS of users, and maximize the overall capacity of downlink and uplink in two-tier LTE networks when small cells are deployed randomly. Simulation results validate our algorithm and show the improvement attained in offloading macro cell and satisfying QoS requirements of home users compared to the closed and open access mechanisms in both the uplink and downlink.},
	isbn = {978-1-4799-5344-8},
	issn = {2376-6492},
	author = {Walid, Abdellaziz and Sabir, Essaid and Kobbane, Abdellatif and Taleb, Tarik and El Koutbi, Mohammed}
}
@conference { ISI:000361140000114,
	title = {A Congestion Game-based Routing Algorithm for Communicating VANETs},
	booktitle = {2014 INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING CONFERENCE (IWCMC)},
	series = {International Wireless Communications and Mobile Computing Conference},
	year = {2014},
	note = {10th International Wireless Communications \& Mobile Computing Conference (IWCMC), Nicosia, CYPRUS, AUG 04-08, 2014},
	pages = {672-677},
	publisher = {IEEE; IEEE Cyprus Sect; Frederick Univ},
	organization = {IEEE; IEEE Cyprus Sect; Frederick Univ},
	abstract = {Vehicular Ad Hoc Network (VANET) is considered as a special application of Mobile Ad Hoc Networks (MANETs) 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 has been performed to extend Internet connectivity to VANETs. Indeed, several routing protocols have been proposed to determine routes between vehicles and gateways. In this paper, we propose a routing algorithm which is based on the Congestion Game to resolve the problem of network congestion in VANET and to provide the optimal Internet access paths. The simulation results show that the proposed routing algorithm has better feasibility and effectiveness for communicating VANETs.},
	isbn = {978-1-4799-0959-9},
	issn = {2376-6492},
	author = {Mabrouk, Abdelfettah and Senhadji, Mohamed and Kobbane, Abdellatif and Walid, Abdellaziz and Sabir, Essaid and Koutbi, Mohammed E. L.}
}
@conference {Mabrouk2014672,
	title = {A congestion game-based routing algorithm for communicating VANETs},
	booktitle = {IWCMC 2014 - 10th International Wireless Communications and Mobile Computing Conference},
	year = {2014},
	note = {cited By 2},
	pages = {672-677},
	abstract = {Vehicular Ad Hoc Network (VANET) is considered as a special application of Mobile Ad Hoc Networks (MANETs) 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 has been performed to extend Internet connectivity to VANETs. Indeed, several routing protocols have been proposed to determine routes between vehicles and gateways. In this paper, we propose a routing algorithm which is based on the Congestion Game to resolve the problem of network congestion in VANET and to provide the optimal Internet access paths. The simulation results show that the proposed routing algorithm has better feasibility and effectiveness for communicating VANETs. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/IWCMC.2014.6906436},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84908611637\&doi=10.1109\%2fIWCMC.2014.6906436\&partnerID=40\&md5=c4ef74c689e207df64ad7a4808f8c773},
	author = {Mabrouk, A.a and Senhadji, M.a and Kobbane, A.a and Walid, A.a and Sabir, E.b and El Koutbi, M.a}
}
@conference {Walid20142817,
	title = {A decentralized network selection algorithm for group vertical handover in heterogeneous networks},
	booktitle = {IEEE Wireless Communications and Networking Conference, WCNC},
	year = {2014},
	note = {cited By 5},
	pages = {2817-2821},
	abstract = {The traditional vertical handover schemes postulate that vertical handover of each user comes on an individual basis. This enables the users to know previously the decision already made by other users, and then the choice will be made accordingly. However, in the case of a group vertical handover, almost all the VHO decisions - which will certainly choose the best network, will be made at the same time which will lead to system performance degradation or network congestion. In this paper, we propose a totally decentralized algorithm for network selection which based on the Congestion Game to resolve the problem of network congestion in GVHO. Therefore, the proposed algorithm named Fully Decentralized Nash Learning Algorithm with incomplete information is a prediction done by each mobile in the group that helps them to reach the Nash equilibrium. Simulation results validate the algorithm and show its robustness under two scenarios. In the first one, we examine the algorithm with a fixed number of mobiles in group to evaluate the mixed strategy and the average perceived throughput of mobiles in WIMAX and HSDPA on the basis of iteration. In the second one, we examine the algorithm with different number of mobiles in group for testing the average number of iterations needed to reach the Nash equilibrium. We also compare it with the traditional vertical handover algorithm. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/WCNC.2014.6952895},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84912123155\&doi=10.1109\%2fWCNC.2014.6952895\&partnerID=40\&md5=35a46d7aee23563018fc6f10fc8506ab},
	author = {Walid, A.a and El Kamili, M.b and Kobbane, A.a and Mabrouk, A.a and Sabir, E.c and El Koutbi, M.a}
}
@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}
}
@article {11154994420140101,
	title = {MALICIOUS WORKERS TOLERANCE IN AN AGENT-BASED GRID RESOURCE BROKERING SYSTEM.},
	journal = {IADIS International Journal on Computer Science \& Information Systems},
	volume = {9},
	number = {1},
	year = {2014},
	pages = {55 - 70},
	abstract = {The Agent in Grid (AiG) project aims to develop an agent-based infrastructure that facilitates the resource management in the Grid. The core assumptions behind the system are: software agents representing Grid resources work in teams, and all information is ontologically represented and semantically processed. Thus far, trust management in AiG system is approached from the perspective of breaching an agreement between Users and teams or contracts between teams and Workers. Unfortunately, it is also possible that some Workers, which fulfilled the agreement, could have maliciously returned incorrect results from the jobs that they executed. In this paper, we discuss how the trust management in the AiG project can be improved by using a reputation-based voting technique, in order to assure reliable job execution. [ABSTRACT FROM AUTHOR]},
	keywords = {agent system, Computational grids (Computer systems), Distributed computing, Grid computing, Inte lligent agents (Computer software), Job performance, majority voting, malicious workers tolerance, reputation, Teams in the workplace, trust management},
	issn = {16463692},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=111549944\&site=ehost-live},
	author = {Attaoui, Naoual and Bendahmane, Ahmed and Essaaidi, Mohammad and Sanyal, Sugata and Ganzha, Maria and Paprzycki, Marcin and Wasielewska, Katarzyna}
}
@conference {Bennani201456,
	title = {A tax-inspired mechanism design to achieve QoS in VMIMO systems: Give to receive!},
	booktitle = {IWCMC 2014 - 10th International Wireless Communications and Mobile Computing Conference},
	year = {2014},
	note = {cited By 0},
	pages = {56-62},
	abstract = {In this paper, we model a Virtual MIMO system using a game-theoretic approach. We are interested in the uplink, considering a non-coopertive game, where each user try to satisfy a quality of service. The uplink of a direct-sequence code division multiple access (DS-CDMA) data network is considered and a non-cooperative game is proposed in which users are allowed to choose their uplink receivers as well as to satisfy their quality of service. The utility function used in this framework is defined so that the throughput used by the user is divided into two components: the throughput received from cellular Network, and throughput received from Virtual MIMO System. In addition, this framework is used to study a constrained Nash equilibrium for the proposed game, and the impact of the interaction among users. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/IWCMC.2014.6906332},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84908622993\&doi=10.1109\%2fIWCMC.2014.6906332\&partnerID=40\&md5=8f8afb3e0c78e9a74a2e145125d111ac},
	author = {Bennani, H.a and Sabir, E.b and Kobbane, A.a and Walid, A.a and Ben-Othman, J.c}
}
@conference { ISI:000361140000010,
	title = {A Tax-inspired Mechanism Design to Achieve QoS in VMIMO Systems : Give to Receive !},
	booktitle = {2014 INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING CONFERENCE (IWCMC)},
	series = {International Wireless Communications and Mobile Computing Conference},
	year = {2014},
	note = {10th International Wireless Communications \& Mobile Computing Conference (IWCMC), Nicosia, CYPRUS, AUG 04-08, 2014},
	pages = {56-62},
	publisher = {IEEE; IEEE Cyprus Sect; Frederick Univ},
	organization = {IEEE; IEEE Cyprus Sect; Frederick Univ},
	abstract = {In this paper, we model a Virtual MIMO system using a game-theoretic approach. We are interested in the uplink, considering a non-coopertive game, where each user try to satisfy a quality of service. The uplink of a direct-sequence code division multiple access (DS-CDMA) data network is considered and a non-cooperative game is proposed in which users are allowed to choose their uplink receivers as well as to satisfy their quality of service. The utility function used in this framework is defined so that the throughput used by the user is divided into two components : the throughput received from cellular Network, and throughput received from Virtual MIMO System. In addition, this framework is used to study a constrained Nash equilibrium for the proposed game, and the impact of the interaction among users.},
	isbn = {978-1-4799-0959-9},
	issn = {2376-6492},
	author = {Bennani, Hassan and Sabir, Essaid and Kobbane, Abdellatif and Walid, Abdellaziz and Ben-Othman, Jalel}
}
@conference { ISI:000345780300021,
	title = {Automatic Generation of Ontology from Data Models: A Practical Evaluation of Existing Approaches},
	booktitle = {2013 IEEE SEVENTH INTERNATIONAL CONFERENCE ON RESEARCH CHALLENGES IN INFORMATION SCIENCE (RCIS)},
	series = {International Conference on Research Challenges in Information Science},
	year = {2013},
	note = {7th IEEE International Conference on Research Challenges in Information Science (RCIS), Paris, FRANCE, MAY 29-31, 2013},
	publisher = {IEEE; Univ Paris 1; Ctr Rech \& Informatique; IEEE French Sect; Cyrius Consulting; IEEE French CS Joint Chapter},
	organization = {IEEE; Univ Paris 1; Ctr Rech \& Informatique; IEEE French Sect; Cyrius Consulting; IEEE French CS Joint Chapter},
	abstract = {Nowadays, ontology as a knowledge sharing approach plays an important role in semantic interoperability of enterprise applications (EAs). However, the manual process of ontology construction requires deep understanding of the domain. This approach is difficult, expensive and time-consuming. To overcome the knowledge acquisition bottleneck, ontology learning field aims to provide automatic and semi-automatic approaches for ontology generation. Several approaches have been emerged for this purpose. In this paper, we present a practical study of methods that take data models as input to the learning process. The main contributions of this work are: (i) the evaluation of the availability of existing approaches for (semi-)automatic generation of ontology from data models; (ii) the evaluation of tools according to their operability; and (iii) the evaluation of the resulting ontologies to assess their quality in supporting semantic interoperability. Our goal through this study is to find a response to the question: Is there a tool that extracts (semi-) automatically an application ontology from data models, intended for use in semantic interoperability?.},
	isbn = {978-1-4673-2912-5},
	issn = {2151-1349},
	author = {El Idrissi, Bouchra and Baina, Salah and Baina, Karim},
	editor = {Wieringa, R and Nurcan, S and Rolland, C and Cavarero, JL}
}
@article {Attaoui201383,
	title = {Multiple equivalent simultaneous offers strategy in an agent-based grid resource brokering system-initial considerations},
	journal = {Scalable Computing},
	volume = {14},
	number = {2},
	year = {2013},
	note = {cited By 0},
	pages = {83-94},
	abstract = {The Agent in Grid (AiG) project attempts to integrate the concept of the Grid and anagent-based system to facilitate efficient resource management in the Grid. In this paper, we present preliminary considerations concerning multiple equivalent simultaneous offers strategy that can be used in the Service Level Agreement (SLA) negotiations. These negotiations are the key part of the main use case scenarios within the AiG project. In this context, first, we describe the AiG system. Second, we introduce the simultaneous offer strategy, as a mechanism known from economy, and suggest an approach for using it in the AiG negotiations. {\textcopyright} 2013 SCPE.},
	doi = {10.12694/scpe.v14i2.842},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84884175155\&doi=10.12694\%2fscpe.v14i2.842\&partnerID=40\&md5=de46ef42a2dff1ff1937b31977015b55},
	author = {Attaoui, N.a and Ganzha, M.b and Paprzycki, M.b and Wasielewska, K.b and Essaaidi, M.c}
}
@article {9342527920130601,
	title = {MULTIPLE EQUIVALENT SIMULTANEOUS OFFERS STRATEGY IN AN AGENT-BASED GRID RESOURCE BROKERING SYSTEM - INITIAL CONSIDERATIONS.},
	journal = {Scalable Computing: Practice \& Experience},
	volume = {14},
	number = {2},
	year = {2013},
	pages = {83 - 94},
	abstract = {The Agent in Grid (AiG) project attempts to integrate the concept of the Grid and an agent-based system to facilitate efficient resource management in the Grid. In this paper, we present preliminary considerations concerning multiple equivalent simultaneous offers strategy that can be used in the Service Level Agreement (SLA) negotiations. These negotiations are the key part of the main use case scenarios within the AiG project. In this context, first, we describe the AiG system. Second, we introduce the simultaneous offer strategy, as a mechanism known from economy, and suggest an approach for using it in the AiG negotiations. [ABSTRACT FROM AUTHOR]},
	keywords = {agent-based negotiations, AiG, Computational grids (Computer systems), Economics {\textendash} Study \& teaching, Gateways (Computer networks), Grid computing, multi-attribute negotiations, multiple equivalent simultaneous offers, Service level agreements, SLA, Social psychology {\textendash} Study \& teaching},
	issn = {18951767},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=93425279\&site=ehost-live},
	author = {Attaoui, Naoual and Ganzha, Maria and Paprzycki, Marcin and Wasielewska, Katarzyna and Essaaidi, Mohammad}
}
@conference { ISI:000307083000008,
	title = {Towards an Open Framework for Mobile Digital Identity Management through Strong Authentication Methods},
	booktitle = {SECURE AND TRUST COMPUTING, DATA MANAGEMENT, AND APPLICATIONS},
	series = {Communications in Computer and Information Science},
	volume = {187},
	year = {2011},
	note = {International Workshop on Convergence Security in Pervasive Environments, (IWCS 2011)/International Workshop on Security on Security and Trust for Applications in Virtualized Environments, (STAVE 2011), Loutraki, GREECE, JUN 28-30, 2011},
	pages = {56-63},
	abstract = {Mobile computing becoming a widespread working tool, and a large scale deployed technology, it should be strong enough to meet basic security expectations. Privacy in a mobile environment should be driven by the choice of appropriate identity management mechanisms, that will have a large impact on different aspects of daily life. But people being unable to spend all their time administering their digital identities, the implementation of mobile identity management technologies has become a top priority for involved companies, in order to protect their customers against fraudsters. Today. identity management and strong authentication are converging, since provided solutions encompass user access, signing and verification of users and transactions, through strong authentication: Although, simply using strong authentication will not resolve all mobile digital identity requirements from a security viewpoint; our objective is to propose an extensible protocol based on an independent architectural model that provides a foundation for user-centric identity management.},
	isbn = {978-3-642-22364-8},
	issn = {1865-0929},
	author = {En-Nasry, Brahim and El Kettani, Mohamed Dafir Ech-Cherif},
	editor = {Lee, C and Seigneur, JM and Park, JJ and Wagner, RR}
}
@conference {Elbhiri2011,
	title = {UWB based maximizing network liftime with route selection strategies for wireless sensor networks},
	booktitle = {International Conference on Multimedia Computing and Systems -Proceedings},
	year = {2011},
	note = {cited By 0},
	doi = {10.1109/ICMCS.2011.5945636},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79961216854\&doi=10.1109\%2fICMCS.2011.5945636\&partnerID=40\&md5=3640a80cc17beb1f99c1d6741aece8e9},
	author = {Elbhiri, B. and Saadane, R. and Fkihi, S.E. and Aboutajdine, D. and Wahbi, M.}
}
@conference { ISI:000231849800003,
	title = {Towards mining structural workflow patterns},
	booktitle = {DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS},
	series = {LECTURE NOTES IN COMPUTER SCIENCE},
	volume = {3588},
	year = {2005},
	note = {16th International Workshop on Database and Expert Systems Applications, Copenhagen Business Sch, Copenhagen, DENMARK, AUG 22-26, 2005},
	pages = {24-33},
	publisher = {Danish Minist Sci, Technol \& Innov; DEXA Assoc; Austrian Comp Soc; Res Inst Appl Knowledge Proc; FAW Software Engn GmbH},
	organization = {Danish Minist Sci, Technol \& Innov; DEXA Assoc; Austrian Comp Soc; Res Inst Appl Knowledge Proc; FAW Software Engn GmbH},
	abstract = {Collaborative information systems are becoming more and more complex, involving numerous interacting business objects within considerable processes. Analysing the interaction structure of those complex systems will enable them to be well understood and controlled. The work described in this paper is a contribution to these problems for workflow based process applications. In fact, we discover workflow patterns from traces of workflow events based on a workflow mining technique. Workflow mining proposes techniques to acquire a workflow model from a workflow log. Mining of workflow patterns is done by a statistical analysis of log-based event. Our approach is characterised by a {\textquoteleft}{\textquoteleft}local{{\textquoteright}{\textquoteright}} workflow patterns discovery that allows to cover partial results and a dynamic technique dealing with concurrency.},
	isbn = {3-540-28566-0},
	issn = {0302-9743},
	author = {Gaaloul, W and Baina, K and Godart, C},
	editor = {Andersen, KV and Debenham, J and Wagner, R}
}
