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

DM-FedMF: A Recommendation Model of Federated Matrix Factorization with Detection Mechanism

IEEE Transactions on network Science and Engineering 2025年

作者： Zheng, Xiaoyao Jia, Xianmin Cheng, Xiongchao He, Wenxuan Sun, Liping Guo, Liangmin Yu, Qingying Luo, Yonglong Anhui Normal University Anhui Provincial Key Laboratory of Network and Information Security School of Computer and Information Wuhu China

Items are recommended to users by the federated recommendation system while protecting user privacy, but there is a risk of the performance of the global model being seriously affected by malicious clients through the tampering of local data and model parameters. In this paper, a federated matrix factorization recommendation model with a detection mechanism(DM-FedMF) is proposed. The experimental analysis concludes that there is a gradient difference in item preference parameters between malicious and benign clients. Accordingly, an objective function is designed to measure item preference differences as a means of identifying malicious clients on the server. Secondly, a malicious client reporting mechanism is proposed to count the reported frequency of all clients and set a threshold. Based on the number of honest clients, the list of attackers is updated. Finally, the malicious client is detected and eliminated based on the list of attackers. The other three defense algorithms are compared with two public datasets in this paper. The experimental results show that the detection mechanism can effectively defend against data poisoning attacks, category attacks, noise attacks, and sign flipping attacks, and the performance of the model's recommendations is better than that achieved by applying other defense methods. © 2025 IEEE. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

A numerical magnitude aware multi-channel hierarchical encoding network for math word problem solving

引用

Neural Computing and Applications 2025年第3期37卷 1651-1672页

作者： Xu, Junjie Chen, Yuzhong Xiao, Lingsheng Liao, Hongmiao Zhong, Jiayuan Dong, Chen College of Computer and Data Science Fuzhou University Fujian Province Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fujian Province Fuzhou350108 China

Math word problem (MWP) represents a critical research area within reading comprehension, where accurate comprehension of math problem text is crucial for generating math expressions. However, current approaches still grapple with unresolved challenges in grasping the sensitivity of math problem text and delineating distinct roles across various clause types, and enhancing numerical representation. To address these challenges, this paper proposes a Numerical Magnitude Aware Multi-Channel Hierarchical Encoding network (NMA-MHEA) for math expression generation. Firstly, NMA-MHEA implements a multi-channel hierarchical context encoding module to learn context representations at three different channels: intra-clause channel, inter-clause channel, and context-question interaction channel. NMA-MHEA constructs hierarchical constituent-dependency graphs for different levels of sentences and employs a Hierarchical Graph Attention Neural network (HGAT) to learn syntactic and semantic information within these graphs at the intra-clause and inter-clause channels. NMA-MHEA then refines context clauses using question information at the context-question interaction channel. Secondly, NMA-MHEA designs a number encoding module to enhance the relative magnitude information among numerical values and type information of numerical values. Experimental results on two public benchmark datasets demonstrate that NMA-MHEA outperforms other state-of-the-art models. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Density Peak Clustering Algorithm Based on Data Field Theory and Grid Similarity

引用

Journal of computer Science and Technology 2025年第2期40卷 301-321页

作者： Yu, Qing-Ying Shi, Ge-Ge Xu, Dong-Sheng Wang, Wen-Kai Chen, Chuan-Ming Luo, Yong-Long School of Computer and Information Anhui Normal University Wuhu China Anhui Provincial Key Laboratory of Network and Information Security Wuhu China

