<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>Thèses de Doctorat</title>
<link href="http://univ-bejaia.dz/dspace/123456789/270" rel="alternate"/>
<subtitle/>
<id>http://univ-bejaia.dz/dspace/123456789/270</id>
<updated>2026-04-07T17:48:55Z</updated>
<dc:date>2026-04-07T17:48:55Z</dc:date>
<entry>
<title>Bio-inspired computation for bio-informatics problems.</title>
<link href="http://univ-bejaia.dz/dspace/123456789/25965" rel="alternate"/>
<author>
<name>Dabba, Ali</name>
</author>
<author>
<name>Tari, Abdelkamel ; directeur de thèse</name>
</author>
<id>http://univ-bejaia.dz/dspace/123456789/25965</id>
<updated>2025-05-22T07:49:55Z</updated>
<published>2021-01-01T00:00:00Z</published>
<summary type="text">Bio-inspired computation for bio-informatics problems.
Dabba, Ali; Tari, Abdelkamel ; directeur de thèse
The field of bioinformatics opens up great opportunities to understand biological phenomena, which has attracted&#13;
great interest from the scientific community in recent years. Consequently, there are many problems of&#13;
bioinformatics, including multiple sequence alignment, protein structure prediction, construction of the&#13;
phylogenetic tree and molecular docking, etc., which need the cooperation between biologists and computer&#13;
scientists to be solved. This work addresses two problems: multiple sequence alignment and gene selection using&#13;
bio-inspired algorithms. Firstly, we developed a method to solve the multiple sequence alignment problem, called&#13;
a multi-objective artificial fish swarm algorithm (MOAFS), using the behaviors of artificial fish swarm algorithms,&#13;
Pareto optimal set, and genetic operations. Secondly, we proposed an algorithm to solve the gene selection problem&#13;
by using mutual information, moth flame optimization algorithm, and support vector machine with leave one out&#13;
cross-validation (SVMLOOCV). It called the Mutual Information Maximization-modified Moth Flame Algorithm&#13;
(MIM-mMFA) that consists of two simple phases. The thesis has processed a full test of the MOAFS on the&#13;
BaliBASE 2.0 and BaliBASE 3.0 alignment benchmark datasets as well as the MIM-mMFA test on sixteen binary&#13;
and multi-classes cancer gene expression datasets. Finally, we have given a deep insight into the performance of&#13;
each algorithm. In addition, our proposed algorithms achieved competitive or better results than the wellestablished&#13;
algorithms in the literature.&#13;
Keywords: Bio-informatics; Bio-inspired Algorithms ; Multiple Sequence Alignment ; Artificial Fish Swarm&#13;
Algorithm ; Gene Selection Genes Expression ; Microarray ; Cancer Classification ; Moth Flame Optimization&#13;
Algorithm.&#13;
Résume&#13;
Le domaine de la bio-informatique offre de grandes possibilités de comprendre les phénomènes biologiques, ce&#13;
qui a suscité un grand intérêt de la part de la communauté scientifique ces dernières années. Par conséquent, il&#13;
existe de nombreux problèmes de bio-informatique, y compris l’alignement de séquences multiples, la prédiction&#13;
de la structure des protéines, la construction de l’arbre phylogénétique et l’amarrage moléculaire, etc. qui&#13;
nécessitent la coopération entre biologistes et informaticiens pour être résolus. Ce travail aborde deux problèmes:&#13;
l’alignement de séquences multiples et la sélection de gènes à l’aide d’algorithmes bio-inspirés. Premièrement,&#13;
nous avons développé une méthode pour résoudre le problème de l’alignement des séquences multiples, appelée&#13;
algorithme d’essaim de poissons artificiels multi-objectifs (MOAFS), en utilisant les comportements des&#13;
algorithmes d’essaim de poissons artificiels, l’ensemble Pareto-optimal, et les opérations génétiques.&#13;
Deuxièmement, nous avons proposé un algorithme pour résoudre le problème de sélection de gènes en utilisant&#13;
l’information mutuelle, l’algorithme d’optimisation de flamme de papillon de nuit, et le Machine à vecteurs de&#13;
support avec leave-one-out cross-validation (SVM-LOOCV). Il a appelé Mutual Information Maximizationmodified&#13;
Moth Flame Algorithm (MIM-mMFA) qui se compose en deux phases simples. La thèse a traité un test&#13;
complet du MOAFS sur les ensembles de données de référence d’alignement BaliBASE 2.0 et BaliBASE 3.0 ainsi&#13;
que le test MIM-mMFA sur seize ensembles de données du cancer binaires et multi-classes. Enfin, nous avons&#13;
donné un aperçu approfondi des performances de chaque algorithme. De plus, nos algorithmes proposés ont obtenu&#13;
des résultats compétitifs ou meilleurs que les algorithmes bien établis dans la littérature.&#13;
Mots-clés: Bioinformatique ; Algorithmes bio-inspirés ; Alignement de séquences multiples ; Algorithme&#13;
d’essaim de poissons artificiels ; Sélection des gènes ; Expression des gènes ; Puces à ADN ; Classification du&#13;
cancer; Algorithme d’optimisation de la flamme papillon.
Option : Cloud Computing
</summary>
<dc:date>2021-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Mécanismes de formation de coalitions multi-agents avec externalités.</title>
<link href="http://univ-bejaia.dz/dspace/123456789/25964" rel="alternate"/>
<author>
<name>Sklab, Youcef</name>
</author>
<author>
<name>Tari, Abdelkamel ; directeur de thèse</name>
</author>
<id>http://univ-bejaia.dz/dspace/123456789/25964</id>
<updated>2025-05-22T07:35:31Z</updated>
<published>2021-01-01T00:00:00Z</published>
<summary type="text">Mécanismes de formation de coalitions multi-agents avec externalités.
Sklab, Youcef; Tari, Abdelkamel ; directeur de thèse
Formation de coalitions : Externalités dynamiques : Dépendances entre tâches*
Option : Cloud Computing
</summary>
<dc:date>2021-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Option : Réseaux et Systèmes distribués</title>
<link href="http://univ-bejaia.dz/dspace/123456789/25963" rel="alternate"/>
<author>
<name>Djamila, Zamouche</name>
</author>
<author>
<name>Aissani, Soufiane ; directeur de thèse</name>
</author>
<id>http://univ-bejaia.dz/dspace/123456789/25963</id>
<updated>2025-05-22T07:30:36Z</updated>
<published>2022-01-01T00:00:00Z</published>
<summary type="text">Option : Réseaux et Systèmes distribués
Djamila, Zamouche; Aissani, Soufiane ; directeur de thèse
Over the last decades, advancements in computing, electronics, and mechanical systems&#13;
have been resulting in the development of transportation all over the world, which has&#13;
been providing a lot of benefts for many aspects of human life. Intelligent Transportation Systems (ITSs) are advanced applications that aim to make the transportation&#13;
infrastructures safer, more convenient, and smarter by using information that is shared&#13;
among vehicles such as crash warning, sudden-brake warning, lane-change warning,&#13;
and so on. Thus, such systems provide a wide variety of services including, but not&#13;
limited to, trafc control, trafc management, passenger and road safety, and remote&#13;
region connectivity. However, several challenges hampering the proper operation of&#13;
these systems, such as extreme disturbances and they rely on several kinds of devices&#13;
that can cause malfunctions. Moreover, vehicular communications are expected to&#13;
be subject to severe breaches that a?ect the reliability of the exchanged information.&#13;
Seeking to improve the safety and protect human life, in this thesis, we address these&#13;
problems by providing improvements to the existing STIs. In particular, we have proposed an enhanced train-centric communication-based train control system for railway&#13;
transportation that allows improving the quality and enhancing reliability of the train&#13;
control. Moreover, we have proposed our second contribution that manifests itself in&#13;
the proposition of a discordant safety messages detection strategy in connected vehicles&#13;
environment that provides the vehicles with the ability to quickly and preemptively&#13;
identify discordant messages and hence dealing against potential disturbances, while&#13;
ensuring a trade-o? between the efciency and safety. The proposed mechanisms are&#13;
evaluated through simulations in terms of important metrics. The obtained results&#13;
highlight the promising performances of our proposals.
Option : Data Science
</summary>
<dc:date>2022-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Time synchronization in wireless senor and actuator networks.</title>
<link href="http://univ-bejaia.dz/dspace/123456789/25962" rel="alternate"/>
<author>
<name>Boukhechem, Nadhir</name>
</author>
<author>
<name>Badache, Nadjib ; directeur de thèse</name>
</author>
<id>http://univ-bejaia.dz/dspace/123456789/25962</id>
<updated>2025-05-22T07:26:19Z</updated>
<published>2022-01-01T00:00:00Z</published>
<summary type="text">Time synchronization in wireless senor and actuator networks.
Boukhechem, Nadhir; Badache, Nadjib ; directeur de thèse
The purpose of time synchronization is to allow the different nodes' clocks in a network to get relatively&#13;
close values at any moment. Currently, time synchronization is a fundamental problem in wireless sensor&#13;
and actuator networks (WSANs). Indeed, many WSANs applications, including node localization, sleep&#13;
schedule, and data aggregation, require accurate time synchronization to function properly. In this thesis, we&#13;
propose two cluster-based time synchronization protocols for WSANs, namely Sensor and Actuator&#13;
Networks Synchronization Protocol (SANSync), and Optimized Sensor and Actuator Networks&#13;
Synchronization Protocol (OSANSync). These protocols, contrary to existing protocols, fully exploit the&#13;
available resources of the actuators, particularly their large transmission range, to improve time&#13;
synchronization accuracy. We also propose a heuristic-based method to select the ROOT node through&#13;
which all the other nodes in the network are synchronized. The proposed method is fully distributed and can&#13;
be easily integrated into time synchronization protocols to improve their performance.
Option : Réseaux et Systèmes distribués
</summary>
<dc:date>2022-01-01T00:00:00Z</dc:date>
</entry>
</feed>
