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

SSRN 2024年

作者： Tang, Zhenhui Wang, Jingcheng Wu, Shunyu The Department of Automation The Key Laboratory of System Control and Information Processing Ministry of Education of China The Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University No.800 Dongchuan Road Shanghai200240 China The SJTU Sanya Yazhou Bay Institute of Deepsea Science and Technology Sanya572024 China The Autonomous Systems and Intelligent Control International Joint Research Center Xi’an Technological University Xi’an710021 China

Recognizing fault types of machinery system is a fundamental but challenging task in industrial application. Although remarkable progress has been attained by learning fault features and predicting the corresponded fault type with deep neural networks, the existing fault diagnosis pipelines usually learn non-discriminative information. Contextual sequence dependency between the localized time fragments is often ignored. To deal with these problem, a recurrent attention framework with reinforcement learning is proposed to find a series of informative features of local time fragments related to different faults in an iterative manner. Fault labels are further predicted on these time fragments. The proposed framework also explicitly models long-term dependencies among these attentional time fragments to capture historical fault information. Experiments on two typical machinery systems, bearing system and hydraulic system, show that the proposed framework achieves superior diagnosis performance and increases no computation burden on CPU. © 2024, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Channel Reflection: Knowledge-Driven Data Augmentation for Eeg-Based Bcis

SSRN

引用

SSRN 2024年

作者： Wang, Ziwei Li, Siyang Luo, Jingwei Liu, Jiajing Wu, Dongrui Key Laboratory of the Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen518063 China China Electronic System Technology Co. Ltd. Beijing100089 China School of Civil and Hydraulic Engineering Huazhong University of Science and Technology Wuhan430074 China

A brain-computer interface (BCI) enables direct communication between the human brain and external devices. Electroencephalography (EEG) based BCIs are currently the most popular for able-bodied users. To increase user-friendliness, usually a small amount of user-specific EEG data are used for calibration, which may not be enough to develop a pure data-driven decoding model. To cope with this typical calibration data shortage challenge in EEG-based BCIs, this paper proposes a parameter-free channel reflection (CR) data augmentation approach that incorporates prior knowledge on the channel distributions of different BCI paradigms in data augmentation. Experiments on eight public EEG datasets across four different BCI paradigms (motor imagery, steady-state visual evoked potential, P300, and seizure classifications) using different decoding algorithms demonstrated that: 1) CR is effective, i.e., it can noticeably improve the classification accuracy;2) CR is robust, i.e., it consistently outperforms other data augmentation approaches in the literature;and, 3) CR is flexible, i.e., it can be combined with other data augmentation approaches to further increase the performance. We suggest that data augmentation approaches like CR should be an essential step in EEG-based BCIs. Our code is available online. © 2024, The Authors. All rights reserved.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Named Entity Recognition Based on Anchor Span for Manufacturing Text Knowledge Extraction

SSRN

引用

SSRN 2024年

作者： Li, Yahui Sun, Qi Zhou, Chunjie Liu, Lu Tian, Yu-Chu School of Artificial Intelligence and Automation Huazhong University of Science and Technology Hubei Wuhan430074 China Key Laboratory of Image Processing and Intelligent Control Ministry of Education Huazhong University of Science and Technology Hubei Wuhan430074 China School of Cyber Science and Engineering Huazhong University of Science and Technology Hubei Wuhan430074 China School of Computer Science Queensland University of Technology BrisbaneQLD4001 Australia

intelligent industrial manufacturing heavily relies on structured knowledge. Named Entity Recognition (NER), an essential technique for extracting structured knowledge from text, has garnered significant research interest. However, current NER approaches face difficulties in handling multiple levels of entity nesting in knowledge extraction, especially within the manufacturing context. To address this issue, we present an Anchor Span-based NER (ASNER) approach for accurately and efficiently extracting manufacturing text knowledge. This method combines token and span classification. Initially, the head and tail features of the entity are extracted, with the corresponding anchor span of potential entities generated based on a boundary match neural network to localize the entities. Subsequently, token spatial contextual features are extracted using biaffine attention and convolutional neural networks, and classification categories are assigned to the anchor span-filtered entity features. Experimental studies demonstrate the effectiveness of the proposed ASNER approach. © 2024, The Authors. All rights reserved.

关键词： Character recognition

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Understanding the Robustness of 3D Object Detection with Bird’s-Eye-View Representations in Autonomous Driving

arXiv

引用

arXiv 2023年

作者： Zhu, Zijian Zhang, Yichi Chen, Hai Dong, Yinpeng Zhao, Shu Ding, Wenbo Zhong, Jiachen Zheng, Shibao Institute of Image Communication and Network Engineering Shanghai Jiao Tong University China Dept. of Comp. Sci. and Tech. Institute for AI THBI Lab BNRist Center Tsinghua University China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Computer Science and Technology Anhui University Information Materials and Intelligent Sensing Laboratory of Anhui Province China SAIC Motor AI Lab China Zhongguancun Laboratory China