The density peak clustering algorithm can rapidly identify cluster centers by drawing decision graphs without any prior knowledge; however, when multiple density peaks are present in one cluster of the dataset, the cluster centers cannot be accurately obtained, leading to incorrect clustering. Moreover, the single-step allocation strategy is poorly fault-tolerant and can lead to successive allocation errors. To address these problems, this study proposes a density peak clustering method based on data field theory and grid similarity, which divides the original data into grid spaces to obtain subspace codes and grid data. Subsequently, the potential grid density is introduced to measure the density of each grid based on the data field, and the density peaks are identified to obtain the cluster centers from the high-density grids. Finally, self-organized clustering is realized based on neighborhood extension centers and grid similarity. It thus reduces the possibility of successive assignment errors and the negative impact of multiple density peaks on the clustering results. In addition, the algorithm automatically determines the cluster centers and can correctly assign the non-density-peak grid to the corresponding clusters. Experimental results with synthetic and real-world datasets demonstrate that the proposed algorithm outperforms similar algorithms in terms of accuracy and efficiency when dealing with complex datasets with large density differences and cross-tangling.

关键词： clustering data field grid similarity grid space neighborhood extension center

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Covert Channels in VoLTE via Inter-Frame Delay Modulation 1

引用

2nd International Conference on Artificial Intelligence Security and Privacy, AIS and P 2024

作者： Wu, Xiaokai sun, Xuan Huang, Jiaxin Shi, Ning Liang, Chen Computer School Beijing Information Science and Technology University Beijing100192 China China Southern Airlines Co. Ltd. Guangdong Guangzhou510000 China Hebei Key Laboratory of IoT Blockchain Integration Shijiazhuang China

ISBN: (数字)9789819611485

ISBN: (纸本)9789819611478

The rapid advancement of artificial intelligence and mobile communication technologies has brought unprecedented convenience, but also significant privacy and security concerns, particularly in real-time video communications, such as deepfake. Several researchers have investigated multiple security measures, with Covert Timing Channels (CTCs) emerging as a promising technique for secure information transmission, yet most of them suffer from low transmission efficiency, limiting their real-time responsiveness and network adaptability, making them inadequate for high-capacity covert information transmission. To address this limitation, this paper proposes a novel CTC scheme that modulates the Inter-Frame Delay (IFD) between audio and video frames during VoLTE(Voice over LTE) video calls to transmit covert information. Furthermore, to maintain the undetectability of the channel, a fitting algorithm is used to ensure that the cumulative distribution function (CDF) of the IFD of covert traffic aligns with that of legitimate traffic. The design also incorporates an embedding factor that allows communicating parties to dynamically adjust network parameters, balancing robustness, transmission efficiency, and undetectability. Experimental results demonstrate that, compared to existing methods, the proposed IFDCTC scheme achieves higher transmission efficiency, with a peak transmission rate of up to 30 bps, while maintaining acceptable bit error rates and strong undetectability. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Distribution functions

来源：评论

学校读者我要写书评

暂无评论

MAGRET: Machine-generated Text Detection with Rewritten Texts 31

MAGRET: Machine-generated Text Detection with Rewritten Text...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Huang, Yifei Cao, Jingxin Luo, Hanyu Guan, Xin Liu, Bo School of Cyber Science and Engineering Southeast University Nanjing211189 China Key Laboratory of Computer Network and Information of Ministry of Education of China Nanjing211189 China School of Computer Science and Engineering Southeast University Nanjing211189 China

ISBN: (纸本)9798891761964

With the quick advancement in text generation ability of Large Language Model(LLM), concerns about the misuse of machine-generated text(MGT) have grown, raising potential violations of legal and ethical standards. Some existing studies concentrate on detecting machine-generated text in open-source models using in-model features, but their performance on closed-source large models is limited. This limitation occurs because, in the closed-source model detection, the only reference that can be obtained is the texts, which may differ significantly due to random sampling. In this paper, we demonstrate that texts generated by the same model can align both semantically and statistically under similar prompts, facilitating effective detection and traceability. Specifically, we fine-tune a BERT encoder through contrastive learning to achieve semantic alignment in randomly generated texts from the same model. Then, we propose a method called Machine-Generated Text Detection with Rewritten Texts, which designed several prompt refactoring methods and used them to request rewritten text from LLMs. Semantic and statistical relationships between rewritten and original texts provide a basis for detection and traceability. Finally, we expanded the text dataset with multi-parameter random sampling and verified the performance of MAGRET on three text-generated datasets. Experimental results show that previous methods struggle with closed-source model detection, while our approach significantly outperforms baseline methods in this regard. It also shows MAGRET's stable performance in detection and tracing tasks across various randomly sampled texts. © 2025 Association for Computational Linguistics.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Comprehensive Perturbation Consistency for Semi-Supervised Change Detection in Remote Sensing Images

