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

A Novel YJQR-LSTM Model for Nonparametric Probabilistic Sustainable Agriculture Wind Power Forecasting Based on intelligent IoT

引用

IEEE Internet of Things Journal 2024年

作者： Wang, Jie Jiang, Junhui Chen, Xinlong Cai, Defu Wu, Yue Lu, Renzhi School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Harbin Engineering University College of Computer Science and Technology Harbin150001 China State Grid Hubei Electric Power Research Institute Hubei Wuhan430079 China School of Technology State Key Laboratory of Efficient Production of Forest Resources Key Laboratory of National Forestry and Grassland Administration on Forestry Equipment and Automation Beijing Forestry University Beijing100083 China Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Industrial Internet of Things and Networked Control Ministry of Education Chongqing400065 China State Key Laboratory of Mechanical Transmission for Advanced Equipment Chongqing University Chongqing400044 China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan430074 China

Energy costs associated with the consumption of non-renewable energy sources have become an important issue in improving the international competitiveness of agriculture. Wind power, as a renewable energy source, can replace non-renewable energy sources to reduce energy costs and improve the sustainability of agricultural. However, the inherent intermittency, randomness, and volatility within weather conditions and wind speed presents a substantial challenge in accurately predicting wind power generation. This work proposes a novel YJQR-LSTM algorithm that leverages Yeo-Johnson quantile regression (YJQR) with a long short-term memory (LSTM) network for nonparametric probabilistic forecasting of wind power generation via the intelligent Internet of Things. First, an improved YJQR model based on the YJ transformation is designed to obtain a more precise characterization of wind uncertainty, providing a more flexible probability density function for wind power generation. Then, utilizing the unique structure of the LSTM network to learn the parameters of the YJQR model, temporal features can be extracted from time series data. To mitigate the impact of outliers in the raw data on accuracy and improve computational efficiency, a novel logarithmic likelihood function is developed as the loss function utilized in the training phase. The effectiveness of the proposed algorithm is validated using a real-world dataset from five wind farms from the Global Energy Forecasting Competition. Numerical results demonstrate that the algorithm provides more accurate wind power prediction results in complex wind power data environments, which is important for making full use of wind energy and thus reducing the consumption of non-renewable energy in agriculture. © 2024 IEEE.

关键词： Wind forecasting

来源：评论

学校读者我要写书评

暂无评论

NeRF in Robotics: A Survey

arXiv

引用

arXiv 2024年

作者： Wang, Guangming Pan, Lei Peng, Songyou Liu, Shaohui Xu, Chenfeng Miao, Yanzi Zhan, Wei Tomizuka, Masayoshi Pollefeys, Marc Wang, Hesheng The University of Cambridge ETH Zurich Switzerland The Department of Automation Shanghai Jiao Tong University Shanghai200240 China The Key Laboratory of System Control and Information Processing Ministry of Education of China China Engineering Research Center of Intelligent Control for Underground Space Ministry of Education School of Information and Control Engineering Advanced Robotics Research Center China University of Mining and Technology Xuzhou221116 China ETH Zurich Zurich Switzerland Mechanical Systems Control Laboratory University of California Berkeley United States

Meticulous 3D environment representations have been a longstanding goal in computer vision and robotics fields. The recent emergence of neural implicit representations has introduced radical innovation to this field as implicit representations enable numerous capabilities. Among these, the Neural Radiance Field (NeRF) has sparked a trend because of the huge representational advantages, such as simplified mathematical models, compact environment storage, and continuous scene representations. Apart from computer vision, NeRF has also shown tremendous potential in the field of robotics. Thus, we create this survey to provide a comprehensive understanding of NeRF in the field of robotics. By exploring the advantages and limitations of NeRF, as well as its current applications and future potential, we hope to shed light on this promising area of research. Our survey is divided into two main sections: The Application of NeRF in Robotics and The Advance of NeRF in Robotics, from the perspective of how NeRF enters the field of robotics. In the first section, we introduce and analyze some works that have been or could be used in the field of robotics from the perception and interaction perspectives. In the second section, we show some works related to improving NeRF's own properties, which are essential for deploying NeRF in the field of robotics. In the discussion section of the review, we summarize the existing challenges and provide some valuable future research directions for reference. © 2024, CC BY-NC-ND.

关键词： Robotics

来源：评论

学校读者我要写书评

暂无评论

