IAIkhlass Ammar

Ikhlass Ammar

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Ikhlass Ammar has a total of 12 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Cat Breed Classification with YOLOv11 and Optimized Training

    by Hafedh Mahmoud Zayani, Amani Kachoukh, Refka Ghodhbani, Nouha Khediri, Eman H. Abd-Elkawy, Ikhlass Ammar, Marouan Kouki, Taoufik Saidani

    Accurate identification of cat breeds poses a significant challenge due to subtle inter-breed differences and intra-breed variability. This study leverages YOLOv11, the latest version of the YOLO family, to address these challenges through advanced deep-learning techniques. By training on a dataset consisting of five distinct cat breeds (Persian, Maine Coon, Siamese, Pallas's Cat, and Bengal), the model demonstrates exceptional capability in identifying nuanced breed-specific features. Data augmentation techniques were employed to enhance the dataset's diversity, while various optimization algorithms (Adam, Adamax, NAdam, AdamW, RAdam, RMSProp, and SGD) were evaluated to optimize the performance of the model. Experimental results showed that RAdam and SGD emerged as the top-performing optimizers, achieving an average recall of 96.8%, precision of 97.2%, and mAP50 of 98.1%, significantly outperforming other optimization methods. In contrast, RMSProp exhibited the lowest performance, particularly in terms of precision and mean Average Precision (mAP50). Additionally, data augmentation techniques were applied to enhance the diversity of the dataset, improving the robustness of the model. These findings highlight the effectiveness of YOLOv11 in cat breed classification, with potential applications in pet identification, animal conservation, and veterinary diagnostics.


  • Verification of Bounded Inclusion Problem for Timed Automata with Diagonal Constraints

    by Ikhlass Ammar, Yamen El Touati, Moez Yeddes

    The verification of the inclusion problem between two timed languages accepted by timed automata is undecidable in the general case. In the literature, there are several studies proposing decidable solutions for this problem under some restrictions. An interesting work, [4], proposes a theory of timed bounded verification applied to a non-Zeno timed automaton with an upper bound. The solution framework is based on a new discretization technique for timed automata without clocks reset and simple constraints restrictions. The first contribution in this paper aims at proposing an extension of this discretization technique to solve the non-diagonal constraints restriction applied to the timed automata without clocks reset. The proposed solution consists to integrate the Difference Bound Matrices DBM data structure to update the old discretized language. The second contribution focuses on designing all required algorithms relative to the generation of the timed bounded discretized language and the verification of the inclusion problem. In addition, we calculate the time complexity of each proposed algorithm.

  • Bounded opacity for timed systems

    by Ikhlass Ammar, Yamen El Touati, Moez Yeddes, John Mullins


  • Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language

    by Ikhlass Ammar, Yamen El Touati, John Mullins, Moez Yeddes

    The inclusion problem is one of the common problems in real-time systems. The general form of this problem is undecidable; however, the time-bounded verification of inclusion problem is decidable for timed automata. In this study, we propose a new discretization technique to verify the inclusion problem. The proposed technique is applied to a non-Zeno timed automaton with an upper bound that does not contain a non-reachable space for each transition. The new approach is based on the generation of timed bounded discretized language that represents an abstraction of timed words in the form of a set of a countable number of discrete timed words. A discrete timed word aggregates all timed words that share the same actions and their execution times that create the time continuous intervals. The lower and the upper bounds of an interval in a discrete timed word is defined by the minimum and maximum execution times associated to a given transition-run. In addition, we propose the verification schema of the inclusion between two timed bounded discretized languages generated by two non-Zeno timed automata.