检索结果-内蒙古大学图书馆

arXiv 2023年

作者： Liu, Xiaogeng Li, Minghui Wang, Haoyu Hu, Shengshan Ye, Dengpan Jin, Hai Wu, Libing Xiao, Chaowei School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Hubei Key Laboratory of Distributed System Security China Hubei Engineering Research Center on Big Data Security China Cluster and Grid Computing Lab China School of Cyber Science and Engineering Wuhan University China Arizona State University United States

Deep neural networks are proven to be vulnerable to backdoor attacks. Detecting the trigger samples during the inference stage, i.e., the test-time trigger sample detection, can prevent the backdoor from being triggered. However, existing detection methods often require the defenders to have high accessibility to victim models, extra clean data, or knowledge about the appearance of backdoor triggers, limiting their practicality. In this paper, we propose the test-time corruption robustness consistency evaluation (TeCo)1, a novel test-time trigger sample detection method that only needs the hard-label outputs of the victim models without any extra information. Our journey begins with the intriguing observation that the backdoor-infected models have similar performance across different image corruptions for the clean images, but perform discrepantly for the trigger samples. Based on this phenomenon, we design TeCo to evaluate test-time robustness consistency by calculating the deviation of severity that leads to predictions' transition across different corruptions. Extensive experiments demonstrate that compared with state-of-the-art defenses, which even require either certain information about the trigger types or accessibility of clean data, TeCo outperforms them on different backdoor attacks, datasets, and model architectures, enjoying a higher AUROC by 10% and 5 times of stability. Copyright © 2023, The Authors. All rights reserved.

关键词： Crime

来源：评论

学校读者我要写书评

暂无评论

AIDE: Attack Inference Based on Heterogeneous Dependency Graphs with MITRE ATT&CK

AIDE: Attack Inference Based on Heterogeneous Dependency Gra...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Weidong Zhou Chunhe Xia Nan Feng Xinyi Pan Tianbo Wang Xiaojian Li Beijing Key Lab. of Network Technology Beihang University Beijing China Guangxi Collaborative Innovation Center of Multi-Source Information Integration and Intelligent Processing Guangxi Normal University Guilin China School of Software & Microelectronics Peking University Beijing China School of Cyber Science and Technology Beihang University Beijing China School of Computer Science and Engineering Guangxi Normal University Guilin China

ISBN: (数字)9798331506209

ISBN: (纸本)9798331506216

The MITRE ATT&CK Framework provides a rich and actionable repository of adversarial tactics, techniques, and procedures (TTPs). By leveraging the associations among these techniques, we can infer unobserved techniques based on those have been observed. Current machine learning inference methods based on small-scale data face the following problems: "logical dependencies missing" and "complex associations missing." The former means that current association methods rely solely on the statistical dependencies between attack techniques while ignoring the logical dependencies involved in executing those techniques. The latter indicates that current inference methods simplify the complex associations between technologies based on statistical assumptions, failing to adequately capture the long-range and intricate real-world relationships between techniques. To address these problems, we propose an Attack Inference model based on heterogeneous DEpendency graphs (AIDE). First, we extract three types of logical dependencies: CVE, Pattern, and Conditional, which allows us to construct a heterogeneous dependency graph among the techniques, thus addressing the "logical dependencies missing" problem. Second, we employ Relation Graph Convolution Neural Networks (RGCN) to aggregate heterogeneous dependencies into representation vectors of the techniques. Finally, we utilize the sequence inference model Decoder, which excels at capturing implicit contextual associations, to infer unknown attacks, thus addressing the "complex associations missing" problem. Experiments conducted on real datasets demonstrate that our model significantly outperforms state-of-the-art baseline models in both hits@k and map@k metrics.

关键词： Adaptation models Aggregates Refining Machine learning Vectors Threat assessment Real-time systems Decoding Security Context modeling

来源：评论

学校读者我要写书评

暂无评论

A Many-Objective Evolutionary Algorithm Assisted by Ideal Hyperplane

SSRN

引用

SSRN 2022年

作者： Zhang, Zhixia Wen, Jie Wang, Hui Cai, Xingjuan Cui, Zhihua Zhang, Wensheng School of Computer Science and Technology Taiyuan University of Science and Technology China School of Information Engineering Nanchang Institute of Technology Nanchang330099 China State Key Laboratory of Intelligent Control and Management of Complex System Institute of Automation Chinese Academy of Sciences China State Key Lab. for Novel Software Technology Nanjing University China

