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

A Novel Method for Precipitation Nowcasting Based on ST-LSTM

computers, Materials & Continua 2022年第9期72卷 4867-4877页

作者： Wei Fang Liang Shen Victor S.Sheng Qiongying Xue School of Computer&Software Engineering Research Center of Digital ForensicsMinistry of EducationNanjing University of Information Science&TechnologyNanjing210044China State Key Laboratory of Severe Weather Chinese Academy of Meteorological SciencesBeijing100081China Department of Computer Texas Tech UniversityLubbockTX79409USA

Precipitation nowcasting is of great significance for severe convective weather *** echo extrapolation is a commonly used precipitation nowcasting ***,the traditional radar echo extrapolation methods are encountered with the dilemma of low prediction accuracy and extrapolation *** reason is that those methods cannot retain important long-term information and fail to capture short-term motion information from the long-range data *** order to solve the above problems,we select the spatiotemporal long short-term memory(ST-LSTM)as the recurrent unit of the model and integrate the 3D convolution operation in it to strengthen the model’s ability to capture short-term motion information which plays a vital role in the prediction of radar echo motion *** the purpose of enhancing the model’s ability to retain long-term important information,we also introduce the channel attention mechanism to achieve this *** the experiment,the training and testing datasets are constructed using radar data of Shanghai,we compare our model with three benchmark models under the reflectance thresholds of 15 and *** results demonstrate that the proposed model outperforms the three benchmark models in radar echo extrapolation task,which obtains a higher accuracy rate and improves the clarity of the extrapolated image.

关键词： Precipitation nowcasting radar echo extrapolation ST-LSTM attention mechanism

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

AUTOMATICALLY ADJUSTABLE MULTI-SCALE FEATURE EXTRACTION FRAMEWORK FOR HYPERSPECTRAL IMAGE CLASSIFICATION

AUTOMATICALLY ADJUSTABLE MULTI-SCALE FEATURE EXTRACTION FRAM...

引用

2021 IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2021

作者： Yang, Jiaqi Du, Bo Wu, Chen Zhang, Liangpei State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing Wuhan University Wuhan430079 China National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence School of Computer Science Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University Wuhan430072 China

Recently, deep learning-based methods have shown the great potential in hyperspectral image (HSI) classification. Nevertheless, feature extraction by convolutional neural network (CNN) is often performed on only one scale, resulting in multi-scale information loss. To address this problem, in this paper, we propose an automatically adjustable multi-scale feature extraction framework (A2MFE-Framework) for hyperspectral classification, including a scale reference network and two scale transformation networks. With the well-designed architecture, A2MFE-Framework can not only extract multi-scale features, but also automatically change the network structure to match input features of different scales. Experimental results on two benchmark HSI datasets demonstrate that the A2MFE-Framework can better capture multi-scale features of different objects via an automatically adjustable feature extraction framework with higher classification accuracy compared with previous methods. ©2021 IEEE

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

The Reliability of OKRidge Method in Solving Sparse Ridge Regression Problems 38

The Reliability of OKRidge Method in Solving Sparse Ridge Re...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Li, Xiyuan Wang, Youjun 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

Sparse ridge regression problems play a significant role across various domains. To solve sparse ridge regression, [1] recently proposes an advanced algorithm, Scalable Optimal K-Sparse Ridge Regression (OKRidge), which is both faster and more accurate than existing approaches. However, the absence of theoretical analysis on the error of OKRidge impedes its large-scale applications. In this paper, we reframe the estimation error of OKRidge as a Primary Optimization (PO) problem and employ the Convex Gaussian min-max theorem (CGMT) to simplify the PO problem into an Auxiliary Optimization (AO) problem. Subsequently, we provide a theoretical error analysis for OKRidge based on the AO problem. This error analysis improves the theoretical reliability of OKRidge. We also conduct experiments to verify our theorems and the results are in excellent agreement with our theoretical findings. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Boosting-Type Convergence Result for *** with Factorized Multi-Class Classifiers 38

A Boosting-Type Convergence Result for *** with Factorized M...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Zou, Xin Zhou, Zhengyu Xu, Jingyuan 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

ADABOOST is a well-known algorithm in boosting. Schapire and Singer propose, an extension of ADABOOST, named ***, for multi-class classification problems. Kégl shows empirically that *** works better when the classical one-against-all base classifiers are replaced by factorized base classifiers containing a binary classifier and a vote (or code) vector. However, the factorization makes it much more difficult to provide a convergence result for the factorized version of ***. Then, Kégl raises an open problem in COLT 2014 to look for a convergence result for the factorized ***. In this work, we resolve this open problem by presenting a convergence result for *** with factorized multi-class classifiers. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Relaying Strategy Based on Estimated Information for Multi-Antenna Cooperative networks

