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

IEEE Transactions on Artificial Intelligence 2024年第6期6卷 1-12页

作者： Yin, Xinpeng Zhang, Cheng Huang, ZiXu He, Zhihai Cao, Wenming State Key Laboratory of Radio Frequency Heterogeneous IntegrationDepartment of Electronics and Information EngineeringShenzhen University Department of Computer Science and EngineeringSouthern University of Science and Technology Department of Electronic and Electrical EngineeringSouthern University of Science and Technology

Previous works on unsupervised skeleton-based action recognition primarily focused on strategies for utilizing features to drive model optimization through methods like contrastive learning and reconstruction. However, designing application-level strategies poses challenges. This paper shifts the focus to the generation-level modelings and introduces the Spatiotemporal Adaptively Attentions-guided Refining Network (AgRNet). AgRNet approaches the reduction of costs and enhancement of efficiency by constructing the Adaptive Activity- Guided Attention (AAGA) and Adaptive Dominant-Guided Attenuation (ADGA) modules. The AAGA leverages the sparsity of the correlation matrix in the attention mechanism to adaptively filter and retain the active components of the sequence during the modeling process. The ADGA embeds the local dominant features of the sequence, obtained through convolutional distillation, into the globally dominant features under the attention mechanism, guided by the defined attenuation factor. Additionally, the Progressive Feature Modeling (PFM) module is introduced to complement the progressive features in motion sequences that were overlooked by AAGA and ADGA. AgRNet shows efficiency on three public datasets, NTU-RGBD 60, NTU-RGBD 120, and UWA3D. IEEE

关键词： Time series analysis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Labeling-based centrality approaches for identifying critical edges on temporal graphs

引用

Frontiers of computer science 2025年第2期19卷 89-104页

作者： Tianming ZHANG Jie ZHAO Cibo YU Lu CHEN Yunjun GAO Bin CAO Jing FAN Ge YU School of Computer Science and Technology Zhejiang University of TechnologyHangzhou 310023China School of Computer Science and Technology Zhejiang UniversityHangzhou 310013China Department of Computer Science Northeastern UniversityShenyang 110819China

Edge closeness and betweenness centralities are widely used path-based metrics for characterizing the importance of edges in *** general graphs,edge closeness centrality indicates the importance of edges by the shortest distances from the edge to all the other *** betweenness centrality ranks which edges are significant based on the fraction of all-pairs shortest paths that pass through the ***,extensive research efforts go into centrality computation over general graphs that omit time ***,numerous real-world networks are modeled as temporal graphs,where the nodes are related to each other at different time *** temporal property is important and should not be neglected because it guides the flow of information in the *** state of affairs motivates the paper’s study of edge centrality computation methods on temporal *** introduce the concepts of the label,and label dominance relation,and then propose multi-thread parallel labeling-based methods on OpenMP to efficiently compute edge closeness and betweenness centralities *** types of optimal temporal *** edge closeness centrality computation,a time segmentation strategy and two observations are presented to aggregate some related temporal edges for uniform *** edge betweenness centrality computation,to improve efficiency,temporal edge dependency formulas,a labeling-based forward-backward scanning strategy,and a compression-based optimization method are further proposed to iteratively accumulate centrality *** experiments using 13 real temporal graphs are conducted to provide detailed insights into the efficiency and effectiveness of the proposed *** with state-ofthe-art methods,labeling-based methods are capable of up to two orders of magnitude speedup.

关键词： temporal graph closeness centrality between-ness centrality temporal path

来源：评论

学校读者我要写书评

暂无评论

Advances in neural architecture search

引用

National science Review 2024年第8期11卷 24-38页

作者： Xin Wang Wenwu Zhu Department of Computer Science and Technology Beijing National Research Center for Information Science and Technology Tsinghua University

Automated machine learning(AutoML) has achieved remarkable success in automating the non-trivial process of designing machine learning *** the focal areas of AutoML,neural architecture search(NAS) stands out,aiming to systematically explore the complex architecture space to discover the optimal neural architecture configurations without intensive manual *** has demonstrated its capability of dramatic performance improvement across a large number of real-world *** core components in NAS methodologies normally include(ⅰ) defining the appropriate search space,(ⅱ)designing the right search strategy and(ⅲ) developing the effective evaluation *** early NAS endeavors are characterized via groundbreaking architecture designs,the imposed exorbitant computational demands prompt a shift towards more efficient paradigms such as weight sharing and evaluation estimation,***,the introduction of specialized benchmarks has paved the way for standardized comparisons of NAS ***,the adaptability of NAS is evidenced by its capability of extending to diverse datasets,including graphs,tabular data and videos,etc.,each of which requires a tailored *** paper delves into the multifaceted aspects of NAS,elaborating on its recent advances,applications,tools,benchmarks and prospective research directions.

