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

A recover-then-discriminate framework for robust anomaly detection

science China(Information sciences) 2025年第4期68卷 300-318页

作者： Peng XING Dong ZHANG Jinhui TANG Zechao LI School of Computer Science and Engineering Nanjing University of Science and Technology Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology

Anomaly detection(AD) has been extensively studied and applied across various scenarios in recent years. However, gaps remain between the current performance and the desired recognition accuracy required for practical *** paper analyzes two fundamental failure cases in the baseline AD model and identifies key reasons that limit the recognition accuracy of existing approaches. Specifically, by Case-1, we found that the main reason detrimental to current AD methods is that the inputs to the recovery model contain a large number of detailed features to be recovered, which leads to the normal/abnormal area has not/has been recovered into its original state. By Case-2, we surprisingly found that the abnormal area that cannot be recognized in image-level representations can be easily recognized in the feature-level representation. Based on the above observations, we propose a novel recover-then-discriminate(ReDi) framework for *** takes a self-generated feature map(e.g., histogram of oriented gradients) and a selected prompted image as explicit input information to address the identified in Case-1. Additionally, a feature-level discriminative network is introduced to amplify abnormal differences between the recovered and input representations. Extensive experiments on two widely used yet challenging AD datasets demonstrate that ReDi achieves state-of-the-art recognition accuracy.

关键词： recovery network HOG prompt discriminative network self-correlation loss anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Double Averaging and Gradient Projection: Convergence Guarantees for Decentralized Constrained Optimization

引用

IEEE Transactions on Automatic Control 2025年第5期70卷 3433-3440页

作者： Shahriari-Mehr, Firooz Panahi, Ashkan Chalmers University of Technology University of Gothenburg Department of Computer Science and Engineering SE-412 96 Gothenburg Sweden

We consider a generic decentralized constrained optimization problem over static, directed communication networks, where each agent has exclusive access to only one convex, differentiable, local objective term and one convex constraint set. For this setup, we propose a novel decentralized algorithm, called double averaging and gradient projection (DAGP). We achieve global optimality through a novel distributed tracking technique we call distributed null projection. Further, we show that DAGP can be used to solve unconstrained problems with nondifferentiable objective terms with a problem reduction scheme. Assuming only smoothness of the objective terms, we study the convergence of DAGP and establish sublinear rates of convergence in terms of feasibility, consensus, and optimality, with no extra assumption (e.g., strong convexity). For the analysis, we forego the difficulties of selecting Lyapunov functions by proposing a new methodology of convergence analysis, which we refer to as aggregate lower-bounding. To demonstrate the generality of this method, we also provide an alternative convergence proof for the standard gradient descent algorithm with smooth functions. © 1963-2012 IEEE.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving filtering, control and optimization for industrial cyber-physical systems

引用

science China(Information sciences) 2025年第4期68卷 267-283页

作者： Derui DING Qing-Long HAN Xiaohua GE Xian-Ming ZHANG Jun WANG Department of Control Science and Engineering University of Shanghai for Science and Technology School of Engineering Swinburne University of Technology Department of Computer Science City University of Hong Kong

Industrial cyber-physical systems closely integrate physical processes with cyberspace, enabling real-time exchange of various information about system dynamics, sensor outputs, and control decisions. The connection between cyberspace and physical processes results in the exposure of industrial production information to unprecedented security risks. It is imperative to develop suitable strategies to ensure cyber security while meeting basic performance *** the perspective of control engineering, this review presents the most up-to-date results for privacy-preserving filtering,control, and optimization in industrial cyber-physical systems. Fashionable privacy-preserving strategies and mainstream evaluation metrics are first presented in a systematic manner for performance evaluation and engineering *** discussion discloses the impact of typical filtering algorithms on filtering performance, specifically for privacy-preserving Kalman filtering. Then, the latest development of industrial control is systematically investigated from consensus control of multi-agent systems, platoon control of autonomous vehicles as well as hierarchical control of power systems. The focus thereafter is on the latest privacy-preserving optimization algorithms in the framework of consensus and their applications in distributed economic dispatch issues and energy management of networked power systems. In the end, several topics for potential future research are highlighted.

