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

arXiv 2025年

作者： Hu, Zhao Qiu, Mingxiu Li, Nian Tang, Xiaohu Wu, Liwei Key Laboratory of Intelligent Sensing System and Security Hubei University Ministry of Education Hubei Provincial Engineering Research Center of Intelligent Connected Vehicle Network Security School of Cyber Science and Technology Hubei University Wuhan430062 China State Key Laboratory of Integrated Service Networks Xi’an710071 China Hubei Key Laboratory of Applied Mathematics Faculty of Mathematics and Statistics Hubei University Wuhan430062 China Southwest Jiaotong University Chengdu610031 China Wuhan Maritime Communication Research Institute China

Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of t-weight linear codes over Fq are presented with the defining sets given by the intersection, difference and union of two certain sets, where t = 3, 4, 5, 6 and q is an odd prime power. By using Weil sums and Gauss sums, the parameters and weight distributions of these codes are determined completely. Moreover, three classes of optimal codes meeting the Griesmer bound are obtained, and computer experiments show that many (almost) optimal codes can be derived from our constructions. Copyright © 2025, The Authors. All rights reserved.

关键词： Weibull distribution

来源：评论

学校读者我要写书评

暂无评论

Privacy Law Enforcement Under Centralized Governance: A Qualitative Analysis of Four Years’ Special Privacy Rectification Campaigns

arXiv

引用

arXiv 2025年

作者： Jing, Tao Li, Yao Ye, Jingzhou Wang, Jie Wang, Xueqiang School of Cyber Science and Engineering Huazhong University of Science and Technology China JinYinHu Laboratory China University of Central Florida United States 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 China

In recent years, major privacy laws like the GDPR have brought about positive changes. However, challenges remain in enforcing the laws, particularly due to under-resourced regulators facing a large number of potential privacy-violating software applications (apps) and the high costs of investigating them. Since 2019, China has launched a series of privacy enforcement campaigns known as Special Privacy Rectification Campaigns (SPRCs) to address widespread privacy violations in its mobile application (app) ecosystem. Unlike the enforcement of the GDPR, SPRCs are characterized by large-scale privacy reviews and strict sanctions, under the strong control of central authorities. In SPRCs, central government authorities issue administrative orders to mobilize various resources for market-wide privacy reviews of mobile apps. They enforce strict sanctions by requiring privacy-violating apps to rectify issues within a short timeframe or face removal from app stores. While there are a few reports on SPRCs, the effectiveness and potential problems of this campaign-style privacy enforcement approach remain unclear to the community. In this study, we conducted 18 semi-structured interviews with app-related engineers involved in SPRCs to better understand the campaign-style privacy enforcement. Based on the interviews, we reported our findings on a variety of aspects of SPRCs, such as the processes that app engineers regularly follow to achieve privacy compliance in SPRCs, the challenges they encounter, the solutions they adopt to address these challenges, and the impacts of SPRCs, etc. We found that app engineers face a series of challenges in achieving privacy compliance in their apps. For example, they receive inconsistent app privacy review reports from multiple app stores and have difficulties confirming the issues flagged by these reports;they also lack institutional support for studying privacy laws, self-validating privacy compliance of their apps, communicating effectiv

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

NI-GDBA: Non-Intrusive Distributed Backdoor Attack Based on Adaptive Perturbation on Federated Graph Learning 34

NI-GDBA: Non-Intrusive Distributed Backdoor Attack Based on ...

引用

34th ACM Web Conference, WWW 2025

作者： Li, Ken Shi, Bin Wei, Jiazhe Dong, Bo School of Computer Science and Technology Xi’an Jiaotong University Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi’an China School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an China School of Distance Education Xi’an Jiaotong University Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an China

ISBN: (纸本)9798400712746

