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

IEEE Transactions on Industrial Cyber-Physical Systems 2025年 3卷 48-60页

作者： Liu, Ruonan Hu, Puyuan Zhao, Siheng Sun, Zhijian Han, Te Pang, Zhibo Zhang, Weidong Shanghai Jiao Tong University Department of Automation Shanghai200240 China National Key Laboratory of Marine Engine Science and Technology Shanghai201108 China Crossocean of Suzhou Technology Suzhou215121 China Beijing Institute of Technology Center for Energy and Environmental Policy Research School of Management Beijing100081 China ABB Corporate Research Sweden Department of Automation Technology Vasteras722 26 Sweden KTH Royal Institute of Technology Department of Intelligent Systems Stockholm114 28 Sweden Henan University Henan Key Laboratory of Big Data Analysis and Processing School of Computer and Information Engineering Kaifeng475001 China Shanghai Jiaotong University Department of Automation Shanghai200240 China

Given the critical role of rotating machinery in industrial cyber-physical systems (ICPS), ensuring their reliable operation is essential for the stability and safety of ICPS. Deep neural networks have demonstrated competitive results for intelligent fault diagnosis, which are usually trained via the historical data of all fault modes. However, in real engineering, it is usually difficult to collect samples and exhaust all failures during the training stage. As a result, out-of-distribution fault diagnosis (OOD-FD) becomes a more realistic problem that requires the methods to not only accurately diagnose the known faults, but also effectively recognize unknown ones. Therefore, a novel orthogonal anchor clustering with focal attention (FA-OAC) is proposed in this paper for OOD-FD. Firstly, an orthogonal anchor clustering (OAC) algorithm is proposed to fix the class center of each fault mode orthogonally and distinguish the known and unknown faults at the class level. Then, because the identifiability of different fault modes changes a lot in OOD-FD, the focal attention mechanism is applied to dynamically adjust the attention to different fault modes according to the distance loss of OAC, thus addressing the identifiability imbalance problem. To verify the effectiveness of the proposed method, different OOD-FD tasks are designed based on two rotating machinery datasets. The experimental results and comparison with state-of-the-art fault diagnosis methods have demonstrated that the proposed method has improved the OOD-FD performance greatly and therefore provides an effective tool in real engineering. © 2023 IEEE.

关键词： Rotating machinery

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Preference Completion with Ranked and Unranked Preferences

引用

Cognitive Computation 2025年第3期17卷 1-21页

作者： Li, Lei Liu, Pan Zhang, Renjie Tao, Zhenchao Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Radiation Oncology The First Affiliated Hospital of USTC Division of Life Sciences and Medicine University of Science and Technology of China Hefei China Department of Radiation Oncology Anhui Provincial Cancer Hospital Hefei China

As for social choice, all alternatives are ranked by agents to form preferences as linear orders. However, in applications, sometimes some alternatives cannot be ranked, or it is unnecessary to rank them, which leads to unranked alternatives. Hence, without loss of generality, by dividing the set of alternatives into three ranked and unranked subsets, including top-k alternatives, intermediate-r alternatives, and last-l alternatives, the Mallows model on ranked and unranked preferences can be analyzed systematically. Technically, a repeated insertion model is adopted during sampling, and probability distributions are derived for ranked and unranked preferences of alternatives. Experimental results verify the accuracy of the probability distributions for different ranked and unranked preferences of alternatives. Furthermore, in order to solve the preference completion problem where agents have multiple partial rankings, a fuzzy preference completion algorithm, Fuzzy-Multi-Rankings, is proposed, which introduces a fuzzy ranking to complete the target agent’s preference in addition to the traditional nearest-neighbor-based methods. Based on the three ranked and unranked preferences, seven cases can be classified and analyzed for fuzzy preference completion. Experiments on the synthetic datasets and MovieLens dataset confirm the effectiveness and efficiency of our proposed Fuzzy-Multi-Rankings algorithm and also verify the accuracy of the evaluated probability distributions for the proposed seven cases.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ReFrame: A Resource-Friendly Cloud-Assisted On-Device Deep Learning Framework for Vision Services

