@conference {Toub2022313,
	title = {Accelerated operating room scheduling using Lagrangian relaxation method and VNS meta-heuristic},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2022},
	note = {cited By 0},
	pages = {313-317},
	abstract = {Like any business that produces services, the hospital is part of a process of improving the quality of services provided to patients. As part of this, hospitals are faced with the daunting task of planning operating room patients with budget, time and personnel. Most of the scheduling problems are NP-hard, so researchers have favored the development of heuristics and meta-heuristics to the detriment of exact methods. In a context where high performance computers are in continuous improvement, it is once again interesting to explore exact methods. Here we focus on developing exact methods for solving the operating room planning and scheduling problem. Our contribution is to develop first an accelerated Integer Linear Program (ILP) using the Variable Neighborhood Search (VNS) meta-heuristic to optimize patient waiting time according to the priority of their surgeries. Afterwards, we expose a new lower bound obtained by optimizing the patient waiting time relaxed. The experimental results validated the performance of the accelerated ILP in comparison with the original ILP. Furthermore, we have shown that the Lagrangian relaxation of the original ILP produces a lower bound of good quality. {\textcopyright} 2022 ACM.},
	keywords = {Budget control, Healthcare, Heuristic algorithms, Heuristic methods, Integer linear programs, Integer programming, Lagrange multipliers, Lagrangian relaxations, Low bound, Meta-heuristic., Metaheuristic, Operating rooms, Operation research, Optimisations, Scheduling, Surgery, Variable neighborhood search},
	doi = {10.1145/3529836.3529928},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85133432791\&doi=10.1145\%2f3529836.3529928\&partnerID=40\&md5=b98b5eb1fa5eebe63a438dcf238538d7},
	author = {Toub, M. and Achchab, S. and Souissi, O.}
}
@article {Daoudi2022505,
	title = {Adaptive Enterprise Architecture: Complexity Metrics in a Mixed Evaluation Method},
	journal = {Lecture Notes in Business Information Processing},
	volume = {455 LNBIP},
	year = {2022},
	note = {cited By 0},
	pages = {505-523},
	abstract = {Classically, enterprises future is intertwined with the needs and demands of society. Nowadays, in addition to those two elements, challenges are becoming more and more numerous and unavoidable. Saying a few, global warming, social responsibilities, Covid 19, digital transformation{\textellipsis} We are living in a new era that is highly volatile and unpredictable. We don{\textquoteright}t have anymore the privilege to choose threats and opportunities that we want to adapt to. In fact adaptation becomes a necessity to survive in this highly competitive and dynamic environment. Factors coming from those challenges externally on top of internal ones can impact various parts of the enterprise in the form of changes. Thus, Adaptive Enterprise Architecture (EA) is leveraged to assist the continuous adaptation to the evolving transformation. On the other hand, one of the criteria of Adaptive EA is the ability to monitor and control the complexity of changes. In this paper, we suggest a mixed approach of EA complexity measurement based on quantitative and qualitative analysis. First, we begin with a recap of the criteria shaping our Adaptive Enterprise Architecture approach and we give an overview of the model that we worked on in previous work. Then we investigate related work about complexity and subjective measurement. Finally, we describe our mixed approach of assessment of complexity and we focus on the calculation of some objective and subjective metrics. {\textcopyright} 2022, Springer Nature Switzerland AG.},
	keywords = {Adaptation, Adaptive enterprise, Complexity, Complexity measurement, Complexity metrics, Dynamic environments, enterprise architecture, Evaluation methods, Global warming, Memory architecture, Mixed approach, Social responsibilities},
	doi = {10.1007/978-3-031-08965-7_26},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135013677\&doi=10.1007\%2f978-3-031-08965-7_26\&partnerID=40\&md5=0f86e1df30e1a710a67e90c0238de8f1},
	author = {Daoudi, W. and Doumi, K. and Kjiri, L.}
}
@article {Chaouni2022251,
	title = {Alignment of Software System Level with Business Process Level: Resolving Syntactic and Semantic Conflicts},
	journal = {International Journal of Advanced Computer Science and Applications},
	volume = {13},
	number = {7},
	year = {2022},
	note = {cited By 0},
	pages = {251-262},
	abstract = {Information systems help organizations manage their entities with innovative technologies. These entities are often very different in nature. In this paper, we consider a business process level based on a set of Business Process Model and Notation (BPMN) models and a software system level based on a Unified Modeling Language (UML) class diagram. The differences between these entities make them difficult to align. In addition, an organization{\textquoteright}s BPMN models may be designed by different teams, which can cause syntactic and semantic heterogeneities. We present the first step of our proposed approach for aligning a software system level with a business process level without conflict (redundancy and lost information). Syntactic and semantic rules based on ontologies and other resources for comparing BPMN models are described, as well as a process for transforming BPMN models into UML model. {\textcopyright} 2022. International Journal of Advanced Computer Science and Applications.All Rights Reserved},
	keywords = {Business Process, Business process model and notation, Business process modeling, Class diagrams, Computer software, Information management, Information system alignment, Information systems, Information use, Ontology, Ontology{\textquoteright}s, Semantic aspect, Semantics, Software-systems, Syntactics, Systems alignments, Unified Modeling Language},
	doi = {10.14569/IJACSA.2022.0130733},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135807702\&doi=10.14569\%2fIJACSA.2022.0130733\&partnerID=40\&md5=c926fa84b9a85ef4d8f825d949952fb0},
	author = {Chaouni, S.B. and Habba, M. and Fredj, M.}
}
@conference {Hmami2022,
	title = {Applying change tree method in configurable process mining},
	booktitle = {2022 2nd International Conference on Innovative Research in Applied Science, Engineering and Technology, IRASET 2022},
	year = {2022},
	note = {cited By 0},
	abstract = {Changes are unexpected events that can be visualized on the logs of each business process. By analysing these logs, particularly change logs ones, we can provide valuable information about changes that occurred during the process{\textquoteright}s execution phases. In this paper we propose to apply a new version of the change tree method to analyse change logs of a configurable process model obtained through configurable process mining approaches, especially change mining ones. The configurable process model is a model that describes a family of business processes. By representing changes related to configurable models, managers can easily detect and retrieve information about changes and obtain answers to questions such as when the change occurs and how long it takes, and which elements are affected by those changes. This information will not be restricted to a single business process but to a collection of process variants. {\textcopyright} 2022 IEEE.},
	keywords = {Business Process, Change logs, Change mining, Change tree method, Component, Configurable process mining, Configurable process models, Data mining, Forestry, Process mining, Tree method, Unexpected events},
	doi = {10.1109/IRASET52964.2022.9738005},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85127982693\&doi=10.1109\%2fIRASET52964.2022.9738005\&partnerID=40\&md5=2c6cd5ffd83ee6a993a4045f7235ecdc},
	author = {Hmami, A. and Sba{\"\i}, H. and Fredj, M.}
}
@article {Boumehdi2022585,
	title = {Arabic Speech Recognition Independent of Vocabulary for Isolated Words},
	journal = {Lecture Notes in Networks and Systems},
	volume = {216},
	year = {2022},
	note = {cited By 3},
	pages = {585-595},
	abstract = {This paper presents a vocabulary-independent speech recognition model of isolated Arabic words. This approach uses a restricted dictionary of syllables and phonemes, and it is based on the hidden Markov model (HMM). The main objective of this contribution is to remedy the problem of insufficient vocabularies in automatic speech recognition systems. This new model has made it possible to recognize any given word even if it has never been pronounced. The model gives a very considerable recognition rate comparable to the limited vocabulary speech recognition system of isolated words. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.},
	doi = {10.1007/978-981-16-1781-2_52},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85115620047\&doi=10.1007\%2f978-981-16-1781-2_52\&partnerID=40\&md5=cf0f1f63d198575b4713769dc56f1701},
	author = {Boumehdi, A. and Yousfi, A.}
}
@article {Asaad2022,
	title = {AsthmaKGxE: An asthma{\textendash}environment interaction knowledge graph leveraging public databases and scientific literature},
	journal = {Computers in Biology and Medicine},
	volume = {148},
	year = {2022},
	note = {cited By 1},
	abstract = {Motivation: Asthma is a complex heterogeneous disease resulting from intricate interactions between genetic and non-genetic factors related to environmental and psychosocial aspects. Discovery of such interactions can provide insights into the pathophysiology and etiology of asthma. In this paper, we propose an asthma knowledge graph (KG) built using a hybrid methodology for graph-based modeling of asthma complexity with a focus on environmental interactions. Using a heterogeneous set of public sources, we construct a genetic and pharmacogenetic asthma knowledge graph. The construction of this KG allowed us to shed more light on the lack of curated resources focused on environmental influences related to asthma. To remedy the lack of environmental data in our KG, we exploit the biomedical literature using state-of-the-art natural language processing and construct the first Asthma{\textendash}Environment interaction catalog incorporating a continuously updated ensemble of environmental, psychological, nutritional and socio-economic influences. The catalog{\textquoteright}s most substantiated results are then integrated into the KG. Results: The resulting environmentally rich knowledge graph {\textquotedblright}AsthmaKGxE{\textquotedblright} aims to provide a resource for several potential applications of artificial intelligence and allows for a multi-perspective study of asthma. Our insight extraction results indicate that stress is the most frequent asthma association in the corpus, followed by allergens and obesity. We contend that studying asthma{\textendash}environment interactions in more depth holds the key to curbing the complexity and heterogeneity of asthma. Availability: A user interface to browse and download the extracted catalog as well as the KG are available at http://asthmakgxe.moreair.info/. The code and supplementary data are available on github (https://github.com/ChaiAsaad/MoreAIRAsthmaKGxE). {\textcopyright} 2022 Elsevier Ltd},
	keywords = {allergen, Article, Artificial intelligence, Association reactions, asthma, Automated, automated pattern recognition, data base, data extraction, Databases, Diseases, environmental factor, Factual, factual database, Gene-Environment Interaction, Genetic factors, genotype environment interaction, Graphic methods, Heterogeneous disease, human, Humans, Knowledge graph, Knowledge graphs, Knowledge management, Language processing, Learning algorithms, Machine learning, Machine-learning, NAtural language processing, Natural language processing systems, Natural languages, nutritional assessment, obesity, pathophysiology, Pattern recognition, pharmacogenetics, physiological stress, psychological aspect, Public database, Scientific literature, socioeconomics, User interfaces},
	doi = {10.1016/j.compbiomed.2022.105933},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135702024\&doi=10.1016\%2fj.compbiomed.2022.105933\&partnerID=40\&md5=2022f55e1de0bbaa947ba6699af6a143},
	author = {Asaad, C. and Ghogho, M.}
}
@article {Slimani20224243,
	title = {Automated machine learning: the new data science challenge},
	journal = {International Journal of Electrical and Computer Engineering},
	volume = {12},
	number = {4},
	year = {2022},
	note = {cited By 0},
	pages = {4243-4252},
	abstract = {The world is changing quite rapidly while increasingly tuning into digitalization. However, it is important to note that data science is what most technology is evolving around and data is definitely the future of everything. For industries, adopting a {\textquotedblleft}data science approach{\textquotedblright} is no longer an option, it becomes an obligation in order to enhance their business rather than survive. This paper offers a roadmap for anyone interested in this research field or getting started with {\textquotedblleft}machine learning{\textquotedblright} learning while enabling the reader to easily comprehend the key concepts behind. Indeed, it examines the benefits of automated machine learning systems, starting with defining machine learning vocabulary and basic concepts. Then, explaining how to, concretely, build up a machine learning model by highlighting the challenges related to data and algorithms. Finally, exposing a summary of two studies applying machine learning in two different fields, namely transportation for road traffic forecasting and supply chain management for demand prediction where the predictive performance of various models is compared based on different metrics. {\textcopyright} 2022 Institute of Advanced Engineering and Science. All rights reserved.},
	doi = {10.11591/ijece.v12i4.pp4243-4252},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85129666214\&doi=10.11591\%2fijece.v12i4.pp4243-4252\&partnerID=40\&md5=1d5f93103617370f5a92a90901bfe815},
	author = {Slimani, I. and Slimani, N. and Achchab, S. and Saber, M. and Farissi, I.E. and Sbiti, N. and Amghar, M.}
}
@article {Lahlou2022568,
	title = {Automatic Detection of Fake News on Twitter by Using a New Feature: User Credibility},
	journal = {Lecture Notes in Networks and Systems},
	volume = {489 LNNS},
	year = {2022},
	note = {cited By 0},
	pages = {568-580},
	abstract = {Nowadays, searching news on social media like Twitter or Facebook is something usual. Any internet users can create a lot of content: posts, comments, and they can also redistribute information with retweet option for example. Nevertheless, a large portion of these pieces of news is fake and its main aim is simply to mislead people. In this case, information credibility on social networks is an increasing important issue. This article develops a method to automatically detect fake news on Twitter by calculating a user credibility. Many approaches uses NLP techniques to analyse the content of tweets to predict the credibility of news. Our approach is based on social context feature; we propose a new feature user credibility. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-031-07969-6_43},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135053485\&doi=10.1007\%2f978-3-031-07969-6_43\&partnerID=40\&md5=183d4701938c5f034b79048db6ca5566},
	author = {Lahlou, Y. and Fkihi, S.E. and Faizi, R.}
}
@article {Ajallouda2022440,
	title = {Automatic Key-Phrase Extraction: Empirical Study of Graph-Based Methods},
	journal = {Lecture Notes in Networks and Systems},
	volume = {489 LNNS},
	year = {2022},
	note = {cited By 0},
	pages = {440-456},
	abstract = {Key-phrases in a document are phrases that provide a high-level description of its content without reading it completely. In some research articles, authors specify key-phrases in the articles they have written. However, the vast majority of books, articles, and web pages published every day, lack key-phrases. The manual extraction of these phrases is a tedious task and takes a long time. For this reason, automatic key-phrase extraction (AKE), which is an area of Text Mining, remains the best solution to overcome these difficulties. Because they are used in many Natural Language Processing (NLP) applications, such as text summarization and text classification. This article presents a comparison of some methods of extracting key-phrases from documents. Especially the graph-based approaches. These approaches are evaluated by their abilities to extract key-phrases. Our work focuses on the study of the performance of these methods in extracting key-phrases, whether from short or long texts, with the aim of providing information that contributes to improving their efficiency. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-031-07969-6_33},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135019633\&doi=10.1007\%2f978-3-031-07969-6_33\&partnerID=40\&md5=399dd65be1f33d58c24c1d31777d2b87},
	author = {Ajallouda, L. and Fagroud, F.Z. and Zellou, A. and Benlahmar, E.H.}
}
@article {Zaazaa2022449,
	title = {Automatic Static Vulnerability Detection Approaches and Tools: State of the Art},
	journal = {Lecture Notes in Networks and Systems},
	volume = {357 LNNS},
	year = {2022},
	note = {cited By 0},
	pages = {449-459},
	abstract = {Software vulnerabilities are behind many cybersecurity threats. In fact, if they are exploited, they could cause severe damage to an organization. Thus, finding vulnerabilities in software is a crucial process. However, it often needs both time and expertise. Fortunately, many researchers have focused on automating this process to accelerate the finding of vulnerabilities. Some have worked on making static vulnerability discovery more effective; others have concentrated their research on developing dynamic analysis techniques. This paper presents some of the research that focuses on static analysis approaches and discusses the main differences between them. At the end of this paper, we experiment and analyze the most popular tools that have implemented these approaches and their main weaknesses. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-030-91738-8_41},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85124134162\&doi=10.1007\%2f978-3-030-91738-8_41\&partnerID=40\&md5=e3e3f79893f511026534ba162ef13ec5},
	author = {Zaazaa, O. and El Bakkali, H.}
}
@article {Rhouas202255,
	title = {Avionic Software and Agile Development: A Systematic Mapping Study},
	journal = {Lecture Notes in Networks and Systems},
	volume = {469 LNNS},
	year = {2022},
	note = {cited By 0},
	pages = {55-65},
	abstract = {Background: The rapid increase in the use of agile development has raised the question whether of the aerospace industry can benefit from the application of agile approaches in the production of software for airborne systems and equipment. These systems are regulated by the standard DO-178 since there are hard constraints imposed on them. Additionally, the evolution of the avionics software increases the complexity of the software. Therefore, the approach to the feasibility of agile development for avionics software needs to be further understood. Objective: This study aims to examine the research publications on the agile development implemented in the lifecycle of the avionic software in order to found the trend of this mode of development. Method: We conducted systematic mapping study adopting the guideline offered by [1, 2] and classified the contributions research between 2001 and 2021 in the map. Conclusion: We selected 46 articles from 956 found in four electronic databases and based on the results, we conclude that over the past decade there has been a general increase in the number of studies concerning the agile development in different phases of the avionics software lifecycle. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-031-04819-7_6},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85131126083\&doi=10.1007\%2f978-3-031-04819-7_6\&partnerID=40\&md5=ef257557fa65d7783ca43e4a8999f5f5},
	author = {Rhouas, I. and Nafil, K.}
}
@conference {Ben-Aboud2021,
	title = {Acquisition and time-series analysis of electromagnetic pollution data},
	booktitle = {2021 17th International Conference on Intelligent Environments, IE 2021 - Proceedings},
	year = {2021},
	note = {cited By 0},
	abstract = {With the increasing use of wireless communication technologies, it is important to monitor electromagnetic exposure, ideally with high temporal and spatial resolutions. This paper presents our low-cost electro-smog measurement process, covering hardware selection, RF power measurement, and RF power correction. Then, a time series analysis is performed on the electromagnetic exposure data collected in the city of Sala Al Jadida - Morocco for seven days. The results show that the electro-smog exposure has a strong predictable pattern and a preliminary time series model is derived. {\textcopyright} 2021 IEEE.},
	keywords = {Air pollution, Electro magnetic pollution, Electromagnetic exposure, Hardware selection, Harmonic analysis, Intelligent agents, Low costs, Measurement process, Temporal and spatial, Time series analysis, Time series modeling, Wireless communication technology},
	doi = {10.1109/IE51775.2021.9486565},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85114504253\&doi=10.1109\%2fIE51775.2021.9486565\&partnerID=40\&md5=8958a981795705a145d39c5225a3dd66},
	author = {Ben-Aboud, Y. and Ghogho, M. and Pollin, S. and Kobbane, A.}
}
@article {Sabri20211571,
	title = {Acupuncture efficacy study using electromyographic signals},
	journal = {International Journal of Circuits, Systems and Signal Processing},
	volume = {15},
	year = {2021},
	note = {cited By 0},
	pages = {1571-1584},
	abstract = {Acupuncture is a centuries-old therapeutic technique. However, because of the large number of complicating circumstances, it has been difficult to clearly prove the treatment{\textquoteright}s therapeutic effectiveness. As a result, acupuncture has failed to acquire acceptance in the mainstream clinical sector. An electromyography (EMG) sensor was built and used to test the effcacy of acupuncture in alleviating muscular stiffness in this study. Electrodes, differential and inverting ampliffers, fflters, and a full-wave rectiffer made up the EMG circuit. The output of the circuit was sent to a microcontroller for analog-to-digital transformation in order to perform data acquisition. Acupuncture was used to treat four participants who had muscular dys function in various regions of their bodies in our case study. Before and after the therapy, EMG signals at the damaged regions were recorded. The ffndings revealed that the therapy had no immediate conceivable impact on the patients, since the levels of muscular contraction before and after the treatment were comparable. When the EMG signals were measured 30 minutes after the therapy, signs of muscular alleviation were found. This shows that acupuncture does supply patients with beneffcial medicine, although slowly. The act of placing the highly conducting needles into the acupuncture sites, we believe, is similar to connecting a parallel wire to a circuit, resulting in a short-circuited route at the meridian. It permits the meridian{\textquoteright}s polarized inner energy, or qi, to pass through. The equilibrium in qi regulation can therefore be restored by unclogging the ow of qi.The repair process is relatively slow, and the treatment impact may not be immediately apparent, because the constitutive qualities at the acupuncture points where the needles are pricked may not alter quickly. {\textcopyright} 2021 by the authors. Licensee MDPI, Basel, Switzerland.},
	keywords = {Acupuncture, Analog-to-digital, Arduino, Case-studies, Damaged region, Data acquisition, Digital transformation, Electromyographic signal, Electromyography, Electromyography signals, Full waves, Metadata, Needles, Signal processing, Signal-processing, Therapeutic techniques, Timing circuits},
	doi = {10.46300/9106.2021.15.169},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85120937321\&doi=10.46300\%2f9106.2021.15.169\&partnerID=40\&md5=3e2167416a17d787084cf65ecb01bc02},
	author = {Sabri, Y. and Lamzabi, S. and Siham, A. and Maizate, A.}
}
@article {Annouch2021607,
	title = {An Adaptive Genetic Algorithm for a New Variant of the Gas Cylinders Open Split Delivery and Pickup with Two-dimensional Loading Constraints},
	journal = {International Journal of Advanced Computer Science and Applications},
	volume = {12},
	number = {1},
	year = {2021},
	note = {cited By 1},
	pages = {607-619},
	abstract = {This paper studies a combination of two well-known problems in distribution logistics, which are the truck loading problem and the vehicle routing problem. In our context, a customer daily demand exceeds the truck capacity. As a result, the demand has to be split into several routes. In addition, it is required to assign customers to depots, which means that each customer is visited just once by any truck in the fleet. Moreover, we take into consideration a customer time windows. The studied problem can be defined as a Multi-depots open split delivery and pickup vehicle routing problem with two-dimensional loading constraints and time windows (2L-MD-OSPDTW). A mathematical formulation of the problem is proposed as a mixed-integer linear programming model. Then, a set of four class instances is used in a way that reflects the real-life case study. Furthermore, a genetic algorithm is proposed to solve a large scale dataset. Finally, preliminary results are reported and show that the MILP performs very well for small test instances while the genetic algorithm can be efficiently used to solve the problem for a widereaching test instances. {\textcopyright} 2021. All rights reserved.},
	keywords = {Adaptive genetic algorithms, Constraint programming, Fleet operations, Genetic algorithms, Integer programming, Large dataset, Loading constraints, Multi depots, Pickups, Routing algorithms, Sales, Split delivery, Split pickups, Test instances, Time windows, Trucks, Two-dimensional, Two-dimensional loading, Vehicle routing, Vehicle Routing Problems},
	doi = {10.14569/IJACSA.2021.0120170},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100379461\&doi=10.14569\%2fIJACSA.2021.0120170\&partnerID=40\&md5=7e2a6546b01de8c70b8cca5545b09a4e},
	author = {Annouch, A. and Bellabdaoui, A.}
}
@conference {Kawtar2021356,
	title = {Algorithms to analyze the impact of change on Enterprise Architecture},
	booktitle = {Procedia Computer Science},
	volume = {196},
	year = {2021},
	note = {cited By 0},
	pages = {356-363},
	abstract = {Currently, the organizations are constantly confronted with rapid and radical changes, making the company in turbulence that requires a transformation from a state to a target state. This turbulence needs agility on the part of companies, i.e. the ability to monitor their environment and be ready to react. Enterprise architecture needs transformation if its levels of abstraction are affected by its changes, so enterprise architecture needs to be agile to evolve over time. To measure the impact of change on the abstraction levels. This article proposes different algorithms to proceed to the change impact analysis in the different abstraction levels to be able to analyze the change impact of different projects on the elements of the enterprise architecture and to make it agile. {\textcopyright} 2021 Elsevier B.V. All rights reserved.},
	keywords = {Abstracting, Abstraction level, Change, Change impact analysis, Change impacts, enterprise architecture, Impact analysis, Impact of changes, Target state, Turbulence},
	doi = {10.1016/j.procs.2021.12.024},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85122850755\&doi=10.1016\%2fj.procs.2021.12.024\&partnerID=40\&md5=b2c3a2dc28e8214916f9d3aef066ddd4},
	author = {Kawtar, I. and Karim, D. and Salah, B.}
}
@article {Habba2021174,
	title = {Aligning Software System Level with Business Process Level through Model-Driven Architecture},
	journal = {International Journal of Advanced Computer Science and Applications},
	volume = {12},
	number = {10},
	year = {2021},
	note = {cited By 1},
	pages = {174-183},
	abstract = {Information systems are intended to provide organisations with a new way of sustaining themselves, by helping them manage their activities using innovative technologies. Information systems require aligned levels for maximum effectiveness. In this context, business and information technology (IT) alignment is an important issue for the success of organisations. This paper presents the first step of the proposed approach to align the software system level, modelled by a Unified Modeling Language (UML) class diagram, with the business process level, modelled by the Business Process Model and Notation (BPMN) model. A model-driven architecture approach is proposed as a means to transform a set of BPMN models into a UML class diagram. A set of transformation rules is proposed, followed by guidelines that help apply those rules. {\textcopyright} 2021},
	keywords = {Business Process, Business process model and notation (BPMN), Computer software, Information management, Information systems, Information use, Innovative technology, Model driven architectures, Model-driven architecture approaches, Software architecture, Software design, Transformation rules, UML class diagrams, Unified Modeling Language, Unified modeling language class diagrams},
	doi = {10.14569/IJACSA.2021.0121020},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85119658852\&doi=10.14569\%2fIJACSA.2021.0121020\&partnerID=40\&md5=dcda8435272d6d8736ff7112ffa683f0},
	author = {Habba, M. and Fredj, M. and Chaouni, S.B.}
}
@article {Illi2021261,
	title = {Analysis of Asymmetric Dual-Hop Energy Harvesting-Based Wireless Communication Systems in Mixed Fading Environments},
	journal = {IEEE Transactions on Green Communications and Networking},
	volume = {5},
	number = {1},
	year = {2021},
	note = {cited By 3},
	pages = {261-277},
	abstract = {This work investigates the performance of a dual-hop energy harvesting-based fixed-gain amplify-and-forward relaying communication system, subject to fading impairments. We consider a source node ( {S} ) communicating with a destination node ( {D} ), either directly or through a fixed distant relay ( {R} ), which harvests energy from its received signals and uses it to amplify and forward the received signals to {D}. We also consider maximal-ratio combining at {D} to combine the signals coming from {S} and {R}. Both power-splitting and time-switching energy harvesting protocols are investigated. The {S}\,\,-\,\,{R} link is modeled by Nakagami- {m} fading model, while the {R}\,\,-\,\,{D} and {S}\,\,-\,\,{D} links experience \alpha - μ fading. Closed-form expressions for the statistical properties of the total signal-to-noise ratio are derived, based on which novel closed-form expressions are then derived for the average symbol error rate as well as for the average channel capacity, considering four different adaptive transmission policies. The derived expressions are validated through Monte Carlo simulations. {\textcopyright} 2017 IEEE.},
	keywords = {Adaptive transmission policy, Amplify-and-forward relaying, Average channel capacities, Average symbol error rate (SER), Channel capacity, Closed-form expression, Energy harvesting, Maximal ratio combining (MRC), Monte Carlo methods, Signal to noise ratio, Statistical properties, Wireless communication system},
	doi = {10.1109/TGCN.2020.3035512},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85103177403\&doi=10.1109\%2fTGCN.2020.3035512\&partnerID=40\&md5=8bfc86e88ca31e88a392a44a37280141},
	author = {Illi, E. and Bouanani, F.E. and Sofotasios, P.C. and Muhaidat, S. and Costa, D.B.D. and Ayoub, F. and Al-Fuqaha, A.}
}
@article {Hakkoum2021587,
	title = {Assessing and Comparing Interpretability Techniques for Artificial Neural Networks Breast Cancer Classification},
	journal = {Computer Methods in Biomechanics and Biomedical Engineering: Imaging and Visualization},
	volume = {9},
	number = {6},
	year = {2021},
	note = {cited By 11},
	pages = {587-599},
	abstract = {Breast cancer is the most common type of cancer among women. Thankfully, early detection and treatment improvements helped decrease the number of deaths. Data Mining techniques have always assisted BC tasks whether it is screening, diagnosis, prognosis, treatment, monitoring, and/or management. Nowadays, the use of Data Mining is witnessing a new era. In fact, the main objective is no longer to replace humans but to enhance their capabilities, which is why Artificial Intelligence is now referred to as Intelligence Augmentation. In this context, interpretability is used to help domain experts learn new patterns and machine learning experts debug their models. This paper aims to investigate three black-boxes interpretation techniques: Feature Importance, Partial Dependence Plot, and LIME when applied to two types of feed-forward Artificial Neural Networks: Multilayer perceptrons, and Radial Basis Function Network, trained on the Wisconsin Original dataset for breast cancer diagnosis. Results showed that local LIME explanations were instance-level interpretations that came in line with the global interpretations of the other two techniques. Global/local interpretability techniques can thus be combined to define the trustworthiness of a black-box model. {\textcopyright} 2021 Informa UK Limited, trading as Taylor \& Francis Group.},
	keywords = {Article, Artificial intelligence, artificial neural network, Breast Cancer, Breast cancer classifications, cancer diagnosis, Computer aided diagnosis, cross validation, Data mining, Data-mining techniques, Diseases, Domain experts, early diagnosis, entropy, Explainability, Feature importance, Interpretability, Learn+, learning, learning algorithm, Lime, Machine learning, Multilayer neural networks, nerve cell, nonhuman, Partial dependence plot, perceptron, prediction, prognosis, Radial basis function networks, Treatment monitoring},
	doi = {10.1080/21681163.2021.1901784},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85103249025\&doi=10.1080\%2f21681163.2021.1901784\&partnerID=40\&md5=78e1e57a62692bab2b39984182af7904},
	author = {Hakkoum, H. and Idri, A. and Abnane, I.}
}
@article {ElKoufi2021,
	title = {Asymptotic properties of a stochastic SIQR epidemic model with L{\'e}vy Jumps and Beddington-DeAngelis incidence rate},
	journal = {Results in Physics},
	volume = {27},
	year = {2021},
	note = {cited By 9},
	abstract = {In this paper, we propose a stochastic SIQR model and discuss the impact of L{\'e}vy jumps and Beddington-DeAngelis incidence rate on the transmission of diseases. We prove that our proposed model admits a unique global positive solution and an invariant positive set. We establish sufficient conditions for the extinction and persistence of the disease in the population using some stochastic calculus background. We illustrate our theoretical results by numerical simulations. We infer that the white and L{\'e}vy noises influence the transmission dynamic of the system. {\textcopyright} 2021 The Author(s)},
	doi = {10.1016/j.rinp.2021.104472},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85108866996\&doi=10.1016\%2fj.rinp.2021.104472\&partnerID=40\&md5=2fdb2ac81157617ad18abf5ecead509d},
	author = {El Koufi, A. and Bennar, A. and El Koufi, N. and Yousfi, N.}
}
@article {ElKandoussi2021350,
	title = {Automated security driven solution for inter-organizational workflows},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {1179 AISC},
	year = {2021},
	note = {cited By 0},
	pages = {350-361},
	abstract = {This paper presents a new solution to deal with security in dynamic Inter-Organizational Workflow (IOW) Systems. The IOW system aims to support the collaboration between distributed business processes running in several autonomous organizations in order to complete a set of common goals. In such dynamic environments, where participating organizations (partners) in the IOW are not known before its execution, many security breaches could arise. Thus, we propose a new automated security-driven solution based on i) partner selection ii) access control partner negotiation and policy conflict resolution. {\textcopyright} The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.},
	keywords = {Access control, Business Process, Dynamic environments, Intelligent systems, Inter-Organizational workflow, Inter-organizational workflows, Partner selection, Policy conflict, Running-in, Security breaches},
	doi = {10.1007/978-3-030-49336-3_35},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85089717314\&doi=10.1007\%2f978-3-030-49336-3_35\&partnerID=40\&md5=b0b03a78e31324087b3748ca67ca2c4d},
	author = {El Kandoussi, A. and El Bakkali, H.}
}
@conference {Wissal2020557,
	title = {Adaptive Enterprise Architecture: Initiatives and Criteria},
	booktitle = {7th International Conference on Control, Decision and Information Technologies, CoDIT 2020},
	year = {2020},
	note = {cited By 3},
	pages = {557-562},
	abstract = {Due mainly to digital transformation, enterprises are immersed in dynamic environments. They are dealing with internal and external changes (gradual or abrupt, frequent or occasional, in the short or long term) that impact various parts of their Enterprise Architecture. To cope with the requirements of this new digital era, agility and adaptation are compulsory. Though Enterprise Architecture (EA) was designed as a catalyst for change management, traditional Enterprise Architecture approaches do not rely on well-defined concepts, lack agility and are constrained by layered architecture (business layer, functional layer, deployment layer, etc.). Thus, a new generation of EA, allowing continuous self-improvement and proactive adaptation to better match the new conditions, is required. In this paper, we explore and investigate some approaches of EA that deal with change management. Then, we, particularly, note the various definitions of the notion of adaptive EA, according to literature. Finally, we suggest some criteria, regarding the adaptation of EA, to highlight the limitations of the approaches analyzed. {\textcopyright} 2020 IEEE.},
	keywords = {Adaptive enterprise, Change management, Control engineering, Digital transformation, Dynamic environments, enterprise architecture, Functional layer, Layered architecture, Proactive adaptations},
	doi = {10.1109/CoDIT49905.2020.9263891},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85098274425\&doi=10.1109\%2fCoDIT49905.2020.9263891\&partnerID=40\&md5=a1b2cd3899750d3829a4b6b9824d2970},
	author = {Wissal, D. and Karim, D. and Laila, K.}
}
@conference {Daoudi2020,
	title = {Adaptive Enterprise Architecture: Towards a model},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2020},
	note = {cited By 0},
	abstract = {Nowadays, enterprises are facing many changes due to digital transformation. So, they have to deal with new requirements that impact various parts of their Enterprise Architecture. To address the needs created by this new digital era, agility and adaptation are compulsory. Though Enterprise Architecture (EA) was designed as a catalyst for change management, traditional Enterprise Architecture approaches do not rely on well-defined concepts, lack agility and are constrained by layered architecture (business layer, functional layer, deployment layer, etc.). Thus, a new generation of EA, allowing continuous self-improvement and proactive adaptation to better match the new conditions, is required. In this paper, we highlighted some criteria, regarding the adaptation of EA and exploited them to show the limitations of the EA approaches analyzed. Then, we presented agile methods principles and discussed the mapping between them and the criteria that we proposed before. Finally, we proposed a simplified model based on Scrum for adaptive enterprise architecture. {\textcopyright} 2020 ACM.},
	keywords = {Adaptive enterprise, Change management, Digital transformation, enterprise architecture, Functional layer, Information systems, Information use, Layered architecture, Model-based OPC, Proactive adaptations},
	doi = {10.1145/3447568.3448539},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85103625235\&doi=10.1145\%2f3447568.3448539\&partnerID=40\&md5=4f7441d9a2cb09a9ffc18c39755d4958},
	author = {Daoudi, W. and Doumi, K. and Kjiri, L.}
}
@conference {Kharchouf2020,
	title = {Adaptive Fuzzy-PI Control of Wind Energy Conversion System Based DFIG under Voltage Dip},
	booktitle = {2020 International Conference on Electrical and Information Technologies, ICEIT 2020},
	year = {2020},
	note = {cited By 2},
	abstract = {The Proportional-Integral (PI) and Fuzzy Logic Controllers (FLC) cannot deal accurately with the system variation. To overcome the drawbacks of PI and FLC regulators, the Adaptive Fuzzy-PI Controllers (AFPICs) are configured. This paper presents a comparison between three different controllers based control methodology for Variable Speed Wind Energy Conversion Systems (WECSs) by means of Doubly Fed Induction Generator (DFIG). Artificial Intelligence (AI) based FLCs is performed to improve the system efficiency and performance under Small Disturbance (SD) and Large Disturbance (LD) cases. To test the PI, FLC, and AFPIC robustness, simulations are done during abrupt wind speed variation (SD), and voltage dip fault (LD). The simulation results show that the proposed AFPIC delivers improved power control, better response rise time, reduced overshoot, undershoot, and settling time compared to classical PI and Fuzzy controllers. The proposed control is proved by simulation using Matlab/Simulink-R2016b. {\textcopyright} 2020 IEEE.},
	keywords = {Adaptive control systems, Adaptive fuzzy-PI control, Asynchronous generators, Control methodology, Controllers, Doubly fed induction generators, Electric fault currents, Electric machine control, Energy conversion, Fuzzy logic, Fuzzy logic controllers, MATLAB, Power control, Proportional integral, Two term control systems, Variable speed wind energy conversion systems, Water craft, Wind, Wind energy conversion system, Wind power, Wind speed variations},
	doi = {10.1109/ICEIT48248.2020.9113215},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85086889728\&doi=10.1109\%2fICEIT48248.2020.9113215\&partnerID=40\&md5=514df1b642398d6a25a07b76a59427bf},
	author = {Kharchouf, I. and Nasser, T. and Essadki, A. and Fdaili, M.}
}
@article {Haitam202013,
	title = {Advanced modified direct torque control with space vector modulation based on active disturbance rejection control for induction motor sensorless drive},
	journal = {International Journal of Mechanical Engineering and Robotics Research},
	volume = {9},
	number = {1},
	year = {2020},
	note = {cited By 2},
	pages = {13-19},
	abstract = {This work addresses the problems inherent in the disturbances affected to the operation of electrical motor drives, a modified direct torque control which is among the excellent method of torque control of an induction motor that provide a decoupled control of flux and torque is implemented with a novel controller of active disturbance rejection controller to cancel the drawbacks of flux ripples, high torque at start-up and also variable switching frequency associated in the classical DTC. In the other side, an advanced estimator for rotor speed is used in order to rectify the problem of sensors. The proposed control strategy, implementation data, and simulations with MDTC are presented and discussed. It is concluded that MDTC-SVM proposed control topology offers high performance in steady-state operation despite the existence of the internal and external disturbances. {\textcopyright} 2020 by the authors.},
	doi = {10.18178/ijmerr.9.1.13-19},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85081411340\&doi=10.18178\%2fijmerr.9.1.13-19\&partnerID=40\&md5=c5c6e74c1aa49a6e9a869fb6152a5a1d},
	author = {Haitam, C. and Ahmed, E. and Tamou, N.}
}
@conference {Imgharene2020662,
	title = {Agility metrics model for Business IT Alignment},
	booktitle = {7th International Conference on Control, Decision and Information Technologies, CoDIT 2020},
	year = {2020},
	note = {cited By 1},
	pages = {662-667},
	abstract = {Enterprises are facing rapid and radical changes in a turbulent environment. This turbulence requires companies to be agile, i.e. to keep an overview of their environment and to be ready to react. Alignment Businesses IT is constantly being affected if levels of abstraction are affected by the change. The changes in companies must necessarily be accompanied by a (re)alignment of Business IT. In order to measure the impact of change on Business-IT alignment, this paper reviews the literature on agility metrics in different domains, by filtering them to focus on the context of Business-IT alignment, and then matching the metrics to the model that defines the impact of change on Business-IT alignment. {\textcopyright} 2020 IEEE.},
	keywords = {Alignment, Business - IT alignments, Business-IT, Control engineering, Different domains, Impact of changes, Levels of abstraction, Metrics models, Turbulent environments},
	doi = {10.1109/CoDIT49905.2020.9263839},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85098240037\&doi=10.1109\%2fCoDIT49905.2020.9263839\&partnerID=40\&md5=821e8e127bf8d6c8fed3eb27359a6c73},
	author = {Imgharene, K. and Doumi, K. and Baina, S.}
}
@article {Zarnoufi2020182,
	title = {AI to prevent cyber-violence: Harmful behaviour detection in social media},
	journal = {International Journal of High Performance Systems Architecture},
	volume = {9},
	number = {4},
	year = {2020},
	note = {cited By 1},
	pages = {182-191},
	abstract = {Social media has allowed people to communicate freely. This total freedom has led to the emergence of cyber-violence with a growing number of victims. Many researches in psychology and e-health have been conducted to detect the act of cyber-violence. In computational field, most of works have focused on multiple aspects of cyber-violence, but none of them, to our knowledge, have studied the perpetrator{\textquoteright}s harmful behaviour from an emotional dimension. Our goal in this work is to discover the relationship between the emotional state of social media users and their harmful behaviour while engaged in the act of cyber-violence. Our approach is based on Ensemble Machine Learning and engineered features related to Plutchik wheel of basic emotions extracted with semantic similarity and word embedding. The results show a significant association between the individual{\textquoteright}s emotional state and the harmful intent, which may be a good indicator for cyber-violence detection. Copyright {\textcopyright} 2020 Inderscience Enterprises Ltd.},
	keywords = {Basic emotions, Behaviour detections, Computational field, Emotional dimensions, Emotional state, Semantic similarity, Semantics, social media, Social networking (online), Violence detections},
	doi = {10.1504/IJHPSA.2020.113679},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85102891888\&doi=10.1504\%2fIJHPSA.2020.113679\&partnerID=40\&md5=3e11e2e6a4032f608b4b71f2d426dbca},
	author = {Zarnoufi, R. and Boutbi, M. and Abik, M.}
}
@conference {Naja2020,
	title = {Alert Message Dissemination using Graph-based Markov Decision Process Model in VANETs},
	booktitle = {IEEE International Conference on Communications},
	volume = {2020-June},
	year = {2020},
	note = {cited By 0},
	abstract = {Vehicular Ad-hoc Networks (VANETs) have many promising applications such as improving vehicle driver{\textquoteright}s safety, and so, decreasing car deaths. In VANETs, the main communication way is broadcast. Such Broadcast needs to be done efficiently especially in congested areas to avoid the broadcast storm problem. A crashed vehicle disseminates a message about its incident to all nodes in the network. The vehicle nodes of the network have to disseminate in their turn the alert message carefully to maximize both reachability and saved rebroadcast (by reducing congestion) while minimizing the delay. This concern is demonstrated and modeled by decision hypothesis. In this paper, at first, we are keen on the Markov decision process (MDP), which is utilized to model and tackle such successive decision issues. We aim to optimize a utility for each vehicle relying upon an irregular domain and choices made by it. As the MDP formalism achieves its cutoff points when it is important to consider the cooperation between the several vehicles. We will begin utilizing the Graph-based MDP where the state and activity spaces are factorizable by factors. We then demonstrate that the transition functions and rewards are deteriorated into nearby functions, and the reliance relations between the vehicles are spoken to by a graph. To Figure the optimal strategy, we use Mean Field Approximation (MFA) for tackling GMDP issue. {\textcopyright} 2020 IEEE.},
	keywords = {Accidents, Broadcast storm problem, Graphic methods, Markov decision process models, Markov Decision Processes, Markov processes, Mean field approximation, Message dissemination, Mobile telecommunication systems, Optimal strategies, Traffic congestion, Transition functions, Vehicles, Vehicular ad hoc networks, Vehicular Adhoc Networks (VANETs)},
	doi = {10.1109/ICC40277.2020.9148997},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85089436123\&doi=10.1109\%2fICC40277.2020.9148997\&partnerID=40\&md5=12d16adc7ab7a4b60d7ff52c15709c2c},
	author = {Naja, A. and Oualhaj, O.A. and Boulmalf, M. and Essaaidi, M. and Kobbane, A.}
}
@article {ElOuahabi20204261,
	title = {Analysis and design of a compact ultra-wideband antenna with WLAN and X-band satellite notch},
	journal = {International Journal of Electrical and Computer Engineering},
	volume = {10},
	number = {4},
	year = {2020},
	note = {cited By 1},
	pages = {4261-4269},
	abstract = {A compact design of ultra-wideband (UWB) antenna with dual band-notched characteristics are investigated in this paper. The wider impedance bandwidth (from 2.73 to 11.34 GHz) is obtained by using two symmetrical slits in the radiating patch and another slit in the partial ground plane. The dual band-notch rejection at WLAN and X-band downlink satellite communication system are obtained by inserting a modified U-strip on the radiating patch at 5.5 GHz and embedding a pair of single rectangular split ring resonators (SR-SRR) on both sides of the microstrip feed line at 7.5 GHz, respectively. The proposed antenna is simulated and tested using CST MWS high frequency simulator and exhibits the advantages of compact size, simple design and each notched frequency band can be controlled independently by using the geometrical parameters of the corresponding resonator. Therefore, the parametric study is carried out to understand the mutual coupling between the dual band-notched elements. To validate simulation results of our design, a prototype is fabricated and good agreement is achieved between measurement and simulation. Furthermore, a radiation patterns, satisfactory gain, current distribution and VSWR result at the notched frequencies make the proposed antenna a suitable candidate for practical UWB applications. Copyright {\textcopyright} 2020 Institute of Advanced Engineering and Science. All rights reserved.},
	doi = {10.11591/ijece.v10i4.pp4261-4269},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85083101617\&doi=10.11591\%2fijece.v10i4.pp4261-4269\&partnerID=40\&md5=6e35d351672ae49ebb932247c0e19472},
	author = {El Ouahabi, M. and Dkiouak, A. and Zakriti, A. and Essaaidi, M. and Elftouh, H.}
}
@article {Lakhrouit2020377,
	title = {Analysis and implementation of the impact of change: Application to heterogeneity algorithms in enterprise architecture},
	journal = {International Journal of Electrical and Computer Engineering},
	volume = {10},
	number = {1},
	year = {2020},
	note = {cited By 0},
	pages = {377-386},
	abstract = {Measurements play an important role in many scientific fields in general and in the analysis of enterprise architecture in particular. In software engineering, the measures are used to control the quality of the software product and better manage development projects to control the cost of production. In this article we proposed firstly models and measures to evaluate and analyze the complexity of the enterprise architecture and especially the heterogeneity of components and relationships, and secondely we developed a model to automatically detect the change of measures and their impact on enterprise architecture. Copyright {\textcopyright} 2020 Institute of Advanced Engineering and Science. All rights reserved.},
	doi = {10.11591/ijece.v10i1.pp377-386},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85083115917\&doi=10.11591\%2fijece.v10i1.pp377-386\&partnerID=40\&md5=8b953a41fe9305c536489d454450d483},
	author = {Lakhrouit, J. and Baina, K.}
}
@article {DRISSI2020104243,
	title = {An analysis on self-management and treatment-related functionality and characteristics of highly rated anxiety apps},
	journal = {International Journal of Medical Informatics},
	volume = {141},
	year = {2020},
	pages = {104243},
	abstract = {Background and objective Anxiety is a common emotion that people often feel in certain situations. But when the feeling of anxiety is persistent and interferes with a person{\textquoteright}s day to day life then this may likely be an anxiety disorder. Anxiety disorders are a common issue worldwide and can fall under general anxiety, panic attacks, and social anxiety among others. They can be disabling and can impact all aspects of an individual{\textquoteright}s life, including work, education, and personal relationships. It is important that people with anxiety receive appropriate care, which in some cases may prove difficult due to mental health care delivery barriers such as cost, stigma, or distance from mental health services. A potential solution to this could be mobile mental health applications. These can serve as effective and promising tools to assist in the management of anxiety and to overcome some of the aforementioned barriers. The objective of this study is to provide an analysis of treatment and management-related functionality and characteristics of high-rated mobile applications (apps) for anxiety, which are available for Android and iOS systems. Method A broad search was performed in the Google Play Store and App Store following the Preferred Reporting Items for Systematic reviews and Meta-Analysis (PRISMA) protocol to identify existing apps for anxiety. A set of free and highly rated apps for anxiety were identified and the selected apps were then installed and analyzed according to a predefined data extraction strategy. Results A total of 167 anxiety apps were selected (123 Android apps and 44 iOS apps). Besides anxiety, the selected apps addressed several health issues including stress, depression, sleep issues, and eating disorders. The apps adopted various treatment and management approaches such as meditation, breathing exercises, mindfulness and cognitive behavioral therapy. Results also showed that 51\% of the selected apps used various gamification features to motivate users to keep using them, 32\% provided social features including chat, communication with others and links to sources of help; 46\% offered offline availability; and only 19\% reported involvement of mental health professionals in their design. Conclusions Anxiety apps incorporate various mental health care management methods and approaches. Apps can serve as promising tools to assist large numbers of people suffering from general anxiety or from anxiety disorders, anytime, anywhere, and particularly in the current COVID-19 pandemic.},
	keywords = {Anxiety, M-health, Mental health, Mobile apps, Mobile mental health},
	issn = {1386-5056},
	doi = {https://doi.org/10.1016/j.ijmedinf.2020.104243},
	url = {https://www.sciencedirect.com/science/article/pii/S1386505620305815},
	author = {Nidal Drissi and Sofia Ouhbi and Mohammed Abdou Janati Idrissi and Mounir Ghogho}
}
@article {Drissi2020,
	title = {An analysis on self-management and treatment-related functionality and characteristics of highly rated anxiety apps},
	journal = {International Journal of Medical Informatics},
	volume = {141},
	year = {2020},
	note = {cited By 19},
	abstract = {Background and objective: Anxiety is a common emotion that people often feel in certain situations. But when the feeling of anxiety is persistent and interferes with a person{\textquoteright}s day to day life then this may likely be an anxiety disorder. Anxiety disorders are a common issue worldwide and can fall under general anxiety, panic attacks, and social anxiety among others. They can be disabling and can impact all aspects of an individual{\textquoteright}s life, including work, education, and personal relationships. It is important that people with anxiety receive appropriate care, which in some cases may prove difficult due to mental health care delivery barriers such as cost, stigma, or distance from mental health services. A potential solution to this could be mobile mental health applications. These can serve as effective and promising tools to assist in the management of anxiety and to overcome some of the aforementioned barriers. The objective of this study is to provide an analysis of treatment and management-related functionality and characteristics of high-rated mobile applications (apps) for anxiety, which are available for Android and iOS systems. Method: A broad search was performed in the Google Play Store and App Store following the Preferred Reporting Items for Systematic reviews and Meta-Analysis (PRISMA) protocol to identify existing apps for anxiety. A set of free and highly rated apps for anxiety were identified and the selected apps were then installed and analyzed according to a predefined data extraction strategy. Results: A total of 167 anxiety apps were selected (123 Android apps and 44 iOS apps). Besides anxiety, the selected apps addressed several health issues including stress, depression, sleep issues, and eating disorders. The apps adopted various treatment and management approaches such as meditation, breathing exercises, mindfulness and cognitive behavioral therapy. Results also showed that 51\% of the selected apps used various gamification features to motivate users to keep using them, 32\% provided social features including chat, communication with others and links to sources of help; 46\% offered offline availability; and only 19\% reported involvement of mental health professionals in their design. Conclusions: Anxiety apps incorporate various mental health care management methods and approaches. Apps can serve as promising tools to assist large numbers of people suffering from general anxiety or from anxiety disorders, anytime, anywhere, and particularly in the current COVID-19 pandemic. {\textcopyright} 2020 Elsevier B.V.},
	keywords = {Android (operating system), Anxiety, anxiety disorder, Betacoronavirus, breathing exercise, cognitive behavioral therapy, Cognitive-behavioral therapies, Coronavirus infection, Coronavirus Infections, data extraction, Disease Outbreaks, eating disorder, Eating disorders, epidemic, Health care, human, Humans, iOS (operating system), isolation and purification, language, Mental health, mental health care personnel, mental health service, Mental health services, mobile application, Mobile applications, organization and management, pandemic, Pandemics, Personal relationships, Pneumonia, priority journal, psychology, Review, self care, Self-Management, sleep, Social anxieties, stress, Systematic Review, telemedicine, therapy, Viral, virology, virus pneumonia},
	doi = {10.1016/j.ijmedinf.2020.104243},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85088938984\&doi=10.1016\%2fj.ijmedinf.2020.104243\&partnerID=40\&md5=ec0c4f4cdf72007694d3cc8e8f50bb97},
	author = {Drissi, N. and Ouhbi, S. and Janati Idrissi, M.A. and Ghogho, M.}
}
@conference {Daoudi2020738,
	title = {An approach for adaptive enterprise architecture},
	booktitle = {ICEIS 2020 - Proceedings of the 22nd International Conference on Enterprise Information Systems},
	volume = {2},
	year = {2020},
	note = {cited By 4},
	pages = {738-745},
	abstract = {Given the fast emergence of new technologies and the highly changing business demands, enterprises are confronted with the need to keep up with the evolving transformation. This one is subject to internal and external factors which make it very often in the form of disruptive changes. As a consequence, various parts of companies{\textquoteright} Enterprise Architecture are impacted. To address the new requirements of these increasingly dynamic environments, enterprises need to transition from heavy and document-centred Enterprise Architecture Frameworks to more agile and continuously adaptive approaches. On the other hand, Agile Software Development (ASD) are commonly used methods for IT development. They are mainly characterized by the high involvement of the requester and the rapid accommodation to development needs. This paper presents an Adaptive Enterprise Architecture model that is inspired from some ASD values. Thus, we begin with a brief summary of the criteria that we consider compulsory for Adaptive Enterprise Architecture. Then we present the related work and the connection between agile values and our criteria. Finally, we describe our model and illustrate it via a case study. Copyright {\textcopyright} 2020 by SCITEPRESS {\textendash} Science and Technology Publications, Lda. All rights reserved},
	keywords = {Adaptive approach, Adaptive enterprise, Agile manufacturing systems, Agile software development, Business demands, Development needs, Dynamic environments, enterprise architecture, Information systems, Information use, Internal and external factors, Software design},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85091394601\&partnerID=40\&md5=47480aba028e3e923b145c862859135c},
	author = {Daoudi, W. and Doumi, K. and Kjiri, L.}
}
@article {Hakkoum202015,
	title = {Artificial Neural Networks Interpretation Using LIME for Breast Cancer Diagnosis},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {1161 AISC},
	year = {2020},
	note = {cited By 6},
	pages = {15-24},
	abstract = {Breast Cancer (BC) is the most common type of cancer among women. Thankfully early detection and treatment improvements helped decrease its number of deaths. Data Mining techniques (DM), which discover hidden and potentially useful patterns from data, particularly for breast cancer diagnosis, are witnessing a new era, where the main objective is no longer replacing humans or just assisting them in their tasks but enhancing and augmenting their capabilities and this is where interpretability comes into play. This paper aims to investigate the Local Interpretable Model-agnostic Explanations (LIME) technique to interpret a Multilayer perceptron (MLP) trained on the Wisconsin Original Data-set. The results show that LIME explanations are a sort of real-time interpretation that helps understanding how the constructed neural network {\textquotedblleft}thinks{\textquotedblright} and thus can increase trust and help oncologists, as the domain experts, learn new patterns. {\textcopyright} 2020, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	keywords = {Breast Cancer, Breast cancer diagnosis, Data mining, Diseases, Domain experts, Information systems, Information use, Interpretability, Lime, Multi layer perceptron, Neural networks, Real time, Useful patterns, WISCONSIN},
	doi = {10.1007/978-3-030-45697-9_2},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85085506923\&doi=10.1007\%2f978-3-030-45697-9_2\&partnerID=40\&md5=cf809f0c6b9c95cd37d48038f1dfa79a},
	author = {Hakkoum, H. and Idri, A. and Abnane, I.}
}
@article {Idri20201239,
	title = {Assessing the impact of parameters tuning in ensemble based breast Cancer classification},
	journal = {Health and Technology},
	volume = {10},
	number = {5},
	year = {2020},
	note = {cited By 12},
	pages = {1239-1255},
	abstract = {Breast cancer is one of the major causes of death among women. Different decision support systems were proposed to assist oncologists to accurately diagnose their patients. These decision support systems mainly used classification techniques to categorize the diagnosis into Malign or Benign tumors. Given that no consensus has been reached on the classifier that can perform best in all circumstances, ensemble-based classification, which classifies patients by combining more than one single classification technique, has recently been investigated. In this paper, heterogeneous ensembles based on three well-known machine learning techniques (support vector machines, multilayer perceptron, and decision trees) were developed and evaluated by investigating the impact of parameter values of the ensemble members on classification performance. In particular, we investigate three parameters tuning techniques: Grid Search (GS), Particle Swarm Optimization (PSO) and the default parameters of the Weka Tool to evaluate whether setting ensemble parameters permits more accurate classification in breast cancer over four datasets obtained from the Machine Learning repository. The heterogeneous ensembles of this study were built using the majority voting technique as a combination rule. The overall results obtained suggest that: (1) Using GS or PSO techniques for single techniques provide more accurate classification; (2) In general, ensembles generate more accurate classification than their single techniques regardless of the optimization techniques used. (3) Heterogeneous ensembles based on optimized single classifiers generate better results than the Uniform Configuration of Weka (UC-WEKA) ensembles, and (4) PSO and GS slightly have the same impact on the performances of ensembles. {\textcopyright} 2020, IUPESM and Springer-Verlag GmbH Germany, part of Springer Nature.},
	keywords = {accuracy, Article, Breast Cancer, cancer classification, classifier, decision tree, experimental design, grid search, human, multilayer perceptron, particle swarm optimization, recall, support vector machine},
	doi = {10.1007/s12553-020-00453-2},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85087361107\&doi=10.1007\%2fs12553-020-00453-2\&partnerID=40\&md5=7398903f3007d71e535b12c2ef9a90a6},
	author = {Idri, A. and Bouchra, E.O. and Hosni, M. and Abnane, I.}
}
@article {Bennouri2020119,
	title = {Assessing the performance of different TCP congestion mechanisms in underwater wireless sensor networks},
	journal = {International Journal of Vehicle Information and Communication Systems},
	volume = {5},
	number = {1},
	year = {2020},
	note = {cited By 2},
	pages = {119-136},
	abstract = {Data transmission in Underwater Wireless Sensor Networks (UWSNs) is one of the key enablers used in technologies for future oceanmonitoring systems and other underwater applications. The use of acoustic waves in UWSNs suffer from a high propagation delay, as well as a limited available bandwidth due to the high-noise level, making the use of the different traditional existing protocols a major challenge in this environment. In this paper, we have chosen two TCP mechanisms already defined: TCP Vegas and TCP New Reno, to evaluate the effects of variable TCP packet size and TCP connection density in a subsea network under two common routing protocols, namely AODV and DSDV. The simulation results show that the performances of the two TCPs using DSDV routing protocol provide a more efficient result than those using the AODV routing protocol and that New Reno TCP gives better results than Vegas TCP in the UWSNs. {\textcopyright} 2020 Inderscience Enterprises Ltd.},
	keywords = {Acoustic wave propagation, AODV routing protocol, Available bandwidth, Bandwidth, High noise levels, Propagation delays, Routing protocols, TCP congestion, TCP connections, Transmission control protocol, Underwater application, Underwater wireless sensor networks, Wireless sensor networks},
	doi = {10.1504/IJVICS.2020.107193},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85084918574\&doi=10.1504\%2fIJVICS.2020.107193\&partnerID=40\&md5=dc46b93dedd14eb8f8f2d95727287389},
	author = {Bennouri, H. and Berqia, A.A.}
}
@article {Pefura-Yone2020297,
	title = {Atopic dermatitis in children and adults in Sub-saharan Africa and Maghreb [{\'E}tat des lieux de la dermatite atopique de l{\textquoteright}enfant et de l{\textquoteright}adulte en Afrique sub-saharienne et au Maghreb]},
	journal = {Revue Francaise d{\textquoteright}Allergologie},
	volume = {60},
	number = {4},
	year = {2020},
	note = {cited By 0},
	pages = {297-299},
	abstract = {{Objective: To describe the demographic, clinical, paraclinical and therapeutic characteristics of patients with atopic dermatitis in Sub-Saharan Africa (SSA) and the Maghreb. Methods: The Medical Doctors members of the Federation Allergologie Internationale (FAI) working in SSA and the Maghreb were invited to participate in this cross-sectional study to consecutively including patients with atopic dermatitis (AD) seen in their consultations from September 2019 to January 2010 (5 months). Results: A total of 69 patients (53.6\% female) were included. The proportion of female subjects was higher among subjects included in SSA (69.7\% vs 38.9\%},
	keywords = {adolescent, adult, Africa south of the Sahara, allergic rhinitis, asthma, Atopic dermatitis, bacterial skin disease, child, clinical assessment, clinical feature, consultation, cross-sectional study, daytime somnolence, disease association, female, food allergen, human, major clinical study, male, prevalence, prurigo, seborrheic dermatitis, Short Survey},
	doi = {10.1016/j.reval.2020.02.014},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85081410340\&doi=10.1016\%2fj.reval.2020.02.014\&partnerID=40\&md5=f42b72ed95d78155dedf2d2b24439201},
	author = {Pefura-Yone, E.W. and Jeddi, Z. and Kouotou, E.A. and Delimi, B. and El Gueddari, Y. and Karkar, R. and Kebe, M. and Diallo Chauvin, M. and Dumur, J.-P.}
}
@article {Razouk2019137,
	title = {Adapted Bin-Packing Algorithm for the Yard Optimization Problem},
	journal = {Studies in Computational Intelligence},
	volume = {774},
	year = {2019},
	note = {cited By 0},
	pages = {137-152},
	doi = {10.1007/978-3-319-95104-1_9},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85053038995\&doi=10.1007\%2f978-3-319-95104-1_9\&partnerID=40\&md5=b1986e4ea5ae05f20b92c72d4cc55fac},
	author = {Razouk, C. and Benadada, Y. and Boukachour, J.}
}
@article {Khoumsi2019343,
	title = {Automata-based bottom-up design of conflict-free security policies specified as policy expressions},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {11028 LNCS},
	year = {2019},
	note = {cited By 0},
	pages = {343-357},
	doi = {10.1007/978-3-030-05529-5_23},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85059958782\&doi=10.1007\%2f978-3-030-05529-5_23\&partnerID=40\&md5=903c5a9fdf6f9a84edd470778038befc},
	author = {Khoumsi, A. and Erradi, M.}
}
@article {Madani201867,
	title = {ABAC Based Online Collaborations in the Cloud},
	journal = {Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST},
	volume = {206},
	year = {2018},
	pages = {67-76},
	doi = {10.1007/978-3-319-67837-5_7},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85032702017\&doi=10.1007\%2f978-3-319-67837-5_7\&partnerID=40\&md5=704b997de080d8d90770d238c58d2580},
	author = {Madani, M.A. and Erradi, M. and Benkaouz, Y.}
}
@article {Madani201867,
	title = {ABAC Based Online Collaborations in the Cloud},
	journal = {Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST},
	volume = {206},
	year = {2018},
	note = {cited By 0},
	pages = {67-76},
	abstract = {Nowadays sharing data among organizations plays an important role for their collaboration. During collaborations, the organizations need to access shared information while respecting the access control constraints. In addition, most organizations rely on cloud based solutions to store their data (e.g. openstack). In such platform, data access is regulated by Access Control Lists (ACLs). ACL defines static access rules. It assumes the knowledge of the whole set of users and possible access requests. This make ACL unusable in collaborative context due to the dynamic nature of collaborative sessions. In this paper, we consider ABAC, a flexible and fine-grained model, as an access control model for cloud-based collaborations to overcome the ACL limitations. We provide an architecture that integrate ABAC in the storage level of a cloud platform. {\textcopyright} 2018, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.},
	doi = {10.1007/978-3-319-67837-5_7},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85032702017\&doi=10.1007\%2f978-3-319-67837-5_7\&partnerID=40\&md5=704b997de080d8d90770d238c58d2580},
	author = {Madani, M.A. and Erradi, M. and Benkaouz, Y.}
}
@article {AitElHadj2018298,
	title = {Access domain-based approach for anomaly detection and resolution in XACML policies},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {735},
	year = {2018},
	pages = {298-308},
	doi = {10.1007/978-3-319-76354-5_27},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85044049486\&doi=10.1007\%2f978-3-319-76354-5_27\&partnerID=40\&md5=6c7c85cfacd3e4e948ef85d2df40ee3f},
	author = {Ait El Hadj, M. and Benkaouz, Y. and Khoumsi, A. and Erradi, M.}
}
@article {Elmidaoui201826,
	title = {Accuracy comparison of empirical studies on software product maintainability prediction},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {746},
	year = {2018},
	pages = {26-35},
	doi = {10.1007/978-3-319-77712-2_3},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85045339755\&doi=10.1007\%2f978-3-319-77712-2_3\&partnerID=40\&md5=7400e19626fc0aa4658b0ac497b89bda},
	author = {Elmidaoui, S. and Cheikhi, L. and Idri, A.}
}
@conference {Assila2018213,
	title = {Achieving low-energy consumption in fog computing environment: A matching game approach},
	booktitle = {19th IEEE Mediterranean Eletrotechnical Conference, MELECON 2018 - Proceedings},
	year = {2018},
	pages = {213-218},
	doi = {10.1109/MELCON.2018.8379096},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85050157229\&doi=10.1109\%2fMELCON.2018.8379096\&partnerID=40\&md5=0250d5d03e5322d270460ae3af21ca94},
	author = {Assila, B. and Kobbane, A. and Walid, A. and El Koutbi, M.}
}
@conference {Benqatla2018,
	title = {Actor network theory as a framework to build business collaboration network applied to digital government},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2018},
	doi = {10.1145/3230905.3230934},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85053485272\&doi=10.1145\%2f3230905.3230934\&partnerID=40\&md5=ae78144fe8f920aec1f5f0f197ffbb44},
	author = {Benqatla, M.S. and Bounabat, B.}
}
@article {Tal2018,
	title = {Addressing desalination{\textquoteright}s carbon footprint: The Israeli experience},
	journal = {Water (Switzerland)},
	volume = {10},
	number = {2},
	year = {2018},
	doi = {10.3390/w10020197},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85042128736\&doi=10.3390\%2fw10020197\&partnerID=40\&md5=011c807064b5190981e24ff832e8036e},
	author = {Tal, A.}
}
@article {Boualouch201843,
	title = {Adrc performance in power control of dfig used in wind turbine during grid voltage fault 1},
	journal = {International Journal of Control and Automation},
	volume = {11},
	number = {9},
	year = {2018},
	pages = {43-56},
	doi = {10.14257/ijca.2018.11.9.05},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85055058735\&doi=10.14257\%2fijca.2018.11.9.05\&partnerID=40\&md5=a603393239c902b7c67ead9deaa9b7be},
	author = {Boualouch, A. and Essadki, A. and Nasser, T. and Frigui, A. and Boukhriss, A.}
}
@conference {Nadour2018,
	title = {Advanced Backstepping Control of a Wind Energy Conversion System Using a Doubly-Fed Induction Generator},
	booktitle = {Proceedings of 2017 International Renewable and Sustainable Energy Conference, IRSEC 2017},
	year = {2018},
	doi = {10.1109/IRSEC.2017.8477276},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85055893932\&doi=10.1109\%2fIRSEC.2017.8477276\&partnerID=40\&md5=19ab86d1cd91b5dca66932022a6df89c},
	author = {Nadour, M. and Essadki, A. and Fdaili, M. and Nasser, T.}
}
@conference {Merabet2018,
	title = {Agent Based for Comfort Control in Smart Building},
	booktitle = {Proceedings of 2017 International Renewable and Sustainable Energy Conference, IRSEC 2017},
	year = {2018},
	doi = {10.1109/IRSEC.2017.8477369},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85055877172\&doi=10.1109\%2fIRSEC.2017.8477369\&partnerID=40\&md5=2dc94c616f3a389199b82511a64ae60e},
	author = {Merabet, G.H. and Essaaidi, M. and Brak, M.E. and Benhaddou, D.}
}
@conference {Cherqi201879,
	title = {Analysis of hacking related trade in the darkweb},
	booktitle = {2018 IEEE International Conference on Intelligence and Security Informatics, ISI 2018},
	year = {2018},
	pages = {79-84},
	doi = {10.1109/ISI.2018.8587311},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85061056307\&doi=10.1109\%2fISI.2018.8587311\&partnerID=40\&md5=3f2dbe2fc3377bce7e35dd18dfb3710f},
	author = {Cherqi, O. and Mezzour, G. and Ghogho, M. and El Koutbi, M.}
}
@article {Rezzouqi20181145,
	title = {Analyzing the accuracy of historical average for urban traffic forecasting using google maps},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {868},
	year = {2018},
	pages = {1145-1156},
	doi = {10.1007/978-3-030-01054-6_79},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85057079293\&doi=10.1007\%2f978-3-030-01054-6_79\&partnerID=40\&md5=5c985c898807cd5eb68ed52c62ea6335},
	author = {Rezzouqi, H. and Gryech, I. and Sbihi, N. and Ghogho, M. and Benbrahim, H.}
}
@article {Ouaddi2018306,
	title = {Ant colony system for dynamic vehicle routing problem with overtime},
	journal = {International Journal of Advanced Computer Science and Applications},
	volume = {9},
	number = {6},
	year = {2018},
	pages = {306-315},
	doi = {10.14569/IJACSA.2018.090644},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85049537762\&doi=10.14569\%2fIJACSA.2018.090644\&partnerID=40\&md5=05f62f74b7943a59ae4ebc2b7d73e82e},
	author = {Ouaddi, K. and Benadada, Y. and Mhada, F.-Z.}
}
@article {Baltzegar2018S81,
	title = {Anticipating complexity in the deployment of gene drive insects in agriculture},
	journal = {Journal of Responsible Innovation},
	volume = {5},
	year = {2018},
	pages = {S81-S97},
	doi = {10.1080/23299460.2017.1407910},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85045066962\&doi=10.1080\%2f23299460.2017.1407910\&partnerID=40\&md5=b708d0e8dc54ba63bf7d1d406a3bad2f},
	author = {Baltzegar, J. and Cavin Barnes, J. and Elsensohn, J.E. and Gutzmann, N. and Jones, M.S. and King, S. and Sudweeks, J.}
}
@conference {Bouanane20181,
	title = {Application of a hybrid genetic algorithm to solve the multi-depots vehicle routing problem with simultaneous delivery and pickup and inventory restrictions},
	booktitle = {Proceedings - GOL 2018: 4th IEEE International Conference on Logistics Operations Management},
	year = {2018},
	pages = {1-9},
	doi = {10.1109/GOL.2018.8378106},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85049947252\&doi=10.1109\%2fGOL.2018.8378106\&partnerID=40\&md5=240f0beb68a3722acd4bda2c68a205d0},
	author = {Bouanane, K. and Benadada, Y. and Bencheikh, G.}
}
@conference {Boulmrharj201856,
	title = {Approach for dimensioning stand-alone photovoltaic systems},
	booktitle = {Energy Procedia},
	volume = {153},
	year = {2018},
	pages = {56-61},
	doi = {10.1016/j.egypro.2018.10.058},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85057433465\&doi=10.1016\%2fj.egypro.2018.10.058\&partnerID=40\&md5=b03f45460b45700ebfe92eb2f1b70e53},
	author = {Boulmrharj, S. and NaitMalek, Y. and Elmouatamid, A. and Bakhouya, M. and Ouladsine, R. and Zine-Dine, K. and Khaidar, M. and Abid, R.}
}
@conference {Maqboul2018,
	title = {An approach of data-driven framework alignment to knowledge base},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2018},
	doi = {10.1145/3230905.3230932},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85053484574\&doi=10.1145\%2f3230905.3230932\&partnerID=40\&md5=b0a8e6bad66d7d889e766b86f11e7217},
	author = {Maqboul, J. and Bounabat, B.}
}
@conference {Sinif2018135,
	title = {Approaching an optimizing open linked government data portal},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2018},
	pages = {135-139},
	doi = {10.1145/3289100.3289122},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85058647467\&doi=10.1145\%2f3289100.3289122\&partnerID=40\&md5=b10fb1fb5f7a72db5f34b00e7a642633},
	author = {Sinif, L. and Bounabat, B.}
}
@conference {Moumen2018,
	title = {Arabic diacritization with gated recurrent unit},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2018},
	doi = {10.1145/3230905.3230931},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85053484931\&doi=10.1145\%2f3230905.3230931\&partnerID=40\&md5=3a401539dc4a1f24a5a97d1b3fdc8e36},
	author = {Moumen, R. and Chiheb, R. and Afia, A.E. and Faizi, R.}
}
@article {Boukhayma2018882,
	title = {Assessing decision support systems success: A conceptual analysis},
	journal = {International Journal of Civil Engineering and Technology},
	volume = {9},
	number = {13},
	year = {2018},
	pages = {882-889},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85059574985\&partnerID=40\&md5=777c381eb0e1c33a719dc4dfa846e39f},
	author = {Boukhayma, K. and Elmanouar, A.}
}
@article {Yousfi201864,
	title = {Assessing the performance of a new semantic similarity measure designed for schema matching for mediation systems},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {11055 LNAI},
	year = {2018},
	pages = {64-74},
	doi = {10.1007/978-3-319-98443-8_7},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85053199922\&doi=10.1007\%2f978-3-319-98443-8_7\&partnerID=40\&md5=18d7047f60af1c46cb3beaeb2b8d7e9a},
	author = {Yousfi, A. and Elyazidi, M.H. and Zellou, A.}
}
@article {Hassen2018,
	title = {Assessment of genetic diversity and bioremediation potential of pseudomonads isolated from pesticide-contaminated artichoke farm soils},
	journal = {3 Biotech},
	volume = {8},
	number = {6},
	year = {2018},
	doi = {10.1007/s13205-018-1256-5},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85047222547\&doi=10.1007\%2fs13205-018-1256-5\&partnerID=40\&md5=214af9fe1c89045eedc77e9e648d892e},
	author = {Hassen, W. and Neifar, M. and Cherif, H. and Mahjoubi, M. and Souissi, Y. and Raddadi, N. and Fava, F. and Cherif, A.}
}
@conference {Maarof2018,
	title = {Authentication protocol for securing internet of things},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2018},
	doi = {10.1145/3234698.3234727},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85052520501\&doi=10.1145\%2f3234698.3234727\&partnerID=40\&md5=aa4a50dc34245080536baf0939bbbde6},
	author = {Maarof, A. and Senhadji, M. and Labbi, Z. and Belkasmi, M.}
}
@conference {Benouda20181,
	title = {Automatic code generation within MDA approach for cross-platform mobiles apps},
	booktitle = {Proceedings of EDIS 2017 - 1st International Conference on Embedded and Distributed Systems},
	volume = {2017-December},
	year = {2018},
	pages = {1-5},
	doi = {10.1109/EDIS.2017.8284045},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85050342787\&doi=10.1109\%2fEDIS.2017.8284045\&partnerID=40\&md5=a91e72b83d0260e52818eee5dcb6c6fe},
	author = {Benouda, H. and Azizi, M. and Moussaoui, M. and Esbai, R.}
}
@conference {Elallaoui201842,
	title = {Automatic Transformation of User Stories into UML Use Case Diagrams using NLP Techniques},
	booktitle = {Procedia Computer Science},
	volume = {130},
	year = {2018},
	pages = {42-49},
	doi = {10.1016/j.procs.2018.04.010},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85051264456\&doi=10.1016\%2fj.procs.2018.04.010\&partnerID=40\&md5=d44ab6d79a8fcda72baf908a3834a293},
	author = {Elallaoui, M. and Nafil, K. and Touahni, R.}
}
@conference {Muenster2018,
	title = {Autonomy and the future of transportation},
	booktitle = {AUVSI XPONENTIAL 2018},
	year = {2018},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85054646462\&partnerID=40\&md5=b768c0482e51824404999a203338b764},
	author = {Muenster, M.C.}
}
@article {ElHadj201786,
	title = {ABAC rule reduction via similarity computation},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {10299 LNCS},
	year = {2017},
	note = {cited By 0},
	pages = {86-100},
	abstract = {Attribute-based access control (ABAC) represents a generic model of access control that provides a high level of flexibility and promotes information and security sharing. Since ABAC considers a large set of attributes for access decisions, using it might get very complicated for large systems. Hence, it is interesting to offer techniques to reduce the number of rules in ABAC policies without affecting the final decision. In this paper, we present an approach based on K-nearest neighbors algorithms for clustering ABAC policies. To the best of our knowledge, it is the first approach that aims to reduce the number of policy rules based on similarity computations. Our evaluation results demonstrate the efficiency of the suggested approach. For instance, the reduction rate can reach up to 10\% for an ABAC policy with more than 9000 rules. {\textcopyright} Springer International Publishing AG 2017.},
	doi = {10.1007/978-3-319-59647-1_7},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85019735144\&doi=10.1007\%2f978-3-319-59647-1_7\&partnerID=40\&md5=948de8bee1016664b63163965c4e41fa},
	author = {El Hadj, M.A. and Benkaouz, Y. and Freisleben, B. and Erradi, M.}
}
@conference {Khelifa2017211,
	title = {An accurate HSMM-based system for Arabic phonemes recognition},
	booktitle = {9th International Conference on Advanced Computational Intelligence, ICACI 2017},
	year = {2017},
	note = {cited By 1},
	pages = {211-216},
	abstract = {The majority of successful automatic speech recognition (ASR) systems utilize a probabilistic modeling of the speech signal via hidden Markov models (HMMs). In a standard HMM model, state duration probabilities decrease exponentially with time, which fails to satisfactorily describe the temporal structure of speech. Incorporating explicit state durational probability distribution functions (pdf) into the HMM is a famous solution to overcome this feebleness. This way is well-known as a hidden semi-Markov model (HSMM). Previous papers have confirmed that using HSMM models instead of the standard HMMs have enhanced the recognition accuracy in many targeted languages. This paper addresses an important stage of our on-going work which aims to construct an accurate Arabic recognizer for teaching and learning purposes. It presents an implementation of an HSMM model whose principal goal is improving the classical HMM{\textquoteright}s durational behavior. In this implementation, the Gaussian distribution is used for modeling state durations. Experiments have been carried out on a particular Arabic speech corpus collected from recitations of the Holy Quran. Results show an increase in recognition accuracy by around 1\% We confirmed via these results that such a system outperforms the baseline HTK when the Gaussian distribution is integrated into the HTK{\textquoteright}s recognizer back-end. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/ICACI.2017.7974511},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85027464290\&doi=10.1109\%2fICACI.2017.7974511\&partnerID=40\&md5=169e067b67861858798f016d82e0e080},
	author = {Khelifa, M.O.M. and Belkasmi, M. and Abdellah, Y. and Elhadj, Y.O.M.}
}
@conference {Benqatla2017,
	title = {Actor network theory a framework of it collaboration},
	booktitle = {Proceedings - 2017 International Conference on Wireless Networks and Mobile Communications, WINCOM 2017},
	year = {2017},
	note = {cited By 0},
	abstract = {Collaboration between organization changes dynamically and spreads rapidly through a Collaborative Network (CN). Developing methods for handling such networks of collaboration on a real scale requires modeling social interactions between different actors in order to share, analyze, and suggest improvements for a collaboration perspective. This paper describes a new tool for collaboration modeling based on Actor Network Theory. *ANTCollab system is based on Actor Network Theory and Game Theory algorithm that efficiently provides abstract models of collaboration between different actors aiming at uncovering cost allocations concerns. We demonstrate the effectiveness of our approach with a real case study. The analyze of the *interessement phase reveals that we are able to increase the cost saving objectives within a collaborative mode. We also present a what-if simulation feature to assess the impact of scenarios related to future collaboration evolution. Furthermore, we provide a live deployment of the *ANTCollab system that allows users to explore the dynamics of collaboration networks in place as well as their involvement over time. {\textcopyright}2017 IEEE.},
	doi = {10.1109/WINCOM.2017.8238192},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041441057\&doi=10.1109\%2fWINCOM.2017.8238192\&partnerID=40\&md5=2fd0079935c6f9ed952e02c6a4dcee0a},
	author = {Benqatla, M.S. and Chikhaoui, D. and Bounabat, B.}
}
@conference {Mancour2017122,
	title = {An analysis approach for distributed generation placement and sizing in power distribution system},
	booktitle = {ACM International Conference Proceeding Series},
	volume = {Part F130526},
	year = {2017},
	note = {cited By 0},
	pages = {122-126},
	abstract = {This paper proposes a new analytical approach which investigates the effect of distributed generation (DG) in power distribution system. This approach for DG placement and sizing in power distribution system mainly helps to minimize the power loss of the system, to improve the voltage profile, then to reduce the thermal capacity of the main feeder and to better regulate the voltage. The proposed analytical approach is based on both Newton Raphson load flow and loss sensitivity factor. One type of DG is considered including DG supplying real power only. IEEE 33 bus, 5 bus and 14 bus Test systems are used for achieving results and validating the proposed method under Matlab/Simulink environment. The obtained simulation results show the effectiveness of the proposed methodology. {\textcopyright} 2017 Association for Computing Machinery.},
	doi = {10.1145/3128128.3128147},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85030313740\&doi=10.1145\%2f3128128.3128147\&partnerID=40\&md5=526f08598255b4969c7a4a84df04090a},
	author = {Mancour, A.A. and Nasser, T.}
}
@conference {ElBouyahyiouy2017142,
	title = {An ant colony optimization algorithm for solving the full truckload vehicle routing problem with profit},
	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 = {142-147},
	abstract = {This paper proposes an ant colony optimization (ACO) to solve the full-truckload selective multi-depot vehicle routing problem under time windows constraints (denoted by FT-SMDVRPTW). The objective is to construct a solution composed of a set of routes associated with the trucks, aiming at maximizing the total profit. Each order is a pickup and delivery order associated with an origin, a destination, two time windows, and a price for serving the order paid by its corresponding shipper. Each route is a sequence of selected orders to serve so that the operational constraints are respected. Our problem appears clearly when the vehicles return back. It is not obligatory to serve all orders. The motivation of this study is to solve this problem by using an ant colony optimization metaheuristic, called ant colony system, which was originally implemented for solving the basic vehicle routing problem (VRP). We modify the algorithm to incorporate a robust optimization methodology, so that the full truckload can be handled. Finally, we give a numerical example on a randomly generated instance to illustrate our approach. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/LOGISTIQUA.2017.7962888},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85026628672\&doi=10.1109\%2fLOGISTIQUA.2017.7962888\&partnerID=40\&md5=88873263b0addef95537c20e4fe48482},
	author = {El Bouyahyiouy, K. and Bellabdaoui, A.}
}
@conference {Ouaddi2017,
	title = {Ant colony system approach for dynamic vehicles routing problem multi tours},
	booktitle = {ACM International Conference Proceeding Series},
	volume = {Part F129474},
	year = {2017},
	note = {cited By 0},
	abstract = {In reality, many transport companies give the possibility to use an overtime to complete the service. However, this concept is less treated in the literature of the VRP in general and of the DVRP in particular. This paper presents an approach, based on the ant colony system, which treats this concept for multi-tours DVRP. A mathematical model of this variable is then proposed. Computational results are given in a version without overtime in addition to some first results of the version with overtime. {\textcopyright} 2017 Association for Computing Machinery.},
	doi = {10.1145/3090354.3090466},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85028464197\&doi=10.1145\%2f3090354.3090466\&partnerID=40\&md5=8544fa68e8eb6ee3c79230c16618f329},
	author = {Ouaddi, K. and Benadada, Y. and Mhada, F.Z.}
}
@conference {Elmagrouni2017183,
	title = {Approach for building Services-Oriented systems adaptable},
	booktitle = {International Conference on Multimedia Computing and Systems -Proceedings},
	year = {2017},
	note = {cited By 0},
	pages = {183-188},
	abstract = {the idea of Service-Oriented Computing (SOC) is to understand users{\textquoteright} requirements for Service-Based Applications (SBAs). We propose an adaptation-centric approach which allows: (i) modeling users{\textquoteright} requirements for Service-Oriented System with the MAP formalism using an Intentional Service Model (ISM); (ii) ontology and the aspect according to the contextual changes in order to inject it in the process BPEL; and (iii) provides architecture for a support tool. We validate our approach by performing experiments on an e-tourism application. The result is an adaptation framework that can guide software engineers in developing adaptable service-based applications. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ICMCS.2016.7905656},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85019081198\&doi=10.1109\%2fICMCS.2016.7905656\&partnerID=40\&md5=b1e0b0e89c0b7830843863427a849a52},
	author = {Elmagrouni, I. and Lethrech, M. and Kenzi, A. and Kriouile, A.}
}
@conference {Uahhabi2017196,
	title = {An approach for evaluating trust in X.509 certificates},
	booktitle = {2016 11th International Conference for Internet Technology and Secured Transactions, ICITST 2016},
	year = {2017},
	note = {cited By 0},
	pages = {196-203},
	abstract = {Today, X.509 certificates is largely adopted for the identity verification of an entity. Such organizations and people use it to confirm their identities in online transaction. Then, it is necessary to verify the certificate trustworthiness in order to accept or reject it for a particular transaction. Besides, certificates are issued by the certificate authority based on the procedures which are described in a certificate policy. Any deficiency in these procedures may influence a certificate authority trustworthiness, which creates a trust lack in the certificates signed by this authority. In this context, relying parties need an automated mechanism to evaluate a trust level of certificate which come into question. In this paper, we grant them this mechanism to have information about its trustworthiness. In fact, we propose a trust framework architecture which is composed from the several components involved in the trust level calculation. Then, we suggest a trust level calculation algorithm which is based on three parameters that are the calculated CA trust level, the quality of procedures indicated in the certificate policy and the rating assigned to certification fields content. Our proposed solution allows relying parties to make a decision about certificate trustworthiness. {\textcopyright} 2016 Infonomics Society.},
	doi = {10.1109/ICITST.2016.7856696},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85016048915\&doi=10.1109\%2fICITST.2016.7856696\&partnerID=40\&md5=42f7fb997d91b0a60af3a975522fb836},
	author = {Uahhabi, Z.E. and Bakkali, H.E.}
}
@conference {Khaldi2017,
	title = {Artificial neural network based approach for blood demand forecasting: Fez transfusion blood center case study},
	booktitle = {ACM International Conference Proceeding Series},
	volume = {Part F129474},
	year = {2017},
	note = {cited By 0},
	abstract = {Blood demand and supply management are considered one of the major components of a healthcare supply chain, since blood is a vital element in preserving patient{\textquoteright}s life. However, forecasting it faces several challenges including frequent shortages, and possible expiration caused by demand uncertainty of hospitals. This uncertainty is mainly due to high variability in the number of emergency cases. Thereupon, this investigation presents a real case study of forecasting monthly demand of three blood components, using Artificial Neural Networks (ANNs). The demand of the three blood components (red blood cells (RBC), plasma (CP) and platelets (PFC)) and other observations are obtained from a central transfusion blood center and a University Hospital. Experiments are carried out using three networks to forecast each blood component separately. Last, the presented model is compared with ARIMA to evaluate its performance in prediction. The results of this study depict that ANN models overcomes ARIMA models in demand forecasting. Thus high ANN models can be considered as a promising approach in forecasting monthly blood demand. {\textcopyright} 2017 Association for Computing Machinery.},
	doi = {10.1145/3090354.3090415},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85028449243\&doi=10.1145\%2f3090354.3090415\&partnerID=40\&md5=7ab92ea6ba7c2f5837ee88fcb2a91ffc},
	author = {Khaldi, R. and El Afia, A. and Chiheb, R. and Faizi, R.}
}
@article {Ayache2017166,
	title = {Aspect-oriented state machines for resolving conflicts in XACML policies},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {10299 LNCS},
	year = {2017},
	note = {cited By 0},
	pages = {166-171},
	abstract = {Authorizationin collaborativesystemsisdefinedbyaglobal policy that represents the combination of the collaborators{\textquoteright} access policies. However, the enforcement of such a global policy may create conflicting authorization decisions. In this paper, we categorize two types of conflicts that may occur in such policies. Furthermore, to resolve these conflicts and to reach a unique decision for an access request, we present an approach that uses XACML policy combining algorithms and considers the category of the detected conflicts. The approach is implemented using aspect-oriented finite state machines. {\textcopyright} Springer International Publishing AG 2017.},
	doi = {10.1007/978-3-319-59647-1_13},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85019731058\&doi=10.1007\%2f978-3-319-59647-1_13\&partnerID=40\&md5=917cf51c38e853e2423ad411ec1ecadb},
	author = {Ayache, M. and Erradi, M. and Freisleben, B. and Khoumsi, A.}
}
@conference {Zouina20171615,
	title = {An aspiring solution to the MITM bootstrap vulnerability},
	booktitle = {Proceedings of the 29th International Business Information Management Association Conference - Education Excellence and Innovation Management through Vision 2020: From Regional Development Sustainability to Global Economic Growth},
	year = {2017},
	note = {cited By 0},
	pages = {1615-1622},
	abstract = {The proposed work falls within the context of improving data security for m-commerce (mobile commerce) systems. In this context we have placed under the light some flaws encountered in HTTPS (Hypertext Transfer Protocol Secure) the most used m-commerce protocol, particularly the man in the middle attack, shortly MITM. The man in the middle attack is an active listening attack; the idea of this attack is to target the handshake phase of the HTTPS protocol which is the transition from a non-secure connection to a secure connection in our case HTTP (Hypertext Transfer Protocol) to HTTPS. This paper proposes a solution to fix those flaws based on the upgrade of HSTS (HTTP Strict Transport Security) standard handshake sequence using the DNSSEC standard (Domain Name System Security Extensions).},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85029759601\&partnerID=40\&md5=963ec95920c1fef56bbbb9224b5f2501},
	author = {Zouina, M. and Outtaj, B.}
}
@conference {Routaib2017732,
	title = {An asymmetrical nash bargaining for adaptive and automated context negotiation in pervasive environments},
	booktitle = {2017 14th IEEE Annual Consumer Communications and Networking Conference, CCNC 2017},
	year = {2017},
	note = {cited By 0},
	pages = {732-736},
	abstract = {To cope with the energy performance concern of pervasive and Internet-of-Thing (IoT) devices, current pervasive systems require intelligent algorithms that can change the behavior of the devices and the overall network. Making the devices aware of their states and able to adjust their operative modes using context information has the potential to achieve better energy performance. Context information is typically obtained from environmental sensors, device sensors, and from external sources. In this work, we study the marketing of context-aware services through an adaptive context negotiation model. The negotiation process between context consumers and one or several context providers aims to satisfy the preferences of each the negotiating party concerning the quality-of-context (QoC) levels required by the context consumer. The proposed negotiation model uses an asymmetrical {\textquoteright}Power Bargaining{\textquoteright} model in which each negotiating party can influence the other party. It implements a learning algorithm for a symmetrical bargaining model. Numerical evaluation of the model shows the convergence of the Nash Bargaining Solution (NBS) by using a learning algorithm. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/CCNC.2017.7983225},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85027412664\&doi=10.1109\%2fCCNC.2017.7983225\&partnerID=40\&md5=70dd3b4a091642d07bcfa73b03f0fd96},
	author = {Routaib, H. and Badidi, E. and Sabir, E. and Elkoutbi, M.}
}
@conference {Illi2017855,
	title = {Asymptotic analysis of underwater communication system subject to κ-μ Shadowed fading channel},
	booktitle = {2017 13th International Wireless Communications and Mobile Computing Conference, IWCMC 2017},
	year = {2017},
	note = {cited By 0},
	pages = {855-860},
	abstract = {In this paper, a unified performance analysis of underwater wireless communication system is presented. The radio link between the source (S) and the destination (D) is subject to κ-μ shadowed fading channel. We present an analytical closed-form expression for the cumulative distribution function (CDF) and the probability density function (PDF) of the total end-to-end SNR in terms of the Kummer{\textquoteright}s Hypergeometric function. Based on these results, we present exact closed-form expressions of communication system performance criteria, such as outage probability (OP) and average bit/symbol error rate (ABER/ASER) with their respective asymptotic expansion, at both low and high SNR regimes, expressed in terms of basic elementary functions. All the derived analytical expressions are validated through computer-based simulation. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/IWCMC.2017.7986397},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85027884347\&doi=10.1109\%2fIWCMC.2017.7986397\&partnerID=40\&md5=c5c5b9d26646e4c5a9f570c929975baf},
	author = {Illi, E. and El Bouanani, F. and Ayoub, F.}
}
@conference {Maarof2017,
	title = {Authentication protocol conforming to EPC class-1 Gen-2 standard},
	booktitle = {2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 - Proceedings},
	year = {2017},
	note = {cited By 0},
	abstract = {A Radio Frequency Identification (RFID) system is a contactless automatic identification system that uses small and low-cost tags. The restricted computation ability and limited memory space of low-cost tags make existing RFID systems vulnerable. EPC Class 1 Generation 2 (EPC-C1G2) is the most popular standard for low cost passive RFID tags. For improving security of this standard; many security schemes are designed for RFID system since the release of the EPC-C1G2. In 2012, Yoon et al. proposed a new RFID authentication protocol conforming to EPC-C1G2 standard. This paper discuss Yoon et al.{\textquoteright}s protocol, which is conforming to EPC-C1G2 standard, and shows that it suffers from common attack and computational and communication cost. Then we present our enhanced protocol which improves the security, reduce the complexity and increase the performance of identification systems efficiently. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ACOSIS.2016.7843915},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015189847\&doi=10.1109\%2fACOSIS.2016.7843915\&partnerID=40\&md5=497b5f1e05260548d29eb5491926b3ce},
	author = {Maarof, A. and Senhadji, M. and Labbi, Z. and Belkasmi, M.}
}
@conference {Er-Rady2017,
	title = {Automatic sign language recognition: A survey},
	booktitle = {Proceedings - 3rd International Conference on Advanced Technologies for Signal and Image Processing, ATSIP 2017},
	year = {2017},
	note = {cited By 0},
	abstract = {Sign Language, which is a fully visual language with its own grammar, differs largely from that of spoken languages [21]. After nearly 30 years of research, SL recognition still in its infancy when compared to Automatic Speech Recognition. When producing Sign language (SL), different body parts are involved. Most importantly the hands, but also facial expressions and body movements/postures. The recognition of SL is still one of the most challenging problems in gesture recognition. In this survey, we are going to discuss the advancement of sign language recognition through the last decade. In this paper, we provide a review of the state-of-the-art building blocks of Automatic Sign Language Recognition (ASLR) system, from feature extraction up to sign. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/ATSIP.2017.8075561},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85035355057\&doi=10.1109\%2fATSIP.2017.8075561\&partnerID=40\&md5=2dda585a2de8f963b1f1f0cc678e01d3},
	author = {Er-Rady, A. and Faizi, R. and Thami, R.O.H. and Housni, H.}
}
@conference { ISI:000389502600042,
	title = {ABAC Model for Collaborative Cloud Services},
	booktitle = {Networked Systems, NETYS 2016},
	series = {Lecture Notes in Computer Science},
	volume = {9944},
	year = {2016},
	note = {4th International Conference on Networked Systems (NETYS), Marrakech, MOROCCO, MAY 18-20, 2016},
	pages = {385},
	isbn = {978-3-319-46140-3; 978-3-319-46139-7},
	issn = {0302-9743},
	author = {Madani, Mohamed Amine and Erradi, Mohammed},
	editor = {Abdulla, PA and DelporteGallet, C}
}
@article { ISI:000365798200003,
	title = {Accuracy Comparison of Analogy-Based Software Development Effort Estimation Techniques},
	journal = {INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS},
	volume = {31},
	number = {2, SI},
	year = {2016},
	month = {FEB},
	pages = {128-152},
	abstract = {Estimation by analogy is a commonly used software effort estimation technique and a suitable alternative to other conventional estimation techniques: It predicts the effort of the target project using information from former similar projects. While it is relatively easy to handle numerical attributes, dealing with categorical attributes is one of the most difficult issues for analogy-based estimation techniques. Therefore, we propose, in this paper, a novel analogy-based approach, called 2FA-kprototypes, to predict effort when software projects are described by a mix of numerical and categorical attributes. To this aim, the well-known fuzzy k-prototypes algorithm is integrated into the process of estimation by analogy. The estimation accuracy of 2FA-kprototypes was evaluated and compared with that of two techniques: (1) classical analogy-based technique and (2) 2FA-kmodes, which is a technique that we have developed recently. The comparison was performed using four data sets that are quite diverse and have different sizes: ISBSG, COCOMO, USP05-FT, and USP05-RQ. The results obtained showed that both 2FA-kprototypes and 2FA-kmodes perform better than classical analogy. (C) 2015 Wiley Periodicals, Inc.},
	issn = {0884-8173},
	doi = {10.1002/int.21748},
	author = {Idri, Ali and Amazal, Fatima Azzahra and Abran, Alain}
}
@article {11128948620160201,
	title = {Accuracy Comparison of Analogy-Based Software Development Effort Estimation Techniques.},
	journal = {International Journal of Intelligent Systems},
	volume = {31},
	number = {2},
	year = {2016},
	pages = {128 - 152},
	abstract = {Estimation by analogy is a commonly used software effort estimation technique and a suitable alternative to other conventional estimation techniques: It predicts the effort of the target project using information from former similar projects. While it is relatively easy to handle numerical attributes, dealing with categorical attributes is one of the most difficult issues for analogy-based estimation techniques. Therefore, we propose, in this paper, a novel analogy-based approach, called 2FA-kprototypes, to predict effort when software projects are described by a mix of numerical and categorical attributes. To this aim, the well-known fuzzy k-prototypes algorithm is integrated into the process of estimation by analogy. The estimation accuracy of 2FA-kprototypes was evaluated and compared with that of two techniques: (1) classical analogy-based technique and (2) 2FA-kmodes, which is a technique that we have developed recently. The comparison was performed using four data sets that are},
	keywords = {Algorithms, Artificial intelligence, Computer software development, Fuzzy control systems, Numerical analysis, Prototypes},
	issn = {08848173},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=111289486\&site=ehost-live},
	author = {Idri, Ali and Amazal, Fatima Azzahra and Abran, Alain}
}
@article {Elhadjv20163239,
	title = {An accurate recognizer for basic Arabic sounds},
	journal = {ARPN Journal of Engineering and Applied Sciences},
	volume = {11},
	number = {5},
	year = {2016},
	note = {cited By 0},
	pages = {3239-3243},
	abstract = {This paper is part of an ongoing work aiming to build an accurate Arabic sounds recognizer for teaching and learning purposes. Early phases of this work were dedicated to the development of a particular sound database from recitations of the Holy Quran to cover classical Arabic sounds; speech signals of this sound database were manually segmented and labelled on three levels: Word, phoneme, and allophone. Next, two baseline recognizers were built to validate the speech segmentation on both phoneme and allophone levels and also to test the feasibility of the sounds{\textquoteright} recognition intended target. This current phase considers the development of an elaborated recognizer, by considering the basic sounds and looking for their distinctive features (e.g. duration, energy, etc.) to determine which ones will be particularly helpful to identify the phonological variation of the basic sound. Here, we present the first results of the basic sounds recognition obtained so far. {\textcopyright} 2006-2016 Asian Research Publishing Network (ARPN).},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84961680252\&partnerID=40\&md5=b6050206ac83191694490b10877629ec},
	author = {Elhadjv, Y.O.M.a b and Khelifa, M.O.M.c and Abdellah, Y.d and Belkasmi, M.c}
}
@article {11515935620160506,
	title = {Achieving QoS in Virtual MIMO systems: a satisfaction equilibrium analysis.},
	journal = {EURASIP Journal on Wireless Communications \& Networking},
	volume = {2016},
	number = {1},
	year = {2016},
	pages = {1 - 13},
	abstract = {This paper presents a game theoretic framework to analyze a cellular-WLAN heterogeneous network from a virtual multiple-input multiple-output (VMIMO) perspective. Namely, we restrict to the uplink case and consider a non-cooperative game where each user seeks to meet some quality of service (QoS). Moreover, mobile users are allowed to re-inject, through their WLAN interfaces, a part of their throughput in the induced game. Thus, the interaction among users defines a distributed VMIMO with a possibly throughput exchange. This mechanism will help all users to meet their respective QoS expressed by the perceived average throughput. The average throughput is considered to be the utility function used in this framework. Now, each mobile user experiences a certain throughput composed of two parts: (1) the throughput received from cellular subsystem and (2) the throughput received from WLAN subsystem. Naturally, we use the concept of satisfaction equilibrium to predict the behavior of the ne},
	keywords = {Cellular/WLAN heterogeneous network, Equilibrium {\textendash} Research, Game theory, Game theory {\textendash} Research, MIMO systems {\textendash} Research, Quality of service, Quality of service {\textendash} Research, Satisfaction equilibrium, Virtual multiple input multiple output, Wireless LANs {\textendash} Research},
	issn = {16871472},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=115159356\&site=ehost-live},
	author = {Bennani, Hassan and Sabir, Essaid and Kobbane, Abdellatif and Ben-Othman, Jalel and El-Koutbi, Mohamed}
}
@article {Bennani20161,
	title = {Achieving QoS in Virtual MIMO systems: a satisfaction equilibrium analysis},
	journal = {Eurasip Journal on Wireless Communications and Networking},
	volume = {2016},
	number = {1},
	year = {2016},
	note = {cited By 0},
	pages = {1-13},
	abstract = {This paper presents a game theoretic framework to analyze a cellular-WLAN heterogeneous network from a virtual multiple-input multiple-output (VMIMO) perspective. Namely, we restrict to the uplink case and consider a non-cooperative game where each user seeks to meet some quality of service (QoS). Moreover, mobile users are allowed to re-inject, through their WLAN interfaces, a part of their throughput in the induced game. Thus, the interaction among users defines a distributed VMIMO with a possibly throughput exchange. This mechanism will help all users to meet their respective QoS expressed by the perceived average throughput. The average throughput is considered to be the utility function used in this framework. Now, each mobile user experiences a certain throughput composed of two parts: (1) the throughput received from cellular subsystem and (2) the throughput received from WLAN subsystem. Naturally, we use the concept of satisfaction equilibrium to predict the behavior of the network. Indeed, we provided a sufficient condition for the existence of such an equilibrium. Next, we prove the uniqueness of the equilibrium and compute it explicitly. Afterward, we propose a fully distributed algorithm inspired from the well-known Banach-Picard learning algorithm. Our scheme has many good features facilitating its implementation and usability. Indeed, it accurately converges to the equilibrium (if exists), it is very fast, and it requires no external information. Simulation results validate the algorithm and show its robustness and illustrate numerically the proposed learning scheme for quality-of-service management in such a heterogeneous network. {\textcopyright} 2016, Bennani et al.},
	doi = {10.1186/s13638-016-0612-6},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84966280664\&doi=10.1186\%2fs13638-016-0612-6\&partnerID=40\&md5=e67ac437a619c2d9ac7539dace4426e6},
	author = {Bennani, H.a and Sabir, E.b and Kobbane, A.a and Ben-Othman, J.c and El-koutbi, M.a}
}
@article { ISI:000375569000001,
	title = {Achieving QoS in Virtual MIMO systems: a satisfaction equilibrium analysis},
	journal = {EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING},
	year = {2016},
	month = {MAY 6},
	abstract = {This paper presents a game theoretic framework to analyze a cellular-WLAN heterogeneous network from a virtual multiple-input multiple-output (VMIMO) perspective. Namely, we restrict to the uplink case and consider a non-cooperative game where each user seeks to meet some quality of service (QoS). Moreover, mobile users are allowed to re-inject, through their WLAN interfaces, a part of their throughput in the induced game. Thus, the interaction among users defines a distributed VMIMO with a possibly throughput exchange. This mechanism will help all users to meet their respective QoS expressed by the perceived average throughput. The average throughput is considered to be the utility function used in this framework. Now, each mobile user experiences a certain throughput composed of two parts: (1) the throughput received from cellular subsystem and (2) the throughput received from WLAN subsystem. Naturally, we use the concept of satisfaction equilibrium to predict the behavior of the network. Indeed, we provided a sufficient condition for the existence of such an equilibrium. Next, we prove the uniqueness of the equilibrium and compute it explicitly. Afterward, we propose a fully distributed algorithm inspired from the well-known Banach-Picard learning algorithm. Our scheme has many good features facilitating its implementation and usability. Indeed, it accurately converges to the equilibrium (if exists), it is very fast, and it requires no external information. Simulation results validate the algorithm and show its robustness and illustrate numerically the proposed learning scheme for quality-of-service management in such a heterogeneous network.},
	issn = {1687-1499},
	doi = {10.1186/s13638-016-0612-6},
	author = {Bennani, Hassan and Sabir, Essaid and Kobbane, Abdellatif and Ben-Othman, Jalel and El-Koutbi, Mohamed}
}
@conference {Elmagrouni2016223,
	title = {Adaptation services-oriented systems lifecycle},
	booktitle = {ICEIS 2016 - Proceedings of the 18th International Conference on Enterprise Information Systems},
	volume = {1},
	year = {2016},
	note = {cited By 0},
	pages = {223-231},
	abstract = {This work presents the approach of the Development of adaptable Services-oriented Systems. Not the only adaptability is important for the survival and success of Services-oriented Systems, but it is also important for the rapid changes in technology, organizational structure, human perception and needs. This paper discusses the shortcomings of current solutions for adaptive service-oriented System. To address those shortcomings, some techniques are used to build and evolve proactive Services-oriented Systems. Using those techniques in an integrated way is described along the phases of the service lifecycle. Copyright {\textcopyright} 2016 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84979595897\&partnerID=40\&md5=1993aed0e5aeac8391f702bdf1abe443},
	author = {Elmagrouni, I.a and Kenzi, A.b and Lethrech, M.a and Kriouile, A.a}
}
@conference {ElHamlaoui201618,
	title = {Alignment of viewpoint heterogeneous design models: "Emergency Department" Case Study},
	booktitle = {CEUR Workshop Proceedings},
	volume = {1731},
	year = {2016},
	note = {cited By 0},
	pages = {18-27},
	abstract = {Generally, various models can be used to describe a given application domain on different aspects and thus give rise to several views. To have a complete view of the application domain, heterogeneous models need to be unified, which is a hard task to do. To tackle this problem, we have proposed a method to relate partial models without combining them in a single model. In our approach, partial models are organized as a network of models through a virtual global model called M1C (Model of correspondences between models) which conforms to a ubiquitous language based on a Meta-Model of Correspondences (MMC). This paper presents an application of our method to an "Emergency Department" case study. It has been performed as a collaborative process involving model designers and a supervisor. The focus is put on the building of the M1C model from 3 partial models.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84999098977\&partnerID=40\&md5=f0512c94d99ecc99fcd8fc9336ce1668},
	author = {El Hamlaoui, M.a b and Coulette, B.b and Ebersold, S.b and Bennani, S.a and Nassar, M.a and Anwar, A.e and Beugnard, A.c and Bach, J.C.c and Jamoussi, Y.d and Tran, H.N.b}
}
@article {11714990120160901,
	title = {ANALYSIS AND VERIFICATION OF XACML POLICIES IN A MEDICAL CLOUD ENVIRONMENT.},
	journal = {Scalable Computing: Practice \& Experience},
	volume = {17},
	number = {3},
	year = {2016},
	pages = {189 - 205},
	abstract = {The connectivity of devices, machines and people via Cloud infrastructure can support collaborations among doctors and specialists from different medical organisations. Such collaborations may lead to data sharing and joint tasks and activities. Hence, the collaborating organisations are responsible for managing and protecting data they share. Therefore, they should define a set of access control policies regulating the exchange of data they own. However, existing Cloud services do not offer tools to analyse these policies. In this paper, we propose a Cloud Policy Verification Service (CPVS) for the analysis and the verification of access control policies specified using XACML. The analysis process detects anomalies at two policy levels: a) intra-policy: detects discrepancies between rules within a single security policy (conflicting rules and redundancies), and b) interpolicies: detects anomalies between several security policies such as inconsistency and similarity. The verification},
	keywords = {Automata, Cloud computing, Completeness, Data security, Formal Verification, Information storage \& retrieval systems {\textendash} Medical care, Security Anomaly Detection, XACML Policies},
	issn = {18951767},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=117149901\&site=ehost-live},
	author = {Ayache, Meryeme and Erradi, Mohammed and Khoumsi, Ahmed and Freisleben, Bernd}
}
@article { ISI:000389146000004,
	title = {ANALYSIS AND VERIFICATION OF XACML POLICIES IN A MEDICAL CLOUD ENVIRONMENT},
	journal = {Scalable Computing-Practice and Experience},
	volume = {17},
	number = {3, SI},
	year = {2016},
	month = {SEP},
	pages = {189-205},
	abstract = {The connectivity of devices, machines and people via Cloud infrastructure can support collaborations among doctors and specialists from different medical organisations. Such collaborations may lead to data sharing and joint tasks and activities. Hence, the collaborating organisations are responsible for managing and protecting data they share. Therefore, they should define a set of access control policies regulating the exchange of data they own. However, existing Cloud services do not offer tools to analyse these policies. In this paper, we propose a Cloud Policy Verification Service (CPVS) for the analysis and the verification of access control policies specified using XACML. The analysis process detects anomalies at two policy levels: a) intra-policy: detects discrepancies between rules within a single security policy (conflicting rules and redundancies), and b) inter policies: detects anomalies between several security policies such as inconsistency and similarity. The verification process consists in verifying the completeness property which guarantees that each access request is either accepted or denied by the access control policy. In order to demonstrate the efficiency of our method, we also provide the time and space complexities. Finally, we present the implementation of our method and demonstrate how efficiently our approach can detect policy anomalies.},
	issn = {1895-1767},
	doi = {10.12694/scpe.v17i3.1180},
	author = {Ayache, Meryeme and Erradi, Mohammed and Khoumsi, Ahmed and Freisleben, Bernd}
}
@article {Ayache2016189,
	title = {Analysis and verification of XACML policies in a medical cloud environment},
	journal = {Scalable Computing},
	volume = {17},
	number = {3},
	year = {2016},
	note = {cited By 2},
	pages = {189-205},
	abstract = {The connectivity of devices, machines and people via Cloud infrastructure can support collaborations among doctors and specialists from different medical organisations. Such collaborations may lead to data sharing and joint tasks and activities. Hence, the collaborating organisations are responsible for managing and protecting data they share. Therefore, they should define a set of access control policies regulating the exchange of data they own. However, existing Cloud services do not offer tools to analyse these policies. In this paper, we propose a Cloud Policy Verification Service (CPVS) for the analysis and the verification of access control policies specified using XACML. The analysis process detects anomalies at two policy levels: a) intra-policy: detects discrepancies between rules within a single security policy (conflicting rules and redundancies), and b) interpolicies: detects anomalies between several security policies such as inconsistency and similarity. The verification process consists in verifying the completeness property which guarantees that each access request is either accepted or denied by the access control policy. In order to demonstrate the efficiency of our method, we also provide the time and space complexities. Finally, we present the implementation of our method and demonstrate how efficiently our approach can detect policy anomalies. {\textcopyright} 2016 SCPE.},
	doi = {10.12694/scpe.v17i3.1180},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84986332574\&doi=10.12694\%2fscpe.v17i3.1180\&partnerID=40\&md5=86b782c01a2231027ed2e7308e178385},
	author = {Ayache, M.a and Erradi, M.a and Khoumsi, A.b and Freisleben, B.c}
}
@conference { ISI:000381755100012,
	title = {Applying Encryption Algorithm for Data Security in Cloud Storage},
	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 = {141-154},
	abstract = {This paper proposes a simple, secure, and privacy-preserving architecture for inter-Cloud data sharing based on an encryption/decryption algorithm which aims to protect the data stored in the cloud from the unauthorized access.},
	isbn = {978-981-287-990-5; 978-981-287-989-9},
	issn = {1876-1100},
	doi = {10.1007/978-981-287-990-5\_12},
	author = {Kartit, Zaid and Azougaghe, Ali and Kamal Idrissi, H. and El Marraki, M. and Hedabou, M. and Belkasmi, M. and Kartit, A.},
	editor = {Sabir, E and Medromi, H and Sadik, M}
}
@article {Kartit2016141,
	title = {Applying encryption algorithm for data security in cloud storage},
	journal = {Lecture Notes in Electrical Engineering},
	volume = {366},
	year = {2016},
	note = {cited By 0},
	pages = {141-154},
	abstract = {This paper proposes a simple, secure, and privacy-preserving architecture for inter-Cloud data sharing based on an encryption/decryption algorithm which aims to protect the data stored in the cloud from the unauthorized access. {\textcopyright} Springer Science+Business Media Singapore 2016.},
	doi = {10.1007/978-981-287-990-5_12},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959117395\&doi=10.1007\%2f978-981-287-990-5_12\&partnerID=40\&md5=5e4a7f778a62fb9bb090db998cc47f86},
	author = {Kartit, Z.a and Azougaghe, A.b and Idrissi, H.K.a and Marraki, M.E.a and Hedabou, M.c and Belkasmi, M.b and Kartit, A.d}
}
@conference { ISI:000389502600019,
	title = {An Approach to Resolve NP-Hard Problems of Firewalls},
	booktitle = {Networked Systems, NETYS 2016},
	series = {Lecture Notes in Computer Science},
	volume = {9944},
	year = {2016},
	note = {4th International Conference on Networked Systems (NETYS), Marrakech, MOROCCO, MAY 18-20, 2016},
	pages = {229-243},
	abstract = {Firewalls are a common solution to protect information systems from intrusions. In this paper, we apply an automata-based methodology to resolve several NP-Hard problems which have been shown in the literature to be fundamental for the study of firewall security policies. We also compute space and time complexities of our resolution methods.},
	isbn = {978-3-319-46140-3; 978-3-319-46139-7},
	issn = {0302-9743},
	doi = {10.1007/978-3-319-46140-3\_19},
	author = {Khoumsi, Ahmed and Erradi, Mohamed and Ayache, Meryeme and Krombi, Wadie},
	editor = {Abdulla, PA and DelporteGallet, C}
}
@article {Khoumsi2016229,
	title = {An approach to resolve NP-hard problems of firewalls},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {9944 LNCS},
	year = {2016},
	note = {cited By 0},
	pages = {229-243},
	abstract = {Firewalls are a common solution to protect information systems from intrusions. In this paper, we apply an automata-based methodology to resolve several NP-Hard problems which have been shown in the literature to be fundamental for the study of firewall security policies. We also compute space and time complexities of our resolution methods. {\textcopyright} Springer International Publishing AG 2016.},
	doi = {10.1007/978-3-319-46140-3_19},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84990038429\&doi=10.1007\%2f978-3-319-46140-3_19\&partnerID=40\&md5=cd031e8992745830e08b31671e0e3416},
	author = {Khoumsi, A.a and Erradi, M.b and Ayache, M.b and Krombi, W.b}
}
@article { ISI:000391839700001,
	title = {Are the expected benefits of requirements reuse hampered by distance? An experiment},
	journal = {SPRINGERPLUS},
	volume = {5},
	year = {2016},
	month = {DEC 20},
	abstract = {Background: Software development processes are often performed by distributed teams which may be separated by great distances. Global software development (GSD) has undergone a significant growth in recent years. The challenges concerning GSD are especially relevant to requirements engineering (RE). Stakeholders need to share a common ground, but there are many difficulties as regards the potentially variable interpretation of the requirements in different contexts. We posit that the application of requirements reuse techniques could alleviate this problem through the diminution of the number of requirements open to misinterpretation. Results: This paper presents a reuse-based approach with which to address RE in GSD, with special emphasis on specification techniques, namely parameterised requirements and traceability relationships. An experiment was carried out with the participation of 29 university students enrolled on a Computer Science and Engineering course. Two main scenarios that represented co-localisation and distribution in software development were portrayed by participants from Spain and Morocco. The global teams achieved a slightly better performance than the co-located teams as regards effectiveness, which could be a result of the worse productivity of the global teams in comparison to the co-located teams. Subjective perceptions were generally more positive in the case of the distributed teams (difficulty, speed and understanding), with the exception of quality. Conclusions: A theoretical model has been proposed as an evaluation framework with which to analyse, from the point of view of the factor of distance, the effect of requirements specification techniques on a set of performance and perception-based variables. The experiment utilised a new internationalisation requirements catalogue. None of the differences found between co-located and distributed teams were significant according to the outcome of our statistical tests. The well-known benefits of requirements reuse in traditional co-located projects could, therefore, also be expected in GSD projects.},
	issn = {2193-1801},
	doi = {10.1186/s40064-016-3782-0},
	author = {Carrillo de Gea, Juan M. and Nicolas, Joaquin and Fernandez-Aleman, Jose L. and Toval, Ambrosio and Idri, Ali}
}
@article {CarrillodeGea2016,
	title = {Are the expected benefits of requirements reuse hampered by distance? An experiment},
	journal = {SpringerPlus},
	volume = {5},
	number = {1},
	year = {2016},
	note = {cited By 0},
	abstract = {Background: Software development processes are often performed by distributed teams which may be separated by great distances. Global software development (GSD) has undergone a significant growth in recent years. The challenges concerning GSD are especially relevant to requirements engineering (RE). Stakeholders need to share a common ground, but there are many difficulties as regards the potentially variable interpretation of the requirements in different contexts. We posit that the application of requirements reuse techniques could alleviate this problem through the diminution of the number of requirements open to misinterpretation. Results: This paper presents a reuse-based approach with which to address RE in GSD, with special emphasis on specification techniques, namely parameterised requirements and traceability relationships. An experiment was carried out with the participation of 29 university students enrolled on a Computer Science and Engineering course. Two main scenarios that represented co-localisation and distribution in software development were portrayed by participants from Spain and Morocco. The global teams achieved a slightly better performance than the co-located teams as regards effectiveness, which could be a result of the worse productivity of the global teams in comparison to the co-located teams. Subjective perceptions were generally more positive in the case of the distributed teams (difficulty, speed and understanding), with the exception of quality. Conclusions: A theoretical model has been proposed as an evaluation framework with which to analyse, from the point of view of the factor of distance, the effect of requirements specification techniques on a set of performance and perception-based variables. The experiment utilised a new internationalisation requirements catalogue. None of the differences found between co-located and distributed teams were significant according to the outcome of our statistical tests. The well-known benefits of requirements reuse in traditional co-located projects could, therefore, also be expected in GSD projects. {\textcopyright} 2016, The Author(s).},
	doi = {10.1186/s40064-016-3782-0},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85006395692\&doi=10.1186\%2fs40064-016-3782-0\&partnerID=40\&md5=9460f4e677fce457e990913a04d0898d},
	author = {Carrillo de Gea, J.M.a and Nicol{\'a}s, J.a and Fern{\'a}ndez-Alem{\'a}n, J.L.a and Toval, A.a and Idri, A.b}
}
@conference {Slimani2016266,
	title = {Artificial neural networks for demand forecasting: Application using Moroccan supermarket data},
	booktitle = {International Conference on Intelligent Systems Design and Applications, ISDA},
	volume = {2016-June},
	year = {2016},
	note = {cited By 0},
	pages = {266-271},
	abstract = {The accuracy of sales forecasts in a supply chain is certainly an important key to competitiveness. Because, for any member of the supply chain system, having a clear vision of the future demand affects his planning, his performance so his profit. In the first study of this work, various Artificial Neural Network models were presented and utilized to predict demand of a costumer{\textquoteright}s product. The training and validating data are provided from a known supermarket in Morocco. In a previous study, the results indicated that the best neural network structure for demand forecasting is the Multi Layer Perceptron, which is by the way, the most commonly used model in the literature. This work focuses on finding the optimal Multi Layer Perceptron structure for demand forecasting. We also present a review of selected works done in the application of game theory and neural networks in the context of management science. The main contribution of our work is the use of neural networks in order to predict the consumer{\textquoteright}s demand and implement this demand forecasting in a two-echelon supply chain with a game theoretic approach. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/ISDA.2015.7489236},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84978383954\&doi=10.1109\%2fISDA.2015.7489236\&partnerID=40\&md5=e101e792765c4a46c2bf395db5f4b1b1},
	author = {Slimani, I.a and El Farissi, I.b and Achchab, S.a}
}
@conference {Madani2015,
	title = {Access control in a collaborative session in multi tenant environment},
	booktitle = {Proceedings of the 2015 11th International Conference on Information Assurance and Security, IAS 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {Today collaborative applications may enable collaboration among users from the same or different tenants of a given cloud provider. During such collaborations, the participants need to access and use resources held by other collaborating users. These resources often contain sensitive data. They are meant to be shared only during specific collaborative sessions. A collaborative session is an abstract entity, comprising a set of users, called members of the session, playing the same or different roles. These users may have concurrent access to the shared objects during a session depending on their roles. In this work, we propose an approach that ensures access control to the shared resources in a collaborative session in multi-tenants environments. We suggest CRBAC, the Collaboration Role-based Access Control. CRBAC consists of an extended version of the RBAC model. CRBAC defines new entities to support access control in collaborative sessions. The suggested model has been implemented within Swift component in the open source cloud-computing platform OpenStack. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/ISIAS.2015.7492757},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84979516700\&doi=10.1109\%2fISIAS.2015.7492757\&partnerID=40\&md5=c5df0bd4a563937231a7448c7bfe12e1},
	author = {Madani, M.A. and Erradi, M. and Benkaouz, Y.}
}
@conference {Ayache201526,
	title = {Access control policies enforcement in a cloud environment: Openstack},
	booktitle = {Proceedings of the 2015 11th International Conference on Information Assurance and Security, IAS 2015},
	year = {2015},
	note = {cited By 1},
	pages = {26-31},
	abstract = {Cloud computing has become a widely used paradigm in many IT domains such as e-health. It offers several advantages to the users, e.g. elasticity, flexibility and the rapid sharing of a huge set of digital data. However, many security and privacy concerns still pose significant challenges. In particular, the most identified problem is how to enforce the user{\textquoteright}s security policy in the access control of the outsourced data. In fact, cloud environments does not provide facilities to support high level defined security policies. For instance, the swift storage component of openstack supports only fine grained access control to execute a specific action on a specific defined object. In this paper, we designed and implemented a middleware to provide high level security policies while using such swift fine grained primitives. An e-health collaborative application dedicated for remote diagnosis is used to illustrate the suggested approach. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/ISIAS.2015.7492740},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84979530321\&doi=10.1109\%2fISIAS.2015.7492740\&partnerID=40\&md5=bc070d8bb2973f9f221582272c86a588},
	author = {Ayache, M.a and Erradi, M.a and Freisleben, B.b}
}
@article {Idri2015,
	title = {Accuracy Comparison of Analogy-Based Software Development Effort Estimation Techniques},
	journal = {International Journal of Intelligent Systems},
	year = {2015},
	note = {cited By 1; Article in Press},
	abstract = {Estimation by analogy is a commonly used software effort estimation technique and a suitable alternative to other conventional estimation techniques: It predicts the effort of the target project using information from former similar projects. While it is relatively easy to handle numerical attributes, dealing with categorical attributes is one of the most difficult issues for analogy-based estimation techniques. Therefore, we propose, in this paper, a novel analogy-based approach, called 2FA-kprototypes, to predict effort when software projects are described by a mix of numerical and categorical attributes. To this aim, the well-known fuzzy k-prototypes algorithm is integrated into the process of estimation by analogy. The estimation accuracy of 2FA-kprototypes was evaluated and compared with that of two techniques: (1) classical analogy-based technique and (2) 2FA-kmodes, which is a technique that we have developed recently. The comparison was performed using four data sets that are quite diverse and have different sizes: ISBSG, COCOMO, USP05-FT, and USP05-RQ. The results obtained showed that both 2FA-kprototypes and 2FA-kmodes perform better than classical analogy. {\textcopyright} 2015 Wiley Periodicals, Inc.},
	doi = {10.1002/int.21748},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938886103\&doi=10.1002\%2fint.21748\&partnerID=40\&md5=d6d3bf98e8678fff671b7bc18b1febd5},
	author = {Idri, A.a and Amazal, F.A.a and Abran, A.b}
}
@conference {Benqatla201567,
	title = {Actor network theory as a collaborative mode: The contribution of game theory in the interessement phase},
	booktitle = {Proceedings of the 2015 5th World Congress on Information and Communication Technologies, WICT 2015},
	year = {2015},
	note = {cited By 0},
	pages = {67-72},
	abstract = {Global Governance of projects requires cooperation between several actors. In general, such cooperation is ensured by building network collaboration between entities who want to collaborate. In spite of the existence of a number of works interested in collaboration network, only few of them were focused on how to construct a network. In this paper, we address this topic through Actor Network Theory. In particular way, we analyze interessement phase of ANT from a cooperative game point of view. Indeed, it{\textquoteright}s about negotiations between actors involved in business project. Our objective is to propose an approach of network establishment, by inciting actors through cost savings. For that, we use Shapley Value to answer the question: Which coalitions are likely to form in order to ensure best cost-saving objectives in ANT mode of collaboration? We propose also a graphical tool for visualizing networks and simulating their evolution. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/WICT.2015.7489646},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84979763394\&doi=10.1109\%2fWICT.2015.7489646\&partnerID=40\&md5=653e269295ade9b28ddb4c4a020e5290},
	author = {Benqatla, M.S. and Dikra, C. and Bounabat, B.}
}
@conference { ISI:000383221800012,
	title = {ACTOR NETWORK THEORY AS A COLLABORATIVE MODE: THE CONTRIBUTION OF GAME THEORY IN THE INTERESSEMENT PHASE},
	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 = {67-72},
	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 = {Global Governance of projects requires cooperation between several actors. In general, such cooperation is ensured by building network collaboration between entities who want to collaborate. In spite of the existence of a number of works interested in collaboration network, only few of them were focused on how to construct a network. In this paper, we address this topic through Actor Network Theory. In particular way, we analyze interessement phase of ANT from a cooperative game point of view. Indeed, it{\textquoteright}s about negotiations between actors involved in business project. Our objective is to propose an approach of network establishment, by inciting actors through cost savings. For that, we use Shapley Value to answer the question: Which coalitions are likely to form in order to ensure best cost-saving objectives in ANT mode of collaboration? We propose also a graphical tool for visualizing networks and simulating their evolution.},
	isbn = {978-1-4673-8712-5},
	author = {Benqatla, Mohammed Salim and Dikra, Chikhaoui and Bounabat, Bouchaib},
	editor = {Abrahim, A and Alimi, AM and Haqiq, A and Karray, H and Mousannif, H and BenHalima, M and Choo, YH and Ma, K}
}
@article {Lhoussain2015127,
	title = {Adaptating the levenshtein distance to contextual spelling correction},
	journal = {International Journal of Computer Science and Applications},
	volume = {12},
	number = {1},
	year = {2015},
	note = {cited By 1},
	pages = {127-133},
	abstract = {In the last few years, computing environments for human learning have rapidly evolved due to the development of information and communication technologies. However, the use of information technology in automatic correction of spelling errors has become increasingly essential. In this context, we have developed a system for correcting spelling errors in the Arabic language based on language models and Levenshtein algorithm. The metric distance returned by the Levenshtein algorithm is often the same for multiple solutions in correcting a wrong word. To overcome this limitation we have added a weighting based on language models. This combination has helped us to screen and refine the results obtained in advance by the Levenshtein algorithm, and applied to the errors of Arabic words. The results are encouraging and demonstrate the value of this approach. {\textcopyright} Technomathematics Research Foundation.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84925438223\&partnerID=40\&md5=d40d9b32ebd59c63f8fed1f88ff15e47},
	author = {Lhoussain, A.S.a and Hicham, G.b and Abdellah, Y.c}
}
@conference {Zahraoui2015,
	title = {Adjusting story points calculation in scrum effort \& time estimation},
	booktitle = {2015 10th International Conference on Intelligent Systems: Theories and Applications, SITA 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {Effort and time estimation at the initial stage of an agile project is a difficult and challenging task due to volatility and changing in customer requirements. Scrum remains the most used agile project management method. However effort estimation in scrum is mainly based on story points which are subjective measures and mostly lead to inaccurate estimates. In this paper we propose to adjust this measure using three adjustment factors. Moreover this paper will show how to use also this adjusted story point in velocity calculation to ameliorate scrum time estimation. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/SITA.2015.7358400},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962420940\&doi=10.1109\%2fSITA.2015.7358400\&partnerID=40\&md5=50b20eb1257cdb32020b1c1cfe2ba7bc},
	author = {Zahraoui, H. and Janati Idrissi, M.A.}
}
@conference { ISI:000380409500026,
	title = {Adjusting Story Points Calculation in Scrum Effort \& Time Estimation},
	booktitle = {2015 10TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS: THEORIES AND APPLICATIONS (SITA)},
	year = {2015},
	note = {10th International Conference on Intelligent Systems - Theories and Applications (SITA), ENSIAS, Rabat, MOROCCO, OCT 20-21, 2015},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Effort and time estimation at the initial stage of an agile project is a difficult and challenging task due to volatility and changing in customer requirements. Scrum remains the most used agile project management method. However effort estimation in scrum is mainly based on story points which are subjective measures and mostly lead to inaccurate estimates. In this paper we propose to adjust this measure using three adjustment factors. Moreover this paper will show how to use also this adjusted story point in velocity calculation to ameliorate scrum time estimation.},
	isbn = {978-1-5090-0220-7},
	author = {Zahraoui, Hind and Janati Idrissi, Mohammed Abdou}
}
@article { ISI:000347022800012,
	title = {Analogy-based software development effort estimation: A systematic mapping and review},
	journal = {INFORMATION AND SOFTWARE TECHNOLOGY},
	volume = {58},
	year = {2015},
	month = {FEB},
	pages = {206-230},
	abstract = {Context: Analogy-based Software development Effort Estimation (ASEE) techniques have gained considerable attention from the software engineering community. However, existing systematic map and review studies on software development effort prediction have not investigated in depth several issues of ASEE techniques, to the exception of comparisons with other types of estimation techniques. Objective: The objective of this research is twofold: (1) to classify ASEE studies which primary goal is to propose new or modified ASEE techniques according to five criteria: research approach, contribution type, techniques used in combination with ASEE methods, and ASEE steps, as well as identifying publication channels and trends and (2) to analyze these studies from five perspectives: estimation accuracy, accuracy comparison, estimation context, impact of the techniques used in combination with ASEE methods, and ASEE tools. Method: We performed a systematic mapping of studies for which the primary goal is to develop or to improve ASEE techniques published in the period 1990-2012, and reviewed them based on an automated search of four electronic databases. Results: In total, we identified 65 studies published between 1990 and 2012, and classified them based on our predefined classification criteria. The mapping study revealed that most researchers focus on addressing problems related to the first step of an ASEE process, that is, feature and case subset selection. The results of our detailed analysis show that ASEE methods outperform the eight techniques with which they were compared, and tend to yield acceptable results especially when combining ASEE techniques with Fuzzy Logic (FL) or Genetic Algorithms (GA). Conclusion: Based on the findings of this study, the use of other techniques such FL and GA in combination with an ASEE method is promising to generate more accurate estimates. However, the use of ASEE techniques by practitioners is still limited: developing more ASEE tools may facilitate the application of these techniques and then lead to increasing the use of ASEE techniques in industry. (C) 2014 Elsevier B.V. All rights reserved.},
	issn = {0950-5849},
	doi = {10.1016/j.infsof.2014.07.013},
	author = {Idri, Ali and Amazal, Fatima Azzahra and Abran, Alain}
}
@article {Idri2015206,
	title = {Analogy-based software development effort estimation: A systematic mapping and review},
	journal = {Information and Software Technology},
	volume = {58},
	year = {2015},
	note = {cited By 16},
	pages = {206-230},
	abstract = {Context: Analogy-based Software development Effort Estimation (ASEE) techniques have gained considerable attention from the software engineering community. However, existing systematic map and review studies on software development effort prediction have not investigated in depth several issues of ASEE techniques, to the exception of comparisons with other types of estimation techniques. Objective: The objective of this research is twofold: (1) to classify ASEE studies which primary goal is to propose new or modified ASEE techniques according to five criteria: research approach, contribution type, techniques used in combination with ASEE methods, and ASEE steps, as well as identifying publication channels and trends and (2) to analyze these studies from five perspectives: estimation accuracy, accuracy comparison, estimation context, impact of the techniques used in combination with ASEE methods, and ASEE tools. Method: We performed a systematic mapping of studies for which the primary goal is to develop or to improve ASEE techniques published in the period 1990-2012, and reviewed them based on an automated search of four electronic databases. Results: In total, we identified 65 studies published between 1990 and 2012, and classified them based on our predefined classification criteria. The mapping study revealed that most researchers focus on addressing problems related to the first step of an ASEE process, that is, feature and case subset selection. The results of our detailed analysis show that ASEE methods outperform the eight techniques with which they were compared, and tend to yield acceptable results especially when combining ASEE techniques with Fuzzy Logic (FL) or Genetic Algorithms (GA). Conclusion: Based on the findings of this study, the use of other techniques such FL and GA in combination with an ASEE method is promising to generate more accurate estimates. However, the use of ASEE techniques by practitioners is still limited: developing more ASEE tools may facilitate the application of these techniques and then lead to increasing the use of ASEE techniques in industry. {\textcopyright} 2014 Elsevier B.V. All rights reserved.},
	doi = {10.1016/j.infsof.2014.07.013},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84914109039\&doi=10.1016\%2fj.infsof.2014.07.013\&partnerID=40\&md5=70ffdeca252a6c01dde0070da6ecde9c},
	author = {Idri, A.a and Amazal, F.A.a and Abran, A.b}
}
@conference {ElBajta201551,
	title = {Analogy-based software development effort estimation in global software development},
	booktitle = {Proceedings - 2015 IEEE 10th International Conference on Global Software Engineering Workshops, ICGSEW 2015},
	year = {2015},
	note = {cited By 0},
	pages = {51-54},
	abstract = {Context: Software development has always been characterised by certain parameters. In the case of global software development, one of the important challenges for software developers is that of predicting the development effort of a software system on the basis of developer details, size, complexity, and other measures. Objective: The main research topics related to global software development effort estimation are the definition and empirical evaluation of a search-based approach with which to build new estimation models and the definition and empirical evaluation of all available early data. Datasets have been used as a basis to carry out an analogy-based estimation using similarity functions and measures. Method: Many of the problems concerning the existing effort estimation challenges can be solved by creating an analogy. This paper describes an enhanced analogy-based model for the estimation of software development effort and proposes a new approach using similarity functions and measures for software effort estimation. Result: A new approach for analogy-based reasoning with which to enhance the performance of cost estimation in distributed or combined software projects dealing with numerical and categorical data. The proposed method will be validated empirically using The International Software Benchmarking Standards Group dataset as a basis. Conclusion: The proposed estimation model could be a useful approach for early stage effort estimation on distributed projects. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/ICGSEW.2015.19},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84957927049\&doi=10.1109\%2fICGSEW.2015.19\&partnerID=40\&md5=c3b4560c70a9e611b029f6fcff6a71a3},
	author = {El Bajta, M.}
}
@conference { ISI:000380398800010,
	title = {Analogy-based software development effort estimation in global software development},
	booktitle = {2015 IEEE 10TH INTERNATIONAL CONFERENCE ON GLOBAL SOFTWARE ENGINEERING WORKSHOPS (ICGSEW 2015)},
	year = {2015},
	note = {10th IEEE International Conference on Global Software Engineering (ICGSE), Univ Castilla La Manchas, Comp Sci Fac, Ciudad Real, SPAIN, JUL 13-16, 2015},
	pages = {51-54},
	publisher = {IEEE; IEEE Comp Soc; SIEMENS; Escuela Super Informatica; Alarcos Res Grp; Indra; Univ Castilla La Mancha; Investigac, Desarrollo \& Innovac; TSI; Alarcos Qual Ctr},
	organization = {IEEE; IEEE Comp Soc; SIEMENS; Escuela Super Informatica; Alarcos Res Grp; Indra; Univ Castilla La Mancha; Investigac, Desarrollo \& Innovac; TSI; Alarcos Qual Ctr},
	abstract = {Context: Software development has always been characterised by certain parameters. In the case of global software development, one of the important challenges for software developers is that of predicting the development effort of a software system on the basis of developer details, size, complexity, and other measures. Objective: The main research topics related to global software development effort estimation are the definition and empirical evaluation of a search-based approach with which to build new estimation models and the definition and empirical evaluation of all available early data. Datasets have been used as a basis to carry out an analogy-based estimation using similarity functions and measures. Method: Many of the problems concerning the existing effort estimation challenges can be solved by creating an analogy. This paper describes an enhanced analogy-based model for the estimation of software development effort and proposes a new approach using similarity functions and measures for software effort estimation. Result: A new approach for analogy-based reasoning with which to enhance the performance of cost estimation in distributed or combined software projects dealing with numerical and categorical data. The proposed method will be validated empirically using The International Software Benchmarking Standards Group dataset as a basis. Conclusion: The proposed estimation model could be a useful approach for early stage effort estimation on distributed projects.},
	isbn = {978-1-4799-9874-6},
	doi = {10.1109/ICGSEW.2015.19},
	author = {El Bajta, Manal}
}
@article {Assad2015,
	title = {Analysis of the deployment quality for intrusion detection in wireless sensor networks},
	journal = {Journal of Computer Networks and Communications},
	volume = {2015},
	year = {2015},
	note = {cited By 0},
	abstract = {The intrusion detection application in a homogeneous wireless sensor network is defined as a mechanism to detect unauthorized intrusions or anomalous moving attackers in a field of interest. The quality of deterministic sensor nodes deployment can be determined sufficiently by a rigorous analysis before the deployment. However, when random deployment is required, determining the deployment quality becomes challenging. An area may require that multiple nodes monitor each point from the sensing area; this constraint is known as k-coverage where k is the number of nodes. The deployment quality of sensor nodes depends directly on node density and sensing range; mainly a random sensor nodes deployment is required. The major question is centred around the problem of network coverage, how can we guarantee that each point of the sensing area is covered by the required number of sensor nodes and what a sufficient condition to guarantee the network coverage? To deal with this, probabilistic intrusion detection models are adopted, called single/multi-sensing detection, and the deployment quality issue is surveyed and analysed in terms of coverage. We evaluate the capability of our probabilistic model in homogeneous wireless sensor network, in terms of sensing range, node density, and intrusion distance. {\textcopyright} 2015 Noureddine Assad et al.},
	doi = {10.1155/2015/812613},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84923884883\&doi=10.1155\%2f2015\%2f812613\&partnerID=40\&md5=ad555667d0db7cbc297aef916a17e0f5},
	author = {Assad, N.a and Elbhiri, B.b and Faqihi, M.A.c and Ouadou, M.a and Aboutajdine, D.a}
}
@article {10906318320150205,
	title = {Analysis of the Deployment Quality for Intrusion Detection in Wireless Sensor Networks.},
	journal = {Journal of Computer Networks \& Communications},
	volume = {2015},
	year = {2015},
	pages = {1 - 7},
	abstract = {The intrusion detection application in a homogeneous wireless sensor network is defined as a mechanism to detect unauthorized intrusions or anomalous moving attackers in a field of interest. The quality of deterministic sensor nodes deployment can be determined sufficiently by a rigorous analysis before the deployment. However, when random deployment is required, determining the deployment quality becomes challenging. An area may require that multiple nodes monitor each point from the sensing area; this constraint is known as k-coverage where k is the number of nodes. The deployment quality of sensor nodes depends directly on node density and sensing range; mainly a random sensor nodes deployment is required. The major question is centred around the problem of network coverage, how can we guarantee that each point of the sensing area is covered by the required number of sensor nodes and what a sufficient condition to guarantee the network coverage? To deal with this, probabilistic int},
	keywords = {Intrusion detection systems (Computer security), Mathematical models, Probability theory, Wireless sensor networks, Wireless sensor nodes},
	issn = {20907141},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=109063183\&site=ehost-live},
	author = {Assad, Noureddine and Elbhiri, Brahim and Faqihi, Moulay Ahmed and Ouadou, Mohamed and Aboutajdine, Driss}
}
@article { ISI:000362267900001,
	title = {Analysis of the Deployment Quality for Intrusion Detection in Wireless Sensor Networks},
	journal = {JOURNAL OF COMPUTER NETWORKS AND COMMUNICATIONS},
	year = {2015},
	abstract = {The intrusion detection application in a homogeneous wireless sensor network is defined as a mechanism to detect unauthorized intrusions or anomalous moving attackers in a field of interest. The quality of deterministic sensor nodes deployment can be determined sufficiently by a rigorous analysis before the deployment. However, when random deployment is required, determining the deployment quality becomes challenging. An area may require that multiple nodes monitor each point from the sensing area; this constraint is known as k-coverage where k is the number of nodes. The deployment quality of sensor nodes depends directly on node density and sensing range; mainly a random sensor nodes deployment is required. The major question is centred around the problem of network coverage, how can we guarantee that each point of the sensing area is covered by the required number of sensor nodes and what a sufficient condition to guarantee the network coverage? To deal with this, probabilistic intrusion detection models are adopted, called single/multi-sensing detection, and the deployment quality issue is surveyed and analysed in terms of coverage. We evaluate the capability of our probabilistic model in homogeneous wireless sensor network, in terms of sensing range, node density, and intrusion distance.},
	issn = {2090-7141},
	doi = {10.1155/2015/812613},
	author = {Assad, Noureddine and Elbhiri, Brahim and Faqihi, Moulay Ahmed and Ouadou, Mohamed and Aboutajdine, Driss}
}
@article {Benlarabi2015550,
	title = {Analyzing trends in software product lines evolution using a cladistics based approach},
	journal = {Information (Switzerland)},
	volume = {6},
	number = {3},
	year = {2015},
	note = {cited By 1},
	pages = {550-563},
	abstract = {Abstract: A software product line is a complex system the aim of which is to provide a platform dedicated to large reuse. It necessitates a great investment. Thus, its ability to cope with customers{\textquoteright} ever-changing requirements is among its key success factors. Great effort has been made to deal with the software product line evolution. In our previous works, we carried out a classification of these works to provide an overview of the used techniques. We also identified the following key challenges of software product lines evolution: the ability to predict future changes, the ability to define the impact of a change easily and the improvement in understanding the change. We have already tackled the second and the third challenges. The objective of this paper is to deal with the first challenge. We use the cladistics classification which was used in biology to understand the evolution of organisms sharing the same ancestor and their process of descent at the aim of predicting their future changes. By analogy, we consider a population of applications for media management on mobile devices derived from the same platform and we use cladistics to construct their evolutionary tree. We conducted an analysis to show how to identify the evolution trends of the case study products and to predict future changes. {\textcopyright} 2015 by the authors.},
	doi = {10.3390/info6030550},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84943561816\&doi=10.3390\%2finfo6030550\&partnerID=40\&md5=892c17009c76fbae807d486836450566},
	author = {Benlarabi, A. and Khtira, A. and El Asri, B.}
}
@article {Slimani2015411,
	title = {Application of game theory and neural network to study the behavioral probabilities in supply chain},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {82},
	number = {3},
	year = {2015},
	note = {cited By 3},
	pages = {411-416},
	abstract = {As a review of game theoretic approach to optimize the logistic costs with the objective of modeling interactions among players in a basic supply chain, this paper focuses on a single channel, two-echelon supply chain with a retailer and his supplier of a one-product where careful attention is given to information sharing in general and demand forecasting in particular. Therefore, in the industrial world, firms cannot risk waiting for the actual demand to occur so they can react and determine the quantities to purchase, produce or deliver. Demand forecasts are important and necessary to any member of the supply chain as they gave them the advantage of planning and anticipating for future needs. However, demand forecasting is one of those crucial decisions where an error can cost too much. This is why we choose to implement the artificial neural network as a forecasting technique. Obviously the closest actor to the market i.e the retailer has the best view of demand levels than the supplier, so sharing demand information with the other actors has an impact on the performance of the whole supply chain but it is not necessarily the case since the retailer can choose to withhold this information. This is why we focus in this investigation on the demand{\textquoteright}s prediction when information is not shared using the artificial intelligence of neural networks. {\textcopyright} 2005 - 2015 JATIT \& LLS. All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84952779428\&partnerID=40\&md5=12ffaf47b965757c2f2c6cf341401aac},
	author = {Slimani, I.a and El Farissi, I.b and Achchab, S.c}
}
@conference {Aoun2015196,
	title = {Application of multi-agent Markov decision processes to gate assignment problem},
	booktitle = {Colloquium in Information Science and Technology, CIST},
	volume = {2015-January},
	number = {January},
	year = {2015},
	note = {cited By 0},
	pages = {196-201},
	abstract = {Gate assignment Problem (GAP) is an important subject of airport management to ensure smooth traffic operations. However, flights schedule may undergo some stochastic events such as delays that usually occur and have to be considered in the planning. Our approach considers the representation of gates as collaborative agents trying to complete a set of flights assignment tasks as given by a centralized controller. That will allow giving a new model for the GAP based on Multi Agent Markov Decision Processes (MMDP). The aim of this work is to give to controllers at the airport a robust priory solution instead of taking the risk of online schedule modifications to handle uncertainty. The solution of this problem will be a set of optimal decisions to be taken in every case of traffic disturbance. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/CIST.2014.7016618},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938059541\&doi=10.1109\%2fCIST.2014.7016618\&partnerID=40\&md5=3c8489dfc2f96904a052d1ca21232020},
	author = {Aoun, O. and El Afia, A.}
}
@conference {Ouhbi2015405,
	title = {Applying ISO/IEC 25010 on mobile personal health records},
	booktitle = {HEALTHINF 2015 - 8th International Conference on Health Informatics, Proceedings; Part of 8th International Joint Conference on Biomedical Engineering Systems and Technologies, BIOSTEC 2015},
	year = {2015},
	note = {cited By 7},
	pages = {405-412},
	abstract = {Software product quality requirements reflect the stockholders{\textquoteright} needs in terms of quality. They play a central role in the success of the system and the software product quality. This paper lists mobile personal health record (mPHR) requirements extracted from literature and identifies the requirements which should be included in the mPHR quality evaluation. Moreover, the ISO/IEC 25010 software product quality model is used to present a checklist with which to calculate the influence of the mPHR requirements on software product quality. Furthermore, the degrees of influence of mPHR requirements on software product quality are calculated and analyzed. A set of recommendations for mPHRs developers and stakeholders is provided.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938873168\&partnerID=40\&md5=6b335b7b09b476b23c9c36f26f7b5bdc},
	author = {Ouhbi, S.a and Idri, A.a and Fern{\'a}ndez-Alem{\'a}n, J.L.b and Toval, A.b and Benjelloun, H.c}
}
@conference {Sadki2015,
	title = {An approach for privacy policies negotiation in mobile health-Cloud environments},
	booktitle = {Proceedings of 2015 International Conference on Cloud Computing Technologies and Applications, CloudTech 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {Mobile technologies continue to improve patients{\textquoteright} quality of care. Particularly, with the emergence of Cloud-based mobile services and applications, patients can easily communicate with their physicians and receive the care they deserve. However, due to the increased number of privacy threats in mobile and Cloud computing environments, maximizing patients{\textquoteright} control over their data becomes a necessity. Thus, formal languages to express their privacy preferences are needed. Besides, because of the diversity of actors involved in patient{\textquoteright}s care, conflict among privacy policies can take place. In this paper, we present an approach that aims to resolve the problem of conflicting privacy policies based on a Security Policy Negotiation Framework. The major particularity of our solution is that it considers the patient to be a crucial actor in the negotiation process. The different steps of our approach are illustrated through an example of three conflicting privacy policies with different privacy languages. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/CloudTech.2015.7336983},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962886191\&doi=10.1109\%2fCloudTech.2015.7336983\&partnerID=40\&md5=ee5946b2a8e87fa592145c3a5512d21c},
	author = {Sadki, S. and El Bakkali, H.}
}
@conference { ISI:000380407100022,
	title = {An approach for privacy policies negotiation in mobile health-Cloud environments},
	booktitle = {2015 INTERNATIONAL CONFERENCE ON CLOUD TECHNOLOGIES AND APPLICATIONS (CLOUDTECH 15)},
	year = {2015},
	note = {International Conference on Cloud Computing Technologies and Applications (CloudTech), Marrakech, MOROCCO, JUN 02-04, 2015},
	pages = {179-184},
	abstract = {Mobile technologies continue to improve patients{\textquoteright} quality of care. Particularly, with the emergence of Cloud-based mobile services and applications, patients can easily communicate with their physicians and receive the care they deserve. However, due to the increased number of privacy threats in mobile and Cloud computing environments, maximizing patients{\textquoteright} control over their data becomes a necessity. Thus, formal languages to express their privacy preferences are needed. Besides, because of the diversity of actors involved in patient{\textquoteright}s care, conflict among privacy policies can take place. In this paper, we present an approach that aims to resolve the problem of conflicting privacy policies based on a Security Policy Negotiation Framework. The major particularity of our solution is that it considers the patient to be a crucial actor in the negotiation process. The different steps of our approach are illustrated through an example of three conflicting privacy policies with different privacy languages.},
	isbn = {978-1-4673-8149-9},
	author = {Sadki, Souad and El Bakkali, Hanan}
}
@conference { ISI:000380409500003,
	title = {Are Mobile Blood Donation Applications Green?},
	booktitle = {2015 10TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS: THEORIES AND APPLICATIONS (SITA)},
	year = {2015},
	note = {10th International Conference on Intelligent Systems - Theories and Applications (SITA), ENSIAS, Rabat, MOROCCO, OCT 20-21, 2015},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {On a global scale, software sustainability is attracting more and more attention. The term green software often refers to environmental sustainability applied to software systems, however, it is impacted by the different dimensions of sustainability. Green software can be divided into green by software and green in software. Blood donation mobile applications are more and more used by smartphone users. They represent an alternative way to attract volunteers and increase awareness about the importance of blood donation acts. The aim of this paper is to assess the greenability of seventy-two free blood donation applications using individual, social, environmental and technical dimensions of sustainability. The type, functionality and energy consumption of each app are identified and analyzed. Results have shown that the type of the BD app has a great impact on its level of greenability.},
	isbn = {978-1-5090-0220-7},
	author = {Ouhbi, Sofia and Luis Fernandez-Aleman, Jose and Idri, Ali and Rivera Pozo, Jose}
}
@conference {Ouhbi2015,
	title = {Are mobile blood donation applications green?},
	booktitle = {2015 10th International Conference on Intelligent Systems: Theories and Applications, SITA 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {On a global scale, software sustainability is attracting more and more attention. The term green software often refers to environmental sustainability applied to software systems, however, it is impacted by the different dimensions of sustainability. Green software can be divided into green by software and green in software. Blood donation mobile applications are more and more used by smartphone users. They represent an alternative way to attract volunteers and increase awareness about the importance of blood donation acts. The aim of this paper is to assess the greenability of seventy-two free blood donation applications using individual, social, environmental and technical dimensions of sustainability. The type, functionality and energy consumption of each app are identified and analyzed. Results have shown that the type of the BD app has a great impact on its level of greenability. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/SITA.2015.7358377},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962393996\&doi=10.1109\%2fSITA.2015.7358377\&partnerID=40\&md5=20b20223f3a907b755a5d37229297a5d},
	author = {Ouhbi, S.a and Fern{\'a}ndez-Alem{\'a}n, J.L.a and Idri, A.b and Pozo, J.R.c}
}
@conference {Elkandoussi2014,
	title = {On access control requirements for inter-organizational workflow},
	booktitle = {Proceedings of the 4th Edition of National Security Days, JNS4 2014},
	year = {2014},
	note = {cited By 1},
	abstract = {The rapid development in networks technologies has significantly enhanced connectivity and interactions between organizations. In fact, several organizations gather to cooperate and put in common their resources and skills to reach a common goal. Inter-Organizational Workflow aims to support cooperation between business processes running in different organizations. The Access Control service remains a major challenge to ensure safe and reliable exchange of data. Indeed, such collaborative systems are highly vulnerable to security threats, especially for confidential and sensitive data. So organizations must take into account the security needs and particularly those related to access control. That{\textquoteright}s why it{\textquoteright}s important to study the security requirements in such systems. This paper studies different Inter-Organizational Workflow Access Control models, explores the main requirements in such environments and gives a comparative study. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/JNS4.2014.6850128},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84905388063\&doi=10.1109\%2fJNS4.2014.6850128\&partnerID=40\&md5=a14bfc914c86fc5cd8c13c2f5b66f12d},
	author = {Elkandoussi, A. and Elbakkali, H.}
}
@conference { ISI:000343536300005,
	title = {On Access Control Requirements for Inter-Organizational Workflow},
	booktitle = {PROCEEDINGS OF THE 4TH EDITION OF NATIONAL SECURITY DAYS (JNS4)},
	year = {2014},
	note = {4th National Security Days (JNS), Tetouan, MOROCCO, MAY 12-13, 2014},
	pages = {21-26},
	abstract = {The rapid development in networks technologies has significantly enhanced connectivity and interactions between organizations. In fact, several organizations gather to cooperate and put in common their resources and skills to reach a common goal. Inter-Organizational Workflow aims to support cooperation between business processes running in different organizations. The Access Control service remains a major challenge to ensure safe and reliable exchange of data. Indeed, such collaborative systems are highly vulnerable to security threats, especially for confidential and sensitive data. So organizations must take into account the security needs and particularly those related to access control. That{\textquoteright}s why it{\textquoteright}s important to study the security requirements in such systems. This paper studies different Inter-Organizational Workflow Access Control models, explores the main requirements in such environments and gives a comparative study.},
	isbn = {978-1-4799-5587-9},
	author = {Elkandoussi, Asmaa and Elbakkali, Hanan}
}
@article {Boukhriss201495,
	title = {Active disturbance rejection control for DFIG based wind farms under unbalanced grid voltage},
	journal = {International Review on Modelling and Simulations},
	volume = {7},
	number = {1},
	year = {2014},
	note = {cited By 4},
	pages = {95-105},
	abstract = {This paper presents a method for controlling a doubly fed induction generator used in the conversion of wind power under an unbalanced supply voltage, to eliminate the oscillations, which may occur, due to the presence of negative sequence in the electromagnetic torque and active power delivered to the network. Control strategy based on the voltage oriented control VOC, is used to control the direct and quadrature currents, in both the positive and negative sequence for the network side and rotor side converter. For its robustness to uncertainties that may arise into the physical plant parameters and the needless exact knowledge of physical system, the active disturbance rejection control based on an extended state observer is used to overcome the internal and external uncertainties. Simulations are carried out using Matlab Simulink. {\textcopyright} 2014 Praise Worthy Prize S.r.l. - All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84899631829\&partnerID=40\&md5=1bd2fd5faa313d210f32d258050f4ab9},
	author = {Boukhriss, A.a and Nasser, T.b and Essadki, A.a and Boualloch, A.a}
}
@conference {Amazal2014252,
	title = {An analogy-based approach to estimation of software development effort using categorical data},
	booktitle = {Proceedings - 2014 Joint Conference of the International Workshop on Software Measurement, IWSM 2014 and the International Conference on Software Process and Product Measurement, Mensura 2014},
	year = {2014},
	note = {cited By 2},
	pages = {252-262},
	abstract = {Analogy-based software development effort estimation methods have proved to be a viable alternative to other conventional estimation methods since they mimic the human problem solving approach. However, they are limited by their inability to correctly handle categorical data. Therefore, we have proposed, in an earlier work, a new approach called fuzzy analogy which extends classical analogy by incorporating the fuzzy logic concept in the estimation process. The proposed approach may be applied only when the categorical values are derived from numerical data. This paper extends fuzzy analogy to deal with categorical values that are not derived from numerical data. To this aim, we used the fuzzy k-modes algorithm, a well-known clustering technique for large datasets containing categorical values. Thereafter, we evaluate the accuracy of fuzzy analogy construction-based on fuzzy k-modes using the ISBSG R8 dataset. This evaluation shows that our proposed approach leads to significant improvement in estimation accuracy. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/IWSM.Mensura.2014.31},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84929643263\&doi=10.1109\%2fIWSM.Mensura.2014.31\&partnerID=40\&md5=84eb80725af9b61fcbeeb71e6ba04eb9},
	author = {Amazal, F.-A.a and Idri, A.a and Abran, A.b}
}
@article {Idri2014,
	title = {Analogy-based software development effort estimation: A systematic mapping and review},
	journal = {Information and Software Technology},
	year = {2014},
	note = {cited By 1; Article in Press},
	abstract = {Context: Analogy-based software development effort estimation (ASEE) techniques have gained considerable attention from the software engineering community. However, to our knowledge, no systematic mapping has been created of ASEE studies and no review has been carried out to analyze the empirical evidence on the performance of ASEE techniques. Objective: The objective of this research is twofold: (1) to classify ASEE papers according to five criteria: research approach, contribution type, techniques used in combination with ASEE methods, and ASEE steps, as well as identifying publication channels and trends; and (2) to analyze these studies from five perspectives: estimation accuracy, accuracy comparison, estimation context, impact of the techniques used in combination with ASEE methods, and ASEE tools. Method: We performed a systematic mapping of ASEE studies published in the period 1990-2012, and reviewed them based on an automated search of four electronic databases. Results: In total, we identified 65 studies published between 1990 and 2012, and classified them based on our predefined classification criteria. The mapping study revealed that most researchers focus on addressing problems related to the first step of an ASEE process, that is, feature and case subset selection. The results of our detailed analysis show that ASEE methods outperform the eight techniques with which they were compared, and tend to yield acceptable results especially when combining ASEE techniques with fuzzy logic (FL) or genetic algorithms (GA). Conclusion: Based on the findings of this study, the use of other techniques such FL and GA in combination with an ASEE method is promising to generate more accurate estimates. However, the use of ASEE techniques by practitioners is still limited: developing more ASEE tools may facilitate the application of these techniques and then lead to increasing the use of ASEE techniques in industry. {\textcopyright} 2014 Elsevier B.V. All rights reserved.},
	doi = {10.1016/j.infsof.2014.07.013},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84906037417\&doi=10.1016\%2fj.infsof.2014.07.013\&partnerID=40\&md5=4a5eda69bfe8b11111bed58fad572629},
	author = {Idri, A.a and Amazal, F.A.a and Abran, A.b}
}
@conference { ISI:000371484600034,
	title = {Application of Multi-Agent Markov Decision Processes to Gate Assignment Problem},
	booktitle = {2014 THIRD IEEE INTERNATIONAL COLLOQUIUM IN INFORMATION SCIENCE AND TECHNOLOGY (CIST{\textquoteright}14)},
	series = {Colloquium in Information Science and Technology},
	year = {2014},
	note = {3rd IEEE International Colloquium on Information Science and Technology (CIST), Tetouan, MOROCCO, OCT 20-22, 2014},
	pages = {196-201},
	publisher = {IEEE; IEEE Comp Soc; IEEE Commun Soc; IEEE Morocco Sect; IEEE Morocco Comp \& Commun Joint Chapter; UAE IEEE Student Branch; Univ Abdelmalek Essaadi; ENSA Tetouan},
	organization = {IEEE; IEEE Comp Soc; IEEE Commun Soc; IEEE Morocco Sect; IEEE Morocco Comp \& Commun Joint Chapter; UAE IEEE Student Branch; Univ Abdelmalek Essaadi; ENSA Tetouan},
	abstract = {Gate assignment Problem (GAP) is an important subject of airport management to ensure smooth traffic operations. However, flights schedule may undergo some stochastic events such as delays that usually occur and have to be considered in the planning. Our approach considers the representation of gates as collaborative agents trying to complete a set of flights assignment tasks as given by a centralized controller. That will allow giving a new model for the GAP based on Multi Agent Markov Decision Processes (MMDP). The aim of this work is to give to controllers at the airport a robust priory solution instead of taking the risk of online schedule modifications to handle uncertainty. The solution of this problem will be a set of optimal decisions to be taken in every case of traffic disturbance.},
	isbn = {978-1-4799-5979-2},
	issn = {2327-185X},
	author = {Aoun, Oussama and El Afia, Abdellatif},
	editor = {ElMohajir, M and AlAchhab, M and Chahhou, M}
}
@conference {Merabet20141088,
	title = {Applications of multi-Agent systems in smart grids: A survey},
	booktitle = {International Conference on Multimedia Computing and Systems -Proceedings},
	year = {2014},
	note = {cited By 1},
	pages = {1088-1094},
	abstract = {The Smart Grids (SGs) are regarded as the new generation of electric power systems, combining the development of Information Technology (IT), distributed systems and Artificial Intelligence (AI) for more features on the real-time monitoring of the Demand /Response (DR) and the energy consumption. An approach based on the use of Multi-Agent Systems (MAS) to study the management of distribution systems, simulating the characteristics of SG. This paper presents the different platforms used for the implementation of MAS for the control and operation of smart grids. The MAS{\textquoteright} applications in SG available in the literature are also developed in this paper. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/ICMCS.2014.6911384},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84928741215\&doi=10.1109\%2fICMCS.2014.6911384\&partnerID=40\&md5=0552200ad62f47930e0a666d76aa763d},
	author = {Merabet, G.H.a and Essaaidi, M.a and Talei, H.b and Abid, M.R.b and Khalil, N.c and Madkour, M.c and Benhaddou, D.c}
}
@conference { ISI:000366999600191,
	title = {Applications of Multi-Agent Systems in Smart Grids: A Survey},
	booktitle = {2014 INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS)},
	year = {2014},
	note = {International Conference on Multimedia Computing and Systems (ICMCS), Marrakech, MOROCCO, APR 14-16, 2014},
	pages = {1088-1094},
	abstract = {The Smart Grids (SGs) are regarded as the new generation of electric power systems, combining the development of Information Technology (IT), distributed systems and Artificial Intelligence (AI) for more features on the real-time monitoring of the Demand / Response (DR) and the energy consumption. An approach based on the use of Multi-Agent Systems (MAS) to study the management of distribution systems, simulating the characteristics of SG. This paper presents the different platforms used for the implementation of MAS for the control and operation of smart grids. The MAS{\textquoteright} applications in SG available in the literature are also developed in this paper.},
	isbn = {978-1-4799-3824-7},
	author = {Merabet, Ghezlane Halhoul and Essaaidi, Mohammed and Talei, Hanaa and Abid, Mohamed Riduan and Khalil, Nacer and Madkour, Mohcine and Benhaddou, Driss}
}
@conference { ISI:000366999600145,
	title = {Asymmetric and Dynamic Encryption for Routing Security in MANETs},
	booktitle = {2014 INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS)},
	year = {2014},
	note = {International Conference on Multimedia Computing and Systems (ICMCS), Marrakech, MOROCCO, APR 14-16, 2014},
	pages = {825-830},
	abstract = {In mobile ad-hoc networks (MANETs), data transmission is usually performed between mobile entities in an environment without infrastructure. So, data security is a key issue in MANETs. In this paper, we propose a security solution for the routing protocol OLSR. Our system is based on a new approach of asymmetric and dynamic encryption. Our goal is to properly secure the traffic against potential attacks without decreasing network performances.},
	isbn = {978-1-4799-3824-7},
	author = {Echchaachoui, Adel and Choukri, Ali and Habbani, Ahmed and Elkoutbi, Mohamed}
}
@conference { ISI:000360829800037,
	title = {Automata-Based Approach to Design and Analyze Security Policies},
	booktitle = {2014 TWELFTH ANNUAL INTERNATIONAL CONFERENCE ON PRIVACY, SECURITY AND TRUST (PST)},
	year = {2014},
	note = {12th Annual International Conference on Privacy, Security and Trust (PST), Ryerson Univ, Toronto, CANADA, JUL 23-24, 2014},
	pages = {306-313},
	abstract = {Information systems must be controlled by security policies to protect them from undue accesses. Security policies are often designed by rules expressed using informal text, which implies ambiguities and inconsistencies in security rules. Our objective in this paper is to develop a formal approach to design and analyze security policies. We propose a procedure that synthesizes an automaton which implements a given security policy. Our automata-based approach can be a common basis to analyze several aspects of security policies. We use our automata-based approach to develop three analysis procedures to: verify completeness of a security policy, detect anomalies in a security policy, and detect functional discrepancies between several implementations of a security policy. We illustrate our approach using examples of security policies for a firewall.},
	isbn = {978-1-4799-3503-1},
	author = {Krombi, Wadie and Erradi, Mohammed and Khoumsi, Ahmed},
	editor = {Miri, A and Hengartner, U and Huang, NF and Josang, A and GarciaAlfaro, J}
}
@conference {Krombi2014306,
	title = {Automata-based approach to design and analyze security policies},
	booktitle = {2014 12th Annual Conference on Privacy, Security and Trust, PST 2014},
	year = {2014},
	note = {cited By 2},
	pages = {306-313},
	abstract = {Information systems must be controlled by security policies to protect them from undue accesses. Security policies are often designed by rules expressed using informal text, which implies ambiguities and inconsistencies in security rules. Our objective in this paper is to develop a formal approach to design and analyze security policies. We propose a procedure that synthesizes an automaton which implements a given security policy. Our automata-based approach can be a common basis to analyze several aspects of security policies. We use our automata-based approach to develop three analysis procedures to: verify completeness of a security policy, detect anomalies in a security policy, and detect functional discrepancies between several implementations of a security policy. We illustrate our approach using examples of security policies for a firewall. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/PST.2014.6890953},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84910095793\&doi=10.1109\%2fPST.2014.6890953\&partnerID=40\&md5=c203c3363442208f90fb65f844c4a72b},
	author = {Krombi, W.a and Erradi, M.a and Khoumsi, A.b}
}
@article {9434372520130201,
	title = {Ant colony algorithm for the multi-depot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles.},
	journal = {INFOR},
	volume = {51},
	number = {1},
	year = {2013},
	pages = {31 - 40},
	abstract = {This article describes a heuristic method based on an ant colony algorithm for the multi-depot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles. Test results on different problem instances are presented and compared with those obtained by CPLEX and by a previous constructive heuristic. [ABSTRACT FROM AUTHOR]},
	keywords = {Ant algorithms, ant colony algorithm, Comparative studies, Computer networks, Heuristic algorithms, Information technology, Keywords Distribution, products in large quantities, Vehicle routing problem},
	issn = {03155986},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=bth\&AN=94343725\&site=ehost-live},
	author = {Benslimane, Mohammed Taha and Benadada, Youssef}
}
@article { ISI:000337796300005,
	title = {Ant Colony Algorithm for the Multi-Depot Vehicle Routing Problem in Large Quantities by a Heterogeneous Fleet of Vehicles},
	journal = {INFOR},
	volume = {51},
	number = {1, SI},
	year = {2013},
	month = {FEB},
	pages = {31-40},
	abstract = {This article describes a heuristic method based on an ant colony algorithm for the multi-depot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles. Test results on different problem instances are presented and compared with those obtained by CPLEX and by a previous constructive heuristic.},
	issn = {0315-5986},
	doi = {10.3138/infor.51.1.31},
	author = {Benslimane, Mohammed Taha and Benadada, Youssef}
}
@conference {ManarElBouanani2013,
	title = {An approach using intertextual distance to detect web messages authors},
	booktitle = {2013 3rd International Symposium ISKO-Maghreb},
	year = {2013},
	note = {cited By 0},
	abstract = {Our objective in this paper is to propose an approach capable of detecting authors of web messages based on specific vocabulary and Intertextual distance. Focus in the present work is on comparing the most popular distances using in the field of authorship detection namely Delta Rule, chi-square distance and Kullback-Leibler Divergence. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/ISKO-Maghreb.2013.6728130},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84894116721\&doi=10.1109\%2fISKO-Maghreb.2013.6728130\&partnerID=40\&md5=8d06efee89428887463c60388b59a295},
	author = {Manar El Bouanani, S.E. and Kassou, I.}
}
@conference { ISI:000350287800023,
	title = {An approach using Intertextual Distance to detect Web Messages Authors},
	booktitle = {2013 3RD INTERNATIONAL SYMPOSIUM ISKO-MAGHREB},
	year = {2013},
	note = {ISKO-Maghreb 3rd International Symposium, Marrakech, MOROCCO, NOV 08-09, 2013},
	publisher = {ISKO},
	organization = {ISKO},
	abstract = {Our objective in this paper is to propose an approach capable of detecting authors of web messages based on specific vocabulary and Intertextual distance. Focus in the present work is on comparing the most popular distances using in the field of authorship detection namely Delta Rule, chi-square distance and Kullback-Leibler Divergence.},
	isbn = {978-1-4799-3392-1},
	author = {El Manar El Bouanani, Sara and Kassou, Ismail}
}
@conference {Idri2013483,
	title = {Assessing RBFN-based software cost estimation models},
	booktitle = {Proceedings of the International Conference on Software Engineering and Knowledge Engineering, SEKE},
	volume = {2013-January},
	number = {January},
	year = {2013},
	note = {cited By 2},
	pages = {483-487},
	abstract = {This paper is concerned with the design of the neural networks approach, especially Radial Basis Function Neural (RBFN) networks, for software effort estimation models. The study firstly focuses on the construction of the RBFN middle layer composed of receptive fields, using two clustering techniques: hard C-means and fuzzy C-means. Thereafter, we evaluate and compare the performance of effort estimation models that use an RBFN construction-based either on hard or fuzzy C-means. This study uses the ISBSG dataset and confirms the usefulness of an RBFN-based on fuzzy C-means for software effort estimation. Copyright {\textcopyright} 2013 by Knowledge Systems Institute Graduate School.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84937716255\&partnerID=40\&md5=26b8de65f7c08367f5351ab898bf97a8},
	author = {Idri, A.a and Hassani, A.a and Abran, A.b}
}
@conference { ISI:000345780300021,
	title = {Automatic Generation of Ontology from Data Models: A Practical Evaluation of Existing Approaches},
	booktitle = {2013 IEEE SEVENTH INTERNATIONAL CONFERENCE ON RESEARCH CHALLENGES IN INFORMATION SCIENCE (RCIS)},
	series = {International Conference on Research Challenges in Information Science},
	year = {2013},
	note = {7th IEEE International Conference on Research Challenges in Information Science (RCIS), Paris, FRANCE, MAY 29-31, 2013},
	publisher = {IEEE; Univ Paris 1; Ctr Rech \& Informatique; IEEE French Sect; Cyrius Consulting; IEEE French CS Joint Chapter},
	organization = {IEEE; Univ Paris 1; Ctr Rech \& Informatique; IEEE French Sect; Cyrius Consulting; IEEE French CS Joint Chapter},
	abstract = {Nowadays, ontology as a knowledge sharing approach plays an important role in semantic interoperability of enterprise applications (EAs). However, the manual process of ontology construction requires deep understanding of the domain. This approach is difficult, expensive and time-consuming. To overcome the knowledge acquisition bottleneck, ontology learning field aims to provide automatic and semi-automatic approaches for ontology generation. Several approaches have been emerged for this purpose. In this paper, we present a practical study of methods that take data models as input to the learning process. The main contributions of this work are: (i) the evaluation of the availability of existing approaches for (semi-)automatic generation of ontology from data models; (ii) the evaluation of tools according to their operability; and (iii) the evaluation of the resulting ontologies to assess their quality in supporting semantic interoperability. Our goal through this study is to find a response to the question: Is there a tool that extracts (semi-) automatically an application ontology from data models, intended for use in semantic interoperability?.},
	isbn = {978-1-4673-2912-5},
	issn = {2151-1349},
	author = {El Idrissi, Bouchra and Baina, Salah and Baina, Karim},
	editor = {Wieringa, R and Nurcan, S and Rolland, C and Cavarero, JL}
}
@conference {ElIdrissi2013,
	title = {Automatic generation of ontology from data models: A practical evaluation of existing approaches},
	booktitle = {Proceedings - International Conference on Research Challenges in Information Science},
	year = {2013},
	note = {cited By 0},
	abstract = {Nowadays, ontology as a knowledge sharing approach plays an important role in semantic interoperability of enterprise applications (EAs). However, the manual process of ontology construction requires deep understanding of the domain. This approach is difficult, expensive and time-consuming. To overcome the knowledge acquisition bottleneck, ontology learning field aims to provide automatic and semi-automatic approaches for ontology generation. Several approaches have been emerged for this purpose. In this paper, we present a practical study of methods that take data models as input to the learning process. The main contributions of this work are: (i) the evaluation of the availability of existing approaches for (semi-)automatic generation of ontology from data models; (ii) the evaluation of tools according to their operability; and (iii) the evaluation of the resulting ontologies to assess their quality in supporting semantic interoperability. Our goal through this study is to find a response to the question: Is there a tool that extracts (semi-)automatically an application ontology from data models, intended for use in semantic interoperability?. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/RCIS.2013.6577694},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84884153525\&doi=10.1109\%2fRCIS.2013.6577694\&partnerID=40\&md5=09ec241e846cc2376db979b7aeff7c68},
	author = {El Idrissi, B. and Baina, S. and Baina, K.}
}
@article {Bendriss2013307,
	title = {Automatic selection of filtering devices in a distributed intrusion prevension system},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {53},
	number = {2},
	year = {2013},
	note = {cited By 0},
	pages = {307-311},
	abstract = {We presented in a previous article [1] a distributed intrusion prevention system based on honeypots for collecting malicious data. Among important questions to handle there is the choice of filtering device on which a filtering rule has to be applied. In this paper we propose a solution which will allow automatic selection of filtering device in the distributed IPMS platform. These devices will be configured to block unauthorized traffic. This solution must ensure full integration with the IPMS architecture. {\textcopyright} 2005 - 2013 JATIT \& LLS. All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84880649114\&partnerID=40\&md5=65a999baae635cb70cfb3cfd71d7a506},
	author = {Bendriss, E. and Regragui, B.}
}
@conference {Mountassir2012306,
	title = {Addressing the problem of unbalanced data sets in sentiment analysis},
	booktitle = {KDIR 2012 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval},
	year = {2012},
	note = {cited By 0},
	pages = {306-311},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84881521979\&partnerID=40\&md5=c7a7678cb1231468ccf73bfed1974063},
	author = {Mountassir, A. and Benbrahim, H. and Berrada, I.}
}
@article {Choukri20122121,
	title = {AODV protocol behavior based on H.264 multiservice traffic},
	journal = {International Review on Computers and Software},
	volume = {7},
	number = {5},
	year = {2012},
	note = {cited By 2},
	pages = {2121-2125},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84873308095\&partnerID=40\&md5=a7d603a75c0b90d10b0e6ac5e06924fe},
	author = {Choukri, A. and Amnai, M. and Habbani, A. and Elkoutbi, M.}
}
@article {5570174020110101,
	title = {Approximate performance analysis of CONWIP disciplines in unreliable non homogeneous transfer lines.},
	journal = {Annals of Operations Research},
	volume = {182},
	number = {1},
	year = {2011},
	pages = {213 - 233},
	abstract = {For a given choice of the maximum allowable total storage parameter, the performance of constant work-in-process (CONWIP) disciplines in unreliable transfer lines subjected to a constant rate of demand for parts, is characterized via a tractable approximate mathematical model. For a ( n?1) machines CONWIP loop, the model consists of n multi-state machine single buffer building blocks, separately solvable once a total of ( n?1) unknown constants shared by the building blocks are initialized. The multi-state machine is common to all building blocks, and its n discrete states approximate the joint operating state of the machines within the CONWIP loop; each of the first ( n?1) blocks maps into a single internal buffer dynamics, while the nth building block characterizes total work-in-process (wip) dynamics. The blocks correspond to linear n component state equations with boundary conditions. The unknown (shared) constants in the block dynamics are initialized and calculated by means of s},
	keywords = {Aggregation operators, CONWIP, Decomposition method (Mathematics), Decomposition/aggregation methods, Forward Kolmogorov equations, Mathematical models, Monte Carlo method, Operations research, Performance evaluation, Reliability (Engineering)},
	issn = {02545330},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=55701740\&site=ehost-live},
	author = {Mhada, Fatima and Malhame, Roland}
}
@conference {Souali2011,
	title = {An automatic ethical-based recommender system for e-commerce},
	booktitle = {International Conference on Multimedia Computing and Systems -Proceedings},
	year = {2011},
	note = {cited By 2},
	doi = {10.1109/ICMCS.2011.5945631},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79961215460\&doi=10.1109\%2fICMCS.2011.5945631\&partnerID=40\&md5=8ab17e424b6230f9880c1381229a5999},
	author = {Souali, K. and El Afia, A. and Faizi, R.}
}
@conference {Hamlili2010,
	title = {Adaptive schemes for estimating random graph parameters in mobile wireless ad hoc network{\textquoteright}s modeling},
	booktitle = {2010 IFIP Wireless Days, WD 2010},
	year = {2010},
	note = {cited By 0},
	doi = {10.1109/WD.2010.5657716},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-78751502819\&doi=10.1109\%2fWD.2010.5657716\&partnerID=40\&md5=055d128d041a7d668ab8a796c8d30dd4},
	author = {Hamlili, A.}
}
@conference {Slimani2010664,
	title = {Agent-based architecture for service ontology evolution management},
	booktitle = {SEKE 2010 - Proceedings of the 22nd International Conference on Software Engineering and Knowledge Engineering},
	year = {2010},
	note = {cited By 0},
	pages = {664-667},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79952428512\&partnerID=40\&md5=fb8a4463f0d86e641d791957722d46a3},
	author = {Slimani, S. and Baina, S. and Baina, K.}
}
@conference { ISI:000391891600123,
	title = {Agent-based Architecture for Service Ontology evolution management},
	booktitle = {22ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING \& KNOWLEDGE ENGINEERING (SEKE 2010)},
	year = {2010},
	note = {22nd International Conference on Software Engineering and Knowledge Engineering (SEKE), Redwood, CA, JUL 01-03, 2010},
	pages = {664-667},
	publisher = {Knowledge Syst Inst Grad Sch},
	organization = {Knowledge Syst Inst Grad Sch},
	abstract = {Communication between services requires a common vocabulary to allow reliable exchange of information. However services are evolving independently and their ontologies evolve too. The existing distributed ontology evolution approaches are not scaled to dynamic environments like Semantic Web service architecture. As the distributed system grows in size, the complexity of ontology change management increases, especially if the ontologies are heterogeneous. In this paper, a new approach is proposed to manage ontology evolution in distributed architecture. Our proposal consists of a set of collaborative agents which dynamically manage different ontologies and their mapping.},
	isbn = {978-1-891706-26-4},
	author = {Slimani, Soumaya and Baina, Salah and Baina, Karim}
}
@article {Zakrani2010516,
	title = {Applying radial basis function neural networks based on fuzzy clustering to estimate web applications effort},
	journal = {International Review on Computers and Software},
	volume = {5},
	number = {5},
	year = {2010},
	note = {cited By 14},
	pages = {516-524},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-78951478126\&partnerID=40\&md5=d80672acda377940a046a22117b6b033},
	author = {Zakrani, A. and Idri, A.}
}
@conference {DeBarros200937,
	title = {AQM applications in MAODV ad hoc network},
	booktitle = {16th International Conference on Telecommunications, ICT 2009},
	year = {2009},
	note = {cited By 0},
	pages = {37-40},
	doi = {10.1109/ICTEL.2009.5158615},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-77950670401\&doi=10.1109\%2fICTEL.2009.5158615\&partnerID=40\&md5=670f14dd45610aa5cd5640d6936ca1da},
	author = {De Barros, M.A.P. and El Koutbi, M.}
}
@conference { ISI:000274539400007,
	title = {AQM applications in MAODV ad hoc network},
	booktitle = {2009 INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS (ICT)},
	year = {2009},
	note = {16th International Conference on Telecommunications (ICT), Marrakech, MOROCCO, MAY 25-27, 2009},
	pages = {37-40},
	abstract = {Disaster relief, education, and military are common situations where nodes need to communicate in areas without any preexisting infrastructure. In these situations, ad-hoc networks are used. Active Queue Management (AQM) has been successfully demonstrated as a solution to the global synchronization problem in the context of wired networks. To the best of our knowledge there is limited research work on the effect of queuing mechanisms in these networks (multicast in particular). We provided performance comparisons of Priority Queuing (PriQ), Drop Tail (DT) and Deficit Round Robin (DRR) which are some queues mechanisms, in ad-hoc network using MAODV protocol.},
	isbn = {978-1-4244-2936-3},
	doi = {10.1109/ICTEL.2009.5158615},
	author = {de Barros, Manuel A. P. and El Koutbi, Mohammed}
}
@article {3318641920080701,
	title = {An Adaptation of E-learning Standards to M-learning.},
	journal = {International Journal of Interactive Mobile Technologies},
	volume = {2},
	number = {3},
	year = {2008},
	pages = {11 - 16},
	abstract = {The exploitation of technological advances in learning has result in an exponential progress in this field through e-learning applications in the last decade, and currently through the emergence of a new concept called m-learning. M-learning is defined as the use of mobile technologies for learning; m-learning must benefit from e-learning technological advances in order to avoid reinventing the wheel. Nevertheless, m-learning, which is characterized by the use of mobile devices, permits, for example, the learners{\textquoteright} mobility during their learning, and, as opposed to e-learning, allows a continuous change of the context. Moreover, m-learning faces some constraints caused by the use of its mobile technologies such as the limited screen size, reduced energy, resolution capacity and location change during an activity. Yet, there is an agreement among most research laboratories interested in e- and m- learning on the parallel use of these two learning environments. Therefore, it would be mor},
	keywords = {Computer assisted instruction, e-learning, IMS LD, Internet in education, interoperability, LOM, m-learning, Mobile communication systems in education, Online data processing, Online information services, Technological innovations, Telecommunication {\textendash} Study \& teaching, Web-based instruction, Wireless communication systems},
	issn = {18657923},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=33186419\&site=ehost-live},
	author = {Najima, Daoudi and Rachida, Ajhoun}
}
@article { ISI:000255967900006,
	title = {Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without constraint qualifications},
	journal = {RAIRO-OPERATIONS RESEARCH},
	volume = {42},
	number = {2},
	year = {2008},
	note = {4th International Conference on Operational Research, Cadi Ayyad Univ, Marrakech, MOROCCO, MAY 22-26, 2005},
	month = {APR-JUN},
	pages = {157-198},
	abstract = {In this paper, we study the differentiability of the trajectories of the logarithmic barrier algorithm for a nonlinear program when the set Lambda{*} of the Karush-Kuhn-Tuckermultiplier vectors is empty owing to the fact that the constraint qualifications are not satisfied.},
	issn = {0399-0559},
	doi = {10.1051/ro:2008008},
	author = {El Afia, A. and Benchakroun, A. and Dussault, J. -P. and El Yassini, K.}
}
@article {ElAfia2008157,
	title = {Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without constraint qualifications},
	journal = {RAIRO - Operations Research},
	volume = {42},
	number = {2},
	year = {2008},
	note = {cited By 0},
	pages = {157-198},
	doi = {10.1051/ro:2008008},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-44349158950\&doi=10.1051\%2fro\%3a2008008\&partnerID=40\&md5=85dc093209f6926a9de375305dc031bc},
	author = {El Afia, A. and Benchakroun, A. and Dussault, J.-P. and El Yassini, K.}
}
@article { ISI:000208118700002,
	title = {Adjustable SAD matching algorithm using frequency domain},
	journal = {JOURNAL OF REAL-TIME IMAGE PROCESSING},
	volume = {1},
	number = {4},
	year = {2007},
	month = {JUL},
	pages = {257-265},
	abstract = {Fast Fourier transforms (FFTs) which are O(N logN) algorithms to compute a discrete Fourier transform (DFT) of size N have been called one of the ten most important algorithms of the twentieth century. However, even though many algorithms have been developed to speed up the computation the sum of absolute difference (SAD) matching, they are exclusively designed in the spatial domain. In this paper, we propose a fast frequency algorithm to speed up the process of (SAD) matching. We use a new approach to approximate the SAD metric by cosine series which can be expressed in correlation terms. These latter can be computed using FFT algorithms. Experimental results demonstrate the effectiveness of our method when using only the first correlation terms for block and template matching in terms of accuracy and speed. The proposed algorithm is suitable for software implementations and has a deterministic execution time unlike the existing fast algorithms for SAD matching.},
	issn = {1861-8200},
	doi = {10.1007/s11554-007-0026-0},
	author = {Essannouni, F. and Haj Thami, R. Oulad and Aboutajdine, D. and Salam, A.}
}
