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

Proceedings of the 33rd USENIX Conference on security Symposium

作者： Siyue Feng Yueming Wu Wenjie Xue Sikui Pan Deqing Zou Yang Liu Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab and School of Cyber Science and Engineering Huazhong University of Science and Technology China Nanyang Technological University Singapore National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab and School of Cyber Science and Engineering Huazhong University of Science and Technology China and Jinyinhu Laboratory China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab and School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (纸本)9781939133441

With the continuous development of software open-sourcing, the reuse of open-source software has led to a significant increase in the occurrence of recurring vulnerabilities. These vulnerabilities often arise through the practice of copying and pasting existing vulnerabilities. Many methods have been proposed for detecting recurring vulnerabilities, but they often struggle to ensure both high efficiency and consideration of semantic information about vulnerabilities and patches. In this paper, we introduce FIRE, a scalable method for large-scale recurring vulnerability detection. It utilizes multi-stage filtering and differential taint paths to achieve precise clone vulnerability scanning at an extensive scale. In our evaluation across ten open-source software projects, FIRE demonstrates a precision of 90.0% in detecting 298 recurring vulnerabilities out of 385 ground truth instance. This surpasses the performance of existing advanced recurring vulnerability detection tools, detecting 31.4% more vulnerabilities than VUDDY and 47.0% more than MOVERY. When detecting vulnerabilities in large-scale software, FIRE outperforms MOVERY by saving about twice the time, enabling the scanning of recurring vulnerabilities on an ultra-large scale.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SRv6-INT Enabled Network Monitoring and Measurement: Toward High-Yield Network Observability for Digital Twin 3rd

SRv6-INT Enabled Network Monitoring and Measurement: Toward...

引用

3rd International Conference on Machine Learning, Cloud Computing and intelligent Mining, MLCCIM 2024

作者： Zhang, Xu Feng, Chuan Han, Pengchao Liu, Wei Gong, Xiaoxue Zhang, Qiupei Guo, Lei School of Communications and Information Engineering Chongqing University of Posts and Telecommunications Chongqing400065 China Institute of Intelligent Communication and Network Security Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China School of Information Engineering Guangdong University of Technology Guangzhou510006 China

ISBN: (纸本)9789819616978

Network monitoring and measurement is an important part of realizing the network digital twin. However, it introduces the problem of high cost when obtaining the status data of physical networks. Therefore, to efficiently achieve network observability, we first introduce potential techniques and network scenarios for implementing network measurements. Then, a High-Yield Segment Routing over IPv6 based In-band Network Telemetry (HY-SRv6-INT) system is proposed in this paper. In particular, we design the HY-SRv6-INT system architecture. It consists of IPv6 switches implemented by the P4 language and a Software-Defined Networking (SDN) controller containing the HY-SRv6-INT application. Next, we experimentally demonstrate a packet-level path-associated network measurement process. In addition, the performance of the HY-SRv6-INT system is also quantitatively evaluated to verify its advantages. Finally, we discuss some research challenges and open issues for future network telemetry. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Internet protocols

来源：评论

学校读者我要写书评

暂无评论

A new class of S-boxes with optimal Feistel boomerang uniformity

引用

Cryptography and Communications 2025年 1-13页

作者： Lu, Yuxuan Mesnager, Sihem Li, Nian Wang, Lisha Zeng, Xiangyong Key Laboratory of Intelligent Sensing System and Security (Hubei University) Ministry of Education the Hubei Provincial Engineering Research Center of Intelligent Connected Vehicle Network Security School of Cyber Science and Technology Hubei University Wuhan China Department of Mathematics University of Paris VIII Saint-Denis France Laboratory of Analysis Geometry and Applications (LAGA) University Sorbonne Paris Nord CNRS UMR 7539 Villetaneuse France Télém Paris Palaiseau France Key Laboratory of Intelligent Sensing System and Security (Hubei University) Ministry of Education Hubei Key Laboratory of Applied Mathematics Faculty of Mathematics and Statistics Hubei University Wuhan China

The Feistel Boomerang Connectivity Table ( $$\textrm{FBCT}$$ ), which is the Feistel version of the Boomerang Connectivity Table ( $$\textrm{BCT}$$ ), plays a role in analyzing block ciphers’ ability to withstand strong attacks, such as boomerang attacks. However, as of now, only four classes of power functions are known to have explicit values for all entries in their $$\textrm{FBCT}$$ . In this paper, we focus on studying the FBCT of the power function $$F(x)=x^{2^{n-2}-1}$$ over $$\mathbb {F}_{2^n}$$ , where n is a positive integer. Through certain refined manipulations to solve specific equations over $$\mathbb {F}_{2^n}$$ and employing binary Kloosterman sums, we determine explicit values for all entries in the $$\textrm{FBCT}$$ of F(x) and further analyze its Feistel boomerang spectrum. Finally, we demonstrate that this power function exhibits the lowest Feistel boomerang uniformity.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Exploring the Robustness: Hierarchical Federated Learning Framework for Object Detection of UAV Cluster

