WorldCat Identities

Bahi, Jacques Mohcine

Overview
Works: 28 works in 80 publications in 3 languages and 738 library holdings
Roles: Author, Thesis advisor, Opponent, Other, Author of introduction
Publication Timeline
.
Most widely held works by Jacques Mohcine Bahi
Discrete dynamical systems and chaotic machines : theory and applications by Jacques Mohcine Bahi( )

19 editions published between 2013 and 2019 in English and held by 359 WorldCat member libraries worldwide

"For computer scientists, especially those in the security field, the use of chaos has been limited to the computation of a small collection of famous but unsuitable maps that offer no explanation of why chaos is relevant in the considered contexts. Discrete Dynamical Systems and Chaotic Machines: Theory and Applications shows how to make finite machines, such as computers, neural networks, and wireless sensor networks, work chaotically as defined in a rigorous mathematical framework. Taking into account that these machines must interact in the real world, the authors share their research results on the behaviors of discrete dynamical systems and their use in computer science. Covering both theoretical and practical aspects, the book presents: Key mathematical and physical ideas in chaos theory Computer science fundamentals, clearly establishing that chaos properties can be satisfied by finite state machines Concrete applications of chaotic machines in computer security, including pseudorandom number generators, hash functions, digital watermarking, and steganography Concrete applications of chaotic machines in wireless sensor networks, including secure data aggregation and video surveillance. Until the authors' recent research, the practical implementation of the mathematical theory of chaos on finite machines raised several issues. This self-contained book illustrates how chaos theory enables the study of computer security problems, such as steganalysis, that otherwise could not be tackled. It also explains how the theory reinforces existing cryptographically secure tools and schemes"--
Parallel iterative algorithms : from sequential to grid computing by Jacques Mohcine Bahi( Book )

21 editions published between 2007 and 2019 in English and Occitan and held by 302 WorldCat member libraries worldwide

"Focusing on grid computing and asynchronism, Parallel Iterative Algorithms: From Sequential to Grid Computing explores the theoretical and practical aspects of parallel numerical algorithms. Each chapter contains a theoretical discussion of the topic, an algorithmic section that fully details implementation examples and specific algorithms, and an evaluation of the advantages and drawbacks of the algorithms. Several exercises also appear at the end of most chapters." "Providing the theoretical and practical knowledge needed to design and implement efficient parallel iterative algorithms, this book illustrates how to apply these algorithms to solve linear and nonlinear numerical problems in parallel environments, including local, distant, homogeneous, and heterogeneous clusters."--BOOK JACKET
Algorithmes itératifs parallèles et distribués( Book )

1 edition published in 2001 in French and held by 27 WorldCat member libraries worldwide

Discrete dynamical systems, chaotic machine, and applications to information security by Jacques Mohcine Bahi( Book )

1 edition published in 2013 in English and held by 5 WorldCat member libraries worldwide

Jace : un environnement d'exécution distribué pour le calcul itératif asynchrone by Kamel Mazouzi( Book )

2 editions published in 2005 in French and held by 3 WorldCat member libraries worldwide

Réseaux de capteurs : localisation, couverture et fusion de données by Abdallah Makhoul( Book )

2 editions published in 2008 in French and held by 3 WorldCat member libraries worldwide

This thesis tackles the problems of localization, coverage and data fusion in randomly deployed sensor networks. First, we introduce a novel approach for node's localization. It is based on a single mobile beacon aware of its positions. Sensor nodes receiving beacon packets will be able to locate themselves. The mobile beacon follows a defined Hilbert curve. On the other hand, we exploit the localization phase to construct sets of active nodes that ensure as much as possible the zone coverage. To optimize the energy consumption, we construct disjoint sets of active nodes such that only one of them is active at any moment, while ensuring at the same time both the network connectivity and the area coverage. We present and study four different scheduling methods. ln a third step, we study the problem of data fusion in sensor networks in particular the" average consensus" problem. It allows the nodes of a sensor network to track the average of n sensor measurements. To compute the average, we propose an iterative asynchronous algorithm that is robust to the dynamic topology changes and the loss of messages. To show the effectiveness of the proposed algorithms, we conducted series of simulations based on OMNet++
Parallel iterative algorithms by Jacques Mohcine Bahi( Book )

