Khaoula Ben Abdellafou

Khaoula Ben Abdellafou

Auto-generated profile, based on publicly available information

Khaoula Ben Abdellafou

Higher Institute of Applied Mathematics and Computer Science, University of Kairouan, Kairouan 3100, Tunisia

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
11 August 2021 in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Verified
Journal Article
Closed access
PDF file
SNSyrine Neffati
Syrine Neffati
KAKhaoula Ben Abdellafou
Khaoula Ben Abdellafou
AAAhamed Aljuhani
Ahamed Aljuhani
OTOkba Taouali
Okba Taouali
The development of Computer-Aided Design (CAD) and Computer-Aided Manufacturing (CAM) systems in the past decade has led to a remarkable advance in biomedical applications and devices. Particularly, CAM and CAD systems are employed in medical engineering, robotic surgery, clinical medicine, dentistry and other biomedical areas. Hence, the accuracy and precision of the CAD and CAM systems are extremely important for proper treatment. This work suggests a new CAD system for brain image classification by analyzing Magnetic Resonance Images (MRIs) of the brain. Firstly, we use the proposed Downsized Rank Kernel Partial Least Squares (DR-KPLS) as a feature extraction technique. Then, we perform the classification using Support Vector Machines (SVM) and we validate with a k-fold cross validation approach. Further, we utilize the Tabu search metaheuristic approach in order to determine the optimal parameter of the kernel function. The proposed algorithm is entitled DR-KPLS+SVM. The algorithm is tested on the OASIS MRI database. The proposed kernel-based classifier is found to be better performant than the existing methods.

6 January 2026 in Symmetry
Verified
Journal Article
Open access
PDF file
KAKhaoula Ben Abdellafou
Khaoula Ben Abdellafou
KZKamel Zidi
Kamel Zidi
WGWad Ghaban
Wad Ghaban
This paper considers the two parallel-machine scheduling problem with intree-precedence constraints where machines are subject to non-availability constraints. In the literature, this problem is considered to be an open problem of unknown complexity. The proposed solution proves that the problem under consideration has polynomial complexity. Periods of machine unavailability are predetermined, and both task execution and inter-task communication are modeled as requiring one unit of time. The optimization criterion central to this study is the minimization of the makespan. Such a scheduling challenge is directly applicable to manufacturing environments, where production equipment can be intermittently offline for reasons such as unscheduled repairs or planned preventative maintenance. Adopting a unit-time task model offers a valuable framework for subsequently scheduling larger, preemptable jobs.This work presents a new method, called Scheduling Intrees with Unavailability Constraints (SIwUC), which operates by aggregating tasks into distinct groups. The analysis establishes that the SIwUC algorithm produces optimal schedules and reveals how the underlying problem architecture and its solutions demonstrate a symmetrical property in the distribution of tasks across the two parallel machines. This paper demonstrates that the proposed SIwUC algorithm builds optimal schedules and highlight how the problem structure and its solutions exhibit a form of symmetry in balancing task allocation between the two parallel machines.