引用

IEEE Transactions on Mobile Computing 2025年

作者： Li, Xingyu Zhang, Wenzhe Liu, Linfeng Xu, Jia Nanjing University of Posts and Telecommunications School of Computer Science and Technology Nanjing210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210023 China

The deployment of Unmanned Aerial Vehicle (UAV) cluster is an available solution for object detection missions. In the harsh environment, UAV cluster could suffer from some significant threats (e.g., forest fire hazards, electromagnetic interference, and ground-to-air attacks), which could lead to the destruction of UAVs and loss of data. To this end, we propose a Hierarchical Federated Learning Framework for Object Detection (HFL-OD) to enhance the robustness of UAV cluster conducting object detection missions. In HFL-OD, UAVs are grouped through a Three-Dimensional (3D) graph coloring method, and an intragroup backup mechanism is provided to prevent the data loss caused by the destruction of UAVs. Besides, a dynamic server selection mechanism deals with the potential destruction of servers (cluster server and group servers) by adaptively reassigning the server roles. To further improve the robustness and mission efficiency of UAV cluster, a twotier federated learning framework is introduced to make a proper trade-off between object detection accuracy and communication/computational overhead. This framework is built on the concept of hierarchical federated learning by implementing both intragroup parameter aggregation and global parameter aggregation. Extensive simulations and comparisons demonstrate the superior performance of our proposed HFL-OD, i.e., the robustness of UAV cluster conducting object detection missions can be significantly improved, and the communication/computational overhead is effectively reduced. © 2002-2012 IEEE.

关键词： Fire hazards

来源：评论

学校读者我要写书评

暂无评论

Task Offloading Scheduling and Privacy Protection Optimization in Vehicular Edge Computing Based on Double Deep Q-Network 18th

Task Offloading Scheduling and Privacy Protection Optimizat...

引用

18th China Conference on Wireless Sensor Networks, CWSN 2024

作者： Weifeng, Lu Saijun, Yang Jia, Xu Lijie, Xu Lingyun, Jiang Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Xianlin Street Jiangsu Nanjing210023 China

ISBN: (纸本)9789819621859

As the applications and services within vehicular networking systems become increasingly diverse, vehicles with limited computing resources face challenges in handling these computationally intensive and latency-sensitive tasks. In this paper, we propose an improved Task Offloading Scheduling Strategy based on a Double Deep Q-Network (TOSDDQN) for a dynamic multi-vehicle, multi-edge unit task offloading environment in vehicular networking. This strategy designs communication models and computational models aimed at minimizing the total system overhead in processing tasks. To further protect the privacy of vehicle users, a Distributed Training Algorithm based on Federated Learning (DTAFL) is proposed. Comparative experimental results indicate that, compared to three other task offloading schemes, our approach reduces the average system overhead in processing tasks by 11%–36%. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

Multimodal Summarization with Modality-Aware Fusion and Summarization Ranking 24th

Multimodal Summarization with Modality-Aware Fusion and Su...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Ye, Xuming Chaomurilige Liu, Zheng Luo, Haoyu Dong, Jun Luo, Yingzhe Key Laboratory of Ethnic Language Intelligent Analysis and Security Governance of MOE Minzu University of China Beijing China Hainan International College of Minzu University of China Li’an International Education Innovation pilot Zone Hainan572499 China Faculty of Data Science City University of Macau Macau China

ISBN: (纸本)9789819615278

Existing multimodal summarization methods primarily focus on multimodal fusion to efficiently utilize the visual information for summarization. However, they fail to exploit the deep interaction between textual and visual modality. Moreover, optimizing the model by maximum likelihood estimation (MLE) leads to exposure bias, causing the model to generate the next word that is based on the previously generated erroneous words during inference. To address these challenges, we propose a novel modality-aware fusion module (MAF) with a summarization ranking (SumR) training objective. Specifically, the MAF module exploits the interaction in the multimodal input through multiple fusion layers, and SumR aims to align the probability order predicted by the model with actual quality metrics, therefore it is able to reduce the exposure bias problem during inference. Extensive experiments on a large-scale dataset demonstrate that our method outperforms existing models, achieving superior results in both automatic and human evaluation metrics. The generated multimodal summaries provide richer context and enhance user’s comprehension by combining the key textual information with the relevant visual content. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

Blockchain-Enhanced Federated Learning for Secure and intelligent Consumer Electronics : An Overview

引用

IEEE Consumer Electronics Magazine 2025年

作者： Zhu, Chenlu Wang, Shuilong Fan, Xiaoxuan Deng, Xianjun Liu, Shenghao He, Yuanyuan Wu, Celimuge Huazhong University of Science and Technology Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Wuhan430074 China The University of Electro-Communications China