1 edition published in 2007 in English and held by 3 WorldCat member libraries worldwide

"Providing the theoretical and practical knowledge needed to design and implement efficient parallel iterative algorithms, this book illustrates how to apply these algorithms to solve linear and nonlinear numerical problems in parallel environments, including local, distant, homogeneous, and heterogeneous clusters."--Jacket
Algorithmes asynchrones pour des systèmes différentiels-algébriques. : imulation numérique sur des exemples de circuits électriques by Jacques Mohcine Bahi( Book )

2 editions published in 1991 in French and held by 2 WorldCat member libraries worldwide

On s'intéresse dans cette thèse à des systèmes différentiels implicites où les inconnues et leurs dérivées sont liées algébriquement. L'objet du présent travail est l'étude d'extensions de la méthode de Relaxation d'Onde, incluant des variantes asynchrones. On élabore donc des méthodes asynchrones pour le traitement des équations différentielles algébriques avec valeurs initiales. Le début de cette thèse est consacré à la modélisation et à l'étude du comportement des méthodes itératives de point fixe appliquées à ces systèmes. On s'intéresse, ensuite, plus particulièrement à l'extension au cadre asynchrone de la méthode de Relaxation d'Onde, en établissant un résultat général de couplage des inconnues par le biais d'une application de point fixe plus implicite. On donne quelques exemples appartenant aux classes de problèmes traités, on discrétise nos systèmes par des méthodes de Runge-Kutta et on étudie les problèmes discrets associés. Après avoir étudié les erreurs d'arrondi dues à la mise en œuvre sur ordinateur, on réalise une simulation d'exécution d'algorithmes asynchrones et on traite quelques exemples issus de problèmes de circuits électriques
Efficient and cryptographically secure generation of chaotic pseudorandom numbers on GPU by Christophe Guyeux( )

1 edition published in 2015 in English and held by 2 WorldCat member libraries worldwide

Wireless sensor networks for Industrial health assessment based on a random forest approach by Wiem Elghazel( )

2 editions published in 2015 in English and held by 2 WorldCat member libraries worldwide

Une maintenance prédictive efficace se base essentiellement sur la fiabilité des données de surveillance.Dans certains cas, la surveillance des systèmes industriels ne peut pas être assurée à l'aide de capteurs individuels ou filaires. Les Réseaux de Capteurs Sans Fil (RCSF) sont alors une alternative. Vu la nature de communication dans ces réseaux, la perte de données est très probable. Nous proposons un algorithme distribué pour la survie des données dans le réseau. Cet algorithme réduit le risque d'une perte totale des paquets de données et assure la continuité du fonctionnement du réseau. Nous avons aussi simulé de différentes topologies du réseau pour évaluer leur impact sur la complétude des données au niveau du nœud puits. Par la suite, nous avons proposé une démarche d'évaluation de l'état de santé de systèmes physiques basée sur l'algorithme des forêts aléatoires. Cette démarche repose sur deux phases : une phase hors ligne et une phase en ligne. Dans la phase hors ligne, l'algorithme des forêts aléatoires sélectionne les paramètres qui contiennent le plus d'information sur l'état du système. Ces paramètres sont utilisés pour construire les arbres décisionnels qui constituent la forêt. Dans la phase en ligne, l'algorithme évalue l'état actuel du système en utilisant les données capteurs pour parcourir les arbres construits. Chaque arbre dans la forêt fournit une décision, et la classe finale est le résultat d'un vote majoritaire sur l'ensemble de la forêt. Quand les capteurs commencent à tomber en panne, les données décrivant un indicateur de santé deviennent incomplètes ou perdues. En injectant de l'aléatoire dans la base d'apprentissage, l'algorithme aura des points de départ différents, et par la suite les arbres aussi. Ainsi, l'absence des mesures d'un indicateur de santé ne conduit pas nécessairement à l'interruption du processus de prédiction de l'état de santé
Calcul itératif asynchrone sur infrastructure pair-à-pair : la plate-forme JaceP2P by Philippe Vuillemin( Book )

