Guerrouf Fayçal

Dr. Guerrouf Fayçal

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2019
Verified
Conference Paper
Closed access
AAAdel Abdelli
Adel Abdelli
GFGuerrouf Fayçal
Guerrouf Fayçal
OTOkba Tibermacine
Okba Tibermacine
BABelkacem Abdelli
Belkacem Abdelli
Sentiment analysis holds an important place in Natural Language Processing (NLP) due to its utility in resolving different issues in many fields such as e-commerce, politic sciences, social media analysis, cybersecurity, etc. In fact, most of the work done in the field has been dedicated to the sentiment of English texts. However, adapting research findings to the Arabic language and its dialects is not trivial because of their linguistic features. In this work, we apply two supervised methods, namely, Deep Learning and Support Vector Machines (SVM), for sentiment analysis of Modern Arabic and the Algerian dialect. These methods have been applied on a huge annotated dataset collected from different Arabic Algerian sources. Findings are showing promising results in sentiment analysis of the Arabic Algerian dialect.

25 May 2023 in Computing
Verified
Journal Article
Closed access
PDF file
STSamir Tigane
Samir Tigane
GFGuerrouf Fayçal
Guerrouf Fayçal
LKLaid KAHLOUL
Laid KAHLOUL

22 February 2023 in Axioms
Verified
Journal Article
Open access
PDF file
STSamir Tigane
Samir Tigane
GFGuerrouf Fayçal
Guerrouf Fayçal
NHNadia Hamani
Nadia Hamani
LKLaid KAHLOUL
Laid KAHLOUL
MKMohamed Khalgui
Mohamed Khalgui
MAMasood Ashraf Ali
Masood Ashraf Ali
Modern discrete-event systems (DESs) are often characterized by their dynamic structures enabling highly flexible behaviors that can respond in real time to volatile environments. On the other hand, timed automata (TA) are powerful tools used to design various DESs. However, they lack the ability to naturally describe dynamic-structure reconfigurable systems. Indeed, TA are characterized by their rigid structures, which cannot handle the complexity of dynamic structures. To overcome this limitation, we propose an extension to TA, called dynamic timed automata (DTA), enabling the modeling and verification of reconfigurable systems. Additionally, we present a new algorithm that transforms DTA into semantic-equivalent TA while preserving their behavior. We demonstrate the usefulness and applicability of this new modeling and verification technique using an illustrative example.

1 January 2013 in International Journal of Computer Aided Engineering and Technology
Verified
Journal Article
Closed access
GFGuerrouf Fayçal
Guerrouf Fayçal
ACAllaoua Chaoui
Allaoua Chaoui
AAAli Aldahoud
Ali Aldahoud

10 February 2020 in Multiagent and Grid Systems
Verified
Journal Article
Closed access
PDF file
GFGuerrouf Fayçal
Guerrouf Fayçal
ACAllaoua Chaoui
Allaoua Chaoui
During the execution of a multi-agent system, a variety of events originating from the external environment and/or the internal elements of that system can lead to a state of failure. To overcome this kind of undesirable situations, the multi-agent s

24 April 2025 in Arabian Journal for Science and Engineering
Verified
Journal Article
Closed access
PDF file
STSamir Tigane
Samir Tigane
GFGuerrouf Fayçal
Guerrouf Fayçal
LKLaid KAHLOUL
Laid KAHLOUL
MKMohamed Khalgui
Mohamed Khalgui