In many-objective optimization problems (MaOPs), it is a difficult task for evolutionary algorithms to balance convergence and diversity while rapidly converging to the Pareto front. As the number of objectives increases, the difficulty of evolutionary algorithms increases with individual selection pressure. To address above problems, we propose a many-objective evolution algorithm assisted by an ideal hyperplane (MaOEA-IH). Firstly, the ideal hyperplane as a reference surface to guide the individual to search the Pareto front, which is established from the extremum of each dimension of the objective space. Secondly, a parallel p -norm mating selection strategy is proposed to improve convergence. In addition, two factors are considered in this strategy: 1) different p -norm are used to measure different spatial scales;2) individual selection uncertainty is defined by incorporating a probabilistic perturbation mechanism. Thirdly, the improved shift-based density estimation strategy is used as the evaluation criterion for environmental selection to improve the convergence and diversity of solution sets and enhance selection pressure. To verify the effectiveness of the proposed algorithm, MAOEA-IH is compared with seven excellent algorithms in three benchmark sets (DTLZ, WFG and MaF). The results show that the proposed MAOEA-IH is highly competitive in solving MaOPs. © 2022, The Authors. All rights reserved.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

DISTDET: a cost-effective distributed cyber threat detection system 23

DISTDET: a cost-effective distributed cyber threat detection...

引用

Proceedings of the 32nd USENIX Conference on Security Symposium

作者： Feng Dong Liu Wang Xu Nie Fei Shao Haoyu Wang Ding Li Xiapu Luo Xusheng Xiao School of Cyber Science and Engineering Huazhong University of Science and Technology and Sangfor Technologies Inc Beijing University of Posts and Telecommunications Case Western Reserve University School of Cyber Science and Engineering Huazhong University of Science and Technology Key Laboratory of High-Confidence Software Technologies (MOE) School of Computer Science Peking University The Hong Kong Polytechnic University Arizona State University

ISBN: (纸本)9781939133373

Building provenance graph that considers causal relationships among software behaviors can better provide contextual information of cyber attacks, especially for advanced attacks such as Advanced Persistent Threat (APT) attacks. Despite its promises in assisting attack investigation, existing approaches that use provenance graphs to perform attack detection suffer from two fundamental limitations. First, existing approaches adopt a centralized detection architecture that sends all system auditing logs to the server for processing, incurring intolerable costs of data transmission, data storage, and computation. Second, they adopt either rule-based techniques that cannot detect unknown threats, or anomaly-detection techniques that produce numerous false alarms, failing to achieve a balance of precision and recall in APT detection. To address these fundamental challenges, we propose DISTDET, a distributed detection system that detects APT attacks by (1) performing light weight detection based on the host model built in the client side, (2) filtering false alarms based on the semantics of the alarm proprieties, and (3) deriving global models to complement the local bias of the host models. Our experiments on a large-scale industrial environment (1,130 hosts, 14 days, ∼1.6 billion events) and the DARPA TC dataset show that DISTDET is as effective as sate-of-the-art techniques in detecting attacks, while dramatically reducing network bandwidth from 11.28Mb/s to 17.08Kb/S (676.5× reduction), memory usages from 364MB to 5.523MB (66× reduction), and storage from 1.47GB to 130.34MB (11.6× reduction). By the time of this writing, DISTDET has been deployed to 50+ industry customers with 22,000+ hosts for more than 6 months, and identified over 900 real-world attacks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deep Reinforcement Learning for Energy-Efficient Fresh Data Collection in Rechargeable UAV-assisted IoT Networks

Deep Reinforcement Learning for Energy-Efficient Fresh Data ...

引用

IEEE Conference on Wireless Communications and Networking

作者： Mengjie Yi Xijun Wang Juan Liu Yan Zhang Ronghui Hou School of Cyber Engineering Xidian University Xi’an China School of Electronics and Information Technology Sun Yat-sen University Guangzhou China School of Electrical Engineering and Computer Science Ningbo University Zhejiang China State Key Lab of Integrated Service Networks Information Science Institute Xidian University Xi’an China

The unmanned aerial vehicle (UAV) can act as the edge server in delay-sensitive monitoring for data collection and processing in the Internet of things (IoT) networks due to its flexibility and low operational cost. One of its major disadvantages is the limited battery level. This paper focuses on a problem with the rechargeable UAV-assisted energy-efficient and fresh data collection in the IoT networks. In particular, the UAV takes off from the initial position to collect data packets from sensor nodes (SNs) in the IoT networks and needs to reach the final position at a given time. Some charging stations (CSs) are in the IoT networks, which can recharge the UAV by the wireless power transfer technique to keep the UAV’s energy level from falling below the threshold energy. To minimize the weighted sum of the average age of information (AoI) and the average recharging price, we design a Markov Decision Process (MDP) to determine the UAV’s flight trajectory, the scheduling of SNs, and energy recharging. The MDP is then solved using a rechargeable UAV-assisted data collection algorithm based on dueling double deep Q-networks (D3QN). Numerous simulations show that the proposed D3QN algorithm can reduce the weighted sum of the average AoI and the average recharging price more effectively than the baseline algorithms.