引用

IEEE Transactions on Services Computing 2025年

作者： Xie, Jianhang Ding, Chuntao Guan, Qingji Zhou, Ao Li, Yidong Beijing Jiaotong University Key Laboratory of Big Data & Artificial Intelligence in Transportation Ministry of Education School of Computer and Information Technology Beijing China Beijing Normal University School of Artificial Intelligence Beijing China Beijing Jiaotong University Beijing Key Laboratory of Traffic Data Analysis and Mining Beijing China Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing China

Cloud-assisted Internet of Things (IoT) device deployment of deep neural networks (DNNs) promotes On-device deep learning to provide users with ubiquitous high-quality services by solving the contradiction between insufficient IoT device resources and intensive demand for high-performance DNN resources. However, most existing methods optimize DNNs by considering one or two terms of transmission, computation, and storage resources, but do not consider all three terms at the same time in cloud-assisted IoT device deployment and updating DNNs. To this end, we propose a non-learnable module-based ResNet and a cloud-assisted on-device deep learning framework, ReFrame, based on the consideration of three indicators: model transmission parameters, computation resources, and storage resources. In the proposed method, we first specify that some parameters in DNNs are non-learnable and randomly initialized, so that, these parameters can be saved and reproduced with a few random seeds. By doing so, the cloud only transmits random seeds and learnable parameters to reduce the number of parameter transmissions. Secondly, we reduce the computation resource consumption of the model by introducing computation-friendly operators, such as pooling, to replace vanilla convolutions. Finally, since random seeds are used to save non-learnable model parameters, on IoT devices we only need to store random seeds and learnable parameters to reproduce the well-trained model. Compared with saving the complete model, our method greatly reduces IoT device storage resource consumption. Experimental results on image classification, object detection, and semantic segmentation tasks demonstrate the effectiveness of the proposed method. Specifically, on the CIFAR-10, our proposed method reduces approximately 89% of FLOPs and 90% of transmitted data in the prototype system compared to ResNet-18. © 2008-2012 IEEE.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

AdvMap: Crafting Adversarial Maps to Counter AI Aimbot in First-Person Shooter Games

引用

IEEE Transactions on Games 2025年

作者： Yan, Kai Chen, Xianyi Cui, Qi Yuan, Haoqin Tan, Zhenshan Nanjing University of Information Science and Technology Engineering Research Center of Digital Forensics Ministry of Education the School of Computer Science Nanjing210044 China Beijing Jiaotong University Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport Beijing100044 China

AI-based automatic aiming cheats (a.k.a., AI aimbots) have proliferated in first-person shooter (FPS) games, which grant malicious users an unfair gameplay advantage. Since AI aimbots operate independently of game data and are developed using object detection algorithms, they are difficult to detect with traditional anti-cheating methods. To actively counter AI aimbots, we propose AdvMap, which introduces invisible adversarial perturbations into game scene elements. In optimizing these adversarial perturbations, we design a mixture-of-misleading loss function that increases the total target confidence score within each misleading bounding box. It mitigates the risk of segment missing even when AdvMap is obscured, thereby enhancing the robustness. Besides, an L1-norm constraint with a small scale is employed during each update of the adversarial perturbations, which preserves the fidelity of the game scene. Additionally, to enable effective adaptation to interact with various elements within game environments, we introduce an Image-Subspace-Based Multi-Directional (ISMD) optimization strategy. It enables the adversarial perturbations to adaptively fit into each element by leveraging the mapping relationship between the game's 3D scenes and its corresponding 2D images. Furthermore, we construct a comprehensive benchmark, which includes various FPS games with different graphics styles and perspectives. Extensive experimental results demonstrate the efficacy of our method in countering various AI aimbot tools on different state-of-the-art object detection methods. © 2021 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

IMPACT: Importance-Informed Prefetching and Caching for I/O-Bound DNN Training

引用

IEEE Transactions on computers 2025年

