African Conference on Research in Computer Science and Applied Mathematics

Colloque Africain sur la Recherche en Informatique et en Mathématiques Appliquées

 CARI’2020 –
Polytech School of Thiès,
Senegal  14-17 October 2020

CARI’2020 : PROGRAMME AT A GLANCE

Wednesday 14th October 2020 / Mercredi 14 0ctobre 2020

RESUMEL’histoire de la recherche scientifique reflète un fonctionnement et une organisation des chercheurs en communautés épistémiques partageant la connaissance, s’exposant à la revue des pairs (publications), reprenant les résultats des collègues pour les améliorer ou les contredire. Cette forme d’organisation est désormais accompagnée de la généralisation de nouvelles pratiques de recherche notamment pour le partage des données, la constitution de corpus de données massives et l’exploitation des big data constitués via de nouvelles méthodes d’analyse. Ces changements font débats dans certaines communautés et interpellent les institutions peu habituées à ces pratiques car elles interrogent directement leur rapport aux données et à leur valorisation. 
Pascal Bonnet a participé à de nombreuses réunions plénières de la RDA Research Data Alliance https://rd-alliance.org/ et est actuellement le représentant du Cirad à la RDA-France, et à l’alliance Godan (Global Open Data for Agriculture & Nutrition https://www.godan.info/ ).

11h – 12h: Session 1 Informatique

Session 1: Computer Sciences

11h – 12h: Session 1 Mathématiques

Session 1: Mathematics

Abdramane Bah, University of Science and Technology of Bamako, Mali
 I.2. A novel node centrality metric based on common neighborhood in multidimensional networks
Félicité Gamgne Domgue, University of Yaoundé I, Cameroon
I.3 Packets delivery approach in a clustered Linear Sensor Network using a probabilistic capture model
El Hadji Malick NDOYE,
Univ. Ziguinchor, Senegal

 I.1 Analysis of a mosquito life cycle model
 

ABBOUBAKAR Hamadjam
Albert Guidzavai Kouchéré,
University of Maroua,
Cameroon

 I.2. Effects on competition induced by periodic fluctuations in environment


Mamadou Lamine Diagne,
University of Thiès,
Senegal
 I.3. Effect of the mortality on a density-dependent model with a predator-prey relationship
Tahani Mtar, University of Tunis el Manar, ENIT-LAMSIN, Tunisia

Djiby Sow

14h – 15h (GMT +1) : Invited speaker: Djiby Sow
Titre: On NIST call for  the transition into Quantum-resistant cryptography: the round 3 finalists of lattices based cryptosystems 