Federated Graph Learning (FedGL) is an emerging Federated Learning (FL) framework that learns the graph data from various clients to train better Graph Neural Networks(GNNs) model. Owing to concerns regarding the security of such framework, numerous studies have attempted to execute backdoor attacks on FedGL, with a particular focus on distributed backdoor attacks. However, all existing methods posting distributed backdoor attack on FedGL only focus on injecting distributed backdoor triggers into the training data of each malicious client, which will cause model performance degradation on original task and is not always effective when confronted with robust federated learning defense algorithms, leading to low success rate of attack. What’s more, the backdoor signals introduced by the malicious clients may be smoothed out by other clean signals from the honest clients, which potentially undermining the performance of the attack. To address the above significant shortcomings, we propose a non-intrusive graph distributed backdoor attack(NI-GDBA) that does not require backdoor triggers to be injected in the training data. Our attack trains an adaptive perturbation trigger generator model for each malicious client to learn the natural backdoor from the GNN model downloading from the server with the malicious client’s local data. In contrast to traditional distributed backdoor attacks on FedGL via trigger injection in training data, our attack on different datasets such as Molecules and Bioinformatics have higher attack success rate, stronger persistence and stealth, and has no negative impact on the performance of the global GNN model. We also explore the robustness of NI-GDBA under different defense strategies, and based on our extensive experimental studies, we show that our attack method is robust to current federated learning defense methods, thus it is necessary to consider non-intrusive distributed backdoor attacks on FedGL as a novel threat that requires custom d

关键词： Backdoor Attacks Federated Graph Learning

来源：评论

学校读者我要写书评

暂无评论

A Triangular Stable Node Network based on Self-supervised Learning for personalized prediction

A Triangular Stable Node Network based on Self-supervised Le...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Liu, Qing Gao, Qian Fan, Jun Zhang, Zhiqiang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Qilu University of Technology Shandong Academy of Sciences Jinan250014 China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology Shandong Academy of Sciences Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan250014 China China Telecom Digital Intelligence Techonology Co Ltd. No.1999 Shunhua road Shandong Jinan250101 China

ISBN: (纸本)9798350368741

In recent years, research has illuminated the potency of implicit data processing in enhancing user preferences. Nevertheless, barriers remain in breaking through the constraints of implicit information. This study aims to bridge this gap by firstly constructing a triangular stable node network model, tailored to manage implicit information with precision. Recognizing the challenge of pinpointing novel structures within large-scale graphs, we propose SLTSNN-a triangular stable node network based on self-supervised learning for personalized prediction. SLTSNN innovates by maximizing mutual information between graph-level and patch-level representations, while augmenting graph representations through extended enhanced representations. Additionally, it incorporates triangular data associations and introduces a triangular allocation attention network, which emphasizes strongly correlated preference features among similar users. Furthermore, SLTSNN employs contrastive learning to maximize mutual information between graph vectors and hidden representations, distinguishing between high-order global and local representations. The model's effectiveness in enhancing user preferences and capturing new graph structures is evidenced by its performance on hit rate and normalized discounted cumulative gain metrics across three datasets. © 2025 IEEE.

关键词： graph contrastive learning graph neural networks recommender systems self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Differential-Trust-Mechanism Based Trade-off Method Between Privacy and Accuracy in Recommender systems

引用

IEEE Transactions on Information Forensics and security 2025年 20卷 5054-5068页

作者： Xu, Guangquan Feng, Shicheng Xi, Hao Yan, Qingyang Li, Wenshan Wang, Cong Wang, Wei Liu, Shaoying Tian, Zhihong Zheng, Xi Qingdao Huanghai University School of Big Data Qingdao China Tianjin University College of Intelligence and Computing Tianjin300350 China KLISS and School of Software Beijing100084 China Sichuan University School of Cyber Science and Engineering Chengdu610207 China Xi’an Jiaotong University School of Cyber Science and Engineering Xi’an710049 China East China Normal University Shanghai200062 China Hiroshima University School of Informatics and Data Science Higashihiroshima739-8511 Japan Guangzhou University Cyberspace Institute of Advanced Technology Guangdong Key Laboratory of Industrial Control System Security Huangpu Research School of Guangzhou University China Macquarie University School of Computing SydneyNSW2109 Australia

In the era where Web3.0 values data security and privacy, adopting groundbreaking methods to enhance privacy in recommender systems is crucial. Recommender systems need to balance privacy and accuracy, while also having the ability to overcome cold start problems. The Differential Trust Mechanism (DTM) introduced in this paper is such an approach. The DTM provides a unique use of Gaussian distributions in modeling trust relationships within data, offering a novel way to balance recommendation accuracy with user privacy. This mechanism innovatively applies differential privacy principles, using Gaussian noise addition to protect individual user data from inference attacks, while maintaining the integrity and utility of the overall dataset. Unlike traditional anonymization techniques that often compromise data utility or vulnerability to reverse engineering, DTM provides a robust solution by dynamically adjusting privacy levels based on the trustworthiness of data requests. By combining DTM with existing mainstream recommendation algorithms, the prediction accuracy of MAE and RMSE increases by at least 6.60% and 2.69%, respectively. This dual benefit positions DTM as a significant advancement in secure data processing, especially relevant for online businesses and platforms where personalized recommendations are crucial yet privacy concerns are paramount. © 2005-2012 IEEE.

