5 October 2018

Publications

Publications


Copyrights for some of the papers below have been transfered, or will be transfered to various publishers of journals, conferences proceedings, etc. For such papers I am required to post the following notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author’s copyright.


International Refereed Journals


  • [J29] Counting in One-Hop Beeping Networks.
    A. Casteigts, Y. Métivier, J.M. Robson, A. Zemmari,
    Theoretical Computer Science. In Press (2019).
  • [J28] Network Intrusion Detection for IoT Security based on Learning Techniques.
    N. Chaabouni, M. Mosbah, P. Faruki, C. Sauvignac, A. Zemmari.
    IEEE Communications Surveys and Tutorials. In Press (2019).
  • [J27] A Machine Learning based Approach to Detect Malicious Android Apps using Discriminant System Calls.
    M. Conti, Vinod P., A. Zemmari.
    Future Generation Computer Systems.94: 333–350 (2019).
  • [J26] Deterministic Leader Election Takes $\Theta(D+\log n)$ Bit Rounds.
    A. Casteigts, Y. Métivier, J.M. Robson, A. Zemmari.
    Algorithmica. In press (2018).
  • [J25] SneakLeak+: Large-Scale Klepto Apps Analysis.
    S. Bhandari, F. Herbreteau, V. Laxmi, P. S. Roop, M. S. Gaur, A. Zemmari.
    Future Generation Computer Systems. In press, (2018).
  • [J24] Design Patterns in Beeping Algorithms: Examples, Emulation, and Analysis.
    A. Casteigts, Y. Métivier, J.M. Robson, A. Zemmari.
    Information and Computation. 264: 32-51 (2019).
  • [J23] SWORD: Semantic AWare AndrOid MalwaRe Detector.
    S. Bhandari, M. S. Gaur, V. Laxmi, S. Naval, R. Panihar, A. Zemmari.
    Journal of Information Security and Applications. 42: 46-56 (2018).
  • [J22] Whac-A-Mole: Smart Node Positioning in Clone Attack in Wireless Sensor Networks.
    W. Ben Jaballah, M. Conti, G. Filè, M. Mosbah, A. Zemmari.
    Computer Communications. 119: 66-82 (2018).
  • [J21] Android inter-app communication threats and detection techniques.
    S. Bhandari, W. Ben Jaballah, M. Conti, M. S. Gaur, V. Jain, V. Laxmi, M. Mosbah, A. Zemmari.
    Computers & Security. 70: 392-421 (2017).
  • [J20] RDA: A Coq library to reason about randomised distributed algorithms in the message passing model.
    A. Fontaine, A. Zemmari.
    Scientific Annals of Computer Science. 26(2): 157-186 (2016).
  • [J19] Prediction of visual attention with Deep CNN on artificially degraded videos for studies of attention of Patients with Dementia.
    J. Benois-Pineau, C. Benamar, S. Chaabouni, F. Tison, A. Zemmari.
    Multimedia Tools and Applications. 76(21): 22527-22546 (2017).
  • [J18] Randomized Distributed MIS and Colouring Algorithms for Rings with Oriented Edges in O( sqrt(log n)) bit rounds.
    Y. Métivier, J.M. Robson, A. Zemmari.
    Information and Computation. 251: 208-214 (2016).
  • [J17] A Distributed Enumeration Algorithm and Applications to All Pairs Shortest Paths, Diameter….
    Y. Métivier, J.M. Robson, A. Zemmari.
    Information and Computation. 247:141-151, (2016).
  • [J16] Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications.
    Y. Métivier, J.M. Robson, A. Zemmari.
    Theoretical Computer Science. 584: 115-130 (2015). (pdf)
  • [J15] Lightweight Secure Group Communications for Resource Constrained Devices.
    W. Ben Jaballah, M. Mosbah, H. Youssef , A. Zemmari.
    International Journal of Space-Based and Situated Computing. 5(4):187-200 (2015).
  • [J14] Optimal Bit Complexity Randomised Distributed MIS and Maximal Matching Algorithms for Anonymous Rings.
    A. Fontaine, Y. Métivier, J.M. Robson, A. Zemmari.
    Information and Computation. 233:32-40, 2013. (pdf)
  • [J13] On the Time and the Bit Complexity of Distributed Randomised Anonymous Ring Colouring.
    Y. Métivier, J.M. Robson, N. Saheb-Djahromi, A. Zemmari.
    Theoretical Computer Science. 502:64-75, 2013. (pdf)
  • [J12] Randomized Broadcasting in Wireless Mobile Sensor Networks.
    H. Hadj Kacem, M. Mosbah, N. Ouled Abdallah, and A. Zemmari.
    Concurrency and Computation : Practice and Experience. 25(2): 203-217, 2013.
  • [J11] An Optimal Bit Complexity Randomized Distributed MIS Algorithm.
    Y. Métivier, J.M. Robson, N. Saheb-Djahromi and A. Zemmari.
    Distributed Computing. 23:331-340, 2011. (pdf)
  • [J10] About randomised distributed graph coloring and graph partition algorithms.
    Y. Métivier, J.M. Robson, N. Saheb-Djahromi and A. Zemmari.
    Information and Computation. 208:1296-1304, 2010. (pdf)
  • [J09] Sublinear Fully Distributed Partition with Applications.
    Bilel Derbel, Mohamed Mosbah and Akka Zemmari.
    Theory of Computing Systems. 47(2):368-404, 2010. (pdf)
  • [J08] Uniform Election in Trees and Polyominoids.
    A. El Hibaoui, J.M. Robson, N. Saheb-Djahromi and A. Zemmari.
    Discrete Applied Mathematics. 158:981-987, 2010. (pdf)
  • [J07] Analysis of a Randomised Dynamic Timetable Handshake Algorithm.
    A. El Hibaoui, Y. Métivier, J.M. Robson, N. Saheb-Djahromi and A. Zemmari.
    Pure Mathematics and Applications (Algebra and Theoretical Computer Science) . 19:159-169, 2008.
  • [J06] On Handshakes in Random Graphs.
    Akka Zemmari.
    Information Processing Letters. 108:119-123, 2008.(pdf)
  • [J05] Broadcast in the Rendezvous Model.
    Philipe Duchon, Nicolas Hanusse, Nasser Saheb and Akka Zemmari.
    Information and Computation. 204:697-712, 2006. (pdf)
  • [J04] Locally Guided Randomized Elections in Trees: the Totally Fair Case.
    Yves Métivier, Nasser Saheb and Akka Zemmari.
    Information and Computation, 198:40-55, 2005. (pdf)
  • [J03] Analysis of a Randomized Rendez Vous Algorithm.
    Yves Métivier, Nasser Saheb and Akka Zemmari.
    Information and Computation, 184:109-128, 2003. (pdf)
  • [J02] The compactness of adaptive routing tables.
    Cyril Gavoille and Akka Zemmari.
    Journal of Discrete Algorithms, 1:237-254, 2003. (pdf)
  • [J01] Randomized Local Elections.
    Yves Métivier, Nasser Saheb and Akka Zemmari.
    Information Processing Letters, Volume 82, Issue 6.313-320, 2002. (pdf)