关键词： Simulation Wireless power transfer Data collection Autonomous aerial vehicles Energy efficiency Scheduling Trajectory

来源：评论

学校读者我要写书评

暂无评论

Modeling Inter-Intra Heterogeneity for Graph Federated Learning

arXiv

引用

arXiv 2024年

作者： Yu, Wentao Chen, Shuo Tong, Yongxin Gu, Tianlong Gong, Chen School of Computer Science and Engineering Nanjing University of Science and Technology China Center for Advanced Intelligence Project RIKEN Japan State Key Laboratory of Complex & Critical Software Environment Beihang University China Jinan University China Department of Automation Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University China

Heterogeneity is a fundamental and challenging issue in federated learning, especially for the graph data due to the complex relationships among the graph nodes. To deal with the heterogeneity, lots of existing methods perform the weighted federation based on their calculated similarities between pairwise clients (i.e., subgraphs). However, their inter-subgraph similarities estimated with the outputs of local models are less reliable, because the final outputs of local models may not comprehensively represent the real distribution of subgraph data. In addition, they ignore the critical intra-heterogeneity which usually exists within each subgraph itself. To address these issues, we propose a novel Federated learning method by integrally modeling the Inter-Intra Heterogeneity (FedIIH). For the inter-subgraph relationship, we propose a novel hierarchical variational model to infer the whole distribution of subgraph data in a multi-level form, so that we can accurately characterize the inter-subgraph similarities with the global perspective. For the intra-heterogeneity, we disentangle the subgraph into multiple latent factors and partition the model parameters into multiple parts, where each part corresponds to a single latent factor. Our FedIIH not only properly computes the distribution similarities between subgraphs, but also learns disentangled representations that are robust to irrelevant factors within subgraphs, so that it successfully considers the inter- and intra- heterogeneity simultaneously. Extensive experiments on six homophilic and five heterophilic graph datasets in both non-overlapping and overlapping settings demonstrate the effectiveness of our method when compared with nine state-of-the-art methods. Specifically, FedIIH averagely outperforms the second-best method by a large margin of 5.79% on all heterophilic datasets. Code is available at https://***/blgpb/FedIIH. Copyright © 2024, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

GAI-Enabled Explainable Personalized Federated Semi-Supervised Learning

arXiv

引用

arXiv 2024年

作者： Peng, Yubo Jiang, Feibo Dong, Li Wang, Kezhi Yang, Kun State Key Laboratory of Novel Software Technology Nanjing University Nanjing China Suzhou China School of Information Science and Engineering Hunan Normal University Changsha China Changsha Social Laboratory of Artificial Intelligence Hunan University of Technology and Business Changsha China Department of Computer Science Brunel University London United Kingdom

Federated learning (FL) is a commonly distributed algorithm for mobile users (MUs) training artificial intelligence (AI) models, however, several challenges arise when applying FL to real-world scenarios, such as label scarcity, non-IID data, and unexplainability. As a result, we propose an explainable personalized FL framework, called XPFL. First, we introduce a generative AI (GAI) assisted personalized federated semi-supervised learning, called GFed. Particularly, in local training, we utilize a GAI model to learn from large unlabeled data and apply knowledge distillation-based semi-supervised learning to train the local FL model using the knowledge acquired from the GAI model. In global aggregation, we obtain the new local FL model by fusing the local and global FL models in specific proportions, allowing each local model to incorporate knowledge from others while preserving its personalized characteristics. Second, we propose an explainable AI mechanism for FL, named XFed. Specifically, in local training, we apply a decision tree to match the input and output of the local FL model. In global aggregation, we utilize t-distributed stochastic neighbor embedding (t-SNE) to visualize the local models before and after aggregation. Finally, simulation results validate the effectiveness of the proposed XPFL framework. Copyright © 2024, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Deep Common Feature Mining for Efficient Video Semantic Segmentation

arXiv

引用

arXiv 2024年

作者： Zheng, Yaoyan Yang, Hongyu Huang, Di State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing100191 China Institute of Artificial Intelligence Beihang University Beijing100191 China Shanghai Artificial Intelligence Laboratory Shanghai201112 China Zhejiang Industrial Big Data and Robot Intelligent System Key Laboratory Hangzhou Innovation Institute Beihang University Hangzhou310051 China