关键词： Sensitive data

来源：评论

学校读者我要写书评

暂无评论

A Provably Secure Certificateless Signature Scheme With Anonymity for Healthcare IIoT

引用

IEEE Internet of Things Journal 2025年

作者： Qiao, Zirui Xu, Ran Zhou, Yanwei Yang, Bo Zhu, Tianqing Zhang, Mingwu Xi’an University of Posts and Telecommunications School of Cyberspace Security Xi’an China Ministry of Education Key Laboratory of Data Protection and Intelligent Management China Shaanxi Normal University School of Computer Science Xi’an China City University of Macau Faculty of Data Science Macau China Hubei University of Technology School of Computer Wuhan China

The industrial Internet of Things (IIoT) is changing our way of life and work. As the number of mobile devices connected to IIoT increases, users will face many security challenges such as insecure communication environments. The certificateless signature (CLS) scheme can ensure the integrity and validity of data and provide secure identity authentication for the IIoT, and several pairing-free CLS schemes have been proposed in recent years. However, we find they are vulnerable to the signature forgery attack of malicious key generation centers by safety analysis, which does not realize the security they have claimed. To solve this problem, we show an improved CLS scheme that achieves anonymity and formally proves its security under the hardness of the discrete logarithm problem in the random oracle. Comprehensive performance analysis and comparison show that our scheme has less communication and computation costs with higher security, and our construction is suitable for scenarios with limited resources. Finally, we apply this scheme to construct a mutual identity authentication protocol in the healthcare IIoT environment. 2014 IEEE.

关键词： Anonymity

来源：评论

学校读者我要写书评

暂无评论

A comprehensive survey on shadow removal from document images: datasets, methods, and opportunities

引用

Vicinagearth 2025年第1期2卷 1-18页

作者： Wang, Bingshu Li, Changping Zou, Wenbin Zhang, Yongjun Chen, Xuhang Chen, C.L. Philip School of Software Northwestern Polytechnical University Xi’an China Guangdong Provincial Key Laboratory of Intelligent Information Processing & Shenzhen Key Laboratory of Media Security Shenzhen University Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing College of Electronics and Information Engineering Shenzhen University Shenzhen China Yongjun Zhang is with the State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang China School of Computer Science and Engineering Huizhou University Huizhou China School of Computer Science and Engineering South China University of Technology and Pazhou Lab Guangzhou China

With the rapid development of document digitization, people have become accustomed to capturing and processing documents using electronic devices such as smartphones. However, the captured document images often suffer from issues like shadows and noise due to environmental factors, which can affect their readability. To improve the quality of captured document images, researchers have proposed a series of models or frameworks and applied them in distinct scenarios such as image enhancement, and document information extraction. In this paper, we primarily focus on shadow removal methods and open-source datasets. We concentrate on recent advancements in this area, first organizing and analyzing nine available datasets. Then, the methods are categorized into conventional methods and neural network-based methods. Conventional methods use manually designed features and include shadow map-based approaches and illumination-based approaches. Neural network-based methods automatically generate features from data and are divided into single-stage approaches and multi-stage approaches. We detail representative algorithms and briefly describe some typical techniques. Finally, we analyze and discuss experimental results, identifying the limitations of datasets and methods. Future research directions are discussed, and nine suggestions for shadow removal from document images are proposed. To our knowledge, this is the first survey of shadow removal methods and related datasets from document images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Mamba Adapter: Efficient Multi-Modal Fusion for Vision-Language Tracking

引用

IEEE Transactions on Circuits and systems for Video Technology 2025年

作者： Shi, Liangtao Zhong, Bineng Liang, Qihua Hu, Xiantao Mo, Zhiyi Song, Shuxiang Ministry of Education Guangxi Normal University Key Laboratory of Education Blockchain and Intelligent Technology Guilin541004 China Guangxi Normal University Guangxi Key Lab of Multi-Source Information Mining and Security Guilin541004 China Wuzhou University School of Data Science and Software Engineering Wuzhou543002 China

