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

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

来源：评论

学校读者我要写书评

暂无评论

Snapshot boosting: a fast ensemble framework for deep neural networks

引用

Science China(Information Sciences) 2020年第1期63卷 77-88页

作者： Wentao ZHANG Jiawei JIANG Yingxia SHAO Bin CUI Center for Data Science Peking University National Engineering Laboratory for Big Data Analysis and Applications Department of Computer Science Beijing Key Lab of Intelligent Telecommunications Software and Multimedia School of Computer ScienceBeijing University of Posts and Telecommunications Key Lab of High Confidence Software Technologies Department of Computer SciencePeking University

Boosting has been proven to be effective in improving the generalization of machine learning models in many fields. It is capable of getting high-diversity base learners and getting an accurate ensemble model by combining a sufficient number of weak learners. However, it is rarely used in deep learning due to the high training budget of the neural network. Another method named snapshot ensemble can significantly reduce the training budget, but it is hard to balance the tradeoff between training costs and diversity. Inspired by the ideas of snapshot ensemble and boosting, we propose a method named snapshot boosting. A series of operations are performed to get many base models with high diversity and accuracy, such as the use of the validation set, the boosting-based training framework, and the effective ensemble strategy. Last, we evaluate our method on the computer vision(CV) and the natural language processing(NLP) tasks, and the results show that snapshot boosting can get a more balanced trade-off between training expenses and ensemble accuracy than other well-known ensemble methods.

关键词： ensemble learning deep learning boosting neural network snapshot ensemble

来源：评论

学校读者我要写书评

暂无评论

APT Adversarial Defence Mechanism for Industrial IoT Enabled Cyber-Physical System

引用

IEEE Access 2023年 11卷 74000-74020页

作者： Javed, Safdar Hussain Ahmad, Maaz Bin Asif, Muhammad Akram, Waseem Mahmood, Khalid Das, Ashok Kumar Shetty, Sachin College of Computing and Information Sciences Karachi75190 Pakistan Lahore Garrison University Department of Computer Science Lahore54810 Pakistan National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Douliu64002 Taiwan International Institute of Information Technology at Hyderabad Center for Security Theory and Algorithmic Research Hyderabad500032 India Old Dominion University Simulation and Visualization Engineering Virginia Modeling Analysis and Simulation Center Department of Modeling SuffolkVA23435 United States Old Dominion University Center for Cybersecurity Education and Research SuffolkVA23435 United States

The objective of Advanced Persistent Threat (APT) attacks is to exploit Cyber-Physical Systems (CPSs) in combination with the Industrial Internet of Things (I-IoT) by using fast attack methods. Machine learning (ML) techniques have shown potential in identifying APT attacks in autonomous and malware detection systems. However, detecting hidden APT attacks in the I-IoT-enabled CPS domain and achieving real-time accuracy in detection present significant challenges for these techniques. To overcome these issues, a new approach is suggested that is based on the Graph Attention Network (GAN), a multi-dimensional algorithm that captures behavioral features along with the relevant information that other methods do not deliver. This approach utilizes masked self-attentional layers to address the limitations of prior Deep Learning (DL) methods that rely on convolutions. Two datasets, the DAPT2020 malware, and Edge I-IoT datasets are used to evaluate the approach, and it attains the highest detection accuracy of 96.97% and 95.97%, with prediction time of 20.56 seconds and 21.65 seconds, respectively. The GAN approach is compared to conventional ML algorithms, and simulation results demonstrate a significant performance improvement over these algorithms in the I-IoT-enabled CPS realm. © 2013 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

LECF: recommendation via learnable edge collaborative filtering

引用

Science China(Information Sciences) 2022年第1期65卷 116-130页

作者： Shitao XIAO Yingxia SHAO Yawen LI Hongzhi YIN Yanyan SHEN Bin CUI School of Computer Science (National Pilot Software Engineering School) Beijing University of Posts and Telecommunications Beijing Key Lab of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications School of Information Technology and Electrical Engineering The University of Queensland Department of Computer Science and Engineering Shanghai Jiao Tong University Department of Computer Science and Technology Peking University National Engineering Laboratory for Big Data Analysis and Applications Peking University