关键词： industrial cyber-physical systems privacy preservation distributed control distributed optimization power systems

来源：评论

学校读者我要写书评

暂无评论

Enhanced Acceleration for Generalized Nonconvex Low-Rank Matrix Learning

引用

Chinese Journal of Electronics 2025年第1期34卷 98-113页

作者： Hengmin Zhang Jian Yang Wenli Du Bob Zhang Zhiyuan Zha Bihan Wen School of Electrical and Electronic Engineering Nanyang Technological University School of Computer Science and Engineering Nanjing University of Science and Technology School of Information Science and Engineering East China University of Science and Technology Department of Electrical and Computer Engineering University of Macau

Matrix minimization techniques that employ the nuclear norm have gained recognition for their applicability in tasks like image inpainting, clustering, classification, and reconstruction. However, they come with inherent biases and computational burdens, especially when used to relax the rank function, making them less effective and efficient in real-world scenarios. To address these challenges, our research focuses on generalized nonconvex rank regularization problems in robust matrix completion, low-rank representation, and robust matrix regression. We introduce innovative approaches for effective and efficient low-rank matrix learning, grounded in generalized nonconvex rank relaxations inspired by various substitutes for the ?0-norm relaxed functions. These relaxations allow us to more accurately capture low-rank structures. Our optimization strategy employs a nonconvex and multi-variable alternating direction method of multipliers, backed by rigorous theoretical analysis for complexity and *** algorithm iteratively updates blocks of variables, ensuring efficient convergence. Additionally, we incorporate the randomized singular value decomposition technique and/or other acceleration strategies to enhance the computational efficiency of our approach, particularly for large-scale constrained minimization problems. In conclusion, our experimental results across a variety of image vision-related application tasks unequivocally demonstrate the superiority of our proposed methodologies in terms of both efficacy and efficiency when compared to most other related learning methods.

关键词： Learning systems Image recognition Minimization Computational efficiency Complexity theory Matrix decomposition Optimization Image reconstruction Singular value decomposition Convergence

来源：评论

学校读者我要写书评

暂无评论

On Shaping Gain of Multidimensional Constellation in Linear and Nonlinear Optical Fiber Channel

引用

IEEE Journal on Selected Areas in Communications 2025年第5期43卷 1455-1468页

作者： Chen, Bin Liang, Zhiwei Lei, Yi Deng, JingXin Li, Shen Liga, Gabriele Hefei University of Technology School of Computer Science and Information Engineering Hefei China Chalmers University of Technology Department of Electrical Engineering Gothenburg Sweden Department of Electrical and Computer Engineering Québec Canada Eindhoven University of Technology Department of Electrical Engineering Eindhoven Netherlands

Utilizing the multi-dimensional (MD) space for constellation shaping has been proven to be an effective approach for achieving shaping gains. Despite there exists a variety of MD modulation formats tailored for specific optical transmission scenarios, there remains a notable absence of a dependable comparison method for efficiently and promptly re-evaluating their performance in arbitrary transmission systems. In this paper, we introduce an analytical nonlinear interference (NLI) power model-based shaping gain estimation method to enable a fast performance evaluation of various MD modulation formats in coherent dual-polarization (DP) optical transmission system. In order to extend the applicability of this method to a broader set of modulation formats, we extend the established NLI model to take the 4D joint distribution into account and thus able to analyze the complex interactions of non-iid signaling in DP systems. With the help of the NLI model, we conduct a comprehensive analysis of the state-of-the-art modulation formats and investigate their actual shaping gains in two types of optical fiber communication scenarios (multi-span and single-span). The numerical simulation shows that for arbitrary modulation formats, the NLI power and relative shaping gains in terms of signal-to-noise ratio can be more accurately estimated by capturing the statistics of MD symbols. Furthermore, the proposed method further validates the effectiveness of the reported NLI-tolerant modulation format in the literature, which reveals that the linear shaping gains and modulation-dependent NLI should be jointly considered for nonlinearity mitigation. © 1983-2012 IEEE.

关键词： Optical fibers

来源：评论

学校读者我要写书评

暂无评论

Integration of data science with the intelligent IoT(IIoT): Current challenges and future perspectives

