@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 {Semmouni2022353,
	title = {Bitcoin security with a twisted Edwards curve},
	journal = {Journal of Discrete Mathematical Sciences and Cryptography},
	volume = {25},
	number = {2},
	year = {2022},
	note = {cited By 2},
	pages = {353-371},
	abstract = {The security of the Bitcoin cryptocurrency system depends on the Koblitz curve secp256k1 combined with the digital signature ECDSA and the hash function SHA-256. In this paper, we show that the security of Bitcoin with ECDSA and secp256k1 is not optimal and present a detailed study of the efficiency of Bitcoin with the digital signature algorithm Ed25519 combined with the twisted Edwards curve CurveEd25519 and the hash function SHA-512. We show that Bitcoin is more secure and more efficient with the digital signature algorithm Ed25519 and the twisted Edwards curve CurveEd25519. {\textcopyright} 2022 Taru Publications.},
	doi = {10.1080/09720529.2019.1681673},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85080957680\&doi=10.1080\%2f09720529.2019.1681673\&partnerID=40\&md5=1701fb22e429664ce981464ba5838610},
	author = {Semmouni, M.C. and Nitaj, A. and Belkasmi, M.}
}
@conference {Mouchfiq2021,
	title = {Blockchain-based Model Against selfish Attacks in Mobile ad hoc Networks},
	booktitle = {Proceedings - 4th International Conference on Advanced Communication Technologies and Networking, CommNet 2021},
	year = {2021},
	note = {cited By 0},
	abstract = {Over the past several decades, the importance of security has been increasing, in particular in the area of research addressing the Internet of Things (IoT) and, implicitly, ad hoc networks since they are part of it. Researchers have adopted blockchain as an interesting and trendy research topic in the wireless ad hoc environment. Due to its strong characteristics, such as consensus, immutability, finality and provenance, it{\textquoteright}s used not only as a secure data storage for critical data, but also as a platform that facilitates trustless data exchange between independent parties. However, the main challenge of applying blockchain in an ad hoc network is what kind of nodes should be involved in the validation process and how to adopt the heavy computational complexity of block validation in an appropriate way while maintaining its authentic characteristics. In this paper, we propose a new blockchain-based model against selfish attacks in ad hoc networks and optimize it in this context, to this end, we investigate the presence of MPR nodes to adapt and integrate the blockchain principle in MANETs and based on this we conduct a security analysis to evaluate our model by discussing the ability of our model to meet major security issues related to confidentiality, integrity, availability, non-repudiation, and vulnerability to attacks. {\textcopyright} 2021 IEEE.},
	keywords = {Ad hoc environment, Ad-hoc networks, Block-chain, Blockchain, Digital storage, Electronic data interchange, Internet of things, Mobile ad hoc networks, Mobile ad-hoc networks, Mobile security, MPR, Network security, Research topics, Secure data storage, Security, Selfish attack, Wireless ad hoc},
	doi = {10.1109/CommNet52204.2021.9641959},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85124026049\&doi=10.1109\%2fCommNet52204.2021.9641959\&partnerID=40\&md5=83605288b49be75af72d459c6e278bdd},
	author = {Mouchfiq, N. and Habbani, A. and Benjbara, C. and Berradi, H.}
}
@article {Sabri20214132,
	title = {Blocking control and dynamic exchange buffer switching new approach for mobile wireless sensor networks},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {99},
	number = {16},
	year = {2021},
	note = {cited By 0},
	pages = {4132-4140},
	abstract = {Mobile sensor nodes are usually positioned in low battery power unattended surroundings. Wireless hypermedia sensor-based networks have a huge capacity and a continual flow of data from source to sink. The congestion emerges when the input amount exceeds the number of resources available. The effect of congestion is packet loss, buffer overflow, and waste of power, as well as increasing delays from end to end. The suggested dynamic alternating buffer technique for switching and management of the congestion, using the residual buffer, residual energy and sensor-mobile node confidence level, is applied to effectively control the congestion. The system is based on a cost-effectiveness analysis which calculates main and replacement buffers on time. The dynamic buffer shift is possible by this approach and the congest impact is optimized. The BETCC performance is compared to that of other current protocols such as TCEER and TFCC with respect to energy usage and data loss ratios. {\textcopyright} 2021 Little Lion Scientific.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85114438577\&partnerID=40\&md5=aa4c26dbcb5803178c55233ce647be05},
	author = {Sabri, Y. and Siham, A. and Maizate, A.}
}
@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.}
}
@article {Bouzbita20205436,
	title = {The behaviour of ACS-TSP algorithm when adapting both pheromone parameters using fuzzy logic controller},
	journal = {International Journal of Electrical and Computer Engineering},
	volume = {10},
	number = {5},
	year = {2020},
	note = {cited By 4},
	pages = {5436-5444},
	abstract = {In this paper, an evolved ant colony system (ACS) is proposed by dynamically adapting the responsible parameters for the decay of the pheromone trails ξ and using fuzzy logic controller (FLC) applied in the travelling salesman problems (TSP). The purpose of the proposed method is to understand the effect of both parameters ξ and on the performance of the ACS at the level of solution quality and convergence speed towards the best solutions through studying the behaviour of the ACS algorithm during this adaptation. The adaptive ACS is compared with the standard one. Computational results show that the adaptive ACS with dynamic adaptation of local pheromone parameter ξ is more effective compared to the standard ACS. {\textcopyright} 2020 Institute of Advanced Engineering and Science. All rights reserved.},
	doi = {10.11591/IJECE.V10I5.PP5436-5444},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85087312967\&doi=10.11591\%2fIJECE.V10I5.PP5436-5444\&partnerID=40\&md5=fb268b2912214f5d902a8ec0f867a2cd},
	author = {Bouzbita, S. and El Afia, A. and Faizi, R.}
}
@conference {Abbal2020,
	title = {Bi-level multi-capacitated facility location problem},
	booktitle = {Proceedings - 2020 5th International Conference on Logistics Operations Management, GOL 2020},
	year = {2020},
	note = {cited By 1},
	abstract = {Facility location problems can be considered as a century-old science. Studies on this subject began in the 1950s and are still relevant today. In 2016, a new variant of the location problems, called {\textquoteright}budget constraint multi-capacitated location problem{\textquoteright} (BMCLP), is published to generalize the p-median one. In this work, we propose a generalization of the BMCLP into a bilevel location problem (plants-depots and depots-customers) in order to consider, the modern supply chain constraints. We therefore established a mathematical formulation for the new problem, named {\textquoteright}bi-level multi-capacitated facility location problem{\textquoteright} and we created data instances adapted to this new formulation based on semi-random factors and certain generation methods available in the literature. In order to validate the latter formulation, we proposed Branch Cut solving method used by CPLEX solver. Finally, we present the obtained computational results, which prove the efficiency of the new formulation for the tested instances. {\textcopyright} 2020 IEEE.},
	keywords = {Budget constraint, Budget control, Capacitated facility location problems, Capacitated location, Computational results, Facility location problem, Generation method, Location, Location problems, Mathematical formulation, Supply chains},
	doi = {10.1109/GOL49479.2020.9314710},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100167979\&doi=10.1109\%2fGOL49479.2020.9314710\&partnerID=40\&md5=2a6d370ea7da84d66da95771f24a1900},
	author = {Abbal, K. and Benadada, Y. and Mohammed, E.A.}
}
@article {Nabil2020253,
	title = {Blockchain Security and Privacy in Education: A Systematic Mapping Study},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {1161 AISC},
	year = {2020},
	note = {cited By 4},
	pages = {253-262},
	abstract = {Blockchain is a technology that promotes security, transparency and authenticity. It is defined by as distributed ledger technology and consensus algorithm, it{\textquoteright}s first application were in the financial sector with Bitcoin, Ethereum and other cryptocurrency, but now the concept has spread to other sectors like Healthcare, Governance, Education, etc. In the education sector all stakeholders need a reliable technology that will improves the education system and takes it to the next step. The Blockchain has all the key characteristics to do just that (distributed ledger, no third parties, chronological timestamp, cryptographically sealed, consensus based), and to be used in bigger scale it has to gives assurance such as data privacy and data security. This Systematic Mapping Study (SMS) tries to study existing papers in blockchain security and privacy and its application in Education to provide a classification and to explore the artifacts and the domains. {\textcopyright} 2020, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	keywords = {Blockchain, Consensus algorithms, Cryptocurrency, Data privacy, Education sectors, Education systems, Engineering education, Financial sectors, Information systems, Information use, ITS applications, Key characteristics, Mapping, Security and privacy, Systematic mapping studies},
	doi = {10.1007/978-3-030-45697-9_25},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85085468426\&doi=10.1007\%2f978-3-030-45697-9_25\&partnerID=40\&md5=fbf18f1dea262c844cc9026978332c4f},
	author = {Nabil, A. and Nafil, K. and Mounir, F.}
}
@conference {Mouncif2020,
	title = {Blood collection supply chain management: A critical review and future perspective},
	booktitle = {6th International Conference on Optimization and Applications, ICOA 2020 - Proceedings},
	year = {2020},
	note = {cited By 0},
	abstract = {Blood supply chain is an essential part of modern healthcare system, and an appropriate feeding of blood units and blood products is necessary for several care treatments and surgeries. Any improvement in the management of these chains will guarantee an adequate blood availability to meet the demand and save lives. The applications of operational research and management science techniques enable decision makers to come up with better and more efficient decisions for a wide range of problems in blood transfusion. Various papers on blood collection management, dealing with different problems and constraints, have been proposed in the literature. The purpose of this paper is to integrate the topic in recent research on blood collection management and try to create awareness for a deeper knowledge on blood collection and donation issues. In this paper, we systematically analyze and classify existing studies, addressing various cases, in order to highlight opportunities and to open practical future research directions for operational research and management science about optimization of blood collection. {\textcopyright} 2020 IEEE.},
	keywords = {Blood, Blood collection, Blood transfusion, Decision makers, Decision making, Future perspectives, Future research directions, Health-care system, Operational research, Recent researches, Supply chain management},
	doi = {10.1109/ICOA49421.2020.9094514},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85085745137\&doi=10.1109\%2fICOA49421.2020.9094514\&partnerID=40\&md5=1d84b86d8dc5c94a6ed1a1437e4f86c3},
	author = {Mouncif, C. and Bellabdaoui, A.}
}
@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.}
}
@conference {Ouarhim2020,
	title = {Business Process Modeling Notation Extension for Real Time Handling - Application to Novel Coronavirus (2019-nCoV) management process},
	booktitle = {Proceedings of 2020 5th International Conference on Cloud Computing and Artificial Intelligence: Technologies and Applications, CloudTech 2020},
	year = {2020},
	note = {cited By 0},
	abstract = {The need of real-time enterprises increases according to our life style and customers{\textquoteright} satisfaction goal. Real-time business process is one of the important components of a real-time enterprise. For that, a formal definition of real-time concept and real-time process was indispensable. This work presents a formal definition of real-time concept, real-time ontology and a proposition of a real-time component with real-time attributes. This new dimension of time contains three components: latency time, acceptance interval and theoretical time. This definition gives a new vision of time, not just an ordinary vision as periods and calendar but as a response to our needs in real-time enterprises: real-time. Before the proposition of a real-time component for BPMN language, which we applicate to Novel Coronavirus (2019-nCoV) management process, as case study. {\textcopyright} 2020 IEEE.},
	keywords = {Artificial intelligence, Business process modeling notations, Cloud computing, Customer satisfaction, Customers{\textquoteright} satisfaction, Formal definition, Management process, Real-time business, Real-time handling, Real-time process, Three component},
	doi = {10.1109/CloudTech49835.2020.9365900},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85102630158\&doi=10.1109\%2fCloudTech49835.2020.9365900\&partnerID=40\&md5=efa760e4fe29ae0509729e730f662b56},
	author = {Ouarhim, A. and Lakhrouit, J. and Baina, K.}
}
@conference {Ba{\"\i}na2020215,
	title = {Business Process Modelling Augmented: Model Driven transformation of User Stories to Processes},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2020},
	note = {cited By 0},
	pages = {215-220},
	abstract = {The Purpose of our paper is to present a lightweight efficient approach for analysing user stories backlog in order to generate a business process model. A review of literature has been conducted to study contributions in the domain of automatic business process extraction from textual requirements. We found that most of interesting approaches analysing user stories use natural language processing techniques for software projects requirements understanding and none of them target business process modeling automation. The Originality of our contribution is the proposition of a model driven based parsing of user stories backlog and transformations to generate a process model. This work thus contributes with a novel agile iterative methodology augmenting business process design phase with automation assistant transforming user stories textual requirements into a business process model. {\textcopyright} 2020 ACM.},
	keywords = {Business Process, Business process design, Business process model, Business process modelling, Intelligent systems, Iterative methodology, Iterative methods, Modeling languages, NAtural language processing, Natural language processing systems, Process design, Process Modeling, Software project},
	doi = {10.1145/3419604.3419793},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85096411195\&doi=10.1145\%2f3419604.3419793\&partnerID=40\&md5=9c2213523602ada2a3463369b32c3d10},
	author = {Baina, K. and El Hamlaoui, M. and Kabbaj, H.}
}
@conference {ElOuahabi2019,
	title = {Bandwidth Enhancement of Complementary Split Ring Based Antenna},
	booktitle = {International Symposium on Advanced Electrical and Communication Technologies, ISAECT 2018 - Proceedings},
	year = {2019},
	note = {cited By 0},
	doi = {10.1109/ISAECT.2018.8618820},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85062440605\&doi=10.1109\%2fISAECT.2018.8618820\&partnerID=40\&md5=40529d3f58aa8740187c10d6c4f1f5f5},
	author = {El Ouahabi, K. and Roky, K. and El Mrabet, O. and Aznabet, M. and Ennasar, M.A.}
}
@conference {Mensou2018,
	title = {Backstepping Controller for a Variable Wind Speed Energy Conversion System Based on a DFIG},
	booktitle = {Proceedings of 2017 International Renewable and Sustainable Energy Conference, IRSEC 2017},
	year = {2018},
	doi = {10.1109/IRSEC.2017.8477586},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85055885499\&doi=10.1109\%2fIRSEC.2017.8477586\&partnerID=40\&md5=1ba7577e6028ae99ec2321c8b7a6a94e},
	author = {Mensou, S. and Essadki, A. and Minka, I. and Nasser, T. and Idrissi, B.B.}
}
@conference {Labghough20181,
	title = {Bit error probability analysis for majority logic decoding of CSOC codes over fading channels},
	booktitle = {Proceedings - 2018 International Conference on Advanced Communication Technologies and Networking, CommNet 2018},
	year = {2018},
	pages = {1-6},
	doi = {10.1109/COMMNET.2018.8360256},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85048329058\&doi=10.1109\%2fCOMMNET.2018.8360256\&partnerID=40\&md5=cd402424adfc89cc9d288cf2d4c17684},
	author = {Labghough, S. and Ayoub, F. and Belkasmi, M.}
}
@book {O{\textquoteright}Hara2018116,
	title = {Building an Urban food system through UDC food hubs},
	series = {Changing Urban Landscapes Through Public Higher Education},
	year = {2018},
	pages = {116-143},
	doi = {10.4018/978-1-5225-3454-9.ch006},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85046487411\&doi=10.4018\%2f978-1-5225-3454-9.ch006\&partnerID=40\&md5=b72e96b6d9f72215cfbb0f00948b4e48},
	author = {O{\textquoteright}Hara, S. and Jones, D. and Trobman, H.B.}
}
@conference {Elmaroud2017,
	title = {BER analysis of FBMC based multi-cellular networks in the presence of synchronization errors and HPA NLD},
	booktitle = {IEEE Vehicular Technology Conference},
	year = {2017},
	note = {cited By 1},
	abstract = {In this paper, we study the performance of asynchronous and non linear FBMC based multi-cellular networks. The considered system consists of a reference mobile user perfectly synchronized with its reference base station (BS) and K interfering BSS. We have considered both synchronization errors and high power amplifiers (HPA) non linear distortions (NLD). We analyzed first the signal to noise plus interference ratio (SINR). On the basis of this analysis, derived an accurate of bit error rate (BER) in the presence of a frequency selective channel. In order to reduce the computational complexity of the BER expression, we applied an interesting lemma based on the moment generating function of the interference power. Finally, the proposed model is evaluated through computer simulations which show a high sensitivity of the asynchronous FBMC based multi-cellular network to HPA non linear distortions. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/VTCFall.2016.7880922},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85016936548\&doi=10.1109\%2fVTCFall.2016.7880922\&partnerID=40\&md5=170d934dcec5039d0265f9b0310630c6},
	author = {Elmaroud, B. and Faqihi, M.A. and Abbad, M. and Aboutajdine, D.}
}
@conference {Fath-ALLAH2017326,
	title = {A Best Practice Based E-Government Portals{\textquoteright} Maturity Model-A Case Study},
	booktitle = {IEEE CIT 2017 - 17th IEEE International Conference on Computer and Information Technology},
	year = {2017},
	note = {cited By 0},
	pages = {326-331},
	abstract = {An e-government portal{\textquoteright}s maturity model is a set of incremental stages that defines the maturity of e-government portals. In fact, these models can be used by e-government agencies to identify the maturity rank of their portal and at the same time provide recommendations and guidelines for agencies to improve their portals{\textquoteright} maturity. In previous research studies, we have built an e-government portals{\textquoteright} best practice model and a maturity model that is based on the former model. Moreover, we have evaluated the model by a set of experts in the e-government field. The model has proved its validity and reliability within the set of the participants. The aim of this paper is to perform a case study on this maturity model on a real portal. Our findings show that the portal being measured is in the presence stage of maturity. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/CIT.2017.23},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85032359695\&doi=10.1109\%2fCIT.2017.23\&partnerID=40\&md5=765abc46de7761960104adbb2b22b013},
	author = {Fath-Allah, A. and Cheikhi, L. and Idri, A. and Al-Qutaish, R.}
}
@article {Elmouhtadi201711007,
	title = {Biometric protection approach based on fingerprint hierarchical identification},
	journal = {International Journal of Applied Engineering Research},
	volume = {12},
	number = {21},
	year = {2017},
	note = {cited By 0},
	pages = {11007-11014},
	abstract = {With the exponential increase in the dependence on biometric based fingerprint in everyday life, there is a growing concern related to privacy and security issues; therefore, security threats need tobe analyzed in detail. Different fingerprint systems store personal information without any security. Hence, an attacker can easily have access to the identity of legitimate user. In order to secure these applications against different threats, several protection approaches have been proposed as alternative solution. In this paper, we propose a new approach for fingerprint template protection based on the fingerprint features transformation. In this context, we proposed a new indexation approach named {\textquoteleft}Hierarchical Identification and Protection Approach Based on Delaunay Triangulation{\textquoteright}, based on the topological transformation of minutia points. First, we applied the Delaunay triangulation as a matching method. Then we introduced the barycenter notion, which applied on the similar extracted triangle. This hierarchical meaner of triangulation improve the performance and the security of fingerprint systems. Driven experimental results show the ability of the proposed approach to preserve the performance and the security of biometric authentication systems. {\textcopyright} Research India Publications.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85040238621\&partnerID=40\&md5=48519c41204d7bd4c93962b3c08d510a},
	author = {Elmouhtadi, M. and Lafkik, M. and Elfkihi, S.}
}
@article {Aznabet2017137,
	title = {A broadband modified T-shaped planar dipole antenna for UHF RFID tag applications},
	journal = {Progress In Electromagnetics Research C},
	volume = {73},
	year = {2017},
	note = {cited By 0},
	pages = {137-144},
	abstract = {In this paper, we report a single layer modified T-shaped dipole antenna for UHF-RFID tag applications. The designed RFID tag antenna consists of a pair of T-shaped dipole strips loaded with four half discs patches and a tag chip placed in the center. The antenna{\textquoteright}s size is 80 {\texttimes} 40 {\texttimes} 1.6 mm3. Performance of the proposed design was investigated with simulations and measurements. The main feature of this design is that the RFID tag antenna can operate effectively at 868 MHz and 915 MHz frequency bands which make it broadband. The maximum reading range measured in an anechoic chamber is 4.25 m and 5.27 m at 915 MHz and 867.5 MHz, respectively. Furthermore, the RFID tag antenna can work on metallic plates when inserting a foam spacer between them. The final result has a simple configuration, low profile and can be suitable for practical applications dealing with free-space and metallic objects. {\textcopyright} 2017, Electromagnetics Academy. All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85018499025\&partnerID=40\&md5=fc169608c0f9d2ca9edc6935cc6a53e4},
	author = {Aznabet, I. and Ennasar, M.A. and El Mrabet, O. and Andia Vera, G. and Khalladi, M. and Tedjni, S.}
}
@article {Routaib201691,
	title = {A bargaining nash game based adaptive negotiation of context level agreements for pervasive systems},
	journal = {Lecture Notes in Electrical Engineering},
	volume = {366},
	year = {2016},
	note = {cited By 0},
	pages = {91-104},
	abstract = {With the growing popularity of Internet-enabled devices, the impressive progress in sensing technology, and the adoption of cloud computing for provisioning services, users increasingly demand services that can adapt to their recent context. In this paper, we propose a multi-attributes and adaptive approach for Context Level Agreements (CLAs) negotiation between a context provider and a context consumer using a context broker. The approach employs a Nash bargainingmodel and evaluates the global utility of each party as a linear function of normalized Quality of Context (QoC) attributes during the rounds of negotiation. The ultimate goal is to improve context-based adaptation of context-aware applications and services. One of the advantages of this approach is that it permits to resolve conflicts of interests between the context provider and the context consumer when the global utility of each party reaches a Pareto optimum. {\textcopyright} Springer Science+Business Media Singapore 2016.},
	doi = {10.1007/978-981-287-990-5_8},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959119600\&doi=10.1007\%2f978-981-287-990-5_8\&partnerID=40\&md5=ed4610375cc000b9197b7923d9434dd5},
	author = {Routaib, H.a and Badidi, E.b and Sabir, E.c and Elkoutbi, M.a}
}
@conference { ISI:000381755100008,
	title = {A Bargaining Nash Game Based Adaptive Negotiation of Context Level Agreements for Pervasive Systems},
	booktitle = {ADVANCES IN UBIQUITOUS NETWORKING},
	series = {Lecture Notes in Electrical Engineering},
	volume = {366},
	year = {2016},
	note = {International Symposium on Ubiquitous Networking (UNet), Casablanca, MOROCCO, SEP 08-10, 2015},
	pages = {91-104},
	abstract = {With the growing popularity of Internet-enabled devices, the impressive progress in sensing technology, and the adoption of cloud computing for provisioning services, users increasingly demand services that can adapt to their recent context. In this paper, we propose, a multi-attributes and adaptive approach for Context Level Agreements (CLAs) negotiation between a context provider and a context consumer using a context broker. The approach employs a Nash bargaining model and evaluates the global utility of each party as a linear function of normalized Quality of Context (QoC) attributes during the rounds of negotiation. The ultimate goal is to improve context-based adaptation of context-aware applications and services. One of the advantages of this approach is that it permits to resolve conflicts of interests between the context provider and the context consumer when the global utility of each party reaches a Pareto optimum.},
	isbn = {978-981-287-990-5; 978-981-287-989-9},
	issn = {1876-1100},
	doi = {10.1007/978-981-287-990-5\_8},
	author = {Routaib, Hayat and Badidi, Elarbi and Sabir, Essaid and Elkoutbi, Mohammed},
	editor = {Sabir, E and Medromi, H and Sadik, M}
}
@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 { ISI:000382672700052,
	title = {Botched Releases: Do we Need to Roll Back? Empirical Study on a Commercial Web App},
	booktitle = {2016 IEEE 23RD INTERNATIONAL CONFERENCE ON SOFTWARE ANALYSIS, EVOLUTION, AND REENGINEERING (SANER), VOL 1},
	year = {2016},
	note = {23rd IEEE International Conference on Software Analysis, Evolution, and Reengineering (SANER), Osaka, JAPAN, MAR 14-18, 2016},
	pages = {574-583},
	publisher = {IEEE; IEEE Comp Soc; IPA; Reengineering Forum; Informat Proc Soc Japan, Special Interest Grp Software Engn; Japan Soc Software Sci \& Technol, Special Interest Grp Fdn Software Engn; Osaka Univ, Grad Sch Informat Sci \& Technol; Mitsubishi Elect; Microsoft;},
	organization = {IEEE; IEEE Comp Soc; IPA; Reengineering Forum; Informat Proc Soc Japan, Special Interest Grp Software Engn; Japan Soc Software Sci \& Technol, Special Interest Grp Fdn Software Engn; Osaka Univ, Grad Sch Informat Sci \& Technol; Mitsubishi Elect; Microsoft;},
	abstract = {Few minutes after a web-based software release, the release team might encounter log traces showing the new system crashing, hanging, or having poor performance. This is the start of the most nerve-wrecking moments of a product{\textquoteright}s release cycle, i.e., should one run the risk of not doing anything and users losing precious data, or of prematurely engaging the tedious (and costly) roll-back procedure towards the previous release? Thus far, only little attention has been paid by researchers to these so-called {\textquoteleft}{\textquoteleft}botched releases{{\textquoteright}{\textquoteright}}, partly because of lack of release log data. This paper studies 345 releases of a large e-commerce web app over a period of 1.5 years, in which we identified 17 recurrent root causes of botched releases, classified into four major categories. We then build explanatory models to understand which root causes are the most important, and to explore the factors leading to botched releases.},
	isbn = {978-1-5090-1855-0},
	doi = {10.1109/SANER.2016.114},
	author = {Kerzazi, Noureddine and Adams, Bram}
}
@conference {ElIdrissi2016,
	title = {Bringing flexibility to ontology learning from relational databases},
	booktitle = {Proceedings of IEEE/ACS International Conference on Computer Systems and Applications, AICCSA},
	volume = {2016-July},
	year = {2016},
	note = {cited By 0},
	abstract = {Current approaches for learning ontology from relational databases are focused on the implementation of the transformation rules without paying attention to user requirements in terms of the way in which the ontology should be designed. They propose ready-made functions that transform the database model to an ontology TBox. There is no way to customize the learning process. The paper proposed a solution based on the transformation of the database model into an XML document, to allow its extension with some meta-data that guide the learning program on how to perform the transformation to ontology. Some case studies demonstrate the effectiveness and efficiency of the proposed approach in terms of reducing the risk that the produced ontology does not fit the requirements of the user. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/AICCSA.2015.7507213},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84980327629\&doi=10.1109\%2fAICCSA.2015.7507213\&partnerID=40\&md5=e1fa4f3fc7cc38f9c811349f60c0660c},
	author = {El Idrissi, B. and Baina, S. and Baina, K.}
}
@conference {Nouinou2015152,
	title = {Big data: Measuring how information technology can improve the economic growth and better life},
	booktitle = {Proceedings of the 2015 5th World Congress on Information and Communication Technologies, WICT 2015},
	year = {2015},
	note = {cited By 0},
	pages = {152-159},
	abstract = {Today data are equivalent of oil or gold, but Succeeding with big data requires more than just data. Data-based value creation requires the identification of a framework from which predictions can be deducted and decisions can be made. Lot of index has been developed to measure the state of development of countries whether economic growth, ICT penetration or Human development. The purpose of the measuring was to assess policy implications and economic growth around the globe as well as share best practices. In this paper we are going to compare the most wildly tools of measurement of economic competiveness, Network readiness, Human development and world press freedom. Those four domains are judged to be the pillars of well-being and good live of a Human. In the second part of this paper, we examine the hypothesis that ICT penetration has positive effects on economic growth, well-being and a better life of a Human. We use the system Generalized Method of Moment for dynamic panel data analysis to extract the causal link between ICT penetration and growth. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/WICT.2015.7489663},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84979738903\&doi=10.1109\%2fWICT.2015.7489663\&partnerID=40\&md5=e0578db8132db6f390ffd1046c772f60},
	author = {Nouinou, S. and Razafimampianina, R.M. and Regragui, B. and Doukkali, A.S.}
}
@conference { ISI:000383221800027,
	title = {Big Data: Measuring How Information Technology Can Improve the Economic Growth and Better Life},
	booktitle = {PROCEEDINGS OF THE 2015 5TH WORLD CONGRESS ON INFORMATION AND COMMUNICATION TECHNOLOGIES (WICT)},
	year = {2015},
	note = {5th World Congress on Information and Communication Technologies (WICT), Marrakesh, MOROCCO, DEC 14-16, 2015},
	pages = {152-159},
	publisher = {IEEE; IEEE Morocco Sect; IEEE Morocco Sect; IEEE SMC Tech Comm Soft Comp; Lab Informatique, Reseaux Mobilite Modelisation; lab Res Grp Intelligent Machines; MIR Labs},
	organization = {IEEE; IEEE Morocco Sect; IEEE Morocco Sect; IEEE SMC Tech Comm Soft Comp; Lab Informatique, Reseaux Mobilite Modelisation; lab Res Grp Intelligent Machines; MIR Labs},
	abstract = {Today data are equivalent of oil or gold, but Succeeding with big data requires more than just data. Data-based value creation requires the identification of a framework from which predictions can be deducted and decisions can be made. Lot of index has been developed to measure the state of development of countries whether economic growth, ICT penetration or Human development. The purpose of the measuring was to assess policy implications and economic growth around the globe as well as share best practices. In this paper we are going to compare the most wildly tools of measurement of economic competiveness, Network readiness, Human development and world press freedom. Those four domains are judged to be the pillars of well-being and good live of a Human. In the second part of this paper, we examine the hypothesis that ICT penetration has positive effects on economic growth, well-being and a better life of a Human. We use the system Generalized Method of Moment for dynamic panel data analysis to extract the causal link between ICT penetration and growth.},
	isbn = {978-1-4673-8712-5},
	author = {Nouinou, Soumaya and Razafimampianina, Rindra M. and Regragui, Boubker and Doukkali, Abdelaziz S.},
	editor = {Abrahim, A and Alimi, AM and Haqiq, A and Karray, H and Mousannif, H and BenHalima, M and Choo, YH and Ma, K}
}
@conference { ISI:000373736100043,
	title = {Building rich user profile based on intentional perspective},
	booktitle = {INTERNATIONAL CONFERENCE ON ADVANCED WIRELESS INFORMATION AND COMMUNICATION TECHNOLOGIES (AWICT 2015)},
	series = {Procedia Computer Science},
	volume = {73},
	year = {2015},
	note = {International Conference on Advanced Wireless Information and Communication Technologies (AWICT), Natl Sch Engineers Sousse, TUNISIA, OCT 05-07, 2015},
	pages = {342-349},
	abstract = {Internet technologies evolution, from Web 1.0 to web 2.0 and web 3.0, has led us towards the definition of new requirements to be considered in the design and development of new application. It is important to note that depending solely on the request to satisfy user need is not effective. Indeed, the emergence of many researches related to the study of user behaviour has enhanced the retrieval information effectiveness. Typically, the context and the user profile are the main elements to characterize the user. Hence, we aim through this contribution to build a rich profile and to provide him suitable services. (C) 2015 The Authors. Published by Elsevier B.V.},
	issn = {1877-0509},
	doi = {10.1016/j.procs.2015.12.002},
	author = {Alaoui, Sara and El Idrissi, Younes El Bouzekri and Ajhoun, Rachida},
	editor = {Boubiche, DE and Hidoussi, F and Cruz, HT}
}
@conference {Alaoui2015342,
	title = {Building Rich User Profile Based on Intentional Perspective},
	booktitle = {Procedia Computer Science},
	volume = {73},
	year = {2015},
	note = {cited By 0},
	pages = {342-349},
	abstract = {Internet technologies evolution, from Web 1.0 to web 2.0 and web 3.0, has led us towards the definition of new requirements to be considered in the design and development of new application. It is important to note that depending solely on the request to satisfy user need is not effective. Indeed, the emergence of many researches related to the study of user behaviour has enhanced the retrieval information effectiveness. Typically, the context and the user profile are the main elements to characterize the user. Hence, we aim through this contribution to build a rich profile and to provide him suitable services. {\textcopyright} 2015 The Authors.},
	doi = {10.1016/j.procs.2015.12.002},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962720975\&doi=10.1016\%2fj.procs.2015.12.002\&partnerID=40\&md5=503ca037df66420fe4a0f31a57e41f7e},
	author = {Alaoui, S.a and Idrissi, Y.E.B.E.b and Ajhoun, R.a}
}
@article { ISI:000337796300003,
	title = {Buffer dimensioning and control stations positioning with a space partitioning-tabu search approach},
	journal = {INFOR},
	volume = {51},
	number = {1, SI},
	year = {2013},
	month = {FEB},
	pages = {15-22},
	abstract = {We propose an efficient heuristic method based on Space Partitioning (SP) and Tabu Search (TS) to solve the buffer sizing problem in unreliable production lines with several inspection stations. In such problem, we have an unreliable production line consisting of a certain number of machines and fixed-size buffers. These machines produce a single part with two different quality levels: conforming and non-conforming parts. The production line may contain inspection stations whose job is to reject the non-conforming parts from the line. The production line must meet a constant rate of demand for the conforming finished parts. The objective is to minimize the average long term combined storage and shortage costs, while also specifying the optimal location of inspection stations. This design problem is a difficult mixed integer nonlinear program. Solving even a small instance of 10 machines and one inspection station using a direct dynamic programming method takes hours. If we especially increase the number of machines or the inspection stations, the dynamic programming approach becomes drastically inefficient. The method we propose divides the search space into a set of disjoint subspaces using a space partitioning technique. Tabu search is used to intensify the search in the selected subspaces. This combined method finds optimal solutions for small instances in a fraction of dynamic programming time. For the largest instances (up to 20 machines) the dynamic programming approach was unable to solve, our method finds high-quality solutions in reasonable times.},
	issn = {0315-5986},
	doi = {10.3138/infor.51.1.15},
	author = {Ouzineb, Mohamed and Mhada, Fatima and El Hallaoui, Issmail}
}
@article {9434372220130201,
	title = {Buffer dimensioning and control stations positioning with a space partitioning-tabu search approach.},
	journal = {INFOR},
	volume = {51},
	number = {1},
	year = {2013},
	pages = {15 - 22},
	abstract = {We propose an efficient heuristic method based on Space Partitioning (SP) and Tabu Search (TS) to solve the buffer sizing problem in unreliable production lines with several inspection stations. In such problem, we have an unreliable production line consisting of a certain number of machines and fixed-size buffers. These machines produce a single part with two different quality levels: conforming and non-conforming parts. The production line may contain inspection stations whose job is to reject the non-conforming parts from the line. The production line must meet a constant rate of demand for the conforming finished parts. The objective is to minimize the average long term combined storage and shortage costs, while also specifying the optimal location of inspection stations. This design problem is a difficult mixed integer nonlinear program. Solving even a small instance of 10 machines and one inspection station using a direct dynamic programming method takes hours. If we especially},
	keywords = {Buffer storage (Computer science), Combinatorial Optimization, Dynamic programming, Heuristic algorithms, Inspection, Machine theory, Meta-heuristics, Production lines, Quality, Tabu search algorithm, Topology},
	issn = {03155986},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=bth\&AN=94343722\&site=ehost-live},
	author = {Ouzineb, Mohamed and Mhada, Fatima and El Hallaoui, Issmail}
}
@article {Choukri2012208,
	title = {Behavior of ad hoc routing protocols in multi service traffic},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {43},
	number = {2},
	year = {2012},
	note = {cited By 1},
	pages = {208-213},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84867186214\&partnerID=40\&md5=af5b22cc20366d5220d91fac8886944e},
	author = {Choukri, A. and Habbani, A. and Elkoutbi, M.}
}
@article {ElBakkali2012178,
	title = {Bypassing Workflow Satisfiability Problem Due to Access Control Constraints},
	journal = {Communications in Computer and Information Science},
	volume = {294 PART 2},
	year = {2012},
	note = {cited By 0},
	pages = {178-191},
	doi = {10.1007/978-3-642-30567-2_15},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84880504898\&doi=10.1007\%2f978-3-642-30567-2_15\&partnerID=40\&md5=a76ee818c8197bc83bdfb080f176701b},
	author = {El Bakkali, H.}
}
@conference {Doumi2011493,
	title = {Business IT alignment: A survey},
	booktitle = {ICEIS 2011 - Proceedings of the 13th International Conference on Enterprise Information Systems},
	volume = {4 SAIC},
	number = {HCI/-},
	year = {2011},
	note = {cited By 2},
	pages = {493-499},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84865118286\&partnerID=40\&md5=9330c9b2c9e569fed47526169bd318a3},
	author = {Doumi, K. and Baina, S. and Baina, K.}
}
@conference { ISI:000239482400015,
	title = {A bottom-up workflow mining approach for workflow applications analysis},
	booktitle = {DATA ENGINEERING ISSUES IN E-COMMERCE AND SERVICES, PROCEEDINGS},
	series = {LECTURE NOTES IN COMPUTER SCIENCE},
	volume = {4055},
	year = {2006},
	note = {2nd International Workshop on Data Engineering Issues in E-Commerce and Services, San Francisco, CA, JUN 26, 2006},
	pages = {182-197},
	abstract = {Engineering workflow applications are becoming more and more complex, involving numerous interacting business objects within considerable processes. Analysing the interaction structure of those complex applications will enable them to be well understood, controlled, and redesigned. Our contribution to workflow mining is a statistical technique to discover workflow patterns from event-based log. Our approach is characterised by a {\textquoteleft}{\textquoteleft}local{{\textquoteright}{\textquoteright}} workflow patterns discovery that allows to cover partial results through a dynamic programming algorithm. Those local discovered workflow patterns are then composed iteratively until discovering the global workflow model. Our approach has been implemented within our prototype WorkflowMiner.},
	isbn = {3-540-35440-9},
	issn = {0302-9743},
	author = {Gaaloul, Walid and Baina, Karim and Godart, Claude},
	editor = {Lee, J and Shim, J and Lee, S and Bussler, C and Shim, S}
}