作者： Chen, Weijian He, Shuibing Zhang, Ruidong Zhang, Xuechen Chen, Ping Yang, Siling Qu, Haoyang Zhan, Xuan Zhejiang University State Key Laboratory of Blockchain and Data Security China Institute of Blockchain and Data Security Hangzhou China Zhejiang Key Laboratory of Big Data Intelligent Computing China Washington State University Vancouver School of Engineering and Computer Science VancouverWA98686 United States

Fetching large amounts of DNN training data from storage systems causes high I/O latency and GPU stalls. Importance sampling can reduce data processing on GPUs while maintaining model accuracy, but current frameworks lack a prefetching and caching layer to optimize data fetches and cache management based on sample importance. This leads to unnecessary fetches, poor cache hit ratios, and random I/Os. We present ImPACT, an importance-informed prefetching and caching system, to accelerate I/O-bound DNN training. First, we propose an importance-informed prefetching technique to reduce the prefetching of unimportant data. Then, we introduce an importance-aware caching layer, partitioned into two regions: H-cache and L-cache, which store samples of high importance and low importance respectively. Rather than using recency or frequency, we manage data items in H-cache according to their corresponding sample importance. When there is a cache miss in L-cache, we use sample substitutability and dynamic packaging to improve the cache hit ratio and reduce the number of random I/Os. Our experimental results show that ImPACT has a negligible impact on training accuracy while speeding up DNN training by up to 3.5× compared to state-of-the-art prefetching and caching systems. © 1968-2012 IEEE.

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

Maximizing Area Coverage in Privacy-Preserving Worker Recruitment: A Prior knowledge-Enhanced Geo-indistinguishable Approach

引用

IEEE Transactions on information Forensics and Security 2025年 20卷 5138-5151页

作者： Zhang, Pengfei Cheng, Xiang Zhang, Zhikun Zhu, Youwen Zhang, Ji Anhui University of Science and Technology State Key Laboratory of Digital Intelligent Technology for Unmanned Coal Mining the School of Computer Science and Engineering Anhui University of Science and Technology Huainan232001 China Yunnan University of Finance and Economics Yunnan Key Laboratory of Service Computing Yunnan 650221 China Key Laboratory of Equipment Data Security and Guarantee Technology Ministry of Education Key Laboratory of Computing Power Network and Information Security Ministry of Education China Beijing University of Posts and Telecommunications China Zhejiang University China Nanjing University of Aeronautics and Astronautics China University of Southern Queensland China

Worker recruitment for area coverage maximization, typically requires participants to upload location information, which can deter potential participation without proper protection. While existing studies resort to geo-indistinguishability to address this concern, they primarily focus on either specific task locations (Target Coverage) or operate under pre-defined recruitment quotas for an interested region (Area Coverage). These focuses not only yield suboptimal area coverage when scaled but also fail to leverage valuable prior knowledge in the form of participants’ noisy historical registered locations, to enhance both location obfuscation and worker identification processes. To address these limitations, we present WILTON, which optimizes area coverage under geo-indistinguishability by recruiting the minimum number of participants through the strategic utilization of noisy prior knowledge. In WILTON, to generate obfuscated locations, we propose a probabilistic and weight-aware input perturbation mechanism, which groups and weights prior locations rather than using only personal prior locations. To privately identify the recruited workers, we design a grid-based worker identification method, which provides a worst-case performance guarantee of ratio (Formula Presented) to the optimum. We provide a theoretical analysis of the privacy, utility, and complexity guarantees of WILTON. Experimental results over two real-world datasets and one synthetic dataset show that WILTON surpasses the state-of-the-arts by at least 8% in area coverage improvement. © 2005-2012 IEEE.

关键词： knowledge acquisition

来源：评论

学校读者我要写书评

暂无评论

Homophily Induced Contrastive Attributed Graph Clustering

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Chen, Man-Sheng Lai, Pei-Yuan Liao, De-Zhang Wang, Chang-Dong Lai, Jian-Huang Sun Yat-sen University School of Computer Science and Engineering Guangzhou China Guangxi Zhuang Autonomous Region Information Center Guangxi Key Laboratory of Digital Infrastructure Nanning China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China South China Technology Commercialization Center Guangzhou China Guangdong Key Laboratory of Information Security Technology Guangzhou China

