The proceedings contain 42 papers. The topics discussed include: modeling composite intrusion detection systems using fuzzy description logics;low complexity receiver for UWB weighted-transmitted reference system;mutu...
ISBN:
(纸本)9781424491544
The proceedings contain 42 papers. The topics discussed include: modeling composite intrusion detection systems using fuzzy description logics;low complexity receiver for UWB weighted-transmitted reference system;mutual coupling and correlation based suboptimal antenna subset selection in MIMO systems;delay analysis and improvement of IEEE 802.11e-based soft-real-time wireless industrial networks using an open-loop spatial multiplexing scheme;PABEM: a new power-aware adaptive bus encoding method using Huffman algorithm;low overhead spectral efficient cooperative relaying protocols;a novel interference cancellation aided minimum bit error rate beamforming;efficient suboptimal transmit antenna selection for MIMO relay channels;a PCA-based distributed approach for intrusion detection in wireless sensor networks;a dynamic clustering-based approach for anomaly detection in AODV-based MANET;and a CDMA based MAC protocol for ad hoc networks with directional antennas.
We state the Problem of Knot Identification as a way to achieve consensus in dynamic networks. The network adversary is asynchronous and not oblivious. The network may be disconnected throughout the computation. We de...
ISBN:
(纸本)9783031744976;9783031744983
We state the Problem of Knot Identification as a way to achieve consensus in dynamic networks. The network adversary is asynchronous and not oblivious. The network may be disconnected throughout the computation. We determine the necessary and sufficient conditions for the existence of a solution to the Knot Identification Problem: the knots must be observable by all processes and the first observed knot must be the same for all processes. We present an algorithm KIA that solves it. We conduct KIA performance evaluation.
We present Elevator, a novel algorithm for hub sampling in peer-to-peer networks. Elevator constructs overlays whose topology lies between a random graph and a star network. Our approach makes use of preferential atta...
详细信息
ISBN:
(纸本)9783031744976;9783031744983
We present Elevator, a novel algorithm for hub sampling in peer-to-peer networks. Elevator constructs overlays whose topology lies between a random graph and a star network. Our approach makes use of preferential attachment, forming hubs spontaneously, and offering a decentralized solution for use cases that require networks with both low diameter and resilience to failures.
作者：
Cabello, Julia GarciaCarbo-Garcia, S.Univ Granada
Andalusian Res Inst Data Sci & Computat Intellige Dept Appl Math Granada Spain Univ Granada
Andalusian Res Inst Data Sci & Computat Intellige Dept Comp Sci & Artificial Intelligence Granada Spain
In recent years, the architecture and structure of Deep Neural networks (DNNs) have become progressively more complex in order to respond to the increasing complexity of real problems. A strategy to deal with this com...
详细信息
ISBN:
(纸本)9783031820724;9783031820731
In recent years, the architecture and structure of Deep Neural networks (DNNs) have become progressively more complex in order to respond to the increasing complexity of real problems. A strategy to deal with this complexity when it affects training would be to partition DNN training in some way: for example, by distributing it among different components of a computer network. For this, training (which is in essence the minimization of the loss function) should be performed through separated "smaller pieces". This paper offers an alternative to the gradient-based DNN training from a Dynamic Programming (DP) point of view (DP is an optimisation methodology supported by the division of a complex problem into many problems of lower complexity). To do so, conditions which enable the DNN minimization algorithm to be solved under a DP perspective are studied here. In this line, in this work is proved that any artificial neural network ANN (and thus also DNNs) with monotonic activation is separable. Furthermore, whenever ANNs are considered as a dynamical system in the form of a network (known as coupled cell networks CCNs), we show that the transmission function is a separable function assuming that the activation is non-decreasing.
With the vigorous development of Internet technology, the scale of systems in the network has increased sharply, which provides a great opportunity for potential attacks, especially the distributed Denial of Service (...
详细信息
With the vigorous development of Internet technology, the scale of systems in the network has increased sharply, which provides a great opportunity for potential attacks, especially the distributed Denial of Service (DDoS) attack. In this case, detecting DDoS attacks is critical to system security. However, current detection methods exhibit limitations, leading to compromises in accuracy and efficiency. To cope with it, three key strategies are implemented in this paper: (i) Using tensors to model large-scale and heterogeneous data in complex networks;(ii) Proposing a denoising algorithm based on the improved and distributed tensor train (IDTT) decomposition, which optimizes the tensor train(TT) decomposition in terms of parallel computation and low-rank estimation;(iii) Combining (i), (ii) and Light Gradient Boosting Machine (LightGBM) classification model, an efficient DDoS attack detection framework is proposed. Datasets CIC-DDoS2019 and NSL-KDD are used to evaluate the framework, and results demonstrate that accuracy can reach 99.19% while having the characteristics of low storage consumption and well speedup ratio.
The paper provides an overview of advancements in bird detection and recognition systems using Machine Learning and Artificial Intelligence (AI). It highlights the increasing adoption of wind farms amid rising electri...
详细信息
ISBN:
(纸本)9783031820724;9783031820731
The paper provides an overview of advancements in bird detection and recognition systems using Machine Learning and Artificial Intelligence (AI). It highlights the increasing adoption of wind farms amid rising electricity demand, underscoring their environmental impact on avian species. To address these ecological challenges, the development of bird recognition solutions is crucial. The paper analyzes various techniques, including radar systems, sound recognition, Convolutional Neural networks (CNNs), electromagnetic detection, YOLOv5, and color segmentation, discussing their features, computational costs, and constraints. It concludes that while deep learning models offer superior results, they need a balance between accuracy and speed, alongside training with large and representative datasets. Ultimately, the paper aims to contribute to efforts aimed at mitigating the adverse effects of wind farms on bird populations through advanced technologies. Additionally, through this paper we intend to shed light over the state of the art on bird detection systems and provide insights that intends to solve some of these drawbacks.
Given the inherent reliance of distributedsystems on concurrent programming, coupled with increased hardware concurrency and diversity, ensuring their reliability, safety, and security without compromising performanc...
详细信息
ISBN:
(纸本)9783031753794;9783031753800
Given the inherent reliance of distributedsystems on concurrent programming, coupled with increased hardware concurrency and diversity, ensuring their reliability, safety, and security without compromising performance has become exceedingly challenging. This necessitates scalable verification methods that can accurately capture the behavior of concurrent and distributedsystems while providing robust guarantees of compliance with specific requirements. The Scalable Verification and Validation of Concurrent and distributedsystems (ScaVeri) track is dedicated to presenting and discussing advancements in formal methods tailored to these systems. Emphasizing scalable techniques and models that have been validated through real-world case studies, the track covers subtopics such as generating correct parallel code, compositional verification with assume-guarantee contracts, enhanced analysis for large-scale systems, and combinations of various analysis techniques, collectively aiming to improve the assurance of diverse and complex distributed computing environments.
Local failover mechanisms are used to achieve fast recovery from link failures in communication networks. These mechanisms are typically implemented using static routing tables at the nodes of a network, only relying ...
详细信息
ISBN:
(纸本)9783031744976;9783031744983
Local failover mechanisms are used to achieve fast recovery from link failures in communication networks. These mechanisms are typically implemented using static routing tables at the nodes of a network, only relying on failures of outgoing links, as well as the label of the source and target node of a packet (called s - t-routing). Static failover s- t-routing on undirected graphs has been shown to be able to tolerate at most 2 failures, denoted 2-resilient, with 3-resiliency being impossible without additional rewritable bits in the packet header. In this work, we investigate local failover routing on directed graphs with n nodes and show lower and upper bounds on the number of bits required. Even 1-resilience cannot be achieved on all topologies without additional bits and we prove that 1-resilience can be obtained with inverted right perpendicularlog(n)inverted left perpendicular bits. For k > 1 failures, we show that at least inverted right perpendicularlog(k + 1)inverted left perpendicular bits are necessary, but that k(inverted right perpendicularlog(vertical bar E vertical bar)inverted left perpendicular) bits are sufficient to obtain k-resiliency.
Exploration of different network topologies is one of the fundamental problems of distributedsystems. The problem has been studied on networks like lines, rings, tori, rectangular grids, etc. In this work, we have co...
详细信息
ISBN:
(纸本)9783031744976;9783031744983
Exploration of different network topologies is one of the fundamental problems of distributedsystems. The problem has been studied on networks like lines, rings, tori, rectangular grids, etc. In this work, we have considered a rectangle enclosed triangular grid (RETG). A RETG is a part of an infinite triangular grid and the part is enclosed by a rectangle whose one pair of parallel sides aligns with a family of parallel straight lines of the infinite triangular grid. We have studied the problem of perpetual exploration on a RETG using oblivious robots. We have considered the robots with limited visibility i.e. the robots are myopic. Infinite visibility becomes impractical for a very large network. Limited visibility is more practical than infinite visibility. The robots have neither any chirality nor any axis agreement. An algorithm is provided to explore the RETG perpetually without any collision. The algorithm works under a synchronous scheduler. The algorithm requires three robots with two hop visibility.
暂无评论