Comprehensive Perturbation Consistency for Semi-Supervised C...

引用

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

作者： Zan Mao Xin Li Ze Luo Yingjuan Tang Dongmei Jiang Computer Network Information Center Chinese Academy of Sciences University of the Chinese Academy of Sciences PengCheng Laboratory National Key Laboratory of Advanced Vehicle Integration and Control Beijing Institute of Technology

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Currently, many change detection (CD) methods rely on supervised learning, which necessitates extensive manually annotated data, resulting in significant labor and time requirements. Recently, semi-supervised (SS) approaches have emerged in the CD community, which exploit large amounts of unlabeled data by utilizing consistency regularization. However, these methods do not consider the broader perturbation consistency to confer better generalization of the model. In this paper, we propose a novel SS CD framework with a comprehensive perturbation consistency called CPC, which extends perturbation consistency to the entire learning period. Specifically, our CPC combines the input, feature, and network perturbations for comprehensive perturb space. And, we design two distinct structures in practice, decoupled CPC and coupled CPC. Furthermore, we propose a change-aware input perturbation that introduces expensive annotation information to further expand the input perturb space. Extensive experiments conducted on the WHUCD, and GZ-CD datasets demonstrate that the proposal performs favorably against the state-of-the-art methods.

关键词： Codes Annotations Perturbation methods Supervised learning Signal processing Acoustics Proposals Labeling Speech processing Remote sensing

来源：评论

学校读者我要写书评

暂无评论

Efficient and fine-grained access control with fully-hidden policies for cloud-enabled IoT

引用

Digital Communications and networks 2025年第2期11卷 473-481页

作者： Li, Qi Liu, Gaozhan Zhang, Qianqian Han, Lidong Chen, Wei Li, Rui Xiong, Jinbo School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Key Laboratory of Cryptography of Zhejiang Province Hangzhou Normal University Hangzhou311121 China Tongda College of Nanjing University of Posts and Telecommunications Yangzhou225127 China Henan Key Laboratory of Network Cryptography Technology Zhengzhou450001 China School of Computer Science and Technology Xidian University Xi'an710071 China State Key Laboratory of Tibetan Intelligent Information Processing and Application Qinghai Normal University Xining810008 China Faculty of Software Fujian Normal University Fuzhou350108 China

Ciphertext-Policy Attribute-Based Encryption (CP-ABE) enables fine-grained access control on ciphertexts, making it a promising approach for managing data stored in the cloud-enabled Internet of Things. But existing schemes often suffer from privacy breaches due to explicit attachment of access policies or partial hiding of critical attribute content. Additionally, resource-constrained IoT devices, especially those adopting wireless communication, frequently encounter affordability issues regarding decryption costs. In this paper, we propose an efficient and fine-grained access control scheme with fully hidden policies (named FHAC). FHAC conceals all attributes in the policy and utilizes bloom filters to efficiently locate them. A test phase before decryption is applied to assist authorized users in finding matches between their attributes and the access policy. Dictionary attacks are thwarted by providing unauthorized users with invalid values. The heavy computational overhead of both the test phase and most of the decryption phase is outsourced to two cloud servers. Additionally, users can verify the correctness of multiple outsourced decryption results simultaneously. Security analysis and performance comparisons demonstrate FHAC's effectiveness in protecting policy privacy and achieving efficient decryption. © 2024 Chongqing University of Posts and Telecommunications

关键词： Ciphertext

来源：评论

学校读者我要写书评

暂无评论

Brillouin Frequency Shift Extraction for BOTDA Based on Gramian Angular Fields 4

Brillouin Frequency Shift Extraction for BOTDA Based on Gram...