引用

Digital Communications and Networks 2025年第2期11卷 280-298页

作者： Inam Ullah Deepak Adhikari Xin Su Francesco Palmieri Celimuge Wu Chang Choi Department of Computer Engineering Gachon University University of Electronic Science and Technology of China College of Information Science and Engineering Hohai University Department of Computer Science University of Salerno Graduate School of Informatics and Engineering The University of Electro-Communications

The Intelligent Internet of Things(IIoT) involves real-world things that communicate or interact with each other through networking technologies by collecting data from these “things” and using intelligent approaches, such as Artificial Intelligence(AI) and machine learning, to make accurate decisions. Data science is the science of dealing with data and its relationships through intelligent approaches. Most state-of-the-art research focuses independently on either data science or IIoT, rather than exploring their integration. Therefore, to address the gap, this article provides a comprehensive survey on the advances and integration of data science with the Intelligent IoT(IIoT) system by classifying the existing IoT-based data science techniques and presenting a summary of various characteristics. The paper analyzes the data science or big data security and privacy features, including network architecture, data protection, and continuous monitoring of data, which face challenges in various IoT-based systems. Extensive insights into IoT data security, privacy, and challenges are visualized in the context of data science for IoT. In addition, this study reveals the current opportunities to enhance data science and IoT market development. The current gap and challenges faced in the integration of data science and IoT are comprehensively presented, followed by the future outlook and possible solutions.

关键词： Data science Internet of things (IoT) Big data Communication systems Networks Security Data science analytics

来源：评论

学校读者我要写书评

暂无评论

TRE-DSP: A traceable and revocable CP-ABE based data sharing scheme for IoV with partially hidden policy

引用

Digital Communications and Networks 2025年第2期11卷 455-464页

作者： Yousheng Zhou Rundong Peng Yuanni Liu Pandi Vijayakumar Brij Gupta College of Computer Science and Technology Chongqing University of Posts and Telecommunications College of Cyber Security and Information Law Chongqing University of Posts and Telecommunications Department of Computer Science and Engineering University College of Engineering Department of Computer Engineering National Institute of Technology Kurukshetra

With the popularity of the Internet of Vehicles(IoV), a large amount of data is being generated every day. How to securely share data between the IoV operator and various value-added service providers becomes one of the critical issues. Due to its flexible and efficient fine-grained access control feature, Ciphertext-Policy Attribute-Based Encryption(CP-ABE) is suitable for data sharing in IoV. However, there are many flaws in most existing CP-ABE schemes, such as attribute privacy leakage and key misuse. This paper proposes a Traceable and Revocable CP-ABE-based Data Sharing with Partially hidden policy for IoV(TRE-DSP). A partially hidden access structure is adopted to hide sensitive user attribute values, and attribute categories are sent along with the ciphertext to effectively avoid privacy exposure. In addition, key tracking and malicious user revocation are introduced with broadcast encryption to prevent key misuse. Since the main computation task is outsourced to the cloud, the burden of the user side is relatively low. Analysis of security and performance demonstrates that TRE-DSP is more secure and practical for data sharing in IoV.

关键词： Privacy-preserving Attribute-based encryption Partially hidden policy Traceability User revocation Internet of vehicles

来源：评论

学校读者我要写书评

暂无评论

A survey on cross-user federated recommendation

引用

science China(Information sciences) 2025年第4期68卷 7-32页

作者： Enyue YANG Yudi XIONG Wei YUAN Weike PAN Qiang YANG Zhong MING College of Computer Science and Software Engineering Shenzhen University School of Electrical Engineering and Computer Science The University of Queensland WeBank AI Lab WeBank Department of Computer Science and Engineering Hong Kong University of Science and Technology College of Big Data and Internet Shenzhen Technology University Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ)

