@conference {Najmani2022,
	title = {Offline and Online Evaluation for Recommender Systems},
	booktitle = {2022 International Conference on Intelligent Systems and Computer Vision, ISCV 2022},
	year = {2022},
	note = {cited By 0},
	abstract = {Recommender systems aim to facilitate decision making for users by offering them information according to their preferences, they are now popular in several application domains. The evaluation of recommender systems is very important to have an effective application in practice. In addition, it focuses to find better algorithms and evaluate their performance. However, researchers did not give much attention to it in this field. There are various ways to evaluate a recommender system. In this paper, we will discuss the main types of evaluations in this domain, which are offline and online evaluation, we will start with an overview of recommender systems, then we will present each type of evaluation, and we will compare the offline and the online evaluation for recommender systems. We will base on ten factors which are, the reproducibility, the reliability of the results of each type of evaluation, the preparation cost, the evaluation, the stability, the possibility of extensibility that{\textquoteright}s mean if we can add new metrics or not, the scalability, the passed time, deep analysis, and the sparsity metric. Finally, we will discuss the factors which are presented in the comparison. {\textcopyright} 2022 IEEE.},
	keywords = {Applications domains, Decision making, Decisions makings, It focus, Offline, Offline evaluation, On-line evaluation, Online systems, Performance, Recommender Systems, Reliability analysis, Reproducibilities},
	doi = {10.1109/ISCV54655.2022.9806059},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85134293509\&doi=10.1109\%2fISCV54655.2022.9806059\&partnerID=40\&md5=31b11e740c58602df2b12bf3260a1ec9},
	author = {Najmani, K. and Ajallouda, L. and Benlahmar, E.H. and Sael, N. and Zellou, A.}
}
@article {Toub20221,
	title = {Operating room scheduling 2019 survey},
	journal = {International Journal of Medical Engineering and Informatics},
	volume = {14},
	number = {1},
	year = {2022},
	note = {cited By 2},
	pages = {1-30},
	abstract = {Numerous optimisation problems in healthcare have been approached by researchers over the last three to four decades. Hospital logistics - organised and structured to secure patient satisfaction in terms of quality, quantity, time, security and least cost - forms part of the quest for global performance. We provide herein a review of recent study and applications of operations research in healthcare. In particular, we survey work on optimisation problems, focusing on the planning and scheduling of operating rooms. The latter is a highly strategic place within the hospital as it requires key medical competence and according to Macario (2008) surgical sector expenditure represents nearly a third of a hospital{\textquoteright}s budget. We analyse recent research on operating room planning and scheduling from 2008 to 2019; our evaluation is based on patient characteristics, performance measurement, the solution techniques used in the research and the applicability of the research to real life cases. The searches were based on PubMed, Web of Science, Science Direct and Google Scholar databases. Copyright {\textcopyright} 2022 Inderscience Enterprises Ltd.},
	keywords = {adult, agricultural worker, Article, budget, clinical evaluation, computer assisted tomography, Computer simulation, cost effectiveness analysis, eutrophication, febrile neutropenia, female, genetic algorithm, health care cost, health care facility, health care system, hip replacement, hospital cost, hospitalization, human, intensive care unit, length of stay, Machine learning, male, mathematical model, operating room personnel, operation duration, Patient satisfaction, population size, stochastic model, system analysis, Time series analysis, total quality management, vaccination, work environment, workload},
	doi = {10.1504/IJMEI.2022.119307},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85120773204\&doi=10.1504\%2fIJMEI.2022.119307\&partnerID=40\&md5=a2ac2109f88463231d4e37b0a988843f},
	author = {Toub, M. and Souissi, O. and Achchab, S.}
}
@conference {Toub2022,
	title = {Operating rooms scheduling using Variable Neighborhood Search meta-heuristic},
	booktitle = {2022 2nd International Conference on Innovative Research in Applied Science, Engineering and Technology, IRASET 2022},
	year = {2022},
	note = {cited By 1},
	abstract = {Healthcare systems around the world are faced with rising costs, increasingly complex illnesses and declining reimbursements. In this context, problems related to health optimization are complex, because they concern the fabrication of schedules that absorb the disturbances occurring in the future. The operating room is a complex environment, at risk for the safety of the patient, and which involves many stakeholders. Its organization must be based on a reflection around the management of flows to contribute to the improvement of the patient{\textquoteright}s journey. In this paper, we propose a smart operating rooms scheduling using Variable Neighborhood Search (VNS) meta-heuristic. According to the literature review, VNS meta-heuristic approach still underused to resolve the cited issue. In this work, we have developed two VNS basic schemes of (Variable Neighborhood Descent (VND) and General VNS (GVNS)) in order to show their efficiency to meet operating rooms planning and scheduling problem challenges. {\textcopyright} 2022 IEEE.},
	keywords = {Complex environments, Healthcare systems, Heuristic algorithms, Heuristic methods, Literature reviews, Metaheuristic, Operating rooms, Operating rooms scheduling, Operating theatre, Operational research, Optimisations, Optimization, Scheduling, Surgerie, Variable neighborhood search},
	doi = {10.1109/IRASET52964.2022.9738371},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85127982211\&doi=10.1109\%2fIRASET52964.2022.9738371\&partnerID=40\&md5=a5119109d2fa9362b7b5f3b9ba37aa99},
	author = {Toub, M. and Achchab, S. and Souissi, O.}
}
@article {Ettahiri2022162,
	title = {Optimizing the Deployment of the Overall Maturity Improvement Plan for Information Systems Risk Management},
	journal = {Journal of Computer Science},
	volume = {18},
	number = {3},
	year = {2022},
	note = {cited By 0},
	pages = {162-171},
	abstract = {Maturity models contribute considerably to the continuous improvement of the various business processes. However, the most important challenge for these tools after assessing maturity is how to define effective and efficient improvement plans especially in the case of an organization having multiple Information Systems (IS). This study presents an algorithm for optimizing the deployment of the overall maturity improvement plan for risk management of information systems. The purpose is to help decision makers identify which actions should be accomplished for each information system, with optimizing efforts needed to reach the global maturity level fixed by the top-down improvement strategy. The application of the proposed algorithm made it possible to define the improvement actions to be undertaken by a company in an optimized way for each of its IS to reach an overall target maturity. The calculation of the number of steps to be taken through the maturity matrix shows the effort gained. That gain can be the human and financial cost for the completion of the various necessary tasks to implement the objectives of control {\textcopyright} 2022. Fatima Ezzahra Ettahiri, Mina Elmaallam, Hicham Bensaid and Mahmoud Nassar. This open access article is distributed under a Creative Commons Attribution (CC-BY) 4.0 license},
	doi = {10.3844/jcssp.2022.162.171},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85129271071\&doi=10.3844\%2fjcssp.2022.162.171\&partnerID=40\&md5=7d984062597e0ca1c9f925b007021847},
	author = {Ettahiri, F.E. and El maallam, M. and Bensaid, H. and Nassar, M.}
}
@article {Mouchfiq2022128,
	title = {An Overview of~Security in~Vehicular Ad Hoc Networks},
	journal = {Lecture Notes in Networks and Systems},
	volume = {489 LNNS},
	year = {2022},
	note = {cited By 0},
	pages = {128-140},
	abstract = {In recent decades, the importance of security has increased more and more especially in the field of research dealing with the Internet of Things (IoT) and implicitly ad hoc networks since they are part of it, considering they undergo several changes and that following these changes this area is exposed to several risks. Many researchers have shed light on different techniques to ensure the security of this intelligent universe. In this study, we identify the risks to which Vehicular ad hoc networks (VANETs) are exposed according to several criteria and metrics. For this purpose, we do bench-marking by carrying out research on the types of attacks that harm VANETs, after that we study the solutions proposed to ensure a high level of security in this type of network and finally we discuss these solutions to find out one that is most adapted to our teamwork and which is based on a relevant and recent technology. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-031-07969-6_10},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135087175\&doi=10.1007\%2f978-3-031-07969-6_10\&partnerID=40\&md5=8cad0a611223b0af69336b1e9d2121d2},
	author = {Mouchfiq, N. and Habbani, A. and Benjbara, C. and Berradi, H.}
}
@article {AitTemghart2021307,
	title = {Optimal Virtual Machine Provisioning in Cloud Computing Using Game Theory},
	journal = {Lecture Notes in Business Information Processing},
	volume = {416 LNBIP},
	year = {2021},
	note = {cited By 1},
	pages = {307-321},
	abstract = {Virtualization of resources on the cloud computing allow fast and easy scaling of infrastructure to achieve a specified QoS. This will undoubtedly improve the allocation efficiency of physical machines in large-scale data centers. In fact, virtualization technologies not only have a direct effect on the performance and energy consumption but also can reduce the operating costs considerably. As there is fierce competition among cloud providers, there is an urgent need to adopt an elastic resource management system and an optimal pricing strategy as well. Such a strategy is designed principally to satisfy the requirements of a given service and simultaneously increase its associated profit margins. This study highlights why game theory is a very useful tool to analyze the impact of both energy efficiency and response time on virtual machine (VM) provisioning. To this aim, we present a formal policy that ensures fairness in the resource sharing and also takes into account the reasonable expectations market participants. More precisely, we rely on a non-cooperative game model in choosing the right provisioning scheme, and then discuss its equilibrium and stability. In a duopoly market, we conduct some numerical experiments to illustrate the efficiency and performance of the proposed approach and its proof of convergence with a certain number of iterations. {\textcopyright} 2021, Springer Nature Switzerland AG.},
	keywords = {Allocation efficiencies, Cloud computing, Commerce, Computation theory, Computer games, Efficiency and performance, energy efficiency, Energy utilization, Game theory, Information analysis, Market participants, Network security, Number of iterations, Numerical experiments, Operating costs, Provisioning schemes, Resource management systems, Virtual machine, Virtualization, Virtualization technologies},
	doi = {10.1007/978-3-030-76508-8_22},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85111167293\&doi=10.1007\%2f978-3-030-76508-8_22\&partnerID=40\&md5=548cfc7c5207af40074c10c8be8d63a7},
	author = {Ait Temghart, A. and Ait Omar, D. and Marwan, M.}
}
@article {Benamri2021,
	title = {An overview of genes and mutations associated with Chlamydiae species{\textquoteright} resistance to antibiotics},
	journal = {Annals of Clinical Microbiology and Antimicrobials},
	volume = {20},
	number = {1},
	year = {2021},
	note = {cited By 4},
	abstract = {Background: Chlamydiae are intracellular bacteria that cause various severe diseases in humans and animals. The common treatment for chlamydia infections are antibiotics. However, when antibiotics are misused (overuse or self-medication), this may lead to resistance of a number of chlamydia species, causing a real public health problem worldwide. Materials and methods: In the present work, a comprehensive literature search was conducted in the following databases: PubMed, Google Scholar, Cochrane Library, Science direct and Web of Science. The primary purpose is to analyse a set of data describing the genes and mutations involved in Chlamydiae resistance to antibiotic mechanisms. In addition, we proceeded to a filtration process among 704 retrieved articles, then finished by focusing on 24 studies to extract data that met our requirements. Results: The present study revealed that Chlamydia trachomatis may develop resistance to macrolides via mutations in the 23S rRNA, rplD, rplV genes, to rifamycins via mutations in the rpoB gene, to fluoroquinolones via mutations in the gyrA, parC and ygeD genes, to tetracyclines via mutations in the rpoB gene, to fosfomycin via mutations in the murA gene, to MDQA via mutations in the secY gene. Whereas, Chlamydia pneumoniae may develop resistance to rifamycins via mutations in the rpoB gene, to fluoroquinolones via mutations in the gyrA gene. Furthermore, the extracted data revealed that Chlamydia psittaci may develop resistance to aminoglycosides via mutations in the 16S rRNA and rpoB genes, to macrolides via mutations in the 23S rRNA gene. Moreover, Chlamydia suis can become resistance to tetracyclines via mutations in the tet(C) gene. In addition, Chlamydia caviae may develop resistance to macrolides via variations in the 23S rRNA gene. The associated mechanisms of resistance are generally: the inhibition of bacteria{\textquoteright}s protein synthesis, the inhibition of bacterial enzymes{\textquoteright} action and the inhibition of bacterial transcription process. Conclusion: This literature review revealed the existence of diverse mutations associated with resistance to antibiotics using molecular tools and targeting chlamydia species{\textquoteright} genes. Furthermore, these mutations were shown to be associated with different mechanisms that led to resistance. In that regards, more mutations and information can be shown by a deep investigation using the whole genome sequencing. Certainly, this can help improving to handle chlamydia infections and healthcare improvement by decreasing diseases complications and medical costs. {\textcopyright} 2021, The Author(s).},
	keywords = {16S, 23S, aminoglycoside antibiotic agent, Anti-Bacterial Agents, antibiotic agent, antibiotic resistance, antiinfective agent, bacterial gene, bacterial genetics, bacterial protein, Chlamydia, Chlamydia caviae, Chlamydia Infections, Chlamydia pneumoniae, Chlamydia psittaci, Chlamydia suis, Chlamydia trachomatis, chlamydiasis, drug effect, enzyme inhibition, Fluoroquinolones, gene mutation, genetics, gyrA gene, health care cost, health care system, human, Humans, isolation and purification, macrolide, Macrolides, murA gene, mutation, nonhuman, parC gene, protein synthesis, quinoline derived antiinfective agent, quinolone derivative, Review, Ribosomal, rifamycin, Rifamycins, RNA, RNA 16S, RNA 23S, rplD gene, rplV gene, rpoB gene, secY gene, tetracycline, tetracycline derivative, Tetracyclines, whole genome sequencing, ygeD gene},
	doi = {10.1186/s12941-021-00465-4},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85114291851\&doi=10.1186\%2fs12941-021-00465-4\&partnerID=40\&md5=47741d00acddab5c642ac657b207e205},
	author = {Benamri, I. and Azzouzi, M. and Sanak, K. and Moussa, A. and Radouani, F.}
}
@article {BOULMRHARJ2020101518,
	title = {Online battery state-of-charge estimation methods in micro-grid systems},
	journal = {Journal of Energy Storage},
	volume = {30},
	year = {2020},
	pages = {101518},
	abstract = {Batteries have shown great potential for being integrated in Micro-Grid (MG) systems. However, their integration is not a trivial task and, therefore, requires extensive modeling and simulations in order to efficiently estimating their State-of-Charge (SoC) within MG systems. The work presented in this article focuses mainly on battery modeling for SoC estimation. We put more emphasize on battery system{\textquoteright}s characterization, modeling, SoC estimation and its integration into MG systems in order to study its performance. In fact, an instrumentation platform, composed of recent and low cost sensing and actuating equipment, is developed in order to identify the battery{\textquoteright}s parameters and then build the battery model. The simulation results show good agreement with the experimental results, and thus the battery model is validated in both charging and discharging processes. Then, the battery{\textquoteright}s SoC estimation in both charging and discharging processes is investigated by means of sophisticated methods, such as, Artificial Neural Network, Luenberger observer and Kalman Filter combined with Coulomb counting. The results of these methods are reported and compared to the SoC estimated using the Coulomb counting method in order to end up with the precise method. The modeled battery is afterwards integrated into an MG system, which is deployed into our EEBLab (Energy Efficient Building Laboratory) test-site, for simulation and experimental investigations. Finally, the four algorithms for SoC estimation are included into the instrumentation platform, which is connected to a Lead-acid battery already integrated into the MG system, in order to show and compare their performances and accuracy for online battery{\textquoteright}s SoC estimation.},
	keywords = {Battery characterization, Battery modeling, MG systems, Online SOC estimation, Parameters identification, Performance assessment},
	issn = {2352-152X},
	doi = {https://doi.org/10.1016/j.est.2020.101518},
	url = {https://www.sciencedirect.com/science/article/pii/S2352152X20303984},
	author = {Sofia Boulmrharj and Radouane Ouladsine and Youssef NaitMalek and Mohamed Bakhouya and Khalid Zine-dine and Mohammed Khaidar and Mustapha Siniti}
}
@article {Boulmrharj2020,
	title = {Online battery state-of-charge estimation methods in micro-grid systems},
	journal = {Journal of Energy Storage},
	volume = {30},
	year = {2020},
	note = {cited By 30},
	abstract = {Batteries have shown great potential for being integrated in Micro-Grid (MG) systems. However, their integration is not a trivial task and, therefore, requires extensive modeling and simulations in order to efficiently estimating their State-of-Charge (SoC) within MG systems. The work presented in this article focuses mainly on battery modeling for SoC estimation. We put more emphasize on battery system{\textquoteright}s characterization, modeling, SoC estimation and its integration into MG systems in order to study its performance. In fact, an instrumentation platform, composed of recent and low cost sensing and actuating equipment, is developed in order to identify the battery{\textquoteright}s parameters and then build the battery model. The simulation results show good agreement with the experimental results, and thus the battery model is validated in both charging and discharging processes. Then, the battery{\textquoteright}s SoC estimation in both charging and discharging processes is investigated by means of sophisticated methods, such as, Artificial Neural Network, Luenberger observer and Kalman Filter combined with Coulomb counting. The results of these methods are reported and compared to the SoC estimated using the Coulomb counting method in order to end up with the precise method. The modeled battery is afterwards integrated into an MG system, which is deployed into our EEBLab (Energy Efficient Building Laboratory) test-site, for simulation and experimental investigations. Finally, the four algorithms for SoC estimation are included into the instrumentation platform, which is connected to a Lead-acid battery already integrated into the MG system, in order to show and compare their performances and accuracy for online battery{\textquoteright}s SoC estimation. {\textcopyright} 2020 Elsevier Ltd},
	keywords = {Battery management systems, Battery state of charge, Charging (batteries), Coulomb counting method, Discharging process, energy efficiency, Energy efficient building, Experimental investigations, Intelligent buildings, Lead acid batteries, Luenberger observers, Model and simulation, Neural networks, Online systems, Sensing and actuating},
	doi = {10.1016/j.est.2020.101518},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85085273724\&doi=10.1016\%2fj.est.2020.101518\&partnerID=40\&md5=f5d31d6e8a0f90e2bec4e1dd9d7da9d8},
	author = {Boulmrharj, S. and Ouladsine, R. and NaitMalek, Y. and Bakhouya, M. and Zine-Dine, K. and Khaidar, M. and Siniti, M.}
}
@article {Dari2020237,
	title = {Optimal method for detecting collusive saboteur smart meters in smart grid},
	journal = {Journal of Cyber Security and Mobility},
	volume = {9},
	number = {2},
	year = {2020},
	note = {cited By 1},
	pages = {237-264},
	abstract = {Smart grid is a system in which it is possible to use voting-based techniques to resist sabotage of several cyber-attacks. The adaptation of these techniques can be difficult and useless in the case when the malicious resources (i.e., smart meters) of this system can return wrong data in same time; however, the collusion problem is triggered. To detect and resolve the collusive issue, spot-checking technique has been proposed by sending randomly certain number of spotter queries to chosen resources with known correct data in order to estimate resource credibility based on the returned data. This work proposes an original method that resist against collusion attacks by using probability to solving a new spot-checking optimization problem for smart grid systems, with the objective to minimize probability of accepting wrong data (PAWD) while respecting an expected overhead constraint. The proposed solution contains an optimal combination of several parameters, the number of spotter queries sent, the number of resources tested by each spotter query, and the number of resources assigned to run the genuine query. The optimization procedure includes a new method for evaluating performance metrics of PAWD and expected overhead in terms of the total number of query assignments. To demonstrate the proposed optimization problem and solution procedure, we have provided several illustrative examples. {\textcopyright} 2020 the Author(s).},
	doi = {10.13052/JCSM2245-1439.923},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85087053509\&doi=10.13052\%2fJCSM2245-1439.923\&partnerID=40\&md5=9a7e9e5d83a2d3e2e23041adf21fcaaa},
	author = {Dari, E.Y. and Bendahmane, A. and Essaaidi, M.}
}
@article {Koulou2020,
	title = {Optimization in collaborative information systems for an enhanced interoperability network},
	journal = {International Journal for Simulation and Multidisciplinary Design Optimization},
	volume = {11},
	year = {2020},
	note = {cited By 2},
	abstract = {Today{\textquoteright}s constraints on collaborative enterprises are often directly reflected in the interoperability of their information systems. The goal is to improve and effectively evolve the global interoperability of collaboration by distributing the required effort in an optimal way on different information systems to achieve the target goal. This method of enhancement will be realized by applying an IMA (Interoperability Measurement Approach) to generate a ratio representing the degree of interoperability of an information system within the collaboration, as well as applying the heuristic optimization method PPSO (Paralleled Particle Swarm Optimization) to reach the optimal distribution of effort. {\textcopyright} A. Koulou et al.},
	keywords = {Collaborative enterprise, Collaborative information systems, Heuristic methods, Heuristic optimization method, Information systems, Information use, interoperability, Optimal distributions, Particle swarm optimization (PSO)},
	doi = {10.1051/smdo/2019021},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85085511318\&doi=10.1051\%2fsmdo\%2f2019021\&partnerID=40\&md5=e1f020778ecbcca1fde01bc7eee029d3},
	author = {Koulou, A. and Zemzami, M. and El Hami, N. and Elmir, A. and Hmina, N.}
}
@conference {Berradi2020,
	title = {Optimize the QoS Metrics in Smart Mobile Communication using Multi-Objective Function},
	booktitle = {3rd International Conference on Advanced Communication Technologies and Networking, CommNet 2020},
	year = {2020},
	note = {cited By 1},
	abstract = {The impact of mobility is a major factor that can have an influence on the stability of network behaviour in mobile ad-hoc networks (MANET). The selection of paths having stability, security and an extended network lifetime is one of the crucial issues in the design of routing protocols. In this paper, the authors propose an enhanced algorithm relying on a multipurpose function according to three metrics, mobility, energy and reputation levels to improve the routing decision-making process. The main goal is to identify better performing Multipoint relays (MPRs) which are used to relay messages between nodes. They are also necessary for routing and selecting the appropriate route from any source to any destination node. The identification of the most efficient MPRs can upgrade the network performing even in the most challenging conditions of the dynamic environment. The authors implement the advanced algorithm in the OLSR and get the performance result by using a network simulator (NS3) running under the mobility model of the Manhattan network. The achieved results show important performance compared to the default version. In addition, the proposed model can be employed to improve network efficiency for proactive protocols in ad-hoc networks. {\textcopyright} 2020 IEEE.},
	keywords = {Decision making, Destination nodes, Dynamic environments, Internet protocols, Manhattan networks, Mobile ad hoc networks, Mobile communications, Mobile telecommunication systems, Multi-objective functions, Network efficiency, Network security, Network simulators, Proactive protocol},
	doi = {10.1109/CommNet49926.2020.9199632},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85093653757\&doi=10.1109\%2fCommNet49926.2020.9199632\&partnerID=40\&md5=83e6a0c98ac8386acb6e6aad76a531ec},
	author = {Berradi, H. and Habbani, A. and Souidi, M. and Elmahdi, F. and Mouchfiq, N.}
}
@article {ElMahdi2020,
	title = {Optimized Scheme to Secure IoT Systems Based on Sharing Secret in Multipath Protocol},
	journal = {Wireless Communications and Mobile Computing},
	volume = {2020},
	year = {2020},
	note = {cited By 1},
	abstract = {Internet of Things (IoT) is a hot and emerging topic nowadays. In the world of today, all kinds of devices are supposed to be connected and all types of information are exchanged. This makes human daily life easier and much more intelligent than before. However, this life mode is vulnerable to several security threats. In fact, the mobile networks, by nature, are more exposed to malicious attacks that may read confidential information and modify or even drop important data. This risk should be taken in consideration prior to any construction of mobile networks especially in the coming 5G technology. The present paper aims to provide a contribution in securing such kinds of environment by proposing a new protocol that can be implemented in ad hoc networks. {\textcopyright} 2020 Fatna El Mahdi et al.},
	keywords = {5G mobile communication systems, ad hoc networks, Confidential information, Daily lives, Emerging topics, Internet of things, Internet of Things (IOT), Malicious attack, Mobile security, Mobile telecommunication systems, Multipath protocols, Network security, New protocol, Security threats},
	doi = {10.1155/2020/1468976},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85083513010\&doi=10.1155\%2f2020\%2f1468976\&partnerID=40\&md5=a7326029a67a6d4fc68c90a958148708},
	author = {El Mahdi, F. and Habbani, A. and Kartit, Z. and Bouamoud, B.}
}
@conference {Marhraoui202055,
	title = {Organizational Agility and the Complementary Enabling Role of IT and Human Resources: Proposition of a New Framework},
	booktitle = {Lecture Notes in Information Systems and Organisation},
	volume = {35},
	year = {2020},
	note = {cited By 5},
	pages = {55-65},
	abstract = {Nowadays, companies{\textquoteright} environment is characterized by a rapid and continuous change. This includes economic, social, political and environmental aspects. Firms should then be able to sense risks and opportunities in their environments, and to act adequately in a rapid and efficient manner. Changes become thus a main source of sustainable competitive advantage. Organizational agility is a key dynamic capability, which allows the firm to cope with new market orientations, to take advantage of risks and to seize opportunities. The agile characteristics are enabled by a set of facilitators including particularly information technology and human resources. In this work, we explore through our proposed Framework, how IT infrastructure and human resources practices can have a direct and complementary effect through IT acceptance and developed IT skills. We highlight also the role of using and mastering human resources information systems (HRIS) in enhancing organizational agility, which plays an intermediary role for firm{\textquoteright}s sustainable performance. {\textcopyright} Springer Nature Switzerland AG 2020.},
	doi = {10.1007/978-3-030-34269-2_4},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85079815099\&doi=10.1007\%2f978-3-030-34269-2_4\&partnerID=40\&md5=65291d4578557a6244a2e44639b32ca7},
	author = {Marhraoui, M.A. and El Manouar, A.}
}
@article {Assami201921,
	title = {Ontology-based modeling for a personalized mooc recommender system},
	journal = {Smart Innovation, Systems and Technologies},
	volume = {111},
	year = {2019},
	note = {cited By 0},
	pages = {21-28},
	doi = {10.1007/978-3-030-03577-8_3},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85056482148\&doi=10.1007\%2f978-3-030-03577-8_3\&partnerID=40\&md5=38ab9ecb20bd621f80b6f281454278f1},
	author = {Assami, S. and Daoudi, N. and Ajhoun, R.}
}
@conference {Kabli201934,
	title = {Optical OFDM (O-OFDM) for Intensity Modulated/Direct Detection Optical Systems},
	booktitle = {2018 IEEE International Conference on Communication, Networks and Satellite, Comnetsat 2018 - Proceedings},
	year = {2019},
	note = {cited By 0},
	pages = {34-38},
	doi = {10.1109/COMNETSAT.2018.8684118},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85064746220\&doi=10.1109\%2fCOMNETSAT.2018.8684118\&partnerID=40\&md5=cbe0395a7c53b386ca8ea8c91ca1da98},
	author = {Kabli, A.E. and Ahmed Faqihi, M.}
}
@article {El-Yahyaoui2019150,
	title = {Optimizations in fully homomorphic encryption},
	journal = {Lecture Notes in Networks and Systems},
	volume = {49},
	year = {2019},
	note = {cited By 0},
	pages = {150-166},
	doi = {10.1007/978-3-319-97719-5_11},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85063268513\&doi=10.1007\%2f978-3-319-97719-5_11\&partnerID=40\&md5=d99d4c66a9844c9bde0bf03273bef13b},
	author = {El-Yahyaoui, A. and Ech-Cherif El Kettani, M.D.}
}
@article {Baddi2019255,
	title = {OSM-GKM optimal shared multicast-based solution for group key management in mobile IPv6},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {11028 LNCS},
	year = {2019},
	note = {cited By 0},
	pages = {255-269},
	doi = {10.1007/978-3-030-05529-5_17},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85059959185\&doi=10.1007\%2f978-3-030-05529-5_17\&partnerID=40\&md5=2810614cfac2d08a325d997402510437},
	author = {Baddi, Y. and El Kettani, M.D.E.-C.}
}
@conference {Bensouda2018,
	title = {Opinion spam detection: A review of the literature},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2018},
	doi = {10.1145/3230905.3230922},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85053485124\&doi=10.1145\%2f3230905.3230922\&partnerID=40\&md5=a94b2b0c2405c84e95f213eb29c413f2},
	author = {Bensouda, N. and Fkihi, S.E. and Faizi, R.}
}
@article {Ouzineb201890,
	title = {Optimal planning of buffer sizes and inspection station positions},
	journal = {Production and Manufacturing Research},
	volume = {6},
	number = {1},
	year = {2018},
	note = {cited By 0},
	pages = {90-112},
	abstract = {The problem of buffer sizing and inspection stations positioning in unreliable production lines is a complex mixed integer nonlinear optimization problem. In this problem, we have a production line with n machines and n fixed-size (storage) buffers in series. The machines produce parts that are either conforming or nonconforming, and the line includes inspection stations that reject the nonconforming pats. The goal is to find the optimal buffer sizes, the number and positions of the inspection stations, and satisfy the customer demand on conforming parts while minimizing the total cost. We present in this paper an exact method to solve this complex manufacturing problem. We also present new theoretical results on buffer-size bounds, stationarity, and cost function convexity permitting to significantly reduce the problem complexity. These theoretical and algorithmic developments allow solving to optimality instances with up to 30 machines tools developed previously cannot solve. {\textcopyright} 2018, $\#$x00A9; 2018 The Author(s). Published by Informa UK Limited, trading as Taylor \& Francis Group.},
	doi = {10.1080/21693277.2017.1422812},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041726865\&doi=10.1080\%2f21693277.2017.1422812\&partnerID=40\&md5=49f1f20a27abf3c2e90db1cffa1a2c3e},
	author = {Ouzineb, M. and Mhada, F.Z. and Pellerin, R. and El Hallaoui, I.}
}
@article {Ouzineb201890,
	title = {Optimal planning of buffer sizes and inspection station positions},
	journal = {Production and Manufacturing Research},
	volume = {6},
	number = {1},
	year = {2018},
	pages = {90-112},
	doi = {10.1080/21693277.2017.1422812},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041726865\&doi=10.1080\%2f21693277.2017.1422812\&partnerID=40\&md5=49f1f20a27abf3c2e90db1cffa1a2c3e},
	author = {Ouzineb, M. and Mhada, F.Z. and Pellerin, R. and El Hallaoui, I.}
}
@conference {Baddi2018567,
	title = {Optimal Shared Multicast Tree Based Solution for Group Key Management in Mobile IPv6},
	booktitle = {Colloquium in Information Science and Technology, CIST},
	volume = {2018-October},
	year = {2018},
	pages = {567-572},
	doi = {10.1109/CIST.2018.8596622},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85061457715\&doi=10.1109\%2fCIST.2018.8596622\&partnerID=40\&md5=31bd74e9c9cd03787a33a8016a62e2ce},
	author = {Baddi, Y. and Kettani, M.D.E.-C.E.}
}
@conference {Mancour201838,
	title = {Optimal voltage and reactive power control in power distribution system},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2018},
	pages = {38-41},
	doi = {10.1145/3289100.3289107},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85058668349\&doi=10.1145\%2f3289100.3289107\&partnerID=40\&md5=c3957c662b34dc5c6a4427ade7a25493},
	author = {Mancour, A.A. and Nasser, T.}
}
@conference {Abouyahya2018,
	title = {An optimization of the k-nearest neighbor using dynamic time warping as a measurement similarity for facial expressions recognition},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2018},
	doi = {10.1145/3230905.3230921},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85053484708\&doi=10.1145\%2f3230905.3230921\&partnerID=40\&md5=2651d0ca787e887d19fd3193ed428623},
	author = {Abouyahya, A. and Fkihi, S.E.}
}
@conference {Nouinou2018,
	title = {Overview on last advances of feature selection},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2018},
	doi = {10.1145/3230905.3230959},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85053484371\&doi=10.1145\%2f3230905.3230959\&partnerID=40\&md5=e7c10b73c82aca9d8cd0e61aa6e097f4},
	author = {Nouinou, S. and Afia, A.E. and Fkihi, S.E.}
}
@article {Stone20181272,
	title = {The ox fall down: path-breaking and technology treadmills in Indian cotton agriculture},
	journal = {Journal of Peasant Studies},
	volume = {45},
	number = {7},
	year = {2018},
	pages = {1272-1296},
	doi = {10.1080/03066150.2017.1291505},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85018168972\&doi=10.1080\%2f03066150.2017.1291505\&partnerID=40\&md5=f4d0af4d46562cddbe9c43cf41d389e7},
	author = {Stone, G.D. and Flachs, A.}
}
@conference {ElMouaatamid2017,
	title = {One-step majority-logic decodable codes derived from oval designs},
	booktitle = {Proceedings - 2017 International Conference on Wireless Networks and Mobile Communications, WINCOM 2017},
	year = {2017},
	note = {cited By 0},
	abstract = {In this paper, we investigate the combinatorial design of a new class of One-Step Majority-Logic Decodable (OSMLD) codes, based on Balanced Incomplete Block Designs of type Oval, which are derived from finite geometry. We show that the constructed OSMLD codes provides high rates in addition to good correction capacities. Simulation results shows that the proposed codes converge well under iterative decoding with an efficient tradeoff between complexity and performances. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/WINCOM.2017.8238185},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041435738\&doi=10.1109\%2fWINCOM.2017.8238185\&partnerID=40\&md5=cc9a3eeb1781ff8e1ea9d4a775da4221},
	author = {El Mouaatamid, O. and Lahmer, M. and Belkasmi, M. and M{\textquoteright}rabet, Z. and Yatribiz, A.}
}
@conference {Essadi2017,
	title = {Operators role-based approach to coordinate between heterogeneous DSLs},
	booktitle = {2017 International Conference on Wireless Technologies, Embedded and Intelligent Systems, WITS 2017},
	year = {2017},
	note = {cited By 0},
	abstract = {Nowadays systems involve many business domains and are consequently designed by teams of experts with different concerns. Every team uses its Domain Specific Language (DSL) to elaborate heterogeneous models describing different parts of the same system. These heterogeneous models need to be coordinated and integrated, to get a whole view of the system, to ease its validation and to uncover inconsistencies between heterogeneous models. However, many approaches and ways of integration has been already explored, one of important approach among them is coordination between DSLs instead of models, doing so coordination became automatic instead of being manual and tailored to every instance of models. Actually, this work fits in this class by giving a classification of DSLs relationships and their respective operators used to resolve DSLs heterogeneity. Moreover, in this paper we consider coordination as a separate role to be given to DSLs meta-classes responsible of coordination. Explicitly, these meta-classes need to override operations defined in the proposed coordination meta-model. As illustrative example, we present a telecommunication network supervision system where two different DSL are involved. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/WITS.2017.7934657},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85021691244\&doi=10.1109\%2fWITS.2017.7934657\&partnerID=40\&md5=39f75645c1fcfbbea42c9bace8a1bbfd},
	author = {Essadi, N. and Anwar, A. and Laghouaouta, Y.}
}
@conference {Bouanane20172087,
	title = {Optimization of vehicle routing problem in the context of reverse logistics of handling containers in closed loop},
	booktitle = {Proceedings of the International Conference on Industrial Engineering and Operations Management},
	year = {2017},
	note = {cited By 0},
	pages = {2087-2088},
	abstract = {Reverse logistics aims at the optimization of the delivery of goods from depots to customers and the simultaneous collection of waste or used products from customers to depots or specialized recycling sites. In this framework, classical routing problems such as vehicle routing problem must be reformulated to take into account simultaneously both goods delivery and used containers collection. In Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD), vehicles can accomplish pickup and delivery processes in each node simultaneously and the whole loading products should be returned to the depot. The importance of reverse logistics increased the importance of VRPSPD. Due to the development of communication and information technology, and the increasing pressure of transportation cost, many companies choose the joint distribution of multiple depots because it can obtain more saving cost than traditional fixed zone service of single depot. This paper aims to study the Multi Depot Vehicle Routing Problem with Simultaneous Pickup and Delivery and Inventory Restrictions. What makes this problem special is the depots capacities. In reality, the optimal distribution of different goods from potentially multiple depots to customers depends on the inventory levels in the depots. Each depot has a capacity and the capacities of depots are not same as each other. We distinguish two storage areas in each depot, one for product to be delivered to customers and the other for product picked up from customers. Customers can only be served if sufficient stock of the requested product is available. Similarly, a collection request can only be satisfied if there is sufficient space in the corresponding stock. The problem is defined as follows: given several depots with defined stock levels, find the lowest-cost routes such that the known delivery and pick-up demands of a set of customers is satisfied and the capacity and inventory constraints of vehicles and depots are not violated. There seems to exist no model that captures this interaction between simultaneous pick-up and delivery and inventory constrains. {\textcopyright} IEOM Society International.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85018972722\&partnerID=40\&md5=63b2cdc02b2d2b49055a21c5f4857501},
	author = {Bouanane, K. and Benadada, Y. and Marcotte, S.}
}
@article {Bennasar201756,
	title = {An overview of the state-of-the-art of cloud computing cyber-security},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {10194 LNCS},
	year = {2017},
	note = {cited By 1},
	pages = {56-67},
	abstract = {We presented an overview of the state-of-the-art of cloud computing security which covers its essential challenges through the main different cyber-security threats, the main different approaches, algorithms and techniques developed to address them, as well as the open problems which define the research directions in this area. The bottom line is that the state of maturity of cloud computing security is very promising and there are many research directions still open and which promise continued improvements of cloud security and privacy. {\textcopyright} Springer International Publishing AG 2017.},
	doi = {10.1007/978-3-319-55589-8_4},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015229714\&doi=10.1007\%2f978-3-319-55589-8_4\&partnerID=40\&md5=4ac295660f32d3f09924ffcdac562634},
	author = {Bennasar, H. and Bendahmane, A. and Essaaidi, M.}
}
@conference { ISI:000385280000021,
	title = {OLSR-RAIP5: Optimized Link State Routing with Redundant Array of Independent Paths 5},
	booktitle = {PROCEEDINGS OF THE MEDITERRANEAN CONFERENCE ON INFORMATION \& COMMUNICATION TECHNOLOGIES 2015 (MEDCT 2015), VOL 2},
	series = {Lecture Notes in Electrical Engineering},
	volume = {381},
	year = {2016},
	note = {Mediterranean Conference on Information and Communication Technologies (MedCT), Saidia, MOROCCO, MAY 07-09, 2015},
	pages = {201-210},
	abstract = {The improvement of data routing performances and security in mobile networks mainly depends on the quality and type of message transmitted and also on the routing algorithms used. In Mobile Adhoc Networks (MANET), there are a lot of constraints that must be considered to improve quality and security of mobile communications. In this paper, we propose a new approach to enhance quality, reliability and security of mobile communications based on a multipath routing protocol inspired on the RAID5 technology. We propose a new algorithm for packet segmentation and routing data via multiple disjoint paths. This provides better security and ensures greater reliability of the information exchanged in a MANET. We have tested our proposition and done some simulations on the OLSR protocol which is widely used in context of MANETs. Through conducted simulations, we have shown that our proposed solution offers better reliability and security than the standard OLSR protocol.},
	isbn = {978-3-319-30298-0; 978-3-319-30296-6},
	issn = {1876-1100},
	doi = {10.1007/978-3-319-30298-0\_21},
	author = {Echchaachoui, Adel and Elmahdi, Fatna and Elkoutbi, Mohammed},
	editor = {ElOualkadi, A and Choubani, F and ElMoussati, A}
}
@conference {Essadi2016,
	title = {Operator-based coordination between heterogeneous DSLs: Case of telecommunication network supervision},
	booktitle = {2016 International Conference on Information Technology for Organizations Development, IT4OD 2016},
	year = {2016},
	note = {cited By 0},
	abstract = {Coordination between heterogeneous DSLs is needed more and more to overcome complexity of modern systems involving many business domains. This article gives a definition of heterogeneity, coordination and a classification of possible relationships between DSLs. Then, propose coordination operators to resolve heterogeneity accordingly with precedent works. As illustrative example, the paper presents a telecommunication network supervision system where two different DSLs: DSL ANS.1 and DSL supervision need to be coordinated, an operator of structural mapping has been used to coordinate between the two DSLs. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/IT4OD.2016.7479252},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84978115095\&doi=10.1109\%2fIT4OD.2016.7479252\&partnerID=40\&md5=2eb0dfb1e58d27a27c6a238f6a5dc265},
	author = {Essadi, N.a and Anwar, A.a and Mahmoud, N.b}
}
@conference { ISI:000386352000004,
	title = {Operator-Based Coordination between Heterogeneous DSLs : Case of Telecommunication Network Supervision},
	booktitle = {2016 INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY FOR ORGANIZATIONS DEVELOPMENT (IT4OD)},
	year = {2016},
	note = {International Conference on Information Technology for Organizations Development (IT4OD), USMBA Univ, ENSA Fez, ERSI Lab, Fez, MOROCCO, MAR 30-APR 01, 2016},
	publisher = {Natl Sch Appl Sci Fez; Univ Sidi Mohamed Ben Abdellah; FST Fez; Fac Sci Fez; Lab Renewable Energies \& Intelligent Syst; Assoc ANRITE; CNRST; IEEE Morocco Sect; IEEE Advancing Technol Human},
	organization = {Natl Sch Appl Sci Fez; Univ Sidi Mohamed Ben Abdellah; FST Fez; Fac Sci Fez; Lab Renewable Energies \& Intelligent Syst; Assoc ANRITE; CNRST; IEEE Morocco Sect; IEEE Advancing Technol Human},
	abstract = {Coordination between heterogeneous DSLs is needed more and more to overcome complexity of modern systems involving many business domains. This article gives a definition of heterogeneity, coordination and a classification of possible relationships between DSLs. Then, propose coordination operators to resolve heterogeneity accordingly with precedent works. As illustrative example, the paper presents a telecommunication network supervision system where two different DSLs: DSL ANS.1 and DSL supervision need to be coordinated, an operator of structural mapping has been used to coordinate between the two DSLs.},
	isbn = {978-1-4673-7689-1},
	author = {Essadi, Naima and Anwar, Adil and Mahmoud, Nassar}
}
@conference {Adadi2015,
	title = {Ontology based composition of e-Government services using AI Planning},
	booktitle = {2015 10th International Conference on Intelligent Systems: Theories and Applications, SITA 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {A major propelling technology for electronic government (e-Government) is the powerful concept of Semantic Web Service. Semantically enriched Web services promise to increase the level of automation and to reduce integration efforts significantly. On the other hand, and due to the heterogeneous structure of the public sector, the achievement of interoperability and integration is a key challenge for a comprehensive e-Government. Therefore, the combination of e-Government and Semantic Web Services is very much natural. In this paper, we present a dynamic approach for semantically composing e-Government Web services based on Artificial Intelligence (AI) techniques. The overall objective of our approach is to improve the citizen centric e-Government vision by providing a platform for automatically discovering, composing and optimizing e-Government services. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/SITA.2015.7358430},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962383271\&doi=10.1109\%2fSITA.2015.7358430\&partnerID=40\&md5=7ef06f1db05a4059c1b4423498a9fc41},
	author = {Adadi, A.a and Berrada, M.a and Chenouni, D.a and Bounabat, B.b}
}
@conference { ISI:000380409500056,
	title = {Ontology based composition of e-Government services using AI Planning},
	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 = {A major propelling technology for electronic government (e-Government) is the powerful concept of Semantic Web Service. Semantically enriched Web services promise to increase the level of automation and to reduce integration efforts significantly. On the other hand, and due to the heterogeneous structure of the public sector, the achievement of interoperability and integration is a key challenge for a comprehensive e-Government. Therefore, the combination of e-Government and Semantic Web Services is very much natural. In this paper, we present a dynamic approach for semantically composing e-Government Web services based on Artificial Intelligence (AI) techniques. The overall objective of our approach is to improve the citizen centric e-Government vision by providing a platform for automatically discovering, composing and optimizing e-Government services.},
	isbn = {978-1-5090-0220-7},
	author = {Adadi, Amina and Berrada, Mohammed and Chenouni, Driss and Bounabat, Bouchaib}
}
@article {ElIdrissi2015235,
	title = {Ontology learning from relational database: How to label the relationships between concepts?},
	journal = {Communications in Computer and Information Science},
	volume = {521},
	year = {2015},
	note = {cited By 0},
	pages = {235-244},
	abstract = {Developing ontology for modeling the universe of a Relational Database (RDB) is a key success for many RDB related domains, including semantic-query of RDB, Linked Data and semantic interoperability of information systems. However, the manual development of ontology is a tedious task, error-prone and requires much time. The research field of ontology learning aims to provide (semi-) automatic approaches for building ontology. However, one big challenge in the automatic transformation, is how to label the relationships between concepts. This challenge depends heavily on the correct extraction of the relationship types. In fact, the RDB model does not store the meaning of relationships between entities, it only indicates the existence of a link between them. This paper suggests a solution consisting of a meta-model for the semantic enrichment of the RDB model and of a classification of relationships. A case study shows the effectiveness of our approach. {\textcopyright} Springer International Publishing Switzerland 2015.},
	doi = {10.1007/978-3-319-18422-7_21},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84929459677\&doi=10.1007\%2f978-3-319-18422-7_21\&partnerID=40\&md5=ac949fcc959bce20c507351a6259639e},
	author = {El Idrissi, B. and Baina, S. and Baina, K.}
}
@conference { ISI:000373729000021,
	title = {Ontology Learning from Relational Database: How to Label the Relationships Between Concepts?},
	booktitle = {BEYOND DATABASES, ARCHITECTURES AND STRUCTURES, BDAS 2015},
	series = {Communications in Computer and Information Science},
	volume = {521},
	year = {2015},
	note = {11th International Conference on Beyond Databases, Architectures and Structures (BDAS), Ustron, POLAND, MAY 26-29, 2015},
	pages = {235-244},
	publisher = {IEEE Poland Sect; Silesian Univ Technol, Inst Informat},
	organization = {IEEE Poland Sect; Silesian Univ Technol, Inst Informat},
	abstract = {Developing ontology for modeling the universe of a Relational Database (RDB) is a key success for many RDB related domains, including semantic-query of RDB, Linked Data and semantic interoperability of information systems. However, the manual development of ontology is a tedious task, error-prone and requires much time. The research field of ontology learning aims to provide (semi-) automatic approaches for building ontology. However, one big challenge in the automatic transformation, is how to label the relationships between concepts. This challenge depends heavily on the correct extraction of the relationship types. In fact, the RDB model does not store the meaning of relationships between entities, it only indicates the existence of a link between them. This paper suggests a solution consisting of a meta-model for the semantic enrichment of the RDB model and of a classification of relationships. A case study shows the effectiveness of our approach.},
	isbn = {978-3-319-18422-7; 978-3-319-18421-0},
	issn = {1865-0929},
	doi = {10.1007/978-3-319-18422-7\_21},
	author = {El Idrissi, Bouchra and Baina, Salah and Baina, Karim},
	editor = {Kozielski, S and Mrozek, D and Kasprowski, P and MalysiakMrozek, B and Kostrzewa, D}
}
@conference {Dari2015,
	title = {An overview of smart grid cyber-security state of the art study},
	booktitle = {Proceedings of 2015 IEEE International Renewable and Sustainable Energy Conference, IRSEC 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {Smart Grid is the most outstanding engineering achievement of the 21st century in power systems. This is an emerging technology that is revolutionizing the conventional electric grid by providing new services based mainly on information Communication technology (ICT), which is considered to be its main enabler. Besides the different opportunities and advantages offered by ICT, Smart Grid suffers from its inherent challenges, especially, at the level of cyber-security. Consequently, there are several security threats that may affect Smart Grid. These can be divided into three categories, namely, people and policy threats, platform threats and network threats. To address these threats several approaches and mechanisms were developed based on cryptographic methods, authentication protocols and firewalls. This paper is dedicated to an overview study on Smart Grid Cyber-security challenges and to the different approaches available to address the different security threats. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/IRSEC.2015.7455097},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84968561580\&doi=10.1109\%2fIRSEC.2015.7455097\&partnerID=40\&md5=e6da9a053a127977dfb75b7241de4cb0},
	author = {Dari, E.Y.a and Essaaidi, M.b}
}
@conference { ISI:000382162300175,
	title = {An Overview of Smart Grid Cyber-Security State of The Art Study},
	booktitle = {PROCEEDINGS OF 2015 3RD IEEE INTERNATIONAL RENEWABLE AND SUSTAINABLE ENERGY CONFERENCE (IRSEC{\textquoteright}15)},
	year = {2015},
	note = {3rd IEEE International Renewable and Sustainable Energy Conference (IRSEC), Marrakech, MOROCCO, DEC 10-13, 2015},
	pages = {817-823},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Smart Grid is the most outstanding engineering achievement of the 21st century in power systems. This is an emerging technology that is revolutionizing the conventional electric grid by providing new services based mainly on information Communication technology (ICT), which is considered to be its main enabler. Besides the different opportunities and advantages offered by ICT, Smart Grid suffers from its inherent challenges, especially, at the level of cyber-security. Consequently, there are several security threats that may affect Smart Grid. These can be divided into three categories, namely, people and policy threats, platform threats and network threats. To address these threats several approaches and mechanisms were developed based on cryptographic methods, authentication protocols and firewalls. This paper is dedicated to an overview study on Smart Grid Cyber-security challenges and to the different approaches available to address the different security threats.},
	isbn = {978-1-4673-7894-9},
	author = {Dari, El Yazid and Essaaidi, Mohamed},
	editor = {Essaaidi, M and Zaz, Y}
}
@conference {Aouzal2015,
	title = {An overview of variability management in cloud services},
	booktitle = {Proceedings of 2015 International Conference on Cloud Computing Technologies and Applications, CloudTech 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {The Cloud Computing paradigm has enabled the multi-tenancy architectural approach in Cloud applications. In a multi-tenant application, one single instance is shared by many tenants (users). Since each client has its own and particular requirements and context, that are exposed to change in time, the process of realizing customizable and adaptable services becomes complex and difficult to handle. Handling variability has been subject of many research works in the domain of Service Oriented Computing, while less interest was given to variability in Cloud services. Therefore, managing variability in Cloud applications can take benefit from related works in service-oriented computing. In this paper, we present an overview of variability management in Cloud applications, in order to assess the pertinence of the different approaches proposed to tackle this issue. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/CloudTech.2015.7336976},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962861131\&doi=10.1109\%2fCloudTech.2015.7336976\&partnerID=40\&md5=08685792a476e627b2fe63ca5f3f1d63},
	author = {Aouzal, K.a and Hafiddi, H.a b and Dahchour, M.a}
}
@conference { ISI:000380407100015,
	title = {An Overview of Variability Management in Cloud Services},
	booktitle = {2015 INTERNATIONAL CONFERENCE ON CLOUD TECHNOLOGIES AND APPLICATIONS (CLOUDTECH 15)},
	year = {2015},
	note = {International Conference on Cloud Computing Technologies and Applications (CloudTech), Marrakech, MOROCCO, JUN 02-04, 2015},
	pages = {138-142},
	abstract = {The Cloud Computing paradigm has enabled the multitenancy architectural approach in Cloud applications. In a multitenant application, one single instance is shared by many tenants (users). Since each client has its own and particular requirements and context, that are exposed to change in time, the process of realizing customizable and adaptable services becomes complex and difficult to handle. Handling variability has been subject of many research works in the domain of Service Oriented Computing, while less interest was given to variability in Cloud services. Therefore, managing variability in Cloud applications can take benefit from related works in service-oriented computing. In this paper, we present an overview of variability management in Cloud applications, in order to assess the pertinence of the different approaches proposed to tackle this issue.},
	isbn = {978-1-4673-8149-9},
	author = {Aouzal, Khadija and Hafiddi, Hatim and Dahchour, Mohamed}
}
@article {Mahieddine2014273,
	title = {Object serialization white framework in J2ME and its refactoring in black framework},
	journal = {Journal of Mobile Multimedia},
	volume = {9},
	number = {3-4},
	year = {2014},
	note = {cited By 0},
	pages = {273-285},
	abstract = {J2ME mobile agents developers are very soon confronted with the problem of objects transfer over the communication flows (streams) provided by J2ME which, by themselves, take into account only the primitive types or simple String objects of JAVA. Serialization is the process of saving the state of an object on a flow of communication, transferring it in the net, and restoring its equivalent from this flow. Unfortunately J2ME software development cannot be used as standard JAVA because it has many strong restrictions, which greatly restricts its use relatively to JAVA. For example, in the case of mobile agent software development, J2ME does not provide tools for the serialization of objects. This research addresses the lack of a standard development environment for mobile agents under J2ME. In this work we propose a pattern-based white-box application framework, in order to achieve the serialization of complex JAVA Objects and its re-factoring into a black-box application framework. {\textcopyright} 2014 Rinton Press.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84893769484\&partnerID=40\&md5=1726097fa7ccff4e0055f5e1bc414883},
	author = {Mahieddine, M.a and El-Khaddar, M.A.b and Oukid, S.a}
}
@conference {Rahmouni201494,
	title = {Optimal buffer management policies in DTNs: A POMDP approach},
	booktitle = {2014 IEEE International Conference on Communications, ICC 2014},
	year = {2014},
	note = {cited By 0},
	pages = {94-99},
	abstract = {Using Delay Tolerant Networks (DTNs) would facilitate the connection of devices and areas across the world that are under-served by current networks. The DTNs are based on the concept of store-carry-and-forward protocols. A node may store a message in its buffer and carry it for a short or a long period of time, until an appropriate forwarding opportunity arises. A critical challenge is to determine routes through the network without even having an end-to-end connection. In order to increase the probability of message delivery, a known approach is implemented using epidemic message replication. This combination of long-term storage and message replication imposes a high storage and bandwidth overhead. Thus, efficient scheduling and dropping policies are necessary to decide which messages should be discarded when nodes{\textquoteright} buffers operate close to their capacity. If a relay buffer is full and needs to store a new packet, it has to decide either to keep the current message or to drop it. This decision depends on the number of transmissions of the message in its buffer and the message which has just arrived. In this paper, a Partially Observed Markov Decision Process (POMDP) framework is proposed to solve the problem of buffer management in DTNs. This modeling technique predicts some properties of the optimal buffer management policy. In addition, numerical examples are presented to illustrate the findings. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/ICC.2014.6883301},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84906995806\&doi=10.1109\%2fICC.2014.6883301\&partnerID=40\&md5=382f58d0b8f3dc6541db001ac2f98769},
	author = {Rahmouni, I.a and Kamili, M.E.a and Fenni, M.R.E.b and Omari, L.a and Kobbane, A.c}
}
@conference { ISI:000366666800017,
	title = {Optimal Buffer Management Policies in DTNs: A POMDP 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 = {94-99},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Using Delay Tolerant Networks (DTNs) would facilitate the connection of devices and areas across the world that are under-served by current networks. The DTNs are based on the concept of store-carry-and-forward protocols. A node may store a message in its buffer and carry it for a short or a long period of time, until an appropriate forwarding opportunity arises. A critical challenge is to determine routes through the network without even having an end-to-end connection. In order to increase the probability of message delivery, a known approach is implemented using epidemic message replication. This combination of long-term storage and message replication imposes a high storage and bandwidth overhead. Thus, efficient scheduling and dropping policies are necessary to decide which messages should be discarded when nodes{\textquoteright} buffers operate close to their capacity. If a relay buffer is full and needs to store a new packet, it has to decide either to keep the current message or to drop it. This decision depends on the number of transmissions of the message in its buffer and the message which has just arrived. In this paper, a Partially Observed Markov Decision Process (POMDP) framework is proposed to solve the problem of buffer management in DTNs. This modeling technique predicts some properties of the optimal buffer management policy. In addition, numerical examples are presented to illustrate the findings.},
	isbn = {978-1-4799-2003-7},
	issn = {1550-3607},
	author = {Rahmouni, Imane and El Kamili, Mohamed and El Fenni, Mohammed Raiss and Omari, Lahcen and Kobbane, Abdellatif},
	editor = {Jamalipour, A and Deng, DJ}
}
@article { ISI:000335289300002,
	title = {Optimization of inventory levels in the blood transfusion centers in Morocco},
	journal = {TRANSFUSION CLINIQUE ET BIOLOGIQUE},
	volume = {21},
	number = {1},
	year = {2014},
	month = {MAR},
	pages = {15-22},
	abstract = {Purpose of the study. - Improve the flow of quantities of blood products between the different centers to restore the ideal quantities at low cost. Materials and methods. - The problem addressed in this work concerns the balancing inventory levels between blood transfusion centers in Morocco. This problem is characterized by a number of constraints to be taken into account: safety stock, stock ideal proportional balancing of stocks, etc. An integer linear model has been proposed to determine the optimal allocation between different centers. Two variants are examined; the first which aims to minimize the level of inventory loss, the second is to balance the different levels of stock, so that all centers have a level of surplus stock and/or loss proportional to the ideal stock. Results. - Two variants of an integer linear model that determine the optimal allocation between different centers has been proposed and their performance was evaluated by experimental results obtained using a solver commercial. Conclusion. - The results of this study allow us to meet the,goal of PSL availability of sufficient and subsequently the quality of service required blood transfusion. (C) 2013 Elsevier Masson SAS. All rights reserved.},
	issn = {1246-7820},
	doi = {10.1016/j.tracli.2013.10.004},
	author = {Bellabdaoui, A. and Bennis, I. and Saadi, J. and Benajiba, M.}
}
@article {Bellabdaoui201415,
	title = {Optimization of inventory levels in the blood transfusion centers in Morocco [Optimisation des niveaux de stock dans les centres de transfusion sanguine au Maroc]},
	journal = {Transfusion Clinique et Biologique},
	volume = {21},
	number = {1},
	year = {2014},
	note = {cited By 1},
	pages = {15-22},
	abstract = {Purpose of the study: Improve the flow of quantities of blood products between the different centers to restore the ideal quantities at low cost. Materials and methods: The problem addressed in this work concerns the balancing inventory levels between blood transfusion centers in Morocco. This problem is characterized by a number of constraints to be taken into account: safety stock, stock ideal proportional balancing of stocks, etc. An integer linear model has been proposed to determine the optimal allocation between different centers. Two variants are examined; the first which aims to minimize the level of inventory loss, the second is to balance the different levels of stock, so that all centers have a level of surplus stock and/or loss proportional to the ideal stock. Results: Two variants of an integer linear model that determine the optimal allocation between different centers has been proposed and their performance was evaluated by experimental results obtained using a solver commercial. Conclusion: The results of this study allow us to meet the goal of PSL availability of sufficient and subsequently the quality of service required blood transfusion. {\textcopyright} 2013 Elsevier Masson SAS.},
	doi = {10.1016/j.tracli.2013.10.004},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84896736577\&doi=10.1016\%2fj.tracli.2013.10.004\&partnerID=40\&md5=ed29d2b7c0e79c59c1d5ff7c9ef8cda7},
	author = {Bellabdaoui, A.a and Bennis, I.b and Saadi, J.b and Benajiba, M.c}
}
@conference { ISI:000350287800027,
	title = {Ontology based Context Aware e-Learning System},
	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 = {With the fast development of e-services and the necessity to use information provided by users and their operating environments, Context-Aware Service (CAS) has emerged as a new paradigm of software engineering to dynamically respond to every change in the status of the user{\textquoteright}s context. Context-aware Service can dynamically capture a range of information from its environment and this information represents a context, the application adapts its execution according to this context. An important challenge in ubiquitous computing is context modeling. Ontology based models presents a suitbale instrument for context modeling. In this paper, we provide an architecture for the development of context aware services for an e-learning system, we also present our context metamodel and how the use of ODM (Ontology Definition Metamodel) can be beneficial for ontology modeling.},
	isbn = {978-1-4799-3392-1},
	author = {Guermah, Hatim and Fissaa, Tarik and Hafiddi, Hatim and Nassar, Mahmoud and Kriouile, Abdelaziz}
}
@conference {Fissaa201343,
	title = {Ontology based context modeler for context-aware systems},
	booktitle = {Proceedings - IEEE 6th International Conference on Service-Oriented Computing and Applications, SOCA 2013},
	year = {2013},
	note = {cited By 0},
	pages = {43-47},
	abstract = {In ubiquitous computing, context-aware service oriented systems refer to applications that use so-called contextual information to provide appropriate services or relevant information to the user or other applications to perform a specific task. An important challenge in such applications is context modeling, using ontologies to model context information and to reason about context at a semantic level has attracted a lot of interest in the research community. However, most of the presented approaches do not usually take into account any software engineering method. Therefore, employing standard approaches to formulate the development process becomes of importance. In this paper, we present an overview of the architecture for the development of context aware services based on ontologies, we also present our context modeler based on ODM (Ontology Definition Metamodel) and model transformations that allows to generate an OWL ontology representing context information. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/SOCA.2013.58},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84894175652\&doi=10.1109\%2fSOCA.2013.58\&partnerID=40\&md5=7f367b0af0c55bcbc35014d583c37455},
	author = {Fissaa, T.a and Guermah, H.a and Hafiddi, H.a b and Nassar, M.a and Kriouile, A.a}
}
@conference { ISI:000345618100007,
	title = {Ontology based Context Modeler for Context-Aware Systems},
	booktitle = {2013 IEEE SIXTH INTERNATIONAL CONFERENCE ON SERVICE-ORIENTED COMPUTING AND APPLICATIONS (SOCA)},
	year = {2013},
	note = {6th IEEE International Conference on Service-Oriented Computing and Applications (SOCA), Kauai, HI, DEC 16-18, 2013},
	pages = {43-47},
	publisher = {IEEE; Intel NTU Connected Context Comp Ctr; Tongji Univ; IEEE Comp Soc Tech Comm Business Informat \& Syst},
	organization = {IEEE; Intel NTU Connected Context Comp Ctr; Tongji Univ; IEEE Comp Soc Tech Comm Business Informat \& Syst},
	abstract = {In ubiquitous computing, context-aware service oriented systems refer to applications that use so-called contextual information to provide appropriate services or relevant information to the user or other applications to perform a specific task. An important challenge in such applications is context modeling, using ontologies to model context information and to reason about context at a semantic level has attracted a lot of interest in the research community. However, most of the presented approaches do not usually take into account any software engineering method. Therefore, employing standard approaches to formulate the development process becomes of importance. In this paper, we present an overview of the architecture for the development of context aware services based on ontologies, we also present our context modeler based on ODM (Ontology Definition Metamodel) and model transformations that allows to generate an OWL ontology representing context information.},
	isbn = {978-1-4799-2701-2},
	doi = {10.1109/SOCA.2013.58},
	author = {Fissaa, Tarik and Guermah, Hatim and Hafiddi, Hatim and Nassar, Mahmoud and Kriouile, Abdelaziz}
}
@conference { ISI:000350287800030,
	title = {Ontology Learning from Data Models: Advance and the Requirement for a Database Preparation and Enrichment Process},
	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 = {Ontology learning field provides automatic and semi-automatic approaches for ontology generation. This process aims to overcome the manual knowledge acquisition process that is difficult, expensive and time-consuming. Several approaches have been emerged for this purpose. However, they are not practical on real-world databases and they are far from capturing all application semantics. This paper gives, first, an overview of the ontology learning process and the peculiarities of relational models. Then, it discusses the advance in this filed according to a developed framework before presenting two main lacks: the requirement of a database preparation process and an enrichment process.},
	isbn = {978-1-4799-3392-1},
	author = {El Idrissi, Bouchra and Baina, Salah and Baina, Karim}
}
@conference {Idrissi2013,
	title = {Ontology learning from data models: Advance and the requirement for a database preparation and enrichment process},
	booktitle = {2013 3rd International Symposium ISKO-Maghreb},
	year = {2013},
	note = {cited By 0},
	abstract = {Ontology learning field provides automatic and semi-automatic approaches for ontology generation. This process aims to overcome the manual knowledge acquisition process that is difficult, expensive and time-consuming. Several approaches have been emerged for this purpose. However, they are not practical on real-world databases and they are far from capturing all application semantics. This paper gives, first, an overview of the ontology learning process and the peculiarities of relational models. Then, it discusses the advance in this filed according to a developed framework before presenting two main lacks: the requirement of a database preparation process and an enrichment process. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/ISKO-Maghreb.2013.6728156},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84894155914\&doi=10.1109\%2fISKO-Maghreb.2013.6728156\&partnerID=40\&md5=604519a5433b26814927c3e13b1948bb},
	author = {Idrissi, B.E. and Baina, S. and Baina, K.}
}
@conference {Ba{\"\i}na201385,
	title = {Organisation, and information systems between formal and informal continuum, balance, patterns, and anti-patterns},
	booktitle = {ICEIS 2013 - Proceedings of the 15th International Conference on Enterprise Information Systems},
	volume = {2},
	year = {2013},
	note = {cited By 0},
	pages = {85-93},
	abstract = {There is no doubt that formalising information systems is of great value to an organisation. This enables, among others, business processes, rules, services and objects models to be standardized, structured, capitalized and reused. A formal information system involves a structured organisation, clearly defined roles and responsibilities and therefore a rational management. However, generalising a formalisation approach to all information system perspectives or all levels of granularity can inversely be fatal to the smooth running of the business, its management, and operation. The aim of this paper is to explore information systems formalinformal continuum, to discover and understand its characteristics, patterns, anti-patterns, and the forces partcipating to its equilibrium, and to propose recommendations to reach right level of formalisation.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84887814719\&partnerID=40\&md5=9f9358cb4d7d0f68ca75f610f1d7e476},
	author = {Baina, K.}
}
@article {Mahieddine2012131,
	title = {Object serialization white framework in J2ME and its refactoring in black framework},
	journal = {International Conference on Next Generation Networks and Services, NGNS},
	year = {2012},
	note = {cited By 0},
	pages = {131-136},
	doi = {10.1109/NGNS.2012.6656090},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84894208690\&doi=10.1109\%2fNGNS.2012.6656090\&partnerID=40\&md5=8c8da3facba1758b014b2622d3ec45f6},
	author = {Mahieddine, M. and El-Khaddar, M.A. and Oukid, S.}
}
@conference {Koulali2012145,
	title = {Optimal distributed relay selection for duty-cycling Wireless Sensor Networks},
	booktitle = {GLOBECOM - IEEE Global Telecommunications Conference},
	year = {2012},
	note = {cited By 5},
	pages = {145-150},
	doi = {10.1109/GLOCOM.2012.6503104},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84877653430\&doi=10.1109\%2fGLOCOM.2012.6503104\&partnerID=40\&md5=96b3bdee645f0fc14aed4cb197e85ce0},
	author = {Koulali, M.-A. and Kobbane, A. and El Koutbi, M. and Ben-Othman, J.}
}
@conference { ISI:000322375100023,
	title = {Optimal Distributed Relay Selection for Duty-Cycling Wireless Sensor Networks},
	booktitle = {2012 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM)},
	series = {IEEE Global Communications Conference},
	year = {2012},
	note = {IEEE Global Communications Conference (GLOBECOM), Anaheim, CA, DEC 03-07, 2012},
	pages = {145-150},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Recent advances in localization technologies and algorithms for Wireless Sensor Networks (WSN) motivate the exploitation of location information in routing protocols. In this paper we consider the geographic forwarding of sporadically generated alarm messages. Our objective is to optimize sensor{\textquoteright}s energy consumption while respecting QoS constraints on transmission delay. For instance, we propose an optimal distributed relay selection policy for WSN with duty-cycling sensors based on a Markov Decision Process (MDP) with complete information. Also, we establish sufficient conditions for optimality of threshold policies. Then, end-to-end performances for a heuristic multi-hop relay selection strategy are established. Finally, we extend our model to account for queuing capabilities at sensor level.},
	isbn = {978-1-4673-0921-9; 978-1-4673-0920-2},
	issn = {2334-0983},
	author = {Koulali, M. -A. and Kobbane, A. and El Koutbi, M. and Ben-Othman, J.}
}
@conference { ISI:000310353000098,
	title = {OPTIMIZING THE PROCESS OF OLSR CLUSTERING BASED ON MOBILITY AND DENSITY IN AD HOC NETWORKS},
	booktitle = {2012 INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS)},
	year = {2012},
	note = {International Conference on Multimedia Computing and Systems (ICMCS), Tangiers, MOROCCO, MAY 10-12, 2012},
	pages = {523-527},
	publisher = {Morocco Sect MTT/AP Joint Chapter},
	organization = {Morocco Sect MTT/AP Joint Chapter},
	abstract = {The main ad hoc routing protocols that were proposed generally operate only on flat networks. However the IP networks have always been of a hierarchical nature, for scalability and manageability reasons. In this paper, we propose a novel clustering algorithm for OLSR based on the density and mobility of nodes. Our algorithm takes into account the node mobility and gives major improvements regarding the number of elected cluster heads. Our objective is to elect a reduced and less mobile cluster heads that will serve for provide hierarchical routing using OLSR.},
	isbn = {978-1-4673-1520-3},
	author = {Loutfi, A. and Elkoutbi, M.},
	editor = {Essaaidi, M and Zaz, Y}
}
@article {7042325720111201,
	title = {ONTOLOGY EVOLUTION MANAGEMENT FOR SEMANTIC WEB SERVICES COOPERATION.},
	journal = {International Journal of Electronic Business Management},
	volume = {9},
	number = {4},
	year = {2011},
	pages = {310 - 321},
	abstract = {Interconnecting services is a complex task. A part of the complexity comes from the need to have a common, shared view of the information, ontology. Thus, there is a need for approaches that help to overcome the differences between service ontologies, and to manage the possible future evolution of the ontologies. The approach proposed in this paper provides a support for cooperation between services. Our proposition is useful for service architectures that evolve and grow in size constantly. The number of services increases and even services are changing to offer new alternatives. The aim is to provide a flexible way to partially automate the processing of ontology and related mapping evolution management. A case study in Telecom service cooperation illustrates the benefits of our approach. We apply our algorithm and implementation prototype p2OEManager to Message Billing Service ontology and Internet Billing Service ontology and particularly, we use our ontology agent model and proto},
	keywords = {Information \& communication technologies, Information technology, Internet industry, Internetworking (Telecommunication), Multi-agent System, Ontology, Ontology Evolution, Semantic integration (Computer systems), Semantic Service, Web services},
	issn = {17282047},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=bth\&AN=70423257\&site=ehost-live},
	author = {Slimani, Soumaya and Benslimane, Djamal and Baina, Salah and Baina, Karim}
}
@conference {Slimani2010449,
	title = {An ontology change management system - An experiment on a health care case study},
	booktitle = {KEOD 2010 - Proceedings of the International Conference on Knowledge Engineering and Ontology Development},
	year = {2010},
	note = {cited By 0},
	pages = {449-452},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-78651412575\&partnerID=40\&md5=738d5124f67747d28ceea6fc60784dc6},
	author = {Slimani, S. and Baina, K. and Baina, S. and Henkel, M. and Perjons, E.}
}
@conference { ISI:000392778800068,
	title = {AN ONTOLOGY CHANGE MANAGEMENT SYSTEM An Experiment on a Health Care Case Study},
	booktitle = {KEOD 2010: Proceedings of the International Conference on Knowledge Engineering and Ontology Development},
	year = {2010},
	note = {International Conference on Knowledge Engineering and Ontology Development (KEOD 2010), Valencia, SPAIN, OCT 25-28, 2010},
	pages = {449-452},
	publisher = {Inst Syst \& Technol Informat Control \& Commun},
	organization = {Inst Syst \& Technol Informat Control \& Commun},
	abstract = {Numerous ontologies have been developed for life science domains. These ontologies are continuously changing. Thus, it is becoming profitable to study and to manage these ontologies change in order to keep all dependent ontologies and their related mappings consistent. The aim of this paper is to propose an agent based approach enabling not only ontology and ontology mapping evolution analysis but also to manage their changes. An experiment in health care illustrates the benefits of our approach. We apply our algorithm, and implementation prototype p(2)OEManager to eye specialist ontology (ESO) and primary health care ontology (PCO), and particularly, we use our ontology agent model, and prototype to manage some significant changes in the ESO ontology.},
	isbn = {978-989-8425-29-4},
	author = {Slimani, Soumaya and Baina, Karim and Baina, Salah and Henkel, Martin and Perjons, Erik},
	editor = {Filipe, J and Dietz, JLG}
}
@conference { ISI:000245384800059,
	title = {An optimal and statistically robust correlation technique for block based motion estimation},
	booktitle = {2006 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO - ICME 2006, VOLS 1-5, PROCEEDINGS},
	year = {2006},
	note = {IEEE International Conference on Multimedia and Expo (ICME 2006), Toronto, CANADA, JUL 09-12, 2006},
	pages = {233+},
	publisher = {IEEE; IEEE Circuits \& Syst Soc; IEEE Commun Soc; IEEE Comp Soc; IEEE Signal Proc Soc},
	organization = {IEEE; IEEE Circuits \& Syst Soc; IEEE Commun Soc; IEEE Comp Soc; IEEE Signal Proc Soc},
	abstract = {In this paper we propose an optimal and robust correlation technique for the local motion estimation purposes. It is based on the maximization of a statistical robust matching function, which is computed in the frequency domain and therefore can be implemented by fast transformation algorithms. We show that our method achieves a significant speed up and robustness over the full search block-matching algorithm. We also present a comparative performance analysis, which shows that the proposed method greatly outperforms the state-of-the-art in correlation motion estimation.},
	isbn = {978-1-4244-0366-0},
	doi = {10.1109/ICME.2006.262425},
	author = {Essannouni, F. and Thami, R. Oulad Haj and Salam, A. and Aboutajdine, D.}
}