The core of recommendation models is estimating the probability that a user will like an item based on historical interactions. Existing collaborative filtering(CF) algorithms compute the likelihood by utilizing simple relationships between objects, e.g., user-item, item-item, or user-user. They always rely on a single type of object-object relationship, ignoring other useful relationship information in data. In this paper, we model an interaction between user and item as an edge and propose a novel CF framework, called learnable edge collaborative filtering(LECF). LECF predicts the existence probability of an edge based on the connections among edges and is able to capture the complex relationship in data. Specifically, we first adopt the concept of line graph where each node represents an interaction edge; then calculate a weighted sum of similarity between the query edge and the observed edges(i.e., historical interactions) that are selected from the neighborhood of query edge in the line graph for a recommendation. In addition, we design an efficient propagation algorithm to speed up the training and inference of LECF. Extensive experiments on four public datasets demonstrate LECF can achieve better performance than the state-of-the-art methods.

关键词： collaborative filtering recommender system implicit feedback edge-edge similarity line graph

来源：评论

学校读者我要写书评

暂无评论

UVTM: Universal Vehicle Trajectory Modeling with ST Feature Domain Generation

arXiv

引用

arXiv 2024年

作者： Lin, Yan Hu, Jilin Guo, Shengnan Yang, Bin Jensen, Christian S. Lin, Youfang Wan, Huaiyu The Beijing Key Laboratory of Traffic Data Analysis and Mining School of Computer and Information Technoloty Beijing Jiaotong University Beijing100044 China The Key Laboratory of Intelligent Passenger Service of Civil Aviation CAAC Beijing101318 China The School of Data Science and Engineering East China Normal University Shanghai200050 China The Department of Computer Science Aalborg University Aalborg9220 Denmark

Vehicle movement is frequently captured in the form of trajectories, i.e., sequences of timestamped locations. Numerous methods exist that target different tasks involving trajectories such as travel-time estimation, trajectory recovery, and trajectory prediction. However, most methods target only one specific task and cannot be applied universally. Existing efforts to create a universal trajectory model often involve adding prediction modules for adapting to different tasks, while also struggle with incomplete or sparse trajectories. To address these shortcomings, we propose the Universal Vehicle Trajectory Model (UVTM) designed to support different tasks based on incomplete or sparse trajectories without the need for retraining or extra prediction modules. To addresses task adaptability on incomplete trajectories, UVTM divide the spatio-temporal features of trajectories into three distinct domains. Each domain can be masked and generated independently to suit the input and output needs of specific tasks. To handle sparse trajectories effectively, UVTM is pre-trained by reconstructing densely sampled trajectories from sparsely sampled ones, allowing it to extract detailed spatio-temporal information from sparse trajectories. Experiments involving three representative trajectory-related tasks on two real-world vehicle trajectory datasets provide insight into the intended properties performance of UVTM and offer evidence that UVTM is capable of meeting its objectives. Copyright © 2024, The Authors. All rights reserved.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

Medical insurance medication anomaly detection based on isolated forest proximity matrix 16

Medical insurance medication anomaly detection based on isol...

引用

16th IEEE International Conference on computer Science and Education, ICCSE 2021

作者： Jiang, Xiaoshan Lin, Kaibiao Zeng, Yifeng Yang, Fan Xiamen University Department of Automation Xiamen China Xiamen University of Technology School of Computer Information Engineering Xiamen China Xiamen Key Laboratory of Big Data Intelligent Analysis and Decision Xiamen University Xiamen China

ISBN: (纸本)9781665414685

