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

New Composite Chaotic Map Applied to an Image Encryption Scheme in Cybersecurity Applications

IEEE Access 2025年 13卷 70676-70690页

作者： Kouadra, Imane Bekkouche, Tewfik Ziet, Lahcene Mehidi, Imane Alshathri, Samah El-Shafai, Walid Ferhat Abbas University LEPCI Laboratory Department of Electronics Setif1900 Algeria University of Bordj Bou Arreridj ETA Laboratory Department of Electromechanics Bordj Bou Arreridj3400 Algeria Ferhat Abbas University Laboratory of Dosing Analysis and Characterization with High-Resolution Department of Physics Setif1900 Algeria Princess Nourah bint Abdulrahman University College of Computer and Information Sciences Department of Information Technology P.O. Box 84428 Riyadh11671 Saudi Arabia Computer Science Department Riyadh11586 Saudi Arabia Menoufia University Faculty of Electronic Engineering Department of Electronics and Electrical Communications Engineering Menouf32952 Egypt

Chaotic systems have long played a crucial role in cryptographic applications due to their inherent unpredictability and sensitivity to initial conditions. Building on this foundation, this paper introduces an Improved Composite Chaotic Map (ICCM), inspired by classical quadratic and cubic chaotic maps. The proposed ICCM is rigorously validated through Lyapunov exponents and bifurcation diagrams, demonstrating its enhanced dynamical complexity and suitability for secure applications. Designed to expand the chaotic range, ICCM incorporates an additional parameter that significantly enlarges the keyspace, thereby improving the robustness and adaptability of encryption methods. To demonstrate its practical utility, ICCM is integrated into a novel opto-digital encryption scheme aimed at enhancing sensitivity and ensuring superior encryption performance. The effectiveness of this scheme is evaluated using a comprehensive suite of tests, including sensitivity analysis, histogram analysis, the NIST statistical test suite ( 1515 passed), and key security metrics. A high mean square error (MSE) value ( > 104} ) indicates a significant difference between the original and encrypted images, while correlation coefficients ( Cr ≈ 0.0001 to 0.0028) and a low peak signal-to-noise ratio (PSNR 674 ) ensures resilience against brute-force attacks. Simulation results reveal that the ICCM-based encryption scheme achieves a Lyapunov exponent of 21.42 (compared to 19 in prior works) and withstands data loss up to 50%. These findings position ICCM as a robust defense against statistical, differential, and chosen-plaintext attacks. In conclusion, the proposed ICCM and its integration into the opto-digital encryption scheme advance the security of encryption systems, setting a new benchmark for chaos-based cryptography. The results underscore the model’s potential to address modern data security challenges and inspire further research in this critical field. © 2013 IEEE.

关键词： Sensitivity analysis

来源：评论

学校读者我要写书评

暂无评论

Virtualizing Next-Generation Programmable Networks: Techniques, Use Cases, and Promising Future Directions

引用

IEEE Network 2025年第3期39卷 148-155页

作者： Chen, Xiang Du, Hongyang Liu, Wenjing Liu, Hongyan Zhang, Jianshan Yang, Xu Zhang, Dong Wu, Chunming Liu, Xuan Niyato, Dusit Zhejiang University College of Computer Science and Technology Hangzhou310027 China The University of Hong Kong Department of Electrical and Electronic Engineering Pokfulam Hong Kong Zhejiang Media Group Hangzhou310005 China Minjiang University Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Data Science Fuzhou350108 China Fuzhou University College of Computer and Data Science Fuzhou350108 China Yangzhou University College of Information Engineering College of Artificial Intelligence Yangzhou225009 China Nanyang Technological University College of Computing and Data Science Jurong West 639798 Singapore

For decades, network virtualization plays a crucial role in modern networks, e.g., 6G mobile networks: tenants construct arbitrary virtual networks on the same physical network. However, production networks are becoming programmable and need more ways of network configurations. So prior techniques like SDN hypervisors are deprecated since they cannot configure programmable networks. In response, a new category of network virtualization techniques has emerged recently to virtualize programmable networks, i.e., programmable network hypervisors (PNHs). This article first reviews this trend to comprehensively survey PNHs. To understand their benefits, we build a testbed with hardware switches and sophisticated topologies. Our testbed experiments stress-test hypervisors and demonstrate that they outperform prior works with higher acceptance ratios of virtual networks under large-scale scenarios and heavy loads. Finally, we highlight the open issues of these techniques to shed light on the future directions in this promising topic. © 1986-2012 IEEE.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

Location Privacy Preservation Crowdsensing With Federated Reinforcement Learning

引用

IEEE Transactions on Dependable and Secure computing 2025年第3期22卷 1877-1894页

