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

15th IEEE Global Reliability and Prognostics and Health Management Conference, PHM-Beijing 2024

作者： Shen, Nahao Li, Honghui Bai, Yanhui Yang, Xiaorui He, Ruiyi School of Computer Science and Technology Beijing Jiaotong University Beijing China School of Computer Science and Technology Beijing Jiaotong University Engineering Research Center of Network Management Technology for High Speed Railway of MOE Beijing China

ISBN: (纸本)9798350354010

The rapid expansion of railway networks and technological advancements has introduced significant challenges in ensuring railway safety. To address the critical need for effective prediction and prevention mechanisms, this paper proposes the FCAM-TCN-DSInformer model, a novel approach to railway accident prediction. The model integrates the Fourier-based Channel Attention Mechanism (FCAM), Temporal Convolutional network (TCN), and De-stationary Informer (DSInformer) to capture both temporal and spectral features from time series data effectively. Extensive experiments and ablation studies were conducted to validate the model's performance. The results demonstrate that the FCAM-TCN-DSInformer model significantly outperforms both traditional and advanced models, including ARIMA, LSTM, GRU, Transformer, Autoformer, and FEDformer by achieving the highest R2 score and substantial reductions in error metrics such as RMSE, MAE, and MAPE. These improvements confirm the model's accuracy and robustness, making it a powerful tool for railway safety management. Moreover, the model's adaptability to different univariate time series datasets, such as the Daily Minimum Temperatures Dataset and the US Births Dataset, highlights its strong generalization capabilities. Future work will focus on optimizing the model for real-time predictions and expanding its application to multi-step prediction tasks, thereby fully realizing its potential across diverse forecasting contexts. © 2024 IEEE.

关键词： Railroad accidents

来源：评论

学校读者我要写书评

暂无评论

Tensor Factorization for Accurate Anomaly Detection in Dynamic networks

IEEE Transactions on Sustainable Computing

引用

IEEE Transactions on Sustainable Computing 2025年第3期10卷 439-450页

作者： Li, Xiaocan Wen, Jigang Xie, Kun Xie, Gaogang Liang, Wei Hunan University College of Computer Science Electronics Engineering Changsha410012 China Ministry of Education Key Laboratory of Supercomputing Artificial Intelligence Fusion Computing Changsha410012 China School of Computer Science Engineering Hunan University of Science Technology Xiangtan411199 China Chinese Academy of Sciences Computer Network Information Center Beijing411199 China

Accurately detecting traffic anomalies becomes increasingly crucial in network management. Algorithms that model the traffic data as a matrix suffers from low detection accuracy, while the work using the tensor model often assumes the tensor is regular without considering that network nodes may dynamically join in or leave, which will fail in a practical network with the change of node set as a result of mobility and churn behaviors. We propose a novel Tensor Recovery scheme in a Dynamic network (TRDN) with traffic data modeled as a practical irregular tensor for accurate anomaly detection. To take advantage of correlations among small tensors, each formed with a short time duration to capture more hidden information in the data for higher detection accuracy, we propose several novel techniques: 1) a new joint tensor factorization model to capture the characteristic shared by the common nodes of small tensors, 2) a tensor partition algorithm to identify the data that can be applied to train the shared parameters efficiently, and 3) a bar-based algorithm that partitions nodes into the minimum number of no-overlapping subsets to form the shared tensor model. Extensive experiments on two Internet traffic data sets, Abilene and GÈANT, demonstrate the effectiveness of the proposed TRDN. © 2016 IEEE.

关键词： Data accuracy

来源：评论

学校读者我要写书评

暂无评论

A Theory of Transfer-Based Black-Box Attacks: Explanation and Implications 37

A Theory of Transfer-Based Black-Box Attacks: Explanation an...

引用

37th Conference on Neural Information Processing Systems, NeurIPS 2023

作者： Chen, Yanbo Liu, Weiwei School of Computer Science Wuhan University National Engineering Research Center for Multimedia Software Wuhan University Institute of Artificial Intelligence Wuhan University Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University

ISBN: (纸本)9781713899921