引用

4th International Computational Imaging Conference, CITA 2024

作者： Zhu, Borong Zhang, Zhihao Qian, Yuhao Ma, Xiaole Wang, Liang Yu, Kuanglu Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing100044 China Institute of Information Science School of Computer and Information Technology Beijing Jiaotong University Beijing100044 China National Engineering Laboratory for Next Generation Internet Access System School of Optics and Electronic Information Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9781510688834

To accurately extract Brillouin frequency shift of BOTDA with large sweeping step sizes, a novel structure of GAFCNN is proposed, combining time series coding with convolutional neural networks. The experimental data validation results demonstrate that the GAFCNN is capable of obtaining more accurate results under large sweep steps and low signal-to-noise ratios (SNRs) than other current methods. © 2025 SPIE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

A circuit area optimization of MK-3 S-box

引用

Cybersecurity 2025年第1期8卷 61-71页

作者： Yanjun Li Weiguo Zhang Yiping Lin Jian Zou Jian Liu Information Industry Information Security Evaluation Center The 15th Research Institute of China Electronic Technology Group CorporationBeijing 100083China Henan Key Laboratory of Network Cryptography Technology Zhengzhou 450001China Beijing Electronic Science and Technology Institute No.7 Fufeng RoadFengtai DistricBeijing 100083China College of Computer and Data Science Fuzhou UniversityFuzhou 350108China

In MILCOM 2015,Kelly et *** the authentication encryption algorithm MK-3,which applied the 16-bit *** paper aims to implement the 16-bit S-box with less circuit ***,we classifed the irreducible polynomials over F_(2n)into three *** we compared the logic gates required for multiplication over the fnite feld constructed by the three types of irreducible *** to the comparison result,we constructed the composite felds, F_((2^(4))^(2))and F_((2^(8))^(2)).Based on the isomorphism of fnite felds,the operations over F_(2)^(16)can be conducted over F_((2^(8))^(2)).Similarly,elements over F28 can be mapped to the corresponding elements over F_((2^(4)))^(2).Next,the SAT solver was used to optimize the operations over smaller feld F_(2)^(4).At last,the architecture of the optimized MK-3 S-box was worked *** with the implementation proposed by the original designer,the circuit area of the MK-3 S-box in this paper is reduced by at least 55.9%.

关键词： irreducible operations optimization

来源：评论

学校读者我要写书评

暂无评论

A Reversible Data Hiding in Encryption Domain for JPEG Image Based on Controllable Ciphertext Range of Paillier Homomorphic Encryption Algorithm 21st

A Reversible Data Hiding in Encryption Domain for JPEG Ima...

引用

21st Pacific Rim International Conference on Artificial Intelligence, PRICAI 2024

作者： Ma, Bin Zhao, Chunxin Ma, Ruihe Xian, Yongjin Wang, Chunpeng Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China School of Economics Jilin University Changchun130015 China

ISBN: (纸本)9789819601219

With the rapid advancement of cloud computing, significant security concerns regarding data storage have been continuously raised. When the encrypted images are stored in the cloud, reversible data hiding in encrypted domain is used to embed additional data to manage the storage resources in the cloud. Most of the current works are applied to uncompressed images rather than JPEG images. Therefore, this paper proposes a reversible data hiding algorithm for JPEG images based on an enhanced Paillier homomorphic encryption algorithm. In the proposed scheme, the AC coefficients are altered by using a ciphertext distribution constrained paillier homomorphic encryption algorithm, so as to reduce the size of the data-embedded encrypted image. Whereas, the DC coefficients are encrypted by using the one-dimensional tangent chaos encryption algorithm, thereby ensuring high security of the encrypted image. Moreover, according to the characteristics of the homomorphic encryption algorithm, the confidential data can be recovered from both the encryption domain and from the plain domain. Experimental results demonstrate that the ciphertext distribution-constrained Paillier homomorphic encryption algorithm obtains higher data embedding capacity and superior security in comparison with other advanced algorithms. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：