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

arXiv 2022年

作者： Jiang, Chaokang Wang, Guangming Wu, Jinxing Miao, Yanzi Wang, Hesheng 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 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 Intelligent Control and Management Shanghai Jiao Tong University Shanghai200240 China The Department of Engineering Mechanics Shanghai Jiao Tong University Shanghai200240 China

Promising complementarity exists between the texture features of color images and the geometric information of LiDAR point clouds. However, there still present many challenges for efficient and robust feature fusion in the field of 3D object detection. In this paper, first, unstructured 3D point clouds are filled in the 2D plane and 3D point cloud features are extracted faster using projection-aware convolution layers. Further, the corresponding indexes between different sensor signals are established in advance in the data preprocessing, which enables faster cross-modal feature fusion. To address LiDAR points and image pixels misalignment problems, two new plug- and-play fusion modules, LiCamFuse and BiLiCamFuse, are proposed. In LiCamFuse, soft query weights with perceiving the Euclidean distance of bimodal features are proposed. In BiLiCamFuse, the fusion module with dual attention is proposed to deeply correlate the geometric and textural features of the scene. The quantitative results on the KITTI dataset demonstrate that the proposed method achieves better feature-level fusion. In addition, the proposed network shows a shorter running time compared to existing methods. Copyright © 2022, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

A Performance-Based Model Recovery Anti-Windup Design for Linear Systems Subject to Actuator Saturation

A Performance-Based Model Recovery Anti-Windup Design for Li...

引用

American control Conference (ACC)

作者： Wenxin Lai Yuanlong Li Zongli Lin Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai China Charles L. Brown Department of Electrical and Computer Engineering University of Virginia Char-lottesville VA U.S.A.

ISBN: (数字)9798350382655

ISBN: (纸本)9798350382662

In this paper, we investigate the problem of reference tracking for a class of linear systems subject to actuator saturation and propose a performance-based model recovery anti-windup strategy. We adopt the classic model recovery anti-windup framework and regard the states or one of the outputs of the anti-windup compensator as the tracking error, by which the difference between the unconstrained system and the saturated system is quantified. Then, instead of employing the commonly used $\mathcal{L}_{2}$ gain, we present the prescribed performance functions (PPFs) to characterize the real-time tracking error such that the system performance can be captured more specifically. In particular, to avoid singular issues arising from the occurrence of saturation, we modify the existing PPFs with an auxiliary system when saturation occurs. Based on these modified performance functions, we follow a modified prescribed performance control approach and design the remaining output of the anti-windup compensator. Such a design procedure is constructive, making it more promising for extension to nonlinear systems. Theoretical results establish the boundedness of all signals in the closed-loop system. Simulation results verify the effectiveness of our design strategy.

关键词： Linear systems Actuators Simulation System performance Stability analysis Real-time systems Trajectory

来源：评论

学校读者我要写书评

暂无评论

Incremental Online Learning of Randomized Neural Network with Forward Regularization

arXiv

引用

arXiv 2024年

作者： Wang, Junda Hu, Minghui Li, Ning Al-Ali, Abdulaziz Suganthan, Ponnuthurai Nagaratnam The Key Laboratory of System Control and Information Processing Ministry of Education of China China The Department of Automation Shanghai Jiao Tong University Shanghai200240 China The Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China The School of Electrical and Electronic Nanyang Technological University Singapore The KINDI Computing Research Center College of Engineering Qatar University Qatar

Online learning of deep neural networks suffers from challenges such as hysteretic non-incremental updating, increasing memory usage, past retrospective retraining, and catastrophic forgetting. To alleviate these drawbacks and achieve progressive immediate decision-making, we propose a novel Incremental Online Learning (IOL) process of Randomized Neural Networks (Randomized NN), a framework facilitating continuous improvements to Randomized NN performance in restrictive online scenarios. Within the framework, we further introduce IOL with ridge regularization (-R) and IOL with forward regularization (-F). -R generates stepwise incremental updates without retrospective retraining and avoids catastrophic forgetting. Moreover, we substituted -R with -F as it enhanced precognition learning ability using semi-supervision and realized better online regrets to offline global experts compared to -R during IOL. The algorithms of IOL for Randomized NN with -R/-F on non-stationary batch stream were derived respectively, featuring recursive weight updates and variable learning rates. Additionally, we conducted a detailed analysis and theoretically derived relative cumulative regret bounds of the Randomized NN learners with -R/-F in IOL under adversarial assumptions using a novel methodology and presented several corollaries, from which we observed the superiority on online learning acceleration and regret bounds of employing -F in IOL. Finally, our proposed methods were rigorously examined across regression and classification tasks on diverse datasets, which distinctly validated the efficacy of IOL frameworks of Randomized NN and the advantages of forward regularization. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