引用

China Communications 2017年第8期14卷 157-165页

作者： Shuangshuang Han Peng Zhang Feijin Shi Fei-Yue Wang The State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of SciencesBeijingChina and Qingdao Academy of Intelligent Industries School of Computer Engineering Weifang University Communications Headquarters Ministry of Foreign Affairs of the People's Republic of China State Key Laboratory of Management and Control for Complex Systems Institute of AutomationChinese Academy of SciencesBeijingChina and Research Center of Computational Experiments and Parallel SystemsThe National University of Defense Technology

A sphere-based list forwarding scheme for multiple-input multiple-output(MIMO) relay networks is proposed and analyzed. Firstly, an estimate forwarding(EF) method is proposed, which forwards the minimum mean squared error(MMSE) estimate of the source data to the destination. Since it performs like amplify-and-forward(AF) and decode-and-forward(DF) for the low and high signal-to-noise ratio(SNR) regions, respectively, the EF relay thus outperforms conventional AF and DF across all SNRs without the need for switching algorithms for different SNRs. Because computational complexity is however high for relays with a large number of antennas(large MIMO) and/or high order constellations, list EF for large MIMO relay networks is proposed. It computes a list sphere decoder based MMSE estimate and retains the advantages of the exact EF relay at a negligible performance loss. The proposed list EF could offer a flexible trade-off between the performance and computational complexity.

关键词： MIMO system cooperative network soft information

来源：评论

学校读者我要写书评

暂无评论

DeePMD-kit v3: A Multiple-Backend Framework for Machine Learning Potentials

arXiv

引用

arXiv 2025年

作者： Zeng, Jinzhe Zhang, Duo Peng, Anyang Zhang, Xiangyu He, Sensen Wang, Yan Liu, Xinzijian Bi, Hangrui Li, Yifan Cai, Chun Zhang, Chengqian Du, Yiming Zhu, Jia-Xin Mo, Pinghui Huang, Zhengtao Zeng, Qiyu Shi, Shaochen Qin, Xuejian Yu, Zhaoxi Luo, Chenxing Ding, Ye Liu, Yun-Pei Shi, Ruosong Wang, Zhenyu Bore, Sigbjørn Løland Chang, Junhan Deng, Zhe Ding, Zhaohan Han, Siyuan Jiang, Wanrun Ke, Guolin Liu, Zhaoqing Lu, Denghui Muraoka, Koki Oliaei, Hananeh Singh, Anurag Kumar Que, Haohui Xu, Weihong Xu, Zhangmancang Zhuang, Yong-Bin Dai, Jiayu Giese, Timothy J. Jia, Weile Xu, Ben York, Darrin M. Zhang, Linfeng Wang, Han School of Artificial Intelligence and Data Science Unversity of Science and Technology of China Hefei China AI for Science Institute Beijing100080 China DP Technology Beijing100080 China Academy for Advanced Interdisciplinary Studies Peking University Beijing100871 China State Key Lab of Processors Institute of Computing Technology Chinese Academy of Sciences Beijing100871 China University of Chinese Academy of Sciences Beijing China Baidu Inc. Beijing China Department of Computer Science University of Toronto TorontoON Canada Department of Chemistry Princeton University PrincetonNJ08540 United States University of Chinese Academy of Sciences Beijing100871 China State Key Laboratory of Physical Chemistry of Solid Surfaces iChEM College of Chemistry and Chemical Engineering Xiamen University Xiamen361005 China College of Integrated Circuits Hunan University Changsha410082 China State Key Laboratory of Advanced Technology for Materials Synthesis and Processing Center for Smart Materials and Device Integration School of Material Science and Engineering Wuhan University of Technology Wuhan430070 China College of Science National University of Defense Technology Changsha410073 China Hunan Key Laboratory of Extreme Matter and Applications National University of Defense Technology Changsha410073 China ByteDance Research Beijing100098 China Ningbo Institute of Materials Technology and Engineering Chinese Academy of Sciences Ningbo315201 China College of Materials Science and Opto-Electronic Technology University of Chinese Academy of Sciences Beijing100049 China Key Laboratory of Theoretical and Computational Photochemistry of Ministry of Education College of Chemistry Beijing Normal University Beijing100875 China Department of Geosciences Princeton University PrincetonNJ08544 United States Department of Applied Physics and Applied Mathematics Columbia University New YorkNY10027 United States IKKEM Fujian Xiamen361005 China Graduate

