Accueil › Annuaire des chercheurs › Hafida Bouarfa
Hafida Bouarfa
Affiliation : University of Blida
- 45Publications (affiliation algérienne)
- 52Publications au total
- 367Citations
- 11Indice h
Profil de recherche
Hafida Bouarfa compte 45 publications référencées (2004–2026). Ses travaux paraissent principalement dans « Lecture notes in computer science », « International Conference on Intelligent Computer Systems, Data Science and Applications (IC2SDA) » et « Journal of Ambient Intelligence and Humanized Computing ». Son article le plus cité, « A survey on silicon PUFs » (2022), a été cité 44 fois. 9 de ces publications datent des trois dernières années d’activité. Ses travaux sont cosignés avec au moins 12 chercheurs.
C’est vous ? Faites connaître vos travaux
Créez gratuitement votre profil DzCademia et ajoutez vos articles : ils apparaîtront plus facilement sur Google et dans les assistants d’IA comme ChatGPT. Plus de personnes pourront vous lire et vous citer.
Créer mon profil gratuit Ajouter mes publicationsDomaines de recherche
- Semantic Web and Ontologies
- Physical Unclonable Functions (PUFs) and Hardware Security
- Internet of Things and AI
- IoT and Edge/Fog Computing
- Blockchain Technology Applications and Security
Publications (45)
- Lightweight and secure federated learning in IoT – A decentralized client selection approach
- A Reliable and Resource-Aware Federated Learning Solution by Decentralizing Client Selection for IoT Devices
- Probing Bioacoustic Soundscapes: An Empirical Study of Few-Shot Sound Event Detection
- Securing Digital Twin System Using Blockchain: Application on Smart Home
- A Review of Digital Twins in Smart Environments
- A Review on Financial Fraud Detection: Techniques, Challenges, Solutions, and Perspectives
- Smart cities services and solutions: A systematic review
- Teacher-Student Framework for Polyphonic Semi-supervised Sound Event Detection: Survey and Empirical Analysis
- Towards a new cloud computing-based approach and framework supporting knowledge management process
- T2S-MAKEP and T2T-MAKEP: A PUF-based Mutual Authentication and Key Exchange Protocol for IoT devices
- Leader-Assisted Client Selection for Federated Learning in IoT via the Cooperation of Nearby Devices
- A survey on silicon PUFs
- PUF-based mutual authentication and session key establishment protocol for IoT devices
- Deep Embedding Learning With Auto-Encoder for Large-Scale Ontology Matching
- Guaranteeing information integrity and access control in smart cities through blockchain
- A novel cooperative clustering approach based on multi-criteria decision-making for IoV
- Mean Teacher for Weakly Supervised Polyphonic Sound Event Detection: An Empirical Study
- Consistency Regularization-Based Polyphonic Audio Event Detection with Minimal Supervision
- Towards a reliable smart city through formal verification and network analysis
- A Low-Cost Authentication Protocol Using Arbiter-PUF
- Towards a Foundation of a Mutual Authentication Protocol for a Robust and Resilient PUF-Based Communication Network
- Guaranteeing Information Integrity Through Blockchains for Smart Cities
- Impact of Mixup Hyperparameter Tunning on Deep Learning-based Systems for Acoustic Scene Classification
- A Generation and Recovery Framework for Silicon PUFs Based Cryptographic Key
- Convolutional neural network for relays selection in the Internet of Vehicles
- A Conceptual Model for Describing the Integration of Decision Aspect into Big Data
- A New Collaborative Clustering Approach for the Internet of Vehicles (CCA-IoV)
- Quantifying Security and Performance of Physical Unclonable Functions
- Towards an Automatic Evaluation of the Performance of Physical Unclonable Functions
- Ontology Matching Using Neural Networks: Evaluation for OAEI Tracks
- A New Model for Integrating Big Data into Phases of Decision-Making Process
- Fuzzy Probabilistic Ontology Approach
- A Semantic Approach for Handling Probabilistic Knowledge of Fuzzy Ontologies
- A Conceptual Model for Describing the Integration of Decision Aspect into Big Data
- A Smart Living Framework: Towards Analyzing Security in Smart Rooms
- Security Implementation and Verification in Smart Buildings
- Ontology Matching using Neural Networks: Survey and Analysis
- A New Supervised Learning Based Ontology Matching Approach Using Neural Networks
- Predicting students performance using decision trees: Case of an Algerian University
- FzMEBN: Toward a General Formalism of Fuzzy Multi-Entity Bayesian Networks for Representing and Reasoning with Uncertain Knowledge
- Proposition of a collaborative platform for virtual design studios
- The management of virtual collaborative design
- Designing a Virtual Organizational Memory- A Case Study
- Acquisition of Tacit Knowledge in Virtual Organizations
- L'Entreprise virtuelle : dimension ou structure organisationnelle
Revues de publication
- Lecture notes in computer science × 5
- International Conference on Intelligent Computer Systems, Data Science and Applications (IC2SDA) × 3
- Journal of Ambient Intelligence and Humanized Computing × 2
- International Journal on Semantic Web and Information Systems × 2
- Procedia Computer Science × 2
- Lecture notes in networks and systems × 2
Publications par année
- 20261
- 20255
- 20243
- 20232
- 20227
- 20218
- 20204
- 20196
- 20182
- 20172
Collaborations
Établissements partenaires : University of Jijel · University of Sciences and Technology Houari Boumediene
Co-auteurs
- Fahem Zerrouki
- Messaouda Fareh
- Walid Miloud Dahmane
- Hadjer Ykhlef
- Zhor Diffallah
- Meriem Ali Khoudja
- Fatma Chiheb
- Fatima Boumahdi
- Mohamed Aiche
- Mahmoud Bersali
- Ishak Riali
- Imane Ben Kissiouer
Données bibliographiques issues d’OpenAlex (base ouverte).
Pourquoi choisir Dzcademia ?
Pour donner à vos travaux plus de chances d’être découverts et recommandés par les IA. Profils, articles et communications : donnez à votre recherche une présence publique structurée. Les métadonnées intégrées aident les moteurs de recherche et les assistants IA à identifier vos travaux et à comprendre leurs références.
Commenter avec Google
Connecte-toi avec Google pour commenter directement sur cette page.