作者： You, Zhichao Dong, Xuewen Liu, Ximeng Gao, Sheng Wang, Yongzhi Shen, Yulong Xidian University School of Computer Science and Technology The Engineering Research Center of Blockchain Technology Application and Evaluation Ministry of Education Xi'an710071 China Shaanxi Key Laboratory of Blockchain and Secure Computing Xi'an710071 China Fuzhou University College of Computer and Data Science Fuzhou350025 China Central University of Finance and Economics School of Information Beijing102206 China California State Polytechnic University Pomona Department of Computer Information Systems PomonaCA91768 United States Xidian University School of Computer Science and Technology Xi'an710071 China Shaanxi Key Laboratory of Network and System Security Xi'an710071 China

Crowdsensing has become a popular method of sensing data collection while facing the problem of protecting participants' location privacy. Existing location-privacy crowdsensing mechanisms focus on static tasks and participants without considering sensing tasks' time requirements and participants' mobility, which cannot achieve satisfactory collected data quality and task completion in crowdsensing with dynamic tasks and participants. Inspired by this, we proposed a location-preservation crowdsensing mechanism, FedSense, considering dynamic tasks and participants based on federated learning (FL) and reinforcement learning (RL). In FedSense, through RL's outstanding decision-making ability, participants select sensing tasks to perform by well-trained RL models without uploading location information to servers for task allocation. We propose an independent tasks selection environment that defines actions, states, and rewards of RL to enable FedSense to achieve satisfactory task completion and data quality while preserving location privacy. Besides, FedSense applies an asynchronous FL aggregation algorithm that reduces participants' network stabilization and device computing ability requirements. Analysis proves that participants' location information does not leave the local device during the model training and task selection process, effectively avoiding privacy leakage. Simulation shows that compared with existing location-preservation crowdsensing mechanisms, FedSense achieves the highest task completion and sensing accuracy for dynamic tasks and participants. © 2024 IEEE.

关键词： Data privacy

来源：评论

学校读者我要写书评

暂无评论

APP: Enabling Soft Real-Time Execution on Densely-Populated Hybrid Memory System 23

APP: Enabling Soft Real-Time Execution on Densely-Populated ...

引用

Proceedings of the 60th Annual ACM/IEEE Design Automation Conference

作者： Zheng-Wei Wu Yun-Chih Chen Yuan-Hao Chang Tei-Wei Kuo Department of Computer Science and Information Engineering National Taiwan University Institute of Information Science Academia Sinica Taiwan Department of Computer Science and Information Engineering National Taiwan University and Mohamed bin Zayed University of Artificial Intelligence Department of Computer Science and NTU High Performance and Scientific Computing Center National Taiwan University

ISBN: (纸本)9798350323481

Memory swapping was considered slow and evil, but swapping to Ultra Low-Latency storage like Optane has become a promising solution to save power and cost, helping densely-populated edge server to overcome its DRAM capacity bottleneck. However, the lack of integration between CPU scheduling and memory paging causes soft real-time tasks running on edge servers to miss deadlines under heavy memory multiplexing. We propose APP (Adaptive Page Pinning), lightweight protection of working set memory to ensure meeting soft real-time task deadlines without starving other non-real-time tasks. Experiments show that APP alleviates thrashing in memory-intensive tasks and upholds soft real-time task deadlines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Questionable Fairness in Federated Learning 8

Questionable Fairness in Federated Learning

引用

8th International Conference on Data science and Machine Learning Applications, CDMA 2025

作者： Alharbi, Raed Nguyen, Truc Yousefzadeh, Nooshin Aljohani, Ahmed National Renewable Energy Laboratory Computatioual Science Center GoldenCO United States University of Florida Computer and Information Science and Engineering Department GainesvilleFL United States College of Computing and Informatics Saudi Electronic University Riyadh Saudi Arabia University of North Texas Computer Science and Engineering Denton United States

ISBN: (纸本)9798331539696

Federated learning (FL) has emerged as a powerful framework for training deep learning models across numerous distributed clients, where a central server distributes and aggregates model updates without accessing clients' raw data, ensuring privacy. However, this decentralized approach introduces significant challenges regarding fairness. Existing research shows that non-i.i.d. data distributions among clients can lead to biased global models, particularly affecting decisions based on sensitive attributes. This paper aims to investigate these fairness issues rigorously by analyzing how disparities in client data distribution impact model fairness. We conduct experiments using various models and datasets to evaluate and mitigate biases. We also propose novel data partitioning strategies to reflect real-world client data distributions accurately. Our finding shows that FL is highly vulnerable to the fairness problem due to the Non-IID property. The experiment's code can be found here: https://***/raed19/Questionable-Fairness-in-Federated-Learning. © 2025 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Network intrusion detection based on feature fusion of attack dimension