With the continuous development of the medical insurance system and the continuous increase in the number of insured persons, medical insurance fraud has also intensified. Traditional fraud detection methods are no longer suitable for the needs of medical insurance fraud review. Aiming at the problem of drug reselling in medical insurance fraud, this paper uses the proximity matrix of the isolated forest to improve the LDOF algorithm, and proposes a new medical insurance medication anomaly detection algorithm. Through comparative experiments, our algorithm not only improves the accuracy of LDOF, but also improves the computational efficiency, and shows good performance in the application of actual medical insurance data sets. © 2021 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

A Region Enhanced Discrete Multi-Objective Fireworks Algorithm for Low-Carbon Vehicle Routing Problem

引用

Complex System Modeling and Simulation 2022年第2期2卷 142-155页

作者： Xiaoning Shen Jiaqi Lu Xuan You Liyan Song Zhongpei Ge Collaborative Innovation Center of Atmospheric Environment and Equipment Technology Jiangsu Key Laboratory of Big Data Analysis TechnologySchool of AutomationNanjing University of Information Science and TechnologyNanjing 210044China School of Automation Nanjing University of Information Science and TechnologyNanjing 210044China Institute of Trustworthy Autonomous Systems and also with the Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent ComputationDepartment of Computer Science and EngineeringSouthern University of Science and TechnologyShenzhen 518055China

A constrained multi-objective optimization model for the low-carbon vehicle routing problem(VRP)is established.A carbon emission measurement method considering various practical factors is *** minimizes both the total carbon emissions and the longest time consumed by the sub-tours,subject to the limited number of available *** to the characteristics of the model,a region enhanced discrete multi-objective fireworks algorithm is proposed.A partial mapping explosion operator,a hybrid mutation for adjusting the sub-tours,and an objective-driven extending search are designed,which aim to improve the convergence,diversity,and spread of the non-dominated solutions produced by the algorithm,*** low-carbon VRP instances with different scales are used to verify the effectiveness of the new ***,comparison results with four state-of-the-art algorithms indicate that the proposed algorithm has better performance of convergence and distribution on the low-carbon *** provides a promising scalability to the problem size.

关键词： vehicle routing problem carbon emission multi-objective optimization fireworks algorithm region enhanced

来源：评论

学校读者我要写书评

暂无评论

Unfolding the Headline: Iterative Self-Questioning for News Retrieval and Timeline Summarization

arXiv

引用

arXiv 2025年

作者： Wu, Weiqi Huang, Shen Jiang, Yong Xie, Pengjun Huang, Fei Zhao, Hai Department of Computer Science and Engineering Shanghai Jiao Tong University China Tongyi Lab Alibaba Group China Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Shanghai Jiao Tong University China Shanghai Key Laboratory of Trusted Data Circulation and Governance in Web3 China

In the fast-changing realm of information, the capacity to construct coherent timelines from extensive event-related content has become increasingly significant and challenging. The complexity arises in aggregating related documents to build a meaningful event graph around a central topic. This paper proposes CHRONOS - Causal Headline Retrieval for Open-domain News Timeline SummarizatiOn via Iterative Self-Questioning, which offers a fresh perspective on the integration of Large Language Models (LLMs) to tackle the task of Timeline Summarization (TLS). By iteratively reflecting on how events are linked and posing new questions regarding a specific news topic to gather information online or from an offline knowledge base, LLMs produce and refresh chronological summaries based on documents retrieved in each round. Furthermore, we curate Open-TLS, a novel dataset of timelines on recent news topics authored by professional journalists to evaluate open-domain TLS where information overload makes it impossible to find comprehensive relevant documents from the web. Our experiments indicate that CHRONOS is not only adept at open-domain timeline summarization, but it also rivals the performance of existing state-of-the-art systems designed for closed-domain applications, where a related news corpus is provided for summarization. Copyright © 2025, The Authors. All rights reserved.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Xiaoke Zhu Danyang Li Xiaopan Chen Fumin Qi Fan Zhang Xiao-Yuan Jing School of Computer and Information Engineering Henan University Kaifeng China Henan Engineering Research Center of Intelligent Technology and Application Henan University Kaifeng China Department of System Operation National Supercomuting Center in Shenzhen Shenzhen China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng China School of Computer Science Wuhan University Wuhan China