Recent advancements in video semantic segmentation have made substantial progress by exploiting temporal correlations. Nevertheless, persistent challenges, including redundant computation and the reliability of the feature propagation process, underscore the need for further innovation. In response, we present Deep Common Feature Mining (DCFM), a novel approach strategically designed to address these challenges by leveraging the concept of feature sharing. DCFM explicitly decomposes features into two complementary components. The common representation extracted from a key-frame furnishes essential high-level information to neighboring non-key frames, allowing for direct re-utilization without feature propagation. Simultaneously, the independent feature, derived from each video frame, captures rapidly changing information, providing frame-specific clues crucial for segmentation. To achieve such decomposition, we employ a symmetric training strategy tailored for sparsely annotated data, empowering the backbone to learn a robust high-level representation enriched with common information. Additionally, we incorporate a self-supervised loss function to reinforce intra-class feature similarity and enhance temporal consistency. Experimental evaluations on the VSPW and Cityscapes datasets demonstrate the effectiveness of our method, showing a superior balance between accuracy and efficiency. The implementation is available at https://***/BUAAHugeGun/DCFM. © 2024, CC BY-NC-SA.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

PPO-Based Vehicle Control for Ramp Merging Scheme Assisted by Enhanced C-V2X

arXiv

引用

arXiv 2025年

作者： Wu, Qiong Ji, Maoxin Fan, Pingyi Wang, Kezhi Cheng, Nan Chen, Wen Letaief, Khaled B. The School of Internet of Things Engineering Jiangnan University Wuxi214122 China The Department of Electronic Engineering State Key laboratory of Space Network and Communications Beijing National Research Center for Information Science and Technology Tsinghua University Beijing100084 China The Department of Computer Science Brunel University Middlesex LondonUB8 3PH United Kingdom The State Key Lab. of ISN School of Telecommunications Engineering Xidian University Xi’an710071 China The Department of Electronic Engineering Shanghai Jiao Tong University Shanghai200240 China Hong Kong

On-ramp merging presents a critical challenge in autonomous driving, as vehicles from merging lanes need to dynamically adjust their positions and speeds while monitoring traffic on the main road to prevent collisions. To address this challenge, we propose a novel merging control scheme based on reinforcement learning, which integrates lateral control mechanisms. This approach ensures the smooth integration of vehicles from the merging lane onto the main road, optimizing both fuel efficiency and passenger comfort. Furthermore, we recognize the impact of vehicle-to-vehicle (V2V) communication on control strategies and introduce an enhanced protocol leveraging Cellular Vehicle-to-Everything (C-V2X) Mode 4. This protocol aims to reduce the Age of Information (AoI) and improve communication reliability. In our simulations, we employ two AoI-based metrics to rigorously assess the protocol's effectiveness in autonomous driving scenarios. By combining the NS3 network simulator with Python, we simulate V2V communication and vehicle control simultaneously. The results demonstrate that the enhanced C-V2X Mode 4 outperforms the standard version, while the proposed control scheme ensures safe and reliable vehicle operation during on-ramp merging. Copyright © 2025, The Authors. All rights reserved.

关键词： Problem oriented languages

来源：评论

学校读者我要写书评

暂无评论

Application of Blockchain Based on Fabric Consensus Network Model in Secure Encryption of Educational Information

引用

Applied Mathematics and Nonlinear Sciences 2024年第1期9卷

作者： Yuan, Bo Wu, Faguo School of Computer Science and Engineering Beihang University Beijing100191 China State Key Laboratory of Software Development Environment Beihang University Beijing100191 China Beihang University Beijing100191 China Institute of Artificial Intelligence Beihang University Beijing100191 China Beijing Advanced Innovation Center for Future Blockchain and Privacy Computing Beihang University Beijing100191 China

This paper combines blockchain technology with an information encryption algorithm to design a blockchain-based educational information protection model. It focuses on the role of Fabric architecture and blockchain data structure for information security protection. A chaotic cipher is used to encrypt the information, combined with the iteration of nonlinear functions to generate pseudo-random numbers to realize the unpredictability of the information. Using symbolic dynamics to obtain the control parameter or initial value of the chaotic mapping, combining the sequence of symbols to solve for another value, and finally presenting it in the form of ciphertext in the client for the data accessor to query and access the data. The effectiveness and practicality of educational information security encryption are examined by applying the model of constructed information protection. The results show that the response time of the blockchain module changes depending on the information, and the response time is basically maintained between 2.2 seconds and 2.4 seconds, which is in a reasonable range. In educational information security defense, the information protection model is able to effectively defend the network against attacks, with the highest number of attacks against the attack named external, with the highest number close to 50 million. © 2023 Bo Yuan et al., published by Sciendo.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：