In recent years, machine learning potentials (MLPs) have become indispensable tools in physics, chemistry, and materials science, driving the development of software packages for molecular dynamics (MD) simulations and related applications. These packages, typically built on specific machine learning frameworks such as TensorFlow, PyTorch, or JAX, face integration challenges when advanced applications demand communication across different frameworks. The previous TensorFlow-based implementation of DeePMD-kit exemplified these limitations. In this work, we introduce DeePMD-kit version 3, a significant update featuring a multi-backend framework that supports TensorFlow, PyTorch, JAX, and PaddlePaddle backends, and demonstrate the versatility of this architecture through the integration of other MLPs packages and of Differentiable Molecular Force Field. This architecture allows seamless backend switching with minimal modifications, enabling users and developers to integrate DeePMD-kit with other packages using different machine learning frameworks. This innovation facilitates the development of more complex and interoperable workflows, paving the way for broader applications of MLPs in scientific research. Copyright © 2025, The Authors. All rights reserved.

关键词： Molecular dynamics

来源：评论

学校读者我要写书评

暂无评论

An Approach to Locating Delayed Activities in software Processes

引用

International Journal of Automation and computing 2018年第1期15卷 115-124页

作者： Yun-Zhi Jin Hua Zhou Hong-Ji Yang Si-Jing Zhang Ji-Dong Ge School of Software Yunnan University Kunming 650091 China Key Laboratory for Software Engineering of Yunnan Province Kunming 650000 China Research Center of Cloud Computing of Yunnan Province Kunming 650000 China Centre for Creative Computing Bath Spa University Corsham SN13 0BZ UK Department of Computer Science and Technology University of Bedfordshire LU13JU UK State Key Laboratory for Novel Software Technology Software Institute Nanjing University Nanjing 210093 China

Activity is now playing a vital role in software processes. To ensure the high-level efficiency of software processes, a key point is to locate those activities that own bigger resource occupation probabilities with respect to average execution time, called delayed activities, and then improve them. To this end, we firstly propose an approach to locating delayed activities in software processes. Furthermore, we present a case study, which exhibits the high-level efficiency of the approach, to concretely illustrate this new solution. Some beneficial analysis and reasonable modification are developed in the end.

关键词： Locating of the delayed activities software process stochastic Petri-nets Markov random fields metrics.

来源：评论

学校读者我要写书评

暂无评论

Parallel Planning:A New Motion Planning Framework for Autonomous Driving

引用

IEEE/CAA Journal of Automatica Sinica 2019年第1期6卷 236-246页

作者： Long Chen Xuemin Hu Wei Tian Hong Wang Dongpu Cao Fei-Yue Wang IEEE School of Data and Computer Science Sun Yat-sen University the School of Computer Science and Information Engineering Hubei University Institute of Measurement and Control Systems Karlsruhe Institute of Technology Department of Mechanical and Mechatronics Engineering University of Waterloo the State Key Laboratory of Management and Control for Complex Systems.Institute of Automation Chinese Academy of Sciences the Research Center for Military Computational Experiments and Parallel Systems Technology National University of Defense Technology

Motion planning is one of the most significant technologies for autonomous driving. To make motion planning models able to learn from the environment and to deal with emergency situations, a new motion planning framework called as"parallel planning" is proposed in this paper. In order to generate sufficient and various training samples, artificial traffic scenes are firstly constructed based on the knowledge from the reality.A deep planning model which combines a convolutional neural network(CNN) with the Long Short-Term Memory module(LSTM) is developed to make planning decisions in an end-toend mode. This model can learn from both real and artificial traffic scenes and imitate the driving style of human ***, a parallel deep reinforcement learning approach is also presented to improve the robustness of planning model and reduce the error rate. To handle emergency situations, a hybrid generative model including a variational auto-encoder(VAE) and a generative adversarial network(GAN) is utilized to learn from virtual emergencies generated in artificial traffic scenes. While an autonomous vehicle is moving, the hybrid generative model generates multiple video clips in parallel, which correspond to different potential emergency scenarios. Simultaneously, the deep planning model makes planning decisions for both virtual and current real scenes. The final planning decision is determined by analysis of real observations. Leveraging the parallel planning approach, the planner is able to make rational decisions without heavy calculation burden when an emergency occurs.

关键词： Autonomous driving artificial traffic scene deep learning emergencies motion planning parallel planning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：