Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1007/978-3-031-37765-5guideproceedingsBook PagePublication PagesConference Proceedingsacm-pubtype
Networked Systems: 11th International Conference, NETYS 2023, Benguerir, Morocco, May 22–24, 2023, Proceedings
2023 Proceeding
Publisher:
  • Springer-Verlag
  • Berlin, Heidelberg
Conference:
International Conference on Networked SystemsBenguerir, Morocco22 May 2023
ISBN:
978-3-031-37764-8
Published:
20 July 2023

Reflects downloads up to 14 Nov 2024Bibliometrics
Abstract

No abstract available.

Skip Table Of Content Section
front-matter
Front Matter
Pages i–x
back-matter
Back Matter
Article
Front Matter
Page 1
Article
Detection of Fake News Through Heterogeneous Graph Interactions
Abstract

Fake news is one of the most prominent forms of disinformation. Unfortunately, today’s advanced social media platforms allow for the rapid transmission of fake news, which may negatively impact several aspects of human society. Despite the ...

Article
Edge-Based Bird Species Recognition via Active Learning
Abstract

Monitoring and mitigating the ongoing decline of biodiversity is one of the most important global challenges that we face today. In this context, birds are important for many ecosystems, since they link habitats, resources, and biological ...

Article
A Peer to Peer Federated Graph Neural Network for Threat Intelligence
Abstract

Threat intelligence is the process of collecting and analyzing information about potential cyber threats. Several approaches have been conducted for cyber threat detection based on the federated learning method. These approaches aim to establish a ...

Article
Front Matter
Page 41
Article
A Formal Analysis of Karn’s Algorithm
Abstract

The stability of the Internet relies on timeouts. The timeout value, known as the Retransmission TimeOut (RTO), is constantly updated, based on sampling the Round Trip Time (RTT) of each packet as measured by its sender – that is, the time between ...

Article
Comparing Causal Convergence Consistency Models
Abstract

In distributed databases, the CAP theorem establishes that a distributed storage system can only ensure two out of three properties: strong data consistency (i.e., reads returning the most recent writes), availability, or partition tolerance. ...

Article
Front Matter
Page 79
Article
Encrypted Search: Not Enough to Ensure Privacy
Abstract

The success of most recent end-to-end encrypted messaging applications (such as whatsApp, signal, etc) is due to the fact that they rely on sound cryptographic primitives and protocols to provide a high level of data protection. The massive use ...

Article
Case Study on the Performance of ML-Based Network Intrusion Detection Systems in SDN
Abstract

SDN enables centralized control of network services by separating control and data planes, providing greater flexibility and scalability in network traffic management. However, this architecture also creates new security challenges, such as a ...

Article
Beyond Locks and Keys: Structural Equation Modeling Based Framework to Explore Security Breaches Through the Lens of Crime Theories
Abstract

The current evolution of the cyber-threat ecosystem shows that no organization can be considered invulnerable against security breach. It is therefore important to highlight exogenous factors other than those related to an organization’s security ...

Article
Front Matter
Page 103
Article
Consensus on an Unknown Torus with Dense Byzantine Faults
Abstract

We present a solution to consensus on a torus with Byzantine faults. Any solution to classic consensus that is tolerant to f Byzantine faults requires 2f+1 node-disjoint paths. Due to limited torus connectivity, this bound necessitates spatial ...

Article
Front Matter
Page 123
Article
Approximation Algorithms for Drone Delivery Scheduling Problem
Abstract

The coordination among drones and ground vehicles for last-mile delivery has gained significant interest in recent years. In this paper, we study multiple drone delivery scheduling problem (MDSP) [3] for last- mile delivery, where we have a set of ...

Article
Pebble Guided Treasure Hunt in Plane
Abstract

We study the problem of treasure hunt in a Euclidean plane by a mobile agent with the guidance of pebbles. The initial position of the agent and position of the treasure are modeled as special points in the Euclidean plane. The treasure is ...

Article
Distance-2-Dispersion: Dispersion with Further Constraints
Abstract

The aim of the dispersion problem is to place a set of k(n) mobile robots in the nodes of an unknown graph consisting of n nodes such that in the final configuration each node contains at most one robot, starting from any arbitrary initial ...

Contributors
  • University of Central Florida
  • New York University
Please enable JavaScript to view thecomments powered by Disqus.

Recommendations