3D object detection is an essential perception task in autonomous driving to understand the environments. The Bird’s-Eye-View (BEV) representations have significantly improved the performance of 3D detectors with camera inputs on popular benchmarks. However, there still lacks a systematic understanding of the robustness of these vision-dependent BEV models, which is closely related to the safety of autonomous driving systems. In this paper, we evaluate the natural and adversarial robustness of various representative models under extensive settings, to fully understand their behaviors influenced by explicit BEV features compared with those without BEV. In addition to the classic settings, we propose a 3D consistent patch attack by applying adversarial patches in the 3D space to guarantee the spatiotemporal consistency, which is more realistic for the scenario of autonomous driving. With substantial experiments, we draw several findings: 1) BEV models tend to be more stable than previous methods under different natural conditions and common corruptions due to the expressive spatial representations;2) BEV models are more vulnerable to adversarial noises, mainly caused by the redundant BEV features;3) Camera-LiDAR fusion models have superior performance under different settings with multi-modal inputs, but BEV fusion model is still vulnerable to adversarial noises of both point cloud and image. These findings alert the safety issue in the applications of BEV detectors and could facilitate the development of more robust models. Code available at https: //***/zzj403/BEV_Robust. Copyright © 2023, The Authors. All rights reserved.

关键词： Birds

来源：评论

学校读者我要写书评

暂无评论

Boltzmann Robust Soliton Distribution for Rateless Codes

Boltzmann Robust Soliton Distribution for Rateless Codes

引用

International Conference on Communication Technology (ICCT)

作者： Jinhui Tang Yusun Fu Yue Qiao Junpeng Yin Haobo Huang School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Ningbo Artificial Intelligence Institute Shanghai Jiao Tong University Ningbo 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

The decoding success rate may be worse when classical degree distributions are used in short-packet transmission of rateless codes, especially in industrial communication scenarios. A novel Boltzmann degree distribution is proposed for Luby Transform (LT) codes. The Boltzmann degree distribution has a high decoding success rate for short-packet transmission but a lower decoding success rate in long-packet transmission. To balance the performance of rateless codes for short and long packet transmission, the Boltzmann degree distribution and the robust soliton distribution (RSD) are combined with a new joint degree distribution, called Boltzmann Robust Soliton Distribution (BRSD). Simulation results show that compared with RSD and Poisson robust soliton distribution (PRSD), the proposed joint distribution can achieve a higher decoding success rate and reduce the average degree, especially in short-packet transmission of industrial communication.

关键词： Codes Simulation Industrial communication Symbols Solitons Transforms Robustness Decoding Complexity theory Physics

来源：评论

学校读者我要写书评

暂无评论

Multi-level Coordinated Energy Management for Energy Hub in Hybrid Markets with Distributionally Robust Scheduling

arXiv

引用

arXiv 2022年

作者： Cao, Jiaxin Yang, Bo Zhu, Shanying Chung, Chi Yung Guan, Xinping Department of Automation Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of System Control and Information Processing Ministry of Education China Shanghai Engineering Research Center of Industrial Intelligent Control and Management Shanghai200240 China Department of Electrical and Computer Engineering University of Saskatchewan SaskatoonSKS7N 5A9 Canada

Maintaining energy balance and economical operation is significant for multi-energy systems such as the energy hub (EH). However, it is usually challenged by the frequently changing and unpredictable uncertain parameters at different timescales. Under this scope, this paper investigates the coordinated energy management problem for day-ahead and intra-day conditions considering uncertainties of source-load and market prices concurrently. Note that the precise knowledge of distributions about uncertainties may be unaccessible before the decision-making in day-ahead phase. A two-stage chance-constrained model based on distributionally robust approach with ambiguous moment information is proposed to immunize scheduling strategies against the worst-case probability distributions. The first stage is dedicated to obtaining more energy arbitrage and operation flexibility by optimizing bidding strategies in day-ahead power, natural gas and carbon trading markets. The second stage focuses on the optimization of the worst-case expected operation cost. It provides a robust energy equipment and load scheduling strategy for the reference of subsequent intra-day arrangements. With respect to different variations of electrical and thermal components, an intra-day two-timescale coordination is implemented step by step. The energy scheduling is re-dispatched circularly to minimize the operation and penalty costs. The possible energy imbalance is also compensated by this way. As the energy management program is nonlinear, chance-constrained and multi-stage, some linearization and dual transformation techniques are designed to enhance tractability of the program. Experimental results show that the developed multi-level framework results in a carbon emission decrease of 37%, and reduces energy cost averagely 3% compared with corresponding contrasting cases. The obtained strategy validates a good tradeoff between robustness and optimality. Copyright © 2022, The Authors. All rights reser

关键词： Power markets

来源：评论

学校读者我要写书评

暂无评论

Self-Organized Criticality in C. Elegans Neural Network

Self-Organized Criticality in C. Elegans Neural Network

引用

Chinese control Conference (CCC)

作者： Xiao Gu Jian Liu Ye Yuan Peng Zhao Kuankuan Xin Tao Fang Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education Shanghai China Shanghai Engineering Research Centre of Intelligent Control and Management Shanghai China Institute of Machine Intelligence University of Shanghai for Science and Technology Shanghai China Queensland Brain Institute The University of Queensland Brisbane QLD Australia

The self-organized criticality is a fundamental property for organisms to perform normal functional activities. Extensive large-scale biological neural network researches have found the existence of self-organized criticality through avalanche phenomenon, which is typical characteristic of self-organized criticality. However, such research method is not suitable for small-scale biological neural network, because number of neurons in small-scale biological neural network is not large enough to support the emergence of avalanche phenomenon. It has been demonstrated that branching parameter can also be used to describe the propagation of activity in the neural network. Here, in this paper, the C. elegans neural network composed of 302 neurons is selected to investigate the existence of self-organized criticality using branching parameter. Based on the obtained connectome of C. elegans, a directed graph model is constructed to simulate the gradient potential of neurons and the activity of C. elegans, then, the existence of self-organized criticality in the neural network of C. elegans is proved by using branching parameter method. Meanwhile, the result is further confirmed by analyzing the calcium activity data of C. elegans obtained from biological experiments.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：