Optimal Fault Detection Observer Design using Excluding Degree

Optimal Fault Detection Observer Design using Excluding Degr...

引用

IEEE Conference on Decision and control

作者： Feng Xu Yiming Wan Ye Wang Division of Information Science and Technology Shenzhen International Graduate School Tsinghua University Shenzhen P.R. China School of Artificial Intelligence and Automation Huazhong University of Science and Technology and Key Laboratory of Image Processing and Intelligent Control Ministry of Education Wuhan P.R. China Department of Electrical and Electronic Engineering The University of Melbourne Parkville VIC Australia

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

This paper proposes a novel optimal gain design method for robust fault detection using set-valued observers. First, a new fault detection performance specification is proposed for set-valued observers based on a new notion named the excluding degree of the origin from a zonotope. Second, a fractional programming problem is formulated to describe fault detection optimality of set-valued observers. Third, optimal fault detection gains are obtained by solving the fractional programming problem. Finally, numerical examples are used to illustrate the effectiveness of the proposed method.

关键词： Fault detection Design methodology Observers Programming Computational complexity Optimization Numerical stability

来源：评论

学校读者我要写书评

暂无评论

Hierarchical P systems with randomized right-hand sides of rules 18th

Hierarchical P systems with randomized right-hand sides of r...

引用

18th International Conference on Membrane Computing, CMC 1018

作者： Alhazov, Artiom Freund, Rudolf Ivanov, Sergiu Institute of Mathematics and Computer Science Academy of Sciences of Moldova Academiei 5 Chişinău2028 Moldova Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Automation Huazhong University of Science and Technology Wuhan430074 China Faculty of Informatics TU Wien Favoritenstraße 9–11 Vienna1040 Austria LACL Université Paris Est – Créteil Val de Marne 61 av. Général de Gaulle Créteil94010 France TIMC-IMAG/DyCTiM Faculty of Medicine of Grenoble 5 avenue du Grand Sablon La Tronche38700 France

ISBN: (纸本)9783319733586

P systems are a model of hierarchically compartmentalized multiset rewriting. We introduce a novel kind of P systems in which rules are dynamically constructed in each step by non-deterministic pairing of left-hand and right-hand sides. We define three variants of right-hand side randomization and compare each of them with the power of conventional P systems. It turns out that all three variants enable non-cooperative P systems to generate exponential (and thus non-semi-linear) number languages. We also give a binary normal form for one of the variants of P systems with randomized rule right-hand sides. © 2018, Springer International Publishing AG.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

Learning data-adaptive nonparametric kernels

arXiv

引用

arXiv 2018年

作者： Liu, Fanghui Huang, Xiaolin Gong, Chen Yang, Jie Li, Li Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Department of Automation Tsinghua University

Kernel methods have been extensively used in a variety of machine learning tasks such as classification, clustering, and dimensionality reduction. For complicated practical tasks, the traditional kernels, e.g., Gaussian kernel and sigmoid kernel, or their combinations are often not sufficiently flexible to fit the data. In this paper, we present a Data-Adaptive Nonparametric Kernel (DANK) learning framework in a data-driven manner. To be specific, in model formulation, we impose an adaptive matrix on the kernel/Gram matrix in an entry-wise strategy. Since we do not specify the formulation of the adaptive matrix, each entry in the adaptive matrix can be directly and flexibly learned from the data. Therefore, the solution space of the learned kernel is largely expanded, which makes our DANK model flexible to capture the data with different local statistical properties. Specifically, the proposed kernel learning framework can be seamlessly embedded to support vector machines (SVM) and support vector regression (SVR), which has the capability of enlarging the margin between classes and reducing the model generalization error. Theoretically, we demonstrate that the objective function of our DANK model embedded in SVM/SVR is gradient-Lipschitz continuous. Thereby, the training process for kernel and parameter learning in SVM/SVR can be efficiently optimized in a unified framework. Further, to address the scalability issue in nonparametric kernel learning framework, we decompose the entire optimization problem in DANK into several smaller easy-to-solve problems, so that our DANK model can be efficiently approximated by this partition. The effectiveness of this approximation is demonstrated by both empirical studies and theoretical guarantees. Experimentally, the proposed DANK model embedded in SVM/SVR achieves encouraging performance on various classification and regression benchmark datasets when compared with other representative kernel learning based algorithms. Copyrig

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Multi-level graph convolutional network with automatic graph learning for hyperspectral image classification