RESUMEIn Post-quantum cryptography, we need to design scheme and protocols that resist to attacks using quantum computation.  There exist 7  families of cryptography that are believed to resist to  quantum computations: Lattice-based cryptography, Code-based cryptography, Isogeny-based cryptography,  Quantum key distribution, Multivariate polynomial cryptography, Hash functions-based cryptography and Secret-key cryptography.  The classical  IFP (Integer factorization Problem) and DLP (Discrete Logarithm Problem) are not secure against quantum computers.  For this reason, the National Institute of Standards and Technology (NIST), by a  call for  submissions in {2016, propose the transition into quantum-resistant cryptography. Two types of schemes where considered: (1) Signatures; (2) Public-key Encryption and Key-establishment Algorithms (namely PKE/KEM).  In November 2017,  69 schemes where proposed but most of them are  PKE/KEM and signatures based on lattices.   For Round 3 Finalists- PKE/KEM we have 3/4 lattices based schemes and for Round 3 Finalists- Digital Signature Algorithms 2/3 lattices based schemes. In this talk we give fist an overview on public key cryptography and post-quantum cryptography, after we present and analysis the lattices based schemes who have reached the final round. 
Key words 
Public key cryptography, Post-quantum cryptography, NIST,  Lattices, PKE/KEM, Signature, Security proof, Random oracle model.

16h – 17h: Session 2 Informatique

Session 2: Computer Sciences

16h – 17h: Session 2 Mathématiques

Session 2: Mathematics

II.1. A publish/subscribe approach for implementing GAG’s distributed collaborative business processes with data av ..
Maurice Tchoupé Tchendji, Univ.  Dschang, Cameroon
II.2. A role-based collaborative process design on crowdsourcing systems
Rodrigue Aimé Djeumen Djatcha, University of Douala, Cameroon
 II.3Horizontally Elastic Edge-Finder For Cumulative Resource Constraint Revisited
Sévérine Fetgo Betmbe, University of Dschang, Cameroon

Hend Ben Ameur, Université Tunis el Manar ENIT-LAMSIN, Tunisia

Belhassen Meftahi, Ecole Nationale d’Ingénieurs de Tunis, Tunisia

 II.3. Un résultat d’existence et d’unicité du système couplé Purkinje-Myocarde
Khouloud Kordoghli, Facuté des Sciences
de Tunis, Tunisia

Thursday 15th October 2020 / Jeudi 15 Octobre 2020 

09h – 10h (GMT +1) : Invited speaker: Bernard Cazelles


Titre: « Prise en compte de la non-stationnarité dans les modèles d’épidémies en considé-rant des modèles stochastiques avec des paramètres variant dans le temps »

RESUME : La propagation des maladies infectieuses dans les populations humaines est un phénomène complexe. En effet, les caractéristiques de la propagation de ces maladies évoluent dans le temps, en fonction d’une multitude de facteurs environnementaux et aussi anthropiques, comme la distanciation sociale… Cette non-stationnarité est le facteur clé de la complexité de la propagation des maladies infectieuses.

En l’absence de données appropriées, pour décrire correctement la propagation d’un agent pathogène, une nouvelle méthodologie est proposée. Elle est basée sur des modèles stochastiques pour la dynamique de la maladie, et sur des processus browniens pour l’évolution temporelle des paramètres. L’utilisation de tels processus de diffusion a l’avantage de ne nécessiter d’aucune fonction mathématique spécifique pour décrire la dynamique des paramètres.   [Read more]

11h – 12h: Session 3 Informatique

Session 3: Computer Sciences

11h – 12h: Session 3 Mathématiques

Session 3: Mathematics

III.2. Charging Stations placement in Drone Path planning for large space surveillance
Jean Louis Fendji Kedieng Ebongue, University of Ngaoundéré, Cameroon

III.3. Application of LSTM architectures for next frame forecasting in Sentinel-1 images time series
Waytehad Rose Msokolaï, University of Burgundy Franche-Comté, France

 III.2. Identification of cracks in thermoelasticity   
Hend Ben Ameur,
Ecole Nationale d’Ingénieurs
de Tunis,
LAMSIN & IPEST,
Tunisia

III.3. Recovery of parameters of the coupled heart-torso model in cardiac   electrophysiology
Abir Amri, Ecole Nationale d’Ingénieurs de Tunis, LAMSIN, Tunisia

Osmar R. Zaïane

14h – 15h (GMT +1) : Invited speaker: Osmar R. Zaïane

Title: Associative Classifiers From Competitive Predictions to Explainable AI

ABSTRACTToday, the limelight is on Deep Learning. With the huge success of deep learning, other machine learning paradigms have had to take the back stage. Yet other models, particularly rule-based learning methods, are more readable and explainable and can even be competitive when labelled data is not abundant. One such rule-based method is the less known Associative classifier. The power of associative classifiers is to determine patterns from the data and perform classification based on the features that are most indicative of prediction. Early approaches suffer from cumbersome thresholds requiring prior knowledge. We will present a new associative classifier approach that is even more accurate while generating a smaller model. It can also be used in an explainable-AI pipeline to explain inferences from other black box predictive models.

biographie en anglais (courte et longue ainsi que photo):
https://webdocs.cs.ualberta.ca/~zaiane/htmldocs/bio.html

16h – 17h: Session 4 Informatique

Session 4: Computer Sciences

16h – 17h: Session 4 Mathématiques

Session 4: Mathematics

IV.2. A CGM-Based Parallel Algorithm Using the Four-Russians Speedup for the 1-D Sequence Alignment Problem
Jerry Lacmou Zeutouo, University of Dschang, Cameroon
IV.3. Comparative Study of the Performance of Elliptic Curve Cryptograhy Algorithms with Cryptography through RSA Algorithm
Nelson Josias Gbètoho Saho, EDSI –  Benin

 IV.3. A minimalistic model of spatial structuration
of humid savanna vegetation
Simon Rodrigue Tega II, University of Yaoundé I, 

Université de Yaoundé
Cameroon

Friday 16th October 2020 / Vendredi  16 Octobre 2020

09h – 10h (GMT+1): Session 5 Informatique 
Session5: Computer Science

09h – 10h (GMT+1): Session 5 Mathématiques Appliquées 
Session5: Applied Mathematics

 V.1. Algorithmes de sortie du Piège de la Zone En-nuyeuse en apprentissage par renforcement
Landry Steve Noulawe Tchamanbe, Yaoundé I
TABUEU FOTSO Laurent Cabrel,University of Dschang, Cameroon
 V.3. An Efficient Algorithm to Discover Intra-Periodic Frequent Sequences
Edith Belise Kenmogne, University of Dschang, Cameroon

 V.1. A new approximation of the Height process of a CSBP
Ibrahima Drame, Université Cheikh Anta Diop, Dakar, Senegal

 V.2. Generalized Abs-Linear Learning by Mixed Binary Quadratic Optimization
Andreas Griewank, Humboldt University, Berlin,
Germany

V.3. Discretization of an adaptive prediction model using a non-homogeneous meshing
Samuel Ismael Billong IV, ENSP, Yaoundé I, Cameroon

11h – 12h: Session 6 Informatique

Session 6: Computer Sciences

11h – 12h: Session 6 Mathématiques

Session 6: Mathematics

The CARI  has had the pain of losing two of its early companions recently. Lala Andriamampianina  and Claude Tangha were two endearing personalities of our community. They will be greatly missed. Each in his own way worked hard for the development of computer science on the African continent. This edition of CARI 2020 is dedicated to them.

Le CARI a eu  la douleur de perdre récemment deux de ses compagnons de la première heure. Lala Andriamampianina et Claude Tangha étaient deux personnalités attachantes de notre communauté. Ils nous manqueront beaucoup. Chacun à sa manière s’est beaucoup investi pour le développement de l’informatique sur le continent africain. Cette édition du CARI 2020 leur est dédiée.

Thématiques – CARI’2020 – Thematics

Computer Sciences / Applied Mathematics:

CARI 2020 welcomes and encourages the presentation of methodological contributions in Computer Science and Applied Mathematics. CARI 2020 will provide a forum for students and academic/industrial researchers in order to discuss the most recent trends in Computer Science and Appplied Mathematics  and share innovative research directions for Africa. The CARI conference encourages to submit original and unpublished research work. Contributions covering theoretical developments or  applications dedicated to African issues are invited.  CARI is divided into two tracks (Computer Science and Applied Mathematics) whose topics of interest include but not limited to the following respective lists:

Computer Science

– Data Management Systems
– Distributed Systems
– Wireless Networks
– Cryptography
– Cyber Security
– Safety and Correctness of Systems
– Big Data and Data Science
– Artificial Intelligence
– Machine Learning
– Knowledge Discovery and Data Mining
– Decision Making under Uncertainty
– Information Retrieval
– Natural Language Processing
– Semantic Web and Linked Data
– Ontology
– Internet of Things
– Cooperative and User Centric Systems
– Multi-Agent Systems
– Crowdsourcing
– Blockchain
– Visualisation
– Applications: Digital Agriculture, Biomedicine, Smart Cities, e-Government, etc

Applied Mathematics:

– Analysis of Dynamical Systems,
– Numerical Analysis
– Partial Differential Equations
– Optimization, Inverse Problems and Control
– Stochastic Systems,
– Applied Statistics and Probability
– Image and Signal Processing
– Mathematics of Machine Learning
– High Performance Scientific Computation
– Mathematical Modelling
– Mathematical Finance, Actuarial Science and Economy
– Earth Sciences and Environment
– Mathematical Biology, Ecology and Medecine

Programme Committee

Computer Science :

  • Mathieu Roche
  • Eric Badouel
  • Pascal Andre
  • Ali Mili
  • Cédric Lopez
  • Philippe Lemoisson
  • Kamel Barkaoui
  • Davide Frey
  • Houari Sahraoui
  • Nicolas Raft Razafindrakoto
  • Jean-Claude Hochon
  • Maurice Tchuente
  • Melhem El Helou
  • Patrice Buche
  • Abdou Guermouche
  • Yliès Falcone
  • Hacene Belhadef
  • Ibrahim Bounhas
  • Nicolas Béchet
  • Sellami Mokhtar
  • Ludovic Mé
  • Gaosussou Camara
  • Roberto Interdonato
  • Loek Cleophas
  • Abdoulaye Gamatié
  • Paulin Melatagia Yonta
  • François Charoy

 

     

     

    • Eric Kergosien
    • Michel Hurfin
    • Hugo Alatrista-Salas
    • Moussa Lo
    • Mouhamadou Thiam
    • Stephane Maag
    • Ounsa Roudies
    • César Viho
    • Patrice Quinton
    • Jean-Christophe Desconnets
    • Bamba Gueye
    • Thomas Maugey
    • Yassine Hadjadj-Aoul
    • Soraya Ait Chellouche
    • Laskri Mohamed Tayeb
    • Hassina Seridi Seridi
    • Nabiha Azizi
    • Hafed Zarzour
    • Mohamed Tarek Khadir
    • Mohamed Jmaiel
     Mathematics :

    • Tri Nguyen-Huu
    • Radhouane Fekih-Salem
    • Nahla Abdellatif
    • Julia Lawall
    • Ali Moussaoui
    • Boniface Nkonga
    • Abderrahmane Habbal
    • Ounsa Roudies
    • Rachid Senoussi
    • Majdi Azaiez
    • Rachid Ouifki
    • Nadjia EL SAADI
    • Patrice Quinton
    • slimane ben miled
    • Nabil GMATI
    • Ali Mili
    • Laurent Debreu
    • Mohamed Majdoub
    • Rachid Mchich
    • Belhassen Dehman
    • Kolyang Kolyang
    • Hend BenAmeur
    • Skander Belhaj
    • Christophe Lett
    • Mohamed Ali Hamza
    • Makram Hamouda
    • Mohamed fahmi ben hassen