With the rapid advancement of Artificial Intelligence (AI) and Internet of Things (IoT), consumer electronics have become essential in daily life. However, these devices generate and store vast amounts of personal data, posing significant security threats. Federated learning, a distributed machine learning method, protects user privacy by training models collaboratively without sharing raw data. However, it still faces numerous challenges. To further enhance data security, the integration of blockchain technology is crucial. Blockchain's decentralized and immutable characteristics enable secure data sharing and privacy protection in consumer electronics. This paper analyzes the application of federated learning in consumer electronics, examines how blockchain can enhance federated learning, and discusses future research directions. The primary contributions of this paper include a detailed application of blockchain-enhanced federated learning in consumer electronics, intended to serve as a reference for future research. © 2012 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

A label-guided contrastive capsule network for few-shot text classification

引用

Neural Computing and Applications 2025年 1-26页

作者： Xu, Yang Xu, Xiaolong Jiangsu Key Laboratory of Big Data Security Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210023 China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China

Few-shot text classification involves transferring knowledge from a limited dataset to perform classification tasks in unseen domains. Existing metric-based meta-learning models, such as prototypical networks, have shown to be effective. However, these models fail to separate embeddings of similar classes, resulting in performance stagnation. Meanwhile, traditional text classification recently has succeeded with the support of extensive prior knowledge from large language models. However, in few-shot scenarios, it is challenging to generate discriminative sentence embeddings using pre-trained models, often leading to overfitting issues. Furthermore, random support set sampling adversely affects prototype quality, resulting in inaccurate category representations. In this paper, we propose the label-guided contrastive capsule network (LGCCN) to address these issues. LGCCN introduces label information as external knowledge for each category, comprising a label-guided contrastive clustering module (LGCCM) and a label-guided prototype enhancement module (LGPEM). LGCCM employs label information to guide a contrastive clustering process, using labels as anchors to enhance the process, yielding discriminative sentence embeddings from the pre-trained model. LGPEM iteratively generates a robust prototype with label guidance, significantly reducing the impact of random support set sampling. The proposed LGCCN was thoroughly evaluated on seven benchmark datasets from diverse application domains. Experimental results demonstrate that LGCCN outperforms the state-of-the-art (SOTA) method by 9.7% in 1-shot tasks and 1.1% in 5-shot tasks on news datasets. Additionally, on intent recognition datasets, LGCCN surpasses the SOTA with a 3.3% improvement in 1-shot tasks and a 1.4% improvement in 5-shot tasks, highlighting its superior performance in few-shot text classification. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

The Regular Ricci-Inverse Cosmology with Multiple Anticurvature Scalars

arXiv

引用

arXiv 2025年

作者： Mou, Yicen School of Physics Hubei University Hubei Wuhan430062 China Key Laboratory of Intelligent Sensing System and Security Hubei University Ministry of Education China

We investigate the modified gravity in which the Lagrangian of gravity is a function of the trace of the n-th matrix power of Ricci tensor in a Friedmann–Lemaître–Robertson–Walker(FLRW) spacetime. When n is negative, the inverse of Ricci tensor, also called the anticurvature tensor, will be introduced. We design a new class of Ricci-inverse theory containing two anticurvature scalars and resulting to be free from the singularity problem. Copyright © 2025, The Authors. All rights reserved.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Mining User–Item Interactions via Knowledge Graph for Recommendation

引用

ACM Transactions on Recommender systems 2025年第3期3卷 1-19页

作者： Shenghao Liu Lingyun Lu Bang Wang Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Hubei Key Laboratory of Smart Internet Technology School of Electronic Information and Communications Huazhong University of Science and Technology (HUST) Wuhan China

Introducing a Knowledge Graph (KG) to facilitate a recommender system has become a tendency in recent years. Many existing methods leverage KGs to obtain side information of items to promote item representation learning for enhancing recommendation performance. However, they ignore that KGs also may contribute to better user representation learning. To solve this issue, we propose a novel algorithm, the KIGR (Knowledge-aware Interaction Graph for Recommendation), to mine user–item interactions via KGs for assisting user representation learning. Specifically, a user–item interaction is encoded by attentively summing up the relation embedding about the item in the KG. Then, an unsupervised learning method is used to group the user–item interactions into different latent types. Further, a user–item interaction graph is divided into several subgraphs, which is referred to as a Knowledge-aware Interaction Graph, making each subgraph only contain one latent type of interaction. Finally, user representation is the fusion of user interest embedding, which is learned on the knowledge-aware interaction graph, whereas item representation is learned on the KG. Experimental results on MovieLens, LastFM and Amazon-Book validate that the proposed KIGR has a superior performance compared with the state-of-the-art algorithms.

关键词： Recommendation system knowledge graph graph neural network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：