arXiv

引用

arXiv 2020年

作者： Wan, Sheng Gong, Chen Pan, Shirui Yang, Jie Yang, Jian PCA Lab Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Jiangsu Key Laboratory of Image Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai200240 China Faculty of Information Technology Monash University ClaytonVIC3800 Australia

Nowadays, deep learning methods, especially the Graph Convolutional Network (GCN), have shown impressive performance in hyperspectral image (HSI) classification. However, the current GCN-based methods treat graph construction and image classification as two separate tasks, which often results in suboptimal performance. Another defect of these methods is that they mainly focus on modeling the local pairwise importance between graph nodes while lack the capability to capture the global contextual information of HSI. In this paper, we propose a Multi-level GCN with Automatic Graph Learning method (MGCN-AGL) for HSI classification, which can automatically learn the graph information at both local and global levels. By employing attention mechanism to characterize the importance among spatially neighboring regions, the most relevant information can be adaptively incorporated to make decisions, which helps encode the spatial context to form the graph information at local level. Moreover, we utilize multiple pathways for local-level graph convolution, in order to leverage the merits from the diverse spatial context of HSI and to enhance the expressive power of the generated representations. To reconstruct the global contextual relations, our MGCN-AGL encodes the long range dependencies among image regions based on the expressive representations that have been produced at local level. Then inference can be performed along the reconstructed graph edges connecting faraway regions. Finally, the multi-level information is adaptively fused to generate the network output. In this means, the graph learning and image classification can be integrated into a unified framework and benefit each other. Extensive experiments have been conducted on three real-world hyperspectral datasets, which are shown to outperform the state-of-the-art methods. Copyright © 2020, The Authors. All rights reserved.

关键词： image classification

来源：评论

学校读者我要写书评

暂无评论

Asynchronous Decentralized Federated Learning for Collaborative Fault Diagnosis of PV Stations

arXiv

引用

arXiv 2022年

作者： Liu, Qi Yang, Bo Wang, Zhaojian Zhu, Dafeng Wang, Xinyi Ma, Kai Guan, Xinping The Department of Automation Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China School of Electrical Engineering Yanshan University Qinhuangdao066004 China

Due to the different losses caused by various photovoltaic (PV) array faults, accurate diagnosis of fault types is becoming increasingly important. Compared with a single one, multiple PV stations collect sufficient fault samples, but their data is not allowed to be shared directly due to potential conflicts of interest. Therefore, federated learning can be exploited to train a collaborative fault diagnosis model. However, the modeling efficiency is seriously affected by the model update mechanism since each PV station has a different computing capability and amount of data. Moreover, for the safe and stable operation of the PV system, the robustness of collaborative modeling must be guaranteed rather than simply being processed on a central server. To address these challenges, a novel asynchronous decentralized federated learning (ADFL) framework is proposed. Each PV station not only trains its local model but also participates in collaborative fault diagnosis by exchanging model parameters to improve the generalization without losing accuracy. The global model is aggregated distributedly to avoid central node failure. By designing the asynchronous update scheme, the communication overhead and training time are greatly reduced. Both the experiments and numerical simulations are carried out to verify the effectiveness of the proposed method. © 2022, CC BY.

关键词： Failure analysis

来源：评论

学校读者我要写书评

暂无评论

Extended NNs-Based Adaptive Event-Triggered Asymptotic control for Nonlinear Systems Against Actuator Faults

Extended NNs-Based Adaptive Event-Triggered Asymptotic Contr...

引用

International Symposium on Autonomous Systems (ISAS)

作者： Shanlin Liu Yingwei Zhang Xudong Zhao Hesheng Wang College of Information Science and Engineering Northeastern University Shenyang China State Laboratory of Synthesis Automation of Process Industry Northeastern University Shenyang China Faculty of Electronic Information and Electrical Engineering Dalian University of Technology Dalian China Department of Automation Key Laboratory of System Control and Information Processing of Ministry of Education Key Laboratory of Marine Intelligent Equipment and System of Ministry of Education Shanghai Engineering Research Center of IntelligentControl and Management Shanghai Jiao Tong University Shanghai China

ISBN: (数字)9798350363173

ISBN: (纸本)9798350363180