2 editions published in 2006 in French and held by 2 WorldCat member libraries worldwide

Fault tolerant data transmission reduction method for wireless sensor networks by Gaby Bou Tayeh( )

1 edition published in 2020 in English and held by 2 WorldCat member libraries worldwide

Création et évaluation statistique d'une nouvelle de générateurs pseudo-aléatoires chaotiques by Qianxue Wang( Book )

2 editions published in 2012 in French and held by 2 WorldCat member libraries worldwide

In this thesis, a new way to generate pseudorandom numbers is presented. The propositionis to mix two exiting generators with discrete chaotic iterations that satisfy the Devaney'sdefinition of chaos. A rigorous framework is introduced, where topological properties of theresulting generator are given, and two practical designs are presented and evaluated. It is shownthat the statistical quality of the inputted generators can be greatly improved by this way, thusfulfilling the up-to-date standards. Comparison between these two designs and existing generatorsare investigated in details. Among other things, it is established that the second designedtechnique outperforms the first one, both in terms of performance and speed.In the first part of this manuscript, the iteration function embedded into chaotic iterations isthe vectorial Boolean negation. In the second part, we propose a method using graphs havingstrongly connected components as a selection criterion.We are thus able to modify the iterationfunction without deflating the good properties of the associated generator. Simulation resultsand basic security analysis are then presented to evaluate the randomness of this new family ofpseudorandom generators. Finally, an illustration in the field of information hiding is presented,and the robustness of the obtained data hiding algorithm against attacks is evaluated
Optimisation de la durée de vie d'un réseau de capteurs by Amine Abbas( Book )

2 editions published in 2007 in French and held by 2 WorldCat member libraries worldwide

Recent advances in embedded computing systems have led to the emergence of wireless sensor networks, consisting of small, battery-powered nodes. ln these networks, controlling the energy consumptions is an important challenge, since energy is the scarcest resource of wireless sensor networks, and it determines their lifetimes. AIgorithms and protocols must be developed in order to use energy efficiently and to maintain the network in activity as a long as possible. ln this thesis, we propose a decentralized iterative approach to irnprove the lifetirne of a wireless sensor network. The proposed approach guarantees a fair workload distribution across the network. This approach ensures tbat each node will contriute proportionally to its available energy. We study the relevance of our algorithm to prolong the lifetirne in helerogeneous wireless sensor networks through simulations using OMNeT++
Algorithmique itérative pour l'équilibrage de charge dans les réseaux dynamiques by Flavien Vernier( Book )

2 editions published in 2004 in French and held by 2 WorldCat member libraries worldwide

This thesis studies the problem of load balancing on dynamic networks. A dynamic network can be viewed as a network in which some edges may fail during the execution of an algorithm. The first part introduces a new load balancing algorithm, and it describes the adaptation of first order algorithms to dynamic networks. The second part deals with second order algorithms. We introduce a new constrain for these algorithms, so as to ensure that the load stay positive for the load of a system cannot be negative. Then we give the adaptation of these algorithms to dynamic networks. We illustrate the behavior of the first and second order algorithms with some simulations that bring the impact of the dynamism of networks on load balancing algorithms to the fore.These simulations show that the second order algorithms are more reactive to the dynamism than the first order algorithms. Finally, we have implemented a load balancing algorithm on a real application that solves a partial differential equation. With this experimentation, we describe the different steps of the deployment of a load balancing algorithm
Désordre des itérations chaotiques et leur utilité en sécurité informatique by Christophe Guyeux( Book )