引用

Journal of Supercomputing 2025年第6期81卷 1-33页

作者： Sun, Xiaolong Gu, Zhengyao Zhang, Hao Gu, Jason Liu, Yanhua Dong, Chen Ye, Junwei College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China Engineering Research Center of Big Data Intelligence Chinese Ministry of Education Fuzhou350116 China Department of Electrical and Computer Engineering Dalhousie University HalifaxNSB3J 1Z1 Canada

Network traffic anomaly detection involves the rapid identification of intrusions within a network through the detection, analysis, and classification of network traffic data. The variety of cyberattacks encompasses diverse attack principles. Employing an indiscriminate feature selection strategy may lead to the neglect of key features highly correlated with specific attack types. This oversight could diminish the recognition rate for that category, thereby impacting the overall performance of the detection model. To address this issue, this paper proposes a network traffic anomaly detection model based on the fusion of attack-dimensional features. Firstly, construct binary classification datasets independently for each attack class and perform individual feature selection to extract positively correlated features for each class. The features are then fused by employing a combination methods. Subsequently, based on the fused sub-datasets, base classifiers are trained. Finally, an ensemble learning approach is introduced to integrate the predictions of individual classifiers, enhancing the robustness of the model. The proposed approach, validated on NSL-KDD and UNSW-NB15 benchmark datasets, outperforms the latest methods in the field by achieving a 2% and 7% increase in precision on weighted averages. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

CLIMS++: Cross Language Image Matching with Automatic Context Discovery for Weakly Supervised Semantic Segmentation

引用

International Journal of computer Vision 2025年 1-20页

作者： Xie, Jinheng Deng, Songhe Hou, Xianxu Luo, Zhaochuan Shen, Linlin Huang, Yawen Zheng, Yefeng Shou, Mike Zheng Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Computer Science Wenzhou-Kean University Wenzhou325060 China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China Show Lab National University of Singapore Singapore639798 Singapore School of AI and Advanced Computing Xi’an Jiaotong-Liverpool University Suzhou215400 China Jarvis Research Center Tencent YouTu Lab Shenzhen518703 China

While promising results have been achieved in weakly-supervised semantic segmentation (WSSS), limited supervision from image-level tags inevitably induces discriminative reliance and spurious relations between target classes and background regions. Thus, Class Activation Map (CAM) usually tends to activate discriminative object regions and falsely includes lots of class-related backgrounds. Without pixel-level supervisions, it could be very difficult to enlarge the foreground activation and suppress those false activation of background regions. In this paper, we propose a novel framework of Cross Language Image Matching with Automatic Context Discovery (CLIMS++), based on the recently introduced Contrastive Language-Image Pre-training (CLIP) model, for WSSS. The core idea of our framework is to introduce natural language supervision to activate more complete object regions and suppress class-related background regions in CAM. In particular, we design object, background region, and text label matching losses to guide the model to excite more reasonable object regions of each category. In addition, we propose to automatically find spurious relations between foreground categories and backgrounds, through which a background suppression loss is designed to suppress the activation of class-related backgrounds. The above designs enable the proposed CLIMS++ to generate a more complete and compact activation map for the target objects. Extensive experiments on PASCAL VOC 2012 and MS COCO 2014 datasets show that our CLIMS++ significantly outperforms the previous state-of-the-art methods. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Federated Meta Continual Learning for Efficient and Autonomous Edge Inference 24th

Federated Meta Continual Learning for Efficient and Autono...

引用

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

作者： Li, Bingze Ho, Stella Qu, Youyang Xu, Chenhao Luan, Tom H. Gao, Longxiang Jinan China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China Department of Biomedical Engineering The University of Melbourne VIC Melbourne Australia School of Information Technology Deakin University VIC Geelong Australia School of Cyber Engineering Xidian University Xi’an China

ISBN: (纸本)9789819615476

With an increasing volume of data being collected and processed on edge, Federated Learning (FL) has become a dominant approach to train shared global models on distributed data held by diverse edge clients without exposing privacy. However, with expectations of high-quality user experience, instantaneous intelligent decisions must be made at the network edge to meet performance, security, and latency requirements. Intuitively, this challenge becomes more daunting as edge devices are constrained by limited computing and storage resources. Furthermore, edge clients need to continuously acquire, update, accumulate, and apply knowledge in domains requiring the processing of sensitive data and long-term model training. It has been proven that edge clients often forget previous tasks knowledge after learning new tasks, resulting in catastrophic forgetting. To mitigate this, we propose a Federated Meta Continual Learning (FMCL) approach. It requires edge clients not only to learn new tasks quickly but also to memorize rapidly. Specifically, we adopted a MAML (Model-Agnostic Meta-Learning) framework with memory replay, setting up buffers at edge clients to consolidate old tasks. In such a way, the model learns optimal initialization to quickly adapt to all seen tasks while preventing catastrophic forgetting. Extensive evaluation results indicate that FMCL performs well in alleviating catastrophic forgetting and achieves a good balance between learning new tasks and remembering existing tasks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Unknown-Aware Bilateral Dependency Optimization for Defending Against Model Inversion Attacks

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年 PP卷 PP页

