Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Maher Hamdi

dblp:47/795 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
1since 2021 · last 2023
0000-0002-6092-7698ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 4 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Image and video coding · 67% Multimedia systems and quality of experience · 33%
Computer networks
1 paper
Internet architecture and protocols · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video coding
variable-rate coding
0.011997
Rate Control for VBR Video Coders in Broad-Band Networks · IEEE J. Sel. Areas Commun. 1997
Image and video coding › rate control
video rate control
0.011997
Rate Control for VBR Video Coders in Broad-Band Networks · IEEE J. Sel. Areas Commun. 1997
Multimedia systems and quality of experience
video transmission
0.011997
Rate Control for VBR Video Coders in Broad-Band Networks · IEEE J. Sel. Areas Commun. 1997
Internet architecture and protocols
broadband network
0.011997
Rate Control for VBR Video Coders in Broad-Band Networks · IEEE J. Sel. Areas Commun. 1997

Methods — techniques the papers use, named apart from their topics

rate control algorithm · 0.0
YearPublicationVenuePosition
2023 Optimization of CNN-based Federated Learning for Cyber-Physical Detection
abstract
With the increasing popularity of Cyber-physical Systems (CPS), there is a growing need for efficient and reliable methods for detecting and responding to threats. Federated Learning (FL) is a distributed Machine Learning (ML) technique that can be used to train models on data from multiple devices (i.e., edge devices) while keeping the data local. FL has the potential to improve the security and privacy of data while also reducing the training time and cost. Particularly, CNN-based FL has been shown to be effective for various tasks such as image classification and object detection. However, selecting suitable hyperparameters for constructing local ML models in FL is a significant challenge for practical inference and training on edge devices. In this paper, we focus on the optimization of CNN-based federated learning for the task of cyber-physical detection and we propose employing a novel metaheuristic optimization algorithm called Honey Badger Algorithm (HBA) for tuning the hyperparameters in local ML models (FL-HBA). To show the effectiveness of FL-HBA, we make an evaluation using an intelligent healthcare case study where we consider Sleep Apnea (SA) and use the PhysioNet apnea ECG dataset to diagnose SA. Our results show that the FL-HBA is superior to a Convolutional Neural Network (CNN) baseline, traditional ML techniques, and centralized learning models. Furthermore, we demonstrate that the proposed method for assigning the near-optimal hyperparameter values for centralized learning models improves accuracy by 2%.
Ammar Kamal Abasi, Moayad Aloqaily, Bassem Ouni, Maher Hamdi
CCNC4
2000 Towards mobile ad-hoc WANs: terminodes
abstract
Terminodes are personal devices that provide functionality of both the terminals and the nodes of the network. A network of terminodes is an autonomous, fully self-organized, wireless network, independent of any infrastructure. It must be able to scale up to millions of units, without any fixed backbone or server. In this paper we present the main challenges and discuss the main technical directions.
Jean-Pierre Hubaux, Jean-Yves Le Boudec, Silvia Giordano, Maher Hamdi, Ljubica Blazevic, Levente Buttyán, Milan Vojnovic
WCNC4
1997 Improving Congestion Avoidance Algorithms for Asymmetric Networks
abstract
Congestion avoidance algorithms considering the network as a black-box model detect congestion through packet loss and variation in the throughput or in the round trip delay. In this paper we show, by means of analysis and simulation, an undesirable effect acting on delay and throughput based congestion avoidance algorithms. This effect is caused by congestion experienced by acknowledgements. We propose to change these algorithms by dividing the round trip time into a forward trip time and backward trip time. We show the performance improvement using this distinction. Finally, we describe a possible implementation in the TCP protocol.
Omar Elloumi, Hossam Afifi, Maher Hamdi
ICC (3)3
1997 Multi-layered video coding for improving channel utilization in B-ISDN
abstract
We are concerned about the problem of transmitting constant quality video over the B-ISDN. A gain in channel utilization is achieved when several variable bit rate video sources share a common ATM connection. To achieve such gain, the impact of cell losses on video quality degradation should be considered. Multi-layered video coding has been shown to tolerate more cell losses than non-layered video coding while maintaining negligible quality degradation. We exploit this cell loss tolerability in a multi-layered video coding scheme to improve multiplexing efficiency while preserving a constant video quality.
Ayman A. M. Ibrahim, Pierre Rolin, Maher Hamdi
ISCC3
1997 Rate Control for VBR Video Coders in Broad-Band Networks
abstract
We present a rate control algorithm adapted to MPEG video coders ensuring that output conforms to the parameters of a leaky-bucket network access controller. The algorithm avoids unpredictable rate variations without the rigidity and systematic coding delay of constant bit-rate (CBR) coders, and makes possible resource provision for guaranteed quality of service. A relatively large burst tolerance parameter allows considerable scope for variation at GoP scale, and only restricts the natural rate when necessary to avoid long-term overloads. Possible multiplexing schemes are discussed distinguishing buffer provision for cell-scale and burst-scale congestion.
Maher Hamdi, James W. Roberts, Pierre Rolin
IEEE J. Sel. Areas Commun.1