Transfer-based attacks [1] are a practical method of black-box adversarial attacks in which the attacker aims to craft adversarial examples from a source model that is transferable to the target model. Many empirical works [2-6] have tried to explain the transferability of adversarial examples from different angles. However, these works only provide ad hoc explanations without quantitative analyses. The theory behind transfer-based attacks remains a mystery. This paper studies transfer-based attacks under a unified theoretical framework. We propose an explanatory model, called the manifold attack model, that formalizes popular beliefs and explains the existing empirical results. Our model explains why adversarial examples are transferable even when the source model is inaccurate as observed in Papernot et al. [7]. Moreover, our model implies that the existence of transferable adversarial examples depends on the "curvature" of the data manifold, which further explains why the success rates of transfer-based attacks are hard to improve. We also discuss our model's expressive power and applicability. © 2023 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Provably Secure Efficient Key-Exchange Protocol for Intelligent Supply Line Surveillance in Smart Grids

引用

IEEE Internet of Things Journal 2025年第12期12卷 21784-21792页

作者： Ayub, Muhammad Faizan Li, Xiong Mahmood, Khalid Alenazi, Mohammed J.F. Das, Ashok Kumar Wang, Guijuan University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu12599 China National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Yunlin Douliu64002 Taiwan Department of Computer Engineering Riyadh11451 Saudi Arabia International Institute of Information Technology Center for Security Theory and Algorithmic Research Hyderabad500 032 India Korea University College of Informatics Department of Computer Science and Engineering Anam-ro Seoul145 Korea Republic of Ministry of Education Shandong Computer Science Center Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security China Shandong Fundamental Research Center for Computer Science Jinan 250353 China

Intelligent supply line surveillance is critical for modern smart grids. Smart sensors and gateway nodes are strategically deployed along supply lines to achieve intelligent surveillance. They collect data continuously and transmit it to the control centre in real-time. It enables real-time monitoring, fault detection, and efficient energy management across distribution networks. This advanced surveillance system ensures continuous monitoring of supply lines, detecting anomalies, and optimizing operations to maintain the stability and reliability of the smart grid. However, the reliance of all participating nodes on public communication channels to transmit supply line surveillance data exposes these systems to critical cyber attacks. These cyber attacks include impersonation, physical tampering, ephemeral secret leakage, and desynchronization attacks. To address these issues, existing key-exchange protocols often fail to ensure robust security while imposing high computation and communication overheads, limiting their practicality for resource-constrained environments. Therefore, we propose a secure and efficient key exchange and tamper-resistant authentication protocol using Elliptic Curve Cryptography (ECC) and Physical Unclonable Functions (PUFs). The PUF mechanism provides robust resistance against physical tampering and cloning attacks, ensuring enhanced physical security for supply line devices. We validate the security robustness of the devised protocol using the Random or Real (ROR) model. Furthermore, informal security analysis demonstrates the protocol's robustness in rigorously resisting various attacks, including physical tampering, impersonation, ephemeral secret leakage and desynchronization. Moreover, we determine the performance evaluation that reveals the protocol's superior efficiency compared to competing protocols, achieving significant reductions of 28.64% in computation overhead and 9.96% in communication overhead. © 2014 IEEE.

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

Adversarial Self-Training Improves Robustness and Generalization for Gradual Domain Adaptation 37

Adversarial Self-Training Improves Robustness and Generaliza...

引用

37th Conference on Neural Information Processing Systems, NeurIPS 2023

作者： Shi, Lianghe Liu, Weiwei School of Computer Science Wuhan University National Engineering Research Center for Multimedia Software Wuhan University Institute of Artificial Intelligence Wuhan University Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University

ISBN: (纸本)9781713899921

Gradual Domain Adaptation (GDA), in which the learner is provided with additional intermediate domains, has been theoretically and empirically studied in many contexts. Despite its vital role in security-critical scenarios, the adversarial robustness of the GDA model remains unexplored. In this paper, we adopt the effective gradual self-training method and replace vanilla self-training with adversarial self-training (AST). AST first predicts labels on the unlabeled data and then adversarially trains the model on the pseudo-labeled distribution. Intriguingly, we find that gradual AST improves not only adversarial accuracy but also clean accuracy on the target domain. We reveal that this is because adversarial training (AT) performs better than standard training when the pseudo-labels contain a portion of incorrect labels. Accordingly, we first present the generalization error bounds for gradual AST in a multiclass classification setting. We then use the optimal value of the Subset Sum Problem to bridge the standard error on a real distribution and the adversarial error on a pseudo-labeled distribution. The result indicates that AT may obtain a tighter bound than standard training on data with incorrect pseudo-labels. We further present an example of a conditional Gaussian distribution to provide more insights into why gradual AST can improve the clean accuracy for GDA. © 2023 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deep Imputation Bi-stochastic Graph Regularized Matrix Factorization for Clustering Single-cell RNA-sequencing Data