2 editions published in 2010 in French and held by 2 WorldCat member libraries worldwide

Les itérations chaotiques, un outil issu des mathématiques discrètes, sont pour la première fois étudiées pour obtenir de la divergence et du désordre. Après avoir utilisé les mathématiques discrètes pour en déduire des situations de non convergence, ces itérations sont modélisées sous la forme d'un système dynamique et sont étudiées topologiquement dans le cadre de la théorie mathématique du chaos. Nous prouvons que leur adjectif « chaotique » a été bien choisi : ces itérations sont du chaos aux sens de Devaney, Li-Yorke, l'expansivité, l'entropie topologique et l'exposant de Lyapunov, etc. Ces propriétés ayant été établies pour une topologie autre que la topologie de l'ordre, les conséquences de ce choix sont discutées. Nous montrons alors que ces itérations chaotiques peuvent être portées telles quelles sur ordinateur, sans perte de propriétés, et qu'il est possible de contourner le problème de la finitude des ordinateurs pour obtenir des programmes aux comportements prouvés chaotiques selon Devaney, etc. Cette manière de faire est respectée pour générer un algorithme de tatouage numérique et une fonction de hachage chaotiques au sens le plus fort qui soit. À chaque fois, l'intérêt d'être dans le cadre de la théorie mathématique du chaos est justifié, les propriétés à respecter sont choisies suivant les objectifs visés, et l'objet ainsi construit est évalué. Une notion de sécurité pour la stéganographie est introduite, pour combler l'absence d'outil permettant d'estimer la résistance d'un schéma de dissimulation d'information face à certaines catégories d'attaques. Enfin, deux solutions au problème de l'agrégation sécurisée des données dans les réseaux de capteurs sans fil sont proposées
Parallel sparse linear solver with GMRES method using minimization techniques of communications for GPU clusters by Lilia Ziane Khodja( )

1 edition published in 2014 in English and held by 2 WorldCat member libraries worldwide

Résolution de systèmes linéaires et non linéaires creux sur grappes de GPUs by Lilia Ziane Khodja( Book )

2 editions published in 2013 in French and held by 2 WorldCat member libraries worldwide

Depuis quelques années, les grappes équipées de processeurs graphiques GPUs sont devenues des outils très attrayants pour le calcul parallèle haute performance. Dans cette thèse, nous avons conçu des algorithmes itératifs parallèles pour la résolution de systèmes linéaires et non linéaires creux de très grandes tailles sur grappes de GPUs. Dans un premier temps, nous nous sommes focalisés sur la résolution de systèmes linéaires creux à l'aide des méthodes itératives CG et GMRES. Les expérimentations ont montré qu'une grappe de GPUs est plus performante que son homologue grappe de CPUs pour la résolution de systèmes linéaires de très grandes tailles. Ensuite, nous avons mis en oeuvre des algorithmes parallèles synchrones et asynchrones des méthodes itératives Richardson et de relaxation par blocs pour la résolution de systèmes non linéaires creux. Nous avons constaté que les meilleurs solutions développées pour les CPUs ne sont pas nécessairement bien adaptées aux GPUs. En effet, les simulations effectuées sur une grappe de GPUs ont montré que les algorithmes Richardson sont largement plus efficaces que ceux de relaxation par blocs. De plus, elles ont aussi montré que la puissance de calcul des GPUs permet de réduire le rapport entre le temps d'exécution et celui de communication, ce qui favorise l'utilisation des algorithmes asynchrones sur des grappes de GPUs. Enfin, nous nous sommes intéressés aux grappes géographiquement distantes pour la résolution de systèmes linéaires creux. Dans ce contexte, nous avons utilisé la méthode de multi-décomposition à deux niveaux avec GMRES parallèle adaptée aux grappes de GPUs. Celle-ci utilise des itérations synchrones pour résoudre localement les sous-systèmes linéaires et des itérations asynchrones pour résoudre la globalité du système linéaire
Towards smart firefighting using the internet of things and machine learning by Gaby Bou Tayeh( Book )

