@article {Ajallouda2022440,
	title = {Automatic Key-Phrase Extraction: Empirical Study of Graph-Based Methods},
	journal = {Lecture Notes in Networks and Systems},
	volume = {489 LNNS},
	year = {2022},
	note = {cited By 0},
	pages = {440-456},
	abstract = {Key-phrases in a document are phrases that provide a high-level description of its content without reading it completely. In some research articles, authors specify key-phrases in the articles they have written. However, the vast majority of books, articles, and web pages published every day, lack key-phrases. The manual extraction of these phrases is a tedious task and takes a long time. For this reason, automatic key-phrase extraction (AKE), which is an area of Text Mining, remains the best solution to overcome these difficulties. Because they are used in many Natural Language Processing (NLP) applications, such as text summarization and text classification. This article presents a comparison of some methods of extracting key-phrases from documents. Especially the graph-based approaches. These approaches are evaluated by their abilities to extract key-phrases. Our work focuses on the study of the performance of these methods in extracting key-phrases, whether from short or long texts, with the aim of providing information that contributes to improving their efficiency. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-031-07969-6_33},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135019633\&doi=10.1007\%2f978-3-031-07969-6_33\&partnerID=40\&md5=399dd65be1f33d58c24c1d31777d2b87},
	author = {Ajallouda, L. and Fagroud, F.Z. and Zellou, A. and Benlahmar, E.H.}
}
@article {Zaazaa2022449,
	title = {Automatic Static Vulnerability Detection Approaches and Tools: State of the Art},
	journal = {Lecture Notes in Networks and Systems},
	volume = {357 LNNS},
	year = {2022},
	note = {cited By 0},
	pages = {449-459},
	abstract = {Software vulnerabilities are behind many cybersecurity threats. In fact, if they are exploited, they could cause severe damage to an organization. Thus, finding vulnerabilities in software is a crucial process. However, it often needs both time and expertise. Fortunately, many researchers have focused on automating this process to accelerate the finding of vulnerabilities. Some have worked on making static vulnerability discovery more effective; others have concentrated their research on developing dynamic analysis techniques. This paper presents some of the research that focuses on static analysis approaches and discusses the main differences between them. At the end of this paper, we experiment and analyze the most popular tools that have implemented these approaches and their main weaknesses. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-030-91738-8_41},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85124134162\&doi=10.1007\%2f978-3-030-91738-8_41\&partnerID=40\&md5=e3e3f79893f511026534ba162ef13ec5},
	author = {Zaazaa, O. and El Bakkali, H.}
}
@article {Sebbar2022251,
	title = {BDA-enabler Architecture Based on Cloud Manufacturing: the Case of Chemical Industry},
	journal = {International Journal of Supply and Operations Management},
	volume = {9},
	number = {3},
	year = {2022},
	note = {cited By 0},
	pages = {251-263},
	abstract = {With the advent of cloud manufacturing (CM), alongside the maturity of specific development approaches and systems in the manufacturing industry, has led to the integration of these initiatives into Industry 4.0 to achieve higher performance. In fact, the implementation of Industry 4.0 is a real opportunity for the process industry around the world which is only at the very beginning of its deployment. However, the integration of cloud manufacturing requires the fully digitalization of industrial systems and the implementation of big data management process. Indeed, the lack of resources to handle the huge flows of data in transit and the lack of standards and interoperability is the biggest challenge to the large-scale adoption of smart manufacturing. To get around this problem, it is necessary to put in place management and analysis solutions for big data to facilitate data acquisition, process monitoring, anomaly detection and predictive and proactive maintenance. In addition, the implementation of a smart manufacturing architecture based on big data analytics (BDA) requires a lot of resources in terms of storage and computing power, which is not always available in an industrial context. Thus, it has become essential to offer suitable manufacturing models for the implementation of big data analysis services that meet the new requirements of the manufacturing sector. In this paper, a case study in one of the main African Phosphates Company will be presented. Thus, we will propose a BDA-enabler architecture based on Cloud manufacturing to identified digital opportunities and key benefits regarding performance management, production control and maintenance. The findings will help manufacturer to understand cloud manufacturing and big data analytics capabilities and take advantages from their potential and their digital opportunities to assess manufacturing process. {\textcopyright} 2022 Kharazmi University. All rights reserved.},
	doi = {10.22034/ijsom.2021.109150.2208},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85140920905\&doi=10.22034\%2fijsom.2021.109150.2208\&partnerID=40\&md5=22cf4ece941e282c346700fda9fe056e},
	author = {Sebbar, A. and Zkik, K. and Belhadi, A. and Benghalia, A. and Boulmalf, M. and Ech-Cherif El Kettani, M.D.}
}
@article {Zennou20222181,
	title = {Checking causal consistency of distributed databases},
	journal = {Computing},
	volume = {104},
	number = {10},
	year = {2022},
	note = {cited By 0},
	pages = {2181-2201},
	abstract = {The CAP Theorem shows that (strong) consistency, availability, and partition tolerance are impossible to be ensured together. Causal consistency is one of the weak consistency models that can be implemented to ensure availability and partition tolerance in distributed systems. In this work, we propose a tool to check automatically the conformance of distributed/concurrent systems executions to causal consistency models. Our approach consists in reducing the problem of checking if an execution is causally consistent to solving datalog queries. The reduction is based on complete characterizations of the executions violating causal consistency in terms of the existence of cycles in suitably defined relations between the operations occurring in these executions. We have implemented the reduction in a testing tool for distributed databases, and carried out several experiments on real case studies, showing the efficiency of the suggested approach. {\textcopyright} 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH, AT part of Springer Nature.},
	keywords = {Consistency model, Distributed database, Distributed database systems, Distributed systems, Efficiency of the suggested approaches, Intelligent databases, Partition tolerances, Real case, Testing tools, Weak consistency},
	doi = {10.1007/s00607-021-00911-3},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100842253\&doi=10.1007\%2fs00607-021-00911-3\&partnerID=40\&md5=c07a495f908981f833ea643e53d1466c},
	author = {Zennou, R. and Biswas, R. and Bouajjani, A. and Enea, C. and Erradi, M.}
}
@article {Zarnoufi2022223,
	title = {Classical Machine Learning vs Deep Learning for Detecting Cyber-Violence in Social Media},
	journal = {Communications in Computer and Information Science},
	volume = {1577 CCIS},
	year = {2022},
	note = {cited By 0},
	pages = {223-235},
	abstract = {Cyber-violence is a largely addressed problem in e-health researches, its focus is the detection of harmful behavior from the online user-generated text in order to prevent and protect victims. In this work, we tackle the problem of Social Media (SM) text analysis to detect the harmful content that is the common characteristic of cyber-violence acts. For that, we use classical Machine Learning (ML) based on user psychological features that we compare with Deep Learning (DL) techniques in a small dataset setting. The results were in favor of classical ML. The findings highlight that psychological characteristics extracted from user-generated text are strong predictors of his harmful behavior. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	keywords = {Behavioral research, Classical machine learning, Cybe-violence, Deep learning, E health, Ehealth, Feature engineerings, Harmful behavior, Machine-learning, social media, Social networking (online), User-generated},
	doi = {10.1007/978-3-031-04447-2_15},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85128968964\&doi=10.1007\%2f978-3-031-04447-2_15\&partnerID=40\&md5=70577a9ac5b248762e97757da4349369},
	author = {Zarnoufi, R. and Abik, M.}
}
@conference {Mohammed2022,
	title = {Current Research Trends in Fake News Areas: A Systematic Mapping Study},
	booktitle = {2022 2nd International Conference on Innovative Research in Applied Science, Engineering and Technology, IRASET 2022},
	year = {2022},
	note = {cited By 0},
	abstract = {Nowadays, online news plays an important role in people{\textquoteright}s decisions and behaviors. Some of this news shared on the web may contain deceptive in-formation to mislead those peoples which may cause uncertainty and confusion such in election choices and purchasing decision. Thereafter, fake news is becoming a trending area of research. However, fake news can be differentiated into several subcategories, such as fake reviews, Propaganda, Ru-mor, spams etc. In this paper, fake news studies are analyzed and classified based on their focus areas, this helps to understand that which fake news areas have higher concentrations of research efforts and which area requires the research attention. The systematic study is conducted by planning the mapping protocol defining the search process that planned to be executed using set of inclusion and exclusion criteria on two bibliographic databases (Scopus and IEEE explore) which aims to include relevant papers related to our work in order to identify what the research trends in fake news are. {\textcopyright} 2022 IEEE.},
	keywords = {{\textquoteright}current, Deceptive information, Disinformation, Fake news, Information services, Mapping, Misinformation, Online news, Purchasing decisions, Research trends, Systematic mapping studies, Uncertainty},
	doi = {10.1109/IRASET52964.2022.9737869},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85141118886\&doi=10.1109\%2fIRASET52964.2022.9737869\&partnerID=40\&md5=2ab3889a7ccff7952519e091ca8cf217},
	author = {Mohammed, E. and Zellou, A.}
}
@article {Rguibi2022,
	title = {CXAI: Explaining Convolutional Neural Networks for Medical Imaging Diagnostic},
	journal = {Electronics (Switzerland)},
	volume = {11},
	number = {11},
	year = {2022},
	note = {cited By 0},
	abstract = {Deep learning models have been increasingly applied to medical images for tasks such as lesion detection, segmentation, and diagnosis. However, the field suffers from the lack of concrete definitions for usable explanations in different settings. To identify specific aspects of explainability that may catalyse building trust in deep learning models, we will use some techniques to demonstrate many aspects of explaining convolutional neural networks in a medical imaging context. One important factor influencing clinician{\textquoteright}s trust is how well a model can justify its predictions or outcomes. Clinicians need understandable explanations about why a machine-learned prediction was made so they can assess whether it is accurate and clinically useful. The provision of appropriate explanations has been generally understood to be critical for establishing trust in deep learning models. However, there lacks a clear understanding on what constitutes an explanation that is both understandable and useful across different domains such as medical image analysis, which hampers efforts towards developing explanatory tool sets specifically tailored towards these tasks. In this paper, we investigated two major directions for explaining convolutional neural networks: feature-based post hoc explanatory methods that try to explain already trained and fixed target models and preliminary analysis and choice of the model architecture with an accuracy of 98\% {\textpm} 0.156\% from 36 CNN architectures with different configurations. {\textcopyright} 2022 by the authors. Licensee MDPI, Basel, Switzerland.},
	doi = {10.3390/electronics11111775},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85131637625\&doi=10.3390\%2felectronics11111775\&partnerID=40\&md5=27f0c0e64e6e5a8788f4515f49d6ad01},
	author = {Rguibi, Z. and Hajami, A. and Zitouni, D. and Elqaraoui, A. and Bedraoui, A.}
}
@article {Nakach2022446,
	title = {Deep Hybrid AdaBoost Ensembles for Histopathological Breast Cancer Classification},
	journal = {Lecture Notes in Networks and Systems},
	volume = {468 LNNS},
	year = {2022},
	note = {cited By 0},
	pages = {446-455},
	abstract = {Breast cancer (BC) is the most common diagnosed cancer type and one of the top leading causes of death in women worldwide. The early diagnosis of this type of cancer is the main driver of high survival rate. This paper aims to use homogenous ensemble learning and transfer learning for binary classification of BC histological images over the four-magnification factor (MF) values of the BreakHis dataset: 40X, 100X, 200X, and 400X. The proposed ensembles are implemented using a hybrid architecture (HA) that combines: (1) three of the most recent deep learning (DL) techniques as feature extractors (FE): DenseNet_201, Inception_V3, and MobileNet_V2, and (2) the boosting method AdaBoost with Decision Tree (DT) as a base learner. The study evaluated and compared: the ensembles designed with the same HA but with different number of trees (50, 100, 150 and 200), the single DT classifiers with the best AdaBoost ensembles and the best AdaBoost ensembles of each FE over each MF. The empirical evaluations used: four classification performance criteria (accuracy, recall, precision and F1-score), 5-fold cross-validation, Scott Knott (SK) statistical test to select the best cluster of the outperforming models, and Borda Count voting system to rank the best performing ones. Results showed the potential of combining DL techniques for FE and AdaBoost boosting method to classify BC in malignant and benign tumors, furthermore the AdaBoost ensemble constructed using 200 trees, DenseNet_201 as FE and MF 200X achieved the best mean accuracy value with 90.36\%. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-031-04826-5_45},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85130279063\&doi=10.1007\%2f978-3-031-04826-5_45\&partnerID=40\&md5=59d8d87203f77eed9f4da56cae519226},
	author = {Nakach, F.-Z. and Zerouaoui, H. and Idri, A.}
}
@article {Zerouaoui2022,
	title = {Deep hybrid architectures for binary classification of medical breast cancer images},
	journal = {Biomedical Signal Processing and Control},
	volume = {71},
	year = {2022},
	note = {cited By 16},
	abstract = {The diagnosis of breast cancer in the early stages significantly decreases the mortality rate by allowing the choice of adequate treatment. This study developed and evaluated twenty-eight hybrid architectures combining seven recent deep learning techniques for feature extraction (DenseNet 201, Inception V3, Inception ReseNet V2, MobileNet V2, ResNet 50, VGG16, and VGG19), and four classifiers (MLP, SVM, DT, and KNN) for a binary classification of breast pathological images over the BreakHis and FNAC datasets. The designed architectures were evaluated using: (1) four classification performance criteria (accuracy, precision, recall, and F1-score), (2) Scott Knott (SK) statistical test to cluster the proposed architectures and identify the best cluster of the outperforming architectures, and (3) the Borda Count voting method to rank the best performing architectures. The results showed the potential of combining deep learning techniques for feature extraction and classical classifiers to classify breast cancer in malignant and benign tumors. The hybrid architecture using the MLP classifier and DenseNet 201 for feature extraction (MDEN) was the top performing architecture with higher accuracy values reaching 99\% over the FNAC dataset, 92.61\%, 92\%, 93.93\%, and 91.73\% over the four magnification factor values of the BreakHis dataset: 40X, 100X, 200X, and 400X, respectively. The results of this study recommend the use of hybrid architectures using DenseNet 201 for the feature extraction of the breast cancer histological images because it gave the best results for both datasets BreakHis and FNAC, especially when combined with the MLP classifier. {\textcopyright} 2021 Elsevier Ltd},
	keywords = {accuracy, algorithm, Article, augmentation index, Binary classification, biopsy technique, Breast Cancer, Breast Cancer Histopathological Image Classification, Classification (of information), Classification algorithm, classifier, Cluster computing, clustering algorithm, Clustering algorithms, colloid carcinoma, Computer aided diagnosis, Computer architecture, construct validity, contrast limited adaptive histogram equalization, Convolutional neural network, Convolutional neural networks, deep hybrid architecture, Deep learning, Deep neural networks, Diseases, ductal carcinoma, external validity, Extraction, F1 score, Feature extraction, Features extraction, feed forward neural network, fibroadenoma, fine needle aspiration biopsy, histogram, Histological images, histology, Hybrid architectures, Image classification, image processing, Images processing, internal validity, learning algorithm, Learning algorithms, Learning techniques, lobular carcinoma, Machine learning, measurement precision, Medical imaging, MLP classifiers, Mortality rate, Network architecture, papillary carcinoma, Pathological images, phyllodes tumor, recall, residual neural network, scoring system, Scott Knott, Support vector machines},
	doi = {10.1016/j.bspc.2021.103226},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85125746862\&doi=10.1016\%2fj.bspc.2021.103226\&partnerID=40\&md5=b9b74d0dcb135861bc2e3d820f836efa},
	author = {Zerouaoui, H. and Idri, A.}
}
@article {ElAlaoui2022435,
	title = {Deep Stacked Ensemble for Breast Cancer Diagnosis},
	journal = {Lecture Notes in Networks and Systems},
	volume = {468 LNNS},
	year = {2022},
	note = {cited By 1},
	pages = {435-445},
	abstract = {Breast cancer is considered one of the major public health issues and a leading cause of death among women in the world. Its early diagnosis can significantly help to increase the chances of survival rate. Therefore, this study proposes a deep stacking ensemble technique for binary classification of breast histopathological images over the BreakHis dataset. Initially, to form the base learners of the deep stacking ensemble, we trained seven deep learning (DL) techniques based on pre-trained VGG16, VGG19, ResNet50, Inception_V3, Inception_ResNet_V2, Xception, and MobileNet with a 5-fold cross-validation method. Then, a meta-model was built, a logistic regression algorithm that learns how to best combine the predictions of the base learners. Furthermore, to evaluate and compare the performance of the proposed technique, we used: (1) four classification performance criteria (accuracy, precision, recall, and F1-score), and (2) Scott Knott (SK) statistical test to cluster and identify the outperforming models. Results showed the potential of the stacked deep learning techniques to classify breast cancer images into malignant or benign tumor. The proposed deep stacking ensemble reports an overall accuracy of 93.8\%, 93.0\%, 93.3\%, and 91.8\% over the four magnification factors (MF) values of the BreakHis dataset: 40X, 100X, 200X and 400X, respectively. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-031-04826-5_44},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85130273664\&doi=10.1007\%2f978-3-031-04826-5_44\&partnerID=40\&md5=4246b5750ce0b8a03e4a80001cdfc5e5},
	author = {El Alaoui, O. and Zerouaoui, H. and Idri, A.}
}
@conference {Ajallouda2022,
	title = {Doc2Vec, SBERT, InferSent, and USE Which embedding technique for noun phrases?},
	booktitle = {2022 2nd International Conference on Innovative Research in Applied Science, Engineering and Technology, IRASET 2022},
	year = {2022},
	note = {cited By 4},
	abstract = {Phrase embedding is a technique of representing phrases in vector space. A very high effort has been made to develop this technique to improve tasking in various natural language processing (NLP) applications. The evaluation of phrase embedding has been presented in many studies, but most of them focused on the intrinsic or extrinsic evaluation process regardless of the type of the phrase (noun phrases, Verb phrases...). In the literature, there is no study evaluating the embedding of noun phrases, knowing that this type is used by many NLP applications, such as automatic key-phrase extraction (AKE), information retrieval, and question answering. In this article, we will present an empirical study to compare the most common phrase embedding techniques, to determine the most suitable for representing noun phrases. Dataset used in the comparison process consists of the noun phrases from the Inspec and SemEval2010 datasets, to which we have added their manually defined synonyms. {\textcopyright} 2022 IEEE.},
	keywords = {Embedding technique, Embeddings, Empirical studies, Key-phrases extractions, Natural language processing applications, Natural language processing systems, Noun phrase, Phrase embedding technique, Question Answering, Vector spaces},
	doi = {10.1109/IRASET52964.2022.9738300},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85127985676\&doi=10.1109\%2fIRASET52964.2022.9738300\&partnerID=40\&md5=f274393a28334ba6d338a5dc4e3b5f79},
	author = {Ajallouda, L. and Najmani, K. and Zellou, A. and Benlahmar, E.H.}
}
@article {Douch202269264,
	title = {Edge Computing Technology Enablers: A Systematic Lecture Study},
	journal = {IEEE Access},
	volume = {10},
	year = {2022},
	note = {cited By 1},
	pages = {69264-69302},
	abstract = {With the increasing stringent QoS constraints (e.g., latency, bandwidth, jitter) imposed by novel applications (e.g., e-Health, autonomous vehicles, smart cities, etc.), as well as the rapidly increasing number of connected IoT (Internet of Things) devices, the core network is becoming increasingly congested. To cope with those constraints, Edge Computing (EC) is emerging as an innovative computing paradigm that leverages Cloud computing and brings it closer to the customer. {\textquoteright}EC{\textquoteright} refers to transferring computing power and intelligence from the central Cloud to the network{\textquoteright}s Edge. With that, EC promotes the idea of processing and caching data at the Edge, thus reducing network congestion and latency. This paper presents a detailed, thorough, and well-structured assessment of Edge Computing and its enabling technologies. Initially, we start by defining EC from the ground up, outlining its architectures and evolution from Cloudlets to Multi-Access Edge Computing. Next, we survey recent studies on the main cornerstones of an EC system, including resource management, computation offloading, data management, network management, etc. Besides, we emphasized EC technology enablers, starting with Edge Intelligence, the branch of Artificial Intelligence (AI) that integrates AI models at resource-constrained edge nodes with significant heterogeneity and mobility. Then, moving on to 5G and its empowering technologies, we explored how EC and 5G complement each other. After that, we studied virtualization and containerization as promising hosting runtime for edge applications. Further to that, we delineated a variety of EC use-case scenarios, e.g., smart cities, e-Health, military applications, etc. Finally, we concluded our survey by highlighting the role of EC integration with future concerns regarding green energy and standardization. {\textcopyright} 2013 IEEE.},
	keywords = {5g, 5g mobile communication, 5G mobile communication systems, Cloud-computing, computation offloading, Containerization, Containers, Data handling, Edge computing, Edge intelligence, Fog computing, Information management, Internet of things, License, Military applications, Mobile communications, Multi-access edge computing, Multiaccess, Quality of service, Quality-of-service, Surveys},
	doi = {10.1109/ACCESS.2022.3183634},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85132750947\&doi=10.1109\%2fACCESS.2022.3183634\&partnerID=40\&md5=88667ef450dd686759983878427de051},
	author = {Douch, S. and Abid, M.R. and Zine-Dine, K. and Bouzidi, D. and Benhaddou, D.}
}
@article {Rassam2022387,
	title = {Empirical Study: What is the Best N-Gram Graphical Indexing Technique},
	journal = {Lecture Notes in Networks and Systems},
	volume = {489 LNNS},
	year = {2022},
	note = {cited By 0},
	pages = {387-398},
	abstract = {Recent research shows that indexing techniques, such as n-gram models, are useful at a wide variety of software engineering tasks, e.g., data extraction, document indexing, etc. However, these models require some numerous parameters. Moreover, the different ways one can extract data essentially yield different models. In this paper, we focus on n-gram models and evaluate how the use different set of methods and n values impact the predicting ability of these models. Thus, we compare the use of multiple techniques and sets of different parameters (n values character gram and word gram) with the aim of identifying the most appropriate indexing technique. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-031-07969-6_29},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135074852\&doi=10.1007\%2f978-3-031-07969-6_29\&partnerID=40\&md5=76e738e6a8c5330d57d78e968047e57f},
	author = {Rassam, L. and Zellou, A. and Rachad, T.}
}
@article {Bourja2022994,
	title = {End-to-End Car Make and Model Classification using Compound Scaling and Transfer Learning},
	journal = {International Journal of Advanced Computer Science and Applications},
	volume = {13},
	number = {5},
	year = {2022},
	note = {cited By 0},
	pages = {994-1001},
	abstract = {Recently, Morocco has started to invest in IoT systems to transform our cities into smart cities that will promote economic growth and make life easier for citizens. One of the most vital addition is intelligent transportation systems which represent the foundation of a smart city. However, the problem often faced in such systems is the recognition of entities, in our case, car and model makes. This paper proposes an approach that identifies makes and models for cars using transfer learning and a workflow that first enhances image quality and quantity by data augmentation and then feeds the newly generated data into a deep learning model with a scaling feature{\textendash}that is, compound scaling. In addition, we developed a web interface using the FLASK API to make real-time predictions. The results obtained were 80\% accuracy, fine-tuning it to an accuracy rate of 90\% on unseen data. Our framework is trained on the commonly used Stanford Cars dataset. {\textcopyright} 2022. International Journal of Advanced Computer Science and Applications. All Rights Reserved.},
	keywords = {Application programming interfaces (API), Compound scaling, Deep learning, Economic growths, Economics, End to end, Image enhancement, Intelligent systems, Intelligent transportation systems, Internet of things, IOT, Model classification, Scalings, Smart city, Transfer learning, Vehicle classification},
	doi = {10.14569/IJACSA.2022.01305111},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85131410221\&doi=10.14569\%2fIJACSA.2022.01305111\&partnerID=40\&md5=aeb1c5a894ab70005066f491ebf3623c},
	author = {Bourja, O. and Maach, A. and Zannouti, Z. and Derrouz, H. and Mekhzoum, H. and Abdelali, H.A. and Thami, R.O.H. and Bourzeix, F.}
}
@article {Radouane20221460,
	title = {Fusion of Gabor filter and steerable pyramid to improve iris recognition system},
	journal = {IAES International Journal of Artificial Intelligence},
	volume = {11},
	number = {4},
	year = {2022},
	note = {cited By 0},
	pages = {1460-1468},
	abstract = {Iris recognition system is a technique of identifying people using their distinctive features. Generally, this technique is used in security, because it offers a good reliability. Different researchers have proposed new methods for iris recognition system to increase its effectiveness. In this paper, we propose a new method for iris recognition based on Gabor filter and steerable pyramid decomposition. It{\textquoteright}s an efficient and accurate linear multi-scale, multi-orientation image decomposition to capture texture details of an image. At first, the iris image is segmented, normalized and decomposed by Gabor filter and steerable pyramid method. Multiple sub-band are generated by applying steerable pyramid on the input image. High frequency sub-band is ignored to eliminate noise and increase the accuracy. The method was validated using Chinese Academy of Sciences Institute of Automation (CASIA-v4), Indian Institute of Technology Delhi (IITD) and University of Phoenix Online (UPOL) databases. The performance of the proposed method is better than the most methods in the literature. The proposed algorithm provides accuracy of 99.99\%. False acceptance rate (FAR), equal error rate (EER) and genuine acceptance rate (GAR) have also been improved. {\textcopyright} 2022, Institute of Advanced Engineering and Science. All rights reserved.},
	doi = {10.11591/ijai.v11.i4.pp1460-1468},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85136268629\&doi=10.11591\%2fijai.v11.i4.pp1460-1468\&partnerID=40\&md5=54ad763c812d3874d3c1e97ff0cfc8f8},
	author = {Radouane, M. and Zouggari, N.I. and Amraoui, A. and Amraoui, M.}
}
@conference {Rassam202278,
	title = {Fuzzy Logic-based N-gram Graph Technique for Evaluating Textual Documents Indexes},
	booktitle = {2022 4th International Conference on Computer Communication and the Internet, ICCCI 2022},
	year = {2022},
	note = {cited By 0},
	pages = {78-82},
	abstract = {Fuzzy logic is a term that is used more and more often by researchers specialized in information retrieval and indexing. It is supposed to fill the gaps of the current domain by adding meaning to the information. In this article, the main goal is introducing the fuzzy logic approach in the field of the representation of a corpus of documents, more precisely in the proposal of a new method based on fuzzy functions that allow the evaluation of the generated indexes of a specific corpus.The evaluation is based on calculating the degrees of relevance of a term in relation to another whether it is in the same document of the corpus or in two or more completely different documents of the same corpus. {\textcopyright} 2022 IEEE.},
	keywords = {{\textquoteright}current, Computer circuits, Degree of relevance, Fuzzy function, Fuzzy logic, Fuzzy logic approach, Fuzzy-Logic, Graph technique, Indexing, Indexing (of information), N-grams, Textual documents},
	doi = {10.1109/ICCCI55554.2022.9850268},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85137083735\&doi=10.1109\%2fICCCI55554.2022.9850268\&partnerID=40\&md5=3d771186a1a254dd249e3647a64918b2},
	author = {Rassam, L. and Aldiebesghanem, C. and Zellou, A. and Lahmar, E.B.}
}
@article {Echihabi20222005,
	title = {Hercules Against Data Series Similarity Search},
	journal = {Proceedings of the VLDB Endowment},
	volume = {15},
	number = {10},
	year = {2022},
	note = {cited By 3},
	pages = {2005-2018},
	abstract = {We propose Hercules, a parallel tree-based technique for exact similarity search on massive disk-based data series collections. We present novel index construction and query answering algorithms that leverage different summarization techniques, carefully schedule costly operations, optimize memory and disk accesses, and exploit the multi-threading and SIMD capabilities of modern hardware to perform CPU-intensive calculations. We demonstrate the superiority and robustness of Hercules with an extensive experimental evaluation against state-of-the-art techniques, using many synthetic and real datasets, and query workloads of varying difficulty. The results show that Hercules performs up to one order of magnitude faster than the best competitor (which is not always the same). Moreover, Hercules is the only index that outperforms the optimized scan on all scenarios, including the hard query workloads on disk-based datasets. {\textcopyright} 2022, VLDB Endowment., All rights reserved.},
	keywords = {CPU-intensive, Data series, Disk-based, Exact similarity searches, Experimental evaluation, Index construction, Multi-threading, Query answering, Similarity search, Tree-based, Trees (mathematics)},
	doi = {10.14778/3547305.3547308},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85132784935\&doi=10.14778\%2f3547305.3547308\&partnerID=40\&md5=539332f4b18822ebf450dd3c3f5fda5d},
	author = {Echihabi, K. and Fatourou, P. and Zoumpatianos, K. and Palpanas, T. and Benbrahim, H.}
}
@article {Nakach20221043,
	title = {Hybrid deep boosting ensembles for histopathological breast cancer classification},
	journal = {Health and Technology},
	volume = {12},
	number = {6},
	year = {2022},
	note = {cited By 0},
	pages = {1043-1060},
	abstract = {Purpose: Breast cancer (BC) is the most common diagnosed cancer type and one of the top leading causes of death in women worldwide. This paper aims to investigate ensemble learning and transfer learning for binary classification of BC histological images over the four-magnification factor (MF) values of the BreakHis dataset: 40X, 100X, 200X, and 400X. Methods: The proposed homogeneous ensembles are implemented using a hybrid architecture that combines: (1) three of the most recent deep learning (DL) techniques for feature extraction: DenseNet_201, MobileNet_V2, and Inception_V3, and (2) four of the most popular boosting methods for classification: AdaBoost (ADB), Gradient Boosting Machine (GBM), LightGBM (LGBM) and XGBoost (XGB) with Decision Tree (DT) as a base learner. The study evaluated and compared: (1) a set of boosting ensembles designed with the same hybrid architecture and different number of trees (50, 100, 150 and 200); (2) different boosting methods, and (3) the single DT classifier with the best boosting ensembles. The empirical evaluations used: four classification performance criteria (accuracy, recall, precision and F1-score), the fivefold cross-validation, Scott Knott statistical test to select the best cluster of the outperforming models, and Borda Count voting system to rank the best performing ones. Results: The best boosting ensemble achieved an accuracy value of 92.52\% and it was constructed using XGB with 200 trees and Inception_V3 as feature extractor (FE). Conclusions: The results showed the potential of combining DL techniques for feature extraction and boosting ensembles to classify BC in malignant and benign tumors. {\textcopyright} 2022, The Author(s) under exclusive licence to International Union for Physical and Engineering Sciences in Medicine (IUPESM).},
	doi = {10.1007/s12553-022-00709-z},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85141693839\&doi=10.1007\%2fs12553-022-00709-z\&partnerID=40\&md5=9e968402920eaed7fb6aaa79efc60f1a},
	author = {Nakach, F.-Z. and Zerouaoui, H. and Idri, A.}
}
@article {Rhanoui20222809,
	title = {A hybrid recommender system for patron driven library acquisition and weeding},
	journal = {Journal of King Saud University - Computer and Information Sciences},
	volume = {34},
	number = {6},
	year = {2022},
	note = {cited By 2},
	pages = {2809-2819},
	abstract = {Nowadays the explosion of information sources has shaped how library users access information and provide feedback on their preferences. Therefore, faced with this explosion and the blossoming of digital libraries, modern libraries must take up the challenge of meeting the needs of their users and considering their opinions and preferences in order to offer them adequate resources and henceforth eliminate those that are unsatisfactory. Almost all library recommender systems aim to provide users with items of interest to them. However, despite its definite interest, the staff-oriented adaptation and application of this revolutionary technique to the collection development process is still in an embryonic stage. We propose a patron-driven hybrid library recommender system that uses machine learning techniques to recommend and assist in the acquisition and weeding decision-making operations by extracting and analyzing users{\textquoteright} opinions and ratings. The recommender system is applied and validated in a real national library case using Amazon{\textquoteright}s digital library and the library{\textquoteright}s catalog as a data source. {\textcopyright} 2020 The Authors},
	doi = {10.1016/j.jksuci.2020.10.017},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85096428211\&doi=10.1016\%2fj.jksuci.2020.10.017\&partnerID=40\&md5=49af7074b1295a09ce952c01fd4c7f92},
	author = {Rhanoui, M. and Mikram, M. and Yousfi, S. and Kasmi, A. and Zoubeidi, N.}
}
@article {Najmani2022556,
	title = {The Impact of the k-Nearest Neighbor Parameters in Collaborative Filtering Recommender Systems},
	journal = {Lecture Notes in Networks and Systems},
	volume = {489 LNNS},
	year = {2022},
	note = {cited By 0},
	pages = {556-567},
	abstract = {Recommender Systems (RS) have become very important recently, they are a main component of many applications in different fields. They aim to give beneficial information according to the profile of each user among the huge existing online information. RS are based on several approaches to provide the best results and give satisfaction to the active user. Collaborative filtering is one of these approaches. It helps to choose a product according to the consumer{\textquoteright}s preference from many and various choices. It uses the k-Nearest Neighbor (kNN) technique for the extraction of similar users from the group of users. In this paper, we will study the effect of the parameters of the kNN algorithm on the obtained results. For that, we have varied the value of k, then we have measured for each value the prediction accuracy, using the Root Mean Square Error (RMSE), and the Mean Absolute Error (MAE) metrics. The experiments are carried out also to find the value of k which gives good results in both metrics. Then we have calculated also the RMSE and MAE metrics for different similarities in order to find the similarity which gives good results compared to others. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-031-07969-6_42},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135066110\&doi=10.1007\%2f978-3-031-07969-6_42\&partnerID=40\&md5=c48c9d53d83b702abcc99c35254e6b72},
	author = {Najmani, K. and Ajallouda, L. and Benlahmar, E.H. and Sael, N. and Zellou, A.}
}
@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 {Ajallouda2022283,
	title = {KP-USE: An Unsupervised Approach for Key-Phrases Extraction from Documents},
	journal = {International Journal of Advanced Computer Science and Applications},
	volume = {13},
	number = {4},
	year = {2022},
	note = {cited By 4},
	pages = {283-289},
	abstract = {Automatic key-phrase extraction (AKE) is one of the most popular research topics in the field of natural language processing (NLP). Several techniques were used to extract the key-phrases: statistical, graph-based, classification algorithms, deep learning, and embedding techniques. AKE approaches that use embedding techniques are based on calculating the semantic similarity between a vector representing the document and the vectors representing the candidate phrases. However, most of these methods only give acceptable results in short texts such as abstracts paper, but on the other hand, their performance remains weak in long documents because it is represented by a single vector. Generally, the key phrases of a document are often expressed in certain parts of the document as, the title, the summary, and to a lesser extent in the introduction and the conclusion, and not of the entire document. For this reason, we propose in this paper KP-USE. A method extracts key-phrases from long documents based on the semantic similarity of candidate phrases to parts of the document containing keyphrases. KP-USE makes use of the Universal Sentence Encoder (USE) as an embedding method for text representation. We evaluated the performance of the proposed method on three datasets containing long papers, namely, NUS, Krapivin2009, and SemEval2010, where the results showed its performance outperforms recent AKE methods which are based on embedding techniques. {\textcopyright} 2022. All Rights Reserved.},
	keywords = {Deep learning, Embedding technique, Embeddings, Extraction, Graph-based classifications, Graphic methods, Key-phrase, Key-phrases extractions, Natural language processing systems, Performance, Research topics, Semantic similarity, Semantics, Signal encoding, Statistical graphs, Universal sentence encoder, Unsupervised approaches},
	doi = {10.14569/IJACSA.2022.0130433},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85129921696\&doi=10.14569\%2fIJACSA.2022.0130433\&partnerID=40\&md5=880d07ce539281dced3a51a82de6a16c},
	author = {Ajallouda, L. and Fagroud, F.Z. and Zellou, A. and Lahmar, E.B.}
}
@article {Zerouaoui20221,
	title = {A new approach for histological classification of breast cancer using deep hybrid heterogenous ensemble},
	journal = {Data Technologies and Applications},
	year = {2022},
	note = {cited By 0},
	pages = {1-34},
	abstract = {Purpose: Hundreds of thousands of deaths each year in the world are caused by breast cancer (BC). An early-stage diagnosis of this disease can positively reduce the morbidity and mortality rate by helping to select the most appropriate treatment options, especially by using histological BC images for the diagnosis. Design/methodology/approach: The present study proposes and evaluates a novel approach which consists of 24 deep hybrid heterogenous ensembles that combine the strength of seven deep learning techniques (DenseNet 201, Inception V3, VGG16, VGG19, Inception-ResNet-V3, MobileNet V2 and ResNet 50) for feature extraction and four well-known classifiers (multi-layer perceptron, support vector machines, K-nearest neighbors and decision tree) by means of hard and weighted voting combination methods for histological classification of BC medical image. Furthermore, the best deep hybrid heterogenous ensembles were compared to the deep stacked ensembles to determine the best strategy to design the deep ensemble methods. The empirical evaluations used four classification performance criteria (accuracy, sensitivity, precision and F1-score), fivefold cross-validation, Scott{\textendash}Knott (SK) statistical test and Borda count voting method. All empirical evaluations were assessed using four performance measures, including accuracy, precision, recall and F1-score, and were over the histological BreakHis public dataset with four magnification factors (40{\texttimes}, 100{\texttimes}, 200{\texttimes} and 400{\texttimes}). SK statistical test and Borda count were also used to cluster the designed techniques and rank the techniques belonging to the best SK cluster, respectively. Findings: Results showed that the deep hybrid heterogenous ensembles outperformed both their singles and the deep stacked ensembles and reached the accuracy values of 96.3, 95.6, 96.3 and 94 per cent across the four magnification factors 40{\texttimes}, 100{\texttimes}, 200{\texttimes} and 400{\texttimes}, respectively. Originality/value: The proposed deep hybrid heterogenous ensembles can be applied for the BC diagnosis to assist pathologists in reducing the missed diagnoses and proposing adequate treatments for the patients. {\textcopyright} 2022, Emerald Publishing Limited.},
	keywords = {Borda Count, Breast Cancer, Computer aided diagnosis, Convolutional neural network, Convolutional neural networks, Decision trees, Deep convolutional neural network, Deep neural networks, Digital pathologies, Diseases, Empirical evaluations, Ensemble methods, F1 scores, Histological images, Image classification, Images processing, Medical imaging, Nearest neighbor search, Statistical tests, Support vector machines},
	doi = {10.1108/DTA-05-2022-0210},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85140306559\&doi=10.1108\%2fDTA-05-2022-0210\&partnerID=40\&md5=52f113ae4cf2b14566d0b92c7140ffe1},
	author = {Zerouaoui, H. and Idri, A. and El Alaoui, O.}
}
@article {Benabbes202261,
	title = {New Automatic Hybrid Approach for Tracking Learner Comprehension Progress in the LMS},
	journal = {International Journal of Interactive Mobile Technologies},
	volume = {16},
	number = {19},
	year = {2022},
	note = {cited By 0},
	pages = {61-80},
	abstract = {Learning style is a significant learner-difference factor. Each learner has a preferred learning style and a different way of processing and understanding the novelty. In this paper, a new approach that automatically identifies learners learning styles based on their interaction with the Learning Management System (LMS) is introduced. To implement this approach, the traces of 920 enrolled learners in three agronomy courses were exploited using an unsupervised clustering method to group learners according to their degree of engagement. The decision tree classification algorithm relies on the decision rules construction, which is widely adopted to identify the accurate learning style. As the lack of good decision rules would lead to learning style misclassification, the Felder-Silverman Learning Style Model (FSLSM) is used as it is among the most adopted models in the technology of quality improvement process. The results of this research highlight that most learners prefer the global learning style {\textcopyright} 2022, International Journal of Interactive Mobile Technologies.All Rights Reserved.},
	doi = {10.3991/ijim.v16i19.33733},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85140748669\&doi=10.3991\%2fijim.v16i19.33733\&partnerID=40\&md5=4c17d51043684f46667ce010388153ce},
	author = {Benabbes, K. and Hmedna, B. and Housni, K. and Zellou, A. and El Mezouary, A.}
}
@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 {Ajallouda20221601,
	title = {Present and absent keyphrases extraction: an approach based on sentence embedding},
	journal = {Indonesian Journal of Electrical Engineering and Computer Science},
	volume = {28},
	number = {3},
	year = {2022},
	note = {cited By 0},
	pages = {1601-1612},
	abstract = {The automatic keyphrases extraction (AKE) of a document is any expression by which we can learn its content without having to read it. Keyphrases are exploited in natural language processing (NLP) applications. These phrases are often mentioned in the document but there may be some keyphrases that are not mentioned. In the field of AKE, researchers have exploited many techniques, such as statistical calculation, deep learning algorithms, graph representation, and sentence embedding techniques. Approaches that exploit embedding techniques calculate the similarity between a document and a candidate keyphrase, where similar phrases to the document are considered as keyphrases. Representing the document by a single vector makes its performance poor, especially in long documents. This is in addition to the inability of these methods to generate absent keyphrases. In order to overcome these problems, our paper proposes an unsupervised approach to AKE, based on the universal sentence encoder (USE) to represent candidate keyphrases and parts of the document probably containing keyphrases. Our method also generates keyphrases not mentioned in the text. We compared the performance of the proposed approach with other methods based on embedding techniques, where the results showed the superiority of our approach especially in long documents. {\textcopyright} 2022 Institute of Advanced Engineering and Science. All rights reserved.},
	doi = {10.11591/ijeecs.v28.i3.pp1601-1612},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85140265191\&doi=10.11591\%2fijeecs.v28.i3.pp1601-1612\&partnerID=40\&md5=b9dbdcf5c9109b2737938f306a2aee4f},
	author = {Ajallouda, L. and Zellou, A.}
}
@article {Nakach20223,
	title = {Random Forest Based Deep Hybrid Architecture for Histopathological Breast Cancer Images Classification},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {13376 LNCS},
	year = {2022},
	note = {cited By 0},
	pages = {3-18},
	abstract = {Breast cancer is the most common cancer in women worldwide. While the early diagnosis and treatment can significantly reduce the mortality rate, it is a challenging task for pathologists to accurately estimate the cancerous cells and tissues. Therefore, machine learning techniques are playing a significant role in assisting pathologists and improving the diagnosis results. This paper proposes a hybrid architecture that combines: three of the most recent deep learning techniques for feature extraction (DenseNet_201, Inception_V3, and MobileNet_V2) and random forest to classify breast cancer histological images over the BreakHis dataset with its four magnification factors: 40X, 100X, 200X and 400X. The study evaluated and compared: (1) the developed random forest models with their base learners, (2) the designed random forest models with the same architecture but with a different number of trees, (3) the decision tree classifiers with the best random forest models and (4) the best random forest models of each feature extractor. The empirical evaluations used: four classification performance criteria (accuracy, sensitivity, precision and F1-score), 5-fold cross-validation, Scott Knott statistical test, and Borda Count voting method. The best random forest model achieved an accuracy mean value of 85.88\%, and was constructed using 9 trees, 200X as a magnification factor, and Inception_V3 as a feature extractor. The experimental results demonstrated that combining random forest with deep learning models is effective for the automatic classification of malignant and benign tumors using histopathological images of breast cancer. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	keywords = {Breast Cancer, Classification (of information), Decision trees, Deep learning, Diagnosis, Diseases, early diagnosis, Feature extractor, hybrid, Hybrid architectures, Image classification, Images classification, Learning systems, Magnification factors, Medical imaging, Random forest modeling, Random forests, Transfer learning},
	doi = {10.1007/978-3-031-10450-3_1},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135002675\&doi=10.1007\%2f978-3-031-10450-3_1\&partnerID=40\&md5=892757314e050f81e9b0dba117f2d64a},
	author = {Nakach, F.-Z. and Zerouaoui, H. and Idri, A.}
}
@article {Benabbes20221017,
	title = {Recommendation System Issues, Approaches and Challenges Based on User Reviews},
	journal = {Journal of Web Engineering},
	volume = {21},
	number = {4},
	year = {2022},
	note = {cited By 0},
	pages = {1017-1054},
	abstract = {With the ever-increasing volume of online information, recommender systems have been effective as a strategy to overcome information overload. They have a wide range of applications in many fields, including e-learning, e-commerce, e-government and scientific research. Recommender systems are search engines that are based on the user{\textquoteright}s browsing history to suggest a product that expresses their interests. Being usually in the form of textual comments and ratings, such reviews are a valuable source of information about users{\textquoteright} perceptions. Recommender systems (RSs) apply various approaches to predict users{\textquoteright} interest on information, products and services among a huge amount of available items. In this paper, we will describe the recommender system, discuss ongoing research in this field, and address the challenges, limitations and the techniques adopted. This paper also discusses how review texts are interpreted to solve some of the major problems with traditional recommendation techniques. To assess the value of a recommender system, qualitative evaluation measures are discussed as well in this research. Based on a series of selected articles published between 2008 and 2020, the study allowed us to conclude that the efficiency of RSs is strongly centered on the control of information context, the operated exploration algorithm, the method, and the type of processed data in addition to the information on users{\textquoteright} trust. {\textcopyright} 2022 River Publishers. All rights reserved.},
	doi = {10.13052/jwe1540-9589.2143},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85131073458\&doi=10.13052\%2fjwe1540-9589.2143\&partnerID=40\&md5=56b7da2c9aa6d4c44328fa667db5ef0a},
	author = {Benabbes, K. and Housni, K. and El Mezouary, A. and Zellou, A.}
}
@article {Radouane20223507,
	title = {A ROBUST WATERMARKING SCHEME BASED ON DCT, IWT and SVD WITH OPTIMAL BLOCK},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {100},
	number = {11},
	year = {2022},
	note = {cited By 0},
	pages = {3507-3521},
	abstract = {Signal processing{\textquoteright}s impact on development of digital media technologies have become a hot topic. The increased of computer network and the growth of the Internet have facilitated the production and distribution of unauthorized copies of multimedia information (text, image, sound, and video). To ensure multimedia security, researchers are focusing on digital image watermarking. With this new concept, the watermark is not just hiding in an image, but it{\textquoteright}s marked indelibly. In this paper a robust method of digital images watermarking based on combination of DCT, IWT and SVD is proposed. At first, Visual cryptography is used to encrypt the watermark image. Then DCT is applied to it and to the host image. IWT and SVD are applied on DCT coefficients of both watermark and host images. After that, the watermarking process is done by embedding singular values of watermark image to the singular values of host image. Moreover, the obtained watermarked images are subjected to different attacks to improve the robustness of the proposed scheme. Finally, the extraction process is based on watermarked image and the reverse method of embedding process to reconstruct the original watermark. The performance is evaluated under various attacks and experimental results show that our algorithm provides a high level of robustness and imperceptibility than the state-of-the-art methods. {\textcopyright} 2022 Little Lion Scientific.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85133519929\&partnerID=40\&md5=7957ed0e26c3399d0ba554b9a2f98aa5},
	author = {Radouane, M. and Zouggari, N.I. and Amraoui, A. and Amraoui, M.}
}
@conference {Reda2022,
	title = {SMDQM-Social Media Data Quality Assessment Model},
	booktitle = {2022 2nd International Conference on Innovative Research in Applied Science, Engineering and Technology, IRASET 2022},
	year = {2022},
	note = {cited By 0},
	abstract = {Social media has taken a dominant place in people{\textquoteright}s lives since it become more than just a mode of communication between individuals. They regularly share their daily activities, experiences, and exchange interests and opinions on social media sites, leading to a flood of information that can be used by consumers. However, the reduced posting barriers, no operational costs and easy-to-use interactive interfaces have combined to create a variety of data quality issues in social media, making it difficult to obtain relevant, timely and accurate data. Given the increasing use of social media by users to obtain news and information first hand, they are required to filter a significant volume of data to reach the most satisfying to their request, therefore we can say that the process is more qualitative than quantitative. This paper proposes a new classification of data quality dimensions towards a social media data quality model called SMDQM(Social Media Data Quality Model), for this the quality of social media data is discussed, then we present the steps involved to create our model SMDQM. This attempt will be established by considering and discussing a state of the art in the field of social media and data quality. {\textcopyright} 2022 IEEE.},
	keywords = {Assessment, Daily activity, data quality, Data quality assessment, Data quality models, Data reduction, Interactive interfaces, Quality assessment model, Quality modeling, social media, Social media datum, Social networking (online)},
	doi = {10.1109/IRASET52964.2022.9738330},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85127964567\&doi=10.1109\%2fIRASET52964.2022.9738330\&partnerID=40\&md5=566d4361e0b4742bd3c69530f2eaf99f},
	author = {Reda, O. and Zellou, A.}
}
@article {ElJai2022,
	title = {Socio-economic analysis of short-term trends of COVID-19: modeling and data analytics},
	journal = {BMC Public Health},
	volume = {22},
	number = {1},
	year = {2022},
	note = {cited By 0},
	abstract = {Background: COVID-19 caused a worldwide outbreak leading the majority of human activities to a rough breakdown. Many stakeholders proposed multiple interventions to slow down the disease and number of papers were devoted to the understanding the pandemic, but to a less extend some were oriented socio-economic analysis. In this paper, a socio-economic analysis is proposed to investigate the early-age effect of socio-economic factors on COVID-19 spread. Methods: Fifty-two countries were selected for this study. A cascade algorithm was developed to extract the R0 number and the day J*; these latter should decrease as the pandemic flattens. Subsequently, R0 and J* were modeled according to socio-economic factors using multilinear stepwise-regression. Results: The findings demonstrated that low values of days before lockdown should flatten the pandemic by reducing J*. Hopefully, DBLD is only parameter to be tuned in the short-term; the other socio-economic parameters cannot easily be handled as they are annually updated. Furthermore, it was highlighted that the elderly is also a major influencing factor especially because it is involved in the interactions terms in R0 model. Simulations proved that the health care system could improve the pandemic damping for low elderly. In contrast, above a given elderly, the reproduction number R0 cannot be reduced even for developed countries (showing high HCI values), meaning that the disease{\textquoteright}s severity cannot be smoothed regardless the performance of the corresponding health care system; non-pharmaceutical interventions are then expected to be more efficient than corrective measures. Discussion: The relationship between the socio-economic factors and the pandemic parameters R0 and J* exhibits complex relations compared to the models that are proposed in the literature. The quadratic regression model proposed~here has discriminated the most influencing parameters within the following approximated order, DLBL, HCI, Elderly, Tav, CO2, and WC as first order, interaction, and second order terms. Conclusions: This modeling allowed the emergence of interaction terms that don{\textquoteright}t appear in similar studies; this led to emphasize more complex relationship between the infection spread and the socio-economic factors. Future works will focus on enriching the datasets and the optimization of the controlled parameters to short-term slowdown of similar pandemics. {\textcopyright} 2022, The Author(s).},
	keywords = {aged, communicable disease control, COVID-19, Data Science, epidemiology, human, Humans, SARS-CoV-2, Socioeconomic Factors, socioeconomics},
	doi = {10.1186/s12889-022-13788-4},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85136870489\&doi=10.1186\%2fs12889-022-13788-4\&partnerID=40\&md5=319bf3cc0bc571a1c7ddf78cab18333b},
	author = {El Jai, M. and Zhar, M. and Ouazar, D. and Akhrif, I. and Saidou, N.}
}
@article {Ajallouda202231,
	title = {A Systematic Literature Review of Keyphrases Extraction Approaches},
	journal = {International Journal of Interactive Mobile Technologies},
	volume = {16},
	number = {16},
	year = {2022},
	note = {cited By 0},
	pages = {31-58},
	abstract = {The keyphrases of a document are the textual units that characterize its content such as the topics it addresses, its ideas, their field, etc. Thousands of books, articles and web pages are published every day. Manually extracting keyphrases is a tedious task and takes a lot of time. Automatic keyphrases extraction is an area of text mining that aims to identify the most useful and important phrases that give meaning to the content of a document. Keyphrases can be used in many Natural Language Processing (NLP) applications, such as text summarization, text clustering and text classification. This article provides a Systematic Literature Review (SLR) to investigate, analyze, and discuss existing relevant contributions and efforts that use new concepts and tools to improve keyphrase extraction. We have studied the supervised and unsupervised approaches to extracting keyphrases published in the period 2015{\textendash}2022. We have also identified the steps most commonly used by the different approaches. Additionally, we looked at the criteria that should be evaluated to improve the accuracy of keyphrases extraction. Each selected approach was evaluated for its ability to extract keyphrases. Our findings highlight the importance of keyphrase extraction, and provide researchers and practitioners with information about proposed solutions and their limitations, which contributes to extract keyphrases in a powerful and meaningful way effective {\textcopyright} 2022, International Journal of Interactive Mobile Technologies.All Rights Reserved.},
	doi = {10.3991/ijim.v16i16.33081},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85137632849\&doi=10.3991\%2fijim.v16i16.33081\&partnerID=40\&md5=cf158a54305193c3291a26b2c49d765f},
	author = {Ajallouda, L. and Fagroud, F.Z. and Zellou, A. and Benlahmar, E.H.}
}
@article {Zizaan2022425,
	title = {Systematic Map of Machine Learning Based Breast Cancer Screening},
	journal = {Lecture Notes in Networks and Systems},
	volume = {468 LNNS},
	year = {2022},
	note = {cited By 0},
	pages = {425-434},
	abstract = {Although Breast Cancer (BC) deaths have decreased over time, it is still the second largest cause of cancer death among women. With the technical revolution of Artificial Intelligence (AI), and the big healthcare data that is becoming more of a reality, many researchers have attempted to employ Machine Learning (ML) techniques to gain a better understanding of this disease. The present paper is a systematic mapping study of the application of ML techniques in Breast Cancer Screening (BCS) between the years 2011 and early 2021. Out of 129 candidate papers we retrieved from six digital libraries, a total of 66 papers were selected according to 5 criteria: year and publication venue, paper type, BCS modality, and empirical type. The results show that classification was the most used ML objective, and that mammography was the most frequent BCS modality used. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-031-04826-5_43},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85130248734\&doi=10.1007\%2f978-3-031-04826-5_43\&partnerID=40\&md5=4017a93b47d63e929eb5d2e71e97f5f0},
	author = {Zizaan, A. and Idri, A.}
}
@article {Ajallouda2022466,
	title = {Toward a New Process for Candidate Key-Phrases Extraction},
	journal = {Lecture Notes in Networks and Systems},
	volume = {455 LNNS},
	year = {2022},
	note = {cited By 3},
	pages = {466-474},
	abstract = {Key-phrases in a document are the terms that allow us to have or know an idea of its content without having to read it. They can be used in many Natural Language Processing (NLP) applications, such as text summarization, machine translation, and text classification. These phrases are selected from a set of terms in the document called candidate key-phrases. Thus, any flaws that may arise during the selection of candidate phrases may affect the automatic key-phrase extraction (AKE). Despite the importance of identifying candidate key-phrases in the AKE process, we found a very limited number of researchers interested in identifying their features in the document. In this paper, we will present the features that will allow the identification of candidate key-phrases, based on the study and analysis of the features of 60,000 key-phrases manually selected from five different datasets. To improve the performance of AKE approaches. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-031-02447-4_48},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85130348254\&doi=10.1007\%2f978-3-031-02447-4_48\&partnerID=40\&md5=7bc1168842009b4c70c8fea6cc905514},
	author = {Ajallouda, L. and Hourrane, O. and Zellou, A. and Benlahmar, E.H.}
}
@article {Zerouaoui2021186,
	title = {Breast Fine Needle Cytological Classification Using Deep Hybrid Architectures},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {12950 LNCS},
	year = {2021},
	note = {cited By 6},
	pages = {186-202},
	abstract = {Diagnosis of breast cancer in the early stages allows to significantly decrease the mortality rate by allowing to choose the adequate treatment. This paper develops and evaluates twenty-eight hybrid architectures combining seven recent deep learning techniques for feature extraction (DenseNet 201, Inception V3, Inception ReseNet V2, MobileNet V2, ResNet 50, VGG16 and VGG19), and four classifiers (MLP, SVM, DT and KNN) for binary classification of breast cytological images over the FNAC dataset. To evaluate the designed architectures, we used: (1) four classification performance criterias (accuracy, precision, recall and F1-score), (1) Scott Knott (SK) statistical test to cluster the developed architectures and identify the best cluster of the outperforming architectures, and (2) Borda Count voting method to rank the best performing architectures. Results showed the potential of combining deep learning techniques for feature extraction and classical classifiers to classify breast cancer in malignant and benign tumors. The hybrid architectures using MLP classifier and DenseNet 201 for feature extraction were the top performing architectures with a higher accuracy value reaching 99\% over the FNAC dataset. As results, the findings of this study recommend the use of the hybrid architectures using DenseNet 201 for the feature extraction of the breast cancer cytological images since it gave the best results for the FNAC data images, especially if combined with the MLP classifier. {\textcopyright} 2021, Springer Nature Switzerland AG.},
	keywords = {Binary classification, Breast Cancer, Classification (of information), Classification performance, Cluster computing, Clustering algorithms, Computer aided diagnosis, Computer architecture, Convolutional neural networks, Deep neural networks, Diseases, Extraction, Feature extraction, Features extraction, Histological images, Hybrid architectures, Image classification, Images processing, Learning algorithms, Learning techniques, Medical imaging, MLP classifiers, Mortality rate, Network architecture, Support vector machines},
	doi = {10.1007/978-3-030-86960-1_14},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85125258661\&doi=10.1007\%2f978-3-030-86960-1_14\&partnerID=40\&md5=a4535504f03d3143ae1648f7edeb152c},
	author = {Zerouaoui, H. and Idri, A. and Nakach, F.Z. and Hadri, R.E.}
}
@article {Fagroud2021335,
	title = {A Brief Survey on Internet of Things (IoT)},
	journal = {Lecture Notes in Networks and Systems},
	volume = {211 LNNS},
	year = {2021},
	note = {cited By 5},
	pages = {335-344},
	abstract = {Today it be a necessity to setting off past the thought that IT as a cost center and seeing it as a benefit center, on backing of the improvement and method of the organization. Internet of things can be defined as a propelled standard which make straightforward gadget a shrewdly gadgets which allow transferring simple device an intelligent devices capable of exchanging data over a network without human interaction. It represent a technology that interest research and industry, also serve on transform the way to think, and work. This paper present an overview on Internet of things (IoT), its application areas and its challenges in the aim to give a guideline to future researchers. {\textcopyright} 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-030-73882-2_31},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85111331935\&doi=10.1007\%2f978-3-030-73882-2_31\&partnerID=40\&md5=5c90aac71bfc8656430ff23c2e19c367},
	author = {Fagroud, F.Z. and Ajallouda, L. and Lahmar, E.H.B. and Toumi, H. and Zellou, A. and El Filali, S.}
}
@conference {Nejjari2021,
	title = {Conflict spectrum: An empirical study of geopolitical cyber threats from a social network perspective},
	booktitle = {2021 8th International Conference on Social Network Analysis, Management and Security, SNAMS 2021},
	year = {2021},
	note = {cited By 0},
	abstract = {The current evolution of the cyber-threat ecosystem shows that no state or organization is safe from cyber threats. It is therefore important to understand factors that may influence cyber risk. In this paper, we highlight the geopolitical context of cyber threats. The key idea is to verify the assumption that cyber threats are correlated to geopolitical events. We use social network techniques to model our problem as a network. We investigate the relationship between cyber threats and geopolitical events through the measure of similarity between two graphs using the QAP-correlation method. To verify this assumption empirically, we use data from the GDELT project. The results of QAP-correlation measure show a significant similarity between the cyber events graph and the geopolitical events graph in terms of graph isomorphism and structure. {\textcopyright} 2021 IEEE.},
	keywords = {{\textquoteright}current, Cyber threats, Empirical studies, Event graphs, Geopolitical events, QAP-correlation, Similarity, Social Network Analysis, Spectra{\textquoteright}s, Use social networks},
	doi = {10.1109/SNAMS53716.2021.9732155},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85127404986\&doi=10.1109\%2fSNAMS53716.2021.9732155\&partnerID=40\&md5=d81465c991f5d449e0db9613f3c31aa7},
	author = {Nejjari, N. and Lahlou, S. and Fadi, O. and Zkik, K. and Oudani, M. and Benbrahim, H.}
}
@article {Houmz2021,
	title = {Detecting the impact of software vulnerability on attacks: A case study of network telescope scans},
	journal = {Journal of Network and Computer Applications},
	volume = {195},
	year = {2021},
	note = {cited By 1},
	abstract = {Network scanning is one of the first steps in gathering information about a target before launching attacks. It is used to scan for vulnerable devices and exposed services in order to exploit them. Such exploits can result in data breaches or network disruption, which can be very costly for organizations. There are many factors, including technical and non-technical, affecting the volume of scanning activities. In this paper, we study the impact of vulnerability disclosure on the volume of scans over time and propose a machine learning-based approach to predict this impact. We conducted a comprehensive data collection of network scans from two network telescopes hosted in different countries, as well as the disclosed vulnerabilities from 2014 to 2019. We then designed a set of features to characterize the disclosed vulnerabilities and used several classifiers to predict whether a vulnerability will impact the volume of daily scans. The resulting classifier achieves over 85\% accuracy in predicting the impact. In addition, we performed an analysis of the key characteristics of vulnerabilities that directly affect scanning activities. Our findings show that this approach is able to classify vulnerabilities that have an impact on network scans. The implementation of our model and validation tests proved the efficiency of the selected features, as well as the robustness of our model to classify vulnerabilities{\textquoteright} impact on scans. {\textcopyright} 2021 Elsevier Ltd},
	keywords = {Case-studies, Classification algorithm, CVE, Forecasting, Machine learning, Network scan, Network scanning, Network security, Network telescopes, NVD, OR-networks, Scanning, Software vulnerabilities, Telescopes, Times series},
	doi = {10.1016/j.jnca.2021.103230},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85116335984\&doi=10.1016\%2fj.jnca.2021.103230\&partnerID=40\&md5=1d7f8d5d4111761b27fc93badc70f925},
	author = {Houmz, A. and Mezzour, G. and Zkik, K. and Ghogho, M. and Benbrahim, H.}
}
@article {Yousfi2021588,
	title = {An Efficient Holistic Schema Matching Approach},
	journal = {Communications in Computer and Information Science},
	volume = {1350},
	year = {2021},
	note = {cited By 0},
	pages = {588-601},
	abstract = {Schema matching allows a certain way of communication between heterogeneous, autonomous and distributed data sources. We choose the matching approach depending on the number of sources we wish to integrate: pairwise matching approaches for a small to a medium total number of data sources, and holistic matching approaches for a big to a huge number of data sources. Nevertheless, current matching approaches were proven to achieve a very moderate matching accuracy. Moreover, holistic matching approaches operate in a series of two-way matching steps. In this paper, we present hMatcher, an efficient holistic schema matching approach. To execute holistic schema matching, hMatcher captures frequent schema elements in the given domain prior to any matching operation. To achieve high matching accuracy, hMatcher uses a context-based semantic similarity measure. Experimental results on real-world domain show that hMatcher performs holistic schema matching properly, and outperforms current matching approaches in terms of matching accuracy. {\textcopyright} 2020, Springer Nature Switzerland AG.},
	keywords = {Computer science, Computers, Context-based semantics, Current matching, Distributed data sources, Holistic schema matching, Number of sources, Pairwise matching, Real world domain, Schema matching, Semantics},
	doi = {10.1007/978-3-030-69143-1_45},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85102749207\&doi=10.1007\%2f978-3-030-69143-1_45\&partnerID=40\&md5=d28b470cb44f6ca89c012259c51ec4f6},
	author = {Yousfi, A. and El Yazidi, M.H. and Zellou, A.}
}
@conference {Essaaidi2021,
	title = {Foreword},
	booktitle = {Proceedings of 2021 9th International Renewable and Sustainable Energy Conference, IRSEC 2021},
	year = {2021},
	note = {cited By 0},
	doi = {10.1109/IRSEC53969.2021.9740734},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85128083162\&doi=10.1109\%2fIRSEC53969.2021.9740734\&partnerID=40\&md5=350cd8f44140accd9154232fe0cd44ef},
	author = {Essaaidi, M. and Zaz, Y.}
}
@article {ElHafidy2021,
	title = {Gamified mobile applications for improving driving behavior: A systematic mapping study},
	journal = {Mobile Information Systems},
	volume = {2021},
	year = {2021},
	note = {cited By 4},
	abstract = {Many research works and official reports approve that irresponsible driving behavior on the road is the main cause of accidents. Consequently, responsible driving behavior can significantly reduce accidents{\textquoteright} number and severity. Therefore, in the research area as well as in the industrial area, mobile technologies are widely exploited in assisting drivers in reducing accident rates and preventing accidents. For instance, several mobile apps are provided to assist drivers in improving their driving behavior. Recently and thanks to mobile cloud computing, smartphones can benefit from the computing power of servers in the cloud for executing machine learning algorithms. Therefore, many mobile applications of driving assistance and control are based on machine learning techniques to adjust their functioning automatically to driver history, context, and profile. Additionally, gamification is a key element in the design of these mobile applications that allow drivers to develop their engagement and motivation to improve their driving behavior. To have an overview concerning existing mobile apps that improve driving behavior, we have chosen to conduct a systematic mapping study about driving behavior mobile apps that exist in the most common mobile apps repositories or that were published as research works in digital libraries. In particular, we should explore their functionalities, the kinds of collected data, the used gamification elements, and the used machine learning techniques and algorithms. We have successfully identified 220 mobile apps that help to improve driving behavior. In this work, we will extract all the data that seem to be useful for the classification and analysis of the functionalities offered by these applications. {\textcopyright} 2021 Abderrahim El hafidy et al.},
	keywords = {Accidents, Computing power, Digital libraries, Driving assistance, Driving behavior, Gamification, Industrial area, Industrial research, Learning algorithms, Machine learning, Machine learning techniques, Mapping, Mobile applications, Mobile cloud computing, Mobile computing, Mobile Technology, Systematic mapping studies},
	doi = {10.1155/2021/6677075},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85114117887\&doi=10.1155\%2f2021\%2f6677075\&partnerID=40\&md5=6ad1b624deabb49917039716eb133f13},
	author = {El Hafidy, A. and Rachad, T. and Idri, A. and Zellou, A.}
}
@article {Elmouatamid2021571,
	title = {A MicroGrid System Infrastructure Implementing IoT/Big-Data Technologies for Efficient Energy Management in Buildings},
	journal = {Green Energy and Technology},
	year = {2021},
	note = {cited By 4},
	pages = {571-600},
	abstract = {Recent studies showed that energy consumption in buildings could be efficiently reduced by including recent IoT (Internet of Things) and Big-Data technologies into microgrid systems. In fact, three major aspects could be further considered for reducing energy consumption while maintaining a suitable occupants{\textquoteright} comfort, (i) integrating renewable energy sources and storage devices, (ii) integrating programmable and less-energy-consuming equipment, and (iii) deploying innovative information and communication technologies. These aspects might contribute substantially to the improvement of winning and saving energy toward smart and energy-efficient buildings. In this chapter, a microgrid system infrastructure is developed together with a platform for data gathering, monitoring, and processing. We put more emphasis on microgrid systems as crucial infrastructures for leveraging energy-efficient and smart buildings by developing and deploying a holistic IoT/Big-Data platform in which sensing and actuation tasks are performed according to the actual contextual changes. Scenarios are presented in order to show the usefulness of this holistic platform for monitoring, data processing, and control in energy-efficient buildings. {\textcopyright} 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	keywords = {Data gathering, Data handling, Data technologies, energy efficiency, Energy efficient, Energy efficient building, Energy utilization, Information and Communication Technologies, Intelligent buildings, Internet of things, Micro-grid systems, Microgrids, Monitoring, Reducing energy consumption, Renewable energy resources, Renewable energy source, Virtual storage},
	doi = {10.1007/978-3-030-64565-6_20},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85105764631\&doi=10.1007\%2f978-3-030-64565-6_20\&partnerID=40\&md5=b0a762b2a1e37fc93eff19c16f955daa},
	author = {Elmouatamid, A. and NaitMalek, Y. and Ouladsine, R. and Bakhouya, M. and El kamoun, N. and Khaidar, M. and Zine-Dine, K.}
}
@article {Baddi2021373,
	title = {MSDN-GKM: Software Defined Networks Based Solution for Multicast Transmission with Group Key Management},
	journal = {Studies in Computational Intelligence},
	volume = {919},
	year = {2021},
	note = {cited By 0},
	pages = {373-396},
	abstract = {Multicast communication is an important requirement to support many types of applications, such as, IPTV, videoconferencing, group games. Recently this multicast applications type emerges fast, in one side more application provider proposed many applications, in other side Internet research community has proposed many different multicast routing protocols to support efficient multicast application. Therefore, the necessity of secure mechanism to provide the confidentiality and privacy of communications are more and more insistent. In current standardized IP multicast architecture, any host can join a multicast group, as source or receiver, without authentication, because no host identification information is maintained by routers, this situation leads clearly to many security risks issues. For security enhancement in multicast communication, in this paper an SDN based multicast solution with Group Key Management (GKM) approach was introduced. Our proposal solution, MSDN-GKM, includes many SDN modules to support multicast functions, group key generation, Group key exchange, storage, use, and keys replacement if any multicast group membership occurs. To prove the efficiency of our proposal solution a prototype is implemented in our SDN platform. The test-bed result proves that our proposal solution is greater to the traditional IP multicast proposed in the literature, which is reflected in two aspects: firstly, multicast metrics performance in terms of end-to-end delay, tree construction delay and delay variation. Secondly, the multicast group key management performance in terms of storage overhead and time processing. {\textcopyright} 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-030-57024-8_17},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85097877454\&doi=10.1007\%2f978-3-030-57024-8_17\&partnerID=40\&md5=90fd04903bd123b46bd5571b000609a6},
	author = {Baddi, Y. and Anass, S. and Zkik, K. and Maleh, Y. and Mohammed, B. and El Kettani Mohamed Dafir, E.-C.}
}
@article {Abdelali2021164282,
	title = {Multiple hypothesis detection and tracking using deep learning for video traffic surveillance},
	journal = {IEEE Access},
	volume = {9},
	year = {2021},
	note = {cited By 3},
	pages = {164282-164291},
	abstract = {Moroccan Intelligent Transport System is the first Moroccan system that uses the latest advances in computer vision, machine learning and deep learning techniques to manage Moroccan traffic and road violations.In this paper, we propose a fully automatic approach to Multiple Hypothesis Detection and Tracking (MHDT) for video traffic surveillance.The proposed framework combines Kalman filter and data association-based tracking methods using YOLO detection approach, to robustly track vehicles in complex traffic surveillance scenes.Experimental results demonstrate that the proposed approach is robust to detect and track the trajectory of the vehicles in different situations such as scale variation, stopped vehicles, rotation, varying illumination and occlusion.The proposed approach shows a competitive results (detection: 94.10\% accuracy, tracking: 92.50\% accuracy) compared to the state-of-the-art approaches. {\textcopyright} 2021 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.},
	keywords = {Bandpass filters, Computer vision, Convolutional neural network, Data association, Deep learning, Deep neural networks, Detection, Intelligent systems, Intelligent vehicle highway systems, Kalman filters, Monitoring, Multiple hypothesis tracking, Object detection, Occlusion handling, Predictive models, Security systems, Target tracking, Targets tracking, Traffic control, Traffic surveillance, Vehicles, Video sequences},
	doi = {10.1109/ACCESS.2021.3133529},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85121370415\&doi=10.1109\%2fACCESS.2021.3133529\&partnerID=40\&md5=84b2a2537c16a7db00901d13c8b6eb5c},
	author = {Abdelali, H.A.I.T. and Derrouz, H. and Zennayi, Y. and Thami, R.O.H. and Bourzeix, F.}
}
@article {Zerouaoui2021,
	title = {Reviewing Machine Learning and Image Processing Based Decision-Making Systems for Breast Cancer Imaging},
	journal = {Journal of Medical Systems},
	volume = {45},
	number = {1},
	year = {2021},
	note = {cited By 19},
	abstract = {Breast cancer (BC) is the leading cause of death among women worldwide. It affects in general women older than 40~years old. Medical images analysis is one of the most promising research areas since it provides facilities for diagnosis and decision-making of several diseases such as BC. This paper conducts a Structured Literature Review (SLR) of the use of Machine Learning (ML) and Image Processing (IP) techniques to deal with BC imaging. A set of 530 papers published between 2000 and August 2019 were selected and analyzed according to ten criteria: year and publication channel, empirical type, research type, medical task, machine learning techniques, datasets used, validation methods, performance measures and image processing techniques which include image pre-processing, segmentation, feature extraction and feature selection. Results showed that diagnosis was the most used medical task and that Deep Learning techniques (DL) were largely used to perform classification. Furthermore, we found out that classification was the most ML objective investigated followed by prediction and clustering. Most of the selected studies used Mammograms as imaging modalities rather than Ultrasound or Magnetic Resonance Imaging with the use of public or private datasets with MIAS as the most frequently investigated public dataset. As for image processing techniques, the majority of the selected studies pre-process their input images by reducing the noise and normalizing the colors, and some of them use segmentation to extract the region of interest with the thresholding method. For feature extraction, we note that researchers extracted the relevant features using classical feature extraction techniques (e.g. Texture features, Shape features, etc.) or DL techniques (e. g. VGG16, VGG19, ResNet, etc.), and finally few papers used feature selection techniques in particular the filter methods. {\textcopyright} 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature.},
	keywords = {Article, breast, Breast Cancer, cancer diagnosis, classifier, Computer-Assisted, Convolutional neural network, Decision making, Deep learning, deep neural network, diagnostic accuracy, diagnostic imaging, echography, Feature extraction, feature selection, female, human, Humans, image processing, image segmentation, Machine learning, Magnetic Resonance Imaging, mammography, multilayer perceptron, nuclear magnetic resonance imaging},
	doi = {10.1007/s10916-020-01689-1},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100125842\&doi=10.1007\%2fs10916-020-01689-1\&partnerID=40\&md5=3074b3d443373f75f5a3c1c6134512ee},
	author = {Zerouaoui, H. and Idri, A.}
}
@article {Yousfi2021129,
	title = {SBP: Preparation of Schema Elements to~Schema Matching},
	journal = {Lecture Notes in Electrical Engineering},
	volume = {733 LNEE},
	year = {2021},
	note = {cited By 0},
	pages = {129-144},
	abstract = {Schema pre-matching is very critical for having schema elements fully ready for schema matching. Ideally, words are first extracted from the schema elements{\textquoteright} labels, and then the semantically corresponding elements are generated accordingly. Searching for the sense of words based on their vertical and horizontal contexts, and before performing schema matching is very crucial to obtain high matching accuracy and as a result increase the amount of accurate matches and reduce the number of inaccurate matches and missed matches. Nonetheless, this problem is much more challenging than it seems. This is because complete and precise information about the meaning behind each element is often unavailable. This paper presents SBP, a Sense-Based Pre-matching approach designed for hierarchical data representations. SBP consists of two main components. First, the words sets generator generates, from each element, a set of words that fully describes its meaning. Second, the words qualifier identifies the senses of words based on both their vertical and horizontal contexts. Experimental results on real-world domains show high matching accuracy obtained when using the SBP approach. {\textcopyright} 2021, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.},
	keywords = {Electrical engineering, Hierarchical data, Mathematical techniques, Pre-matching, Real world domain, Schema matching},
	doi = {10.1007/978-981-33-4909-4_10},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85107373285\&doi=10.1007\%2f978-981-33-4909-4_10\&partnerID=40\&md5=8abeb96c3db9e0d4b54e753de8bc994e},
	author = {Yousfi, A. and El Yazidi, M.H. and Zellou, A.}
}
@article {Sebbar2021355,
	title = {Secure Data Sharing Framework Based on Supervised Machine Learning Detection System for Future SDN-Based Networks},
	journal = {Studies in Computational Intelligence},
	volume = {919},
	year = {2021},
	note = {cited By 2},
	pages = {355-371},
	abstract = {Securing Data-sharing mechanism between Software Defined Networks (SDN) nodes represent one of the biggest challenges in SDN context. In fact, attackers may steal or perturb flows in SDN by performing several types of attacks such as address resolution protocol poisoning, main in the middle and rogue nodes attacks. These attacks are very harm full to SDN networks as they can be performed easily and passively at all SDN layers. Furthermore, data-sharing permit to an attacker to gather all sensitive flows and data from SDN architecture. In this chapter, we will propose a framework for secure data sharing that detect and stop intrusions in SDN context while ensuring authentication and privacy. To do so, we propose a defense mechanism that detect and reduce the risk of attacks based on advanced machine learning techniques. The learning and data pre-processing steps was performed by using a constructed data set dedicated to SDN context. The simulation results show that our framework can effectively and efficiently address sniffing attacks that can be detected and stopped quickly. Finally, we observe high accuracy with a low false-positive for attack detection. {\textcopyright} 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-030-57024-8_16},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85097909334\&doi=10.1007\%2f978-3-030-57024-8_16\&partnerID=40\&md5=0d3b5f0a3c85d400bc35313dfe6f3009},
	author = {Sebbar, A. and Zkik, K. and Baddi, Y. and Boulmalf, M. and Ech-Cherif El Kettani, M.D.}
}
@article {Moussaid2021,
	title = {Tree crowns segmentation and classification in overlapping orchards based on satellite images and unsupervised learning algorithms},
	journal = {Journal of Imaging},
	volume = {7},
	number = {11},
	year = {2021},
	note = {cited By 2},
	abstract = {Smart agriculture is a new concept that combines agriculture and new technologies to improve the yield{\textquoteright}s quality and quantity as well as facilitate many tasks for farmers in managing orchards. An essential factor in smart agriculture is tree crown segmentation, which helps farmers automatically monitor their orchards and get information about each tree. However, one of the main problems, in this case, is when the trees are close to each other, which means that it would be difficult for the algorithm to delineate the crowns correctly. This paper used satellite images and machine learning algorithms to segment and classify trees in overlapping orchards. The data used are images from the Moroccan Mohammed VI satellite, and the study region is the OUARGHA citrus orchard located in Morocco. Our approach starts by segmenting the rows inside the parcel and finding all the trees there, getting their canopies, and classifying them by size. In general, the model inputs the parcel{\textquoteright}s image and other field measurements to classify the trees into three classes: missing/weak, normal, or big. Finally, the results are visualized in a map containing all the trees with their classes. For the results, we obtained a score of 0.93 F-measure in rows segmentation. Additionally, several field comparisons were performed to validate the classification, dozens of trees were compared and the results were very good. This paper aims to help farmers to quickly and automatically classify trees by crown size, even if there are overlapping orchards, in order to easily monitor each tree{\textquoteright}s health and understand the tree{\textquoteright}s distribution in the field. {\textcopyright} 2021 by the authors. Licensee MDPI, Basel, Switzerland.},
	doi = {10.3390/jimaging7110241},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85119836347\&doi=10.3390\%2fjimaging7110241\&partnerID=40\&md5=28a65e4b68b078f94a4b0144d630f8d8},
	author = {Moussaid, A. and El Fkihi, S. and Zennayi, Y.}
}
@article {AitAbdelali2021517,
	title = {Visual Vehicle Tracking via Deep Learning and Particle Filter},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {1188},
	year = {2021},
	note = {cited By 2},
	pages = {517-526},
	abstract = {Visual vehicle tracking is one of the most challenging research topics in computer vision. In this paper, we propose a novel and efficient approach based on the particle filter technique and deep learning for multiple vehicle tracking, where the main focus is to associate vehicles efficiently for online and real-time applications. Experimental results illustrate the effectiveness of the system we are proposing. {\textcopyright} 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.},
	keywords = {Deep learning, Monte Carlo methods, Particle filter, Real-time application, Research topics, Soft computing, Vehicles},
	doi = {10.1007/978-981-15-6048-4_45},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85096559933\&doi=10.1007\%2f978-981-15-6048-4_45\&partnerID=40\&md5=51a9b5456004a8cdb4bc0a5256e17dc9},
	author = {Ait Abdelali, H. and Bourja, O. and Haouari, R. and Derrouz, H. and Zennayi, Y. and Bourzex, F. and Oulad Haj Thami, R.}
}
@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.}
}
@article {Zarnoufi2020182,
	title = {AI to prevent cyber-violence: Harmful behaviour detection in social media},
	journal = {International Journal of High Performance Systems Architecture},
	volume = {9},
	number = {4},
	year = {2020},
	note = {cited By 1},
	pages = {182-191},
	abstract = {Social media has allowed people to communicate freely. This total freedom has led to the emergence of cyber-violence with a growing number of victims. Many researches in psychology and e-health have been conducted to detect the act of cyber-violence. In computational field, most of works have focused on multiple aspects of cyber-violence, but none of them, to our knowledge, have studied the perpetrator{\textquoteright}s harmful behaviour from an emotional dimension. Our goal in this work is to discover the relationship between the emotional state of social media users and their harmful behaviour while engaged in the act of cyber-violence. Our approach is based on Ensemble Machine Learning and engineered features related to Plutchik wheel of basic emotions extracted with semantic similarity and word embedding. The results show a significant association between the individual{\textquoteright}s emotional state and the harmful intent, which may be a good indicator for cyber-violence detection. Copyright {\textcopyright} 2020 Inderscience Enterprises Ltd.},
	keywords = {Basic emotions, Behaviour detections, Computational field, Emotional dimensions, Emotional state, Semantic similarity, Semantics, social media, Social networking (online), Violence detections},
	doi = {10.1504/IJHPSA.2020.113679},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85102891888\&doi=10.1504\%2fIJHPSA.2020.113679\&partnerID=40\&md5=3e11e2e6a4032f608b4b71f2d426dbca},
	author = {Zarnoufi, R. and Boutbi, M. and Abik, M.}
}
@article {ElOuahabi20204261,
	title = {Analysis and design of a compact ultra-wideband antenna with WLAN and X-band satellite notch},
	journal = {International Journal of Electrical and Computer Engineering},
	volume = {10},
	number = {4},
	year = {2020},
	note = {cited By 1},
	pages = {4261-4269},
	abstract = {A compact design of ultra-wideband (UWB) antenna with dual band-notched characteristics are investigated in this paper. The wider impedance bandwidth (from 2.73 to 11.34 GHz) is obtained by using two symmetrical slits in the radiating patch and another slit in the partial ground plane. The dual band-notch rejection at WLAN and X-band downlink satellite communication system are obtained by inserting a modified U-strip on the radiating patch at 5.5 GHz and embedding a pair of single rectangular split ring resonators (SR-SRR) on both sides of the microstrip feed line at 7.5 GHz, respectively. The proposed antenna is simulated and tested using CST MWS high frequency simulator and exhibits the advantages of compact size, simple design and each notched frequency band can be controlled independently by using the geometrical parameters of the corresponding resonator. Therefore, the parametric study is carried out to understand the mutual coupling between the dual band-notched elements. To validate simulation results of our design, a prototype is fabricated and good agreement is achieved between measurement and simulation. Furthermore, a radiation patterns, satisfactory gain, current distribution and VSWR result at the notched frequencies make the proposed antenna a suitable candidate for practical UWB applications. Copyright {\textcopyright} 2020 Institute of Advanced Engineering and Science. All rights reserved.},
	doi = {10.11591/ijece.v10i4.pp4261-4269},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85083101617\&doi=10.11591\%2fijece.v10i4.pp4261-4269\&partnerID=40\&md5=6e35d351672ae49ebb932247c0e19472},
	author = {El Ouahabi, M. and Dkiouak, A. and Zakriti, A. and Essaaidi, M. and Elftouh, H.}
}
@article {Zennou2020360,
	title = {Boosting Sequential Consistency Checking Using Saturation},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {12302 LNCS},
	year = {2020},
	note = {cited By 1},
	pages = {360-376},
	abstract = {We address the problem of checking that an execution of a shared memory concurrent program is sequentially consistent (SC). This problem is NP-hard due to the necessity of finding a total order between the write operations that induces an acyclic happen-before relation. We propose an approach allowing to avoid falling systematically in the worst case, and to check SCness in polynomial-time in most cases in practice. The approach is based on a simple yet powerful saturation-based procedure for computing write constraints that must hold for SCness, allowing on one hand fast detection of SC violations, and on the other hand reducing drastically the search space for a total order witnessing SCness. {\textcopyright} 2020, Springer Nature Switzerland AG.},
	keywords = {Concurrent program, Fast detections, NP-hard, Polynomial approximation, Polynomial-time, Search spaces, Sequential consistency, Shared memory, Total order, Write operations},
	doi = {10.1007/978-3-030-59152-6_20},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85093860805\&doi=10.1007\%2f978-3-030-59152-6_20\&partnerID=40\&md5=a60ea8b0396b220e92dc8ef992c37f30},
	author = {Zennou, R. and Atig, M.F. and Biswas, R. and Bouajjani, A. and Enea, C. and Erradi, M.}
}
@article {Bakhouya2020,
	title = {Cloud computing, IoT, and big data: Technologies and applications},
	journal = {Concurrency and Computation: Practice and Experience},
	volume = {32},
	number = {17},
	year = {2020},
	note = {cited By 1},
	doi = {10.1002/cpe.5896},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85089609248\&doi=10.1002\%2fcpe.5896\&partnerID=40\&md5=7054f06999f02eff0eb333bc9115380d},
	author = {Bakhouya, M. and Zbakh, M. and Essaaidi, M. and Manneback, P.}
}
@conference {Yousfi2020,
	title = {CSSM: A context-based semantic similarity measure},
	booktitle = {2020 IEEE 2nd International Conference on Electronics, Control, Optimization and Computer Science, ICECOCS 2020},
	year = {2020},
	note = {cited By 1},
	abstract = {Semantic similarity is very critical in applications that manipulate data across heterogeneous, autonomous and distributed data sources. It helps connect these data sources. Nevertheless, current semantic similarity approaches were proven to achieve a very moderate accuracy. Furthermore, they are merely applicable when we wish to determine the semantic similarity between words. In this paper, we present CSSM, a Context-based Semantic Similarity Measure. Experimental results on Miller Charles benchmark dataset show that CSSM performs semantic similarity comparisons properly, and obtains high accuracy. {\textcopyright} 2020 IEEE.},
	keywords = {Benchmark datasets, Computer science, Computers, Context-based semantics, Control engineering, Data-sources, Distributed data sources, Electronics engineering, Electronics industry, High-accuracy, Semantic similarity, Semantic similarity approaches, Semantics},
	doi = {10.1109/ICECOCS50124.2020.9314376},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100120972\&doi=10.1109\%2fICECOCS50124.2020.9314376\&partnerID=40\&md5=3191da8d69fa40844c69e41c268c5a17},
	author = {Yousfi, A. and El Yazidi, M.H. and Zellou, A.}
}
@conference {Zaazaa2020,
	title = {Dynamic vulnerability detection approaches and tools: State of the Art},
	booktitle = {4th International Conference on Intelligent Computing in Data Sciences, ICDS 2020},
	year = {2020},
	note = {cited By 0},
	abstract = {Vulnerabilities are everywhere around us. Every device we use in our daily life include a software that may contain vulnerabilities. The growth use of software and devices to automate some of our daily life actions is making these programs more complex and more connected to the internet, which increase the risk of cyber-attacks. To reduce this risk, multiple programming companies are trying to use different approaches to find these vulnerabilities. Some are using static approaches during the software development life cycle while others are using dynamic analysis approaches to find vulnerabilities once the application is correctly working. Unfortunately, both approaches still suffer from multiple limitation and still need improvement. In this paper, we are discussing some of the most recent dynamic approaches and the efficient of the tools that use them. {\textcopyright} 2020 IEEE.},
	keywords = {Analysis approach, Application programs, Cyber-attacks, Daily lives, Data Science, Dynamic approaches, Intelligent computing, Network security, Software design, Software development life cycle, State of the art, Static approach, Vulnerability detection},
	doi = {10.1109/ICDS50568.2020.9268686},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85098666133\&doi=10.1109\%2fICDS50568.2020.9268686\&partnerID=40\&md5=faef5d40937e4c62a3326a3576d0e8e8},
	author = {Zaazaa, O. and El Bakkali, H.}
}
@conference {Yousfi2020155,
	title = {HASSO: A highly-automated source selection and ordering system based on data quality factors},
	booktitle = {2020 International Conference on Advanced Computer Science and Information Systems, ICACSIS 2020},
	year = {2020},
	note = {cited By 0},
	pages = {155-164},
	abstract = {Big data integration gives access to a large number of data sources through a unified user interface. Answers include high-quality data, medium-quality data, and low-quality data. Selecting a subset of high accurate and consistent data sources and ordering them appropriately is critical to obtain as many high-quality answers as possible right after querying few data sources. However, the process of selecting and ordering data sources can be quite complicated and can present several challenges. The main challenge faced during that process is identifying the most adequate data quality factors to consider. In this paper, we present HASSO, a Highly-Automated Source Selection and Ordering System based on data quality factors. To produce consistent and high accurate answers, HASSO identifies, for each data source, its domain, data consistency and data accuracy using the schema matches. To maximize the total number of complete and non-redundant answers returned right after querying a small number of data sources, HASSO orders data sources in terms of their data overlap and in a decreasing order of their overall coverage. Experimental results in real-world domains show that HASSO produces high-quality answers at high speed. {\textcopyright} 2020 IEEE.},
	keywords = {Data accuracy, Data consistency, Data integration, High quality data, Information systems, Information use, Low quality datum, Number of datum, Order systems, Real world domain, Source selection, User interfaces},
	doi = {10.1109/ICACSIS51025.2020.9263243},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85099753285\&doi=10.1109\%2fICACSIS51025.2020.9263243\&partnerID=40\&md5=b3fbfb1a2a633f6f2b8dce8ca9bc392f},
	author = {Yousfi, A. and Yazidi, M.H.E. and Zellou, A.}
}
@article {RHANOUI2020,
	title = {A hybrid recommender system for patron driven library acquisition and weeding},
	journal = {Journal of King Saud University - Computer and Information Sciences},
	year = {2020},
	abstract = {Nowadays the explosion of information sources has shaped how library users access information and provide feedback on their preferences. Therefore, faced with this explosion and the blossoming of digital libraries, modern libraries must take up the challenge of meeting the needs of their users and considering their opinions and preferences in order to offer them adequate resources and henceforth eliminate those that are unsatisfactory. Almost all library recommender systems aim to provide users with items of interest to them. However, despite its definite interest, the staff-oriented adaptation and application of this revolutionary technique to the collection development process is still in an embryonic stage. We propose a patron-driven hybrid library recommender system that uses machine learning techniques to recommend and assist in the acquisition and weeding decision-making operations by extracting and analyzing users{\textquoteright} opinions and ratings. The recommender system is applied and validated in a real national library case using Amazon{\textquoteright}s digital library and the library{\textquoteright}s catalog as a data source.},
	keywords = {Acquisition, Library Management, Machine learning, Recommender Systems, Weeding},
	issn = {1319-1578},
	doi = {https://doi.org/10.1016/j.jksuci.2020.10.017},
	url = {https://www.sciencedirect.com/science/article/pii/S1319157820305103},
	author = {Maryem Rhanoui and Mounia Mikram and Siham Yousfi and Ayoub Kasmi and Naoufel Zoubeidi}
}
@article {Zemrane2020101,
	title = {Internet of Things Smart Home Ecosystem},
	journal = {Studies in Systems, Decision and Control},
	volume = {242},
	year = {2020},
	note = {cited By 15},
	pages = {101-125},
	abstract = {Internet of things is perceived today as a key opportunity for commercial development in different sectors of activities, the new IoT Smart home ecosystem, is based on a lot of sensors and actuators that can make life in the home more pleasant and more safety for its occupant, in this article we distinguish the communication protocols used in this IoT ecosystem, their modes of operation, and we analyze their performance. {\textcopyright} 2020, Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-030-22773-9_8},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85069766578\&doi=10.1007\%2f978-3-030-22773-9_8\&partnerID=40\&md5=8934d759b7be1ff526b641115522498d},
	author = {Zemrane, H. and Baddi, Y. and Hasbi, A.}
}
@conference {Ajallouda2020169,
	title = {K-means hac and fcm which clustering approach for arabic text?},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2020},
	note = {cited By 0},
	pages = {169-174},
	abstract = {Today we are witnessing rapid growth in Web resources that allow Internet users to express and share their ideas opinions and judgments on a variety of issues. Several classification approaches have been proposed to classify textual data. But all these approaches require us to label the clusters we want to obtain. Which in reality is not available because we do not know in advance the information that can be proposed through these opinions. To overcome this constraint clustering approaches such as K-mean HAC or FCM can be exploited. In this paper we present and compare these approaches. And to show the importance of exploiting clustering algorithms to classify and analyze textual data in Arabic. By applying them to a real case that has created a great debate in Morocco which is the case of teachers contracting with academies. {\textcopyright} 2020 ACM.},
	keywords = {Arabic texts, Classification (of information), Classification approach, Clustering approach, Intelligent systems, Internet users, K-means clustering, Rapid growth, Real case, Textual data, Web resources},
	doi = {10.1145/3419604.3419779},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85096415898\&doi=10.1145\%2f3419604.3419779\&partnerID=40\&md5=8aca383d8f485d15b3da191f03c5bf62},
	author = {Ajallouda, L. and Fagroud, F.Z. and Zellou, A. and Benlahmar, E.H.}
}
@article {Zerouaoui202044,
	title = {Machine Learning and Image Processing for Breast Cancer: A Systematic Map},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {1161 AISC},
	year = {2020},
	note = {cited By 3},
	pages = {44-53},
	abstract = {Machine Learning (ML) combined with Image Processing (IP) gives a powerful tool to help physician, doctors and radiologist to make more accurate decisions. Breast cancer (BC) is a largely common disease among women worldwide; it is one of the medical sub-field that are experiencing an emergence of the use of ML and IP techniques. This paper explores the use of ML and IP techniques for BC in the form of a systematic mapping study. 530 papers published between 2000 and August 2019 were selected and analyzed according to 6 criteria: year and publication channel, empirical type, research type, medical task, machine learning objectives and datasets used. The results show that classification was the most used ML objective. As for the datasets most of the articles used private datasets belonging to hospitals, although papers using public data choose MIAS (Mammographic Image Analysis Society) which make it as the most used public dataset. {\textcopyright} 2020, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	keywords = {Breast Cancer, Common disease, Diseases, Information systems, Information use, Machine learning, Mammographic image analysis, mammography, Medical imaging, Public data, Public dataset, Sub fields, Systematic mapping studies, Systematic maps},
	doi = {10.1007/978-3-030-45697-9_5},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85085473168\&doi=10.1007\%2f978-3-030-45697-9_5\&partnerID=40\&md5=e980b38be1c8a8499c579b990b79b909},
	author = {Zerouaoui, H. and Idri, A. and El Asnaoui, K.}
}
@article {Sebbar20205875,
	title = {MitM detection and defense mechanism CBNA-RF based on machine learning for large-scale SDN context},
	journal = {Journal of Ambient Intelligence and Humanized Computing},
	volume = {11},
	number = {12},
	year = {2020},
	note = {cited By 15},
	pages = {5875-5894},
	abstract = {Software defined network (SDN) is a promising new network abstraction that aims to improve and facilitate network management. Due to its centralized architecture and the lack of intelligence on the data plane, SDN suffers from many security issues that slows down its deployment. Man in the Middle (MitM) attack is considered as one of the most devastating attacks in an SDN context. In fact, MitM attack allows the attackers to capture, duplicate and spoof flows by targeting southbound interfaces and SDN nodes. Furthermore, it{\textquoteright}s very difficult to detect MitM attacks since it is performed passively at the SDN level. To reduce the impact of this attack, we generally set up security policies and authentication mechanisms. However, these techniques are not applicable for a large scale SDN architecture as they require complexes and static configurations and as they negatively influence on network performance. In this paper, we propose an intrusion detection and prevention framework by using machine learning techniques to detect and stop MitM attempts. To do so, we build a context-based node acceptance based on the random forest model (CBNA-RF), which helps to setting-up appropriate security policies and to automating defense operations on a large-scale SDN context. This mechanism can realize a quick and early detection of MitM attacks by automatically detecting malicious nodes without affecting performances. The evaluation of the proposed framework demonstrates that our model can correctly classify and detect malicious connections and nodes while keeping high accuracy and precision scores. {\textcopyright} 2020, Springer-Verlag GmbH Germany, part of Springer Nature.},
	keywords = {Authentication mechanisms, Centralized architecture, Decision trees, Defense operations, Intrusion detection, Intrusion detection and prevention, Machine learning, Machine learning techniques, Man-In-The-Middle (MITM) Attack, Network abstractions, Network architecture, Network security, Random forest modeling, Security systems},
	doi = {10.1007/s12652-020-02099-4},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85085987877\&doi=10.1007\%2fs12652-020-02099-4\&partnerID=40\&md5=cf120767ba875958e97b87ce22203057},
	author = {Sebbar, A. and Zkik, K. and Baddi, Y. and Boulmalf, M. and Kettani, M.D.E.-C.E.}
}
@article {Baddi2020245,
	title = {Msnd: Multicast software defined network based solution to multicast tree construction},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {12293},
	year = {2020},
	note = {cited By 0},
	pages = {245-256},
	abstract = {Internet services provider propose increasingly numerous applications depend on multicast communication patterns, such as database synchronization, newsletter updates, video, and audio group streaming. In spite of, IP multicast is frequently suffered from scaling and instability, which causes internet provider administrators to avoid its utilization. While different multicast protocols in all layers, such as routing and switching, have been created by researchers and providers, through several years, to focus on security, congestion control, and scalability, our work aims to scale multicast regarding the number of supported multicast groups and sources in networks and multicast session. In this paper, we propose an SDN-based IP multicast tree construction module to support and deploy multicast communication-based services. To do so, we take advantage to compute multicast tree, in the centralized way, to achieve a dynamic tree construction algorithm that helps SDN controller to dynamically construct and adjust an optimal multicast tree in all multicast session. The experiments studies on the prototype and simulation system exhibit that our solution gives better performance contrasted with the traditional multicast tree construction algorithms, better also to SDN-based solution proposed in the literature, regarding multicast tree cost, delay, delay variation, and multicast tree construction delay. {\textcopyright} Springer Nature Switzerland AG 2020.},
	keywords = {Database synchronization, Forestry, Internet protocols, Internet services providers, Multicast communication, Multicast protocol, Multicast sessions, Multicast software, Multicast tree construction, Multicasting, Network security, Overlay networks, Simulation systems, Software defined networking, Trees (mathematics), Ubiquitous computing},
	doi = {10.1007/978-3-030-58008-7_20},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85096412695\&doi=10.1007\%2f978-3-030-58008-7_20\&partnerID=40\&md5=f5004a1fb0f79381fe80ca313ad89b13},
	author = {Baddi, Y. and Sebbar, A. and Zkik, K. and Boulmalf, M. and El Kettani, M.D.E.-C.}
}
@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 {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 {Essaaidi2020,
	title = {Preface},
	booktitle = {Proceedings of 2020 5th International Conference on Cloud Computing and Artificial Intelligence: Technologies and Applications, CloudTech 2020},
	year = {2020},
	note = {cited By 0},
	doi = {10.1109/CloudTech49835.2020.9365910},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85102619681\&doi=10.1109\%2fCloudTech49835.2020.9365910\&partnerID=40\&md5=3c74b02844a103a62a82dab03f17563f},
	author = {Essaaidi, M. and Zbakh, M. and Ouacha, A.}
}
@article {Echihabi2020402,
	title = {Return of the lernaean hydra: Experimental evaluation of data series approximate similarity search},
	journal = {Proceedings of the VLDB Endowment},
	volume = {13},
	number = {3},
	year = {2020},
	note = {cited By 25},
	pages = {402-419},
	abstract = {Data series are a special type of multidimensional data present in numerous domains, where similarity search is a key operation that has been extensively studied in the data series literature. In parallel, the multidimensional community has studied approximate similarity search techniques. We propose a taxonomy of similarity search techniques that reconciles the terminology used in these two domains, we describe modifications to data series indexing techniques enabling them to answer approximate similarity queries with quality guarantees, and we conduct a thorough experimental evaluation to compare approximate similarity search techniques under a unified framework, on synthetic and real datasets in memory and on disk. Although data series differ from generic multidimensional vectors (series usually exhibit correlation between neighboring values), our results show that data series techniques answer approximate queries with strong guarantees and an excellent empirical performance, on data series and vectors alike. These techniques outperform the state-of-the-art approximate techniques for vectors when operating on disk, and remain competitive in memory.},
	keywords = {Approximate query, Empirical performance, Experimental evaluation, Indexing techniques, Multi-dimensional vectors, Multidimensional data, Quality control, Query processing, Similarity search, Unified framework},
	doi = {10.14778/3368289.3368303},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85092075628\&doi=10.14778\%2f3368289.3368303\&partnerID=40\&md5=c84591d6c7c3001ccc91a3584e71e4ff},
	author = {Echihabi, K. and Zoumpatianos, K. and Palpanas, T. and Benbrahim, H.}
}
@conference {Echihabi20201,
	title = {Scalable Machine Learning on High-Dimensional Vectors: From Data Series to Deep Network Embeddings},
	booktitle = {ACM International Conference Proceeding Series},
	volume = {Part F162565},
	year = {2020},
	note = {cited By 0},
	pages = {1-6},
	abstract = {There is an increasingly pressing need, by several applications in diverse domains, for developing techniques able to analyze very large collections of static and streaming sequences (a.k.a. data series), predominantly in real-time. Examples of such applications come from Internet of Things installations, neuroscience, astrophysics, and a multitude of other scientific and application domains that need to apply machine learning techniques for knowledge extraction. It is not unusual for these applications, for which similarity search is a core operation, to involve numbers of data series in the order of hundreds of millions to billions, which are seldom analyzed in their full detail due to their sheer size. Such application requirements have driven the development of novel similarity search methods that can facilitate scalable analytics in this context. At the same time, a host of other methods have been developed for similarity search of high-dimensional vectors in general. All these methods are now becoming increasingly important, because of the growing popularity and size of sequence collections, as well as the growing use of high-dimensional vector representations of a large variety of objects (such as text, multimedia, images, audio and video recordings, graphs, database tables, and others) thanks to deep network embeddings. In this work, we review recent efforts in designing techniques for indexing and analyzing massive collections of data series, and argue that they are the methods of choice even for general high-dimensional vectors. Finally, we discuss the challenges and open research problems in this area. {\textcopyright} 2020 Owner/Author.},
	keywords = {Application requirements, Astrophysics, Deep learning, Designing techniques, Embeddings, High-dimensional, Intelligent systems, Knowledge extraction, Learning systems, Machine learning techniques, Real time systems, Research problems, Scalable machine learning, Semantics, Similarity search, Vectors, Video recording},
	doi = {10.1145/3405962.3405989},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85091520891\&doi=10.1145\%2f3405962.3405989\&partnerID=40\&md5=b3b9f8c365e940d7a488d9a9a20df419},
	author = {Echihabi, K. and Zoumpatianos, K. and Palpanas, T.}
}
@article {Zakrani202072,
	title = {Software Effort Estimation Using an Optimal Trees Ensemble: An Empirical Comparative Study},
	journal = {Smart Innovation, Systems and Technologies},
	volume = {146},
	year = {2020},
	note = {cited By 0},
	pages = {72-82},
	abstract = {Since information systems have become the heartbeat of many organizations, the investment in software is growing rapidly and consuming then a significant portion of the company budget. In this context, both the software engineering practitioners and researchers are more interested than ever about accurately estimating the effort and the quality of software product under development. Accurate estimates are desirable but no technique has demonstrated to be successful at effectively and reliably estimating software development effort. In this paper, we propose the use of an optimal trees ensemble (OTE) to predict the software development effort. The ensemble employed is built by combining only the top ranked trees, one by one, from a set of random forests. Each included tree must decrease the unexplained variance of the ensemble for software development effort estimation (SDEE). The effectiveness of the OTE model is compared with other techniques such as regression trees, random forest, RBF neural networks, support vector regression and multiple linear regression in terms of the mean magnitude relative error (MMRE), MdMRE and Pred(l) obtained on five well known datasets namely: ISBSG R8, COCOMO, Tukutuku, Desharnais and Albrecht. According to the results obtained from the experiments, it is shown that the proposed ensemble of optimal trees outperformed almost all the other techniques. Also, OTE model outperformed statistically the other techniques at least in one dataset. {\textcopyright} 2020, Springer Nature Switzerland AG.},
	keywords = {Accuracy evaluation, Budget control, Decision trees, Forestry, Linear regression, Multiple linear regressions, Optimal trees ensemble, Radial basis function networks, Random forests, RBF Neural Network, Regression trees, Software design, Software development effort, Support vector regression (SVR)},
	doi = {10.1007/978-3-030-21005-2_7},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85069482179\&doi=10.1007\%2f978-3-030-21005-2_7\&partnerID=40\&md5=8d9d107d9b52c20f6cd93bb86477a6a0},
	author = {Zakrani, A. and Idri, A. and Hain, M.}
}
@conference {Yousfi202085,
	title = {Spm: Preparing hierarchical data structures for schema matching},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2020},
	note = {cited By 0},
	pages = {85-90},
	abstract = {Schema pre-matching approaches prepare different schema elements for the matching step. Ideally words are extracted from schema elements{\textquoteright} labels and the semantic correspondences are generated. Identifying the sense of words based on their contexts and before schema matching is critical for increasing the total amount of true matches and decreasing significantly the total amount of both missed matches and false matches. However this problem is very challenging since we often do not have complete and precise information about the meaning behind each element. In this paper we present SPM a Sense-based Pre-Matching approach. SPM has two key modules. First the Sets of Words Generator module generates from every schema element a set of words that describes its meaning. Second the Sense Identifier module selects the most appropriate meaning of words based on their contexts. Experimental results on real-world datasets show high effectiveness achieved by SPM. {\textcopyright} 2020 ACM.},
	keywords = {False matches, Hierarchical data structure, Intelligent systems, Pre-matching, Real-world datasets, Schema matching, Semantic correspondence, Semantics},
	doi = {10.1145/3419604.3419782},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85096412741\&doi=10.1145\%2f3419604.3419782\&partnerID=40\&md5=0ace2c18d2f9dd1d741d0d08acb83cfa},
	author = {Yousfi, A. and El Yazidi, M.H. and Zellou, A.}
}
@article {Idrissi2020,
	title = {A systematic literature review of sparsity issues in recommender systems},
	journal = {Social Network Analysis and Mining},
	volume = {10},
	number = {1},
	year = {2020},
	note = {cited By 36},
	abstract = {The tremendous expansion of information available on the web voraciously bombards users, leaving them unable to make decisions and having no way of stepping back to process it all. Recommender systems have emerged in this context as a solution to assist users by providing them with choices of appropriate and relevant items according to their preferences and interests. However, despite their success in many fields and application domains, they still suffer from the main limitation, known as the sparsity problem. The latter refers to the situation where insufficient transactional and feedback data are available for inferring specific user{\textquoteright}s similarities, which affects the accuracy and performance of the recommender system. This paper provides a systematic literature review to investigate, analyze, and discuss the existing relevant contributions and efforts that use new concepts and tools to alleviate the sparsity issues. We have investigated the contributed similarity measures and have uncovered proposed approaches in different types of recommender systems. We have also identified the types of side information more commonly employed by recommender systems. Furthermore, we have examined the criteria that should be valued to enhance recommendation accuracy on sparse data. Each selected article was evaluated for its ability to mitigate the sparsity impediment. Our findings emphasize and accentuate the importance of sparsity in recommender systems and provide researchers and practitioners with insights on proposed solutions and their limitations, which contributes to the development of more powerful systems that can significantly solve the sparsity hurdle and thus enhance further the accuracy and efficiency of recommendations. {\textcopyright} 2020, Springer-Verlag GmbH Austria, part of Springer Nature.},
	keywords = {Collaborative filtering, Powerful systems, Recommendation accuracy, Recommender Systems, Side information, Similarity measure, Sparsity, Sparsity problems, Stepping back, Systematic literature review},
	doi = {10.1007/s13278-020-0626-2},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85079359447\&doi=10.1007\%2fs13278-020-0626-2\&partnerID=40\&md5=742624a91b29d333d839a4cc18b46ced},
	author = {Idrissi, N. and Zellou, A.}
}
@conference {Reda202091,
	title = {Towards a data quality assessment in big data},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2020},
	note = {cited By 4},
	pages = {91-96},
	abstract = {In recent years, as more and more data sources have become available and the volumes of data potentially accessible have increased, the assessment of data quality has taken a central role whether at the academic, professional or any other sector. Given that users are often concerned with the need to filter a large amount of data to better satisfy their requirements and needs, and that data analysis can be based on inaccurate, incomplete, ambiguous, duplicated and of poor quality, it makes everyone wonder what the results of these analyses will really be like. However, there is a very complex process involved in the identification of new, valid, potentially useful and meaningful data from a large data collection and various information systems, and is critically dependent on a number of measures to be developed to ensure data quality. To this end, the main objective of this paper is to introduce a general study on data quality related with big data, by providing what other researchers came up with on that subject. The paper will be finalized by a comparative study between the different existing data quality models. {\textcopyright} 2020 ACM.},
	keywords = {Big data, Comparative studies, Complex Processes, data quality, Data quality assessment, Data quality models, Data reduction, Data-sources, Intelligent systems, Large amounts, Large data},
	doi = {10.1145/3419604.3419803},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85096426287\&doi=10.1145\%2f3419604.3419803\&partnerID=40\&md5=7542ef0e44f4d94b808c64ce466a5eca},
	author = {Reda, O. and Sassi, I. and Zellou, A. and Anter, S.}
}
@article {Yousfi20203,
	title = {Towards a Holistic Schema Matching Approach Designed for Large-Scale Schemas},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {12496 LNAI},
	year = {2020},
	note = {cited By 0},
	pages = {3-15},
	abstract = {Holistic schema matching is a fundamental challenge in the big data integration domain. Ideally, clusters of semantically corresponding elements are created and are updated as more schemas are matched. Developing a high-quality holistic schema matching approach is critical for two main reasons. First, identifying as many accurate and holistic semantic correspondences as possible right from the beginning. Second, reducing considerably the search space. Nevertheless, this problem is challenging since overlapping schema elements are not available. Identifying schema overlaps is further complicated for two main reasons: (1) there is a large number of schemas; and (2) overlaps vary for different schemas. In this paper we present HMO, a Holistic schema Matching approach based on schema Overlaps and designed for large-scale schemas. HMO can balance the search space and the quality of the holistic semantic correspondences. To narrow down the search space, HMO matches schemas based on their overlaps. To obtain high-accuracy, HMO uses an existing high-quality semantic similarity measure. Experimental results on four real-world domains show effectiveness and scalability of our matching approach. {\textcopyright} 2020, Springer Nature Switzerland AG.},
	keywords = {Artificial intelligence, Data integration, High quality, High-accuracy, Holistic schema matching, Real world domain, Search spaces, Semantic correspondence, Semantic similarity measures, Semantics},
	doi = {10.1007/978-3-030-63007-2_1},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85097530171\&doi=10.1007\%2f978-3-030-63007-2_1\&partnerID=40\&md5=aed75e2b584acebebdce7bf0dc2cc076},
	author = {Yousfi, A. and Yazidi, M.H.E. and Zellou, A.}
}
@article {Yousfi2020655,
	title = {xMatcher: Matching extensible markup language schemas using semantic-based techniques},
	journal = {International Journal of Advanced Computer Science and Applications},
	volume = {11},
	number = {8},
	year = {2020},
	note = {cited By 8},
	pages = {655-665},
	abstract = {Schema matching is a critical step in data integration systems. Most recent schema matching systems require a manual double-check of the matching results to add missed matches and remove incorrect matches. Manual correction is labor-intensive and time-consuming, however without it the results accuracy is significantly lower. In this paper, we present xMatcher, an approach to automatically match XML schemas. Given two schemas S and S2, xMatcher identifies semantically similar schema elements between S and S2. To obtain correct matches, xMatcher first transforms S and S2 into sets of words; then, it uses a context-based measure to identify the meanings of words in their contexts; next, it captures semantic relatedness between sets of words in different schemas; finally, it uses WordNet information to calculate the similarity values between semantically related sets and matches the pairs of sets whose similarity values are greater than or equal to 0:8. The results show that xMatcher provides superior matching accuracy compared to the state of the art matching systems. Overall, our proposal can be a stepping stone towards decreasing human assistance and overcoming the weaknesses of current matching initiatives in terms of matching accuracy. {\textcopyright} 2020, Science and Information Organization.},
	keywords = {Critical steps, Data integration, Data integration system, Hypertext systems, Labor time, Matching accuracy, Matching system, Matchings, Ontology, Schema matching, Semantic relatedness, Semantic similarity, Semantics, Wordnet, XML},
	doi = {10.14569/IJACSA.2020.0110880},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85091018595\&doi=10.14569\%2fIJACSA.2020.0110880\&partnerID=40\&md5=dff26b18d541472b808a6d6c85f08039},
	author = {Yousfi, A. and El Yazidi, M.H. and Zellou, A.}
}
@article {Zarnoufi2019672,
	title = {Language identification for user generated content in social media},
	journal = {Smart Innovation, Systems and Technologies},
	volume = {111},
	year = {2019},
	note = {cited By 0},
	pages = {672-678},
	doi = {10.1007/978-3-030-03577-8_73},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85056449806\&doi=10.1007\%2f978-3-030-03577-8_73\&partnerID=40\&md5=0788a6d5259f75585d3c1d415a6c7300},
	author = {Zarnoufi, R. and Jaafar, H. and Abik, M.}
}
@conference {Bekali2019415,
	title = {A Novel Design of Multi-Band Microstrip Patch Antenna for Wireless Communications},
	booktitle = {Mediterranean Microwave Symposium},
	volume = {2018-October},
	year = {2019},
	note = {cited By 0},
	pages = {415-418},
	doi = {10.1109/MMS.2018.8612041},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85061786483\&doi=10.1109\%2fMMS.2018.8612041\&partnerID=40\&md5=500f4918e9ef6cab4ffdad3501ba1f62},
	author = {Bekali, Y.K. and Zugari, A. and Essaaidi, M. and Khalladi, M.}
}
@article {Kasmi2019318,
	title = {Performance analysis of preconditioned conjugate gradient solver on heterogeneous (multi-CPUs/multi-GPUs) architecture},
	journal = {Lecture Notes in Networks and Systems},
	volume = {49},
	year = {2019},
	note = {cited By 0},
	pages = {318-336},
	doi = {10.1007/978-3-319-97719-5_20},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85063287241\&doi=10.1007\%2f978-3-319-97719-5_20\&partnerID=40\&md5=09a40ccb61d934f094c1b14975bae2b4},
	author = {Kasmi, N. and Zbakh, M. and Haouari, A.}
}
@conference {Boulmrharj201856,
	title = {Approach for dimensioning stand-alone photovoltaic systems},
	booktitle = {Energy Procedia},
	volume = {153},
	year = {2018},
	pages = {56-61},
	doi = {10.1016/j.egypro.2018.10.058},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85057433465\&doi=10.1016\%2fj.egypro.2018.10.058\&partnerID=40\&md5=b03f45460b45700ebfe92eb2f1b70e53},
	author = {Boulmrharj, S. and NaitMalek, Y. and Elmouatamid, A. and Bakhouya, M. and Ouladsine, R. and Zine-Dine, K. and Khaidar, M. and Abid, R.}
}
@article {Yousfi201864,
	title = {Assessing the performance of a new semantic similarity measure designed for schema matching for mediation systems},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {11055 LNAI},
	year = {2018},
	pages = {64-74},
	doi = {10.1007/978-3-319-98443-8_7},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85053199922\&doi=10.1007\%2f978-3-319-98443-8_7\&partnerID=40\&md5=18d7047f60af1c46cb3beaeb2b8d7e9a},
	author = {Yousfi, A. and Elyazidi, M.H. and Zellou, A.}
}
@conference {Touhafi20181,
	title = {CloudLab-weaver: An innovative approach to interconnect distributed cloud based online labs},
	booktitle = {Proceedings of 2017 International Conference of Cloud Computing Technologies and Applications, CloudTech 2017},
	volume = {2018-January},
	year = {2018},
	pages = {1-7},
	doi = {10.1109/CloudTech.2017.8284739},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85046685180\&doi=10.1109\%2fCloudTech.2017.8284739\&partnerID=40\&md5=f23d16e0a04a343a36ac33365447f357},
	author = {Touhafi, A. and Braeken, A. and Alla, S.B. and Zbakh, M.}
}
@article {Touhafi2018,
	title = {CoderLabs: A cloud-based platform for real-time online labs with user collaboration},
	journal = {Concurrency Computation},
	year = {2018},
	note = {cited By 0; Article in Press},
	abstract = {In this paper, we describe the architecture of a collaborative and real-time environment for remote experiments. We also introduce a web-based remote lab composer, which allows the interconnection and exchange of data between remote laboratories. The environment is created with web standards as HTML5 such that no plug-in needs to be installed by the user. Users are able to use the remote lab simultaneously and in collaboration. This collaboration between users is made feasible by adopting a message broker. We will discuss how Google Coder is used to develop, change, or create a user interface for a remote experiment and how the labs can be shared in the cloud. Our newest addition to this research consists of a drag and drop lab composer, which allows Lab-developers to use standard widgets, data-visualization tools, and data-ports to compose complex remote labs. A lab-composer engine is developed to automate the coupling of the physical instances and collect the data to be visualized. The principles behind our lab-composer engine are explained in the last part of the paper. {\textcopyright} 2018 John Wiley \& Sons, Ltd.},
	doi = {10.1002/cpe.4377},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85040200242\&doi=10.1002\%2fcpe.4377\&partnerID=40\&md5=87ce9e075bf09d4169586e7b239f683e},
	author = {Touhafi, A. and Braeken, A. and Tahiri, A. and Zbakh, M.}
}
@article {Touhafi2018,
	title = {Coderlabs: A cloud-based platform for real-time online labs with user collaboration},
	journal = {Concurrency Computation},
	volume = {30},
	number = {12},
	year = {2018},
	doi = {10.1002/cpe.4377},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85040200242\&doi=10.1002\%2fcpe.4377\&partnerID=40\&md5=87ce9e075bf09d4169586e7b239f683e},
	author = {Touhafi, A. and Braeken, A. and Tahiri, A. and Zbakh, M.}
}
@article {Aylaj2018982,
	title = {Construction of regular quasi cyclic-low density parity check codes from cyclic codes},
	journal = {ARPN Journal of Engineering and Applied Sciences},
	volume = {13},
	number = {3},
	year = {2018},
	pages = {982-989},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85042232450\&partnerID=40\&md5=28e1cbb2eff93cd7408cd2458e5dd3b4},
	author = {Aylaj, B. and Belkasmi, M. and Nouh, S. and Zouaki, H.}
}
@article {Aylaj2018982,
	title = {Construction of regular quasi cyclic-low density parity check codes from cyclic codes},
	journal = {ARPN Journal of Engineering and Applied Sciences},
	volume = {13},
	number = {3},
	year = {2018},
	note = {cited By 0},
	pages = {982-989},
	abstract = {Low Density Parity Check Codes (LDPC) are a class of linear error-correcting codes which have shown ability to approach or even to reach the capacity of the transmission channel. This class of code approaches asymptotically the fundamental limit of information theory more than the Turbo Convolutional codes. It{\textquoteright}s ideal for long distance transmission satellite, mobile communications and it{\textquoteright}s also used in storage systems. In this paper, a new method for constructing quasicyclic low density parity-check (QC-LDPC) codes derived from cyclic codes is presented. The proposed method reduces the incidence vectors, by eliminating the conjugates lines in parity-check matrix of the derived cyclic code to construct circulant shifting sub-matrices. In the end, this method produces a large class of regular LDPC codes of quasi-cyclic structure having very low density, high coding rates and Tanner graphs which have no short cycles with girth of at least 6. Performance with computer simulations are also shown in this work for some constructed codes. {\textcopyright} 2006-2018 Asian Research Publishing Network (ARPN).},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85042232450\&partnerID=40\&md5=28e1cbb2eff93cd7408cd2458e5dd3b4},
	author = {Aylaj, B. and Belkasmi, M. and Nouh, S. and Zouaki, H.}
}
@conference {Zakroum2018175,
	title = {Exploratory data analysis of a network telescope traffic and prediction of port probing rates},
	booktitle = {2018 IEEE International Conference on Intelligence and Security Informatics, ISI 2018},
	year = {2018},
	pages = {175-180},
	doi = {10.1109/ISI.2018.8587323},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85061067648\&doi=10.1109\%2fISI.2018.8587323\&partnerID=40\&md5=76f77a31025e393df1d23b123bcb8dee},
	author = {Zakroum, M. and Houmz, A. and Ghogho, M. and Mezzour, G. and Lahmadi, A. and Francois, J. and Koutbi, M.E.}
}
@conference {Essaaidi2018,
	title = {Foreword},
	booktitle = {Proceedings of 2017 International Renewable and Sustainable Energy Conference, IRSEC 2017},
	year = {2018},
	doi = {10.1109/IRSEC.2017.8477390},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85055875124\&doi=10.1109\%2fIRSEC.2017.8477390\&partnerID=40\&md5=e6eb6c81b40308e862e8b3e3290b2586},
	author = {Essaaidi, M. and Zaz, Y.}
}
@conference {Mimouni20181,
	title = {The impact of query precision on returned data precision criterion},
	booktitle = {2017 International Conference on Electrical and Computing Technologies and Applications, ICECTA 2017},
	volume = {2018-January},
	year = {2018},
	pages = {1-6},
	doi = {10.1109/ICECTA.2017.8252061},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85045990243\&doi=10.1109\%2fICECTA.2017.8252061\&partnerID=40\&md5=553344ed3926f1d6f3b01b121907b491},
	author = {Mimouni, L. and Zellou, A. and Idri, A.}
}
@article {Landrigan2018462,
	title = {The Lancet Commission on pollution and health},
	journal = {The Lancet},
	volume = {391},
	number = {10119},
	year = {2018},
	pages = {462-512},
	doi = {10.1016/S0140-6736(17)32345-0},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85031763844\&doi=10.1016\%2fS0140-6736\%2817\%2932345-0\&partnerID=40\&md5=a37689cb0e79594159ee6f8afc55fae1},
	author = {Landrigan, P.J. and Fuller, R. and Acosta, N.J.R. and Adeyi, O. and Arnold, R. and Basu, N.N. and Bald{\'e}, A.B. and Bertollini, R. and Bose-O{\textquoteright}Reilly, S. and Boufford, J.I. and Breysse, P.N. and Chiles, T. and Mahidol, C. and Coll-Seck, A.M. and Cropper, M.L. and Fobil, J. and Fuster, V. and Greenstone, M. and Haines, A. and Hanrahan, D. and Hunter, D. and Khare, M. and Krupnick, A. and Lanphear, B. and Lohani, B. and Martin, K. and Mathiasen, K.V. and McTeer, M.A. and Murray, C.J.L. and Ndahimananjara, J.D. and Perera, F. and Poto{\v c}nik, J. and Preker, A.S. and Ramesh, J. and Rockstr{\"o}m, J. and Salinas, C. and Samson, L.D. and Sandilya, K. and Sly, P.D. and Smith, K.R. and Steiner, A. and Stewart, R.B. and Suk, W.A. and van Schayck, O.C.P. and Yadama, G.N. and Yumkella, K. and Zhong, M.}
}
@conference {Echihabi2018112,
	title = {The lernaean hydra of data series similarity search: An experimental evaluation of the state of the art},
	booktitle = {Proceedings of the VLDB Endowment},
	volume = {12},
	number = {2},
	year = {2018},
	pages = {112-127},
	doi = {10.14778/3282495.3282498},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85061729182\&doi=10.14778\%2f3282495.3282498\&partnerID=40\&md5=1b5df3c860cb0457dac9c0facb8d6f52},
	author = {Echihabi, K. and Zoumpatianos, K. and Palpanas, T. and Benbrahim, H.}
}
@conference {Mimouni2018319,
	title = {MDQM: Mediation data quality model aligned data quality model for mediation systems},
	booktitle = {IC3K 2018 - Proceedings of the 10th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management},
	volume = {2},
	year = {2018},
	pages = {319-326},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85059040350\&partnerID=40\&md5=c41fc36d4914e0611e070779b607b7e1},
	author = {Mimouni, L. and Zellou, A. and Idri, A.}
}
@conference {Zarra201888,
	title = {MOOCs{\textquoteright} recommendation based on forum latent dirichlet allocation},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2018},
	pages = {88-93},
	doi = {10.1145/3289100.3289115},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85058674172\&doi=10.1145\%2f3289100.3289115\&partnerID=40\&md5=1de27cf008154c73414e9740b9f86e22},
	author = {Zarra, T. and Chiheb, R. and Faizi, R. and Afia, A.E.}
}
@conference {Bourja2018502,
	title = {MoVITS: Moroccan Video Intelligent Transport System},
	booktitle = {Colloquium in Information Science and Technology, CIST},
	volume = {2018-October},
	year = {2018},
	pages = {502-507},
	doi = {10.1109/CIST.2018.8596566},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85061428090\&doi=10.1109\%2fCIST.2018.8596566\&partnerID=40\&md5=d3b7baffb731883e8897b8cc5356e33e},
	author = {Bourja, O. and Kabbaj, K. and Derrouz, H. and El Bouziady, A. and Thami, R.O.H. and Zennayi, Y. and Bourzeix, F.}
}
@conference {Saissi2018111,
	title = {A new clustering approach to identify the values to query the deep web access forms},
	booktitle = {2018 4th International Conference on Computer and Technology Applications, ICCTA 2018},
	year = {2018},
	pages = {111-116},
	doi = {10.1109/CATA.2018.8398666},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85050215563\&doi=10.1109\%2fCATA.2018.8398666\&partnerID=40\&md5=9301955ef076b676312ef8b2d6fa454a},
	author = {Saissi, Y. and Zellou, A. and Idri, A.}
}
@conference {Selma2018212,
	title = {A New Mapping Approach between XML Schemas in a P2P Environment},
	booktitle = {Proceedings - International Conference on Developments in eSystems Engineering, DeSE},
	year = {2018},
	pages = {212-217},
	doi = {10.1109/DeSE.2017.16},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85056190704\&doi=10.1109\%2fDeSE.2017.16\&partnerID=40\&md5=9968d6ce7b4ae7d6fb9f91cb21c0281a},
	author = {Selma, E.Y.E.I. and Zellou, A. and Idri, A.}
}
@conference {Kasmi20181,
	title = {Performance evaluation of StarPU schedulers with preconditioned conjugate gradient solver on heterogeneous (multi-CPUs/multi-GPUs) architecture},
	booktitle = {Proceedings of 2017 International Conference of Cloud Computing Technologies and Applications, CloudTech 2017},
	volume = {2018-January},
	year = {2018},
	pages = {1-6},
	doi = {10.1109/CloudTech.2017.8284742},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85046664197\&doi=10.1109\%2fCloudTech.2017.8284742\&partnerID=40\&md5=15d1bacdcdc6b413b42b5bc9c3059bfb},
	author = {Kasmi, N. and Zbakh, M. and Samadi, Y. and Cherkaoui, R. and Haouari, A.}
}
@conference {Essaaidi20181,
	title = {Preface},
	booktitle = {Proceedings of 2017 International Conference of Cloud Computing Technologies and Applications, CloudTech 2017},
	volume = {2018-January},
	year = {2018},
	pages = {1},
	doi = {10.1109/CloudTech.2017.8284695},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85046638075\&doi=10.1109\%2fCloudTech.2017.8284695\&partnerID=40\&md5=d1991fc2f2164bd18b0d514a9e640661},
	author = {Essaaidi, M. and Zbakh, M.}
}
@article {Zbakh2018160,
	title = {Recent advances in big data management-PART 1},
	journal = {Recent Patents on Computer Science},
	volume = {11},
	number = {3},
	year = {2018},
	pages = {160},
	doi = {10.2174/221327591103181030122822},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85061479245\&doi=10.2174\%2f221327591103181030122822\&partnerID=40\&md5=ba4e1781f7acc93166ab576d2616ac51},
	author = {Zbakh, M. and Ma, K.}
}
@article {CruzZapata2018,
	title = {Reusable Software Usability Specifications for mHealth Applications},
	journal = {Journal of Medical Systems},
	volume = {42},
	number = {3},
	year = {2018},
	note = {cited By 0},
	abstract = {One of the key factors for the adoption of mobile technologies, and in particular of mobile health applications, is usability. A usable application will be easier to use and understand by users, and will improve user{\textquoteright}s interaction with it. This paper proposes a software requirements catalog for usable mobile health applications, which can be used for the development of new applications, or the evaluation of existing ones. The catalog is based on the main identified sources in literature on usability and mobile health applications. Our catalog was organized according to the ISO/IEC/IEEE 29148:2011 standard and follows the SIREN methodology to create reusable catalogs. The applicability of the catalog was verified by the creation of an audit method, which was used to perform the evaluation of a real app, S Health, application created by Samsung Electronics Co. The usability requirements catalog, along with the audit method, identified several usability flaws on the evaluated app, which scored 83\%. Some flaws were detected in the app related to the navigation pattern. Some more issues related to the startup experience, empty screens or writing style were also found. The way a user navigates through an application improves or deteriorates user{\textquoteright}s experience with the application. We proposed a reusable usability catalog and an audit method. This proposal was used to evaluate a mobile health application. An audit report was created with the usability issues identified on the evaluated application. {\textcopyright} 2018, Springer Science+Business Media, LLC, part of Springer Nature.},
	doi = {10.1007/s10916-018-0902-0},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85040984885\&doi=10.1007\%2fs10916-018-0902-0\&partnerID=40\&md5=32ddf999ef891e8986a8a19c7271249a},
	author = {Cruz Zapata, B. and Fernandez-Aleman, J.L. and Toval, A. and Idri, A.}
}
@conference {Naji20181,
	title = {A secure virtualization architecture based on a nested Nova hypervisor},
	booktitle = {Proceedings of 2017 International Conference of Cloud Computing Technologies and Applications, CloudTech 2017},
	volume = {2018-January},
	year = {2018},
	pages = {1-7},
	doi = {10.1109/CloudTech.2017.8284737},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85046642436\&doi=10.1109\%2fCloudTech.2017.8284737\&partnerID=40\&md5=1cfbc9ea2bde9c6ea073f19601649c07},
	author = {Naji, H.Z. and Zbakh, M.}
}
@conference {Boulmrharj2018,
	title = {Towards a battery characterization methodology for performance evaluation of micro-grid systems},
	booktitle = {2018 International Conference on Smart Energy Systems and Technologies, SEST 2018 - Proceedings},
	year = {2018},
	doi = {10.1109/SEST.2018.8495829},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85056492547\&doi=10.1109\%2fSEST.2018.8495829\&partnerID=40\&md5=f25a82d795aa6991c23f1064013cde45},
	author = {Boulmrharj, S. and NaitMalek, Y. and Mouatamid, A.E. and Ouladsine, R. and Bakhouya, M. and Ouldmoussa, M. and Zine-Dine, K. and Khaidar, M. and Abid, R.}
}
@conference {Elmouatamid2018984,
	title = {Towards a Demand/Response Control Approach for Micro-grid Systems},
	booktitle = {2018 5th International Conference on Control, Decision and Information Technologies, CoDIT 2018},
	year = {2018},
	pages = {984-988},
	doi = {10.1109/CoDIT.2018.8394951},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85050227456\&doi=10.1109\%2fCoDIT.2018.8394951\&partnerID=40\&md5=97a6b224a481de8a0d5d91a46b76b895},
	author = {Elmouatamid, A. and NaitMalek, Y. and Ouladsine, R. and Bakhouya, M. and Elkamoun, N. and Zine-Dine, K. and Khaidar, M. and Abid, R.}
}
@conference {Saidi2018,
	title = {Translation of heterogeneous requirements meta-models through a pivot meta-model},
	booktitle = {ENASE 2018 - Proceedings of the 13th International Conference on Evaluation of Novel Approaches to Software Engineering},
	volume = {2018-January},
	year = {2018},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85056807026\&partnerID=40\&md5=f8a470ca9cd9874928c91f4110c79259},
	author = {Saidi, I.E. and El Hamlaoui, M. and Dkaki, T. and Zarour, N.E. and Charrel, P.-J.}
}
@article {ElOuahabi2018537,
	title = {A very compact design of a triple-band bandstop filter based on a complementary split ring resonator},
	journal = {International Journal of Microwave and Optical Technology},
	volume = {13},
	number = {6},
	year = {2018},
	pages = {537-543},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85057379564\&partnerID=40\&md5=a6c46510eb0891ee5de2a97ba4dc3343},
	author = {El Ouahabi, M. and Zakriti, A. and Essaaidi, M. and Dkiouak, A.}
}
@conference {Zouina20171615,
	title = {An aspiring solution to the MITM bootstrap vulnerability},
	booktitle = {Proceedings of the 29th International Business Information Management Association Conference - Education Excellence and Innovation Management through Vision 2020: From Regional Development Sustainability to Global Economic Growth},
	year = {2017},
	note = {cited By 0},
	pages = {1615-1622},
	abstract = {The proposed work falls within the context of improving data security for m-commerce (mobile commerce) systems. In this context we have placed under the light some flaws encountered in HTTPS (Hypertext Transfer Protocol Secure) the most used m-commerce protocol, particularly the man in the middle attack, shortly MITM. The man in the middle attack is an active listening attack; the idea of this attack is to target the handshake phase of the HTTPS protocol which is the transition from a non-secure connection to a secure connection in our case HTTP (Hypertext Transfer Protocol) to HTTPS. This paper proposes a solution to fix those flaws based on the upgrade of HSTS (HTTP Strict Transport Security) standard handshake sequence using the DNSSEC standard (Domain Name System Security Extensions).},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85029759601\&partnerID=40\&md5=963ec95920c1fef56bbbb9224b5f2501},
	author = {Zouina, M. and Outtaj, B.}
}
@article {Zbakh2017,
	title = {Cloud computing and big data: Technologies and applications},
	journal = {Concurrency Computation},
	volume = {29},
	number = {11},
	year = {2017},
	note = {cited By 0},
	doi = {10.1002/cpe.4090},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85016746583\&doi=10.1002\%2fcpe.4090\&partnerID=40\&md5=9141a8028ba6f3210a8167cfdc5f9bc2},
	author = {Zbakh, M. and Bakhouya, M. and Essaaidi, M.}
}
@conference {Touhafi2017317,
	title = {CoderLabs: A cloud based platform for real time online labs with user collaboration},
	booktitle = {Proceedings of 2016 International Conference on Cloud Computing Technologies and Applications, CloudTech 2016},
	year = {2017},
	note = {cited By 0},
	pages = {317-324},
	abstract = {In this paper we describe the architecture of a real time environment for numerous remote experiments. The environment is created with web standards as HTML5 such that no plug-in needs to be installed by the user. Users are able to use the remote lab simultaneously and in collaboration. This collaboration between users is made feasible by adopting a message broker. Finally, by using Google Coder, developers can easily change or create the user interface of their remote experiments and share experiments in the cloud. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/CloudTech.2016.7847716},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85013760325\&doi=10.1109\%2fCloudTech.2016.7847716\&partnerID=40\&md5=a6e262cd949bd66450aa627b3aa53c03},
	author = {Touhafi, A. and Braeken, A. and Tahiri, A. and Zbakh, M.}
}
@conference {Zerrouk2017,
	title = {Collaborative modelling: An MDE-oriented process to manage large-scale models},
	booktitle = {2017 International Conference on Wireless Technologies, Embedded and Intelligent Systems, WITS 2017},
	year = {2017},
	note = {cited By 0},
	abstract = {The application of Model Driven Engineering in an industrial context implies working with large models, hence the need for collaborative modeling. Each developer focuses on a part of the large model and may manipulate it independently. As each part evolves rapidly and concurrently due to changes made by different designers, inconsistencies may occur. This work aims to provide support for dealing with concurrent changes. We propose a metamodel for the description of large models, and we also propose a process for the management of concurrent changes. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/WITS.2017.7934626},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85021631540\&doi=10.1109\%2fWITS.2017.7934626\&partnerID=40\&md5=21c3bf573defa27ec9db8cab24e64611},
	author = {Zerrouk, M. and Anwar, A. and Benelallam, I. and Elhamlaoui, M.}
}
@conference {Bouzbita2017344,
	title = {Dynamic adaptation of the ACS-TSP local pheromone decay parameter based on the Hidden Markov Model},
	booktitle = {Proceedings of 2016 International Conference on Cloud Computing Technologies and Applications, CloudTech 2016},
	year = {2017},
	note = {cited By 1},
	pages = {344-349},
	abstract = {The objective of the present paper is to propose an improved Ant Colony System (ACS) algorithm based on a Hidden Markov Model (HMM) so as dynamically adapt the local pheromone decay parameter ξ. The proposed algorithm uses Iteration and Diversity as indicators of the hidden states in the search space in ACS. To test the efficiency of our algorithm, we experimented it on several benchmark Travelling Salesman Problem (TSP) instances. The results have proven the effectiveness of our algorithm in both the convergence speed and the solution quality. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/CloudTech.2016.7847719},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85013861130\&doi=10.1109\%2fCloudTech.2016.7847719\&partnerID=40\&md5=26cafb2d23ee70bf2f3552d7fec22e8a},
	author = {Bouzbita, S. and El Afia, A. and Faizi, R. and Zbakh, M.}
}
@conference {Essaaidi2017,
	title = {Foreword},
	booktitle = {Proceedings of 2016 International Renewable and Sustainable Energy Conference, IRSEC 2016},
	year = {2017},
	note = {cited By 0},
	doi = {10.1109/IRSEC.2016.7983861},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85027879548\&doi=10.1109\%2fIRSEC.2016.7983861\&partnerID=40\&md5=80dc521166aa6b1b18a1fef9e0093cc2},
	author = {Essaaidi, M. and Zaz, Y.}
}
@conference {Essaaidi2017,
	title = {Foreword},
	booktitle = {International Conference on Multimedia Computing and Systems -Proceedings},
	year = {2017},
	note = {cited By 0},
	doi = {10.1109/ICMCS.2016.7905518},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85019133982\&doi=10.1109\%2fICMCS.2016.7905518\&partnerID=40\&md5=8d0a345cf8d5fe3ab204132558b4ff4f},
	author = {Essaaidi, M. and Zaz, Y.}
}
@conference {Mrhar2017557,
	title = {Making MOOCs matter in formal education through a federating environment},
	booktitle = {Proceedings of the European Conference on e-Learning, ECEL},
	volume = {2010-October},
	year = {2017},
	note = {cited By 0},
	pages = {557-565},
	abstract = {With the emergence of open education and MOOCs, the opportunities and contribution of non-formal learning to the acquisition of knowledge and skills have increased. This type of learning, which has the advantage of being voluntary relying mainly on the learners{\textquoteright} motivation, remains technically invisible to formal learning environments. Finding suggest that the formal learning becomes increasingly less adapted to the learners needs because it does not take into consideration the real learner{\textquoteright}s profile (knowledge, skills, etc.) updated by non-formal learning. In order, to bridging formal and non-formal learning, we are aiming to personalize formal learning by recovering the learner{\textquoteright}s knowledge, abilities and skills which are acquired by non-formal learning (MOOCs). We propose in this paper, a federating environment for MOOCs hosted in different platforms such as (Coursera, open EdX..). The main objective of this environment is to provide to the formal learning environment a recommender system of MOOCs. The technical aspects of a federating environment of MOOCs (FEM) are presented. FEM is composed of an integration system and a recommender system of MOOCs. The integration system is responsible for integrating data emanating from different heterogeneous MOOCs platforms. The recommender system is based on the learners{\textquoteright} profiles and on the pedagogical objectives set by the concerned establishment that integrates the federating environment FEM. FEM also enables establishments to adapt the formal learning through the enriched learners{\textquoteright} profiles. {\textcopyright} The Authors, 2017.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85037541912\&partnerID=40\&md5=345a1683d5b625a972e3de33841d44c8},
	author = {Mrhar, K. and Zary, N. and Abik, M.}
}
@conference {Zakaria2017,
	title = {Non-binary Euclidean Geometry codes: Majority Logic Decoding},
	booktitle = {2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 - Proceedings},
	year = {2017},
	note = {cited By 0},
	abstract = {Non-binary One Step Majority Logic decodable (OSMLD) codes have several advantages over their binary counterparts but unfortunately their decoding complexity is significantly challenging. In this paper, we propose two contributions. Our first contribution is to use the Majority-Logic Decoding (MLGD) algorithm for non-binary cyclic OSMLD codes, since it involves only finite field addition and multiplication, in addition to a majority vote, and hence has significantly lower complexity than other decoding algorithms, which seems to be an attractive choice. The second contribution is to use finite geometry codes, even those of prime fields, because they have a large number of orthogonal equations which makes them good candidates for the MLGD algorithm, so we can benefit from its low complexity. We also investigate the power correction of this algorithm and the results are quite satisfying. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ACOSIS.2016.7843943},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015156977\&doi=10.1109\%2fACOSIS.2016.7843943\&partnerID=40\&md5=8b93306a50f5227acb219e0067afb94a},
	author = {Zakaria, M. and Fouad, A. and Mostafa, B. and Anouar, Y. and El Abidine Alaoui Ismaili, Z.}
}
@article {Zouina2017,
	title = {A novel lightweight URL phishing detection system using SVM and similarity index},
	journal = {Human-centric Computing and Information Sciences},
	volume = {7},
	number = {1},
	year = {2017},
	note = {cited By 1},
	abstract = {The phishing is a technique used by cyber-criminals to impersonate legitimate websites in order to obtain personal information. This paper presents a novel lightweight phishing detection approach completely based on the URL (uniform resource locator). The mentioned system produces a very satisfying recognition rate which is 95.80\%. This system, is an SVM (support vector machine) tested on a 2000 records data-set consisting of 1000 legitimate and 1000 phishing URLs records. In the literature, several works tackled the phishing attack. However those systems are not optimal to smartphones and other embed devices because of their complex computing and their high battery usage. The proposed system uses only six URL features to perform the recognition. The mentioned features are the URL size, the number of hyphens, the number of dots, the number of numeric characters plus a discrete variable that correspond to the presence of an IP address in the URL and finally the similarity index. Proven by the results of this study the similarity index, the feature we introduce for the first time as input to the phishing detection systems improves the overall recognition rate by 21.8\%. {\textcopyright} 2017, The Author(s).},
	doi = {10.1186/s13673-017-0098-1},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85020465562\&doi=10.1186\%2fs13673-017-0098-1\&partnerID=40\&md5=8781f2d95cd57e8104c9158ba92a38dd},
	author = {Zouina, M. and Outtaj, B.}
}
@conference {Moumen2017,
	title = {A novel text-to-speech synthesizer for processing sms in moroccan Arabic},
	booktitle = {Proceedings of International Conference on Computers and Industrial Engineering, CIE},
	year = {2017},
	note = {cited By 0},
	abstract = {This paper proposes a novel text-to-speech (TTS) system that converts text messages (SMS) into speech sequences. This system takes into consideration the characteristics of the Moroccan context, where several languages might be used in the same text message. Therefore, the languages that are analyzed in this work are English, French, Moroccan Arabic and Modern Standard Arabic (MSA). Processing French, English, or Modern Standard Arabic is common and has given satisfying results. However, Moroccan Arabic remains under-studied for many reasons, particularly the lack of data resources given that this Arabic dialect is primarily spoken and non-codified.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85040947811\&partnerID=40\&md5=1ddd4fb5d94d0350d8211d7bc3fc7c61},
	author = {Moumen, R. and Chiheb, R. and Zarra, T. and Faizi, R. and El Afia, A.}
}
@article {Cherkaoui2017206,
	title = {Performance analysis of intrusion detection systems in cloud-based systems},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {10542 LNCS},
	year = {2017},
	note = {cited By 0},
	pages = {206-213},
	abstract = {Cloud computing services are widely used nowadays and need to be more secured for an effective exploitation by the users. One of the most challenging issues in these environments is the security of the hosted data. Many cloud computing providers offer web applications for their clients, this is why the most handling attacks in cloud computing are Distributed Denial of Service (DDoS). In this paper, we provide a comparative performance analysis of intrusion detection systems (IDSs) in a real world lab. The aim is to provide an up to date study for researchers and practitioners to understand the issues related to intrusion detection and to deal with DDoS attacks. This analysis includes intrusion detection rates, time running, etc. In the experiments, we configured a cloud platform using OpenStack and an IDS monitoring the whole network traffic of the web server configured. The results show that Suricata drops fewer packets than Bro and Snort successively when a DDoS attack is happening and detect more malicious packets. {\textcopyright} Springer International Publishing AG 2017.},
	doi = {10.1007/978-3-319-68179-5_18},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85034613510\&doi=10.1007\%2f978-3-319-68179-5_18\&partnerID=40\&md5=3e0ce668710d845db260ee41dabb49b5},
	author = {Cherkaoui, R. and Zbakh, M. and Braeken, A. and Touhafi, A.}
}
@conference {Essaaidi2017,
	title = {Preface},
	booktitle = {Proceedings of 2016 International Conference on Cloud Computing Technologies and Applications, CloudTech 2016},
	year = {2017},
	note = {cited By 0},
	doi = {10.1109/CloudTech.2016.7847678},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85013815065\&doi=10.1109\%2fCloudTech.2016.7847678\&partnerID=40\&md5=afb7995783f787b1355795e838f8e423},
	author = {Essaaidi, M. and Zbakh, M.}
}
@conference {Harraz2017230,
	title = {Study of an adaptive approach for a Cloud system implementation},
	booktitle = {Proceedings of 2016 International Conference on Cloud Computing Technologies and Applications, CloudTech 2016},
	year = {2017},
	note = {cited By 0},
	pages = {230-236},
	abstract = {In the few recent years a new paradigm has emerged, with the onward steps that revolutionized the internet and the machines interconnected over it. This has lead the modern technological world to be considered as a virtual sphere interconnecting things using internet, being called the Cloud Computing where any object can communicate with any other object using a network such as the internet. The Cloud Computing makes it possible for end users to profit from the high speed and high performance of remote machines, and deploys a business where internet providers can implement distributed resources and services based on modern technologies to address the needs of the end users. In such paradigm, all components should work in a fashion to provide the best response time possible, one way of doing that is through load balancing algorithms. In this paper we propose a cloud load balancing algorithm that relates to the stochastic and random behavior of any networking system, we show as a result that we can achieve a game theoretic load balancing policy based on the samples of the load in time. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/CloudTech.2016.7847704},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85013764269\&doi=10.1109\%2fCloudTech.2016.7847704\&partnerID=40\&md5=34d05b50f0f8af7eb7ee1964533a0ebd},
	author = {Harraz, A. and Bissiriou, C. and Cherkaoui, R. and Zbakh, M.}
}
@conference {Saissi201794,
	title = {Towards XML schema extraction from deep web},
	booktitle = {Colloquium in Information Science and Technology, CIST},
	year = {2017},
	note = {cited By 0},
	pages = {94-99},
	abstract = {Today, not all the web is fully accessible by the web search engines. There is a hidden and inaccessible part of the web called the deep web. Many methods exist in the literature to access and to integrate the huge structured data contained in the deep web. In this paper, we propose our approach to extract the XML schema describing a selected deep web source. Our approach is based on the static and the dynamic analysis of the HTML forms giving access to the selected deep web source. Our approach uses two knowledge database during its process: our proprietary identification tables and Wordnet. The XML schema extracted will be used to integrate the associated deep web source into a mediation system without extracting all its information. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/CIST.2016.7805022},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010190133\&doi=10.1109\%2fCIST.2016.7805022\&partnerID=40\&md5=0c383caab22e43a339e6b52acca8947b},
	author = {Saissi, Y. and Zellou, A. and Idri, A.}
}
@conference {Saissi201794,
	title = {Towards XML schema extraction from deep web},
	booktitle = {Colloquium in Information Science and Technology, CIST},
	year = {2017},
	note = {cited By 0},
	pages = {94-99},
	abstract = {Today, not all the web is fully accessible by the web search engines. There is a hidden and inaccessible part of the web called the deep web. Many methods exist in the literature to access and to integrate the huge structured data contained in the deep web. In this paper, we propose our approach to extract the XML schema describing a selected deep web source. Our approach is based on the static and the dynamic analysis of the HTML forms giving access to the selected deep web source. Our approach uses two knowledge database during its process: our proprietary identification tables and Wordnet. The XML schema extracted will be used to integrate the associated deep web source into a mediation system without extracting all its information. {\"\i}{\textquestiondown}{\textonehalf} 2016 IEEE.},
	doi = {10.1109/CIST.2016.7805022},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010190133\&doi=10.1109\%2fCIST.2016.7805022\&partnerID=40\&md5=0c383caab22e43a339e6b52acca8947b},
	author = {Saissi, Y. and Zellou, A. and Idri, A.}
}
@article {Bahri2016848,
	title = {BLB tree: An efficient index structure for fast search},
	journal = {International Review on Computers and Software},
	volume = {11},
	number = {10},
	year = {2016},
	note = {cited By 0},
	pages = {848-858},
	abstract = {Due of its interest in different areas, similarity search in high-dimensional spaces is one of the principal research axes today for CBIR Systems. The properties for high-dimensional data demand some adequate search methods to have a research in optimal time. Due to the curse of dimensionality, search time in the index structure exponentially increases, according the dimension of the descriptor. However, the performances of classical index structures become less than the sequential scan of data in search time when answering exact nearest neighbor queries. To overcome this problematic, two major approaches for high-dimensional data in CBIR systems have been proposed: The first approach permits to speed up the search by using multiple levels of lower bound distances, the second approach exploits the BTree index structure to speed up the search. We propose to combine both techniques to search for large nearest neighbors in a high-dimensional space. We develop a new multidimensional index structure, called BLBTree. In BLB Tree, instead of computing the distances in the high-dimensional original space to find the nearest neighbor, lot of candidates are to be rejected based on the lower bound distances: the research in BLB Tree does not calculate the distances in the high-dimensional original space to find the nearest neighbor if the lower bounding distance exceeds the threshold, because the distances in the high-dimensional cannot be lower than the distances in the low-dimensional. We note that each object in BLB Tree is described by a pyramid structure of histograms, with each histogram representing the lower resolution of the other histogram; due to this property, our index structure is well-suited for high-dimensional and large-scale problems. We have shown that our approach provides interesting and powerful experimental results. {\textcopyright} 2016 Praise Worthy Prize S.r.l. - All rights reserved.},
	doi = {10.15866/irecos.v11i10.9711},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85011708729\&doi=10.15866\%2firecos.v11i10.9711\&partnerID=40\&md5=db12b847849b16d2e0b98f325a4022c5},
	author = {Bahri, A.a and Zouaki, H.a and Thami, R.O.H.b}
}
@conference {Aylaj2016557,
	title = {Degeneration simulated annealing algorithm for combinatorial optimization problems},
	booktitle = {International Conference on Intelligent Systems Design and Applications, ISDA},
	volume = {2016-June},
	year = {2016},
	note = {cited By 0},
	pages = {557-562},
	abstract = {In this paper, we use the physical aspect of the simulated annealing method in order to propose a modified simulated annealing algorithm. The main idea of the algorithm is based to find the optimal solution of a combinatorial optimization problem by switching between two different subsystems of treatment; using so called degeneration of atoms energy. This new algorithm is named Degeneration Simulated Annealing (DSA) algorithm. To illustrate the effectiveness of DSA, it is applied to solve the problems of the minimum distance and the decoding, in coding theory. The computational experiment results obtained by DSA are very interesting. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/ISDA.2015.7489177},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84978430456\&doi=10.1109\%2fISDA.2015.7489177\&partnerID=40\&md5=0471da6bb951204df77f8f7a184b034d},
	author = {Aylaj, B.a and Belkasmi, M.b and Zouaki, H.a and Berkani, A.b}
}
@article {Bachir2016321,
	title = {Dominant multipoint relaying method for efficient proactive routing schema},
	journal = {Ad-Hoc and Sensor Wireless Networks},
	volume = {33},
	number = {1-4},
	year = {2016},
	note = {cited By 0},
	pages = {321-338},
	abstract = {The performance of proactive routing protocol in the context of mobile ad hoc networks (MANET) depends on broadcasting schemas. They are essential to build up an efficient topology knowledge which is required to compute valid routes to any destination inside network. In this paper, we focus on neighbor knowledge broadcasting especially on multipoint relaying concept. We have modeled the problem of multipoint relaying nodes selection as a set cover problem and customized the domain of feasible solution and the target set to be covered based on greedy approach and neighborhood relation. To assess the performance of our proposal referred as Enhanced Dominating Multipoint Relaying (EDMPR) method we have implemented it in the context of OLSR. Our findings suggest that the proposed method enables broadcasting signaling packets (i.e. topology messages) packets in a faster manner with a reduced number of broadcasting nodes. {\textcopyright} 2016 Old City Publishing, Inc.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84996743438\&partnerID=40\&md5=4b6e635684dcd4a5121acf22d335fa2a},
	author = {Bachir, B.a and Ahmed, H.a b and Zouhair, G.b}
}
@article { ISI:000389653700013,
	title = {Dominant Multipoint Relaying Method for Efficient Proactive Routing Schema},
	journal = {AD HOC \& SENSOR WIRELESS NETWORKS},
	volume = {33},
	number = {1-4},
	year = {2016},
	pages = {321-338},
	abstract = {The performance of proactive routing protocol in the context of mobile ad hoc networks (MANET) depends on broadcasting schemas. They are essential to build up an efficient topology knowledge which is required to compute valid routes to any destination inside network. In this paper, we focus on neighbor knowledge broadcasting especially on multipoint relaying concept. We have modeled the problem of multipoint relaying nodes selection as a set cover problem and customized the domain of feasible solution and the target set to be covered based on greedy approach and neighborhood relation. To assess the performance of our proposal referred as Enhanced Dominating Multipoint Relaying (EDMPR) method we have implemented it in the context of OLSR. Our findings suggest that the proposed method enables broadcasting signaling packets (i.e. topology messages) packets in a faster manner with a reduced number of broadcasting nodes.},
	issn = {1551-9899},
	author = {Bachir, Bouamoud and Ahmed, Habbani and Zouhair, Guennoun}
}
@article {11984480720160715,
	title = {Dominant Multipoint Relaying Method for Efficient Proactive Routing Schema.},
	journal = {Adhoc \& Sensor Wireless Networks},
	volume = {33},
	number = {1-4},
	year = {2016},
	pages = {321 - 338},
	abstract = {The performance of proactive routing protocol in the context of mobile ad hoc networks (MANET) depends on broadcasting schemas. They are essential to build up an efficient topology knowledge which is required to compute valid routes to any destination inside network. In this paper, we focus on neighbor knowledge broadcasting especially on multipoint relaying concept. We have modeled the problem of multipoint relaying nodes selection as a set cover problem and customized the domain of feasible solution and the target set to be covered based on greedy approach and neighborhood relation. To assess the performance of our proposal referred as Enhanced Dominating Multipoint Relaying (EDMPR) method we have implemented it in the context of OLSR. Our findings suggest that the proposed method enables broadcasting signaling packets (i.e. topology messages) packets in a faster manner with a reduced number of broadcasting nodes. [ABSTRACT FROM AUTHOR]},
	keywords = {Ad hoc networks (Computer networks), Broadcast storm, Data packets \& packeting, mobile ad hoc network, Multipoint distribution service, Multipoint relaying, neighbor knowledge broadcast, proactive routing, Routing (Computer network management), Self-organizing systems},
	issn = {15519899},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=119844807\&site=ehost-live},
	author = {Bachir, Bouamoud and Ahmed, Habbani and Zouhair, Guennoun}
}
@article {Ouahabi201658,
	title = {Dual-band band stop filter based on complementary split ring resonator},
	journal = {International Journal of Microwave and Optical Technology},
	volume = {11},
	number = {1},
	year = {2016},
	note = {cited By 0},
	pages = {58-63},
	abstract = {This paper describes the design of dual-band band stop filter (DBBSF). This architecture use complementary split ring resonator to tune the band stop frequencies and the filter characteristics are improved using three open stubs. The CSRR is used to reject two frequency responses at 2.45GHz and 5.8GHz, operating in the Industrial Scientific Medical (ISM), and the open stubs are employed to improve the return loss between the two frequency responses. To validate the design concept, a prototype of DBBSF was fabricated and evaluated. The measured frequency responses agree well with the simulation results, validating our proposed design. {\textcopyright} 2016 IAMOT.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84957795026\&partnerID=40\&md5=812924442f8aa6943b13515c0beae228},
	author = {Ouahabi, M.E.a and Zakriti, A.b and Essaaidi, M.c and Touhami, N.A.a}
}
@article { ISI:000391110500010,
	title = {Good Quasi-Cyclic Codes from Circulant Matrices Concatenation using a Heuristic Method},
	journal = {INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS},
	volume = {7},
	number = {9},
	year = {2016},
	month = {SEP},
	pages = {63-68},
	abstract = {In this paper we present a method to search q circulant matrices; the concatenation of these circulant matrices with circulant identity matrix generates quasi-cyclic codes with high various code rate q/(q+1) (q an integer). This method searches circulant matrices in order to find the good quasi-cyclic code (QCC) having the largest minimum distance. A modified simulated annealing algorithm is used as an evaluator tool of the minimum distance of the obtained QCC codes. Based on this method we found 16 good quasi-cyclic codes with rates (1/2, 2/3 and 3/4), their estimated minimum distance reaches the lower bounds of codes considered to be the better linear block codes in Brouwer{\textquoteright}s database.},
	issn = {2158-107X},
	author = {Aylaj, Bouchaib and Belkasmi, Mostafa and Nouh, Said and Zouaki, Hamid}
}
@article { ISI:000389062400012,
	title = {Interoperability Plug-in between Petri Networks and SQL},
	journal = {INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY},
	volume = {16},
	number = {7},
	year = {2016},
	month = {JUL 30},
	pages = {117-123},
	abstract = {Petri nets are a mathematical formalism for modeling a large set of dynamic systems. They are applied in practice by industry, academia, and in other domains. Its powerful positive is that there is different kind of Petri Nets, Ordinary Petri Nets, Timed Petri Nets, and Color ed Petri Nets. So, it will be very beneficial to develop applications related to these Petri Nets. For this reason, the main objective of this work is to propose a translation process of a Petri Nets to Sql script following the MDA approach. The whole work is a framework intended to offer a code generator that will generate a whole user-defined application from a multiview system. This new framework will be used by companies that are working on agile software development to deliver to their customer a cloud environment dedicated to software production with a high level and scalable code and Application generator in order to minimize the time, cost and efforts.},
	issn = {1738-7906},
	author = {Zeddari, Abderrazzak and Ettalbi, Ahmed}
}
@conference {Anter2016,
	title = {Nk-schemas: A novel algorithm for creating the view{\textquoteright} schemas to materialize in hybrid mediator},
	booktitle = {Proceedings of IEEE/ACS International Conference on Computer Systems and Applications, AICCSA},
	volume = {2016-July},
	year = {2016},
	note = {cited By 0},
	abstract = {The explosion of information and telecommunications technologies, has made easy the access and production of information. Thus, a very large mass of the latter has generated. This situation has made the integration systems an immediate necessity. Among these systems, there is the hybrid mediator. The latter interrogates one part of data on demand as in the virtual approach, while charging, filtering and storing the second part, as views, in a local database. The creation of this second part is a critical task. We propose in this paper, a new algorithm for creating views{\textquoteright} schemas to materialize in the hybrid integration system. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/AICCSA.2015.7507200},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84980416133\&doi=10.1109\%2fAICCSA.2015.7507200\&partnerID=40\&md5=1412e0fe0867141a2f0ec5a2e0034ebb},
	author = {Anter, S. and Zellou, A. and Idri, A.}
}
@article {Anter20162128,
	title = {Retrieving and materializing data in hybrid mediators},
	journal = {International Journal of Applied Engineering Research},
	volume = {11},
	number = {3},
	year = {2016},
	note = {cited By 0},
	pages = {2128-2134},
	abstract = {With the emergence of the new generation of information technologies and telecommunications, the mass of information produced by individuals and enterprises has increased in a considerable manner. Thus, and in order to manage this diversity of information, the integration systems were proposed. Among these, we find the hybrid information integration systems. They allow materializing a part of data in a local database, while integrating virtually the other part. As these materialized one is organized as views, it becomes necessary to propose algorithms for this objective. Among the most interesting ones, there is k-schema. It allows organize the attributes into a set of views, while affecting an attribute to a single view. This choice causes the not loading some of data that are highly requested by users, and at the same time, it loads other that are rarely requested. In this paper, we propose a new algorithm in this end. In this latter, it is authorized to assign a same attribute to several views. We also proposed new functions for calculating the dependencies between attributes. {\textcopyright} Research India Publications.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84973470278\&partnerID=40\&md5=140f0f35ca53260f11d97b5958f6ee8c},
	author = {Anter, S. and Zellou, A. and Idri, A.}
}
@conference {Anter2016,
	title = {Towards a generic model of a user profile},
	booktitle = {SITA 2016 - 11th International Conference on Intelligent Systems: Theories and Applications},
	year = {2016},
	note = {cited By 0},
	abstract = {User modelling is an old research discipline. The main concern of this discipline is to improve the quality of human-computer interaction predictive goals, preferences and context. Thus, adaptation and personalization of a document or an application for a particular user need to have information on the latter. It often referred to as {\textquoteright}user profile{\textquoteright}. A user profile modelling process must be done in two stages. These can be expressed by two questions: (1) {\textquoteright}what data?{\textquoteright} and (2) {\textquoteright}In what form will they be organized?{\textquoteright} The answer to the first question will determine all relevant information that best represents the interests and needs of the user. As for the second, it will determine the logical structure in which a profile will be modelled. This paper aims to provide answers to both questions. To do this, we begin with a presentation of different areas where the user profile can make a major contribution. In the second step, we define all the information to be included in the user profile as well as a generic model that we can adapt to different areas. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/SITA.2016.7772265},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010301085\&doi=10.1109\%2fSITA.2016.7772265\&partnerID=40\&md5=2f2efa11599627d6b4c5ad967869851f},
	author = {Anter, S. and Yazidi, M.H.E. and Zellou, A. and Idri, A.}
}
@conference { ISI:000391420300010,
	title = {Towards a generic model of a user profile},
	booktitle = {2016 11TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS: THEORIES AND APPLICATIONS (SITA)},
	series = {International Conference on Intelligent Systems, Theories and Applications},
	year = {2016},
	note = {11th International Conference on Intelligent Systems - Theories and Applications (SITA), Mohammedia, MOROCCO, OCT 19-20, 2016},
	publisher = {IEEE; Univ Hassan Casablanca; IEEE Morocco Sect; Fac Sci Tech Mohammedia},
	organization = {IEEE; Univ Hassan Casablanca; IEEE Morocco Sect; Fac Sci Tech Mohammedia},
	abstract = {User modelling is an old research discipline. The main concern of this discipline is to improve the quality of human-computer interaction predictive goals, preferences and context. Thus, adaptation and personalization of a document or an application for a particular user need to have information on the latter. It often referred to as {\textquoteleft}{\textquoteleft}user profile{{\textquoteright}{\textquoteright}}. A user profile modelling process must be done in two stages. These can be expressed by two questions: (1) {\textquoteleft}{\textquoteleft}what data?{{\textquoteright}{\textquoteright}} and (2) {\textquoteleft}{\textquoteleft}In what form will they be organized?{{\textquoteright}{\textquoteright}} The answer to the first question will determine all relevant information that best represents the interests and needs of the user. As for the second, it will determine the logical structure in which a profile will be modelled. This paper aims to provide answers to both questions. To do this, we begin with a presentation of different areas where the user profile can make a major contribution. In the second step, we define all the information to be included in the user profile as well as a generic model that we can adapt to different areas.},
	isbn = {978-1-5090-5781-8},
	issn = {2378-2528},
	author = {Anter, Samir and El Yazidi, Mly Hafid and Zellou, Ahmed and Idri, Ali}
}
@conference {Zahraoui2015,
	title = {Adjusting story points calculation in scrum effort \& time estimation},
	booktitle = {2015 10th International Conference on Intelligent Systems: Theories and Applications, SITA 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {Effort and time estimation at the initial stage of an agile project is a difficult and challenging task due to volatility and changing in customer requirements. Scrum remains the most used agile project management method. However effort estimation in scrum is mainly based on story points which are subjective measures and mostly lead to inaccurate estimates. In this paper we propose to adjust this measure using three adjustment factors. Moreover this paper will show how to use also this adjusted story point in velocity calculation to ameliorate scrum time estimation. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/SITA.2015.7358400},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962420940\&doi=10.1109\%2fSITA.2015.7358400\&partnerID=40\&md5=50b20eb1257cdb32020b1c1cfe2ba7bc},
	author = {Zahraoui, H. and Janati Idrissi, M.A.}
}
@conference { ISI:000380409500026,
	title = {Adjusting Story Points Calculation in Scrum Effort \& Time Estimation},
	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 = {Effort and time estimation at the initial stage of an agile project is a difficult and challenging task due to volatility and changing in customer requirements. Scrum remains the most used agile project management method. However effort estimation in scrum is mainly based on story points which are subjective measures and mostly lead to inaccurate estimates. In this paper we propose to adjust this measure using three adjustment factors. Moreover this paper will show how to use also this adjusted story point in velocity calculation to ameliorate scrum time estimation.},
	isbn = {978-1-5090-0220-7},
	author = {Zahraoui, Hind and Janati Idrissi, Mohammed Abdou}
}
@article {Saissi20151044,
	title = {Deep web integration: The tip of the iceberg},
	journal = {International Review on Computers and Software},
	volume = {10},
	number = {10},
	year = {2015},
	note = {cited By 2},
	pages = {1044-1053},
	abstract = {The web is divided in two parts, a part that search engines can access and which is called the surface web, and an inaccessible part called the deep web. The deep web is much bigger and richer in information than the surface web, and its web sources are only accessible through the associated Html forms. Our aim in this paper is to present our automatic approach to extract a relational schema describing a selected deep web source. This relational schema can be used by a virtual integration system to access the associated deep web source. Our approach is based on a static and dynamic analysis of the Html forms giving access to the selected deep web source. Our approach process uses two external knowledge databases: The first one is our proprietary knowledge database about the deep web domains called the Identification Tables and the second one is an external ontology. All the information extracted by our approach from and through the associated Html forms are used subsequently to build our final relational schema describing the associated deep web source. {\textcopyright} 2015 Praise Worthy Prize S.r.l. - All rights reserved.},
	doi = {10.15866/irecos.v10i10.7755},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959137103\&doi=10.15866\%2firecos.v10i10.7755\&partnerID=40\&md5=d936ba2cd781f89fb3b9bb571b5e02e3},
	author = {Saissi, Y.a and Zellou, A.a b and Idri, A.a c}
}
@conference {Zakriti2015,
	title = {Design of a compact CPW ultra-wideband antenna},
	booktitle = {Mediterranean Microwave Symposium},
	volume = {2015-April},
	year = {2015},
	note = {cited By 0},
	abstract = {In this paper, a design and analysis of compact coplanar waveguide-fed ultra wideband antenna is presented. The antenna design exhibits a very wide operating bandwidth of 14.3GHz with a return loss better than 10dB in the frequency range from 3.7GHz to 18GHz. The gain of the proposed antenna is around 4.8dBi. This antenna configuration would be useful for UWB indoor application as it is easy to fabricate and integrate with RF circuitry. All simulations in this work were carried out by using the electromagnetic software. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/MMS.2014.7088987},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938296316\&doi=10.1109\%2fMMS.2014.7088987\&partnerID=40\&md5=a670f55ec4814a4d59bcc99a621653f0},
	author = {Zakriti, A.a and Essaaidi, M.b and Touhami, N.A.c}
}
@article { ISI:000349001200001,
	title = {Empirical Studies on Usability of mHealth Apps: A Systematic Literature Review},
	journal = {JOURNAL OF MEDICAL SYSTEMS},
	volume = {39},
	number = {2},
	year = {2015},
	month = {FEB},
	abstract = {The release of smartphones and tablets, which offer more advanced communication and computing capabilities, has led to the strong emergence of mHealth on the market. mHealth systems are being used to improve patients{\textquoteright} lives and their health, in addition to facilitating communication between doctors and patients. Researchers are now proposing mHealth applications for many health conditions such as dementia, autism, dysarthria, Parkinson{\textquoteright}s disease, and so on. Usability becomes a key factor in the adoption of these applications, which are often used by people who have problems when using mobile devices and who have a limited experience of technology. The aim of this paper is to investigate the empirical usability evaluation processes described in a total of 22 selected studies related to mHealth applications by means of a Systematic Literature Review. Our results show that the empirical evaluation methods employed as regards usability could be improved by the adoption of automated mechanisms. The evaluation processes should also be revised to combine more than one method. This paper will help researchers and developers to create more usable applications. Our study demonstrates the importance of adapting health applications to users{\textquoteright} need.},
	issn = {0148-5598},
	doi = {10.1007/s10916-014-0182-2},
	author = {Cruz Zapata, Belen and Luis Fernandez-Aleman, Jose and Idri, Ali and Toval, Ambrosio}
}
@article {Zapata20151,
	title = {Empirical Studies on Usability of mHealth Apps: A Systematic Literature Review},
	journal = {Journal of Medical Systems},
	volume = {39},
	number = {2},
	year = {2015},
	note = {cited By 27},
	pages = {1-19},
	abstract = {The release of smartphones and tablets, which offer more advanced communication and computing capabilities, has led to the strong emergence of mHealth on the market. mHealth systems are being used to improve patients{\textquoteright} lives and their health, in addition to facilitating communication between doctors and patients. Researchers are now proposing mHealth applications for many health conditions such as dementia, autism, dysarthria, Parkinson{\textquoteright}s disease, and so on. Usability becomes a key factor in the adoption of these applications, which are often used by people who have problems when using mobile devices and who have a limited experience of technology. The aim of this paper is to investigate the empirical usability evaluation processes described in a total of 22 selected studies related to mHealth applications by means of a Systematic Literature Review. Our results show that the empirical evaluation methods employed as regards usability could be improved by the adoption of automated mechanisms. The evaluation processes should also be revised to combine more than one method. This paper will help researchers and developers to create more usable applications. Our study demonstrates the importance of adapting health applications to users{\textquoteright} need. {\textcopyright} 2015, Springer Science+Business Media New York.},
	doi = {10.1007/s10916-014-0182-2},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84921369632\&doi=10.1007\%2fs10916-014-0182-2\&partnerID=40\&md5=bdc93c6effe3b950d143f7753814b14a},
	author = {Zapata, B.C.a and Fern{\'a}ndez-Alem{\'a}n, J.L.a and Idri, A.b and Toval, A.a}
}
@conference { ISI:000354859800032,
	title = {FGAV (Fuzzy Global as Views)},
	booktitle = {INTERNATIONAL CONFERENCE ON INTEGRATED INFORMATION (IC-ININFO 2014)},
	series = {AIP Conference Proceedings},
	volume = {1644},
	year = {2015},
	note = {4th International Conference on Integrated Information (IC-ININFO), Madrid, SPAIN, SEP 05-08, 2014},
	pages = {236-243},
	publisher = {Univ Peloponnese; Linnaeus Univ; Aberystwyth Univ; Technol \& Educ Inst Athens; Univ Complutense Madrid, Fac Ciencias Documentac; Inst Disseminat Arts \& Sci},
	organization = {Univ Peloponnese; Linnaeus Univ; Aberystwyth Univ; Technol \& Educ Inst Athens; Univ Complutense Madrid, Fac Ciencias Documentac; Inst Disseminat Arts \& Sci},
	abstract = {The mediation is an approach of integration, which allows to integrate different heterogeneous, autonomous and scalable sources of information, it provide to the user an uniform access, while hiding the peculiarities of each sources. In this paper, we presenting an approach of mapping for mediation systems, an operation that is used to define and describe all the links between the elements of global schema and those of local schemas. To this end, we firstly presenting our approach to mapping that consist to defining and associates for each link between two elements the weight that reflects the degree of its existence by using an analysis of two components: syntactic and semantic. On the other hand, we integrate a set of functionality for source schemas with elements of complex types.},
	isbn = {978-0-7354-1283-5},
	issn = {0094-243X},
	doi = {10.1063/1.4907842},
	author = {El Yazidi, Moulay Hafid and Zellou, Ahmed and Idri, Ali},
	editor = {Giannakopoulos, G and Sakas, DP and KyriakiManessi, D}
}
@conference {ElIdrissiSelma2015,
	title = {Mapping discovery methodology in a pure P2P mediation system for XML schemas},
	booktitle = {2015 10th International Conference on Intelligent Systems: Theories and Applications, SITA 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {The exponential development of information exchange today has updated the difficulties to find the relevant information wished by an end user. Indeed, the information is represented and stored in a multitude of information sources in a very heterogeneous way. The type of these information sources can be varied (textual data, relational, multimedia, semi structured ...) and their very different storage systems (file system, DBMS, applications). It is thus necessary to offer an information sources integration system, while assuring the transparency to the distribution and the heterogeneousness. In this work, we focus to integration of information sources via the mediation approach in a pur P2P environment. We are particularly interested to the Mapping discovery in this type of system integration. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/SITA.2015.7358380},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962376117\&doi=10.1109\%2fSITA.2015.7358380\&partnerID=40\&md5=cdb3cd7ca4bce869b36a15714aae4901},
	author = {El Idrissi Selma, E.Y. and Zellou, A. and Idri, A.}
}
@conference { ISI:000380409500006,
	title = {Mapping discovery methodology in a pure P2P mediation system for XML schemas},
	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 = {The exponential development of information exchange today has updated the difficulties to find the relevant information wished by an end user. Indeed, the information is represented and stored in a multitude of information sources in a very heterogeneous way. The type of these information sources can be varied (textual data, relational, multimedia, semi structured...) and their very different storage systems (file system, DBMS, applications). It is thus necessary to offer an information sources integration system, while assuring the transparency to the distribution and the heterogeneousness. In this work, we focus to integration of information sources via the mediation approach in a pur P2P environment. We are particularly interested to the Mapping discovery in this type of system integration.},
	isbn = {978-1-5090-0220-7},
	author = {El Idrissi Selma, El Yahyaoui and Zellou, Ahmed and Idri, Ali}
}
@conference {ElYazidi2015,
	title = {Mapping in GAV context},
	booktitle = {2015 10th International Conference on Intelligent Systems: Theories and Applications, SITA 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {Mediation is an approach that allows integrating different heterogeneous, distributed and scalable data sources. The objective of our paper is to define an approach of mapping, one of the essential operations that can describe and define the set of links between the two levels of mediation system: mediator schema (global) and schemas of sources to be integrated (local). Our approach allows to define the mapping for systems with complex schemas (schemas with complexes elements) and this by using functions developed that taking into account two aspects: syntactic and semantic. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/SITA.2015.7358376},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962421014\&doi=10.1109\%2fSITA.2015.7358376\&partnerID=40\&md5=44fa100d239873e3ce44cc7228d15aa7},
	author = {El Yazidi, M.H. and Zellou, A. and Idri, A.}
}
@conference { ISI:000380409500002,
	title = {Mapping in GAV context},
	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 = {Mediation is an approach that allows integrating different heterogeneous, distributed and scalable data sources. The objective of our paper is to define an approach of mapping, one of the essential operations that can describe and define the set of links between the two levels of mediation system: mediator schema (global) and schemas of sources to be integrated (local). Our approach allows to define the mapping for systems with complex schemas (schemas with complexes elements) and this by using functions developed that taking into account two aspects: syntactic and semantic.},
	isbn = {978-1-5090-0220-7},
	author = {Hafid El Yazidi, Moulay and Zellou, Ahmed and Idri, Ali}
}
@conference {Zbakh2015,
	title = {A multi-criteria analysis of intrusion detection architectures in cloud environments},
	booktitle = {Proceedings of 2015 International Conference on Cloud Computing Technologies and Applications, CloudTech 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {Cloud computing promises to increase innovation and the velocity with which applications are deployed all while helping any enterprise meet most IT service needs at a lower total cost of ownership and higher return investment. As the March of cloud continues, it brings both new opportunities and new security challenges. To take advantage of those opportunities while minimizing risks, we argue that Intrusion Detection Systems (IDS) integrated in the cloud is one of the best existing solutions nowadays in the field. The concept of intrusion detection was known since past and was first proposed in 1980s. Since that time IDSs are evolving. However, even several efforts have been made in the area of Intrusion Detection Systems for cloud computing environment, many attacks still prevail. Therefore, the work presented in this paper proposes a multi-criteria analysis and a comparative study between several IDS architectures designed to work in cloud computing environments. To achieve this objective, in the first place we will search in the state of the art for several consistent IDS architectures designed to work in a cloud environment. Whereas, in a second step we will establish the criteria that will be useful for the evaluation of architectures. Later, using the approach of multi-criteria decision analysis MacBeth (Measuring Attractiveness by a Categorical Based Evaluation Technique) we will evaluate the criteria and assign to each one the appropriate weight according to their importance in the field of IDS architectures in cloud computing. The last step is to evaluate architectures against the criteria and collecting results of the model constructed in the previous steps. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/CloudTech.2015.7336967},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962845309\&doi=10.1109\%2fCloudTech.2015.7336967\&partnerID=40\&md5=1128e7690631b70d9247248b05a81a50},
	author = {Zbakh, M. and Elmahdi, K. and Cherkaoui, R. and Enniari, S.}
}
@conference { ISI:000380407100006,
	title = {A multi-criteria analysis of intrusion detection architectures in cloud environments},
	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 = {87-95},
	abstract = {Cloud computing promises to increase innovation and the velocity with which applications are deployed all while helping any enterprise meet most IT service needs at a lower total cost of ownership and higher return investment. As the march of cloud continues, it brings both new opportunities and new security challenges. To take advantage of those opportunities while minimizing risks, we argue that Intrusion Detection Systems (IDS) integrated in the cloud is one of the best existing solutions nowadays in the field. The concept of intrusion detection was known since past and was first proposed in 1980s. Since that time IDSs are evolving. However, even several efforts have been made in the area of Intrusion Detection Systems for cloud computing environment, many attacks still prevail. Therefore, the work presented in this paper proposes a multi-criteria analysis and a comparative study between several IDS architectures designed to work in cloud computing environments. To achieve this objective, in the first place we will search in the state of the art for several consistent IDS architectures designed to work in a cloud environment. Whereas, in a second step we will establish the criteria that will be useful for the evaluation of architectures. Later, using the approach of multi-criteria decision analysis MacBeth (Measuring Attractiveness by a Categorical Based Evaluation Technique) we will evaluate the criteria and assign to each one the appropriate weight according to their importance in the field of IDS architectures in cloud computing. The last step is to evaluate architectures against the criteria and collecting results of the model constructed in the previous steps.},
	isbn = {978-1-4673-8149-9},
	author = {Zbakh, Mostapha and Elmahdi, Khalil and Cherkaoui, Rachid and Enniari, Saad}
}
@conference {Anter2015,
	title = {Nk-schemas: A novel algorithm for creating the views{\textquoteright} sch{\'e}mas to materialize in hybrid mediator},
	booktitle = {Proceedings of 2015 IEEE World Conference on Complex Systems, WCCS 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {The explosion of information and telecommunications technologies, has made easy the access and production of information. Thus, a very large mass of the latter has generated. This situation has made the integration systems an immediate necessity. Among these systems, there is the hybrid mediator. The latter interrogates one part of data on demand as in the virtual approach, while charging, filtering and storing the second part, as views, in a local database. The creation of this second part is a critical task. We propose in this paper, a new algorithm for creating views{\textquoteright} schemas to materialize in the hybrid integration system. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/ICoCS.2015.7483282},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84978397930\&doi=10.1109\%2fICoCS.2015.7483282\&partnerID=40\&md5=c2f29f0e70dec9947e07f07a38190ec7},
	author = {Anter, S. and Zellou, A. and Idri, A.}
}
@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 { ISI:000383740200029,
	title = {Personal development in engineering schools in Morocco},
	booktitle = {INTERNATIONAL CONFERENCE ON NEW HORIZONS IN EDUCATION, INTE 2014},
	series = {Procedia Social and Behavioral Sciences},
	volume = {174},
	year = {2015},
	note = {5th International Conference on New Horizons in Education (INTE), Paris, FRANCE, JUN 25-27, 2014},
	pages = {194-198},
	abstract = {Why personal development in schools of engineering. The lack of self-awareness about personal and Professional projects push us teachers and coaches to guide students to have a clear vision about their future and discover their potential and the power of creativity by acquiring self-esteem, self-confidence and self-actualization. And also by helping them to overcome procrastination by managing their time and accepting and dealing with change positively. (C) 2015 The Authors. Published by Elsevier Ltd.},
	issn = {1877-0428},
	doi = {10.1016/j.sbspro.2015.01.646},
	author = {Zakia, Belahmer},
	editor = {Iaman, A and Eskicumali, A}
}
@conference {Essaaidi2015,
	title = {Preface},
	booktitle = {Proceedings of 2015 International Conference on Cloud Computing Technologies and Applications, CloudTech 2015},
	year = {2015},
	note = {cited By 0},
	doi = {10.1109/CloudTech.2015.7336961},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962888037\&doi=10.1109\%2fCloudTech.2015.7336961\&partnerID=40\&md5=69249a453813373a5128d84c6cbea760},
	author = {Essaaidi, M. and Zbakh, M.}
}
@conference { ISI:000354859800033,
	title = {Pure P2P Mediation System: A Mappings Discovery Approach},
	booktitle = {INTERNATIONAL CONFERENCE ON INTEGRATED INFORMATION (IC-ININFO 2014)},
	series = {AIP Conference Proceedings},
	volume = {1644},
	year = {2015},
	note = {4th International Conference on Integrated Information (IC-ININFO), Madrid, SPAIN, SEP 05-08, 2014},
	pages = {244-251},
	publisher = {Univ Peloponnese; Linnaeus Univ; Aberystwyth Univ; Technol \& Educ Inst Athens; Univ Complutense Madrid, Fac Ciencias Documentac; Inst Disseminat Arts \& Sci},
	organization = {Univ Peloponnese; Linnaeus Univ; Aberystwyth Univ; Technol \& Educ Inst Athens; Univ Complutense Madrid, Fac Ciencias Documentac; Inst Disseminat Arts \& Sci},
	abstract = {The information integration systems consist in offering a uniform interface to provide access to a set of autonomous and distributed information sources. The most important advantage of this system is that it allows users to specify what they want, rather than thinking about how to get the responses. The works realized in this area have particular leads to two major classes of integration systems: the mediation systems based on the paradigm mediator / adapter and peer to peer systems (P2P). The combination of both systems has led to a third type; is the mediation P2P systems. The P2P systems are large-scale systems, self-organized and distributed. They allow the resource management in a completely decentralized way. However, the integration of structured information sources, heterogeneous and distributed proves to be a complex problem. The objective of this work is to propose an approach to resolve conflicts and establish a mapping between the heterogeneous elements. This approach is based on clustering; the latter is to group similar Peers that share common information in the same subnet. Thus, to facilitate the heterogeneity, we introduced three additional layers of our hierarchy of peers: internal schema, external schema and Schema directory peer. We used linguistic techniques, and precisely the name correspondence technique, that is based on the similarity of names to propose a correspondence.},
	isbn = {978-0-7354-1283-5},
	issn = {0094-243X},
	doi = {10.1063/1.4907843},
	author = {Selma, El Yahyaoui El Idrissi and Zellou, Ahmed and Idri, Ali},
	editor = {Giannakopoulos, G and Sakas, DP and KyriakiManessi, D}
}
@conference { ISI:000380409500001,
	title = {Quality of Data in Mediation Systems},
	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 = {Quality of Data (QoD) became a major concern which more and more considers necessary to evolve the satisfaction of final users. In this work, we are approaching a methodology which consists of classifying and listing factors impacting Data Quality in Data Integration Systems, and more literally these which influence mediation systems and which will constitute our long-term research axis. Moreover, we shall propose in this work a contribution in the form of an attempt to define main factors impacting Quality of Data.},
	isbn = {978-1-5090-0220-7},
	author = {Mimouni, Loubna and Zellou, Ahmed and Idri, Ali}
}
@conference {Mimouni2015,
	title = {Quality of Data in mediation systems},
	booktitle = {2015 10th International Conference on Intelligent Systems: Theories and Applications, SITA 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {Quality of Data (QoD) became a major concern which more and more considers necessary to evolve the satisfaction of final users. In this work, we are approaching a methodology which consists of classifying and listing factors impacting Data Quality in Data Integration Systems, and more literally these which influence mediation systems and which will constitute our long-term research axis. Moreover, we shall propose in this work a contribution in the form of an attempt to define main factors impacting Quality of Data. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/SITA.2015.7358375},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962456193\&doi=10.1109\%2fSITA.2015.7358375\&partnerID=40\&md5=aa9e5c23e4b0cc19331495a5ca6e9a5c},
	author = {Mimouni, L. and Zellou, A. and Idri, A.}
}
@conference {Talei2015,
	title = {Smart campus microgrid: Advantages and the main architectural components},
	booktitle = {Proceedings of 2015 IEEE International Renewable and Sustainable Energy Conference, IRSEC 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {With a world wild increase in electricity demand, smart grids emerged as a solution for various problems within the current electrical grid. Some novel aspects about smart grids are the use renewable energy sources, energy storage and also allowing the user to take some decisions to control energy use. Microgrids are building blocks of smart grids and given that academic campuses are very good contributors to energy consumption, their energy consumption can be efficiently controlled by using an energy management system. This paper focuses on the importance of smart campuses with an emphasis on the importance of an energy management system. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/IRSEC.2015.7455093},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84968584100\&doi=10.1109\%2fIRSEC.2015.7455093\&partnerID=40\&md5=0b0289ab22afeb7da6d364c794b3c54a},
	author = {Talei, H.a and Zizi, B.a and Abid, M.R.a and Essaaidi, M.b and Benhaddou, D.c and Khalil, N.c}
}
@conference { ISI:000382162300171,
	title = {Smart Campus Microgrid: Advantages and the Main Architectural Components},
	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 = {810-816},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {With a world wild increase in electricity demand, smart grids emerged as a solution for various problems within the current electrical grid. Some novel aspects about smart grids are the use renewable energy sources, energy storage and also allowing the user to take some decisions to control energy use. Microgrids are building blocks of smart grids and given that academic campuses are very good contributors to energy consumption, their energy consumption can be efficiently controlled by using an energy management system. This paper focuses on the importance of smart campuses with an emphasis on the importance of an energy management system.},
	isbn = {978-1-4673-7894-9},
	author = {Talei, Hanaa and Zizi, Badr and Abid, Mohamed Riduan and Essaaidi, Mohamed and Benhaddou, Driss and Khalil, Nacer},
	editor = {Essaaidi, M and Zaz, Y}
}
@conference { ISI:000382162300064,
	title = {A State-Feedback Approach for Controlling Ventilation Systems in Energy Efficient Buildings},
	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 = {665-670},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {On the fast actual demographic trend and increasing comfort level, consumers are becoming more and more demanding in the areas of heating, cooling, ventilation, air conditioning, and lighting. Heating, Ventilating and Air Conditioning (HVAC) is one of most studied systems in energy efficient buildings within the aim to keep occupants{\textquoteright} comfort with desired temperature ranges, a suitable level of humidity, and good air quality. Recent studies showed that using information and communication technologies will have a significant impact on improving energy efficiency in real buildings. The main aim of these studies is to develop energy control approaches to improve energy performance and occupant comfort in buildings. In this paper, a CO2-based strategy using a state feedback technique for controlling mechanical ventilation systems in energy-efficient building is proposed. The principal objective of the developed controller is to improve optimal balance between energy efficiency and indoor air quality by maintaining the indoor CO2 concentration at the comfort set point with an efficient ventilation rate while reducing energy consumption. The ventilation system is analysed, modeled, and simulated. The simulation results are reported to show the efficiency of the proposed control approach compared to the traditional On/Off and the PI ventilation control.},
	isbn = {978-1-4673-7894-9},
	author = {Lachhab, Fadwa and Essaaidi, Mohammed and Bakhouya, Mohamed and Ouladsine, Radouane},
	editor = {Essaaidi, M and Zaz, Y}
}
@conference {Kasmi2015,
	title = {Taking advantage of GPU/CPU architectures for sparse Conjugate Gradient solver computation},
	booktitle = {Proceedings of 2015 IEEE World Conference on Complex Systems, WCCS 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {Solving large sparse linear systems is a time and energy consuming process. This paper presents an efficient exploitation of graphic processing units (GPUs) for accelerating Conjugate Gradient iterative solver (CG). We use the high-level software library PARALUTION for sparse linear algebra on multi/many-core systems, which supports GPU (with CUDA and OpenCL) and Multi-CPU implementations of CG method using different storage formats. We discuss and compare performance using three platforms. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/ICoCS.2015.7483268},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84978427957\&doi=10.1109\%2fICoCS.2015.7483268\&partnerID=40\&md5=af973d4adddb0778d096c29e4a71e051},
	author = {Kasmi, N.a and Zbakh, M.a and Mahmoudi, S.A.b and Manneback, P.b}
}
@conference {Ouaftouh2015,
	title = {User profile model: A user dimension based classification},
	booktitle = {2015 10th International Conference on Intelligent Systems: Theories and Applications, SITA 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {As the amount of information offered by information systems is increasing exponentially, the need of personalized approaches for information access increases. This work discusses user profiles designed for providing personalized information access. We first present a general classification of research directions on adaptive systems, followed by a state-of-the-art study about user profiling. We propose then a new classification approach of user profile model. This classification is based on the user dimensions considered to build the user profile. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/SITA.2015.7358378},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962408714\&doi=10.1109\%2fSITA.2015.7358378\&partnerID=40\&md5=ca06e7ab84ba76c5e6dfa5355f6faed2},
	author = {Ouaftouh, S. and Zellou, A. and Idri, A.}
}
@conference { ISI:000380409500004,
	title = {User profile model: a user dimension based classification},
	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 = {As the amount of information offered by information systems is increasing exponentially, the need of personalized approaches for information access increases. This work discusses user profiles designed for providing personalized information access. We first present a general classification of research directions on adaptive systems, followed by a state-of-the-art study about user profiling. We propose then a new classification approach of user profile model. This classification is based on the user dimensions considered to build the user profile.},
	isbn = {978-1-5090-0220-7},
	author = {Ouaftouh, Sara and Zellou, Ahmed and Idri, Ali}
}
@article {Zoukkari2014617,
	title = {E-readiness: A novel approach for indicators measurements estimation and prediction},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {69},
	number = {3},
	year = {2014},
	note = {cited By 0},
	pages = {617-631},
	abstract = {E-Readiness is an assessment process for the ICT (Information and Communication Technologies) availability and use in a country. It consists in the calculation of a composite indicator based on a conceptual framework related to ICT aspects. The assessment report is used in E-Strategy to formulate action plans for e-Readiness index development. Several approaches are used for e-Readiness since the end of nineties; these approaches lack flexibility and require frequent and precise measurements. Thus, two issues are addressed in this paper: the missing measurements estimation problem and the lack of e-Strategy formulation assistance and simulation tools and approaches. Indeed, we propose in this paper an approach to define the transition matrix of the e-Readiness state equation based on a layered model. This construction leads to a state model related to the e-Readiness dynamic system and then is used with KALMAN Filter to cover the two addressed issues. Indeed, the commands variables are indicators that can be manipulated by e-Strategy stakeholder and the KALMAN filter estimation and prediction functions are used as a simulator. For validation, we constructed a model based on the I2010 e-Readiness initiative and we tested the convergence of the model and its prediction function. Results are encouraging since the tested model prediction function converges in 24 cases out of 27 (89\%). {\textcopyright} 2005 - 2014 JATIT \& LLS. All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84914147680\&partnerID=40\&md5=1dff7bf1d6cdfbb8714e6ace7d43746d},
	author = {Zoukkari, N.B.a and Doukkali, A.b and Regragui, B.b}
}
@conference { ISI:000380387700011,
	title = {Extraction of relational schema from deep web sources: a form driven approach},
	booktitle = {2014 SECOND WORLD CONFERENCE ON COMPLEX SYSTEMS (WCCS)},
	year = {2014},
	note = {2014 Second World Conference on Complex Systems (WCCS), Agadir, MOROCCO, NOV 10-12, 2014},
	pages = {178-182},
	publisher = {Ibn Zohr Univ; Moroccan Soc of Complex Syst; IEEE Morocco; Int Acad for Syst and Cybernet Sci IASCYS},
	organization = {Ibn Zohr Univ; Moroccan Soc of Complex Syst; IEEE Morocco; Int Acad for Syst and Cybernet Sci IASCYS},
	abstract = {The deep web is the biggest unexplored part of the web and we need to access directly to its entire data web sources without using any crawling or surfacing method. For this, we choose to use a virtual web integration system. However, the deep web virtual integration methods existing today, focuses only on the integration of the query interfaces giving access to the deep web. These query interfaces are integrated to build a global query interface able to query all the deep web sources. The objective of our work is to propose another vision of a deep web virtual integration system that uses a mediated schema built with a relational schema describing each deep web source. This paper proposes our approach to extract a relational schema describing a deep web source. The key idea underlying our approach is to analyze two structured information: the HTML Form and the HTML Table extracted from the deep web source to discover its data structure and to allow us to build a relational schema describing it. We use also a knowledge table to take profit of our learning experience on extracting relational schema from deep web source.},
	isbn = {978-1-4799-4647-1},
	author = {Saissi, Yasser and Zellou, Ahmed and Idri, Ali}
}
@conference {Saissi2014178,
	title = {Extraction of relational schema from deep web sources: A form driven approach},
	booktitle = {2014 2nd World Conference on Complex Systems, WCCS 2014},
	year = {2014},
	note = {cited By 5},
	pages = {178-182},
	abstract = {The deep web is the biggest unexplored part of the web and we need to access directly to its entire data web sources without using any crawling or surfacing method. For this, we choose to use a virtual web integration system. However, the deep web virtual integration methods existing today, focuses only on the integration of the query interfaces giving access to the deep web. These query interfaces are integrated to build a global query interface able to query all the deep web sources. The objective of our work is to propose another vision of a deep web virtual integration system that uses a mediated schema built with a relational schema describing each deep web source. This paper proposes our approach to extract a relational schema describing a deep web source. The key idea underlying our approach is to analyze two structured information: the HTML Form and the HTML Table extracted from the deep web source to discover its data structure and to allow us to build a relational schema describing it. We use also a knowledge table to take profit of our learning experience on extracting relational schema from deep web source. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/ICoCS.2014.7060888},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84929193260\&doi=10.1109\%2fICoCS.2014.7060888\&partnerID=40\&md5=19d19e00ed72fa7b4c9eeae768e3b02e},
	author = {Saissi, Y. and Zellou, A. and Idri, A.}
}
@conference {Saissi2014,
	title = {Form driven web source integration},
	booktitle = {2014 9th International Conference on Intelligent Systems: Theories and Applications, SITA 2014},
	year = {2014},
	note = {cited By 0},
	abstract = {The web sources contain a huge amount of data that we need to integrate and to use. The integration of the web source requires to know its source description. In general, the web sources contain a structured data like HTML form and HTML table. This paper proposes our approach to extract a relational schema, describing the web source, and using its structured information. The key idea underlying our approach is to extract the relational data structure of the HTML forms contained in the web source. And thanks to the features of the HTML form, the relational data structure extracted will not only describe the HTML form but also the web source associated. After, we propose to query the HTML forms extracted to generate interesting HTML table results. The data structure of the resulting HTML tables will be used to enhance the relational data structure of the associated HTML form. Finally, with all the relational data structure extracted from all the HTML forms and HTML tables, we build the relational schema describing the associated web source. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/SITA.2014.6847288},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84904632763\&doi=10.1109\%2fSITA.2014.6847288\&partnerID=40\&md5=900e69a0f5f601e9d9f86ec1fe81bd55},
	author = {Saissi, Y. and Zellou, A. and Idri, A.}
}
@conference { ISI:000346142800013,
	title = {Form driven web source integration},
	booktitle = {2014 9TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS: THEORIES AND APPLICATIONS (SITA{\textquoteright}14)},
	year = {2014},
	note = {9th International Conference on Intelligent Systems - Theories and Applications (SITA), Inst Natl Postes \& Telecommunicat, Rabat, MOROCCO, MAY 07-08, 2014},
	publisher = {IEEE; IEEE Morocco},
	organization = {IEEE; IEEE Morocco},
	abstract = {The web sources contain a huge amount of data that we need to integrate and to use. The integration of the web source requires to know its source description. In general, the web sources contain a structured data like HTML form and HTML table. This paper proposes our approach to extract a relational schema, describing the web source, and using its structured information. The key idea underlying our approach is to extract the relational data structure of the HTML forms contained in the web source. And thanks to the features of the HTML form, the relational data structure extracted will not only describe the HTML form but also the web source associated. After, we propose to query the HTML forms extracted to generate interesting HTML table results. The data structure of the resulting HTML tables will be used to enhance the relational data structure of the associated HTML form. Finally, with all the relational data structure extracted from all the HTML forms and HTML tables, we build the relational schema describing the associated web source.},
	isbn = {978-1-4799-3566-6},
	author = {Saissi, Yasser and Zellou, Ahmed and Idri, Ali}
}
@conference { ISI:000366999600264,
	title = {FPGA Implementation of HIHO and SIHO Decoders for DSC Codes},
	booktitle = {2014 INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS)},
	year = {2014},
	note = {International Conference on Multimedia Computing and Systems (ICMCS), Marrakech, MOROCCO, APR 14-16, 2014},
	pages = {1461-1464},
	abstract = {This paper presents the study of two decoder architectures and their VHDL design and implementation on a FPGA circuit. Both decoders are designed for Difference Set Cyclic (DSC) codes. The first one is the Hard In - Hard Out decoder (HIHO), and the second one is the Massey{\textquoteright}s threshold Soft In - Hard Out (SIHO) decoder. The two architectures are analyzed and discussed for serial and parallel processing implementations. The results show that the complexity, measured by the number of Logical Elements (LE) which is directly proportional to the silicon area occupied by the decoder, varies linearly for serial processing and hyperbolically for parallel processing. Increased complexity related to parallel processing can be accepted in turbo decoders. The resulting latency (L) is equal to the code length (n) multiplied by the clock period (H): (L=n{*}H).},
	isbn = {978-1-4799-3824-7},
	author = {Boudaoud, Abdelghani and Abdelmounim, Elliassane and Barazzouk, Abdellfattah and Zbitou, Jamal and Belkasmi, Mostafa}
}
@conference { ISI:000380387700081,
	title = {A Learning Adaptation Cases Technique for Fuzzy Analogy-based Software Development Effort Estimation},
	booktitle = {2014 SECOND WORLD CONFERENCE ON COMPLEX SYSTEMS (WCCS)},
	year = {2014},
	note = {2014 Second World Conference on Complex Systems (WCCS), Agadir, MOROCCO, NOV 10-12, 2014},
	pages = {492-497},
	publisher = {Ibn Zohr Univ; Moroccan Soc of Complex Syst; IEEE Morocco; Int Acad for Syst and Cybernet Sci IASCYS},
	organization = {Ibn Zohr Univ; Moroccan Soc of Complex Syst; IEEE Morocco; Int Acad for Syst and Cybernet Sci IASCYS},
	abstract = {the aim of this paper is to enhance the Fuzzy Analogy technique for software effort development estimation. Fuzzy Analogy selects the similar projects that will be used in the adaptation step according to the definition of the qualification {\textquoteleft}closely similar{\textquoteright}. The adopted definition consider two projects as closely similar if their similarity is in the vicinity of 1. The qualification {\textquoteleft}closely similar{\textquoteright} is represented by a fuzzy set defined by a fixed threshold which is obtained experimentally from the environment. However, in many cases the available empirical knowledge may not allow estimators to fit the adequate fuzzy representation of the qualification {\textquoteleft}closely similar{\textquoteright}. In this study, we propose an approach to learn this fuzzy representation from the similarities obtained in the retrieval step of the Fuzzy Analogy technique. The proposed method provides for each new project, an adequate threshold by using the quasi-arithmetic mean operators. Indeed, the quasi-arithmetic means operators use weighted similarities to calculate the threshold that often ensures the selection of the closest projects in the adaptation step. This paper also presents an empirical validation of the proposed approach based on the COCOMO{\textquoteright} 81 dataset.},
	isbn = {978-1-4799-4647-1},
	author = {Ezghari, Soufiane and Zahi, Azeddine and Idri, Ali}
}
@conference {Ezghari2014492,
	title = {A learning adaptation cases technique for Fuzzy Analogy-based software development effort estimation},
	booktitle = {2014 2nd World Conference on Complex Systems, WCCS 2014},
	year = {2014},
	note = {cited By 0},
	pages = {492-497},
	abstract = {The aim of this paper is to enhance the Fuzzy Analogy technique for software effort development estimation. Fuzzy Analogy selects the similar projects that will be used in the adaptation step according to the definition of the qualification {\textquoteright}closely similar{\textquoteright}. The adopted definition consider two projects as closely similar if their similarity is in the vicinity of 1. The qualification {\textquoteright}closely similar{\textquoteright} is represented by a fuzzy set defined by a fixed threshold which is obtained experimentally from the environment. However, in many cases the available empirical knowledge may not allow estimators to fit the adequate fuzzy representation of the qualification {\textquoteright}closely similar{\textquoteright}. In this study, we propose an approach to learn this fuzzy representation from the similarities obtained in the retrieval step of the Fuzzy Analogy technique. The proposed method provides for each new project, an adequate threshold by using the quasi-arithmetic mean operators. Indeed, the quasi-arithmetic means operators use weighted similarities to calculate the threshold that often ensures the selection of the closest projects in the adaptation step. This paper also presents an empirical validation of the proposed approach based on the COCOMO{\textquoteright}81 dataset. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/ICoCS.2014.7060958},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84988299045\&doi=10.1109\%2fICoCS.2014.7060958\&partnerID=40\&md5=9ce612ab475d2c3acd929c1b0c5bb106},
	author = {Ezghari, S.a and Zahi, A.a and Idri, A.b}
}
@article {ElIdrissi2014261,
	title = {MDPM: An algorithm for mapping discovery in P2P mediation system},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {63},
	number = {2},
	year = {2014},
	note = {cited By 0},
	pages = {261-273},
	abstract = {The information integration systems consist in offering a uniform interface, to provide access to a set of autonomous and distributed information sources. The most important advantage of an information integration system is that allows users to specify what they want, rather than thinking about how to get the responses. The studies in this field have aimed at developing tools allowing a transparent access to data sources disseminated on a network. In particular, there are two major classes of integration systems: the mediation systems based on the paradigm mediator/Wrapper and peer to peer systems (P2P). Recently, other integration systems have emerged as P2P mediation systems. In these systems, the correspondence problem between schemas is a crucial problem. Especially as to integrate different sources requires the identification of the elements which can be dependent between the various diagrams. This is called correspondences or mapping between schemas. In this paper, we study this problem of mappings discovery and we present an approach of automatic correspondences discovery in a Pure Peer-to-Peer mediation system. {\textcopyright} 2005 - 2014 JATIT \& LLS. All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84901297255\&partnerID=40\&md5=727988fcc4f07295ec2f81aef5ccbc2a},
	author = {El Idrissi, S.E.Y. and Zellou, A. and Idri, A.}
}
@article {CruzZapata2014,
	title = {Mobile PHRs compliance with android and ios usability guidelines mobile systems},
	journal = {Journal of Medical Systems},
	volume = {38},
	number = {8},
	year = {2014},
	note = {cited By 15},
	abstract = {Mobile Personal Health Records (PHRs) have achieved a particularly strong market share since the appearance of more powerful mobile devices and popular worldwide mobile application markets such as Apple{\textquoteright}s App Store and Android{\textquoteright}s Google Play. However, Android and Apple have a set of recommendations on design and usability targeted towards developers who wish to publish apps in their stores: Android Design Guidelines and iOS Human Interface Guidelines. This paper aims to evaluate compliance with these guidelines by assessing the usability recommendations of a set of 24 selected mobile PHR applications. An analysis process based on a well-known Systematic Literature Review (SLR) protocol was used. The results show that the 24 mobile PHR applications studied are not suitably structured. 46 \% of these applications do not use any of the recommended patterns, using instead lists or springboards, which are deprecated patterns for top-level menus. 70 \% of the PHRs require a registration to be able to test the application when these interactions should be delayed. Our study will help both PHR users to select user-friendly mobile PHRs and PHR providers and developers to identify the good usability practices implemented by the applications with the highest scores. {\textcopyright} 2014 Springer Science+Business Media New York.},
	doi = {10.1007/s10916-014-0081-6},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84904039765\&doi=10.1007\%2fs10916-014-0081-6\&partnerID=40\&md5=6c10e4e66d8521cf01c2571845e3920c},
	author = {Cruz Zapata, B.a and Hern{\'a}ndez Ni{\~n}irola, A.a and Idri, A.b and Fern{\'a}ndez-Alem{\'a}n, J.L.a and Toval, A.a}
}
@article { ISI:000339111400013,
	title = {Mobile PHRs Compliance with Android and iOS Usability Guidelines},
	journal = {JOURNAL OF MEDICAL SYSTEMS},
	volume = {38},
	number = {8},
	year = {2014},
	month = {AUG},
	abstract = {Mobile Personal Health Records (PHRs) have achieved a particularly strong market share since the appearance of more powerful mobile devices and popular worldwide mobile application markets such as Apple{\textquoteright}s App Store and Android{\textquoteright}s Google Play. However, Android and Apple have a set of recommendations on design and usability targeted towards developers who wish to publish apps in their stores: Android Design Guidelines and iOS Human Interface Guidelines. This paper aims to evaluate compliance with these guidelines by assessing the usability recommendations of a set of 24 selected mobile PHR applications. An analysis process based on a well-known Systematic Literature Review (SLR) protocol was used. The results show that the 24 mobile PHR applications studied are not suitably structured. 46 \% of these applications do not use any of the recommended patterns, using instead lists or springboards, which are deprecated patterns for top-level menus. 70 \% of the PHRs require a registration to be able to test the application when these interactions should be delayed. Our study will help both PHR users to select user-friendly mobile PHRs and PHR providers and developers to identify the good usability practices implemented by the applications with the highest scores.},
	issn = {0148-5598},
	doi = {10.1007/s10916-014-0081-6},
	author = {Cruz Zapata, Belen and Hernandez Ninirola, Antonio and Idri, Ali and Luis Fernandez-Aleman, Jose and Toval, Ambrosio}
}
@conference { ISI:000380387700087,
	title = {Performance evaluation of sparse matrix-vector product (SpMV) computation on GPU architecture},
	booktitle = {2014 SECOND WORLD CONFERENCE ON COMPLEX SYSTEMS (WCCS)},
	year = {2014},
	note = {2014 Second World Conference on Complex Systems (WCCS), Agadir, MOROCCO, NOV 10-12, 2014},
	pages = {23-27},
	publisher = {Ibn Zohr Univ; Moroccan Soc of Complex Syst; IEEE Morocco; Int Acad for Syst and Cybernet Sci IASCYS},
	organization = {Ibn Zohr Univ; Moroccan Soc of Complex Syst; IEEE Morocco; Int Acad for Syst and Cybernet Sci IASCYS},
	abstract = {Sparse matrices are entailed in many linear algebra problems such as linear systems resolution, matrix eigenvalues/vectors computation and partial differential equations, wherefore sparse matrix vector product (SpMV) constitutes a basic kernel for solving many scientific and engineering applications problems. With the appearance of Graphics Processing Units (GPUs) as platforms that provides important acceleration factors, the optimization of SpMV on GPUs and its implementation has been a subject of broad research for the last few years. In this work we present a comparative evaluation of sparse matrix vector product (SpMV) on different platforms. We use Cusp library on CUDA architecture GPUs and MKL Intel library as reference on CPUs. Experimental results have been conducted using a set of matrices from matrix market repositoryi, comparing performance between GPU-based Cusp(2)and CPU-based MKL(3)libraries. The results showed a global speedup, obtained with GPU, ranging from 1.1 x to 4.6 x compared to CPU implementations. An analysis and evaluation of these results is discussed.},
	isbn = {978-1-4799-4647-1},
	author = {Kasmi, Najlae and Mahmoudi, Sidi Ahmed and Zbakh, Mostapha and Manneback, Pierre}
}
@conference {Kasmi201423,
	title = {Performance evaluation of sparse matrix-vector product (SpMV) computation on GPU architecture},
	booktitle = {2014 2nd World Conference on Complex Systems, WCCS 2014},
	year = {2014},
	note = {cited By 1},
	pages = {23-27},
	abstract = {Sparse matrices are entailed in many linear algebra problems such as linear systems resolution, matrix eigen-values/vectors computation and partial differential equations, wherefore sparse matrix vector product (SpMV) constitutes a basic kernel for solving many scientific and engineering applications problems. With the appearance of Graphics Processing Units (GPUs) as platforms that provides important acceleration factors, the optimization of SpMV on GPUs and its implementation has been a subject of broad research for the last few years. In this work we present a comparative evaluation of sparse matrix vector product (SpMV) on different platforms. We use Cusp library on CUDA architecture GPUs and MKL Intel library as reference on CPUs. Experimental results have been conducted using a set of matrices from matrix market repository1, comparing performance between GPU-based Cusp2 and CPU-based MKL3 libraries. The results showed a global speedup, obtained with GPU, ranging from 1.1 x to 4.6 x compared to CPU implementations. An analysis and evaluation of these results is discussed. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/ICoCS.2014.7060964},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84929179718\&doi=10.1109\%2fICoCS.2014.7060964\&partnerID=40\&md5=5a761f6d02607bb6f754f683b3a7878f},
	author = {Kasmi, N.a and Mahmoudi, S.A.b and Zbakh, M.a and Manneback, P.b}
}
@conference {Zeddari20141115,
	title = {Towards a new Framework for building a whole user-defined system from a Colored Petri Networks: Class diagram to a colored Petri networks Towards a new framework},
	booktitle = {International Conference on Multimedia Computing and Systems -Proceedings},
	year = {2014},
	note = {cited By 2},
	pages = {1115-1119},
	abstract = {In this paper we provide a discussion of designing a new Framework for building a whole system from a colored Petri Network. This framework will integrate the translation process of a multiview class to a colored Petri network developed in [1]. With two examples, we will extend this process by using fields, methods and access control. The advantages of using colored Petri networks compared to ordinary ones are also discussed as well as our new framework design. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/ICMCS.2014.6911381},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84928737785\&doi=10.1109\%2fICMCS.2014.6911381\&partnerID=40\&md5=b9527753dfe029ce9fa56439a47853b2},
	author = {Zeddari, A. and Ettalbi, A.}
}
@conference { ISI:000366999600195,
	title = {Towards a new Framework or building a whole user-defined system from a Colored Petri Networks Class Diagram to a Colored Petri Networks. Towards a new framework.},
	booktitle = {2014 INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS)},
	year = {2014},
	note = {International Conference on Multimedia Computing and Systems (ICMCS), Marrakech, MOROCCO, APR 14-16, 2014},
	pages = {1115-1119},
	abstract = {In this paper we provide a discussion of designing a new Framework for building a whole system from a colored Petri Network. This framework will integrate the translation process of a multiview class to a colored Petri network developed in {[}1]. With two examples, we will extend this process by using fields, methods and access control. The advantages of using colored Petri networks compared to ordinary ones are also discussed as well as our new framework design.},
	isbn = {978-1-4799-3824-7},
	author = {Zeddari, Abderrazzak and Ettalbi, Ahmed}
}
@article {Zakriti201387,
	title = {Design and realization of three-pole bandpass filter with spurious response suppression using defected ground structures},
	journal = {Progress In Electromagnetics Research C},
	volume = {45},
	year = {2013},
	note = {cited By 0},
	pages = {87-100},
	abstract = {In this paper, a three-pole bandpass filter (BPF) using a new defected ground structure (DGS) is discussed. The proposed DGS is incorporated in the ground plane under the feed lines and the coupled lines of a bandpass filter to improve the performance of the filter in both passband and stopband. The banpass filter is designed with a center frequency of 1.8 GHz and a bandwidth of 270 MHz. The suppression of better than 20 dB was achieved for frequencies between 2.2 and 5 GHz. A prototype of BPF was fabricated and tested. Prototype measured data was in good agreement with simulation results.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84887400153\&partnerID=40\&md5=ff9bafb969c5b00869e951183ae50f47},
	author = {Zakriti, A.a and Touhami, N.A.b and Bargach, K.b and Lamsalli, M.a and Essaaidi, M.c}
}
@conference {Essaaidi2013,
	title = {Foreword},
	booktitle = {Proceedings of 2013 International Renewable and Sustainable Energy Conference, IRSEC 2013},
	year = {2013},
	note = {cited By 0},
	doi = {10.1109/IRSEC.2013.6529635},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84880987315\&doi=10.1109\%2fIRSEC.2013.6529635\&partnerID=40\&md5=56684ae4c0d74b647febc79bac0ce9bf},
	author = {Essaaidi, M.a and Zaz, Y.b}
}
@conference {Hadi2013248,
	title = {Fulvis: New approach for selecting views to materialize in hybrid information integration},
	booktitle = {2013 5th International Conference on Computer Science and Information Technology, CSIT 2013 - Proceedings},
	year = {2013},
	note = {cited By 0},
	pages = {248-255},
	abstract = {The most important disadvantage of the hybrid approach of information integration is the complexity of selecting the data to materialize, in particular if the data sources are changing and numerous. Several approaches have been proposed to make this task easier. In this paper, we show the shortcomings of the existing ones and we propose to cure this by offering a new flexible approach, we named Fulvis, based on fuzzy logic. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/CSIT.2013.6588788},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84884966295\&doi=10.1109\%2fCSIT.2013.6588788\&partnerID=40\&md5=925b6fbdf8e08181bbe621665960b1e6},
	author = {Hadi, W. and Zellou, A. and Bounabat, B.}
}
@conference { ISI:000332960400040,
	title = {Fulvis: New approach for selecting views to materialize in Hybrid Information Integration},
	booktitle = {2013 5TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY (CSIT)},
	series = {International Conference on Computer Science and Information Technology},
	year = {2013},
	note = {5th International Conference on Computer Science and Information Technology (CSIT), Appl Sci Private Univ, Amman, JORDAN, MAR 27-28, 2013},
	pages = {248-255},
	publisher = {Appl Sci Private Univ, Fac Informat Technol},
	organization = {Appl Sci Private Univ, Fac Informat Technol},
	abstract = {The most important disadvantage of the hybrid approach of information integration is the complexity of selecting the data to materialize, in particular if the data sources are changing and numerous. Several approaches have been proposed to make this task easier. In this paper, we show the shortcomings of the existing ones and we propose to cure this by offering a new flexible approach, we named Fulvis, based on fuzzy logic.},
	isbn = {978-1-4673-5825-5},
	issn = {2381-3458},
	author = {Hadi, Wadii and Zellou, Ahmed and Bounabat, Bouchaib}
}
@article {Hadi2013489,
	title = {A fuzzy logic based method for selecting information to materialize in hybrid information integration system},
	journal = {International Review on Computers and Software},
	volume = {8},
	number = {2},
	year = {2013},
	note = {cited By 3},
	pages = {489-499},
	abstract = {The virtual approach of information integration, called mediation, suffers from the slowness response to user queries and the risk of sources unavailability. To cure these problems, some information may be stored at the mediator level. However, the success of this solution depends on selecting the right set of information to materialize. This task should be automated when the collection of data sources is large and evolving. Existing methods for the selection of information to materialize have some drawbacks and do not always give feasible or optimal results. Therefore, we propose a new approach based on fuzzy logic, which we call FULVIS. {\textcopyright} 2013 Praise Worthy Prize S.r.l. - All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84877313961\&partnerID=40\&md5=a400492f4866ce7ca21892765d7e9433},
	author = {Hadi, W. and Zellou, A. and Bounabat, B.}
}
@conference {Anter2013201,
	title = {The hybrid integration system Towards a new approach for creating candidate views for materialization},
	booktitle = {2013 5th International Conference on Computer Science and Information Technology, CSIT 2013 - Proceedings},
	year = {2013},
	note = {cited By 0},
	pages = {201-209},
	abstract = {The vulgarization of information technologies and telecommunications has generated an enormous amount of information. This information is generally heterogeneous, stored in autonomous and distributed sources. Thus, it becomes necessary to introduce the information integration systems. These systems must ensure an optimal query response time, and the freshness of data. Using a virtual approach cannot answer these questions. On the one hand, the query response time is very important. Indeed, the mediator must access, every time, to the sources for load the relevant information. On the other hand, the sources are not always available. The establishment of a hybrid integration system, where a portion of information is materialized in the mediator and the other portion remains in the sources and are extracted at query time, is an effective solution to these problem, provided that the materialized part has carefully chosen. Based on the distribution of user queries, we present in this paper an approach to select the information most requested by users and organize it as candidate views for materialization in the mediator. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/CSIT.2013.6588780},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84884866157\&doi=10.1109\%2fCSIT.2013.6588780\&partnerID=40\&md5=901ef3c27b658be16f920570e0dd9cce},
	author = {Anter, S. and Zellou, A. and Idri, A.}
}
@conference { ISI:000332960400032,
	title = {The hybrid integration system Towards a new approach for creating candidate views for materialization},
	booktitle = {2013 5TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY (CSIT)},
	series = {International Conference on Computer Science and Information Technology},
	year = {2013},
	note = {5th International Conference on Computer Science and Information Technology (CSIT), Appl Sci Private Univ, Amman, JORDAN, MAR 27-28, 2013},
	pages = {201-209},
	publisher = {Appl Sci Private Univ, Fac Informat Technol},
	organization = {Appl Sci Private Univ, Fac Informat Technol},
	abstract = {The vulgarization of information technologies and telecommunications has generated an enormous amount of information. This information is generally heterogeneous, stored in autonomous and distributed sources. Thus, it becomes necessary to introduce the information integration systems. These systems must ensure an optimal query response time, and the freshness of data. Using a virtual approach cannot answer these questions. On the one hand, the query response time is very important. Indeed, the mediator must access, every time, to the sources for load the relevant information. On the other hand, the sources are not always available. The establishment of a hybrid integration system, where a portion of information is materialized in the mediator and the other portion remains in the sources and are extracted at query time, is an effective solution to these problem, provided that the materialized part has carefully chosen. Based on the distribution of user queries, we present in this paper an approach to select the information most requested by users and organize it as candidate views for materialization in the mediator.},
	isbn = {978-1-4673-5825-5},
	issn = {2381-3458},
	author = {Anter, Samir and Zellou, Ahmed and Idri, Ali}
}
@article {Anter2013158,
	title = {K-Schema: A new approach, based on the distribution of user queries, to create views to materialize in a hybrid integration system},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {47},
	number = {1},
	year = {2013},
	note = {cited By 2},
	pages = {158-170},
	abstract = {The explosion of information technologies and telecommunications has made easy the access and production of information. That is how a very large mass of the latter has generated. This situation has made the integration systems a major need. Among these systems, there is the hybrid mediator. The latter interrogates one part of data on demand as in the virtual approach while charging, filtering and storing the second part, as views, in a local database. The choice of this second part is a critical task. This paper presents a selective approach, which based, essentially, to create these views, on the queries previously posed on the system. Based on the distribution of previous user queries, our approach extract all data most queried by users. The obtained data are classified as candidate views for materialization. Then selecting which one to materialize among all those created in the first step. {\textcopyright} 2005 - 2013 JATIT \& LLS. All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84872374571\&partnerID=40\&md5=c84d7e37d38a4f230cdf4c3a43c22954},
	author = {Anter, S. and Zellou, A. and Idri, A.}
}
@article {Anter2013816,
	title = {MATHIS: A new approach for creating views to materialize in a hybrid integration system},
	journal = {International Review on Computers and Software},
	volume = {8},
	number = {3},
	year = {2013},
	note = {cited By 2},
	pages = {816-825},
	abstract = {The vulgarization of information and telecommunications technologies has made the integration systems an immediate necessity. Among the latter, there are the hybrid integration systems. These offer a local database where it stores a part of data while integrating the other part virtually. This in the objective to increases system performance while ensuring a tradeoff between query response time and data freshness. The approach that has proposed a complete solution is one that creates the candidate views for materialization before selecting among them those that will be materialized. To do this, it selects the attributes most requested by users. Calling the algorithm k-schema, these attributes are organized in schemas, on which we based to build the candidate views for materialization. This approach suffers from a defect. It is because in the phase of the extraction of attributes of interest, we based only on their frequencies of appearance in the user queries. This will select some attributes, even if they do not respond to any selection criterion. Thus, they cause the elimination, in the selection phase, of views to which they were assigned. In this paper, we propose a new approach, which eliminates all attributes that do not respond to the selection criteria prior to the creation of views to materialize. We also propose a new solution to calculate the values of attributes relative to different criteria. {\textcopyright} 2013 Praise Worthy Prize S.r.l. - All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84881501064\&partnerID=40\&md5=5b529bb907d58895a51faec2468f9a6c},
	author = {Anter, S. and Zellou, A. and Idri, A.}
}
@conference {Khiyaita2013,
	title = {Mean field game among cloud computing end users},
	booktitle = {2013 National Security Days - 3eme Edition Des Journees Nationales de Securite, JNS3},
	year = {2013},
	note = {cited By 0},
	abstract = {The rapid development of Internet has given birth to a new business model: Cloud Computing. This new paradigm has experienced a fantastic rise in recent years and is in constant growth. The cloud computing is large distributed systems that employ distributed resources to deliver a service to end users using several technologies. the cloud computing has become increasingly complex by the fact that it uses several techniques. In this paper we propose a game theoretic framework for cloud computing end users which interact through the response time provided by the system and decide willingly to regulate their load to act in steady state. Because the users of a such system generally large, the game will be studied in the scope of mean field game. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/JNS3.2013.6595472},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84884809764\&doi=10.1109\%2fJNS3.2013.6595472\&partnerID=40\&md5=4d4fa525285c9e3e02014b71dd044004},
	author = {Khiyaita, A. and Zbakh, M.}
}
@conference { ISI:000327787500016,
	title = {Mean field game among cloud computing end users},
	booktitle = {2013 NATIONAL SECURITY DAYS (JNS3)},
	year = {2013},
	note = {3rd National Security Days (JNS), Mohammed V Souissi Unvi, Rabat, MOROCCO, APR 26-27, 2013},
	publisher = {Assoc Marocaine ConfiAnace Numerique; Ecole Nationale Superieure Informatique \& Analyse Syst; Informat Secur Res Team; IEEE Morocco Sect; Bank Al Maghrib; Natl Ctr Sci \& Technol Res},
	organization = {Assoc Marocaine ConfiAnace Numerique; Ecole Nationale Superieure Informatique \& Analyse Syst; Informat Secur Res Team; IEEE Morocco Sect; Bank Al Maghrib; Natl Ctr Sci \& Technol Res},
	abstract = {The rapid development of Internet has given birth to a new business model: Cloud Computing. This new paradigm has experienced a fantastic rise in recent years and is in constat growth. The cloud computing is large distributed systems that employ distributed resources to deliver a service to end users using several technologies. the cloud commputing has become increasingly complex by the fact that it is uses several techiques. In this paper we propose a game theoretic framework for cloud computing end usere which interact through the response time provided by the system and decide willingly to regulate their load to act in steady state. Because the users of a such system generally large, the game will be studied in the scope of mean field game.},
	isbn = {978-1-4799-0324-5},
	author = {Khiyaita, A. and Zbakh, M.}
}
@conference { ISI:000350287800039,
	title = {A New Approach of Mapping},
	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 = {Data integration involves combining data residing in different sources, and providing the user a unified view of this data. The problem of designing data integration systems is important in current applications of the real world, and the question which arises at the mapping is how to link the global schema and the set of local schemas of sources. In this paper, we present our approach of mapping for mediation systems, a new approach that focuses on two main aspects, the syntactic aspect that takes into account the structure and shape of the elements of schemas, and semantic aspect related to the meaning of the elements of schemas.},
	isbn = {978-1-4799-3392-1},
	author = {El Yazidi, Moulay Hafid and Zellou, Ahmed and Idri, Ali}
}
@conference {ElYazidi2013,
	title = {A new approach of mapping},
	booktitle = {2013 3rd International Symposium ISKO-Maghreb},
	year = {2013},
	note = {cited By 0},
	abstract = {Data integration involves combining data residing in different sources, and providing the user a unified view of this data. The problem of designing data integration systems is important in current applications of the real world, and the question which arises at the mapping is how to link the global schema and the set of local schemas of sources. In this paper, we present our approach of mapping for mediation systems, a new approach that focuses on two main aspects, the syntactic aspect that takes into account the structure and shape of the elements of schemas, and semantic aspect related to the meaning of the elements of schemas. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/ISKO-Maghreb.2013.6728197},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84894137287\&doi=10.1109\%2fISKO-Maghreb.2013.6728197\&partnerID=40\&md5=e43d0431faff27e488fadb9353329892},
	author = {El Yazidi, M.H. and Zellou, A. and Idri, A.}
}
@conference {Idri2013207,
	title = {Software cost estimation by classical and Fuzzy Analogy for Web Hypermedia Applications: A replicated study},
	booktitle = {Proceedings of the 2013 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013},
	year = {2013},
	note = {cited By 1},
	pages = {207-213},
	abstract = {The aim of this paper is to evaluate and to compare the Classical Analogy and Fuzzy Analogy for software cost estimation on a Web software dataset. Hence, the paper aims to replicate the results of our precedent experiments on this dataset. Moreover, questions regarding the estimates accuracy, the tolerance of imprecision and uncertainty of cost drivers, and the favorable context to use estimation by analogy are discussed. This study approved the usefulness of Fuzzy Analogy for software cost estimation. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/CIDM.2013.6597238},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84885622172\&doi=10.1109\%2fCIDM.2013.6597238\&partnerID=40\&md5=a7c6b5315989675548f9310b89df6f32},
	author = {Idri, A. and Zahi, A.}
}
@conference { ISI:000333756100029,
	title = {Software Cost Estimation by Classical and Fuzzy Analogy for Web Hypermedia Applications: A replicated study},
	booktitle = {2013 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DATA MINING (CIDM)},
	year = {2013},
	note = {IEEE Symposium on Computational Intelligence and Data Mining (CIDM), Singapore, SINGAPORE, APR 16-19, 2013},
	pages = {207-213},
	publisher = {IEEE; IEEE Computat Intelligence Soc},
	organization = {IEEE; IEEE Computat Intelligence Soc},
	abstract = {The aim of this paper is to evaluate and to compare the Classical Analogy and Fuzzy Analogy for software cost estimation on a Web software dataset. Hence, the paper aims to replicate the results of our precedent experiments on this dataset. Moreover, questions regarding the estimates accuracy, the tolerance of imprecision and uncertainty of cost drivers, and the favorable context to use estimation by analogy are discussed. This study approved the usefulness of Fuzzy Analogy for software cost estimation.},
	isbn = {978-1-4673-5895-8},
	author = {Idri, Ali and Zahi, Azeddine}
}
@conference {ElIdrissi2013134,
	title = {Towards a dynamic mapping in P2P mediation system},
	booktitle = {2013 5th International Conference on Computer Science and Information Technology, CSIT 2013 - Proceedings},
	year = {2013},
	note = {cited By 0},
	pages = {134-141},
	abstract = {The data sources integration, disseminated on a network is a major preoccupation in many sectors. Problems due to share and to integrate information Interests a lot of researcher{\textquoteright}s communities since last years. Works were carried to develop tools and techniques for transparent access to data sources available in a network. In this context, two types of integration systems are distinguished: the virtual integration based on mediation systems and the integration based on Peer to Peer systems (P2P). In this paper, we are interested to the correspondence discovery problem, or Mappings, between global schema in a third type of architecture such as the mediation systems based on P2P architecture. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/CSIT.2013.6588771},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84884899567\&doi=10.1109\%2fCSIT.2013.6588771\&partnerID=40\&md5=f694b43a6730e442a9f28c5c4d562a85},
	author = {El Idrissi, S.E.Y. and Zellou, A. and Idri, A.}
}
@conference { ISI:000332960400023,
	title = {Towards a Dynamic Mapping in P2P Mediation system},
	booktitle = {2013 5TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY (CSIT)},
	series = {International Conference on Computer Science and Information Technology},
	year = {2013},
	note = {5th International Conference on Computer Science and Information Technology (CSIT), Appl Sci Private Univ, Amman, JORDAN, MAR 27-28, 2013},
	pages = {134-141},
	publisher = {Appl Sci Private Univ, Fac Informat Technol},
	organization = {Appl Sci Private Univ, Fac Informat Technol},
	abstract = {The data sources integration, disseminated on a network is a major preoccupation in many sectors. Problems due to share and to integrate information Interests a lot of researcher{\textquoteright}s communities since last years. Works were carried to develop tools and techniques for transparent access to data sources available in a network. In this context, two types of integration systems are distinguished: the virtual integration based on mediation systems and the integration based on Peer to Peer systems (P2P). In this paper, we are interested to the correspondence discovery problem, or Mappings, between global schema in a third type of architecture such as the mediation systems based on P2P architecture.},
	isbn = {978-1-4673-5825-5},
	issn = {2381-3458},
	author = {El Idrissi, Selma El Yahyaoui and Zellou, Ahmed and Idri, Ali}
}
@conference { ISI:000350287800038,
	title = {Towards a Framework for Knowledge Management in a Virtual Information Integration},
	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 = {The main objective of this paper is to present an approach allowing equipping the virtual information integration systems by mechanisms of knowledge management in order to return better responses to user demands. These mechanisms will help the integration systems to take into account the user logic (for the requested information treatment) and the information production logic (the logic of the information itself).},
	isbn = {978-1-4799-3392-1},
	author = {Zellou, Ahmed}
}
@conference {Zellou2013,
	title = {Towards a framework for knowledge management in a virtual information integration},
	booktitle = {2013 3rd International Symposium ISKO-Maghreb},
	year = {2013},
	note = {cited By 0},
	abstract = {The main objective of this paper is to present an approach allowing equipping the virtual information integration systems by mechanisms of knowledge management in order to return better responses to user demands. These mechanisms will help the integration systems to take into account the user logic (for the requested information treatment) and the information production logic (the logic of the information itself). {\textcopyright} 2013 IEEE.},
	doi = {10.1109/ISKO-Maghreb.2013.6728196},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84894151898\&doi=10.1109\%2fISKO-Maghreb.2013.6728196\&partnerID=40\&md5=e54c8044a9c00a0f872acec24b59886b},
	author = {Zellou, A.}
}
@article {ElYazidi20131650,
	title = {Towards a fuzzy mapping for virtual integration system},
	journal = {International Review on Computers and Software},
	volume = {8},
	number = {7},
	year = {2013},
	note = {cited By 1},
	pages = {1650-1657},
	abstract = {To access a unified way to different information sources while hiding the user autonomy, heterogeneity, distribution and evolution of these sources, we thought to integrate its different sources of information, one of the existing integration approaches appear mediation as virtual approach. The integration approach mediation is performed using a global schema, and a set of mapping (links) associating schemas of sources to integrate with the global schema. The problem arises in creating the set of correspondences between the elements of the schema global and all the elements of local schemas, in this paper we present our approach: A New Fuzzy Mapping Approach for Mediation Systems, a new approach based on fundamental principles of the theory of fuzzy sets. Our approach is to define and associate to each link between two elements a weight that reflects the degree of its existence, it is present in an analysis using two components: syntactic and semantic. {\textcopyright} 2013 Praise Worthy Prize S.r.l. - All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84884268047\&partnerID=40\&md5=475d3b48645e8a3f8406303d28193d1a},
	author = {El Yazidi, M.H. and Zellou, A. and Idri, A.}
}
@conference { ISI:000310353000061,
	title = {Car recognition for multiple data sets based on Histogram of Oriented Gradients and Support Vector Machines},
	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 = {329-333},
	publisher = {Morocco Sect MTT/AP Joint Chapter},
	organization = {Morocco Sect MTT/AP Joint Chapter},
	abstract = {In this paper we implement a soft margin support vector machine (SVM) using linear and nonlinerar kernels for image classification. The sequential minimal optimization (SMO) method will be used to find the optimal separating hyperplane between the training data that consist of a multidimensional histogram of oriented gradient (HOG) features vectors extracted from multiple data sets.},
	isbn = {978-1-4673-1520-3},
	author = {Kamal, Iias},
	editor = {Essaaidi, M and Zaz, Y}
}
@conference {Saad2012,
	title = {Cloud computing architectures based IDS},
	booktitle = {Proceedings of 2012 International Conference on Complex Systems, ICCS 2012},
	year = {2012},
	note = {cited By 0},
	doi = {10.1109/ICoCS.2012.6458581},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84874479828\&doi=10.1109\%2fICoCS.2012.6458581\&partnerID=40\&md5=6df29286b7630db47e3061bc679f59b0},
	author = {Saad, E.N. and Mahdi, K.E. and Zbakh, M.}
}
@conference { ISI:000324984400079,
	title = {Cloud Computing Architectures Based IDS},
	booktitle = {PROCEEDINGS OF 2012 INTERNATIONAL CONFERENCE ON COMPLEX SYSTEMS (ICCS12)},
	year = {2012},
	note = {1st International Conference on Complex Systems (ICCS), Agadir, MOROCCO, NOV 05-06, 2012},
	pages = {457-462},
	abstract = {Today, cloud computing is an attractive and cost-saving saving service for buyers as it provides accessibility and reliability options for users and scalable sales for providers. Before implementing this method of computing, however, it is important to consider the security of the cloud. In this paper, we will present, a classification of specific and traditional attacks to the cloud computing according to their origin and their category, as a solution to protect the cloud from these attacks, the IDS integrated in the cloud remains among the best solution, therefore we will show some existing cloud computing architecture based Intrusion Detection System (IDS), their strengths and weaknesses. For the comparative study between the architectures, we have adopted transparency, alerts analysis, authentication, accountability, dynamic reaction, centralized management, interoperability, deployability and control from front office side as criterion for comparison, as a result of this comparative study, we propose a new architecture in one hand by correcting some weaknesses and in the other hand integrating certain concept.},
	isbn = {978-1-4673-4766-2},
	author = {Saad, En Niari and El Mahdi, Khalil and Zbakh, Mostapha},
	editor = {Essaaidi, M and Nemiche, M}
}
@conference { ISI:000325229700033,
	title = {Detection evaluation and testing region incoming people{\textquoteright}s in a simple camera view},
	booktitle = {2012 SECOND INTERNATIONAL CONFERENCE ON INNOVATIVE COMPUTING TECHNOLOGY (INTECH)},
	year = {2012},
	note = {2nd International Conference on Innovative Computing Technology (INTECH), Casablanca, MOROCCO, SEP 18-20, 2012},
	pages = {179-183},
	publisher = {IEEE UK \& RI Consumer Elect Chapter; IEEE Broadcast Technol Chapter; IEEE},
	organization = {IEEE UK \& RI Consumer Elect Chapter; IEEE Broadcast Technol Chapter; IEEE},
	abstract = {Moving object detection is considered as a crucial phase of automatic video surveillance systems, particularly, people detection is the first important step in any technique of video analysis processes wich can be divided in many stations as motion estimation, tracking people etc. Several methods have been developed for this problem of separating the foreground and background pixels in video surveillance. This paper focuses on computable evaluation of some people detection algorithms for four different video sequences. Our study is based on quantitative and qualitative results respectively by calculating the loss of foreground pixels. Particularly, Three methods have been evaluated by using two metrics: False Negative Error (FNE) and False Positive Error (FPE). In the result we choose the algorithm witch minimize the Error (\%). Practically the good technique which dominates on the video surveillance applications is the statistical representation of pixels in foreground which named Gaussian Mixture Model (GMM). In the second part of this paper we control the people entering in a supervised region and we trigger an alarm system in order to find out person presence.},
	isbn = {978-1-4673-2679-7},
	author = {Ez Zahout, Abderrahmane and Moulay Youssef, Hadi and Haj Thami, Rachid Oulad}
}
@conference { ISI:000310353000129,
	title = {A Dynamic Proxy for Lightweight Web Service Composition},
	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 = {699-704},
	publisher = {Morocco Sect MTT/AP Joint Chapter},
	organization = {Morocco Sect MTT/AP Joint Chapter},
	abstract = {Web Services (WS) enable access to remote applications over the Internet. Composition thereof gives rise to more complex services by integrating applications over borders of companies, institutions, and countries. But such compositions fail if they cannot dynamically adapt to change in such an ever changing environment. Unfortunately web compositions today are still implemented in a static way. Implementing invocations of web services is too verbose and heavy-weight. It requires manual extraction of each service{\textquoteright}s information from interface descriptions and because of the missing transparency in composition languages, developers repetitively have to write low-level invocation code. This paper proposes a light-weight approach for automatic and transparent web service compositions, supporting standard SOAP-based web services. We provide a proof-of-concept as a scripting language. The benefit is that our web services composition approach makes compositions simpler and more transparent, because invoking a web service is no more complicated than invoking a local method.},
	isbn = {978-1-4673-1520-3},
	author = {Najam, Sara and Dinkelaker, Tom and Erradi, Mohamed and Ouzzif, Mohamed},
	editor = {Essaaidi, M and Zaz, Y}
}
@conference { ISI:000310353000141,
	title = {An Efficient method to find the Minimum Distance of Linear Block Codes},
	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 = {773-779},
	publisher = {Morocco Sect MTT/AP Joint Chapter},
	organization = {Morocco Sect MTT/AP Joint Chapter},
	abstract = {Finding the minimum distance of linear codes is in general a NP-hard problem, we propose an efficient algorithm to attack this problem. The principle of this approach is to search code words locally around the all-zero code word perturbed by a level of noise magnitude, in other words the maximum of noise that can be corrected by a Soft-In decoder, anticipating that the resultant nearest non-zero code words will most likely contain the minimum Hamming weight code word, whose Hamming weight is equal to the minimum distance of the linear code. A numerous results prove that the proposed algorithm is valid for general linear codes and it is very fast comparing to all others known techniques, therefore it is a good tool for computing. Comparing to Joanna{\textquoteright}s works, we proof that our algorithm has a low complexity with a fast time of execution. For some linear RQs, QDCs and BCHs codes with unknown minimum distance, we give a good estimation (true) of the minimum distance where the length is less than 439.},
	isbn = {978-1-4673-1520-3},
	author = {Askali, Mohamed and Nouh, Said and Belkasmi, Mostafa},
	editor = {Essaaidi, M and Zaz, Y}
}
@conference { ISI:000310353000082,
	title = {Emerging Wireless Technologies In E-Health},
	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 = {440-445},
	publisher = {Morocco Sect MTT/AP Joint Chapter},
	organization = {Morocco Sect MTT/AP Joint Chapter},
	abstract = {In healthcare the importance of obtaining the right information, at the right time, irrespective of time and location dependency is very critical. Healthcare personnel need to access real-time medical data such as patient clinical histories, laboratory results, treatments, chronic diseases, medication, and insurance information. Therefore, healthcare is the most apt domain for the application of ubiquitous technologies. Ubiquitous health care aims at creating an environment where healthcare is available to everyone, everywhere through the use of technologies that would not only be pervasive but also be assimilated flawlessly in the daily lives. With large-scale wireless networks and mobile computing solutions, such as cellular 3G, Wi-Fi mesh, WiMAX, Bluetooth, RFID, and Wireless Sensor Networks, health care personnel can tap into vital information anywhere and at any time within the health care networks. Ubiquitous healthcare, although promising, there are myriad challenges associated with realizing its vision. This paper highlights some snapshots of current uses and future trends of various wireless communications in the healthcare domains, addresses their applications for e-health, states the challenges faced in a ubiquitous healthcare environment equipped with different wireless technologies, and how the resulting issues might be addressed by developing a framework that provides a flexible and convenient medical monitoring, consultation, and healthcare.},
	isbn = {978-1-4673-1520-3},
	author = {El Khaddar, Mehdia Ajana and Harroud, Hamid and Boulmalf, Mohammed and Elkoutbi, Mohammed and Habbani, Ahmed},
	editor = {Essaaidi, M and Zaz, Y}
}
@conference { ISI:000310353000095,
	title = {Enhancing performance OLSR in MANET},
	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 = {506-510},
	publisher = {Morocco Sect MTT/AP Joint Chapter},
	organization = {Morocco Sect MTT/AP Joint Chapter},
	abstract = {The performance of a Mobile Ad hoc Network (MANET) is closely related to the capability of the implemented routing protocol to adapt itself to unpredictable changes of topology network and link status. The Optimized Link State Routing (OLSR) protocol is a one key of the proactive routing protocols for MANETs. It is based on the multi-point relays (MPRs) technique to reach all nodes in the network with a limited number of broadcasts. In this paper, we propose new version of the original OLSR protocol based on a new density parameter, in the goal to enhance and adapt it in the presence of the mobility. Also we will analyze and compare the performance of protocols based on a density criterion (Di1OLSR \& D2iOLSR), mobility criterion (MobOLSR) and OLSR standard using NS-2 network simulator.},
	isbn = {978-1-4673-1520-3},
	author = {Loutfi, A. and Elkoutbi, M.},
	editor = {Essaaidi, M and Zaz, Y}
}
@article {Zoukkari2012101,
	title = {E-Strategy formulation: A new approach based on a layered model},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {36},
	number = {1},
	year = {2012},
	note = {cited By 1},
	pages = {101-112},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84857185235\&partnerID=40\&md5=6ec655c0ef7c04077fd3b70d54e7b0ae},
	author = {Zoukkari, N.B. and Doukkali, A. and Regragui, B.}
}
@conference { ISI:000310353000012,
	title = {Evaluation of Hybrid Geo-location based on UMTS and OPS Technologies},
	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 = {63-67},
	publisher = {Morocco Sect MTT/AP Joint Chapter},
	organization = {Morocco Sect MTT/AP Joint Chapter},
	abstract = {The degree of accuracy and availability of service make a distinction between the two main methods of geolocation that areGPS and UMTS. GPS provides good performances in terms of location in open area, but performances degrade to a significant manner when we go into an enclosed area. While the UMTS offers good results in urban areas, we can note a complementarity between these two techniques. In this paper we present a hybrid algorithm that combines these two techniques and takes best advantage of each of them with two approaches one simple and another advanced.},
	isbn = {978-1-4673-1520-3},
	author = {Saadane, Rachid and Belkasmi, Mostafa and El Koutbi, Mohammed and Dadda, Mohamed Rachid},
	editor = {Essaaidi, M and Zaz, Y}
}
@conference {Khiyaita2012106,
	title = {Load balancing cloud computing: State of art},
	booktitle = {Proceedings of the 2nd National Days of Network Security and Systems, JNS2 2012},
	year = {2012},
	note = {cited By 21},
	pages = {106-109},
	doi = {10.1109/JNS2.2012.6249253},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84866649932\&doi=10.1109\%2fJNS2.2012.6249253\&partnerID=40\&md5=9ec95312041c7ba61c0949ea4dc038cd},
	author = {Khiyaita, A. and Bakkali, H.E. and Zbakh, M. and Kettani, D.E.}
}
@conference { ISI:000310353000128,
	title = {A Model-driven Approach for Context-Aware Services Composition},
	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 = {693-698},
	publisher = {Morocco Sect MTT/AP Joint Chapter},
	organization = {Morocco Sect MTT/AP Joint Chapter},
	abstract = {With the emergence of service-oriented architecture (SOA), the provision of business-to-business as well as user-centric services becomes increasingly simple and fluent. Also, the design, development and deployment of services - either elementary or composite - have constantly gained ground. However, the user{\textquoteright}s context must constitute an essential aspect of such services in order to improve the end-user experience. As observed from the literature, several researches focuses mainly on context-aware service design and modeling, but few study had worked on the composition of this new kind of service to provide more complicated features. In this paper, we aim to present our proposal of adapting service composition by the integration of context during the composition process. This dynamic context-aware composition of services is realized through our Context-Aware Composition Builder tool.},
	isbn = {978-1-4673-1520-3},
	author = {Baidouri, Hicham and Hafiddi, Hatim and Nassar, Mahmoud and Kriouile, Abdelaziz},
	editor = {Essaaidi, M and Zaz, Y}
}
@conference { ISI:000310353000213,
	title = {A New Genetic Decoding of Linear Block Codes},
	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 = {1176-1182},
	publisher = {Morocco Sect MTT/AP Joint Chapter},
	organization = {Morocco Sect MTT/AP Joint Chapter},
	abstract = {In this paper, we present a new hard-decision decoding technique based on Genetic Algorithms, which is applicable to the more general case where the only known structure is given by the parity-check matrix H. The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new approach reduces the complexity of decoding the codes of high rates. We also presented a new soft-decision decoding based on Genetic Algorithms and the Chase algorithm. The simulations applied on some binary Linear Block Codes, show that the genetic decoder has the same performance as the Berlekamp-Massey Algorithm (BM) and Cardoso algorithm.},
	isbn = {978-1-4673-1520-3},
	author = {Azouaoui, Ahmed and Belkasmi, Mostafa},
	editor = {Essaaidi, M and Zaz, Y}
}
@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}
}
@conference { ISI:000310353000045,
	title = {PERFORMANCE ANALYSIS OF WiFi/WiMAX VERTICAL HANDOVER BASED ON MEDIA INDEPENDENT HANDOVER},
	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 = {239-243},
	publisher = {Morocco Sect MTT/AP Joint Chapter},
	organization = {Morocco Sect MTT/AP Joint Chapter},
	abstract = {Currently, there are several wireless networks deployed around the world. Examples include cellular networks, metropolitan area networks and wireless local area networks. Given the heterogeneity of the existing network technologies, the diversity of mobile applications, and user requirements, ensuring service continuity for a mobile user when changing different access network becomes a mandatory aspect. The aim of this work is to study and analyse a solution based on the IEEE802.21 standard, to enable interoperability between different networks. The assessment takes place in a context of mobility between WiFi and WiMAX networks. The network simulator NS2 is used during this study.},
	isbn = {978-1-4673-1520-3},
	author = {Benkaouz, Yahya and Angoma, Blaise and Erradi, Mohammed},
	editor = {Essaaidi, M and Zaz, Y}
}
@conference { ISI:000324984400037,
	title = {Personalization of a hybrid integration system Creation of views to materialize based on the distribution of user queries},
	booktitle = {PROCEEDINGS OF 2012 INTERNATIONAL CONFERENCE ON COMPLEX SYSTEMS (ICCS12)},
	year = {2012},
	note = {1st International Conference on Complex Systems (ICCS), Agadir, MOROCCO, NOV 05-06, 2012},
	pages = {224-230},
	abstract = {The hybrid mediator is an integration system where one part of data is queried on demand as in the virtual approach, while another part is extracted, filtered and stored in a local database. The selection of data to be stored in the mediator (to materialize) is an essential task. Different selection criteria were proposed to select among a set of candidate views, ones that will be materialized. However, the approaches proposed with regard to the creation of these views are rare. This paper presents a data materialization approach, in the scope of a hybrid integration system. This approach creates candidate views for materialization based on the previous user queries, and then decides which among them should be selected for materialization. Guided by the technique of clustering-merging, it is organized into two steps: (1) from the distribution of previous user queries, are extracted all data most queried by users. The obtained data are classified as candidate views for materialization. (2) then selecting which views to materialize among all the candidate views created in the first step.},
	isbn = {978-1-4673-4766-2},
	author = {Anter, Samir and Zellou, Ahmed and Idri, Ali},
	editor = {Essaaidi, M and Nemiche, M}
}
@conference {Anter2012,
	title = {Personalization of a hybrid integration system: Creation of views to materialize based on the distribution of user queries},
	booktitle = {Proceedings of 2012 International Conference on Complex Systems, ICCS 2012},
	year = {2012},
	note = {cited By 0},
	doi = {10.1109/ICoCS.2012.6458566},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84874493599\&doi=10.1109\%2fICoCS.2012.6458566\&partnerID=40\&md5=8cb54118f3a51aadd4afa9789ecdcc3a},
	author = {Anter, S. and Zellou, A. and Idri, A.}
}
@conference {Essaaidi2012,
	title = {Proceedings of 2012 International Conference on Multimedia Computing and Systems, ICMCS 2012: Foreword},
	booktitle = {Proceedings of 2012 International Conference on Multimedia Computing and Systems, ICMCS 2012},
	year = {2012},
	note = {cited By 0},
	doi = {10.1109/ICMCS.2012.6320113},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84869744137\&doi=10.1109\%2fICMCS.2012.6320113\&partnerID=40\&md5=8ef3c1358ee74f9233c3c4c6f9f7f9e4},
	author = {Essaaidi, M. and Zaz, Y.}
}
@conference { ISI:000310353000131,
	title = {Promoting reuse in web services by managing variability},
	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 = {712-717},
	publisher = {Morocco Sect MTT/AP Joint Chapter},
	organization = {Morocco Sect MTT/AP Joint Chapter},
	abstract = {Service Oriented Architecture (SOA) refers to an architectural paradigm that describes how organizations, people and systems provide and use services to achieve their goals. Moreover, with the evolution of SOA, the focus in software development has shifted from applications to reusable services. Besides, reuse in SOA has more focused on service composition rather than reuse of existing implementations to build new services with additional functionalities. The preferred way to realize SOA remains web services which explain our interest in promoting reuse of Web services by managing variability. In this paper, we propose a model driven method for managing Web service{\textquoteright}s variability based on MDA (Model Driven Architecture). In fact, through MDA, the method enables the automation of Web service{\textquoteright}s realization regardless of the supported platforms. Moreover, we present a WSDL extension meta-model called VarWSDL which enhances Web services by variability notions. That permits Web services reuse.},
	isbn = {978-1-4673-1520-3},
	author = {Chakir, Boutaina and Fredj, Mounia and Nassar, Mahmoud},
	editor = {Essaaidi, M and Zaz, Y}
}
@conference { ISI:000310353000009,
	title = {QDGRP : A Hybrid QoS Distributed Genetic Routing Protocol for Wireless Sensor 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 = {47-52},
	publisher = {Morocco Sect MTT/AP Joint Chapter},
	organization = {Morocco Sect MTT/AP Joint Chapter},
	abstract = {Nature-inspired routing protocols have been subject to a great research activity. Their decentralized nature and low requirements make them highly suitable for Wireless Sensor Networks (WSN) where individual nodes operate without central control and without global overview of the network status to achieve global tasks. This paper proposes a hybrid QoS routing protocol for WSN based on a customized Distributed Genetic Algorithm (DGA) that accounts for delay and energy constraints. The proposed protocol (QDGRP) is compared to AODV w.r.t several performance metrics : end-to-end delay, throughput, packet delivery ratio and energy efficiency. The realized simulations show that QDGRP outperforms AODV and manages to achieve very good performances for various deployment scenarios.},
	isbn = {978-1-4673-1520-3},
	author = {Koulali, Mohammed-Amine and Kobbane, Abdellatif and El Koutbi, Mohammed and Azizi, Mostafa},
	editor = {Essaaidi, M and Zaz, Y}
}
@conference { ISI:000310353000165,
	title = {SOASMM: a Novel Service Oriented Architecture Security Maturity Model},
	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 = {911-917},
	publisher = {Morocco Sect MTT/AP Joint Chapter},
	organization = {Morocco Sect MTT/AP Joint Chapter},
	abstract = {Ensuring SOA developed applications security has become crucial to protect against potential damage and is a sign of confidence for companies that would like to start collaboration based on SOA services. The aim of the present paper is to present the principles of a novel tool that supports the assessment of SOA security maturity of organizations: the SOASMM (SOA Security Maturity Model). This model was defined by incorporating information security best practice approaches in the paradigm of service-oriented architecture using an argued approach and mapping models. Security Indicators deduced in our study denote the complexity of security controls as SOA maturity levels get higher. Besides, as the model that we proposed is based on security standards and best practices, it can be further developed to support organizations to evaluate and adjust their security practices according to their SOA migration plan.},
	isbn = {978-1-4673-1520-3},
	author = {Kassou, Meryem and Kjiri, Laila},
	editor = {Essaaidi, M and Zaz, Y}
}
@conference {Yazidi2012,
	title = {Towards a fuzzy mapping for mediation systems},
	booktitle = {Proceedings of 2012 International Conference on Complex Systems, ICCS 2012},
	year = {2012},
	note = {cited By 0},
	doi = {10.1109/ICoCS.2012.6458573},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84874494252\&doi=10.1109\%2fICoCS.2012.6458573\&partnerID=40\&md5=f777377bdfd9a344347799d38e97941d},
	author = {Yazidi, M.H.E. and Zellou, A. and Idri, A.}
}
@conference { ISI:000324984400020,
	title = {Towards a Fuzzy Mapping for Mediation Systems},
	booktitle = {PROCEEDINGS OF 2012 INTERNATIONAL CONFERENCE ON COMPLEX SYSTEMS (ICCS12)},
	year = {2012},
	note = {1st International Conference on Complex Systems (ICCS), Agadir, MOROCCO, NOV 05-06, 2012},
	pages = {122-125},
	abstract = {Data integration involves combining data residing at different sources, and providing to the user a unified and global view of this data. The problem of designing data integration systems is important in current applications of real world, especially for mapping between attributes of global schema and those of local schemas of sources. The question is how to link the global schema and the set of local schemas of sources. In this paper, we focus on studying the mapping approaches, more precisely the Global As View GAV approach (GAV) for schemas mapping. Also, we present a new approach of mapping for mediation systems, based on fuzzy logic. This new approach enjoys the benefits and advantages of fuzzy sets theory.},
	isbn = {978-1-4673-4766-2},
	author = {El Yazidi, Moulay Hafid and Zellou, Ahmed and Idri, Ali},
	editor = {Essaaidi, M and Nemiche, M}
}
@conference { ISI:000310353000171,
	title = {Towards a New Design for Trust Reputation System},
	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 = {943-948},
	publisher = {Morocco Sect MTT/AP Joint Chapter},
	organization = {Morocco Sect MTT/AP Joint Chapter},
	abstract = {Trust is indispensible for any user of an e-service in order to make a decision before dealing with any transaction. That{\textquoteright}s the reason why, users and service providers need various and functional methods to build on-line trust reputation systems. This paper discusses the use of trust management and reputation systems in electronic transactions and particularly in e-commerce applications. It presents a survey of some existing trust reputation systems used in e-commerce applications. This survey proposes a new design for trust reputation systems (TRS) that focuses on the use of semantic feedbacks in order to calculate users{\textquoteright} recommendation weights and to classify them according to these weights. This paper highlights the importance of making the distinction between trustful feedbacks or ratings and distrustful ones. It proposes also some methods to follow and to put in practice in order to give the right weight to the right recommendations.},
	isbn = {978-1-4673-1520-3},
	author = {Rahimi, Hasnae and El Bakkali, Hanane},
	editor = {Essaaidi, M and Zaz, Y}
}
@conference { ISI:000310353000166,
	title = {TOWARDS A SESSION BASED OrBAC MODEL},
	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 = {918-923},
	publisher = {Morocco Sect MTT/AP Joint Chapter},
	organization = {Morocco Sect MTT/AP Joint Chapter},
	abstract = {A collabor ative system allow; a grou p of users to collaborate through a distr i buted platform in order to perform a c ommon task. These users may h av e conc urrent access to shared objec ts. In this contex t, access con trol becomes an important issue tha t must be addressed Access control models are des igned to pro tect shared information a nd resources, of any type and at different levels of granularity. In this work we present SOrBAC: an extension of OrBAC model, in order to provide a mechanism f or securing a dynamic collaborative Session. SOrBAC introduces a new level named Session level to the original OrBAC model. This session level introduces new entities to allow a dynamic access control during a collaborati ve session.},
	isbn = {978-1-4673-1520-3},
	author = {Madani, Mohamed Amine and Erradi, Mohammed},
	editor = {Essaaidi, M and Zaz, Y}
}
@conference { ISI:000310353000111,
	title = {VNS-RP algorithm for RP selection in multicast routing protocol PIM-SM},
	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 = {595-600},
	publisher = {Morocco Sect MTT/AP Joint Chapter},
	organization = {Morocco Sect MTT/AP Joint Chapter},
	abstract = {Covering both theoretical and practical interest in different networks layers, multicast routing remains an important topic. In network layer, there are several multicast routing protocols using different multicast routing trees in the literature. However PIM-SM and CBT protocols remains the most used multicast routing protocols; they propose using a shared tree (ST). This kind of tree provides efficient management of multicast path in changing group memberships, scalability and performance. The main problem concerning the construction of a shared tree is to determine the best position of the root. Selection of the core (in CBT protocol) or Rendezvous Point RP (in PIM-SM protocol) affects directly both structure of multicast tree and routing scheme performances of multicast session accordingly. This paper proposes a multicast RP selection algorithm based on VNS search. This algorithm selects the RP router with systematic change of arbitrarily chosen neighborhoods by considering both cost and delay functions. Simulation results show that good performance is achieved in terms of multicast cost, end-to-end delay, tree construction delay and others metrics.},
	isbn = {978-1-4673-1520-3},
	author = {Baddi, Youssef and Ech-Chrif El Kettani, Mohamed Dafir},
	editor = {Essaaidi, M and Zaz, Y}
}
@conference {Zoubairi2011,
	title = {Dynamic QoS management in mobile services framework},
	booktitle = {International Conference on Multimedia Computing and Systems -Proceedings},
	year = {2011},
	note = {cited By 0},
	doi = {10.1109/ICMCS.2011.5945691},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79961242339\&doi=10.1109\%2fICMCS.2011.5945691\&partnerID=40\&md5=dc02a4eb28cdfcfae12bca1fa64efde3},
	author = {Zoubairi, R. and Jarir, Z. and Erradi, M.}
}
@conference { ISI:000371495900010,
	title = {Measure of Fuzzy Presence of Descriptors on Arabic Text Mining},
	booktitle = {2012 COLLOQUIUM ON INFORMATION SCIENCE AND TECHNOLOGY (CIST{\textquoteright}12)},
	series = {Colloquium in Information Science and Technology},
	year = {2011},
	note = {IEEE Colloquium on Information Science and Technology (CIST), Fez, MOROCCO, OCT 22-24, 2012},
	pages = {58-63},
	publisher = {IEEE; IEEE Morocco Sect; IEEE Morocco Comp \& Commun Joint Chapter; USMBA IEEE Student Branch; Faculty of Sciences Dhar Mahraz; Faculty of Technical Sciences of Fez; IEEE Comp Soc; IEEE Commun Soc},
	organization = {IEEE; IEEE Morocco Sect; IEEE Morocco Comp \& Commun Joint Chapter; USMBA IEEE Student Branch; Faculty of Sciences Dhar Mahraz; Faculty of Technical Sciences of Fez; IEEE Comp Soc; IEEE Commun Soc},
	abstract = {In the present work, we propose a new model of radical descriptors in Arabic Text Mining. This model will be based on the addition of lexical information contained in the morphological pattern of the Arabic word. We developed a statistical model by Hidden Markov Chain to disambiguate the morphological analysis of corpora, and we propose a new method to measure the relationship between descriptors based on a notion of {\textquoteleft}{\textquoteleft}fuzzy measure of the presence{{\textquoteright}{\textquoteright}} and we adapt the traditional statistical measures to this context, and we outline the key measures of similarity and distances used in Text Mining.},
	isbn = {978-1-4673-2725-1},
	issn = {2327-185X},
	author = {El Hassani, Ibtissam and Kriouile, Abdelaziz and Benghabrit, Youssef},
	editor = {ElMohajir, M and Begdouri, A and ElMohajir, BE and Zarghili, A}
}
@conference { ISI:000371495900003,
	title = {Model ISR3M for assessing maturity of IS risk management process Case study},
	booktitle = {2012 COLLOQUIUM ON INFORMATION SCIENCE AND TECHNOLOGY (CIST{\textquoteright}12)},
	series = {Colloquium in Information Science and Technology},
	year = {2011},
	note = {IEEE Colloquium on Information Science and Technology (CIST), Fez, MOROCCO, OCT 22-24, 2012},
	pages = {16-21},
	publisher = {IEEE; IEEE Morocco Sect; IEEE Morocco Comp \& Commun Joint Chapter; USMBA IEEE Student Branch; Faculty of Sciences Dhar Mahraz; Faculty of Technical Sciences of Fez; IEEE Comp Soc; IEEE Commun Soc},
	organization = {IEEE; IEEE Morocco Sect; IEEE Morocco Comp \& Commun Joint Chapter; USMBA IEEE Student Branch; Faculty of Sciences Dhar Mahraz; Faculty of Technical Sciences of Fez; IEEE Comp Soc; IEEE Commun Soc},
	abstract = {We aim through this article to contribute to the development of information system (IS) governance and more specifically of IS risk management (RM). We then propose a maturity model for IS risk management and we implement it on a case study following all the steps in the model designed. Those steps are: defining the list of information systems of the organization, measuring the maturity for each of those IS taking into account the evolution in its life cycle, measuring the consolidated maturity of IS risk management process for the organization.},
	isbn = {978-1-4673-2725-1},
	issn = {2327-185X},
	author = {Elmaallam, Mina and Kriouile, Abdelaziz},
	editor = {ElMohajir, M and Begdouri, A and ElMohajir, BE and Zarghili, A}
}
@conference { ISI:000371495900004,
	title = {A process pattern for managing evolution of configurable reference process models},
	booktitle = {2012 COLLOQUIUM ON INFORMATION SCIENCE AND TECHNOLOGY (CIST{\textquoteright}12)},
	series = {Colloquium in Information Science and Technology},
	year = {2011},
	note = {IEEE Colloquium on Information Science and Technology (CIST), Fez, MOROCCO, OCT 22-24, 2012},
	pages = {22-25},
	publisher = {IEEE; IEEE Morocco Sect; IEEE Morocco Comp \& Commun Joint Chapter; USMBA IEEE Student Branch; Faculty of Sciences Dhar Mahraz; Faculty of Technical Sciences of Fez; IEEE Comp Soc; IEEE Commun Soc},
	organization = {IEEE; IEEE Morocco Sect; IEEE Morocco Comp \& Commun Joint Chapter; USMBA IEEE Student Branch; Faculty of Sciences Dhar Mahraz; Faculty of Technical Sciences of Fez; IEEE Comp Soc; IEEE Commun Soc},
	abstract = {During the last years, reference process modeling becomes an efficient approach for reuse in business process modeling (BPM). Many BPM tools provide mechanisms to adapt reference process models in order to meet new needs. However, this adaptation results in a set of variants which have to be managed. One of the most proposed solutions is the configurable process model. Therefore, evolving this configurable process model in terms of activities, a data flows and resources changes becomes a crucial issue. In this paper, we propose a process pattern which guides designers for managing evolution of configurable reference process models.},
	isbn = {978-1-4673-2725-1},
	issn = {2327-185X},
	author = {Sbai, Hanae and Fredj, Mounia and Kjiri, Laila},
	editor = {ElMohajir, M and Begdouri, A and ElMohajir, BE and Zarghili, A}
}
@conference { ISI:000371495900008,
	title = {Some methods to address the problem of Unbalanced Sentiment Classification in an Arabic context},
	booktitle = {2012 COLLOQUIUM ON INFORMATION SCIENCE AND TECHNOLOGY (CIST{\textquoteright}12)},
	series = {Colloquium in Information Science and Technology},
	year = {2011},
	note = {IEEE Colloquium on Information Science and Technology (CIST), Fez, MOROCCO, OCT 22-24, 2012},
	pages = {43-48},
	publisher = {IEEE; IEEE Morocco Sect; IEEE Morocco Comp \& Commun Joint Chapter; USMBA IEEE Student Branch; Faculty of Sciences Dhar Mahraz; Faculty of Technical Sciences of Fez; IEEE Comp Soc; IEEE Commun Soc},
	organization = {IEEE; IEEE Morocco Sect; IEEE Morocco Comp \& Commun Joint Chapter; USMBA IEEE Student Branch; Faculty of Sciences Dhar Mahraz; Faculty of Technical Sciences of Fez; IEEE Comp Soc; IEEE Commun Soc},
	abstract = {The rise of social media (such as online web forums and social networking sites) has attracted interests to mining and analyzing opinions available on the web. The online opinion has become the object of studies in many research areas; especially that called {\textquoteleft}{\textquoteleft}Opinion Mining and Sentiment Analysis{{\textquoteright}{\textquoteright}}. Several interesting and advanced works were performed on few languages (in particular English). However, there were very few studies on some languages such as Arabic. This paper presents the study we have carried out to address the problem of unbalanced data sets in supervised sentiment classification in an Arabic context. We propose three different methods to under-sample the majority class documents. Our goal is to compare the effectiveness of the proposed methods with the common random under-sampling. We also aim to evaluate the behavior of the classifier toward different under-sampling rates. We use two different common classifiers, namely Naive Bayes and Support Vector Machines. The experiments are carried out on an Arabic data set that we have built from Aljazeera{\textquoteright}s web site and labeled manually. The results show that Naive Bayes is sensitive to data set size, the more we reduce the data the more the results degrade. However, it is not sensitive to unbalanced data sets on the contrary of Support Vector Machines which is highly sensitive to unbalanced data sets. The results show also that we can rely on the proposed techniques and that they are typically competitive with random under-sampling.},
	isbn = {978-1-4673-2725-1},
	issn = {2327-185X},
	author = {Mountassir, Asmaa and Benbrahim, Houda and Berrada, Ilham},
	editor = {ElMohajir, M and Begdouri, A and ElMohajir, BE and Zarghili, A}
}
@article {Zbakh201115,
	title = {A tasks allocation algorithm for distributed systems},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {33},
	number = {1},
	year = {2011},
	note = {cited By 2},
	pages = {15-21},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-81455136743\&partnerID=40\&md5=0f511f4a564ca12a8b453b80d6074f6a},
	author = {Zbakh, M. and El Kettani, M.D.}
}
@article {Zakrani2010516,
	title = {Applying radial basis function neural networks based on fuzzy clustering to estimate web applications effort},
	journal = {International Review on Computers and Software},
	volume = {5},
	number = {5},
	year = {2010},
	note = {cited By 14},
	pages = {516-524},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-78951478126\&partnerID=40\&md5=d80672acda377940a046a22117b6b033},
	author = {Zakrani, A. and Idri, A.}
}
@article {Zbakh2010110,
	title = {Tasks allocation problem as a non - cooperative game},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {16},
	number = {2},
	year = {2010},
	note = {cited By 4},
	pages = {110-115},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-78650273415\&partnerID=40\&md5=51d3ad81f886ee25480506eb5dbe999c},
	author = {Zbakh, M. and Hajji, S.E.}
}
@conference {Zoubairi2009,
	title = {Quality of service in MAQAME architecture},
	booktitle = {2009 Mediterrannean Microwave Symposium, MMS 2009},
	year = {2009},
	note = {cited By 0},
	doi = {10.1109/MMS.2009.5409836},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-77950325416\&doi=10.1109\%2fMMS.2009.5409836\&partnerID=40\&md5=57718766b57322c34964257ba47d6ded},
	author = {Zoubairi, R. and Jarir, Z. and Erradi, M.}
}
@conference {Idri2008,
	title = {Functional equivalence between radial basis function neural networks and Fuzzy analogy in software cost estimation},
	booktitle = {2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications, ICTTA},
	year = {2008},
	note = {cited By 0},
	doi = {10.1109/ICTTA.2008.4530015},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-49149083210\&doi=10.1109\%2fICTTA.2008.4530015\&partnerID=40\&md5=662843c9cdc63dbc94ac6b4d87307bb2},
	author = {Idri, A. and Zakrani, A. and Abran, A.}
}
@conference { ISI:000261578000113,
	title = {Functional Equivalence between Radial Basis Function Neural Networks and Fuzzy Analogy in Software Cost Estimation},
	booktitle = {2008 3RD INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGIES: FROM THEORY TO APPLICATIONS, VOLS 1-5},
	year = {2008},
	note = {3rd International Conference on Information and Communication Technologies, Damascus, SYRIA, APR 07-11, 2008},
	pages = {615+},
	abstract = {We show in this paper the equivalence between the radial basis function networks and Fuzzy analogy in the field of software cost estimation. We prove that under weak conditions, the three layers of RBFN are functionally equivalent to the three steps of fuzzy analogy. This functional equivalence implies that advances in each literature, such new learning rules or new similarity measures, can be applied to both models directly. Furthermore, this equivalence can help us to provide a natural interpretation of cost estimation models based on RBFN.},
	isbn = {978-1-4244-1751-3},
	author = {Idri, Ali and Zakrani, Abdelali and Abran, Alain}
}
@conference {Idri2008576,
	title = {Fuzzy radial basis function neural networks for web applications cost estimation},
	booktitle = {Innovations{\textquoteright}07: 4th International Conference on Innovations in Information Technology, IIT},
	year = {2008},
	note = {cited By 0},
	pages = {576-580},
	doi = {10.1109/IIT.2007.4430367},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-50249168929\&doi=10.1109\%2fIIT.2007.4430367\&partnerID=40\&md5=ee74c556489187d35257cf7c8b48c2c0},
	author = {Idri, A. and Zakrani, A. and Elkoutbi, M. and Abran, A.}
}
@conference { ISI:000259298600002,
	title = {Software cost estimation models using Radial Basis Function Neural Networks},
	booktitle = {SOFTWARE PROCESS AND PRODUCT MEASUREMENT},
	series = {Lecture Notes in Computer Science},
	volume = {4895},
	year = {2008},
	note = {Joint Meeting of the International Workshop on Software Measurement (IWSM)/International Conference on Software Process and Product Measurement (MENSURA), Palma de Mallorca, SPAIN, NOV 05-07, 2007},
	pages = {21+},
	abstract = {Radial Basis Function Neural Networks (RBFN) have been recently studied due to their qualification as an universal function approximation. This paper investigates the use of RBF neural networks for software cost estimation, The focus of this study is on the design of these networks, especially their middle layer composed of receptive fields, using two clustering techniques: the C-means and the APC-III algorithms. A comparison between a RBFN using C-means and a RBFN using APC-III, in terms of estimates accuracy, is hence presented. This study uses the COCOMO{\textquoteright}81 dataset and data on Web applications from the Tukutuku database.},
	isbn = {978-3-540-85552-1},
	issn = {0302-9743},
	author = {Idri, Ali and Zahi, Azeddine and Mendes, Emilia and Zakrani, Abdelali},
	editor = {CuadradoGallego, JJ and Braungarten, R and Dumke, RR and Abran, A}
}
@article {Idri200821,
	title = {Software cost estimation models using radial basis function neural networks},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {4895 LNCS},
	year = {2008},
	note = {cited By 4},
	pages = {21-31},
	doi = {10.1007/978-3-540-85553-8_2},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-54249149525\&doi=10.1007\%2f978-3-540-85553-8_2\&partnerID=40\&md5=483abae3a29ef61079aab5da6a389786},
	author = {Idri, A. and Zahi, A. and Mendes, E. and Zakrani, A.}
}
@conference { ISI:000255983000005,
	title = {Fuzzy radial basis function neural networks for web applications cost estimation},
	booktitle = {2007 INNOVATIONS IN INFORMATION TECHNOLOGIES, VOLS 1 AND 2},
	year = {2007},
	note = {4th International Conference on Innovations in Information Technology, Dubai, U ARAB EMIRATES, NOV 18-20, 2007},
	pages = {21+},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The Fuzzy Radial basis function Neural Networks (FRBFN) for software cost estimation is designed by integrating the principles of RBFN and the fuzzy C-means clustering algorithm. The architecture of the network is suitably modified at the hidden layer to realise a novel neural implementation of the fuzzy clustering algorithm. Fuzzy set-theoretic concepts are incorporated at the hidden layer, enabling the model to handle uncertain and imprecise data, which can improve greatly the accuracy of obtained estimates. MMRE and Pred are used as measures of prediction accuracy for this comparative study. The results show that an RBFN using fuzzy C-means performs better than an RBFN using hard C-means. This study uses data on web applications from the Tukutuku database.},
	isbn = {978-1-4244-1840-4},
	author = {Idri, Ali and Zakrani, Abdelali and Elkoutbi, Mohamed and Abran, Alain}
}