Utilizing the high-level semantic information of language to compensate for the limitations of vision information is a highly regarded approach in single-object tracking. However, most existing vision-language (VL) trackers employ full-parameter fine-tuning, which can easily lead to catastrophic forgetting. Therefore, they fail to fully exploit the prior knowledge of pre-trained models from upstream tasks, resulting in unsatisfactory tracking performance. To alleviate the above problem, we propose a simple yet effective Vision-Language Tracking pipeline based on Mamba Adapter, named MAVLT, which adopts the idea of parameter-efficient fine-tuning (PEFT) to realize the interaction between vision-language modalities. This novel approach offers the following advantages: (1)The knowledge of the upstream pre-trained model is efficiently inherited by freezing its parameters. This ensures that the VL tracking framework only learns the modules for vision and language interaction, with a focus on the fusion between modalities. (2)The modal interaction between language and vision encoders is flexibly bridged in each encoder layer via proposed mamba adapter, enabling efficient interaction of visual and language information at multiple levels. Extensive experiments on five popular vision-language tracking benchmarks validate the effectiveness of the proposed MAVLT. Particularly, the MAVLT achieves 73.4% AUC score on the LaSOT benchmarks with only 0.18%(0.32M) of the total parameters updates. Code and models are available at https://***/GXNU-ZhongLab/MAVLT. © 1991-2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Improvement of the square-root low bounds on the minimum distances of BCH codes and Matrix-product codes

arXiv

引用

arXiv 2025年

作者： Wang, Xiaoqiang Li, Liuyi Wu, Yansheng Zheng, Dabin Lu, Shuxian Hubei Key Laboratory of Applied Mathematics Key Laboratory of Intelligent Sensing System and Security Ministry of Education Faculty of Mathematics and Statistics Hubei University Wuhan430062 China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China National Mobile Communications Research Laboratory Southeast University Nanjing211111 China

The task of constructing infinite families of self-dual codes with unbounded lengths and minimum distances exhibiting square-root lower bounds is extremely challenging, especially when it comes to cyclic codes. Recently, the first infinite family of Euclidean self-dual binary and nonbinary cyclic codes, whose minimum distances have a square-root lower bound and have a lower bound better than square-root lower bounds are constructed in [6] for the lengths of these codes being unbounded. Let q be a power of a prime number and Q = q2. In this paper, we first improve the lower bounds on the minimum distances of Euclidean and Hermitian duals of BCH codes with length (formula presented) over (formula presented) and (formula presented) over FQ in [11], [13], [31] for the designed distances in some ranges, respectively, where (formula presented). Then based on matrix-product construction and some lower bounds on the minimum distances of BCH codes and their duals, we obtain several classes of Euclidean and Hermitian self-dual codes, whose minimum distances have square-root lower bounds or a square-root-like lower bounds. Our lower bounds on the minimum distances of Euclidean and Hermitian self-dual cyclic codes improved many results in [6]. In addition, our lower bounds on the minimum distances of the duals of BCH codes are almost qs − 1 or q times that of the existing lower bounds. © 2025, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SFma-Unet: A Mamba-Based Spatial-Frequency Fusion Network for Medical Image Segmentation

SFma-Unet: A Mamba-Based Spatial-Frequency Fusion Network fo...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Zhanpeng Liu Yuqiang Zhang Bin Wang Yang Yang Lin Cai Institute of Artificial Intelligence Xiamen University Xiamen China Key Laboratory of Intelligent Sensing System and Security (Ministry of Education) School of Artificial Intelligence Hubei University Wuhan China School of Life Sciences Hubei University Wuhan China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Recently, Mamba-based methods have gained popularity in medical image segmentation due to their ability to model long-range dependencies with linear computational complexity. However, current segmentation methods often face challenges such as low contrast, blurred boundaries, and unclear backgrounds in medical images. Considering that perceived objects and features exhibit greater discriminative power in the frequency domain, we propose a novel mamba-based spatial and frequency domain feature fusion network, SFMa-Unet, to address these challenges. Specifically, we designed the Spatial-Frequency Interaction (SFI) module, which leverages the powerful modeling capabilities of Mamba to fuse spatial and frequency domain features, enhancing feature representation. Additionally, we developed a Mamba-based multi-scale feature channel fusion (MFCF) bridge to capture local and global dependencies across different feature scales, further improving the model’s representational capacity. We conduct comprehensive experiments on the ISIC17 and ISIC18 public datasets. Experimental results demonstrate the effectiveness and robustness of SFMa-Unet. Codes are available at https://***/RainCh-zyq/SFma-Unet.

关键词： Bridges Image segmentation Solid modeling Three-dimensional displays Frequency-domain analysis Semisupervised learning Signal processing Robustness Speech processing Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：