引用

IEEE/ACM Transactions on Computational Biology and Bioinformatics 2024年 PP卷 1-11页

作者： Lan, Wei Chen, Jianwei Liu, Mingyang Chen, Qingfeng Liu, Jin Wang, Jianxin Chen, Yi-Ping Phoebe Wei Lan is School of Computer Electronic and Information and Guangxi Key Laboratory of Multimedia Communications and Network Technology Guangxi University Nanning Guangxi China School of Computer Electronic and Information Guangxi University Nanning Guangxi China School of Computer Electronic and Information and State Key Laboratory for Conservation and Utilization of Subtropical Agro-bioresources Guangxi University Nanning Guangxi China Hunan Provincial Key Lab on Bioinformatics School of Computer Science and Engineering Central South University Changsha Hunan China Department of Computer Science and Information Technology La Trobe University Melbourne Victoria Australia

By generating massive gene transcriptome data and analyzing transcriptomic variations at the cell level, single-cell RNA-sequencing (scRNA-seq) technology has provided new way to explore cellular heterogeneity and functionality. Clustering scRNA-seq data could discover the hidden diversity and complexity of cell populations, which can aid to the identification of the disease mechanisms and biomarkers. In this paper, a novel method (DSINMF) is presented for single cell RNA sequencing data by using deep matrix factorization. Our proposed method comprises four steps: first, the feature selection is utilized to remove irrelevant features. Then, the dropout imputation is used to handle missing value problem. Further, the dimension reduction is employed to preserve data characteristics and reduce noise effects. Finally, the deep matrix factorization with bi-stochastic graph regularization is used to obtain cluster results from scRNA-seq data. We compare DSINMF with other state-of-the-art algorithms on nine datasets and the results show our method outperformances than other methods. IEEE

关键词： RNA

来源：评论

学校读者我要写书评

暂无评论

Cycle Self-Refinement for Multi-Source Domain Adaptation 38

Cycle Self-Refinement for Multi-Source Domain Adaptation

引用

38th AAAI Conference on Artificial Intelligence, AAAI 2024

作者： Zhou, Chaoyang Wang, Zengmao Du, Bo Luo, Yong School of Computer Science Wuhan University China National Engineering Research Center for Multimedia Software Wuhan University China Institute of Artificial Intelligence Wuhan University China Key Laboratory of Multimedia and Network Communication Engineering Wuhan University China Hubei Luojia Laboratory China

ISBN: (纸本)1577358872

Multi-source domain adaptation (MSDA) aims to transfer knowledge from multiple source domains to the unlabeled target domain. In this paper, we propose a cycle self-refinement domain adaptation method, which progressively attempts to learn the dominant transferable knowledge in each source domain in a cycle manner. Specifically, several source-specific networks and a domain-ensemble network are adopted in the proposed method. The source-specific networks are adopted to provide the dominant transferable knowledge in each source domain for instance-level ensemble on predictions of the samples in target domain. Then these samples with high-confidence ensemble predictions are adopted to refine the domain-ensemble network. Meanwhile, to guide each source-specific network to learn more dominant transferable knowledge, we force the features of the target domain from the domain-ensemble network and the features of each source domain from the corresponding source-specific network to be aligned with their predictions from the corresponding networks. Thus the adaptation ability of source-specific networks and the domain-ensemble network can be improved progressively. Extensive experiments on Office-31, Office-Home and DomainNet show that the proposed method outperforms the state-of-the-art methods for most tasks. Copyright © 2024, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Multi-Keyword Fuzzy Adjacency Search Strategy for Encrypted Graph in Cloud Environment

引用

computers, Materials & Continua 2024年第3期78卷 3177-3194页

作者： Bin Wu Xianyi Chen Jinzhou Huang Caicai Zhang Jing Wang Jing Yu Zhiqiang Zhao Zhuolin Mei School of Computer and Big Data Science Jiujiang UniversityJiujiang332005China Jiujiang Key Laboratory of Network and Information Security Jiujiang332005China School of Computer and Software Nanjing University of Information Science&TechnologyNanjing210044China School of Computer Engineering Hubei University of Arts and ScienceXiangyang441053China School of Modern Information Technology Zhejiang Institute of Mechanical and Electrical EngineeringHangzhou310053China Information Center Jiangxi Changjiang Chemical Co.Ltd.Jiujiang332005China School of Mathematics and Computer Science Ningxia Normal UniversityGuyuan756099China