AoI-Reliability Analysis with Block Length over Erasure Channels Using Rateless Codes

AoI-Reliability Analysis with Block Length over Erasure Chan...

引用

International Conference on Communication Technology (ICCT)

作者： Haobo Huang Yusun Fu Yue Qiao Junpeng Yin Weiwu Yan Ningbo Artificial Intelligence Institute Shanghai Jiao Tong University Ningbo China School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Shanghai China

ISBN: (数字)9798350363760

ISBN: (纸本)9798350363777

As a metric to measure the information freshness, Age of Information (AoI) is widely used to evaluate low-latency high-reliability communication. Since the communication in Industrial Internet of Things (IIoT) often has the special requirements, the relationship among AoI, reliability and block length in time-critical scenarios with bounded latency and non-time-critical scenarios without bounded latency is explored respectively in this paper, based on erasure channels using rateless codes. We build a model using LT codes over erasure channels and consider two metrics: average AoI and bounded AoI. Theoretical analysis and simulation results show that AoI has a minimum value with different block lengths. Furthermore, we draw a conclusion that the minimum value of AoI under different reliability is monotonically decreasing functioned with reliability. Finally, the impact of overhead on reliability and AoI of LT codes in time-critical scenarios is studied.

关键词： Measurement Codes Simulation Reliability theory Information age Communications technology Time factors Low latency communication Industrial Internet of Things

来源：评论

学校读者我要写书评

暂无评论

3D Instances as 1D Kernels

arXiv

引用

arXiv 2022年

作者： Wu, Yizheng Shi, Min Du, Shuaiyuan Lu, Hao Cao, Zhiguo Zhong, Weicai Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of AIA Huazhong University of Science and Technology China Huawei CBG Consumer Cloud Service Search & Maps BU China

We introduce a 3D instance representation, termed instance kernels, where instances are represented by one-dimensional vectors that encode the semantic, positional, and shape information of 3D instances. We show that instance kernels enable easy mask inference by simply scanning kernels over the entire scenes, avoiding the heavy reliance on proposals or heuristic clustering algorithms in standard 3D instance segmentation pipelines. The idea of instance kernel is inspired by recent success of dynamic convolutions in 2D/3D instance segmentation. However, we find it non-trivial to represent 3D instances due to the disordered and unstructured nature of point cloud data, e.g., poor instance localization can significantly degrade instance representation. To remedy this, we construct a novel 3D instance encoding paradigm. First, potential instance centroids are localized as candidates. Then, a candidate merging scheme is devised to simultaneously aggregate duplicated candidates and collect context around the merged centroids to form the instance kernels. Once instance kernels are available, instance masks can be reconstructed via dynamic convolutions whose weights are conditioned on instance kernels. The whole pipeline is instantiated with a dynamic kernel network (DKNet). Results show that DKNet outperforms the state of the arts on both ScanNetV2 and S3DIS datasets with better instance localization. Code is available: https://***/W1zheng/DKNet. Copyright © 2022, The Authors. All rights reserved.

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

Vehicle Scheduling with Exact Minimum Fleet-Size

SSRN

引用

SSRN 2022年

作者： Shen, Yindong Li, Yuanyuan School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Image Processing and Intelligent Control Huazhong University of Science and Technology Ministry of Education China

Vehicle scheduling plays a profound role in public transit planning. Vehicle scheduling problem (VSP) addresses the task of assigning vehicles to cover timetabled trips to minimize the fleet-size as well as operating costs. The fixed cost of acquiring and maintaining vehicles is much more expensive than the operating cost. It is of great theoretical and practical significance to construct the vehicle schedules with the exact minimum fleet-size (EMF). The theorem that the EMF is equal to the maximum incompatible degree of the timetabled trips is first proposed and proved. Based on the theorem and time compatibility between any two trips, this paper theoretically examines vehicle scheduling with EMF. Specifically, construction procedures of schedules with EMF are provided for VSP in a specific case as well as the general case. Furthermore, sensitivity analysis of the EMF and the schedule with EMF are carried out. The EMF is possible to decrease by 1 if a trip is deleted or the start/end time of a trip is changed in the timetable. © 2022, The Authors. All rights reserved.

关键词： Sensitivity analysis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Front-end Replication Dynamic Window (FRDW) for Online Motor Imagery Classification

