JBJacques M. Bahi

Jacques M. Bahi

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Jacques M. Bahi has a total of 31 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Distributed Training of Deep Neural Networks: Convergence and Case Study

    by Jacques M. Bahi, Raphaël Couturier, Joseph Azar, Kevin Kana Nguimfack


  • Open Access

    Introducing and Comparing Recent Clustering Methods for Massive Data Management in the Internet of Things

    by Christophe Guyeux, Stéphane Chrétien, Gaby Bou Tayeh, Jacques Demerjian, Jacques Bahi

    The use of wireless sensor networks, which are the key ingredient in the growing Internet of Things (IoT), has surged over the past few years with a widening range of applications in the industry, healthcare, agriculture, with a special attention to monitoring and tracking, often tied with security issues. In some applications, sensors can be deployed in remote, large unpopulated areas, whereas in others, they serve to monitor confined busy spaces. In either case, clustering the sensor network’s nodes into several clusters is of fundamental benefit for obvious scalability reasons, and also for helping to devise maintenance or usage schedules that might greatly improve the network’s lifetime. In the present paper, we survey and compare popular and advanced clustering schemes and provide a detailed analysis of their performance as a function of scale, type of collected data or their heterogeneity, and noise level. The testing is performed on real sensor data provided by the UCI Machine Learning Repository, using various external validation metrics.


  • Open Access

    Theoretical Study of the One Self-Regulating Gene in the Modified Wagner Model

    by Christophe Guyeux, Jean-François Couchot, Arnaud Le Rouzic, Jacques M. Bahi, Luigi Marangio

    Predicting how a genetic change affects a given character is a major challenge in biology, and being able to tackle this problem relies on our ability to develop realistic models of gene networks. However, such models are rarely tractable mathematically. In this paper, we propose a mathematical analysis of the sigmoid variant of the Wagner gene-network model. By considering the simplest case, that is, one unique self-regulating gene, we show that numerical simulations are not the only tool available to study such models: theoretical studies can be done too, by mathematical analysis of discrete dynamical systems. It is first shown that the particular sigmoid function can be theoretically investigated. Secondly, we provide an illustration of how to apply such investigations in the case of the dynamical system representing the one self-regulating gene. In this context, we focused on the composite function f a ( m . x ) where f a is the parametric sigmoid function and m is a scalar not in { 0 , 1 } and we have proven that the number of fixed-point can be deduced theoretically, according to the values of a and m.


  • Open Access

    An improved watermarking scheme for Internet applications

    by Christophe Guyeux, Jacques M. Bahi

    In this paper, a data hiding scheme ready for Internet applications is proposed. An existing scheme based on chaotic iterations is improved, to respond to some major Internet security concerns, such as digital rights management, communication over hidden channels, and social search engines. By using Reed Solomon error correcting codes and wavelets domain, we show that this data hiding scheme can be improved to solve issues and requirements raised by these Internet fields.

  • Open Access

    An optimization technique on pseudorandom generators based on chaotic iterations

    by Jacques M. Bahi, Xiaole Fang, Christophe Guyeux

    Internet communication systems involving cryptography and data hiding often require billions of random numbers. In addition to the speed of the algorithm, the quality of the pseudo-random number generator and the ease of its implementation are common practical aspects. In this work we will discuss how to improve the quality of random numbers independently from their generation algorithm. We propose an additional implementation technique in order to take advantage of some chaotic properties. The statistical quality of our solution stems from some well-defined discrete chaotic iterations that satisfy the reputed Devaney's definition of chaos, namely the chaotic iterations technique. Pursuing recent researches published in the previous International Conference on Evolving Internet (Internet 09, 10, and 11), three methods to build pseudorandom generators by using chaotic iterations are recalled. Using standard criteria named NIST and DieHARD (some famous batteries of tests), we will show that the proposed technique can improve the statistical properties of a large variety of defective pseudorandom generators, and that the issues raised by statistical tests decrease when the power of chaotic iterations increase.

  • Open Access

    A Pipeline for Insertion Sequence Detection and Study for Bacterial Genome

    by Huda Al-Nayyef, Christophe Guyeux, Jacques M. Bahi

    Insertion Sequences (ISs) are small DNA segments that have the ability of moving themselves into genomes. These types of mobile genetic elements (MGEs) seem to play an essential role in genomes rearrangements and evolution of prokaryotic genomes, but the tools that deal with discovering ISs in an efficient and accurate way are still too few and not totally precise. Two main factors have big effects on IS discovery, namely: genes annotation and functionality prediction. Indeed, some specific genes called "transposases" are enzymes that are responsible of the production and catalysis for such transposition, but there is currently no fully accurate method that could decide whether a given predicted gene is either a real transposase or not. This is why authors of this article aim at designing a novel pipeline for ISs detection and classification, which embeds the most recently available tools developed in this field of research, namely OASIS (Optimized Annotation System for Insertion Sequence) and ISFinder database (an up-to-date and accurate repository of known insertion sequences). As this latter depend on predicted coding sequences, the proposed pipeline will encompass too various kinds of bacterial genes annotation tools (that is, Prokka, BASys, and Prodigal). A complete IS detection and classification pipeline is then proposed and tested on a set of 23 complete genomes of Pseudomonas aeruginosa. This pipeline can also be used as an investigator of annotation tools performance, which has led us to conclude that Prodigal is the best software for IS prediction. A deepen study regarding IS elements in P.aeruginosa has then been conducted, leading to the conclusion that close genomes inside this species have also a close numbers of IS families and groups.

  • Open Access

    Relation between Insertion Sequences and Genome Rearrangements in Pseudomonas aeruginosa

    by Huda Al-Nayyef, Christophe Guyeux, Marie Petitjean, Didier Hocquet, Jacques M. Bahi

    During evolution of microorganisms genomes underwork have different changes in their lengths, gene orders, and gene contents. Investigating these structural rearrangements helps to understand how genomes have been modified over time. Some elements that play an important role in genome rearrangements are called insertion sequences (ISs), they are the simplest types of transposable elements (TEs) that widely spread within prokaryotic genomes. ISs can be defined as DNA segments that have the ability to move (cut and paste) themselves to another location within the same chromosome or not. Due to their ability to move around, they are often presented as responsible of some of these genomic recombination. Authors of this research work have regarded this claim, by checking if a relation between insertion sequences (ISs) and genome rearrangements can be found. To achieve this goal, a new pipeline that combines various tools have firstly been designed, for detecting the distribution of ORFs that belongs to each IS category. Secondly, links between these predicted ISs and observed rearrangements of two close genomes have been investigated, by seeing them with the naked eye, and by using computational approaches. The proposal has been tested on 18 complete bacterial genomes of Pseudomonas aeruginosa, leading to the conclusion that IS3 family of insertion sequences are related to genomic inversions.


  • Open Access

    Taenia Biomolecular Phylogeny and the Impact of Mitochondrial Genes on this Latter

    by Huda Al-Nayyef, Christophe Guyeux, Jacques M. Bahi

    Variations in mitochondrial genes are usually considered to infer phylogenies. However some of these genes are lesser constraint than other ones, and thus may blur the phylogenetic signals shared by the majority of the mitochondrial DNA sequences. To investigate such effects, in this research work, the molecular phylogeny of the genus Taenia is studied using 14 coding sequences extracted from mitochondrial genomes of 17 species. We constructed 16,384 trees, using a combination of 1 up to 14 genes. We obtained 131 topologies, and we showed that only four particular instances were relevant. Using further statistical investigations, we then extracted a particular topology, which displays more robustness properties.

  • Open Access

    Quality Analysis of a Chaotic Proven Keyed Hash Function

    by Jacques M. Bahi, Jean-François Couchot, Christophe Guyeux

    Hash functions are cryptographic tools, which are notably involved in integrity checking and password storage. They are of primary importance to improve the security of exchanges through the Internet. However, as security flaws have been recently identified in the current standard in this domain, new ways to hash digital data must be investigated. In this document an original keyed hash function is evaluated. It is based on asynchronous iterations leading to functions that have been proven to be chaotic. It thus possesses various topological properties as uniformity and sensibility to its initial condition. These properties make our hash function satisfies established security requirements in this field. This claim is qualitatively proven and experimentally verified in this research work, among other things by realizing a large number of simulations.