2 editions published in 2020 in English and held by 2 WorldCat member libraries worldwide

In this thesis, we present a multilevel scheme consisting of both hardware and software solutions to improve the daily operational life of firefighters. As a core part of this scheme, we design and develop a smart system of wearable IoT devices used for state assessment and localization of firefighters during interventions. To ensure a maximum lifetime for this system, we propose multiple data-driven energy management techniques for resource constraint IoT devices. The first one is an algorithm that reduces the amount of data transmitted between the sensor and the destination (Sink). This latter exploits the temporal correlation of collected sensor measurements to build a simple yet robust model that can forecast future observations. Then, we coupled this approach with a mechanism that can identify lost packets, force synchronization, and reconstruct missing data. Furthermore, knowing that the sensing activity does also require a significant amount of energy, we extended the previous algorithm and added an additional adaptive sampling layer. Finally, we also proposed a decentralized data reduction approach for cluster-based sensor networks. All the previous algorithms have been tested and validated in terms of energy efficiency using custom-built simulators and through implementation on real sensor devices. The results were promising as we were able to demonstrate that our proposals can significantly improve the lifetime of the network. The last part of this thesis focusses on building data-centric decision-making tools to improve the efficiency of interventions. Since sensor data clustering is an important pre-processing phase and a stepstone towards knowledge extraction, we review recent clustering techniques for massive data management in IoT and compared them using real data for a gas leak detection sensor network. Furthermore, with our hands on a large dataset containing information on 200,000 interventions that happened during a period of 6 years in the region of Doubs, France. We study the possibility of using Machine Learning to predict the number of future interventions and help firefighters better manage their mobile resources according to the frequency of events
Combining approaches for predicting genomic evolution by Bassam Alkindy( Book )

2 editions published in 2015 in English and held by 2 WorldCat member libraries worldwide

In Bioinformatics, understanding how DNA molecules have evolved over time remains an open and complex problem.Algorithms have been proposed to solve this problem, but they are limited either to the evolution of a given character (forexample, a specific nucleotide), or conversely focus on large nuclear genomes (several billion base pairs ), the latter havingknown multiple recombination events - the problem is NP complete when you consider the set of all possible operationson these sequences, no solution exists at present. In this thesis, we tackle the problem of reconstruction of ancestral DNAsequences by focusing on the nucleotide chains of intermediate size, and have experienced relatively little recombinationover time: chloroplast genomes. We show that at this level the problem of the reconstruction of ancestors can be resolved,even when you consider the set of all complete chloroplast genomes currently available. We focus specifically on the orderand ancestral gene content, as well as the technical problems this raises reconstruction in the case of chloroplasts. Weshow how to obtain a prediction of the coding sequences of a quality such as to allow said reconstruction and how toobtain a phylogenetic tree in agreement with the largest number of genes, on which we can then support our back in time- the latter being finalized. These methods, combining the use of tools already available (the quality of which has beenassessed) in high performance computing, artificial intelligence and bio-statistics were applied to a collection of more than450 chloroplast genomes
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  General Special  
Audience level: 0.63 (from 0.55 for Discrete d ... to 0.97 for Parallel i ...)

Discrete dynamical systems and chaotic machines : theory and applications
Covers
Parallel iterative algorithms : from sequential to grid computingDiscrete dynamical systems, chaotic machine, and applications to information securityParallel iterative algorithms
Alternative Names
Bahi Jacques M.

Jacques Bahi acadèmic francès

Jacques Bahi académico francês

Jacques Bahi académicu francés

Jacques Bahi accademico francese

Jacques Bahi Frans academicus

Jacques Bahi French academic

Jacques Bahi universitaire français

Languages
English (50)

French (19)

Occitan (1)