Book Chapter

  • [B1] Deep Saliency: Prediction of Interestingness In Video With CNN.
    S. Chaabouni, J. Benois-Pineau, A. Zemmari, C. Ben Amar.
    In Visual Content Indexing & Retrieval with Psycho-Visual Models. Springer International Publishing. To appear.

Book Edition

  • [E1] Akka Zemmari, Mohamed Mosbah, Nora Cuppens-Boulahia, Frédéric Cuppens:
    Risks and Security of Internet and Systems – 13th International Conference, CRiSIS 2018, Arcachon, France, October 16-18, 2018, Revised Selected Papers. Lecture Notes in Computer Science 11391, Springer 2019, ISBN 978-3-030-12142-6

Invited Speaker

  • [I3] Concentration Inequalities in the Analysis of Randomized Distributed Algorithms.
    In the 16th International Colloquium on Theoretical Aspects of Computing (ICTAC 2019). Hammamet, Tunisia. 30th October-4th November, 2019.
  • [I2] Android Malware: Will machine learning be help in hand?
    In the 10th ACM International Conference On Security Of Information And Networks (ACM SIN 2017). Jaipur, India. October 13-15, 2017.
  • [I1] Preserving Privacy in Smart Cities.
    Ecole Jeunes Chercheurs Smart Cities. Bizerte, Tunisia. October 27-29, 2017.

