Distributed Denial of Service(DDoS) attacks target the forwarding-control separation feature of Software-Defined networking(SDN) to launch attacks, causing network disruptions. Therefore security against DDoS attack d...
Distributed Denial of Service(DDoS) attacks target the forwarding-control separation feature of Software-Defined networking(SDN) to launch attacks, causing network disruptions. Therefore security against DDoS attack detection for SDN controllers is the focus of current research. This paper proposes an Extreme Gradient Boosting (XGBoost) DDoS attack detection algorithm based on a combination of information gain and recursive feature elimination algorithms. We evaluated the performance of the method using the CICDDoS2019 dataset. This method works well in multi-classification model for attack detection with an accuracy of 93.41%.
With the rapid advancement of intelligent automobiles, the ever-growing communication data put forward high bandwidth and low latency requirements. To meet these requirements, automotive Original Equipment Manufacture...
详细信息
With the rapid advancement of intelligent automobiles, the ever-growing communication data put forward high bandwidth and low latency requirements. To meet these requirements, automotive Original Equipment Manufacturers (OEMs) widely adopt domain-centralized Electrical/Electronic (E/E) architecture. In this architecture, Time-Sensitive networking (TSN) is expected to serve as the backbone network because of its high bandwidth and deterministic communication. TSN uses the Gate Control List (GCL) to divide its time length into multiple time slots, and the time intervals of these time slots are non-uniform (equal or unequal). Different flows have varying requirements for time slot sizes. To enhance the acceptance ratio of Time-Triggered (TT) flows through GCL time slot allocation, packet fragmentation (i.e., flow fragmentation) is introduced into TSN in the recent study. The state-of-the-art packet fragmentation solution divides one un-schedulable TT flow into multiple equal-sized packets (i.e., equal-sized time slots). In other words, these fixed-size packets are difficult to be mapped into the time slots with different sizes. This study develops a Packet Fragmentation with Variable-size and Vigorous-mapping (PFV2) technique based on the following three innovations: (1) we implement variable-size packet fragmentation, which iteratively divides the un-schedulable TT flow into smaller packets and then dynamically reschedules these packets;(2) we implement the vigorous mapping solution from packets to time slots by deeply searching for available time slots within the flow's deadline;and (3) we verify PFV2 based on the LS1028A with Cortex-A72 (i.e., the NXP automotive-grade development board). PFV2 improves the acceptance ratio by up to 20.18% and bandwidth utilization by up to 7.024% compared with the state-of-the-art solution. The theoretical and practical co-verification experiments demonstrate that the PFV2 can effectively improve the flow acceptance ratio and outperf
Despite recent advancements in out-of-distribution (OOD) detection, most current studies assume a class-balanced in-distribution training dataset, which is rarely the case in real-world scenarios. This paper addresses...
详细信息
In the field of cybersecurity, encrypted traffic classification is of paramount importance, serving as a crucial technology for ensuring data privacy and defending against cyber attacks. Existing ETC (Encrypted Traffi...
详细信息
Recently, more and more college ranking systems are receiving attention due to the demand and necessity of higher education and college ranking system is a key topic in the field of social choice. However, these ranki...
Recently, more and more college ranking systems are receiving attention due to the demand and necessity of higher education and college ranking system is a key topic in the field of social choice. However, these rankings have different evaluation criteria that lead to confusion for decision-makers. To address this issue, a simple and practical approach is to aggregate these ranking systems from different sources. In this paper, we conduct an experimental study on aggregation of world university ranking. Specifically, we first classify unsupervised RA methods. Then, we compare the aggregation effects of 28 unsupervised RA methods on five public university rankings.
We present NNVISR - an open-source filter plugin for the VapourSynth1 video processing framework, which facilitates the application of neural networks for various kinds of video enhancing tasks, including denoising, s...
详细信息
Multimodal Multi-Objective Optimization Problems (MMOPs) refer to situations where there are multiple equivalent Pareto sets corresponding to the same Pareto front. The complexity of solving MMOPs lies in locating mul...
详细信息
Multimodal Multi-Objective Optimization Problems (MMOPs) refer to situations where there are multiple equivalent Pareto sets corresponding to the same Pareto front. The complexity of solving MMOPs lies in locating multiple equivalent PSs within the decision space while maintaining diversity and convergence in both the decision and objective spaces. To better address this issue, a dual-archive niche approach using two-stage directed differential evolution is proposed, named MMOHCDE_DDM. Firstly, the algorithm leverages the concept of dual archives and introduces affinity propagation clustering for niche differential evolution, automatically generating multiple stable niches. Subsequently, it combines with a competitive particle swarm optimizer to address two solution spaces with different evolutionary requirements. Secondly, by generating multiple subpopulations through affinity propagation clustering, the algorithm employs two distinct mutation strategies to update populations in parallel. This approach enables more effective exploration within niches, effectively enhancing the diversity of both the decision and objective spaces. Furthermore, while the above strategies effectively enhance diversity, they may lead to a loss of convergence. To mitigate this issue and improve convergence, a two-stage directed differential operator is proposed. Introducing a directed differential operator in the later stages of the search provides directed exploration of regions with higher optimality, thereby enhancing convergence. The proposed approach enhances the diversity of both the decision and objective spaces while ensuring convergence in the objective space. The algorithm is compared with various state-of-the-art MMO algorithms on 22 MMO test problems. Experimental results demonstrate that the proposed algorithm outperforms multiple state-of-the-art MMO algorithms in the majority of MMO test problems.
This paper studies Who-What-Where (3W) composite-semantic video instance search (INS) problem, which aims to find a specific person doing a queried action in a particular place. Mainstream approaches adopt a complete ...
This paper studies Who-What-Where (3W) composite-semantic video instance search (INS) problem, which aims to find a specific person doing a queried action in a particular place. Mainstream approaches adopt a complete decomposition strategy, which divides a composite-semantic query into multiple single-semantic queries. However, due to the lack of necessary correlation analysis among constituent semantics, these methods cannot always generate identity-matching and semantics-consistent 3W INS results. To address the above challenges, we propose a partial decomposition scheme with action as the link. Specifically, we selectively split the 3W INS as person-action INS and action-location INS. The former ensures the retrieved person and action share the same identity by modeling their relative spatial positions at the frame level, while the latter improves the semantic consistency between action and location with a cross-semantic attention mechanism at the shot level. Particularly, we build a large-scale 3W INS dataset, containing over 470k video shots, on basis of NIST TRECVID 2016-2021 INS tasks and verify the effectiveness of the proposed method with both quantitative and qualitative experiments.
Many businesses are putting their sensitive data in the cloud with the fast growth of cloud computing and storage. To ensure user privacy, it is necessary to keep encrypted data only in the cloud. Attribute-based encr...
详细信息
Pretrained language models (PLMs) have made remarkable progress in table-to-text generation tasks. However, the lack of domain-specific knowledge makes it challenging to bridge the topological gap between tabular data...
详细信息
Pretrained language models (PLMs) have made remarkable progress in table-to-text generation tasks. However, the lack of domain-specific knowledge makes it challenging to bridge the topological gap between tabular data and text, especially in real-world applications with limited resources. To mitigate the limitation of insufficient labeled data, we propose a novel framework: Adapt-Knowledge-to-Generate (AKG). The core insight of AKG is to adapt unlabeled domain-specific knowledge into the model, which brings at least three benefits: 1) it injects representation of normal table-related descriptions to bridge the topological gap between tabular data and texts; 2) it enables us to use large amounts of unlabeled domain-specific knowledge fully, which can alleviate the PLMs' inherent shortcomings of lacking domain knowledge; 3) it allows us to design various tasks to employ the domain-specific knowledge. Extensive experiments and analyses are conducted on three open-domain, few-shot natural language generation (NLG) data sets: Humans, Songs, and Books. Compared to previous state-of-the-art approaches, our model achieves superior performance in terms of both fluency and accuracy as judged by human and automatic evaluations.
暂无评论