Recommender systems are effective in mitigating information overload, yet the centralized storage of user data raises significant privacy concerns. Cross-user federated recommendation(CUFR) provides a promising distributed paradigm to address these concerns by enabling privacy-preserving recommendations directly on user devices. In this survey, we review and categorize current progress in CUFR, focusing on four key aspects: privacy, security, accuracy, and efficiency. Firstly,we conduct an in-depth privacy analysis, discuss various cases of privacy leakage, and then review recent methods for privacy protection. Secondly, we analyze security concerns and review recent methods for untargeted and targeted *** untargeted attack methods, we categorize them into data poisoning attack methods and parameter poisoning attack methods. For targeted attack methods, we categorize them into user-based methods and item-based methods. Thirdly,we provide an overview of the federated variants of some representative methods, and then review the recent methods for improving accuracy from two categories: data heterogeneity and high-order information. Fourthly, we review recent methods for improving training efficiency from two categories: client sampling and model compression. Finally, we conclude this survey and explore some potential future research topics in CUFR.

关键词： cross-user federated recommendation federated recommendation federated learning recommender systems user privacy

来源：评论

学校读者我要写书评

暂无评论

Test Case Optimization using Machine Learning based Hybrid Meta-Heuristic Approach

引用

Journal of Electronic Testing: Theory and Applications (JETTA) 2025年 1-20页

作者： Rao, Gajender Nandal, Deepak Research Scholar Department of Computer Science and Engineering Guru Jambheshwar University of Science and Technology Hisar India Department of Computer Science and Engineering Guru Jambheshwar University of Science and Technology Hisar India

Software testing is a critical task that can be used to ensure the quality of the end product. Different types of applications process the input data with respect to a specific operation and its outcomes are generated accordingly. It is essential to test each application as per the supported functionality, and it is also necessary to optimize the test cases for applications to reduce the computational cost. To achieve this goal, there is a need to design different test cases as well as an intelligent solution is required to select and optimize the test cases according to the requirements. Particle swarm optimization (PSO) and Genetic Algorithm (GA) both are capable enough to produce the optimal solutions for software testing. However, there is no provision to perform the classification over their outcomes with respect to test case optimization using machine learning support. This paper presents a hybrid meta-heuristic method that selects the test cases on behalf of their attributes as well as it also performs classification over the test cases under the constraints of the test case’s attributes. For experiments, different classifiers are used (i.e. k-nearest neighbour (KNN), Decision Tree (DT), Logistic Regression (LOG), Support Vector Machine (SVM), Gaussian Naive Bayes (GNB), Stochastic gradient descent (SGD) and Random Forest (RDF) etc.) and analysis shows that GNB and SGD classifiers both have optimal accuracy, precision & recall values. As compared to existing algorithms, i.e. traditional PSO and Genetic algorithm, it outperforms in terms of optimal number of detected errors (1821), error rate (91.05) and coverage rate (90.86363636). The Proposed scheme can be extended to optimize the test cases for other software types, along with real-time interaction and dataset updation support for software testers. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Random forests

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving explainable AI: a survey

引用

science China(Information sciences) 2025年第1期68卷 23-56页

作者： Thanh Tam NGUYEN Thanh Trung HUYNH Zhao REN Thanh Toan NGUYEN Phi Le NGUYEN Hongzhi YIN Quoc Viet Hung NGUYEN School of Information and Communication Technology Griffith University School of Computer and Communication Sciences Ecole Polytechnique Federale de Lausanne Faculty of Mathematics and Computer Science University of Bremen Faculty of Information Technology HUTECH University Department of Computer Science Hanoi University of Science and Technology School of Electrical Engineering and Computer Science The University of Queensland

As the adoption of explainable AI(XAI) continues to expand, the urgency to address its privacy implications intensifies. Despite a growing corpus of research in AI privacy and explainability, there is little attention on privacy-preserving model explanations. This article presents the first thorough survey about privacy attacks on model explanations and their countermeasures. Our contribution to this field comprises a thorough analysis of research papers with a connected taxonomy that facilitates the categorization of privacy attacks and countermeasures based on the targeted explanations. This work also includes an initial investigation into the causes of privacy leaks. Finally, we discuss unresolved issues and prospective research directions uncovered in our analysis. This survey aims to be a valuable resource for the research community and offers clear insights for those new to this domain. To support ongoing research, we have established an online resource repository, which will be continuously updated with new and relevant findings.

关键词： privacy-preserving explainable AI privacy attacks privacy defences PrivEx PPXAI

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：