International Conferences and Workshops


  • [C44] Leveraging The Link Quality Awareness For Body Node Coordinator (BNC) Placement In WBANs.
    A. Belghith, I. Jemili, R. Negra, M. Mosbah, N. Ouled Abdallah, A. Zemmari.
    In the 34th ACM/SIGAPP Symposium On Applied Computing (ACM SAC 2019).
    Limassol, Cyprus. April 8 – 12 2019.
  • [C43] Privacy Preserving Data-Computation Offloading.
    V. Laxmi, M. S. Gaur, S. Saharan, A. Zemmari.
    In the 13th International Conference on Risks and Security of Internet and Systems (CRISIS 2018).
    Arcachon, France. October 16-18, 2018.
  • [C42] Increasing Training Stability for Deep CNNs.
    P. Gillot, J. Benois-Pineau, Y. Nesterov, A. Zemmari.
    In the 25th IEEE International Conference on Image Processing (IEEE ICIP 2018). Athens, Greece. October 7-10, 2018.
  • [C41] WBAN Path Loss Based Approach For Human Activity Recognition With Machine Learning Techniques.
    A. Belghith, I. Jemeli, M. Mosbah, R. Negra, A. Zemmari.
    In the 14th International Wireless Communications & Mobile Computing Conference (IEEE IWCMC 2018). Limassol, Cyprus. June 25-29, 2018.
  • [C40] Towards landmarks prediction with Deep Network.
    M. Beurton-Aimar, V. L. Le, N. Parisey, A. Zemmari.
    In the 9th International Conference on Pattern Recognition Systems (ICPRS 2018). Valparaíso, Chile. May 22-24, 2018.
  • [C39] Unraveling Reflection Induced Sensitive Leaks in Android Apps.
    M. Conti, J. Gajrani, M. S. Gaur, M. Mosbah, V. Laxmi, D. R. Sharma., M. Tripathi, A. Zemmari.
    In Proceedings of the 12th International Conference on Risks and Security of Internet and Systems
    (CRISIS 2017), Dinard, France. September 19-21, 2017.
  • [C38] SneakLeak: Detecting multipartite leakage paths in Android apps.
    S. Bhandari, F. Herbreteau, V. Laxmi, P. S. Roop, M. S. Gaur, A. Zemmari.
    In The 16th IEEE International Conference On Trust, Security And Privacy In Computing And Communications (IEEE TrustCom-17). Sydney, Australia, August 1 – 4, 2017
  • [C37] POSTER: Detecting Inter-App Information Leakage Paths.
    S. Bhandari, F. Herbreteau, V. Laxmi, P. S. Roop, M. S. Gaur, A. Zemmari.
    In the 12th ACM Asia Conference on Computer and Communications Security (ASIACCS 2017). Abu Dhabi, UAE. 2-6 April 2017.
  • [C36] Design Patterns in Beeping Algorithms (extended abstract).
    A. Casteigts, Y. Métivier, J.M. Robson, A. Zemmari.
    In the 20th Int. Conference on Principles of Distributed Systems (OPODIS 2016). Madrid, Spain. 13-16 December 2016.
  • [C35] Deterministic Leader Election Algorithm in O(D + log n) Time with Messages of Size O(1).
    A. Casteigts, Y. Métivier, J.M. Robson, A. Zemmari.
    In the 30th Int. Symposium on Distributed Computing (DISC 2016). Paris, France. 26-30 Sep. 2016
  • [C34] Certified Impossibility Results and Analyses in Coq of some Randomised Distributed Algorithms.
    A. Fontaine and A. Zemmari.
    In the 13th International Colloquium on Theoretical Aspects of Computing (ICTAC 2016). Taipei, Taiwan. 24-31 Oct. 2016.
  • [C33] MimeoDroid: Large Scale Dynamic App analysis on Cloned Devices using Machine Learning Classifiers.
    M. Conti, P. Faruki, M. S. Gaur, V. Laxmi, and A. Zemmari.
    In the 3rd IEEE International Workshop on Reliability and Security Data Analysis RSDA 2016. Toulouse, France, June 28 – July 1, 2016.
  • [C32] MCLSPM: Multi-constraints Link Stable Multicast Routing Protocol in Adhoc Networks.
    M. S. Gaur, V. Laxmi, V. Rao, G. Singal, S. Todi and A. Zemmari.
    IFIP Wireless Days 2016. Toulouse, France, March 23-25, 2016.
  • [C31] Intersection Automata based Model for Android Application Collusion.
    S. Bhandari, M. S. Gaur, V. Laxmi and A. Zemmari.
    In the 30th IEEE International Conference on Advanced Information Networking and Applications (AINA-2016). Crans-Montana, Switzerland. March 23-25, 2016.
  • [C30] A Fault-Tolerant Handshake Algorithm for Local Computations.
    A. Fontaine, M. Mosbah, M. Tounsi and A. Zemmari.
    The 12-th International Symposium on Frontiers of Information Systems and Network Applications (FINA-2016). Crans-Montana, Switzerland. March 23-25, 2016.
  • [C29] A Totally Distributed Fair Scheduler for Population Protocols by Probablistic Handshakes .
    N. Ouled Abdallah, M. Jmaiel, M. Mosbah and A. Zemmari.
    In the 12th International Colloquium on Theoretical Aspects of Computing (ICTAC 2015). Cali, Colombia, October 29-31, 2015.
  • [C28] DRACO: DRoid Analyst COmbo, An Android Malware Analysis Framework.
    M. Anikeev, S. Bhandari, R. Gupta, M.S. Gaur, V. Laxmi, A. Zemmari.
    In 8th International Conference on Security of Information and Networks (SIN 2015). Sochi, Russia, September 8-10, 2015 .
  • [C27] On Lower Bounds for the Time and the Bit Complexity of some Probabilistic Distributed Graph Algorithms.
    A. Fontaine, Y. Métivier, J.M. Robson, A. Zemmari.
    In 40th International Conference on Current Trends in Theory and Practice of Computer Science (
    SOFSEM 2014). High Tatras, Slovakia, January 25-30, 2014.
  • [C26] Greedy Flooding in Redoubtable Sensor Networks.
    M. Jmail, M. Mosbah, N. Ouled Abdallah, A. Zemmari .
    In the 28th IEEE International Conference on Advanced Information Networking and Applications (AINA-2014). Victoria, Canada, May 13-16, 2014.
  • [C25] Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications.
    Y. Métivier, J.M. Robson, A. Zemmari.
    In the 20th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2013). Ischia, Italy, July 1–3, 2013.
  • [C24] Lightweight Source Authentication Mechanisms for Group Communications in Wireless Sensor Networks.
    W. Ben Jaballah, M. Mosbah, H. Youssef, A. Zemmari.
    In the 27th IEEE International Conference on Advanced Information Networking and Applications (AINA-2013). Barcelona, Spain, March 25 – 28, 2013.
  • [C23] The Bit Complexity of a Randomised Distributed (Delta+1) Colouring Algorithm on Ring Graphs.
    Y. Métivier, J.M. Robson, N. Saheb-Djahromi, A. Zemmari.
    In GASCOM 2010, September 2-4, 2010. Montréal, UQAM, Canada.
  • [C22] Broadcast in Wireless Mobile Sensor Networks with Population Protocols and Extension with the Rendezvous Model.
    H. Hadj Kacem, M. Mosbah, N. Ouled Abdallah, A. Zemmari.
    In 10th International Conference on New Technologies of Distributed Systems (NOTERE 2010). 31 mai – 2 juin 2010, Tozeur, Tunisie.
  • [C21] BA: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm.
    Y. Métivier, J.M. Robson, N. Saheb-Djahromi, A. Zemmari.
    In 13th International Conference On Principles Of DIstributed Systems December 15-18, 2009. Nimes, France.
  • [C20] An Optimal Bit Complexity Randomised Distributed MIS Algorithm.
    Y. Métivier, J.M. Robson, N. Saheb-Djahromi, A. Zemmari.
    In 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2009). May 25-27, 2009. Piran, Slovenia.
  • [C19] Election Algorithms with Random Delays in Trees.
    Jean-François Marckert, Nasser Saheb-Djahromi and Akka Zemmari.
    In 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009). July 20-24, 2009. Hagenberg, Austria.
  • [C18] Analysis of a Randomized Dynamic Timetable Handshake Algorithm.
    A. El Hibaoui, Y. Métivier, J.M. Robson, N. Saheb-Djahromi, A. Zemmari.
    In GASCOM 2008. Bibbiena (Arezzo-ITALY). June 16-19, 2008.
  • [C17] A Probabilistic Model for Distributed Merging of Mobile Agents.
    Shehla Abbas, Mohamed Mosbah and Akka Zemmari.
    In 2nd International Workshop on Verification and Evaluation of Computer and Communication Systems (VECoS 2008). Leeds, U.K. July 2-3, 2008.
  • [C16] A Generic Distributed Algorithm for Computing by Random Mobile Agents.
    Shehla Abbas, Mohamed Mosbah and Akka Zemmari.
    In 10th Pacific Rim International Workshop On Multi-Agents ( PRIMA’2007). Bangkok, Nov 21 – 23, 2007. Springer Verlag LNCS series.
  • [C15] A Self-stabilizing Distributed Algorithm For Resolving Conflicts.
    Brahim Hamid, Mohamed Mosbah and Akka Zemmari.
    In 2nd International Workshop On Reliability in Decentralized Distributed Systems(RDDS’2007). Vilamoura, Algarve, Portugal, Nov 25 – 30, 2007. To appear in the Springer Verlag LNCS series.
  • [C14] Merging Time of Random Mobile Agents.
    Shehla Abbas, Mohamed Mosbah and Akka Zemmari.
    In (LDIC’2007). Bremen, Allemagne, August 28th – 30th, 2007. Procedings of LDIC. Pages 179-189, Springer Verlag.
  • [C13] Collecte d’informations par des agents mobiles.
    Shehla Abbas, Mohamed Mosbah and Akka Zemmari.
    In New Technologies for Distributed Systems (NOTERE’2007 ). Marrakech, Maroc, Juin 4-8, 2007. Hermes.
  • [C12] Using Graph Relabelling Systems for Resolving Conflicts.
    Mohamed Mosbah, Affif Sellami and Akka Zemmari.
    In New Technologies for Distributed Systems (NOTERE’2006). 6-9 juin, 2006 Toulouse, France. Pages 283-294. Edition Lavoisier, Hermes.
  • [C11] Distributed Computation of a Spanning Tree in a Dynamic Graph by Mobile Agents.
    Shehla Abbas, Mohamed Mosbah and Akka Zemmari.
    In IEEE International Conference on Engineering of Intelligent Systems (ICEIS 2006). April 22-23, 2006. Islamabad, Pakistan.
  • [C10] Fast Distributed Graph Partition and Application.
    Bilel Derbel, Mohamed Mosbah and Akka Zemmari.
    In 20th IEEE International Parallel & Distributed Processing Symposium (IPDPS 2006). April 25, 2006. Rhodes Island, Greece.
  • [C09] Polyominoids and Uniform Election.
    Abdelaaziz El Hibaoui, Nasser Saheb-Djahromi and Akka Zemmari.
    In 17th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2005). June 20, 2005. Taormina, Sicily, Italy.
  • [C08] A Uniform Probabilistic Election Algorithm in k-Trees.
    Abdelaaziz El Hibaoui, Nasser Saheb-Djahromi and Akka Zemmari.
    In 17th IMACS World Congress : Scientific Computation, Applied Mathematics and Simulation (IMACS 2005). July 11 – 15, 2005. Paris, France
  • [C07] Broadcast in the Rendezvous Model.
    Philipe Duchon, Nicolas Hanusse, Nasser Saheb and Akka Zemmari.
    In 21st International Symposium on Theoretical Aspects of Computer Science (STACS 2004). March 25-27, 2004. Montpellier, France.
  • [C06] Broadcast Using Rendezvous (Extended Abstract).
    Philipe Duchon, Nicolas Hanusse, Nasser Saheb and Akka Zemmari.
    Breif announcement In 17th International Symposium on Distributed Computing (DISC 2003). October 1-3, 2003. Sorrento, Italy.
  • [C05] A Uniform Randomized Election in Trees (Extended Abstract).
    Yves Métivier, Nasser Saheb and Akka Zemmari.
    In 10th International Colloquium on Structural Information & Communication Complexity (SIROCCO 2003). Carleton University Press, June 2003.
  • [C04] Uniform Randomized Election in Trees.
    Yves Métivier, Nasser Saheb and Akka Zemmari.
    In GASCOM’2001. November 2001. Certosa di Pontignano (Sienne), Italie.
  • [C03] Methods for Computing the Concurrency Degree in Commutation Monoids.
    Nasser Saheb and Akka Zemmari.
    In 12-th International Conference on Formal Power Series and Algebraic Combinatorics ( FPSAC 2000 ), pages 731-742. Springer, June 2000. Moscow, Russie.
  • [C02] The Compactness of Adaptive Routing Tables.
    Cyril Gavoille and Akka Zemmari.
    In 7-th International Colloquium on Structural Information & Communication Complexity (SIROCCO 2000), pages 127-140. Carleton Scientific, June 2000. Aquila, Italie.
  • [C01] Randomized Rendezvous.
    Yves Métivier, Nasser Saheb and Akka Zemmari.
    In Colloquium on Mathematics and Computer Science. Trends in Mathematics series, pages 183-194. Birkhauser, September 2000. Paris, France.