作者： Peng, Xiong Liu, Feng Wang, Nannan Lan, Long Liu, Tongliang Cheung, Yiu-Ming Han, Bo Hong Kong Baptist University Department of Computer Science Hong Kong The University of Melbourne School of Computing and Information Systems Australia Xidian University State Key Laboratory of Integrated Services Networks School of Telecommunications Engineering Shaanxi Xi'an710071 China National University of Defense Technology State Key Laboratory of High Performance Computing School of Computer Hunan Changsha410000 China The University of Sydney Sydney AI Centre School of Computer Science Faculty of Engineering Australia

By abusing access to a well-trained classifier, model inversion (MI) attacks pose a significant threat as they can recover the original training data, leading to privacy leakage. Previous studies mitigated MI attacks by imposing regularization to reduce the dependency between input features and outputs during classifier training, a strategy known as unilateral dependency optimization. However, this strategy contradicts the objective of minimizing the supervised classification loss, which inherently seeks to maximize the dependency between input features and outputs. Consequently, there is a trade-off between improving the model's robustness against MI attacks and maintaining its classification performance. To address this issue, we propose the bilateral dependency optimization strategy (BiDO), a dual-objective approach that minimizes the dependency between input features and latent representations, while simultaneously maximizing the dependency between latent representations and labels. BiDO is remarkable for its privacy-preserving capabilities. However, models trained with BiDO exhibit diminished capabilities in out-of-distribution (OOD) detection compared to models trained with standard classification supervision. Given the open-world nature of deep learning systems, this limitation could lead to significant security risks, as encountering OOD inputs—whose label spaces do not overlap with the in-distribution (ID) data used during training-is inevitable. To address this, we leverage readily available auxiliary OOD data to enhance the OOD detection performance of models trained with BiDO. This leads to the introduction of an upgraded framework, unknown-aware BiDO (BiDO+), which mitigates both privacy and security concerns. As a highlight, with comparable model utility, BiDO-HSIC+ reduces the FPR95 by 55.02% and enhances the AUCROC by 9.52% compared to BiDO-HSIC, while also providing superior MI robustness. © 1979-2012 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

A Vertical Federated Multiview Fuzzy Clustering Method for Incomplete Data

引用

IEEE Transactions on Fuzzy Systems 2025年第5期33卷 1510-1524页

作者： Li, Yan Hu, Xingchen Yu, Shengju Ding, Weiping Pedrycz, Witold Kiat, Yeo Chai Liu, Zhong National University of Defense Technology Laboratory for Big Data and Decision Changsha410073 China National University of Defense Technology School of Computer Changsha410073 China Nantong University School of Artificial Intelligence and Computer Science Nantong226019 China Gliwice44-100 Poland University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 2R3 Canada Istinye University Research Center of Performance and Productivity Analysis Istanbul34010 Turkey Nanyang Technological University College of Computing and Data Science 639798 Singapore

Multiview fuzzy clustering (MVFC) has gained widespread adoption owing to its inherent flexibility in handling ambiguous data. The proliferation of privatization devices has driven the emergence of new challenge in MVFC research works. Federated learning, a technique that can jointly train without directly using raw data, has gain significant attention in decentralized MVFC. However, their applicability depends on the assumptions of data integrity and independence between different views. In fact, while within distributed environments, data typically exhibits two challenging problems: 1) multiple views within a single client;2) incomplete data. Existing methods exhibit limitations in effectively addressing these challenges. Hence, in this study, we aim at achieving the effective clustering for incomplete data by a novel vertical federated MVFC framework. Specifically, a unified clustering framework is designed to capture both local client learning and global server training. For the local client learning, the data reconstruction strategy and prototype alignment strategy are introduced to ensure the preservation of data structure and refinement of clustering relationships, which mitigates the impact of incomplete data. Meanwhile, the global training process implements aggregation based on client-specific information. The whole process is realized based on the unified fuzzy clustering framework, promoting collaborative learning between client-specific and server information. Theoretical analyses and extensive experiments are carefully conducted to validate the effectiveness and efficiency of the proposed method from multiple perspectives. © 1993-2012 IEEE.

关键词： Data integrity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：