ISBN: (数字)9798350390155

ISBN: (纸本)9798350390162

Facial image based kinship verification aims to decide whether there exists kinship between the given facial images. In practice, the cross-generation differences will cause adverse effects on kinship verification, which limits the performance. Therefore, how to mine the implied similarity from facial images with large cross-generation divergence is an important problem in kinship verification, which has not yet been well studied. In view of this, we propose a Similarity Mining via Implicit matching pattern LEarning (SMILE) approach for kinship verification. Specifically, SMILE mainly consists of two modules, including a Semi-coupled Multi-pattern Similarity Learning (SMSL) module and a Cross-Generation Feature Normalization (CGFN) module. The SMSL module is designed to learn multiple semi-coupled matching patterns for mining the implicit facial similarity information from different perspectives. The CGFN module aims to reduce the divergence between facial images of parent and child. Extensive experiments demonstrate that the proposed approach outperforms the existing state-of-the-art methods.

关键词： Pattern matching Similarity learning

来源：评论

学校读者我要写书评

暂无评论

An Insight Into Neurodegeneration: Harnessing Functional MRI Connectivity in the Diagnosis of Mild Cognitive Impairment

An Insight Into Neurodegeneration: Harnessing Functional MRI...

引用

17th International Joint Conference on Biomedical engineering Systems and Technologies, BIOSTEC 2024

作者： Han, Shuning Sun, Zhe Zhao, Kanhao Duan, Feng Caiafa, Cesar F. Zhang, Yu Solé-Casals, Jordi Data and Signal Processing Research Group University of Vic-Central University of Catalonia Catalonia Vic08500 Spain Image Processing Research Group RIKEN Center for Advanced Photonics Riken Saitama Wako-Shi Japan Faculty of Health Data Science Juntendo University Chiba Urayasu Japan Department of Bioengineering Lehigh University BethlehemPA18015 United States Tianjin Key Laboratory of Brain Science and Intelligent Rehabilitation Nankai University Tianjin China Instituto Argentino de Radioastronomía-CCT La Plata CONICET/ CIC-PBA/ UNLP V. Elisa 1894 Argentina Department of Electrical and Computer Engineering Lehigh University BethlehemPA18015 United States Department of Psychiatry University of Cambridge CambridgeCB20SZ United Kingdom

Alzheimer’s disease is a progressive form of memory loss that worsens over time. Detecting it early, when memory issues are mild, is crucial for effective interventions. Recent advancements in computer technology, specifically Graph Convolutional Networks (GCNs), have proven to be powerful tools for analyzing Magnetic Resonance Imaging (MRI) data comprehensively. In this study, we developed a GCN framework for diagnosing mild cognitive impairment (MCI) by examining the functional connectivity (FC) derived from resting-state functional MRI (rfMRI) data. Our research systematically explored various types and processing methods of FC, evaluating their performance on the OASIS-3 dataset. The experimental results revealed several key findings. On the one hand, the proposed GCN exhibited significantly superior performance over both the baseline GCN and the Support Vector Machine (SVM) models, with statistically significant differences. It attained the highest average accuracy of 80.3% and a peak accuracy of 88.2%. On the other hand, the GCN frame work obtained using individual FCs showed overall slightly better performance than the one using global FCs. However, it is important to note that GCNs using global networks with appropriate connectivity can achieve comparable or even better performance than individual networks in certain cases. Finally, our results also indicate that the connectivity within specific brain regions, such as VIS, DMN, SMN, VAN, and FPC, may play a more significant role in GCN-based MRI classification for MCI diagnosis. These findings significantly contribute to the understanding of neurodegenerative disorders and offer valuable insights into the diverse ap plications of GCNs in brain analysis and disease detection. © 2024 by SCITEPRESS– Science and Technology Publications, Lda.

关键词： Neurodegenerative diseases

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：