National Conferences

  • [N4] Automated Morphometrics using Deep Neural Networks : Case Study on a Beneficial Insect Species.
    M. Beurton-Aimar, V. L. Le, N. Parisey, A. Zemmari.
    10ème Symposium de Morphométrie et Évolution des Formes (SMEF 2018).
  • [N3] Algorithmes de Descente de Gradient Stochastique avec le filtrage des paramètres pour l’entraînement des réseaux à convolution profonds.
    J. Benois-Pineau, P. Gillot, Y. Nesterov, A. Zemmari.
    Reconnaissance des Formes, Image, Apprentissage et Perception (RFIAP 2018).
  • [N2] Un algorithme distribué d’énumération des noeuds d’un réseau et application au calcul des distances entre 2 noeuds quelconques et du diamètre d’un réseau.
    Y. Métivier, J.M. Robson, A. Zemmari.
    AlgoTel 2016, Bayonne, France, May 25, 2016.
  • [N1] Une Analyse Formelle en Coq d’un Algorithme Distribué Probabiliste résolvant le Problème du Rendez-Vous.
    A. Fontaine, A. Zemmari.
    Journées francophones des langages applicatifs (JFLA). 2013.

Habilitation à Diriger les recherches (HDR Thesis)

  • Title: Presentation and analysis of some distributed randomized algorithms.
  • Slides of the presentation
  • The thesis dessertation.

Thèse de Doctorat en informatique

  • Title: Contribution à l’analyse d’algorithmes distribués

 

On the Time and the Bit Complexity of Distributed Randomised Anonymous Ring Colouring