@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.}
}
@conference {Boumehdi2022,
	title = {Comparison of New Approaches of Semi-syllable Units for Speech Recognition of Any Arabic Word},
	booktitle = {Journal of Physics: Conference Series},
	volume = {2337},
	number = {1},
	year = {2022},
	note = {cited By 0},
	abstract = {This study uses the same semi-syllable units already defined in our previous work; a semi-syllable is a simple Arabic letter followed by its diacritic information. This work experiment with three configurations. In the first configuration, we redefine the .,3? (Soukoun is an Arabic diacritical sign representing the absence of a vowel) as a new independent phonemes that is different from the consonant itself. In the second configuration, we also redefine the geminated consonant with a new independent phoneme. In the last configuration, we combined the first two experiments. The results proved that the three configurations gave better results compared to regular semi-syllables, and the highest recognition rate was achieved on the third configuration. {\textcopyright} Published under licence by IOP Publishing Ltd.},
	keywords = {Linguistics, New approaches, Simple++, Speech recognition},
	doi = {10.1088/1742-6596/2337/1/012002},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85139524298\&doi=10.1088\%2f1742-6596\%2f2337\%2f1\%2f012002\&partnerID=40\&md5=d95255b2baa9be938dbc80cdf4c31068},
	author = {Boumehdi, A. and Yousfi, A.}
}
@article {Rhanoui20222809,
	title = {A hybrid recommender system for patron driven library acquisition and weeding},
	journal = {Journal of King Saud University - Computer and Information Sciences},
	volume = {34},
	number = {6},
	year = {2022},
	note = {cited By 2},
	pages = {2809-2819},
	abstract = {Nowadays the explosion of information sources has shaped how library users access information and provide feedback on their preferences. Therefore, faced with this explosion and the blossoming of digital libraries, modern libraries must take up the challenge of meeting the needs of their users and considering their opinions and preferences in order to offer them adequate resources and henceforth eliminate those that are unsatisfactory. Almost all library recommender systems aim to provide users with items of interest to them. However, despite its definite interest, the staff-oriented adaptation and application of this revolutionary technique to the collection development process is still in an embryonic stage. We propose a patron-driven hybrid library recommender system that uses machine learning techniques to recommend and assist in the acquisition and weeding decision-making operations by extracting and analyzing users{\textquoteright} opinions and ratings. The recommender system is applied and validated in a real national library case using Amazon{\textquoteright}s digital library and the library{\textquoteright}s catalog as a data source. {\textcopyright} 2020 The Authors},
	doi = {10.1016/j.jksuci.2020.10.017},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85096428211\&doi=10.1016\%2fj.jksuci.2020.10.017\&partnerID=40\&md5=49af7074b1295a09ce952c01fd4c7f92},
	author = {Rhanoui, M. and Mikram, M. and Yousfi, S. and Kasmi, A. and Zoubeidi, N.}
}
@article {Gong20222761,
	title = {Intelligent Reflecting Surface Aided Secure Communications for NOMA Networks},
	journal = {IEEE Transactions on Vehicular Technology},
	volume = {71},
	number = {3},
	year = {2022},
	note = {cited By 2},
	pages = {2761-2773},
	abstract = {Intelligent reflecting surface (IRS) is deemed a promising technique for future wireless and mobile technologies due to its ability to reconfigure the radio propagation environment. In this paper, we analyze the physical layer security (PLS) of a downlink non-orthogonal multiple access (NOMA) network through an IRS intended for assisting the wireless transmission, taking into account the external and internal eavesdropping scenarios. Considering the hardware limitations, a 1-bit coding scheme is utilized to investigate the secrecy performance of the IRS-aided NOMA (IRS-NOMA) network. Exact and asymptotic expressions in terms of the secrecy outage probability (SOP) and the effective secrecy throughput (EST) are presented, which are in consideration of the imperfect successive interference cancellation (ipSIC) and perfect SIC (pSIC). Based on the analytical results, the secrecy diversity orders are related to the number of reflecting elements and EST ceilings are observed in the high SNR regime. Monte Carlo simulations are presented to corroborate the correctness of the analyses and illustrate that the IRS-NOMA scheme is superior in the secrecy outage performance to the IRS-aided orthogonal multiple access scheme. In addition, the SOP performance enhancement through the increased number of reflecting elements and the improvement of EST through proper target secrecy rate are also evidenced by the simulations. {\textcopyright} 1967-2012 IEEE.},
	keywords = {Communication system security, Imperfect successive interference cancelation, Intelligent reflecting surface, Intelligent systems, Monte Carlo methods, Multiple access, Network layers, Network security, Non-orthogonal, Non-orthogonal multiple access, Physical layer security, Radio waves, Reflecting surface, Security, Security systems, Signal to noise ratio, Silicon carbide, Successive interference cancellations, Wireless communications},
	doi = {10.1109/TVT.2021.3129075},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85120062177\&doi=10.1109\%2fTVT.2021.3129075\&partnerID=40\&md5=162cfe3aedcb6d973b10e9471ffd8b94},
	author = {Gong, C. and Yue, X. and Wang, X. and Dai, X. and Zou, R. and Essaaidi, M.}
}
@article {Yousfi2022205,
	title = {The Large Annotated Corpus for the Arabic Language (LACAL)},
	journal = {Studies in Computational Intelligence},
	volume = {1061},
	year = {2022},
	note = {cited By 0},
	pages = {205-219},
	abstract = {Annotated corpora has an important role in the NLP field. They are used in almost all NLP applications: automatic dictionary construction, text analysis, information retrieval, machine translation, etc. Annotated corpora are the basis for training operation in NLP systems. Without these corpora, it is difficult to build an efficient system that takes into account all variations and linguistic phenomena. In this paper, we present the annotated corpus we developed. This corpus contains more than 12 million different words labeled by different types of labels: syntactic, morphological, and semantic. This large corpus adds value to the Arabic NLP field, and will certainly improve the quality of the training phase of Arabic NLP systems. Moreover it can be a suitable corpus to test and evaluate the quality of these systems. {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-031-14748-7_12},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85139393388\&doi=10.1007\%2f978-3-031-14748-7_12\&partnerID=40\&md5=5e4ea0e7df29b510ad4dae099d9f1725},
	author = {Yousfi, A. and Boumehdi, A. and Laaroussi, S. and Makoudi, R. and Aouragh, S.L. and Gueddah, H. and Habibi, B. and Nejja, M. and Said, I.}
}
@article {Yousfi2022,
	title = {Smart big data framework for insight discovery},
	journal = {Journal of King Saud University - Computer and Information Sciences},
	year = {2022},
	note = {cited By 2},
	abstract = {Big Data deal with new challenges such as data variety, data veracity (correct, incorrect, misleading, etc.) and data completeness (provide a single part of the overall information.). In fact, the knowledge discovered from a single source that can offer incorrect or incomplete data, may have a negative impact on the quality of decisions based on it. Therefore, integrating data coming from multiple sources allows verifying the veracity and ensuring the completeness of the results and thus improving the quality of analysis and enhancing business decisions. In this paper, we present a smart framework that falls within the Big Data value chain process and aims to improve the quality of analytical results by focusing two main concerns regarding Big Data Integration; data completeness and data veracity. The framework integrates Big Data in order to build a complete global and correct insight from heterogeneous sources. The paper presents two implementations of the framework in the context of urban and highway traffic management systems. {\textcopyright} 2021},
	doi = {10.1016/j.jksuci.2021.12.009},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85122932927\&doi=10.1016\%2fj.jksuci.2021.12.009\&partnerID=40\&md5=16742da4bfac0205224464c7c43d3855},
	author = {Yousfi, S. and Chiadmi, D. and Rhanoui, M.}
}
@article {Aloqaily20221283,
	title = {Special Issue on Internet of Things: Intelligent Networks, Communication and Mobility (AdHocNets 2020)},
	journal = {Mobile Networks and Applications},
	volume = {27},
	number = {3},
	year = {2022},
	note = {cited By 0},
	pages = {1283-1285},
	doi = {10.1007/s11036-022-01951-5},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85125040615\&doi=10.1007\%2fs11036-022-01951-5\&partnerID=40\&md5=54584bce4af47a9f2a8ead852da1944d},
	author = {Aloqaily, M. and Abdellatif, K. and Yan, F.}
}
@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 {Yousfi2021588,
	title = {An Efficient Holistic Schema Matching Approach},
	journal = {Communications in Computer and Information Science},
	volume = {1350},
	year = {2021},
	note = {cited By 0},
	pages = {588-601},
	abstract = {Schema matching allows a certain way of communication between heterogeneous, autonomous and distributed data sources. We choose the matching approach depending on the number of sources we wish to integrate: pairwise matching approaches for a small to a medium total number of data sources, and holistic matching approaches for a big to a huge number of data sources. Nevertheless, current matching approaches were proven to achieve a very moderate matching accuracy. Moreover, holistic matching approaches operate in a series of two-way matching steps. In this paper, we present hMatcher, an efficient holistic schema matching approach. To execute holistic schema matching, hMatcher captures frequent schema elements in the given domain prior to any matching operation. To achieve high matching accuracy, hMatcher uses a context-based semantic similarity measure. Experimental results on real-world domain show that hMatcher performs holistic schema matching properly, and outperforms current matching approaches in terms of matching accuracy. {\textcopyright} 2020, Springer Nature Switzerland AG.},
	keywords = {Computer science, Computers, Context-based semantics, Current matching, Distributed data sources, Holistic schema matching, Number of sources, Pairwise matching, Real world domain, Schema matching, Semantics},
	doi = {10.1007/978-3-030-69143-1_45},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85102749207\&doi=10.1007\%2f978-3-030-69143-1_45\&partnerID=40\&md5=d28b470cb44f6ca89c012259c51ec4f6},
	author = {Yousfi, A. and El Yazidi, M.H. and Zellou, A.}
}
@article {Yassine2021,
	title = {Intelligent recommender system based on unsupervised machine learning and demographic attributes},
	journal = {Simulation Modelling Practice and Theory},
	volume = {107},
	year = {2021},
	note = {cited By 22},
	abstract = {Recommendation systems aim to predict users interests and recommend items most likely to interest them. In this paper, we propose a new intelligent recommender system that combines collaborative filtering (CF) with the popular unsupervised machine learning algorithm K-means clustering. Also, we use certain user demographic attributes such as the gender and age to create segmented user profiles, when items (movies) are clustered by genre attributes using K-means and users are classified based on the preference of items and the genres they prefer to watch. To recommend items to an active user, Collaborative Filtering approach then is applied to the cluster where the user belongs. Following the experimentation for well known movies, we show that the proposed system satisfies the predictability of the CF algorithm in GroupLens. In addition, our proposed system improves the performance and time response speed of the traditional collaborative Filtering technique and the Content-Based technique too. {\textcopyright} 2020 Elsevier B.V.},
	keywords = {Collaborative filtering, Collaborative filtering techniques, Content-based techniques, Intelligent recommender system, K-means, K-means clustering, Learning algorithms, Machine learning, Most likely, Population statistics, Recommender Systems, Response speed, Unsupervised machine learning, User profile},
	doi = {10.1016/j.simpat.2020.102198},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85096665603\&doi=10.1016\%2fj.simpat.2020.102198\&partnerID=40\&md5=37861e6691cce74784d0555379aae57f},
	author = {Yassine, A. and Mohamed, L. and Al Achhab, M.}
}
@conference {Aouragh2021211,
	title = {A new estimate of the n-gram language model},
	booktitle = {Procedia CIRP},
	volume = {189},
	year = {2021},
	note = {cited By 2},
	pages = {211-215},
	abstract = {Modeling a natural language aims to build systems that are able to reproduce, correct and more or less predict the structure of a given language; moreover it summarizes the general knowledge related to that language. In this context, we have suggested a new language model which efficiently estimate the n-gram language model. This new model has made it possible to remedy the shortcomings of the n-gram language model. By using an automatic spelling error application, the evaluation of this model has been done, and after the comparison of the results obtained; we see that this new model give quick and precise results. These results show that this new proposed model better models the succession of words within sentences, and can therefore replace the n-gram model in Natural Language Processing (NLP) applications. {\textcopyright} 2021 Elsevier B.V.. All rights reserved.},
	keywords = {Arabic languages, Build systems, Computational linguistics, Correction of spelling error, Elsevier, General knowledge, Language modeling, Modeling languages, N-distant-max model, N-gram language models, Natural language processing systems, Natural languages, spelling errors},
	doi = {10.1016/j.procs.2021.05.111},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85112416933\&doi=10.1016\%2fj.procs.2021.05.111\&partnerID=40\&md5=b893c0817afa2e87e8bd68f189d60faf},
	author = {Aouragh, S.L. and Yousfi, A. and Laaroussi, S. and Gueddah, H. and Nejja, M.}
}
@article {Yousfi2021129,
	title = {SBP: Preparation of Schema Elements to~Schema Matching},
	journal = {Lecture Notes in Electrical Engineering},
	volume = {733 LNEE},
	year = {2021},
	note = {cited By 0},
	pages = {129-144},
	abstract = {Schema pre-matching is very critical for having schema elements fully ready for schema matching. Ideally, words are first extracted from the schema elements{\textquoteright} labels, and then the semantically corresponding elements are generated accordingly. Searching for the sense of words based on their vertical and horizontal contexts, and before performing schema matching is very crucial to obtain high matching accuracy and as a result increase the amount of accurate matches and reduce the number of inaccurate matches and missed matches. Nonetheless, this problem is much more challenging than it seems. This is because complete and precise information about the meaning behind each element is often unavailable. This paper presents SBP, a Sense-Based Pre-matching approach designed for hierarchical data representations. SBP consists of two main components. First, the words sets generator generates, from each element, a set of words that fully describes its meaning. Second, the words qualifier identifies the senses of words based on both their vertical and horizontal contexts. Experimental results on real-world domains show high matching accuracy obtained when using the SBP approach. {\textcopyright} 2021, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.},
	keywords = {Electrical engineering, Hierarchical data, Mathematical techniques, Pre-matching, Real world domain, Schema matching},
	doi = {10.1007/978-981-33-4909-4_10},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85107373285\&doi=10.1007\%2f978-981-33-4909-4_10\&partnerID=40\&md5=8abeb96c3db9e0d4b54e753de8bc994e},
	author = {Yousfi, A. and El Yazidi, M.H. and Zellou, A.}
}
@conference {Oumaima2021,
	title = {Vision-based fall detection and prevention for the elderly people: A review ongoing research},
	booktitle = {5th International Conference on Intelligent Computing in Data Sciences, ICDS 2021},
	year = {2021},
	note = {cited By 0},
	abstract = {Falls are the most leading cause of accidental injury deaths worldwide, therefore, it poses a real challenge for the prevention of life-threatening conditions in geriatrics. The most damaged community is the ever-growing aging population. For this reason, there are considerable demands to distinguish a dangerous posture such as fall in real-time. Here we provide a literature review of conducted work on elderly fall detection and prediction mentioning the main methods to recognize human posture including computer vision-based and wearable sensor-based. We approached these perspectives: sensor fusion, Datasets, approaches proposition. In conclusion, our survey summarizes the progress achieved in the five past years to help the researchers in this field to spot areas where further effort would be beneficial and innovative. {\textcopyright} 2021 IEEE.},
	keywords = {Accident prevention, Accidental injuries, Computer vision, Dataset, Elderly, Elderly people, Fall detection, Fall prediction, Fall prevention, Life threatening conditions, Sensor, Vision based, Wearable sensors},
	doi = {10.1109/ICDS53782.2021.9626736},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85123493902\&doi=10.1109\%2fICDS53782.2021.9626736\&partnerID=40\&md5=c99b20a9a8a522cc9440679b23da4ceb},
	author = {Oumaima, G. and Hamd, A.A. and Youness, T. and Rachid, O.H.T. and Omar, B.}
}
@article {Zou2021,
	title = {Wind turbine power curve modeling using an asymmetric error characteristic-based loss function and a hybrid intelligent optimizer},
	journal = {Applied Energy},
	volume = {304},
	year = {2021},
	note = {cited By 4},
	abstract = {Wind energy is one of the most promising solutions to energy crisis and environmental pollution, so it is being developed rapidly. Wind turbine power curves (WTPCs) play an important role in wind energy assessment, turbine condition monitoring, and power grid dispatching. However, there are two challenges in WTPC modeling: model selection and parameter optimization. Many parametric and non-parametric models have been developed to characterize WTPCs, but none can always perform the best due to the complex wind regimes. In this paper, considering the simple structure and interpretability of model parameters, a set of parametric WTPC models is constructed to adapt to the variability of wind regimes, and the optimal candidate will be selected from the set according to their performances. As to the process of parameter optimization, a novel loss function, which considers the asymmetric error characteristic of WTPC modeling, is proposed, and a hybrid intelligent optimization method named GWO-BSA, which makes full use of the advantages of grey wolf optimizer and backtracking search algorithm, is designed. Finally, a novel WTPC modeling strategy, which combines the candidate model set, error characteristic-based loss function, and GWO-BSA, is proposed to obtain better power curves. Experimental results show that (1) GWO-BSA shows faster convergence speed and higher optimization accuracy than single optimization algorithms; (2) the proposed error characteristic-based loss function has better performance than the commonly used symmetric loss functions; and (3) compared with some popular artificial intelligence-based models, the designed WTPC modeling strategy produces better WTPCs under different wind regimes. {\textcopyright} 2021 Elsevier Ltd},
	keywords = {alternative energy, Asymmetric error characteristic, Asymmetric errors, Condition monitoring, Curve fitting, Curve modeling, Electric load dispatching, Electric power transmission networks, energy efficiency, Energy policy, energy use, Error characteristic-based loss function, Error characteristics, Errors, hybrid, Hybrid optimization algorithm, Loss functions, Optimization, Power curves, power generation, Wind power, wind turbine, Wind turbine power, Wind turbine power curve modeling, Wind turbines},
	doi = {10.1016/j.apenergy.2021.117707},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85114406958\&doi=10.1016\%2fj.apenergy.2021.117707\&partnerID=40\&md5=2247666b1228f85e03abc68add3c45d2},
	author = {Zou, R. and Yang, J. and Wang, Y. and Liu, F. and Essaaidi, M. and Srinivasan, D.}
}
@article {Yousfi202050,
	title = {Comparative study of cnn and lstm for opinion mining in long text},
	journal = {Journal of Automation, Mobile Robotics and Intelligent Systems},
	volume = {14},
	number = {3},
	year = {2020},
	note = {cited By 0},
	pages = {50-55},
	abstract = {The digital revolution has encouraged many companies to set up new strategic and operational mechanisms to supervise the flow of information published about them on the Web. Press coverage analysis is a part of sentiment analysis that allows companies to discover the opinion of the media concerning their activities, products and services. It is an important research area, since it involves the opinion of informed public such as journalists, who may influence the opinion of their readers. However, from an implementation perspective, the analysis of the opinion from media coverage encounters many challenges. In fact, unlike social networks, the Media coverage is a set of large textual documents written in natural language. The training base being huge, it is necessary to adopt large-scale processing techniques like Deep Learning to analyze their content. To guide researchers to choose between one of the most commonly used models CNN and LSTM, we compare and apply both models for opinion mining from long text documents using real datasets. {\textcopyright} 2020, Industrial Research Institute for Automation and Measurements. All rights reserved.},
	doi = {10.14313/JAMRIS/3-2020/34},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100520263\&doi=10.14313\%2fJAMRIS\%2f3-2020\%2f34\&partnerID=40\&md5=fc9c41966d823ca1951c9f01e3fa341c},
	author = {Yousfi, S. and Rhanoui, M. and Mikram, M.}
}
@conference {Boumehdi2020145,
	title = {Construction of a database for speech recognition of isolated Arabic words},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2020},
	note = {cited By 0},
	pages = {145-150},
	abstract = {Automatic speech recognition for the Arabic language is a field that is in a current remarkable development and still attracts many researchers who try to improve year after year the recognition rate. Many works nowadays have been focused on automatic speech recognition (ASR) for the Arabic language. The paper presents the significance of the ASR systems built in the past few years. This work also aims to introduce a new Arabic database for isolated word by defining a new concept of phonetic units: semi-syllable units. Thus the corpus contains a collection of semi-syllable audio files as well as their corresponding transcription files. This database will help us in future works. {\textcopyright} 2020 ACM.},
	keywords = {Arabic database, Arabic languages, Audio files, Automatic speech recognition, Database systems, Intelligent systems, Isolated words, Phonetic units, Speech recognition},
	doi = {10.1145/3419604.3419752},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85096426261\&doi=10.1145\%2f3419604.3419752\&partnerID=40\&md5=257aeddd47cbb6849d761b06d43eaef2},
	author = {Boumehdi, A. and Yousfi, A.}
}
@conference {Yousfi2020,
	title = {CSSM: A context-based semantic similarity measure},
	booktitle = {2020 IEEE 2nd International Conference on Electronics, Control, Optimization and Computer Science, ICECOCS 2020},
	year = {2020},
	note = {cited By 1},
	abstract = {Semantic similarity is very critical in applications that manipulate data across heterogeneous, autonomous and distributed data sources. It helps connect these data sources. Nevertheless, current semantic similarity approaches were proven to achieve a very moderate accuracy. Furthermore, they are merely applicable when we wish to determine the semantic similarity between words. In this paper, we present CSSM, a Context-based Semantic Similarity Measure. Experimental results on Miller Charles benchmark dataset show that CSSM performs semantic similarity comparisons properly, and obtains high accuracy. {\textcopyright} 2020 IEEE.},
	keywords = {Benchmark datasets, Computer science, Computers, Context-based semantics, Control engineering, Data-sources, Distributed data sources, Electronics engineering, Electronics industry, High-accuracy, Semantic similarity, Semantic similarity approaches, Semantics},
	doi = {10.1109/ICECOCS50124.2020.9314376},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100120972\&doi=10.1109\%2fICECOCS50124.2020.9314376\&partnerID=40\&md5=3191da8d69fa40844c69e41c268c5a17},
	author = {Yousfi, A. and El Yazidi, M.H. and Zellou, A.}
}
@article {Yatribi2020226,
	title = {An Efficient and Secure Forward Error Correcting Scheme for DNA Data Storage},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {942},
	year = {2020},
	note = {cited By 0},
	pages = {226-237},
	abstract = {In this paper, a new efficient error correcting scheme for DNA archival digital data storage is proposed. We devise a double protection scheme for DNA oligos, aiming to ensure the protection of both information and indexing header data from both symbol flipping and erasure-burst errors, using two different cyclic ternary difference-set codes, which are known to be completely orthogonalisable and very easy to decode using a simple majority-logic decoding algorithm. We show that the proposed scheme is efficient and easily scalable, and provides a coding potential of 1.97 bit per nucleotide, and a reasonable net information density of 0.75 bit/nt under the considered experimental conditions, with relatively a lower decoding complexity and costs compared to other DNA data storage approaches. {\textcopyright} 2020, Springer Nature Switzerland AG.},
	keywords = {Bioinformatics, Decoding, Decoding complexity, Difference sets, Digital storage, DNA, Error correcting scheme, Errors, Experimental conditions, Forward error correcting, Gene encoding, Information density, Majority logic, Pattern recognition, Protection schemes, Simple majority, Soft computing},
	doi = {10.1007/978-3-030-17065-3_23},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85064931520\&doi=10.1007\%2f978-3-030-17065-3_23\&partnerID=40\&md5=215574899d2a75166c0a2fc343cb673e},
	author = {Yatribi, A. and Belkasmi, M. and Ayoub, F.}
}
@article {Yatribi2020,
	title = {Gradient-descent decoding of one-step majority-logic decodable codes},
	journal = {Physical Communication},
	volume = {39},
	year = {2020},
	note = {cited By 1},
	abstract = {In this paper, a new low-complexity gradient-descent based iterative majority-logic decoder (GD-MLGD) is proposed for decoding One-Step Majority-Logic Decodable (OSMLD) codes. We give a formulation of the decoding problem of binary OSMLD codes, as a maximization problem of a derivable objective function. The optimization problem is solved using a pseudo gradient-descent algorithm, which performs iteratively an update towards the optimal estimated codeword been transmitted, based on the first-order partial derivatives of each variable calculated in the previous iteration. The proposed decoding scheme achieves a fast convergence to an optimum codeword compared to other decoding techniques reviewed in this paper, at the cost of lower computational complexity. The quantized version (QGD-MLGD) is also proposed in order to further reduce the computational complexity. Simulation results show that the proposed decoding algorithms outperform all the existing majority-logic decoding schemes, and also various gradient-descent based bit-flipping algorithms, and performs nearly close to the belief propagation sum{\textendash}product (BP-SP) decoding algorithm of LDPC codes, especially for high code lengths, providing an efficient trade-off between performance and decoding complexity. Moreover, the proposed quantized algorithm has shown to perform better than all the existing decoding techniques. The proposed decoding algorithms have shown to be suitable for ultra reliable, low latency and energy-constrained communication systems where both high performances and low-complexity are required. {\textcopyright} 2020 Elsevier B.V.},
	keywords = {AWGN channel, Backpropagation, Computational complexity, Computer circuits, Decoding complexity, Difference sets, Economic and social effects, Electronic trading, Gradient descent, Gradient methods, Iterative decoding, LDPC codes, Majority logic, Majority logic decoding, Maximum likelihood, Maximum likelihood decoding, Optimization, OSMLD codes},
	doi = {10.1016/j.phycom.2019.100999},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85077749482\&doi=10.1016\%2fj.phycom.2019.100999\&partnerID=40\&md5=830156cfb12a8ec3dbff2e002b3ade63},
	author = {Yatribi, A. and Belkasmi, M. and Ayoub, F.}
}
@article {YATRIBI2020100999,
	title = {Gradient-descent decoding of one-step majority-logic decodable codes},
	journal = {Physical Communication},
	volume = {39},
	year = {2020},
	pages = {100999},
	abstract = {In this paper, a new low-complexity gradient-descent based iterative majority-logic decoder (GD-MLGD) is proposed for decoding One-Step Majority-Logic Decodable (OSMLD) codes. We give a formulation of the decoding problem of binary OSMLD codes, as a maximization problem of a derivable objective function. The optimization problem is solved using a pseudo gradient-descent algorithm, which performs iteratively an update towards the optimal estimated codeword been transmitted, based on the first-order partial derivatives of each variable calculated in the previous iteration. The proposed decoding scheme achieves a fast convergence to an optimum codeword compared to other decoding techniques reviewed in this paper, at the cost of lower computational complexity. The quantized version (QGD-MLGD) is also proposed in order to further reduce the computational complexity. Simulation results show that the proposed decoding algorithms outperform all the existing majority-logic decoding schemes, and also various gradient-descent based bit-flipping algorithms, and performs nearly close to the belief propagation sum{\textendash}product (BP-SP) decoding algorithm of LDPC codes, especially for high code lengths, providing an efficient trade-off between performance and decoding complexity. Moreover, the proposed quantized algorithm has shown to perform better than all the existing decoding techniques. The proposed decoding algorithms have shown to be suitable for ultra reliable, low latency and energy-constrained communication systems where both high performances and low-complexity are required.},
	keywords = {AWGN channels, Decoding complexity, Difference-set codes, Finite geometry LDPC codes, Gradient-descent decoding, Iterative majority-logic decoding, Maximum likelihood decoding, OSMLD codes},
	issn = {1874-4907},
	doi = {https://doi.org/10.1016/j.phycom.2019.100999},
	url = {https://www.sciencedirect.com/science/article/pii/S1874490719306184},
	author = {Anouar Yatribi and Mostafa Belkasmi and Fouad Ayoub}
}
@conference {Yousfi2020155,
	title = {HASSO: A highly-automated source selection and ordering system based on data quality factors},
	booktitle = {2020 International Conference on Advanced Computer Science and Information Systems, ICACSIS 2020},
	year = {2020},
	note = {cited By 0},
	pages = {155-164},
	abstract = {Big data integration gives access to a large number of data sources through a unified user interface. Answers include high-quality data, medium-quality data, and low-quality data. Selecting a subset of high accurate and consistent data sources and ordering them appropriately is critical to obtain as many high-quality answers as possible right after querying few data sources. However, the process of selecting and ordering data sources can be quite complicated and can present several challenges. The main challenge faced during that process is identifying the most adequate data quality factors to consider. In this paper, we present HASSO, a Highly-Automated Source Selection and Ordering System based on data quality factors. To produce consistent and high accurate answers, HASSO identifies, for each data source, its domain, data consistency and data accuracy using the schema matches. To maximize the total number of complete and non-redundant answers returned right after querying a small number of data sources, HASSO orders data sources in terms of their data overlap and in a decreasing order of their overall coverage. Experimental results in real-world domains show that HASSO produces high-quality answers at high speed. {\textcopyright} 2020 IEEE.},
	keywords = {Data accuracy, Data consistency, Data integration, High quality data, Information systems, Information use, Low quality datum, Number of datum, Order systems, Real world domain, Source selection, User interfaces},
	doi = {10.1109/ICACSIS51025.2020.9263243},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85099753285\&doi=10.1109\%2fICACSIS51025.2020.9263243\&partnerID=40\&md5=b3fbfb1a2a633f6f2b8dce8ca9bc392f},
	author = {Yousfi, A. and Yazidi, M.H.E. and Zellou, A.}
}
@article {RHANOUI2020,
	title = {A hybrid recommender system for patron driven library acquisition and weeding},
	journal = {Journal of King Saud University - Computer and Information Sciences},
	year = {2020},
	abstract = {Nowadays the explosion of information sources has shaped how library users access information and provide feedback on their preferences. Therefore, faced with this explosion and the blossoming of digital libraries, modern libraries must take up the challenge of meeting the needs of their users and considering their opinions and preferences in order to offer them adequate resources and henceforth eliminate those that are unsatisfactory. Almost all library recommender systems aim to provide users with items of interest to them. However, despite its definite interest, the staff-oriented adaptation and application of this revolutionary technique to the collection development process is still in an embryonic stage. We propose a patron-driven hybrid library recommender system that uses machine learning techniques to recommend and assist in the acquisition and weeding decision-making operations by extracting and analyzing users{\textquoteright} opinions and ratings. The recommender system is applied and validated in a real national library case using Amazon{\textquoteright}s digital library and the library{\textquoteright}s catalog as a data source.},
	keywords = {Acquisition, Library Management, Machine learning, Recommender Systems, Weeding},
	issn = {1319-1578},
	doi = {https://doi.org/10.1016/j.jksuci.2020.10.017},
	url = {https://www.sciencedirect.com/science/article/pii/S1319157820305103},
	author = {Maryem Rhanoui and Mounia Mikram and Siham Yousfi and Ayoub Kasmi and Naoufel Zoubeidi}
}
@conference {Khaoula2020,
	title = {The integrated multi-plant production routing problem with simultaneous delivery and pickup},
	booktitle = {Proceedings - 2020 5th International Conference on Logistics Operations Management, GOL 2020},
	year = {2020},
	note = {cited By 1},
	abstract = {The Production Routing Problem (PRP) is concerned with coordinating the manufacturing, holding, distribution, and routing decisions to meet customer demands with an objective of minimizing the total operational costs for a defined period. The PRP can be expanded unaffectedly to concern reverse logistics and return flow processes, which typically consist on collecting used products or recyclable packaging from consumers to the depot or plant for a potential refurbishment, upgrading or recycling. Here, we will model and resolve to optimality the Multiple Plant Production Routing Problem in a Reverse Logistics context. {\textcopyright} 2020 IEEE.},
	keywords = {Customer demands, Manufacture, Multi-plants, Plant production, Return flow, Reverse logistics, Routing decisions, Routing problems, Used product},
	doi = {10.1109/GOL49479.2020.9314715},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100174617\&doi=10.1109\%2fGOL49479.2020.9314715\&partnerID=40\&md5=439e942e353af832a22471f4c9ac7fb3},
	author = {Khaoula, B. and Mohammed, E.A. and Youssef, B.}
}
@conference {Yousfi202085,
	title = {Spm: Preparing hierarchical data structures for schema matching},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2020},
	note = {cited By 0},
	pages = {85-90},
	abstract = {Schema pre-matching approaches prepare different schema elements for the matching step. Ideally words are extracted from schema elements{\textquoteright} labels and the semantic correspondences are generated. Identifying the sense of words based on their contexts and before schema matching is critical for increasing the total amount of true matches and decreasing significantly the total amount of both missed matches and false matches. However this problem is very challenging since we often do not have complete and precise information about the meaning behind each element. In this paper we present SPM a Sense-based Pre-Matching approach. SPM has two key modules. First the Sets of Words Generator module generates from every schema element a set of words that describes its meaning. Second the Sense Identifier module selects the most appropriate meaning of words based on their contexts. Experimental results on real-world datasets show high effectiveness achieved by SPM. {\textcopyright} 2020 ACM.},
	keywords = {False matches, Hierarchical data structure, Intelligent systems, Pre-matching, Real-world datasets, Schema matching, Semantic correspondence, Semantics},
	doi = {10.1145/3419604.3419782},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85096412741\&doi=10.1145\%2f3419604.3419782\&partnerID=40\&md5=0ace2c18d2f9dd1d741d0d08acb83cfa},
	author = {Yousfi, A. and El Yazidi, M.H. and Zellou, A.}
}
@article {Yousfi20203,
	title = {Towards a Holistic Schema Matching Approach Designed for Large-Scale Schemas},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {12496 LNAI},
	year = {2020},
	note = {cited By 0},
	pages = {3-15},
	abstract = {Holistic schema matching is a fundamental challenge in the big data integration domain. Ideally, clusters of semantically corresponding elements are created and are updated as more schemas are matched. Developing a high-quality holistic schema matching approach is critical for two main reasons. First, identifying as many accurate and holistic semantic correspondences as possible right from the beginning. Second, reducing considerably the search space. Nevertheless, this problem is challenging since overlapping schema elements are not available. Identifying schema overlaps is further complicated for two main reasons: (1) there is a large number of schemas; and (2) overlaps vary for different schemas. In this paper we present HMO, a Holistic schema Matching approach based on schema Overlaps and designed for large-scale schemas. HMO can balance the search space and the quality of the holistic semantic correspondences. To narrow down the search space, HMO matches schemas based on their overlaps. To obtain high-accuracy, HMO uses an existing high-quality semantic similarity measure. Experimental results on four real-world domains show effectiveness and scalability of our matching approach. {\textcopyright} 2020, Springer Nature Switzerland AG.},
	keywords = {Artificial intelligence, Data integration, High quality, High-accuracy, Holistic schema matching, Real world domain, Search spaces, Semantic correspondence, Semantic similarity measures, Semantics},
	doi = {10.1007/978-3-030-63007-2_1},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85097530171\&doi=10.1007\%2f978-3-030-63007-2_1\&partnerID=40\&md5=aed75e2b584acebebdce7bf0dc2cc076},
	author = {Yousfi, A. and Yazidi, M.H.E. and Zellou, A.}
}
@article {Mikram202071,
	title = {Unit load devices (Uld) demand forecasting in the air cargo fooptimal cost management},
	journal = {Journal of Automation, Mobile Robotics and Intelligent Systems},
	volume = {14},
	number = {3},
	year = {2020},
	note = {cited By 0},
	pages = {71-80},
	abstract = {In recent decades, the airline industry has become very competitive. With the advent of large aircraft in service, unit load devices (ULD) have become an essential element for efficient air transport. They can load a large amount of baggage, cargo or mail using only one unit. Since this results in fewer units to load, saving time and efforts of ground crews and helping to avoid delayed flights. However, a deficient loading of the units causes operating irregularities, costing the company and contributing to the dissatisfaction of the customers. In contrast, an excess load of containers is at the expense of cargo. In this paper we propose an approach to predict the demand for baggage in order to optimize the management of its ULD flow. Specifically, we build prediction models: ARIMA following the BOX-JENKINS approach and exponential smoothing methods, in order to obtain more accurate forecasts. The approach is tested using the operational data of flight processing and the results are compared with four benchmark method (SES, DES, Holt-Winters and Naive prediction) using different performance indicators: MAE, MSE, MAPE, WAPE, RMSE, SMPE. The results obtained with the exponential smoothing methods surpass the benchmarks by providing more accurate forecasts. {\textcopyright} 2020, Industrial Research Institute for Automation and Measurements. All rights reserved.},
	doi = {10.14313/JAMRIS/3-2020/37},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100524740\&doi=10.14313\%2fJAMRIS\%2f3-2020\%2f37\&partnerID=40\&md5=2a7b355fdf9b83161cf3d7a9c85f19b8},
	author = {Mikram, M. and Rhanoui, M. and Yousfi, S. and Briwa, H.}
}
@article {Yousfi2020655,
	title = {xMatcher: Matching extensible markup language schemas using semantic-based techniques},
	journal = {International Journal of Advanced Computer Science and Applications},
	volume = {11},
	number = {8},
	year = {2020},
	note = {cited By 8},
	pages = {655-665},
	abstract = {Schema matching is a critical step in data integration systems. Most recent schema matching systems require a manual double-check of the matching results to add missed matches and remove incorrect matches. Manual correction is labor-intensive and time-consuming, however without it the results accuracy is significantly lower. In this paper, we present xMatcher, an approach to automatically match XML schemas. Given two schemas S and S2, xMatcher identifies semantically similar schema elements between S and S2. To obtain correct matches, xMatcher first transforms S and S2 into sets of words; then, it uses a context-based measure to identify the meanings of words in their contexts; next, it captures semantic relatedness between sets of words in different schemas; finally, it uses WordNet information to calculate the similarity values between semantically related sets and matches the pairs of sets whose similarity values are greater than or equal to 0:8. The results show that xMatcher provides superior matching accuracy compared to the state of the art matching systems. Overall, our proposal can be a stepping stone towards decreasing human assistance and overcoming the weaknesses of current matching initiatives in terms of matching accuracy. {\textcopyright} 2020, Science and Information Organization.},
	keywords = {Critical steps, Data integration, Data integration system, Hypertext systems, Labor time, Matching accuracy, Matching system, Matchings, Ontology, Schema matching, Semantic relatedness, Semantic similarity, Semantics, Wordnet, XML},
	doi = {10.14569/IJACSA.2020.0110880},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85091018595\&doi=10.14569\%2fIJACSA.2020.0110880\&partnerID=40\&md5=dff26b18d541472b808a6d6c85f08039},
	author = {Yousfi, A. and El Yazidi, M.H. and Zellou, A.}
}
@conference {Nizar2019,
	title = {Community Detection System in Online Social Network},
	booktitle = {5th International Symposium on Innovation in Information and Communication Technology, ISIICT 2018},
	year = {2019},
	note = {cited By 0},
	doi = {10.1109/ISIICT.2018.8613285},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85062188235\&doi=10.1109\%2fISIICT.2018.8613285\&partnerID=40\&md5=bc5e69525cc6681376f4f2d621ffe1da},
	author = {Nizar, L. and Yahya, B. and Mohammed, E.}
}
@article {Yousfi201979,
	title = {Mixed-Profiling Recommender Systems for Big Data Environment},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {756},
	year = {2019},
	note = {cited By 0},
	pages = {79-89},
	doi = {10.1007/978-3-319-91337-7_8},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85047301457\&doi=10.1007\%2f978-3-319-91337-7_8\&partnerID=40\&md5=95ad0c9dc701ce47a8fefa5d66452387},
	author = {Yousfi, S. and Rhanoui, M. and Chiadmi, D.}
}
@article {Yousfi2019207,
	title = {Towards a generic multimodal architecture for batch and streaming Big Data integration},
	journal = {Journal of Computer Science},
	volume = {15},
	number = {1},
	year = {2019},
	note = {cited By 0},
	pages = {207-220},
	doi = {10.3844/jcssp.2019.207.220},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85061562274\&doi=10.3844\%2fjcssp.2019.207.220\&partnerID=40\&md5=5e332b31353f824de4847e4a59a0d84a},
	author = {Yousfi, S. and Rhanoui, M. and Chiadmi, D.}
}
@article {Yassir2019241,
	title = {Workflow scheduling issues and techniques in cloud computing: A systematic literature review},
	journal = {Lecture Notes in Networks and Systems},
	volume = {49},
	year = {2019},
	note = {cited By 0},
	pages = {241-263},
	doi = {10.1007/978-3-319-97719-5_16},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85063261799\&doi=10.1007\%2f978-3-319-97719-5_16\&partnerID=40\&md5=b5aad3942ddfba849ff2d274368dd76b},
	author = {Yassir, S. and Mostapha, Z. and Claude, T.}
}
@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 {Landrigan2018462,
	title = {The Lancet Commission on pollution and health},
	journal = {The Lancet},
	volume = {391},
	number = {10119},
	year = {2018},
	pages = {462-512},
	doi = {10.1016/S0140-6736(17)32345-0},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85031763844\&doi=10.1016\%2fS0140-6736\%2817\%2932345-0\&partnerID=40\&md5=a37689cb0e79594159ee6f8afc55fae1},
	author = {Landrigan, P.J. and Fuller, R. and Acosta, N.J.R. and Adeyi, O. and Arnold, R. and Basu, N.N. and Bald{\'e}, A.B. and Bertollini, R. and Bose-O{\textquoteright}Reilly, S. and Boufford, J.I. and Breysse, P.N. and Chiles, T. and Mahidol, C. and Coll-Seck, A.M. and Cropper, M.L. and Fobil, J. and Fuster, V. and Greenstone, M. and Haines, A. and Hanrahan, D. and Hunter, D. and Khare, M. and Krupnick, A. and Lanphear, B. and Lohani, B. and Martin, K. and Mathiasen, K.V. and McTeer, M.A. and Murray, C.J.L. and Ndahimananjara, J.D. and Perera, F. and Poto{\v c}nik, J. and Preker, A.S. and Ramesh, J. and Rockstr{\"o}m, J. and Salinas, C. and Samson, L.D. and Sandilya, K. and Sly, P.D. and Smith, K.R. and Steiner, A. and Stewart, R.B. and Suk, W.A. and van Schayck, O.C.P. and Yadama, G.N. and Yumkella, K. and Zhong, M.}
}
@conference {Bennouri2018112,
	title = {A pursuit learning solution to underwater communications with limited mobility agents},
	booktitle = {Proceedings of the 2018 Research in Adaptive and Convergent Systems, RACS 2018},
	year = {2018},
	pages = {112-117},
	doi = {10.1145/3264746.3264798},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85056895227\&doi=10.1145\%2f3264746.3264798\&partnerID=40\&md5=aa7cd573ad4e924d806689aceb8057a6},
	author = {Bennouri, H. and Yazidi, A. and Berqia, A.}
}
@book {Thatcher201823,
	title = {A sustainable system-of-systems approach: Identifying the important boundaries for a target system in human factors and ergonomics},
	series = {Ergonomics and Human Factors for a Sustainable Future: Current Research and Future Possibilities},
	year = {2018},
	pages = {23-45},
	doi = {10.1007/978-981-10-8072-2_2},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85060697281\&doi=10.1007\%2f978-981-10-8072-2_2\&partnerID=40\&md5=63490266dc439c499fbf5cabf61c204f},
	author = {Thatcher, A. and Yeow, P.H.}
}
@conference {Youssef2017,
	title = {Intrusion detection in cloud computing based attacks patterns and risk assessment},
	booktitle = {Proceedings - 2016 3rd International Conference on Systems of Collaboration, SysCo 2016},
	year = {2017},
	note = {cited By 0},
	abstract = {This paper focuses on detecting and analyzing cyber-attacks in cloud environment, it represents a novel approach of detecting cyber-attacks by analyzing attacks pattern using risk assessment methodologies. The aims of our solution is to combine evidences obtained from Intrusion Detection Systems (IDS) deployed in cloud services with data of risk assessment related to each attack pattern. Our approach presents a new qualitative solution for analyzing each symptom, indicator and vulnerability to detect the impact and likelihood of distributed and multi-steps attacks directed to cloud environments. The implementation of this approach will minimize the false positive alerts and will improve the performance of the IDS. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/SYSCO.2016.7831341},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85013877237\&doi=10.1109\%2fSYSCO.2016.7831341\&partnerID=40\&md5=7979e48da64722d85786884f412eca50},
	author = {Youssef, B.C. and Nada, M. and Elmehdi, B. and Boubker, R.}
}
@conference {Yatribi2017,
	title = {Non-binary cyclic majority-logic decodable codes: An algebraic construction by using Genetic Algorithms},
	booktitle = {2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 - Proceedings},
	year = {2017},
	note = {cited By 0},
	abstract = {In this paper, the construction of non binary cyclic One-Step Majority-Logic decoding codes from the dual domain and idempotents is investigated. This had led us to propose a new design algorithm based on Genetic Algorithms, as an extension to previous works on the binary field. With the proposed algorithm, we were able to obtain long new non-binary cyclic OSMLD codes with high coding rates and good correction capacities. In fact, two powerful properties of the algebraic construction are provided, firstly, the designed codes have their minimal distances dmin and dimensions calculated analyticaly, secondly, they can be decoded with a low-complexity majority-voting decoding scheme. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ACOSIS.2016.7843935},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015215915\&doi=10.1109\%2fACOSIS.2016.7843935\&partnerID=40\&md5=4e462ad826ef141669b51bb0bf07198c},
	author = {Yatribi, A. and Belkasmi, M. and Ayoub, F. and M{\textquoteright}rabet, Z.}
}
@conference {ElMouaatamid2017,
	title = {One-step majority-logic decodable codes derived from oval designs},
	booktitle = {Proceedings - 2017 International Conference on Wireless Networks and Mobile Communications, WINCOM 2017},
	year = {2017},
	note = {cited By 0},
	abstract = {In this paper, we investigate the combinatorial design of a new class of One-Step Majority-Logic Decodable (OSMLD) codes, based on Balanced Incomplete Block Designs of type Oval, which are derived from finite geometry. We show that the constructed OSMLD codes provides high rates in addition to good correction capacities. Simulation results shows that the proposed codes converge well under iterative decoding with an efficient tradeoff between complexity and performances. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/WINCOM.2017.8238185},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041435738\&doi=10.1109\%2fWINCOM.2017.8238185\&partnerID=40\&md5=cc9a3eeb1781ff8e1ea9d4a775da4221},
	author = {El Mouaatamid, O. and Lahmer, M. and Belkasmi, M. and M{\textquoteright}rabet, Z. and Yatribiz, A.}
}
@conference {Gueddah2016,
	title = {The filtered combination of the weighted edit distance and the Jaro-Winkler distance to improve spellchecking Arabic texts},
	booktitle = {Proceedings of IEEE/ACS International Conference on Computer Systems and Applications, AICCSA},
	volume = {2016-July},
	year = {2016},
	note = {cited By 0},
	abstract = {The digital environments for human learning have been much evolving thanks to the incredible progress of information technologies. This is particularly the case for automatic correction of spelling errors requested by a large majority of people nowadays. Almost all of the current spellcheckers are semiautomatic, and they enable users to find the good solution for a committed error. The major shortcoming of the existing metric methods of correction lies in the bad scheduling of the solutions suggested to the spellchecking out of context of a detected error. To overcome this limitation, we have developed several approaches which suggest probability costs estimated from a learning test. It is attributed in various editing operations during calculating measure of similarity, case of the edit distance. The idea developed in this work was to know how to efficiently weigh these editing operations without resorting to a phase of learning. This is based only on the proximity and the similarity between Arabic keyboard keys. Additionally, we have suggested combining this measure with the distance of Jaro-Winkler in order to better filter, refine and weigh certain solutions compared to others. The experimental results stem from tests conducted on errors committed in a learning corpus, trying to validate the choices of conception and to prove the interest of both approaches. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/AICCSA.2015.7507128},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84980349949\&doi=10.1109\%2fAICCSA.2015.7507128\&partnerID=40\&md5=4274ec18faa9128a9efb4ef1c135fe25},
	author = {Gueddah, H.a and Yousfi, A.b and Belkasmi, M.a}
}
@article { ISI:000377221300068,
	title = {Iterative Threshold Decoding Of High Rates Quasi-Cyclic OSMLD Codes},
	journal = {INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS},
	volume = {7},
	number = {4},
	year = {2016},
	month = {APR},
	pages = {518-528},
	abstract = {Majority logic decoding (MLD) codes are very powerful thanks to the simplicity of the decoder. Nevertheless, to find constructive families of these codes has been recognized to be a hard job. Also, the majority of known MLD codes are cyclic which are limited in the range of the rates. In this paper a new adaptation of the Iterative threshold decoding algorithm is considered, for decoding Quasi-Cyclic One Step Majority logic codes (QC-OSMLD) codes of high rates. We present the construction of QC-OSMLD codes based on Singer difference sets of rate 1/2, and codes of high rates based on Steiner triple system which allows to have a large choice of codes with different lengths and rates. The performances of this algorithm for decoding these codes on both Additive White Gaussian Noise (AWGN) channel and Rayleigh fading channel, to check its applicability in wireless environment, is investigated.},
	issn = {2158-107X},
	author = {Rkizat, Karim and Yatribi, Anouar and Lahmer, Mohammed and Belkasmi, Mostafa}
}
@conference { ISI:000376431400014,
	title = {A Lightweight System for Correction of Arabic Derived Words},
	booktitle = {PROCEEDINGS OF THE MEDITERRANEAN CONFERENCE ON INFORMATION \& COMMUNICATION TECHNOLOGIES 2015, VOL 1},
	series = {Lecture Notes in Electrical Engineering},
	volume = {380},
	year = {2016},
	note = {Mediterranean Conference on Information and Communication Technologies (MedCT), MOROCCO, MAY 07-09, 2015},
	pages = {131-138},
	abstract = {In this paper, we address the lexicon insufficient problem used in the automatic spell checker. In order to solve that deficiency, we developed an approach that aims to correct the derived words, considering that the most Arabic words are derived ones by adjusting the Levenshtein algorithm to our need. This method is based on a corpus constituted of surface patterns and roots characterized by a scaled down size compared to conventional approaches The proposed method reduced the execution time while maintaining the highest correction rate.},
	isbn = {978-3-319-30301-7; 978-3-319-30299-7},
	issn = {1876-1100},
	doi = {10.1007/978-3-319-30301-7\_14},
	author = {Nejja, Mohammed and Yousfi, Abdellah},
	editor = {ElOualkadi, A and Choubani, F and ElMoussati, A}
}
@article {Nejja2016131,
	title = {A lightweight system for correction of Arabic derived words},
	journal = {Lecture Notes in Electrical Engineering},
	volume = {380},
	year = {2016},
	note = {cited By 0},
	pages = {131-138},
	abstract = {In this paper, we address the lexicon insufficient problem used in the automatic spell checker. In order to solve that deficiency, we developed an approach that aims to correct the derived words, considering that the most Arabic words are derived ones by adjusting the Levenshtein algorithm to our need. This method is based on a corpus constituted of surface patterns and roots characterized by a scaled down size compared to conventional approaches The proposed method reduced the execution time while maintaining the highest correction rate. {\textcopyright} Springer International Publishing Switzerland 2016.},
	doi = {10.1007/978-3-319-30301-7_14},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84964556163\&doi=10.1007\%2f978-3-319-30301-7_14\&partnerID=40\&md5=3031a40b3d60aeae121187c174e48ccf},
	author = {Nejja, M.a and Yousfi, A.b}
}
@conference {Anter2016,
	title = {Towards a generic model of a user profile},
	booktitle = {SITA 2016 - 11th International Conference on Intelligent Systems: Theories and Applications},
	year = {2016},
	note = {cited By 0},
	abstract = {User modelling is an old research discipline. The main concern of this discipline is to improve the quality of human-computer interaction predictive goals, preferences and context. Thus, adaptation and personalization of a document or an application for a particular user need to have information on the latter. It often referred to as {\textquoteright}user profile{\textquoteright}. A user profile modelling process must be done in two stages. These can be expressed by two questions: (1) {\textquoteright}what data?{\textquoteright} and (2) {\textquoteright}In what form will they be organized?{\textquoteright} The answer to the first question will determine all relevant information that best represents the interests and needs of the user. As for the second, it will determine the logical structure in which a profile will be modelled. This paper aims to provide answers to both questions. To do this, we begin with a presentation of different areas where the user profile can make a major contribution. In the second step, we define all the information to be included in the user profile as well as a generic model that we can adapt to different areas. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/SITA.2016.7772265},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010301085\&doi=10.1109\%2fSITA.2016.7772265\&partnerID=40\&md5=2f2efa11599627d6b4c5ad967869851f},
	author = {Anter, S. and Yazidi, M.H.E. and Zellou, A. and Idri, A.}
}
@conference { ISI:000391420300010,
	title = {Towards a generic model of a user profile},
	booktitle = {2016 11TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS: THEORIES AND APPLICATIONS (SITA)},
	series = {International Conference on Intelligent Systems, Theories and Applications},
	year = {2016},
	note = {11th International Conference on Intelligent Systems - Theories and Applications (SITA), Mohammedia, MOROCCO, OCT 19-20, 2016},
	publisher = {IEEE; Univ Hassan Casablanca; IEEE Morocco Sect; Fac Sci Tech Mohammedia},
	organization = {IEEE; Univ Hassan Casablanca; IEEE Morocco Sect; Fac Sci Tech Mohammedia},
	abstract = {User modelling is an old research discipline. The main concern of this discipline is to improve the quality of human-computer interaction predictive goals, preferences and context. Thus, adaptation and personalization of a document or an application for a particular user need to have information on the latter. It often referred to as {\textquoteleft}{\textquoteleft}user profile{{\textquoteright}{\textquoteright}}. A user profile modelling process must be done in two stages. These can be expressed by two questions: (1) {\textquoteleft}{\textquoteleft}what data?{{\textquoteright}{\textquoteright}} and (2) {\textquoteleft}{\textquoteleft}In what form will they be organized?{{\textquoteright}{\textquoteright}} The answer to the first question will determine all relevant information that best represents the interests and needs of the user. As for the second, it will determine the logical structure in which a profile will be modelled. This paper aims to provide answers to both questions. To do this, we begin with a presentation of different areas where the user profile can make a major contribution. In the second step, we define all the information to be included in the user profile as well as a generic model that we can adapt to different areas.},
	isbn = {978-1-5090-5781-8},
	issn = {2378-2528},
	author = {Anter, Samir and El Yazidi, Mly Hafid and Zellou, Ahmed and Idri, Ali}
}
@conference { ISI:000391354500075,
	title = {UWB Thin Film Flexible Antenna for Microwave Thermography for Breast Cancer Detection},
	booktitle = {2016 INTERNATIONAL CONFERENCE ON ELECTRICAL AND INFORMATION TECHNOLOGIES (ICEIT)},
	year = {2016},
	note = {2nd International Conference on Electrical and Information Technologies (ICEIT), Tangier, MOROCCO, MAY 04-07, 2016},
	pages = {425-429},
	abstract = {A novel low-cost flexible antenna for a non-invasive and highly sensitive method to detect malign tumors in the early stages, contributing to diminishing the mortality which appears in the cases where the breast cancer was detected in late incurable stages. Using thin film Kapton substrate the flexible antenna has been built and carried out by the use of CST Microwave Studio software. The proposed structure operate in S-band (with reflection coefficient (S11) below -10dB) and has an ultra-wide band (UWB) characteristic providing an important bandwidth of about 2,4 GHz with a center frequency around 3 GHz. In order to predict the effect of the human body on the S-parameter response of the developed antenna design, an inhomogeneous multi-layer model of the women breast is used. The simulated results indicate that the proposed antenna kept it UWB property. The overall size of the miniaturized antenna is 20mmx22mm which make it very suitable for a radar-based breast cancer detection system.},
	isbn = {978-1-4673-8469-8},
	author = {Afyf, Amal and Bellarbi, Larbi and Achour, Anouar and Yaakoubi, Nourdin and Errachid, Abdelhamid and Sennouni, M. Adel},
	editor = {Essaaidi, M and ElHani, S}
}
@conference {Afyf2016425,
	title = {UWB thin film flexible antenna for microwave thermography for breast cancer detection},
	booktitle = {Proceedings of 2016 International Conference on Electrical and Information Technologies, ICEIT 2016},
	year = {2016},
	note = {cited By 0},
	pages = {425-429},
	abstract = {A novel low-cost flexible antenna for a non-invasive and highly sensitive method to detect malign tumors in the early stages, contributing to diminishing the mortality which appears in the cases where the breast cancer was detected in late incurable stages. Using thin film Kapton substrate the flexible antenna has been built and carried out by the use of CST Microwave Studio software. The proposed structure operate in S-band (with reflection coefficient (S11) below-10dB) and has an ultra-wide band (UWB) characteristic providing an important bandwidth of about 2,4 GHz with a center frequency around 3 GHz. In order to predict the effect of the human body on the S-parameter response of the developed antenna design, an inhomogeneous multi-layer model of the women breast is used. The simulated results indicate that the proposed antenna kept it UWB property. The overall size of the miniaturized antenna is 20mm{\texttimes}22mm which make it very suitable for a radar-based breast cancer detection system. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/EITech.2016.7519635},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84992195805\&doi=10.1109\%2fEITech.2016.7519635\&partnerID=40\&md5=348267fc2a9e46d247350579e616bbe7},
	author = {Afyf, A.a and Bellarbi, L.a and Achour, A.a and Yaakoubi, N.b and Errachid, A.c and Adel Sennouni, M.d}
}
@conference {Yatribi2015,
	title = {Construction of cyclic one-step majority-logic decodable codes using genetic algorithms},
	booktitle = {International Conference on Wireless Networks and Mobile Communications, WINCOM 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {In [6], a construction of cyclic one-step majority-logic decodable codes based on idempotent polynomials is given. However, the search for the feasible Parity-Check Idempotent runs through all possible combinations of cyclotomic cosets modulo n, satisfying some algebraic constraints, consequently, increasing the code length may result in very large dimension space search, and the search for the solution becomes more difficult. In this paper, we propose a Genetic Algorithm that aimes to construct new moderate and high lengths Binary Cyclic OSMLD codes, considered as LDPC codes, with high correction capacities. Our construction is very efficient and provide codes with high lenghts and high rates. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/WINCOM.2015.7381301},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84965037029\&doi=10.1109\%2fWINCOM.2015.7381301\&partnerID=40\&md5=81a1ec4d5126eb8f485411ea3f2f1a37},
	author = {Yatribi, A.a and Ayoub, F.b and Belkasmi, M.a}
}
@conference { ISI:000380509200004,
	title = {Construction of Cyclic One-Step Majority-Logic Decodable Codes using Genetic Algorithms},
	booktitle = {2015 INTERNATIONAL CONFERENCE ON WIRELESS NETWORKS AND MOBILE COMMUNICATIONS (WINCOM)},
	year = {2015},
	note = {International conference on wireless networks and mobile communications, Marrakech, MOROCCO, OCT 20-23, 2015},
	pages = {17-22},
	abstract = {In {[}6], a construction of cyclic one-step majoritylogic decodable codes based on idempotent polynomials is given. However, the search for the feasible Parity-Check Idempotent runs through all possible combinations of cyclotomic cosets modulo n, satisfying some algebraic constraints, consequently, increasing the code length may result in very large dimension space search, and the search for the solution becomes more difficult. In this paper, we propose a Genetic Algorithm that aimes to construct new moderate and high lengths Binary Cyclic OSMLD codes, considered as LDPC codes, with high correction capacities. Our construction is very efficient and provide codes with high lenghts and high rates.},
	isbn = {978-1-4673-8224-3},
	author = {Yatribi, Anouar and Ayoub, Fouad and Belkasmi, Mostafa}
}
@conference { ISI:000373736100013,
	title = {The context in automatic spell correction},
	booktitle = {INTERNATIONAL CONFERENCE ON ADVANCED WIRELESS INFORMATION AND COMMUNICATION TECHNOLOGIES (AWICT 2015)},
	series = {Procedia Computer Science},
	volume = {73},
	year = {2015},
	note = {International Conference on Advanced Wireless Information and Communication Technologies (AWICT), Natl Sch Engineers Sousse, TUNISIA, OCT 05-07, 2015},
	pages = {109-114},
	abstract = {Automatic spell checker systems aim to verify and correct erroneous words through a suggested set of words that are the nearest lexically to the erroneous ones. However, the main disadvantage of those systems is that the wanted solution may bethe most distant lexically but the most appropriate in context. To correctly sort these solutions, the corrector must have some information about the general context of the text; the paragraph or the neighboring words of the misspelled word. In this paper, we will present an automatic spell checking method according to the context. This method is based on a learning corpus containing a distribution of the appearance probability of a word in different contexts. It combines the lexical correction via the Levenstein algorithm and the context based correction through a well definedlearning corpus which is composed of documents collected from the internet. This approach has proven efficiency and the obtained results are much more improved and satisfactory.},
	issn = {1877-0509},
	doi = {10.1016/j.procs.2015.12.055},
	author = {Nejja, Mohammed and Yousfi, Abdellah},
	editor = {Boubiche, DE and Hidoussi, F and Cruz, HT}
}
@conference {Nejja2015109,
	title = {The Context in Automatic Spell Correction},
	booktitle = {Procedia Computer Science},
	volume = {73},
	year = {2015},
	note = {cited By 0},
	pages = {109-114},
	abstract = {Automatic spell checker systems aim to verify and correct erroneous words through a suggested set of words that are the nearest lexically to the erroneous ones. However, the main disadvantage of those systems is that the wanted solution may bethe most distant lexically but the most appropriate in context. To correctly sort these solutions, the corrector must have some information about the general context of the text; the paragraph or the neighboring words of the misspelled word. In this paper, we will present an automatic spell checking method according to the context. This method is based on a learning corpus containing a distribution of the appearance probability of a word in different contexts. It combines the lexical correction via the Levenstein algorithm and the context based correction through a well definedlearning corpus which is composed of documents collected from the internet. This approach has proven efficiency and the obtained results are much more improved and satisfactory. {\textcopyright} 2015 The Authors.},
	doi = {10.1016/j.procs.2015.12.055},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962653409\&doi=10.1016\%2fj.procs.2015.12.055\&partnerID=40\&md5=de57303c462c687920cca58f379ceaef},
	author = {Nejja, M.a and Yousfi, A.b}
}
@article {Bendahmane2015665,
	title = {The Effectiveness of Reputation-Based Voting for Collusion Tolerance in Large-Scale Grids},
	journal = {IEEE Transactions on Dependable and Secure Computing},
	volume = {12},
	number = {6},
	year = {2015},
	note = {cited By 0},
	pages = {665-674},
	abstract = {Large scale grids permit to share grid resources spread over different autonomous administrative sites in the internet. The rapid progress of grid systems opens the door for numerous companies to adopt this technology in their business development. This progress is characterized by the increasing openness and opportunity of resource-sharing across organizations in different domains. In the business context, these shared resources can be misused by some malicious users that can abuse the provided resources and make them behave maliciously to return wrong results and sabotage the jobs execution. The common technique used by most grid systems to deal with this problem is based on replication with voting. Nevertheless, these techniques rely on the assumption that the grid resources behave independently. They may be ineffective where a number of collusive resources collectively return the same wrong results of a job execution. In order to overcome this threat, we propose a reputation-based voting (RBV) approach, which investigates the trustworthiness of the grid resources through a reputation system, and then takes a decision about the results. In addition, the performance of our approach and other voting techniques, like m-first voting and credibility-based voting, are evaluated through simulation to perceive the effect of collusive grid resources on the correctness of the results. The obtained results show that our approach achieves a lower error-rate and better performance in terms of overhead. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/TDSC.2014.2369049},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84975318629\&doi=10.1109\%2fTDSC.2014.2369049\&partnerID=40\&md5=16e95634d21bf7be2a2bdda3efba9a40},
	author = {Bendahmane, A.a and Essaaidi, M.a b and El Moussaoui, A.a and Younes, A.a}
}
@article { ISI:000364992800006,
	title = {The Effectiveness of Reputation-Based Voting for Collusion Tolerance in Large-Scale Grids},
	journal = {IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING},
	volume = {12},
	number = {6},
	year = {2015},
	month = {NOV-DEC},
	pages = {665-674},
	abstract = {Large scale grids permit to share grid resources spread over different autonomous administrative sites in the internet. The rapid progress of grid systems opens the door for numerous companies to adopt this technology in their business development. This progress is characterized by the increasing openness and opportunity of resource-sharing across organizations in different domains. In the business context, these shared resources can be misused by some malicious users that can abuse the provided resources and make them behave maliciously to return wrong results and sabotage the jobs execution. The common technique used by most grid systems to deal with this problem is based on replication with voting. Nevertheless, these techniques rely on the assumption that the grid resources behave independently. They may be ineffective where a number of collusive resources collectively return the same wrong results of a job execution. In order to overcome this threat, we propose a reputation-based voting (RBV) approach, which investigates the trustworthiness of the grid resources through a reputation system, and then takes a decision about the results. In addition, the performance of our approach and other voting techniques, like m-first voting and credibility-based voting, are evaluated through simulation to perceive the effect of collusive grid resources on the correctness of the results. The obtained results show that our approach achieves a lower error-rate and better performance in terms of overhead.},
	issn = {1545-5971},
	doi = {10.1109/TDSC.2014.2369049},
	author = {Bendahmane, Ahmed and Essaaidi, Mohamed and El Moussaoui, Ahmed and Younes, Ali}
}
@conference { ISI:000354859800032,
	title = {FGAV (Fuzzy Global as Views)},
	booktitle = {INTERNATIONAL CONFERENCE ON INTEGRATED INFORMATION (IC-ININFO 2014)},
	series = {AIP Conference Proceedings},
	volume = {1644},
	year = {2015},
	note = {4th International Conference on Integrated Information (IC-ININFO), Madrid, SPAIN, SEP 05-08, 2014},
	pages = {236-243},
	publisher = {Univ Peloponnese; Linnaeus Univ; Aberystwyth Univ; Technol \& Educ Inst Athens; Univ Complutense Madrid, Fac Ciencias Documentac; Inst Disseminat Arts \& Sci},
	organization = {Univ Peloponnese; Linnaeus Univ; Aberystwyth Univ; Technol \& Educ Inst Athens; Univ Complutense Madrid, Fac Ciencias Documentac; Inst Disseminat Arts \& Sci},
	abstract = {The mediation is an approach of integration, which allows to integrate different heterogeneous, autonomous and scalable sources of information, it provide to the user an uniform access, while hiding the peculiarities of each sources. In this paper, we presenting an approach of mapping for mediation systems, an operation that is used to define and describe all the links between the elements of global schema and those of local schemas. To this end, we firstly presenting our approach to mapping that consist to defining and associates for each link between two elements the weight that reflects the degree of its existence by using an analysis of two components: syntactic and semantic. On the other hand, we integrate a set of functionality for source schemas with elements of complex types.},
	isbn = {978-0-7354-1283-5},
	issn = {0094-243X},
	doi = {10.1063/1.4907842},
	author = {El Yazidi, Moulay Hafid and Zellou, Ahmed and Idri, Ali},
	editor = {Giannakopoulos, G and Sakas, DP and KyriakiManessi, D}
}
@conference {ElYazidi2015,
	title = {Mapping in GAV context},
	booktitle = {2015 10th International Conference on Intelligent Systems: Theories and Applications, SITA 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {Mediation is an approach that allows integrating different heterogeneous, distributed and scalable data sources. The objective of our paper is to define an approach of mapping, one of the essential operations that can describe and define the set of links between the two levels of mediation system: mediator schema (global) and schemas of sources to be integrated (local). Our approach allows to define the mapping for systems with complex schemas (schemas with complexes elements) and this by using functions developed that taking into account two aspects: syntactic and semantic. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/SITA.2015.7358376},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962421014\&doi=10.1109\%2fSITA.2015.7358376\&partnerID=40\&md5=44fa100d239873e3ce44cc7228d15aa7},
	author = {El Yazidi, M.H. and Zellou, A. and Idri, A.}
}
@conference { ISI:000380409500002,
	title = {Mapping in GAV context},
	booktitle = {2015 10TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS: THEORIES AND APPLICATIONS (SITA)},
	year = {2015},
	note = {10th International Conference on Intelligent Systems - Theories and Applications (SITA), ENSIAS, Rabat, MOROCCO, OCT 20-21, 2015},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Mediation is an approach that allows integrating different heterogeneous, distributed and scalable data sources. The objective of our paper is to define an approach of mapping, one of the essential operations that can describe and define the set of links between the two levels of mediation system: mediator schema (global) and schemas of sources to be integrated (local). Our approach allows to define the mapping for systems with complex schemas (schemas with complexes elements) and this by using functions developed that taking into account two aspects: syntactic and semantic.},
	isbn = {978-1-5090-0220-7},
	author = {Hafid El Yazidi, Moulay and Zellou, Ahmed and Idri, Ali}
}
@conference { ISI:000380408200016,
	title = {Performance analysis of coding using Distributed Turbo Codes},
	booktitle = {2015 THIRD INTERNATIONAL WORKSHOP ON RFID AND ADAPTIVE WIRELESS SENSOR NETWORKS (RAWSN)},
	year = {2015},
	note = {3rd International Workshop on RFID and Adaptive Wireless Sensor Networks (RAWSN), Agadir, MOROCCO, MAY 13-15, 2015},
	pages = {78-81},
	publisher = {FST FES; IEEE Morocco Sect; CNRST; MobiTic; Laboratoire Signaux Systemes Composants; LiMs Laboratoire},
	organization = {FST FES; IEEE Morocco Sect; CNRST; MobiTic; Laboratoire Signaux Systemes Composants; LiMs Laboratoire},
	abstract = {Nowadays the need for fast and reliable communication is increasing, which leads us to look for new ways to enhance channel coding. In this paper, we will study the case of a distributed coding between two users that aim to transmit data to a common destination, where each user transmits a partial redundancy to the destination, and relies on the second user for the remaining. The purpose of distributing the redundancy creation and transmission, is to benefit from each user channel quality for a more accurate decoding. In the context of our analysis, we will use a 1/2 rate convolutional code with between users and a distributed Turbo code for transmission to the destination. However, this study will aim to highlight the different key factors, as well as the advantage of choosing a distributed encoding.},
	isbn = {978-1-4673-8096-6},
	author = {Aboudeine, Anas and Ayoub, Fouad and Yatribi, Anouar and Benattou, Mohammed},
	editor = {Berrada, I and Ghennioui, H}
}
@conference {Aboudeine201578,
	title = {Performance analysis of coding using distributed Turbo codes},
	booktitle = {Proceedings - 2015 3rd International Workshop on RFID and Adaptive Wireless Sensor Networks, RAWSN 2015 - In conjunction with the International Conference on NETworked sYStems, NETYS 2015},
	year = {2015},
	note = {cited By 0},
	pages = {78-81},
	abstract = {Nowadays the need for fast and reliable communication is increasing, which leads us to look for new ways to enhance channel coding. In this paper, we will study the case of a distributed coding between two users that aim to transmit data to a common destination, where each user transmits a partial redundancy to the destination, and relies on the second user for the remaining. The purpose of distributing the redundancy creation and transmission, is to benefit from each user channel quality for a more accurate decoding. In the context of our analysis, we will use a 1/2 rate convolutional code with between users and a distributed Turbo code for transmission to the destination. However, this study will aim to highlight the different key factors, as well as the advantage of choosing a distributed encoding. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/RAWSN.2015.7173284},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84966679913\&doi=10.1109\%2fRAWSN.2015.7173284\&partnerID=40\&md5=4bdc90c77449a173f3b9f74b2bb43e0e},
	author = {Aboudeine, A.a and Ayoub, F.b and Yatribi, A.c and Benattou, M.a}
}
@conference {Younes2015115,
	title = {Segmentation of Arabic Handwritten Text to Lines},
	booktitle = {Procedia Computer Science},
	volume = {73},
	year = {2015},
	note = {cited By 0},
	pages = {115-121},
	abstract = {Automatic recognition of writing is among the most important axes in the NLP (Natural language processing). Several entities of different areas demonstrated the need in recognition of handwritten Arabic characters; particularly banks check processing, post office for the automation of mail sorting, the insurance for the treatment of forms and many other industries. One of the most important operations in a handwriting recognition system is segmentation. Segmentation of handwritten text is a necessary step in the development of a system of automatic writing recognition. Its goal is to try to extract all areas of the lines of the text, and this operation is made difficult in the case of handwriting, by the presence of irregular gaps or overlap between lines and fluctuations of the guidance of scripture to the horizontal. In this paper, we have developed three approaches of handwritten Arabic text segmentation, then we compared between these three approaches. {\textcopyright} 2015 The Authors.},
	doi = {10.1016/j.procs.2015.12.056},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962654008\&doi=10.1016\%2fj.procs.2015.12.056\&partnerID=40\&md5=36628c8cc1ed417c96dd04a97f7a2623},
	author = {Younes, M.a and Abdellah, Y.b}
}
@conference { ISI:000373736100014,
	title = {Segmentation of Arabic handwritten text to lines},
	booktitle = {INTERNATIONAL CONFERENCE ON ADVANCED WIRELESS INFORMATION AND COMMUNICATION TECHNOLOGIES (AWICT 2015)},
	series = {Procedia Computer Science},
	volume = {73},
	year = {2015},
	note = {International Conference on Advanced Wireless Information and Communication Technologies (AWICT), Natl Sch Engineers Sousse, TUNISIA, OCT 05-07, 2015},
	pages = {115-121},
	abstract = {Automatic recognition of writing is among the most important axes in the NLP (Natural language processing). Several entities of different areas demonstrated the need in recognition of handwritten Arabic characters; particularly banks check processing, post office for the automation of mail sorting, the insurance for the treatment of forms and many other industries. One of the most important operations in a handwriting recognition system is segmentation. Segmentation of handwritten text is a necessary step in the development of a system of automatic writing recognition. Its goal is to try to extract all areas of the lines of the text, and this operation is made difficult in the case of handwriting, by the presence of irregular gaps or overlap between lines and fluctuations of the guidance of scripture to the horizontal. In this paper, we have developed three approaches of handwritten Arabic text segmentation, then we compared between these three approaches.},
	issn = {1877-0509},
	doi = {10.1016/j.procs.2015.12.056},
	author = {Mokhtari, Younes and Yousfi, Abdellah},
	editor = {Boubiche, DE and Hidoussi, F and Cruz, HT}
}
@conference {Kawtar2014171,
	title = {Stochastic Model Predictive Control for costs optimization in a supply chain under a stochastic demand},
	booktitle = {Proceedings of 2nd IEEE International Conference on Logistics Operations Management, GOL 2014},
	year = {2014},
	note = {cited By 1},
	pages = {171-175},
	abstract = {This paper aims to present a Stochastic Model Predictive Control to optimize the costs of shipping and storage in a supply chain. The goal is to minimize the objective function of the combined costs in a multi-stage and a multi-level supply chain responding to a stochastic multi-product demand. The simulation using Matlab provides a comparison between classical models and the proposed model, and shows that the Affine Recourse Stochastic Model Predictive Control - AR SMPC offers better results. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/GOL.2014.6887436},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84908611786\&doi=10.1109\%2fGOL.2014.6887436\&partnerID=40\&md5=4a6eec4c578041a83cf910609deb9598},
	author = {Kawtar, T. and Said, A. and Youssef, B.}
}
@conference { ISI:000346582400027,
	title = {Stochastic Model Predictive Control for costs optimization in a supply chain under a stochastic demand},
	booktitle = {PROCEEDINGS OF 2014 2ND IEEE INTERNATIONAL CONFERENCE ON LOGISTICS AND OPERATIONS MANAGEMENT (GOL 2014)},
	year = {2014},
	note = {2nd IEEE International Conference on Logistics Operations Management (GOL), Rabat, MOROCCO, JUN 05-07, 2014},
	pages = {172-175},
	publisher = {IEEE; Mohammed VI Souissi Univ, ENSIAS Sch; Univ Le Havre; Sidi Mohamed Ben Abdellah Univ, FST},
	organization = {IEEE; Mohammed VI Souissi Univ, ENSIAS Sch; Univ Le Havre; Sidi Mohamed Ben Abdellah Univ, FST},
	abstract = {This paper aims to present a Stochastic Model Predictive Control to optimize the costs of shipping and storage in a supply chain. The goal is to minimize the objective function of the combined costs in a multi-stage and a multi-level supply chain responding to a stochastic multi-product demand. The simulation using Matlab provides a comparison between classical models and the proposed model, and shows that the Affine Recourse Stochastic Model Predictive Control - AR SMPC offers better results.},
	isbn = {978-1-4799-4650-1},
	author = {Kawtar, Tikito and Said, Achchab and Youssef, Benadada},
	editor = {Benadada, Y}
}
@conference { ISI:000380564200105,
	title = {Towards a MDE approach for the establishment of a Contract Service Level Monitoring by Third Party in the Cloud Computing},
	booktitle = {10TH INTERNATIONAL CONFERENCE ON SIGNAL-IMAGE TECHNOLOGY AND INTERNET-BASED SYSTEMS SITIS 2014},
	year = {2014},
	note = {International Conference on Signal-Image Technology and Internet-Based Systems SITIS, Marrakesh, MOROCCO, NOV 23-27, 2014},
	pages = {715-720},
	abstract = {Cloud Computing (CC) marks a new step towards IT infrastructure dematerialization. Cloud provides IT resources, software and hardware, remotely accessible, as a service. The adoption of this model raises a number of challenges, particularly with regard to Quality of the provided services. To cope with a highly dynamic environment such as the CC, it is essential to determine in real time Quality of Service (QoS) to meet consumer{\textquoteright}s SLA (Service Level Agreements) specifications. In this context, agreements contract) service level form an appropriate solution to specify these QoS guarantees. It specifies one or more service level objectives (SLO), to guarantee that the delivered QoS satisfies the consumer expectations. Monitoring these QoS agreements for the management of the relationships, between, cloud providers and their services customers is an area that attracts the attention of many researchers and industrialists in the cloud. In our work we introduce the concept of monitoring and respect of the QoS, then we present a third party service provider that ensures the respect of the Quality of Service in real-time to guarantee the performance and the reliability of the Cloud.},
	isbn = {978-1-4799-7978-3},
	doi = {10.1109/SITIS.2014.30},
	author = {Maarouf, Adil and Marzouk, Abderrahim and Haqiq, Abdelkrim and El Hamlaoui, Mahmoud},
	editor = {Yetongnon, K and Dipanda, A and Chbeir, R}
}
@conference {Gueddah2013,
	title = {The impact of arabic inter-character proximity and similarity on spell-checking},
	booktitle = {2013 8th International Conference on Intelligent Systems: Theories and Applications, SITA 2013},
	year = {2013},
	note = {cited By 0},
	abstract = {Following a statistical study carried out on the typographical errors committed when typing documents in Arabic language, it was found that most of these typos are character permutation errors, accounting for 65\% of overall errors. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/SITA.2013.6560811},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84883129467\&doi=10.1109\%2fSITA.2013.6560811\&partnerID=40\&md5=a0c5fdf32bbc85908946854321fb8cd0},
	author = {Gueddah, H.a and Yousfi, A.b}
}
@conference { ISI:000326649800028,
	title = {The Impact of Arabic Inter-character Proximity and Similarity on Spell-Checking},
	booktitle = {2013 8TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS: THEORIES AND APPLICATIONS (SITA)},
	year = {2013},
	note = {8th International Conference on Intelligent Systems - Theories and Applications (SITA), Ecole Mohammadia Ingenieurs, Rabat, MOROCCO, MAY 08-09, 2013},
	publisher = {IEEE; IEEE Morocco Sect; Univ Mohammed V Agdal},
	organization = {IEEE; IEEE Morocco Sect; Univ Mohammed V Agdal},
	abstract = {Following a statistical study carried out on the typographical errors committed when typing documents in Arabic language, it was found that most of these typos are character permutation errors, accounting for 65\% of overall errors. Similarly, in the aim to overcome this situation and while analyzing such errors, it turned out that character permutation resulting in a misspelled word can be imputed either to character proximity on an Arabic keyboard or to calligraphic similarity between such Arabic characters. In order to remedy this problem, we suggest, in this article, that a measurement of proximity and similarity between Arabic characters be integrated into Levenshtein algorithm, in the aim of enhancing the suggestions and the scheduling of the solutions returned by the spelling correction. The experimental outcomes are very satisfactory and attest of the necessity of integrating inter-character proximity and similarity measures for Arabic within spell-checking systems.},
	isbn = {978-1-4799-0299-6},
	author = {Gueddah, Hicham and Yousfi, Abdallah}
}
@conference { ISI:000350287800039,
	title = {A New Approach of Mapping},
	booktitle = {2013 3RD INTERNATIONAL SYMPOSIUM ISKO-MAGHREB},
	year = {2013},
	note = {ISKO-Maghreb 3rd International Symposium, Marrakech, MOROCCO, NOV 08-09, 2013},
	publisher = {ISKO},
	organization = {ISKO},
	abstract = {Data integration involves combining data residing in different sources, and providing the user a unified view of this data. The problem of designing data integration systems is important in current applications of the real world, and the question which arises at the mapping is how to link the global schema and the set of local schemas of sources. In this paper, we present our approach of mapping for mediation systems, a new approach that focuses on two main aspects, the syntactic aspect that takes into account the structure and shape of the elements of schemas, and semantic aspect related to the meaning of the elements of schemas.},
	isbn = {978-1-4799-3392-1},
	author = {El Yazidi, Moulay Hafid and Zellou, Ahmed and Idri, Ali}
}
@conference {ElYazidi2013,
	title = {A new approach of mapping},
	booktitle = {2013 3rd International Symposium ISKO-Maghreb},
	year = {2013},
	note = {cited By 0},
	abstract = {Data integration involves combining data residing in different sources, and providing the user a unified view of this data. The problem of designing data integration systems is important in current applications of the real world, and the question which arises at the mapping is how to link the global schema and the set of local schemas of sources. In this paper, we present our approach of mapping for mediation systems, a new approach that focuses on two main aspects, the syntactic aspect that takes into account the structure and shape of the elements of schemas, and semantic aspect related to the meaning of the elements of schemas. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/ISKO-Maghreb.2013.6728197},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84894137287\&doi=10.1109\%2fISKO-Maghreb.2013.6728197\&partnerID=40\&md5=e43d0431faff27e488fadb9353329892},
	author = {El Yazidi, M.H. and Zellou, A. and Idri, A.}
}
@conference { ISI:000331174400078,
	title = {Parallel Greedy Randomized Adaptive Search Procedure with Delay and Delay Variation for RP Selection in PIM-SM Multicast Routing},
	booktitle = {2013 EIGHTH INTERNATIONAL CONFERENCE ON BROADBAND, WIRELESS COMPUTING, COMMUNICATION AND APPLICATIONS (BWCCA 2013)},
	year = {2013},
	note = {8th IEEE International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA), Univ Technol Compiegne, Compiegne, FRANCE, OCT 28-30, 2013},
	pages = {481-487},
	publisher = {IEEE; IEEE Comp Soc},
	organization = {IEEE; IEEE Comp Soc},
	abstract = {Multicast IP is a Green Technology; it{\textquoteright}s a bandwidth-conserving technology that reduces traffic by simultaneously delivering a single stream of information to multicast group members. Internet research community has proposed many Different multicast routing protocols to support efficient multimedia application, PIM-SM protocol remains the most used multicast routing protocol; they propose using a Shared Rendezvous Point Tree SRPT to forward multicast packets. The prime problem concerning SRPT construction is to determine an optimal multicast router in the network as a root; this problem is called Rendezvous point RP selection. This selection influences the form of the multicast routing tree, and therefore influences performances of the multicast session and multicast routing scheme. Determination of a best position of the Rendezvous Point is an NP complete problem, first proposed by Wall, which needs to be solved with a heuristic algorithm. In this paper we propose a new RP selection algorithm based on Parallel Greedy Randomized Adaptive Search Procedure. 2DV-PGRASP-RP selects RP by considering cost, delay and delay variation functions and can be easily integrated to bootstrap RP protocol used by PIM-SM. Simulation results show that good performance is achieved in multicast cost.},
	isbn = {978-0-7695-5093-0},
	doi = {10.1109/BWCCA.2013.84},
	author = {Baddi, Youssef and Dafir, Mohamed and El Kettani, Ech-Cherif},
	editor = {Barolli, L and Xhafa, F and Nace, D and Bouabdallah, A and Enokido, T and Yeo, SS}
}
@article {ElYazidi20131650,
	title = {Towards a fuzzy mapping for virtual integration system},
	journal = {International Review on Computers and Software},
	volume = {8},
	number = {7},
	year = {2013},
	note = {cited By 1},
	pages = {1650-1657},
	abstract = {To access a unified way to different information sources while hiding the user autonomy, heterogeneity, distribution and evolution of these sources, we thought to integrate its different sources of information, one of the existing integration approaches appear mediation as virtual approach. The integration approach mediation is performed using a global schema, and a set of mapping (links) associating schemas of sources to integrate with the global schema. The problem arises in creating the set of correspondences between the elements of the schema global and all the elements of local schemas, in this paper we present our approach: A New Fuzzy Mapping Approach for Mediation Systems, a new approach based on fundamental principles of the theory of fuzzy sets. Our approach is to define and associate to each link between two elements a weight that reflects the degree of its existence, it is present in an analysis using two components: syntactic and semantic. {\textcopyright} 2013 Praise Worthy Prize S.r.l. - All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84884268047\&partnerID=40\&md5=475d3b48645e8a3f8406303d28193d1a},
	author = {El Yazidi, M.H. and Zellou, A. and Idri, A.}
}
@conference { ISI:000325229700033,
	title = {Detection evaluation and testing region incoming people{\textquoteright}s in a simple camera view},
	booktitle = {2012 SECOND INTERNATIONAL CONFERENCE ON INNOVATIVE COMPUTING TECHNOLOGY (INTECH)},
	year = {2012},
	note = {2nd International Conference on Innovative Computing Technology (INTECH), Casablanca, MOROCCO, SEP 18-20, 2012},
	pages = {179-183},
	publisher = {IEEE UK \& RI Consumer Elect Chapter; IEEE Broadcast Technol Chapter; IEEE},
	organization = {IEEE UK \& RI Consumer Elect Chapter; IEEE Broadcast Technol Chapter; IEEE},
	abstract = {Moving object detection is considered as a crucial phase of automatic video surveillance systems, particularly, people detection is the first important step in any technique of video analysis processes wich can be divided in many stations as motion estimation, tracking people etc. Several methods have been developed for this problem of separating the foreground and background pixels in video surveillance. This paper focuses on computable evaluation of some people detection algorithms for four different video sequences. Our study is based on quantitative and qualitative results respectively by calculating the loss of foreground pixels. Particularly, Three methods have been evaluated by using two metrics: False Negative Error (FNE) and False Positive Error (FPE). In the result we choose the algorithm witch minimize the Error (\%). Practically the good technique which dominates on the video surveillance applications is the statistical representation of pixels in foreground which named Gaussian Mixture Model (GMM). In the second part of this paper we control the people entering in a supervised region and we trigger an alarm system in order to find out person presence.},
	isbn = {978-1-4673-2679-7},
	author = {Ez Zahout, Abderrahmane and Moulay Youssef, Hadi and Haj Thami, Rachid Oulad}
}
@conference {Ezzahout2012179,
	title = {Detection evaluation and testing region incoming people{\textquoteright}s in a simple camera view},
	booktitle = {2nd International Conference on Innovative Computing Technology, INTECH 2012},
	year = {2012},
	note = {cited By 0},
	pages = {179-183},
	doi = {10.1109/INTECH.2012.6457804},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84874460739\&doi=10.1109\%2fINTECH.2012.6457804\&partnerID=40\&md5=ac4defc953442c5eec7ef981a25f270f},
	author = {Ezzahout, A. and Youssef, H.M. and Thami, R.O.H.}
}
@conference {Yazidi2012,
	title = {Towards a fuzzy mapping for mediation systems},
	booktitle = {Proceedings of 2012 International Conference on Complex Systems, ICCS 2012},
	year = {2012},
	note = {cited By 0},
	doi = {10.1109/ICoCS.2012.6458573},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84874494252\&doi=10.1109\%2fICoCS.2012.6458573\&partnerID=40\&md5=f777377bdfd9a344347799d38e97941d},
	author = {Yazidi, M.H.E. and Zellou, A. and Idri, A.}
}
@conference { ISI:000324984400020,
	title = {Towards a Fuzzy Mapping for Mediation Systems},
	booktitle = {PROCEEDINGS OF 2012 INTERNATIONAL CONFERENCE ON COMPLEX SYSTEMS (ICCS12)},
	year = {2012},
	note = {1st International Conference on Complex Systems (ICCS), Agadir, MOROCCO, NOV 05-06, 2012},
	pages = {122-125},
	abstract = {Data integration involves combining data residing at different sources, and providing to the user a unified and global view of this data. The problem of designing data integration systems is important in current applications of real world, especially for mapping between attributes of global schema and those of local schemas of sources. The question is how to link the global schema and the set of local schemas of sources. In this paper, we focus on studying the mapping approaches, more precisely the Global As View GAV approach (GAV) for schemas mapping. Also, we present a new approach of mapping for mediation systems, based on fuzzy logic. This new approach enjoys the benefits and advantages of fuzzy sets theory.},
	isbn = {978-1-4673-4766-2},
	author = {El Yazidi, Moulay Hafid and Zellou, Ahmed and Idri, Ali},
	editor = {Essaaidi, M and Nemiche, M}
}
@article {5938723720101201,
	title = {REPUTATION-BASED MAJORITY VOTING FOR MALICIOUS GRID RESOURCES TOLERANCE.},
	journal = {Scalable Computing: Practice \& Experience},
	volume = {11},
	number = {4},
	year = {2010},
	pages = {385 - 392},
	abstract = {Recently, distributed computing infrastructures such as grid computing, have witnessed huge developments which have a very important impact on computationally intensive scientific, industrial and engineering problems. Collaborative computing, resources access and sharing facilitated by grid computing systems amplifies concerns about cyber attacks and misbehaviors of grid resources (resources provider). In many cases, an organization may send out jobs for remote execution on untrustworthy machines. Since resource sharing and cooperation among different administrative domains are among the central goals of grid computing, it is necessary to guarantee that, among the shared resources, there are no malicious resources interested in invalidating or corrupting the job results. In order to guarantee reliable jobs execution in grid systems, we have developed a new approach for malicious grid resources tolerance using reputation to improve the efficiency of majority voting mechanisms. The grid},
	keywords = {Computational grids (Computer systems), Distributed computing, Grid computing, Internet service providers, majority voting, malicious resources, Plurality voting, reputation, Service level agreements, tolerance, Web services},
	issn = {18951767},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=59387237\&site=ehost-live},
	author = {Bendahmane, Ahmed and Essaaidi, Mohammad and El Moussaoui, Ahmed and Younes, Ali}
}
@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: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.}
}