In a cloud environment,outsourced graph data is widely used in companies,enterprises,medical institutions,and so *** owners and users can save costs and improve efficiency by storing large amounts of graph data on cloud *** on cloud platforms usually have some subjective or objective attacks,which make the outsourced graph data in an insecure *** issue of privacy data protection has become an important obstacle to data sharing and *** to query outsourcing graph data safely and effectively has become the focus of *** query is a basic and frequently used operation in graph,and it will effectively promote the query range and query ability if multi-keyword fuzzy search can be supported at the same *** work proposes to protect the privacy information of outsourcing graph data by encryption,mainly studies the problem of multi-keyword fuzzy adjacency query,and puts forward a *** our scheme,we use the Bloom filter and encryption mechanism to build a secure index and query token,and adjacency queries are implemented through indexes and query tokens on the cloud *** proposed scheme is proved by formal analysis,and the performance and effectiveness of the scheme are illustrated by experimental *** research results of this work will provide solid theoretical and technical support for the further popularization and application of encrypted graph data processing technology.

关键词： Privacy-preserving adjacency query multi-keyword fuzzy search encrypted graph

来源：评论

学校读者我要写书评

暂无评论

Zero-Shot Event-Intensity Asymmetric Stereo via Visual Prompting from Image Domain 38

Zero-Shot Event-Intensity Asymmetric Stereo via Visual Promp...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Lou, Hanyue Liang, Jinxiu Teng, Minggui Fan, Bin Xu, Yong Shi, Boxin State Key Laboratory of Multimedia Information Processing School of Computer Science Peking University China National Engineering Research Center of Visual Technology School of Computer Science Peking University China National Key Laboratory of General AI School of Intelligence Science and Technology Peking University China School of Computer Science and Engineering South China University of Technology China

Event-intensity asymmetric stereo systems have emerged as a promising approach for robust 3D perception in dynamic and challenging environments by integrating event cameras with frame-based sensors in different views. However, existing methods often suffer from overfitting and poor generalization due to limited dataset sizes and lack of scene diversity in the event domain. To address these issues, we propose a zero-shot framework that utilizes monocular depth estimation and stereo matching models pretrained on diverse image datasets. Our approach introduces a visual prompting technique to align the representations of frames and events, allowing the use of off-the-shelf stereo models without additional training. Furthermore, we introduce a monocular cue-guided disparity refinement module to improve robustness across static and dynamic regions by incorporating monocular depth information from foundation models. Extensive experiments on real-world datasets demonstrate the superior zero-shot evaluation performance and enhanced generalization ability of our method compared to existing approaches. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Region-adaptive Concept Aggregation for Few-shot Visual Recognition

引用

Machine Intelligence Research 2023年第4期20卷 554-568页

作者： Mengya Han Yibing Zhan Baosheng Yu Yong Luo Han Hu Bo Du Yonggang Wen Dacheng Tao School of Computer Science National Engineering Research Center for Multimedia SoftwareWuhan UniversityWuhan430072China Hubei Luojia Laboratory Wuhan430072China School of Computer Science The University of SydneySydney2006Australia JD Explore Academy Beijing101116China School of Information and Electronics Beijing Institute of TechnologyBeijing100081China School of Computer Science and Engineering Nanyang Technological UniversitySingapore639798Singapore

Few-shot learning (FSL) aims to learn novel concepts from very limited examples. However, most FSL methods suffer from the issue of lacking robustness in concept learning. Specifically, existing FSL methods usually ignore the diversity of region contents that may contain concept-irrelevant information such as the background, which would introduce bias/noise and degrade the performance of conceptual representation learning. To address the above-mentioned issue, we propose a novel metric-based FSL method termed region-adaptive concept aggregation network or RCA-Net. Specifically, we devise a region-adaptive concept aggregator (RCA) to model the relationships of different regions and capture the conceptual information in different regions, which are then integrated in a weighted average manner to obtain the conceptual representation. Consequently, robust concept learning can be achieved by focusing more on the concept-relevant information and less on the conceptual-irrelevant information. We perform extensive experiments on three popular visual recognition benchmarks to demonstrate the superiority of RCA-Net for robust few-shot learning. In particular, on the Caltech-UCSD Birds-200-2011 (CUB200) dataset, the proposed RCA-Net significantly improves 1-shot accuracy from 74.76% to 78.03% and 5-shot accuracy from 86.84% to 89.83% compared with the most competitive counterpart.

关键词： Few-shot learning metric-based meta learning concept learning region-adaptive concept-aggregation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：