Attributed graph clustering, aiming to discover the underlying graph structure and partition the graph nodes into several disjoint categories, is a basic task in graph data analysis. Although recent efforts over graph contrastive clustering have achieved decent performances, most of them get accustomed to construct the positive neighbor set by the generated pseudo clustering information, directly ignoring the ready-made neighbor nodes and the underlying semantics of edges in a graph. How to well deal with the graph neighbor-specific information to facilitate the performance of graph contrastive clustering is still a challenging problem. Therefore, in this work, we propose a novel Homophily Induced Contrastive Attributed Graph Clustering (HomoCAGC) method, where the power of homophily is exploited in facilitating the performance of contrastive attributed graph clustering, while the pseudo homophily in a graph is also explored and distinguished. Especially, the node feature as reliable information guidance is used to compute the underlying feature-oriented pair-wise node similarity, based on which the positive node pairs in contrastive regularizer are adjusted for better node representation characterization. According to the refined node representations, a triplet self-supervised clustering objective is well-designed to ensure the output embedding is cluster-oriented, and suitable for the downstream clustering task. Extensive experiments on seven benchmarks are conducted to demonstrate the effectiveness of HomoCAGC. © 1991-2012 IEEE.

关键词： Attributed graph clustering contrastive learning graph homophily self-supervised clustering

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Alignment-enhanced Adaptive Grounding Network for Generalized Referring Expression Comprehension

arXiv

引用

arXiv 2025年

作者： Wang, Yaxian Ding, Henghui He, Shuting Jiang, Xudong Wei, Bifan Liu, Jun School of Computer Science and Technology Xi'an Jiaotong University China Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi'an Jiaotong University China Institute of Big Data Fudan University China Shanghai University of Finance and Economics China Nanyang Technological University Singapore School of Continuing Education Xi'an Jiaotong University China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University China

In this work, we address the challenging task of Generalized Referring Expression Comprehension (GREC). Compared to the classic Referring Expression Comprehension (REC) that focuses on single-target expressions, GREC extends the scope to a more practical setting by further encompassing notarget and multi-target expressions. Existing REC methods face challenges in handling the complex cases encountered in GREC, primarily due to their fixed output and limitations in multi-modal representations. To address these issues, we propose a Hierarchical Alignment-enhanced Adaptive Grounding Network (HieA2G) for GREC, which can flexibly deal with various types of referring expressions. First, a Hierarchical Multi-modal Semantic Alignment (HMSA) module is proposed to incorporate three levels of alignments, including word-object, phrase-object, and text-image alignment. It enables hierarchical cross-modal interactions across multiple levels to achieve comprehensive and robust multi-modal understanding, greatly enhancing grounding ability for complex cases. Then, to address the varying number of target objects in GREC, we introduce an Adaptive Grounding Counter (AGC) to dynamically determine the number of output targets. Additionally, an auxiliary contrastive loss is employed in AGC to enhance object-counting ability by pulling in multi-modal features with the same counting and pushing away those with different counting. Extensive experimental results show that HieA2G achieves new state-of-the-art performance on the challenging GREC task and also the other 4 tasks, including REC, Phrase Grounding, Referring Expression Segmentation (RES), and Generalized Referring Expression Segmentation (GRES), demonstrating the remarkable superiority and generalizability of the proposed HieA2G. Copyright © 2025, The Authors. All rights reserved.

关键词： Electric grounding

来源：评论

学校读者我要写书评

暂无评论

DMSACNN: Deep Multiscale Attentional Convolutional Neural Network for EEG-Based Motor Decoding

引用

IEEE Journal of Biomedical and Health Informatics 2025年 PP卷 PP页