arXiv

引用

arXiv 2024年

作者： Chen, Xinru An, Jiayu Wu, Huanyu Li, Siyang Liu, Bin Wu, Dongrui The Ministry of Education Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China The Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen China Beijing Fenghuo Wanjia Technology Co. Ltd. Beijing100026 China

Motor imagery (MI) is a classical paradigm in electroencephalogram (EEG) based brain-computer interfaces (BCIs). Online accurate and fast decoding is very important to its successful applications. This paper proposes a simple yet effective front-end replication dynamic window (FRDW) algorithm for this purpose. Dynamic windows enable the classification based on a test EEG trial shorter than those used in training, improving the decision speed;front-end replication fills a short test EEG trial to the length used in training, improving the classification accuracy. Within-subject and cross-subject online MI classification experiments on three public datasets, with three different classifiers and three different data augmentation approaches, demonstrated that FRDW can significantly increase the information transfer rate in MI decoding. Additionally, FR can also be used in training data augmentation. FRDW helped win national champion of the China BCI Competition in 2022. © 2024, CC BY.

关键词： Brain computer interface

来源：评论

学校读者我要写书评

暂无评论

Enhancing the McEliece Scheme Based on Concatenation of Polar Codes and Blocked QC-LDPC Codes

Enhancing the McEliece Scheme Based on Concatenation of Pola...

引用

IEEE Conference on Communications and Network Security (CNS)

作者： Xin Lin Yusun Fu Zihao Wang Junpeng Yin Ningbo Artificial Intelligence Institute Shanghai Jiao Tong University Ningbo China School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Shanghai China

ISBN: (数字)9798350375961

ISBN: (纸本)9798350375978

This paper proposes an enhanced McEliece cryptosystem, leveraging a concatenation scheme of Polar codes and blocked QC-LDPC codes. During the key generation phase, the generator matrices for both Polar and blocked QC-LDPC codes are employed as private keys. These matrices are subsequently multiplied by reversible and random permutation matrices respectively. The products of these multiplications are then combined to form the public key, effectively concealing the structural properties of the generator matrices. In the encryption phase, the plaintext is encrypted sequentially through the Polar codes and the blocked QC-LDPC codes. This process introduces two layers of random error vectors, culminating in the generation of the encrypted ciphertext. The proposed scheme reduces the public key length by 54% and doubles the security level compared to the original McEliece scheme with similar parameters. It also significantly reduces the total key length compared to improved schemes based on Polar codes and QC-LDPC/MDPC codes at an 80-bit security level, and shortens the private key length compared to schemes based on Polar-LDPC concatenated codes. Notably, the scheme is secure against known structural and decoding attacks while increases resistance to information set decoding (ISD) attacks. Through the randomization and hashing of the plaintext, the proposed scheme can achieve IND-CCA2 security.

关键词： Resistance Codes Public key Network security Generators Vectors Decoding Encryption Concatenated codes Polar codes

来源：评论

学校读者我要写书评

暂无评论

Short-Term Hybrid Prognostics of Fuel Cells: A Comparative and Improvement Study

SSRN

引用

SSRN 2024年

作者： Sheng, Chuang Fu, Jun Zu, YanMin Deng, ZhongHua Li, Xi School of Artificial Intelligence and Automation Key Laboratory of Image Processing and Intelligent Control Education Ministry Huazhong University of Science and Technology Wuhan430074 China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen518055 China School of Electronic Information Engineering Jingchu University of Technology Jingmen448000 China

Accurately predicting the performance degradation trend of fuel cells helps take measures in advance and prolong the service life of the stack, which led to the creation of a novel hybrid forecasting approach. The first grey model prediction method based on residual exponential smoothing optimization (ES-R-GM) can capture the voltage deterioration trend. The integration of two different ES techniques, specifically the double ES (ES2) and cubic ES (ES3), is explored to investigate their effect on improving the predictive accuracy of the GM model. The second method of the adaptive network fuzzy inference system (ANFIS) can characterize local nonlinear behaviour. The simulated annealing (SA) algorithm is utilized to optimize ANFIS results under different fuzzy rule selection strategies. The outcomes of the two types of prediction methods mentioned above are combined to create a hybrid prediction using the data fusion method and the moving window technique. Different hybrid methods are evaluated under general conditions and further detailed optimization. The proposed hybrid framework is verified by the data obtained from the experimental platform. Moreover, when applied to consistent public datasets, the hybrid approach maintains its robustness and accuracy compared with other prognostic methods. © 2024, The Authors. All rights reserved.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：