@article {Lahmar202289,
	title = {On the value of deep learning for diagnosing diabetic retinopathy},
	journal = {Health and Technology},
	volume = {12},
	number = {1},
	year = {2022},
	note = {cited By 3},
	pages = {89-105},
	abstract = {Diabetic retinopathy (DR) is one of the main causes of vision loss around the world. The early diagnosis of this disease can help in treating it efficiently. Deep learning (DL) is rapidly becoming the state of the art, leading to enhanced performance in various medical applications such as diabetic retinopathy and breast cancer. In this paper, we conduct an empirical evaluation of seven convolutional neural networks (CNN) architectures for an automatic binary classification of the referable diabetic retinopathy; the DL architectures (Inception_ResNet_V2, Inception_V3, ResNet50, VGG16, VGG19, MobileNet_V2 and DenseNet201) were evaluated and compared in terms of accuracy, sensitivity, specificity, precision and F1-score using the Scott Knott test and the Borda count voting method. All the empirical evaluations were over three datasets: APTOS, Kaggle DR and the Messidor-2, using a k-fold cross validation method. Experiments showed the importance of using deep learning in the classification of DR since the seven models gave a high accuracy values. Furthermore, DenseNet201 and mobileNet_V2 were the top two performing techniques respectively. DenseNet201 provided the best performance for the Kaggle and Messidor-2 datasets with an accuracy equal to 84.74\% and 85.79\% respectively. MobileNet_V2 provided the best performance in the APTOS dataset with an accuracy equal to 93.09\%. As for the ResNet50, Inception_V3 and Inception_ResNet_V2, they were the worst performing compared to the other DL techniques. Therefore, we recommend the use of DenseNet201 and MobileNet_V2 for the detection of the referable DR since they provided the best performances on the three datasets. {\textcopyright} 2021, IUPESM and Springer-Verlag GmbH Germany, part of Springer Nature.},
	keywords = {Article, Binary classification, comparative effectiveness, controlled study, Convolutional neural network, Deep learning, densenet201, Diabetic retinopathy, diagnostic accuracy, diagnostic test accuracy study, diagnostic value, human, inception resnet v2, inception v3, k fold cross validation, mobilenet v2, residual neural network, resnet50, sensitivity and specificity, vgg16, vgg19},
	doi = {10.1007/s12553-021-00606-x},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85116986540\&doi=10.1007\%2fs12553-021-00606-x\&partnerID=40\&md5=0a388e86c6b6b49bc1f026a6defbfa2d},
	author = {Lahmar, C. and Idri, A.}
}
@article {Bouanane202277,
	title = {The vehicle routing problem with simultaneous delivery and pickup: A taxonomic survey},
	journal = {International Journal of Logistics Systems and Management},
	volume = {41},
	number = {1-2},
	year = {2022},
	note = {cited By 0},
	pages = {77-119},
	abstract = {In recent years, the vehicle routing problem with simultaneous delivery and pickup (VRPSDP) and its variants, which consist of a study field closely related to the reverse logistics, are becoming much more prevalent and more frequently studied. However, the problem features and assumptions diversify considerably and no literature review has classified the existing studies. The main contributions of this paper are: 1) to define the VRPSDP{\textquoteright}s field in its entirety; 2) to accomplish an all-encompassing taxonomic classification of the VRPSDP literature published since 1989; 3) to delimit all of VRPSDP{\textquoteright}s facets parsimoniously. Proposing an adapted taxonomy, we classify 191 papers and categorise the trends in the VRPSDP literature. Copyright {\textcopyright} 2022 Inderscience Enterprises Ltd.},
	doi = {10.1504/IJLSM.2022.120982},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85125709767\&doi=10.1504\%2fIJLSM.2022.120982\&partnerID=40\&md5=2c0c42404fd11b4e4c7608472b979cbd},
	author = {Bouanane, K. and El Amrani, M. and Benadada, Y.}
}
@article {Hosni2021,
	title = {On the value of filter feature selection techniques in homogeneous ensembles effort estimation},
	journal = {Journal of Software: Evolution and Process},
	volume = {33},
	number = {6},
	year = {2021},
	note = {cited By 1},
	abstract = {Software development effort estimation (SDEE) remains as the principal activity in software project management planning. Over the past four decades, several methods have been proposed to estimate the effort required to develop a software system, including more recently machine learning (ML) techniques. Because ML performance accuracy depends on the features that feed the ML technique, selecting the appropriate features in the preprocessing data step is important. This paper investigates three filter feature selection techniques to check the predictive capability of four single ML techniques: K-nearest neighbor, support vector regression, multilayer perceptron, and decision trees and their homogeneous ensembles over six well-known datasets. Furthermore, the single and ensembles techniques were optimized using the grid search optimization method. The results suggest that the three filter feature selection techniques investigated improve the reasonability and the accuracy performance of the four single techniques. Moreover, the homogeneous ensembles are statistically more accurate than the single techniques. Finally, adopting a random process (i.e., random subspace method) to select the inputs feature for ML technique is not always effective to generate an accurate homogeneous ensemble. {\textcopyright} 2021 John Wiley \& Sons, Ltd.},
	keywords = {Decision trees, Effort Estimation, Feature extraction, K-nearest neighbors, Multilayer neural networks, Nearest neighbor search, Object oriented programming, Predictive capabilities, Project management, Random processes, Random subspace method, Selection techniques, Software design, Software development effort, Software project management, Software systems, Support vector regression},
	doi = {10.1002/smr.2343},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85103402056\&doi=10.1002\%2fsmr.2343\&partnerID=40\&md5=0f4c04b547f3d628d6db8d65b74912e5},
	author = {Hosni, M. and Idri, A. and Abran, A.}
}
@article {Dari20211,
	title = {Verification-based data integrity mechanism in smart grid network},
	journal = {International Journal of Security and Networks},
	volume = {16},
	number = {1},
	year = {2021},
	note = {cited By 1},
	pages = {1-11},
	abstract = {The integration of open communication infrastructures and bidirectional communication between smart metres and utilities in smart grids is very important to support vast amounts of data exchange. It also increases the openness and opportunity of resource sharing across smart grid users, which makes the network vulnerable to several cyber-attacks. These cyber-attacks target smart metres data integrity through several known threats. The most known threats are false data injection (FDI) attacks that manipulate, modify or destroy data by some malicious users. Therefore, these attacks make the smart metres behave maliciously to return false data and to sabotage the system functions. In this paper, we propose a new approach to improve the integrity of data generated by smart metres in a smart grid, namely, verificationbased data integrity mechanism (VBDIM). The performance of our approach is evaluated through simulation to investigate the effects of collusive smart metres on the correctness of their generated data. The obtained results show that our approach achieves a lower blacklisting error and error-rate, and better performance in terms of overhead and slowdown. {\textcopyright} 2021 Inderscience Enterprises Ltd.. All rights reserved.},
	keywords = {Bi-directional communication, Computer crime, Crime, Data integrity, Electric power transmission networks, Electronic data interchange, False data injection, Network security, New approaches, Open communication, Resource sharing, Smart grid networks, Smart power grids, System functions},
	doi = {10.1504/IJSN.2021.112835},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100632953\&doi=10.1504\%2fIJSN.2021.112835\&partnerID=40\&md5=a38922b80a6dd1fbf545482cb986f641},
	author = {Dari, E.Y. and Bendahmane, A. and Essaaidi, M.}
}
@conference {Oumaima2021,
	title = {Vision-based fall detection and prevention for the elderly people: A review ongoing research},
	booktitle = {5th International Conference on Intelligent Computing in Data Sciences, ICDS 2021},
	year = {2021},
	note = {cited By 0},
	abstract = {Falls are the most leading cause of accidental injury deaths worldwide, therefore, it poses a real challenge for the prevention of life-threatening conditions in geriatrics. The most damaged community is the ever-growing aging population. For this reason, there are considerable demands to distinguish a dangerous posture such as fall in real-time. Here we provide a literature review of conducted work on elderly fall detection and prediction mentioning the main methods to recognize human posture including computer vision-based and wearable sensor-based. We approached these perspectives: sensor fusion, Datasets, approaches proposition. In conclusion, our survey summarizes the progress achieved in the five past years to help the researchers in this field to spot areas where further effort would be beneficial and innovative. {\textcopyright} 2021 IEEE.},
	keywords = {Accident prevention, Accidental injuries, Computer vision, Dataset, Elderly, Elderly people, Fall detection, Fall prediction, Fall prevention, Life threatening conditions, Sensor, Vision based, Wearable sensors},
	doi = {10.1109/ICDS53782.2021.9626736},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85123493902\&doi=10.1109\%2fICDS53782.2021.9626736\&partnerID=40\&md5=c99b20a9a8a522cc9440679b23da4ceb},
	author = {Oumaima, G. and Hamd, A.A. and Youness, T. and Rachid, O.H.T. and Omar, B.}
}
@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.}
}
@conference {ElHadj20195330,
	title = {Validation and Correction of Large Security Policies: A Clustering and Access Log Based Approach},
	booktitle = {Proceedings - 2018 IEEE International Conference on Big Data, Big Data 2018},
	year = {2019},
	note = {cited By 0},
	pages = {5330-5332},
	doi = {10.1109/BigData.2018.8622610},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85062588205\&doi=10.1109\%2fBigData.2018.8622610\&partnerID=40\&md5=7c1e7e5b141f9f63ccf2ad00a318664f},
	author = {El Hadj, M.A. and Erradi, M. and Khoumsi, A. and Benkaouz, Y.}
}
@article {Hosni20185977,
	title = {On the value of parameter tuning in heterogeneous ensembles effort estimation},
	journal = {Soft Computing},
	volume = {22},
	number = {18},
	year = {2018},
	pages = {5977-6010},
	doi = {10.1007/s00500-017-2945-4},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85035807309\&doi=10.1007\%2fs00500-017-2945-4\&partnerID=40\&md5=83d094f56b80a21295cf4230621f445d},
	author = {Hosni, M. and Idri, A. and Abran, A. and Nassif, A.B.}
}
@article {Elorriaga2018,
	title = {Variation in mutation spectra among CRISPR/Cas9 mutagenized poplars},
	journal = {Frontiers in Plant Science},
	volume = {9},
	year = {2018},
	doi = {10.3389/fpls.2018.00594},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85046905354\&doi=10.3389\%2ffpls.2018.00594\&partnerID=40\&md5=5813c348dfca604f8eb5bf9c4e3ac76f},
	author = {Elorriaga, E. and Klocko, A.L. and Ma, C. and Strauss, S.H.}
}
@conference {ElBouziady20181,
	title = {Vehicle speed estimation using extracted SURF features from stereo images},
	booktitle = {2018 International Conference on Intelligent Systems and Computer Vision, ISCV 2018},
	volume = {2018-May},
	year = {2018},
	pages = {1-6},
	doi = {10.1109/ISACV.2018.8354040},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85050956891\&doi=10.1109\%2fISACV.2018.8354040\&partnerID=40\&md5=53370a3035d03bc86531c0e0e81069f5},
	author = {El Bouziady, A. and Oulad Haj Thami, R. and Ghogho, M. and Bourja, O. and El Fkihi, S.}
}
@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 {Mohammed201876,
	title = {The vocabulary and the morphology in spell checker},
	booktitle = {Procedia Computer Science},
	volume = {127},
	year = {2018},
	pages = {76-81},
	doi = {10.1016/j.procs.2018.01.100},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85045634856\&doi=10.1016\%2fj.procs.2018.01.100\&partnerID=40\&md5=451f8f1e196430fe5e79a3d99f624f82},
	author = {Mohammed, N. and Abdellah, Y.}
}
@article {Hosni20171,
	title = {On the value of parameter tuning in heterogeneous ensembles effort estimation},
	journal = {Soft Computing},
	year = {2017},
	note = {cited By 0; Article in Press},
	pages = {1-34},
	abstract = {Accurate estimation of software development effort estimation (SDEE) is fundamental for efficient management of software development projects as it assists software managers to efficiently manage their human resources. Over the last four decades, while software engineering researchers have used several effort estimation techniques, including those based on statistical and machine learning methods, no consensus has been reached on the technique that can perform best in all circumstances. To tackle this challenge, Ensemble Effort Estimation, which predicts software development effort by combining more than one solo estimation technique, has recently been investigated. In this paper, heterogeneous ensembles based on four well-known machine learning techniques (K-nearest neighbor, support vector regression, multilayer perceptron and decision trees) were developed and evaluated by investigating the impact of parameter values of the ensemble members on estimation accuracy. In particular, this paper evaluates whether setting ensemble parameters using two optimization techniques (e.g., grid search optimization and particle swarm) permits more accurate estimates of SDEE. The heterogeneous ensembles of this study were built using three combination rules (mean, median and inverse ranked weighted mean) over seven datasets. The results obtained suggest that: (1) Optimized single techniques using grid search or particle swarm optimization provide more accurate estimation; (2) in general ensembles achieve higher accuracy than their single techniques whatever the optimization technique used, even though ensembles do not dominate over all single techniques; (3) heterogeneous ensembles based on optimized single techniques provide more accurate estimation; and (4) generally, particle swarm optimization and grid search techniques generate ensembles with the same predictive capability. {\textcopyright} 2017 Springer-Verlag GmbH Germany, part of Springer Nature},
	doi = {10.1007/s00500-017-2945-4},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85035807309\&doi=10.1007\%2fs00500-017-2945-4\&partnerID=40\&md5=83d094f56b80a21295cf4230621f445d},
	author = {Hosni, M. and Idri, A. and Abran, A. and Nassif, A.B.}
}
@conference {Annouch2017193,
	title = {Variable neighborhood search heuristic for the full truckload problem in liquefied petroleum gas supply},
	booktitle = {2017 International Colloquium on Logistics and Supply Chain Management: Competitiveness and Innovation in Automobile and Aeronautics Industries, LOGISTIQUA 2017},
	year = {2017},
	note = {cited By 0},
	pages = {193-198},
	abstract = {In this paper, we propose a generalized version of the full truckload vehicle routing problem FTVRP in the liquefied petroleum gas (LPG) supply chain. We focus on the supply component that is considered to be the main element of LPG supply chain. The objective consists of determining a schedule of weekly supply which minimizes as well the gas acquisition cost as that of its transport. In order to effectively solve this problem, the mathematical model is established and a neighboring search solution heuristics (VNS) is proposed. The initial solution is generated using a Greedy Algorithm by selecting the most beneficial nodes in terms of transportation cost and gas acquisition cost. In the experiment, different sizes{\textquoteright} problems are used and the numerical results getting with big instance are explored. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/LOGISTIQUA.2017.7962897},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85026655256\&doi=10.1109\%2fLOGISTIQUA.2017.7962897\&partnerID=40\&md5=2b385b6056aad92e333bd54bb956201d},
	author = {Annouch, A. and Bellabdaoui, A.}
}
@conference {El-Yahyaoui2017,
	title = {A verifiable fully homomorphic encryption scheme to secure big data in cloud computing},
	booktitle = {Proceedings - 2017 International Conference on Wireless Networks and Mobile Communications, WINCOM 2017},
	year = {2017},
	note = {cited By 0},
	abstract = {Performing smart computations in a context of cloud computing and big data is highly appreciated today. Fully homomorphic encryption (FHE) is a smart category of encryption schemes that allows working with the data in its encrypted form. It permits us to preserve confidentiality of our sensible data and to benefit from cloud computing powers. Currently, it has been demonstrated by many existing schemes that the theory is feasible but the efficiency needs to be dramatically improved in order to make it usable for real applications. One subtle difficulty is how to efficiently handle the noise. This paper aims to introduce an efficient and verifiable FHE based on a new mathematic structure that is noise free. {\textcopyright}2017 IEEE.},
	doi = {10.1109/WINCOM.2017.8238186},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041451124\&doi=10.1109\%2fWINCOM.2017.8238186\&partnerID=40\&md5=1fa52d884b4c793832bb38dddfe4a232},
	author = {El-Yahyaoui, A. and Ech-Chrif El Kettani, M.D.}
}
@conference {Alouane2017116,
	title = {Virtualization in Cloud Computing: Existing solutions and new approach},
	booktitle = {Proceedings of 2016 International Conference on Cloud Computing Technologies and Applications, CloudTech 2016},
	year = {2017},
	note = {cited By 0},
	pages = {116-123},
	abstract = {Virtualization and virtual environments are fundamental basics for data sharing in Cloud Computing. It is benefic for both the guest user and the provider: while it provides the first with the elements needed to execute his request, it gives the second the ability to be housing different guests with no additional cost. The central component in a virtual architecture is called hypervisor, having extra-privileges, which makes it able to play fundamental role of managing the sharing of data and resources. This hypervisor has many advantages regarding the cost, the simplicity of execution, the availability... But in the other hand, the major role played by this element makes it the perfect target for malicious users aiming to attack the virtual system. In this paper, we will analyze different approaches which try to solve the security issues of hypervisors, and then we will propose our own contribution to increase security in hypervisor related architectures. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/CloudTech.2016.7847687},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85013858869\&doi=10.1109\%2fCloudTech.2016.7847687\&partnerID=40\&md5=3848d0b00f65c22e3ac3d36e219d9ee9},
	author = {Alouane, M. and El Bakkali, H.}
}
@conference { ISI:000386649000017,
	title = {A Validation of a Measurement Based E-government Portals{\textquoteright} Maturity Model},
	booktitle = {2016 42ND EUROMICRO CONFERENCE ON SOFTWARE ENGINEERING AND ADVANCED APPLICATIONS (SEAA)},
	year = {2016},
	note = {42nd Euromicro Conference Series on Software Engineering and Advanced Applications (SEAA), Limassol, CYPRUS, AUG 31-SEP 02, 2016},
	pages = {100-107},
	publisher = {Univ Cyprus; Technolog Educ Inst Western Greece},
	organization = {Univ Cyprus; Technolog Educ Inst Western Greece},
	abstract = {An e-government portal{\textquoteright}s maturity model is a set of stages (from basic to advanced ones) that determines the maturity of e-government portals. In fact, these models can be used to provide directions and recommendations for agencies to improve their portals{\textquoteright} maturity. However, before choosing a maturity model by any agency, it is important to know to which extent the e-government community agree or disagree with the model. In previous research studies, we have built an e-government portals{\textquoteright} maturity model that is based on a best practice model. The aim of this paper is to validate this new model by e-government experts using a survey to prove that the model is valid and reliable. For this purpose, we have described the components of this model, and the previous work that has been done to build it. Based on the results of the survey, our findings show that the new model has proven its validity.},
	isbn = {978-1-5090-2819-1},
	doi = {10.1109/SEAA.2016.38},
	author = {Fath-Allah, Abdoullah and Cheikhi, Laila and Al-Qutaish, Rafa E. and Idri, Ali}
}
@article { ISI:000391111200027,
	title = {Variability Management in Business-IT Alignment: MDA based Approach},
	journal = {INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS},
	volume = {7},
	number = {11},
	year = {2016},
	month = {NOV},
	pages = {212-221},
	abstract = {The expansion of PAIS (Process Aware Information Systems) has created the need for reuse in business processes. In fact, companies are left with directories containing several variants of the same business processes, which differ according to their application context. Consequently, the development of PAIS has become increasingly expensive. Therefore, research in business process management domain introduced the concept of configurable process, with the aim of managing the variability of business process. However, with the emergence of the services-based development paradigm, the alignment of services with business processes is highly required in PAIS. Thus, in this paper an MDA based method which allows for generating configurable services from configurable process is proposed.},
	issn = {2158-107X},
	author = {Sbai, Hanae and Fredj, Mounia}
}
@article {11338540020160228,
	title = {Vertical Handover Decision Algorithm Using Ants{\textquoteright} Colonies for 4G Heterogeneous Wireless Networks.},
	journal = {Journal of Computer Networks \& Communications},
	year = {2016},
	pages = {1 - 15},
	abstract = {With the development of 4G mobile telecommunication systems, providing users with the convenience of a seamless continuous connection is not enough anymore. Users want to be connected through the best available network with the best quality of service. It is necessary to have a good decision-making algorithm which decides whether it is necessary to perform handoff to another network, the best network to vertically perform handoff to, and the right time to initiate the handover. This paper proposes a new approach in which mobile terminals (MTs) continuously analyze the network and keep a database of the best available networks. The concept is based on QoS aware ant colony built on the vertical handoff mechanism that uses an updated version of ants{\textquoteright} colony optimization decision algorithm (ACOR), the dynamic and static factors such as RSS, the cost of service, bandwidth, the velocity of MT, the power consumption and security, and the module for predicting the traveling distance within an},
	keywords = {Ant algorithms, Bandwidths, Quality of service, Roaming (Telecommunication), Wireless sensor networks},
	issn = {20907141},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=113385400\&site=ehost-live},
	author = {El Fachtali, Imad and Saadane, Rachid and Elkoutbi, Mohammed}
}
@article {ElFachtali2016,
	title = {Vertical handover decision algorithm using ants{\textquoteright} colonies for 4G heterogeneous wireless networks},
	journal = {Journal of Computer Networks and Communications},
	volume = {2016},
	year = {2016},
	note = {cited By 1},
	abstract = {With the development of 4G mobile telecommunication systems, providing users with the convenience of a seamless continuous connection is not enough anymore. Users want to be connected through the best available network with the best quality of service. It is necessary to have a good decision-making algorithm which decides whether it is necessary to perform handoff to another network, the best network to vertically perform handoff to, and the right time to initiate the handover. This paper proposes a new approach in which mobile terminals (MTs) continuously analyze the network and keep a database of the best available networks. The concept is based on QoS aware ant colony built on the vertical handoff mechanism that uses an updated version of ants{\textquoteright} colony optimization decision algorithm (A C O R), the dynamic and static factors such as RSS, the cost of service, bandwidth, the velocity of MT, the power consumption and security, and the module for predicting the traveling distance within an IEEE 802.11 WLAN cell. Simulation results show that we can not only meet the individual needs of users in terms of QoS, but also improve the whole system performance by reducing the number of handover failures and unnecessary handover instances by up to 95\%. {\textcopyright} 2016 Imad El Fachtali et al.},
	doi = {10.1155/2016/6259802},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84961880430\&doi=10.1155\%2f2016\%2f6259802\&partnerID=40\&md5=76d5e50d1d0c97071ba232ad71f47e0e},
	author = {El Fachtali, I.a and Saadane, R.b and Elkoutbi, M.a}
}
@article { ISI:000372275400001,
	title = {Vertical Handover Decision Algorithm Using Ants{\textquoteright} Colonies for 4G Heterogeneous Wireless Networks},
	journal = {JOURNAL OF COMPUTER NETWORKS AND COMMUNICATIONS},
	year = {2016},
	abstract = {With the development of 4G mobile telecommunication systems, providing users with the convenience of a seamless continuous connection is not enough anymore. Users want to be connected through the best available network with the best quality of service. It is necessary to have a good decision-making algorithm which decides whether it is necessary to perform handoff to another network, the best network to vertically perform handoff to, and the right time to initiate the handover. This paper proposes a new approach in which mobile terminals (MTs) continuously analyze the network and keep a database of the best available networks. The concept is based on QoS aware ant colony built on the vertical handoff mechanism that uses an updated version of ants{\textquoteright} colony optimization decision algorithm (ACO(R)), the dynamic and static factors such as RSS, the cost of service, bandwidth, the velocity of MT, the power consumption and security, and the module for predicting the traveling distance within an IEEE 802.11 WLAN cell. Simulation results show that we can not only meet the individual needs of users in terms of QoS, but also improve the whole system performance by reducing the number of handover failures and unnecessary handover instances by up to 95\%.},
	issn = {2090-7141},
	doi = {10.1155/2016/6259802},
	author = {El Fachtali, Imad and Saadane, Rachid and Elkoutbi, Mohammed}
}
@article {Bessate201630,
	title = {A very tight approximate results of MRC receivers over independent Weibull fading channels},
	journal = {Physical Communication},
	volume = {21},
	year = {2016},
	note = {cited By 0},
	pages = {30-40},
	abstract = {In this paper, we study the performance of L-branch maximal-ratio combining (MRC) receivers operating over independent Weibull-fading channels. Our main result is a very tight approximation of the probability density function (PDF) of the signal-to-noise ratio (SNR) at the output of the combiner. Based on this result, accurate approximation of significant performance criteria, such as outage probability and average symbol error rate (ASER) are derived. We also evaluate the average bit error rate (ABER) for several coherent and non-coherent modulation schemes, using a closed-form expression for the moment-generating function (MGF) of the output SNR for MRC receivers. In addition, we derive some analytical expressions for channel capacity under various adaptation policies such as optimal rate adaptation (ORA), Optimal simultaneous power and rate adaptation (OPRA), Channel inversion with fixed rate (CIFR), and Truncated channel inversion with fixed rate (TCIFR). The proposed mathematical analysis is complemented by numerous numerical results, which point out the effects of fading severity on the overall system performance. Computer simulations are also performed to verify the validity and the accuracy of the proposed theoretical approach. {\textcopyright} 2016},
	doi = {10.1016/j.phycom.2016.09.001},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84988838375\&doi=10.1016\%2fj.phycom.2016.09.001\&partnerID=40\&md5=5f4edd3ce9db1da7d529f75f03ab0147},
	author = {Bessate, A. and El Bouanani, F.}
}
@article { ISI:000390395500004,
	title = {A very tight approximate results of MRC receivers over independent Weibull fading channels},
	journal = {PHYSICAL COMMUNICATION},
	volume = {21},
	year = {2016},
	month = {DEC},
	pages = {30-40},
	abstract = {In this paper, we study the performance of L-branch maximal-ratio combining (MRC) receivers operating over independent Weibull-fading channels. Our main result is a very tight approximation of the probability density function (PDF) of the signal-to-noise ratio (SNR) at the output of the combiner. Based on this result, accurate approximation of significant performance criteria, such as outage probability and average symbol error rate (ASER) are derived. We also evaluate the average bit error rate (ABER) for several coherent and non-coherent modulation schemes, using a closed-form expression for the moment-generating function (MGF) of the output SNR for MRC receivers. In addition, we derive some analytical expressions for channel capacity under various adaptation policies such as optimal rate adaptation (ORA), Optimal simultaneous power and rate adaptation (OPRA), Channel inversion with fixed rate (CIFR), and Truncated channel inversion with fixed rate (TCIFR). The proposed mathematical analysis is complemented by numerous numerical results, which point out the effects of fading severity on the overall system performance. Computer simulations are also performed to verify the validity and the accuracy of the proposed theoretical approach. (C) 2016 Elsevier B.V. All rights reserved.},
	issn = {1874-4907},
	doi = {10.1016/j.phycom.2016.09.001},
	author = {Bessate, Abdelmajid and El Bouanani, Faissal}
}
@conference { ISI:000391354500008,
	title = {Virtualization in Cloud Computing: NoHype vs HyperWall},
	booktitle = {2016 INTERNATIONAL CONFERENCE ON ELECTRICAL AND INFORMATION TECHNOLOGIES (ICEIT)},
	year = {2016},
	note = {2nd International Conference on Electrical and Information Technologies (ICEIT), Tangier, MOROCCO, MAY 04-07, 2016},
	pages = {49-54},
	abstract = {In the world of Cloud Computing, virtualization and virtual environments are fundamental basics for data sharing. It provides the guest user with the elements needed to execute his request, while it gives the provider the ability to be housing different guests without risking the security and integrity of data. Virtualization is based on a central component, called a hypervisor, having extra-privileges, which makes it the key component capable of managing the sharing of data and resources. In this paper, we will be analyzing different approaches which try to solve the security issues of hypervisors, and we will try to add our own contribution to increase help solving the problem of security of hypervisors based architectures.},
	isbn = {978-1-4673-8469-8},
	author = {Alouane, Meryeme and El Bakkali, Hanan},
	editor = {Essaaidi, M and ElHani, S}
}
@conference {Alouane201649,
	title = {Virtualization in Cloud Computing: NoHype vs HyperWall new approach},
	booktitle = {Proceedings of 2016 International Conference on Electrical and Information Technologies, ICEIT 2016},
	year = {2016},
	note = {cited By 0},
	pages = {49-54},
	abstract = {In the world of Cloud Computing, virtualization and virtual environments are fundamental basics for data sharing. It provides the guest user with the elements needed to execute his request, while it gives the provider the ability to be housing different guests without risking the security and integrity of data. Virtualization is based on a central component, called a hypervisor, having extra-privileges, which makes it the key component capable of managing the sharing of data and resources. In this paper, we will be analyzing different approaches which try to solve the security issues of hypervisors, and we will try to add our own contribution to increase help solving the problem of security of hypervisors based architectures. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/EITech.2016.7519629},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84992192250\&doi=10.1109\%2fEITech.2016.7519629\&partnerID=40\&md5=544c725260cc9a240cc98001c3225484},
	author = {Alouane, M. and El Bakkali, H.}
}
@conference {Ouaskou2015,
	title = {A variant of HB protocols based on permutation for low-cost RFID},
	booktitle = {International Conference on Wireless Networks and Mobile Communications, WINCOM 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {The security issues of RFID technology have been subject of a large number of research documents for over a decade. Several protocols have been developed to ensure reliable access control, namely a family of lightweight authentication protocols since Hopper and Blum proposed the HB protocol in 2001. Taking into account security and performance aspects, we present a new protocol derived from HB+ in which we add the permutation function, providing more effective resistant execution environment of active attacks and with roughly the same complexity. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/WINCOM.2015.7381322},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84965047054\&doi=10.1109\%2fWINCOM.2015.7381322\&partnerID=40\&md5=b58c88a2c45f92717f77780586fa9e13},
	author = {Ouaskou, M. and Lahmer, M. and Belkasmi, M.}
}
@conference { ISI:000380509200025,
	title = {A Variant of HB Protocols Based on Permutation for Low-cost RFID},
	booktitle = {2015 INTERNATIONAL CONFERENCE ON WIRELESS NETWORKS AND MOBILE COMMUNICATIONS (WINCOM)},
	year = {2015},
	note = {International conference on wireless networks and mobile communications, Marrakech, MOROCCO, OCT 20-23, 2015},
	pages = {145-148},
	abstract = {The security issues of RFID technology have been subject of a large number of research documents for over a decade. Several protocols have been developed to ensure reliable access control, namely a family of lightweight authentication protocols since Hopper and Blum proposed the HB protocol in 2001. Taking into account security and performance aspects, we present a new protocol derived from HB+ in which we add the permutation function, providing more effective resistant execution environment of active attacks and with roughly the same complexity.},
	isbn = {978-1-4673-8224-3},
	author = {Ouaskou, Mohamed and Lahmer, Mohammed and Belkasmi, Mostafa}
}
@article { ISI:000348881600008,
	title = {Visual contact with catadioptric cameras},
	journal = {ROBOTICS AND AUTONOMOUS SYSTEMS},
	volume = {64},
	year = {2015},
	month = {FEB},
	pages = {100-119},
	abstract = {Time to contact or time to collision (TTC) is utmost important information for animals as well as for mobile robots because it enables them to avoid obstacles; it is a convenient way to analyze the surrounding environment. The problem of TTC estimation is largely discussed in perspective images. Although a lot of works have shown the interest of omnidirectional camera for robotic applications such as localization, motion, monitoring, few works use omnidirectional images to compute the TTC. In this paper, we show that TTC can be also estimated on catadioptric images. We present two approaches for TTC estimation using directly or indirectly the optical flow based on de-rotation strategy. The first, called {\textquoteleft}{\textquoteleft}gradient based TTC{{\textquoteright}{\textquoteright}}, is simple, fast and it does not need an explicit estimation of the optical flow. Nevertheless, this method cannot provide a TTC on each pixel, valid only for para-catadioptric sensors and requires an initial segmentation of the obstacle. The second method, called {\textquoteleft}{\textquoteleft}TTC map estimation based on optical flow{{\textquoteright}{\textquoteright}}, estimates TTC on each point on the image and provides the depth map of the environment for any obstacle in any direction and is valid for all central catadioptric sensors. Some results and comparisons in synthetic and real images will be given. (C) 2014 Elsevier B.V. All rights reserved.},
	issn = {0921-8890},
	doi = {10.1016/j.robot.2014.09.036},
	author = {Benamar, F. and Elfkihi, S. and Demonceaux, C. and Mouaddib, E. and Aboutajdine, D.}
}
@article {Benamar2015100,
	title = {Visual contact with catadioptric cameras},
	journal = {Robotics and Autonomous Systems},
	volume = {64},
	year = {2015},
	note = {cited By 0},
	pages = {100-119},
	abstract = {Time to contact or time to collision (TTC) is utmost important information for animals as well as for mobile robots because it enables them to avoid obstacles; it is a convenient way to analyze the surrounding environment. The problem of TTC estimation is largely discussed in perspective images. Although a lot of works have shown the interest of omnidirectional camera for robotic applications such as localization, motion, monitoring, few works use omnidirectional images to compute the TTC. In this paper, we show that TTC can be also estimated on catadioptric images. We present two approaches for TTC estimation using directly or indirectly the optical flow based on de-rotation strategy. The first, called "gradient based TTC", is simple, fast and it does not need an explicit estimation of the optical flow. Nevertheless, this method cannot provide a TTC on each pixel, valid only for para-catadioptric sensors and requires an initial segmentation of the obstacle. The second method, called "TTC map estimation based on optical flow", estimates TTC on each point on the image and provides the depth map of the environment for any obstacle in any direction and is valid for all central catadioptric sensors. Some results and comparisons in synthetic and real images will be given. {\textcopyright} 2014 Elsevier B.V. All rights reserved.},
	doi = {10.1016/j.robot.2014.09.036},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84926140754\&doi=10.1016\%2fj.robot.2014.09.036\&partnerID=40\&md5=30948376e9b031a913a35e2c865a9513},
	author = {Benamar, F.a b and Elfkihi, S.a c and Demonceaux, C.d and Mouaddib, E.b and Aboutajdine, D.a}
}
@article {Hdioud2014495,
	title = {Video surveillance: Analyzing people{\textquoteright}s movements in a closed environment},
	journal = {International Review on Computers and Software},
	volume = {9},
	number = {3},
	year = {2014},
	note = {cited By 1},
	pages = {495-501},
	abstract = {In this paper, we developed a method for tracking multiple people in a closed environment based on the feed of a surveillance camera. Monitoring the evolution of the position of people in real time has enabled us to get information on areas occupied by each person in a scene. In addition, to consolidate the trajectories obtained in homogeneous classes, we proposed a new algorithm which allows to adapt the hierarchical classification technique (CHA) and the KMeans technique in cases of similarity measures between trajectories. {\textcopyright} 2014 Praise Worthy Prize S.r.l. - All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84901056262\&partnerID=40\&md5=6dbe9ab0e6c6e8ac8f7c70924419b152},
	author = {Hdioud, B.a and Tirari, M.E.H.b and Thami, R.O.H.a}
}
@conference {Bennani201477,
	title = {Virtual MIMO systems: A game theoretical approach},
	booktitle = {WCCCS 2014 - Proceedings; 2014 5th Workshop on Codes, Cryptography and Communication Systems},
	year = {2014},
	note = {cited By 0},
	pages = {77-80},
	abstract = {In this work, we present a new game theoretic approach in order to build a Virtual MIMO system. The utility function used in this framework is defined so that the user throughput is divided into two components: the real, received by the base station, and the virtual throughput received by the neighboring users. A non-cooperative game is proposed where each user are allowed to choose its uplink receiver as well as to maximize its utility function. Simulation results validate our model and and illustrate numerically the proposed scheme under different scenarios. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/WCCCS.2014.7107924},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84983134494\&doi=10.1109\%2fWCCCS.2014.7107924\&partnerID=40\&md5=7908ed0bd120abe099e5dea1bce6962f},
	author = {Bennani, H.a and Sabir, E.b and Kobbane, A.a and El Koutbi, M.a}
}
@conference { ISI:000345773800002,
	title = {Verification of Multi Decisional Reactive Agent using SMV Model Checker},
	booktitle = {2013 8TH INTERNATIONAL DESIGN AND TEST SYMPOSIUM (IDT)},
	series = {International Design and Test Symposium},
	year = {2013},
	note = {8th IEEE International Design and Test Symposium (IDT), Marrakesh, MOROCCO, DEC 16-18, 2013},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {On account of the evolution of technology, more complicated software arrives with the need to be verified to prevent the errors occurrence in a system which could generate fatal accidents and economic loss. These errors must be detected in an early stage during the development process to reduce redesign costs and faults. To ensure the correctness of software systems, formal verification provides an alternative approach to verify that an implementation of the expected system fulfills its specification. This paper focuses on the verification of reactive system behaviors specified by the Multi Decisional Reactive Agent (MDRA) and modeled using MDRA Profile. The objective in this paper is to use the Model Checking technique for MDRA Profile verification through the Model Checker SMV (Symbolic Model Verifier) to automatically verify the system properties expressed in temporal logic. The SMV mainly focusing on reactive systems provides a modular hierarchical descriptions and definition of reusable components. Besides, the expression of system properties is more described through both Computational Tree Logic (CTL) and Linear Temporal Logic (LTL).},
	isbn = {978-1-4799-3525-3},
	issn = {2162-061X},
	author = {Haqiq, Abdelhay and Bounabat, Bouchaib}
}
@conference {Haqiq2013,
	title = {Verification of multi decisional reactive agent using SMV model checker},
	booktitle = {2013 8th IEEE Design and Test Symposium, IDT 2013},
	year = {2013},
	note = {cited By 0},
	abstract = {On account of the evolution of technology, more complicated software arrives with the need to be verified to prevent the errors occurrence in a system which could generate fatal accidents and economic loss. These errors must be detected in an early stage during the development process to reduce redesign costs and faults. To ensure the correctness of software systems, formal verification provides an alternative approach to verify that an implementation of the expected system fulfills its specification. This paper focuses on the verification of reactive system behaviors specified by the Multi Decisional Reactive Agent (MDRA) and modeled using MDRA Profile. The objective in this paper is to use the Model Checking technique for MDRA Profile verification through the Model Checker SMV (Symbolic Model Verifier) to automatically verify the system properties expressed in temporal logic. The SMV mainly focusing on reactive systems provides a modular hierarchical descriptions and definition of reusable components. Besides, the expression of system properties is more described through both Computational Tree Logic (CTL) and Linear Temporal Logic (LTL). {\textcopyright} 2013 IEEE.},
	doi = {10.1109/IDT.2013.6727075},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84894438200\&doi=10.1109\%2fIDT.2013.6727075\&partnerID=40\&md5=f9d391f76523ab3cbdb7727b864f5e91},
	author = {Haqiq, A. and Bounabat, B.}
}
@article {10115338220131101,
	title = {Vers une approche d{\textquoteright}analyse des besoins m{\'e}tier d{\textquoteright}un Syst{\`e}me d{\textquoteright}Information D{\'e}cisionnel.},
	journal = {E-Ti: E-Review in Technologies Information},
	number = {7},
	year = {2013},
	pages = {59 - 79},
	abstract = {The field of Decisional Information Systems (DIS) analysis and design is highly applying new techniques and methods to promote the success of the decision process and to minimize the time of design. A comparative study conducted on different approaches for analyzing decisional requirements, raises a series of problems. These problems are coming generally from the nature of the applied requirements analysis process, the difficulties in expressing requirements and the insufficient quality of documents. To face these problems, we propose in this paper a method for analyzing decisional requirements, qualified Decisional Business Intelligence (DBI), as a process and models that support the discovery, specification, negotiation and validation requirements. This approach aims to guide and orient analysts designers throughout the DBI process. (English) [ABSTRACT FROM AUTHOR]},
	keywords = {Business requirements Engineering, Decisional Information Systems (DIS), Formalisme P-SIGMA, Ing{\'e}nierie des Besoins M{\'e}tier, P-Sigma formalism, Patron processus, Process pattern, Reuse, R{\'e}utilisation, Syst{\`e}me d{\textquoteright}Information D{\'e}cisionnel (SID)},
	issn = {11148802},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=101153382\&site=ehost-live},
	author = {Sabri, Aziza and Kjiri, Laila}
}
@article {Hdioud2013523,
	title = {Video-surveillance system for tracking a person by estimating the trajectory},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {57},
	number = {3},
	year = {2013},
	note = {cited By 0},
	pages = {523-529},
	abstract = {This paper we propose a simple and efficient video surveillance system which detects and tracks a person in a video stream. Object detection is the most important and crucial step for any video surveillance system. In this paper, we separate foreground and background by using the statistical model of Gaussian Mixture (GMM). Interests points are identified in the detected regions (foreground) using the Harris detector. The analysis of connected components detected by subtracting the background allows grouped the pixels of moving objects in order to extract the center of gravity. Then, a boundary box is used to limit the area of connected components in order to detect the coordinates of the gravity center of the moving person. Finally, by projection in Euclidean plan we can get the trajectory of the person in motion and compute the Euclidean distance crossed in the scene. {\textcopyright} 2005 - 2013 JATIT \& LLS. All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84888801523\&partnerID=40\&md5=747018a467afddec5afee50655417479},
	author = {Hdioud, B.a and Oulad Haj Thami, R.a and El Haj Tirari, M.b}
}
@article {Baddi2012429,
	title = {VND-CS: A Variable Neighborhood Descent Algorithm for Core Selection Problem in Multicast Routing Protocol},
	journal = {Communications in Computer and Information Science},
	volume = {293 PART 1},
	year = {2012},
	note = {cited By 0},
	pages = {429-443},
	doi = {10.1007/978-3-642-30507-8_37},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84880475720\&doi=10.1007\%2f978-3-642-30507-8_37\&partnerID=40\&md5=e5e720a0f5591de6f04960b82124be10},
	author = {Baddi, Y. and El Kettani, M.D.E.-C.}
}
@conference {Baddi2012595,
	title = {VNS-RP algorithm for RP selection in multicast routing protocol PIM-SM},
	booktitle = {Proceedings of 2012 International Conference on Multimedia Computing and Systems, ICMCS 2012},
	year = {2012},
	note = {cited By 1},
	pages = {595-600},
	doi = {10.1109/ICMCS.2012.6320123},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84869860517\&doi=10.1109\%2fICMCS.2012.6320123\&partnerID=40\&md5=4f285c9563e66243e62944313c2621c7},
	author = {Baddi, Y. and Ech-Chrif El Kettani, M.D.}
}
@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 {Anoual2011,
	title = {Vehicle license plate detection in images},
	booktitle = {International Conference on Multimedia Computing and Systems -Proceedings},
	year = {2011},
	note = {cited By 3},
	doi = {10.1109/ICMCS.2011.5945680},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79961227182\&doi=10.1109\%2fICMCS.2011.5945680\&partnerID=40\&md5=0640cc288461c0ff15b817b0c5d2a10b},
	author = {Anoual, H. and Fkihi, S.E. and Jilbab, A. and Aboutajdine, D.}
}
@conference {ElHaroussi2011,
	title = {VHDL design and FPGA implementation of weighted majority logic decoders},
	booktitle = {International Conference on Multimedia Computing and Systems -Proceedings},
	year = {2011},
	note = {cited By 0},
	doi = {10.1109/ICMCS.2011.5945599},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79961233273\&doi=10.1109\%2fICMCS.2011.5945599\&partnerID=40\&md5=07df2e3fcbba980a7e899b84c1e869ff},
	author = {El Haroussi, M. and Ayoub, F. and Belkasmi, M.}
}
@conference {ElHaroussi2010,
	title = {VHDL design and FPGA implementation of a fully parallel BCH SISO decoder},
	booktitle = {2010 5th International Symposium on I/V Communications and Mobile Networks, ISIVC 2010},
	year = {2010},
	note = {cited By 0},
	doi = {10.1109/ISVC.2010.5656415},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-78651477175\&doi=10.1109\%2fISVC.2010.5656415\&partnerID=40\&md5=4ef5d844fa95aea85bc6781b1524b50e},
	author = {El Haroussi, M. and Chana, I. and Belkasmi, M.}
}
@conference {ElAsri20091,
	title = {Vers une architecture MVSOA pour la mise en oeuvre des composants multivue},
	booktitle = {CAL 2009 - 3rd Conference Francophone sur les Architectures Logicielles},
	year = {2009},
	note = {cited By 0},
	pages = {1-16},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84874262952\&partnerID=40\&md5=259ee2685304602210abdadb34836420},
	author = {El Asri, B. and Kenzi, A. and Nassar, M. and Kriouile, A.}
}
@conference { ISI:000261359800058,
	title = {Variability Modeling for Business Component Customization},
	booktitle = {2008 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, VOLS 1-3},
	series = {IEEE Symposium on Computers and Communications ISCC},
	year = {2008},
	note = {13th IEEE Symposium on Computers and Communications, Marrakech, MOROCCO, JUL 06-09, 2008},
	pages = {370+},
	publisher = {IEEE Comp Soc; IEEE; IEEE Commun Soc; hps; Ctr Natl Rech Sci \& Tech},
	organization = {IEEE Comp Soc; IEEE; IEEE Commun Soc; hps; Ctr Natl Rech Sci \& Tech},
	abstract = {Since a component-based information system has different requirements, components customization for various constraints is needed. Thus, the ability of reusable components to be varied and appropriate to different information systems requirements is a key property in reusable component development, especially in Business Component (BC) development. In this paper, a BC customization approach is presented. In order to do this, we focus on the variability concept, which is defined as the ability of a software artefact to be changed or customized to be reused in multiple contexts. Hence, the objective of this work is to specify business components with the consideration of commonality and variability in a business domain, in order to increase their reusability and applicability.},
	isbn = {978-1-4244-2702-4},
	issn = {1530-1346},
	author = {Saidi, Rajaa and Fredj, Mounia and Mouline, Salma and Front, Agnes and Rieu, Dominique}
}
@conference {Saidi2008730,
	title = {Variability modeling for Business Component customization},
	booktitle = {Proceedings - IEEE Symposium on Computers and Communications},
	year = {2008},
	note = {cited By 3},
	pages = {730-735},
	doi = {10.1109/ISCC.2008.4625644},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-55849092557\&doi=10.1109\%2fISCC.2008.4625644\&partnerID=40\&md5=04315f0e284ab3996e6302eee0e4e6fd},
	author = {Saidi, R. and Fredj, M. and Mouline, S. and Front, A. and Rieu, D.}
}