作者： Liu, Ke Xing, Xin Yang, Tao Yu, Zhuliang Xiao, Bin Wang, Guoyin Wu, Wei Chongqing University of Posts and Telecommunications School of Computer Science and Technology Chongqing400065 China Chongqing University of Posts and Telecommunications Key Laboratory of Big Data Intelligent Computing China Chongqing University of Posts and Telecommunications Key Laboratory of Cyberspace Big Data Intelligent Security of Ministry of Education China South China University of Technology College of Automation Science and Engineering Guangzhou510641 China Chongqing Normal University National Center for Applied Mathematics in Chongqing Chongqing401331 China Shanghai Jiao Tong University School of Medicine Songjiang Hospital Songjiang Research Institute Shanghai Key Laboratory of Emotions and Affective Disorders Shanghai201600 China

Objective: Accurate decoding of electroencephalogram (EEG) signals has become more significant for the brain-computer interface (BCI). Specifically, motor imagery and motor execution (MI/ME) tasks enable the control of external devices by decoding EEG signals during imagined or real movements. However, accurately decoding MI/ME signals remains a challenge due to the limited utilization of temporal information and ineffective feature selection methods. Methods: This paper introduces DMSACNN, an end-to-end deep multiscale attention convolutional neural network for MI/ME-EEG decoding. DMSACNN incorporates a deep multiscale temporal feature extraction module to capture temporal features at various levels. These features are then processed by a spatial convolutional module to extract spatial features. Finally, a local and global feature fusion attention module is utilized to combine local and global information and extract the most discriminative spatiotemporal features. Main results: DMSACNN achieves impressive accuracies of 78.20%, 96.34% and 70.90% for hold-out analysis on the BCI-IV-2a, High Gamma and OpenBMI datasets, respectively, outperforming most of the state-of-the-art methods. Conclusion and significance: These results highlight the potential of DMSACNN in robust BCI applications. Our proposed method provides a valuable solution to improve the accuracy of the MI/ME-EEG decoding, which can pave the way for more efficient and reliable BCI systems. The source code for DMSACNN is available at https://***/xingxin-99/***. © 2025 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

NSPG-Miner: Mining Repetitive Negative Sequential Patterns

arXiv

引用

arXiv 2025年

作者： Li, Yan Wang, Zhulin Liu, Jing Guo, Lei Fournier-Viger, Philippe Wu, Youxi Wu, Xindong School of Economics and Management Hebei University of Technology Tianjin300401 China School of Artificial Intelligence Hebei University of Technology Tianjin300401 China State Key Laboratory of Reliability and Intelligence of Electrical Equipment Hebei University of Technology Tianjin300401 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518061 China Hebei Key Laboratory of Big Data Computing 300401 China Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei University of Technology Hefei230009 China

Sequential pattern mining (SPM) with gap constraints (or repetitive SPM or tandem repeat discovery in bioinformatics) can find frequent repetitive subsequences satisfying gap constraints, which are called positive sequential patterns with gap constraints (PSPGs). However, classical SPM with gap constraints cannot find the frequent missing items in the PSPGs. To tackle this issue, this paper explores negative sequential patterns with gap constraints (NSPGs). We propose an efficient NSPG-Miner algorithm that can mine both frequent PSPGs and NSPGs simultaneously. To effectively reduce candidate patterns, we propose a pattern join strategy with negative patterns which can generate both positive and negative candidate patterns at the same time. To calculate the support (frequency of occurrence) of a pattern in each sequence, we explore a NegPair algorithm that employs a key-value pair array structure to deal with the gap constraints and the negative items simultaneously and can avoid redundant rescanning of the original sequence, thus improving the efficiency of the algorithm. To report the performance of NSPG-Miner, 11 competitive algorithms and 11 datasets are employed. The experimental results not only validate the effectiveness of the strategies adopted by NSPG-Miner, but also verify that NSPG-Miner can discover more valuable information than the state-ofthe-art algorithms. Algorithms and datasets can be downloaded from https://***/wuc567/PatternMining/tree/master/NSPG-Miner. Copyright © 2025, The Authors. All rights reserved.

关键词： Miners

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：