In this article, an adaptive event-triggered asymp¬totically fault-tolerant control (FTC) issue for nonlinear systems with actuator faults is investigated. An extended neural networks (NNs) technique is introduced to estimate unknown functions of the system under consideration. Compared with traditional NNs that ignore approximation errors, the proposed extended NNs further processes approximation errors, reducing the conservatism of the proposed algorithm. Then, within the framework of backstepping method, a new adaptive control strategy is developed by combining event-triggered mechanism (ETM) and bound estimation (BE) approach, which ensures the asymptotic convergence of system states while also reducing the transmission of unnecessary information, thus improving the utilization of communication resources. At the same time, the designed controller eliminates the adverse effects of actuator failures and system nonlinear terms. Finally, a simulation example of a single-link robot system is provided to demonstrate that the developed control strategy can ensure that all signals are bounded and system states are asymptotically convergent.

关键词： Actuators Backstepping Fault tolerant systems Process control Artificial neural networks control systems Approximation error

来源：评论

学校读者我要写书评

暂无评论

Online Attentive Kernel-Based Temporal Difference Learning

arXiv

引用

arXiv 2022年

作者： Yang, Guang Chen, Xingguo Yang, Shangdong Wang, Huihui Dong, Shaokang Gao, Yang The the Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications National Engineering Laboratory for Agri-Product Quality Traceability Beijing Technology and Business University China The State Key Laboratory for Novel Software Technology Nanjing University China The PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology China

With rising uncertainty in the real world, online Reinforcement Learning (RL) has been receiving increasing attention due to its fast learning capability and improving data efficiency. However, online RL often suffers from complex Value Function Approximation (VFA) and catastrophic interference, creating difficulty for the deep neural network to be applied to an online RL algorithm in a fully online setting. Therefore, a simpler and more adaptive approach is introduced to evaluate value function with the kernel-based model. Sparse representations are superior at handling interference, indicating that competitive sparse representations should be learnable, non-prior, non-truncated and explicit when compared with current sparse representation methods. Moreover, in learning sparse representations, attention mechanisms are utilized to represent the degree of sparsification, and a smooth attentive function is introduced into the kernel-based VFA. In this paper, we propose an Online Attentive Kernel-Based Temporal Difference (OAKTD) algorithm using two-timescale optimization and provide convergence analysis of our proposed algorithm. Experimental evaluations showed that OAKTD outperformed several Online Kernel-based Temporal Difference (OKTD) learning algorithms in addition to the Temporal Difference (TD) learning algorithm with Tile Coding on public Mountain Car, Acrobot, CartPole and Puddle World tasks. Copyright © 2022, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Utility-Oriented Underwater image Quality Assessment Based on Transfer Learning

arXiv

引用

arXiv 2022年

作者： Chen, Weiling Lin, Rongfu Liao, Honggang Zhao, Tiesong Gu, Ke Le Callet, Patrick Fujian Key Lab for Intelligent Processing and Wireless Transmission of Media Information Fuzhou University Fuzhou350108 China Peng Cheng Laboratory Shenzhen518000 China The Faculty of Information Technology Beijing University of Technology Engineering Research Center of Intelligent Perception and Autonomous Control Ministry of Education Beijing Key Laboratory of Computational Intelligence and Intelligent System Beijing Artificial Intelligence Institute Beijing100124 China Équipe Image Perception et Interaction Laboratoire des Sciences du Numérique de Nantes Université de Nantes France

The widespread image applications have greatly promoted the vision-based tasks, in which the image Quality Assessment (IQA) technique has become an increasingly significant issue. For user enjoyment in multimedia systems, the IQA exploits image fidelity and aesthetics to characterize user experience;while for other tasks such as popular object recognition, there exists a low correlation between utilities and perceptions. In such cases, the fidelity-based and aesthetics-based IQA methods cannot be directly applied. To address this issue, this paper proposes a utility-oriented IQA in object recognition. In particular, we initialize our research in the scenario of underwater fish detection, which is a critical task that has not yet been perfectly addressed. Based on this task, we build an Underwater image Utility Database (UIUD) and a learning-based Underwater image Utility Measure (UIUM). Inspired by the top-down design of fidelity-based IQA, we exploit the deep models of object recognition and transfer their features to our UIUM. Experiments validate that the proposed transfer-learning-based UIUM achieves promising performance in the recognition task. We envision our research provides insights to bridge the researches of IQA and computer vision. Copyright © 2022, The Authors. All rights reserved.

关键词： Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：