关键词： machine learning artificial intelligence neural architecture search

来源：评论

学校读者我要写书评

暂无评论

Federated Learning Security and Privacy-Preserving Algorithm and Experiments Research Under Internet of Things Critical Infrastructure

引用

Tsinghua science and technology 2024年第2期29卷 400-414页

作者： Nasir Ahmad Jalali Hongsong Chen Department of Computer Science University of Science and Technology Beijing(USTB)Beijing 100083China

The widespread use of the Internet of Things(IoTs)and the rapid development of artificial intelligence technologies have enabled applications to cross commercial and industrial band *** such systems,all participants related to commercial and industrial systems must communicate and generate ***,due to the small storage capacities of IoT devices,they are required to store and transfer the generated data to third-party entity called“cloud”,which creates one single point to store their ***,as the number of participants increases,the size of generated data also ***,such a centralized mechanism for data collection and exchange between participants is likely to face numerous challenges in terms of security,privacy,and *** address these challenges,Federated Learning(FL)has been proposed as a reasonable decentralizing approach,in which clients no longer need to transfer and store real data in the central ***,they only share updated training models that are trained over their private *** the same time,FL enables clients in distributed systems to share their machine learning models collaboratively without their training data,thus reducing data privacy and security ***,slow model training and the execution of additional unnecessary communication rounds may hinder FL applications from operating properly in a distributed ***,these unnecessary communication rounds make the system vulnerable to security and privacy issues,because irrelevant model updates are sent between clients and ***,in this work,we propose an algorithm for fully homomorphic encryption called Cheon-Kim-Kim-Song(CKKS)to encrypt model parameters for their local information privacy-preserving *** proposed solution uses the impetus term to speed up model convergence during the model training ***,it establishes a secure communication channel between IoT devices and the *** a

关键词： Federated Learning(FL) Internet of Things(IoTs) lightweight Transport Layer Security(iTLS) Cheon-Kim-Kim-Song(CKKS)

来源：评论

学校读者我要写书评

暂无评论

Learn to optimize——a brief overview

引用

National science Review 2024年第8期11卷 39-47页

作者： Ke Tang Xin Yao Department of Computer Science and Engineering Southern University of Science and Technology Department of Computing and Decision Sciences Lingnan University

Most optimization problems of practical significance are typically solved by highly configurable parameterized *** achieve the best performance on a problem instance,a trial-and-error configuration process is required,which is very costly and even prohibitive for problems that are already computationally intensive,*** problems associated with machine learning *** the past decades,many studies have been conducted to accelerate the tedious configuration process by learning from a set of training *** article refers to these studies as learn to optimize and reviews the progress achieved.

关键词： optimization data-driven algorithm design automated algorithm configuration machine learning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

NeurDB: an AI-powered autonomous data system

引用

science China(Information sciences) 2024年第10期67卷 129-150页

作者： Beng Chin OOI Shaofeng CAI Gang CHEN Yanyan SHEN Kian-Lee TAN Yuncheng WU Xiaokui XIAO Naili XING Cong YUE Lingze ZENG Meihui ZHANG Zhanhao ZHAO School of Computing National University of Singapore College of Computer Science and Technology Zhejiang University Department of Computer Science and Engineering Shanghai Jiao Tong University School of Information Renmin University of China School of Computer Science and Technology Beijing Institute of Technology

In the wake of rapid advancements in artificial intelligence(AI), we stand on the brink of a transformative leap in data systems. The imminent fusion of AI and DB(AI×DB) promises a new generation of data systems, which will relieve the burden on end-users across all industry sectors by featuring AI-enhanced functionalities, such as personalized and automated in-database AI-powered analytics, and selfdriving capabilities for improved system performance. In this paper, we explore the evolution of data systems with a focus on deepening the fusion of AI and DB. We present NeurDB, an AI-powered autonomous data system designed to fully embrace AI design in each major system component and provide in-database AI-powered analytics. We outline the conceptual and architectural overview of NeurDB, discuss its design choices and key components, and report its current development and future plan.

关键词： AI$\times$DB in-database AI intelligent data system

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：