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

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}_system$ 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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Classification-Detection of Medical Images by Visualizing Hidden-Layer Features of a Deep Learning Approach 12th

Classification-Detection of Medical Images by Visualizing Hi...

引用

12th International Conference on Computer engineering and Networks, CENet 2022

作者： Tong, Ziyu Deng, Xing Shao, Haijian Wang, Xia School of Computer Jiangsu University of Science and Technology Zhenjiang212003 China School of Automation Key Laboratory of Measurement and Control for CSE Ministry of Education Southeast University Nanjing Jiangsu210096 China School of Information Science and Technology Nantong University Nantong Jiangsu226019 China Department of Electrical and Computer Engineering National University of Singapore Singapore117583 Singapore

ISBN: (纸本)9789811969003

Deep learning algorithms, such as CNN, have been widely used on a variety of computer vision problems due to their powerful capacity to extract nonlinear features for medical picture analysis. However, due to the decreased identification rate for medical images, CNNs continue to fail to offer an interpretable depiction of the hidden-layers’ features. Furthermore, the enormous amount of redundant parameters from the convolutional to fully connected layers will surely add to the computational complexity. This work provides a set of fast deep learning architectures for visualizing and analyzing hidden-layer properties in medical images. The clustered feature map is used to simplify the model parameters and minimize redundancy parameters in order to meet the goal of a streamlined trade-off between model performance and architecture. The testing results on the medial images reveal that 41% of redundant channels may be removed while 100% of performance can be preserved. © 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Experimental Study on Transient Filtration Efficiency of Diesel Particulate Filter

SSRN

引用

SSRN 2023年

作者： Meng, Zhongwei Hu, Yizhang Bao, Zhongqiang Ou, Juan Deng, Meng Zeng, Bosong Zhang, Jingtong Deng, Huan Key Laboratory of Fluid and Power Machinery Ministry of Education School of Energy and Power Engineering Xihua University Chengdu610039 China Vehicle Measurement Control and Safety Key Laboratory of Sichuan Province School of Automobile and Transportation Xihua University Chengdu610039 China Power Machinery and Vehicular Engineering Institute Zhejiang University Hangzhou310027 China

Compared with normal operating condition, internal combustion engines equipped with particulate filter (DPF/GPF) produce a large number of particulate emissions when start-up, which seriously restricts the engine to meet the requirements of Euro 7 regulation or near zero emissions. The research on the transient filtration characteristics of particulate filter can not only enrich the understanding of its transient filtration efficiency (TFE), but also provide theoretical support and experimental reference for further reducing its outlet particulate emissions. In this paper, based on a diesel engine test bench, the filter characteristics during cold and warm start are investigated, and the particulate emission performance at the inlet and outlet of the filter during cold and warm start is presented. Furthermore, a small simulative bench for testing the transient filtration characteristics of the filter is built under laboratory condition, and the influence of the inlet flow rate and particle number concentration on the TFE is experimentally studied. It is found that the inlet peak particle number flow rate (PPNFR) is an important parameter affecting the TFE. The influence of filter substrate temperature and particle loading on the TFE is also investigated. The results show that the TFE could be effectively improved by increasing the substrate temperature. The following research can furtherly discuss the influence of substrate pore structure parameter, particle characteristics, particle size and other factors on the TFE, which is target to find an optimization window to reduce the particulate emissions of the filter under engine start-up conditions. © 2023, The Authors. All rights reserved.

关键词： Particulate emissions

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Federated-TD3:Joint Computing Offloading and Resource Allocation in Urban Air Mobility

Federated-TD3:Joint Computing Offloading and Resource Alloca...

引用

IEEE International Conference on Communications in China Workshops (ICCC)

作者： Zhonghao Luo Chunyu Pan Sihua Wang Linyan Guo The Key Laboratory of Information and Communication Systems Ministry of Information Industry and the Key Laboratory of Modern Measurement & Control Technology Ministry of Education Beijing Information Science and Technology University Beijing China The Beijing Laboratory of Advanced Information Network Beijing University of Posts and Telecommunications Beijing China The Department of Electronics and Communication Engineering Hong Kong University of Science and Technology Hong Kong China School of Geophysics and Information Technology China University of Geosciences Beijing Beijing China

ISBN: (数字)9798350377675

ISBN: (纸本)9798350377682

With rapid urban population growth and urban-ization, along with increasing demand for developing the low- altitude economy, urban air mobility (UAM) is seen as a way to alleviate ground traffic congestion and promote the low-altitude economy. Due to frequent data computation, low latency require-ments, and limited energy, effective computation offloading and resource management are urgently needed. This paper assumes UAM aircraft transmit semantic information and proposes a computation offloading and resource allocation strategy based on edge computing (EC). In case of edge server failure, relay UAV s assist in information transmission, enabling UAM aircraft to offload tasks to other edge servers. We formulated an op-timization problem to minimize delay and energy consumption and designed the Federated- Td3algorithm, combining federated learning (FL) and twin delayed deep deterministic policy gradient (TD3). Compared to two baseline algorithms, our algorithm reduced delay by 9.9% and 3.3%, and energy consumption by 14.1 % and 4.5%.

关键词： Energy consumption Semantics Delays Resource management Servers Aircraft Relays Traffic congestion Edge computing Testing

来源：评论

学校读者我要写书评

暂无评论

Optimal consensus control for partially unknown multi-agent systems with switching communication topology*

引用

IFAC-PapersOnLine 2023年第2期56卷 1210-1216页

作者： Wenpeng He Xin Chen Menglin Zhang Yipu Sun Akinori Sekiguchi Jinhua She School of Automation China University of Geosciences Wuhan 430074 China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan 430074 China Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan 430074 China School of Engineering Tokyo University of Technology Hachioji Tokyo 192-0982 Japan

Since the local neighborhood tracking error system for switching multi-agent systems (MASs) is time-varying, the existing optimal consensus method for fixed MASs cannot be used in switching MASs. This paper proposes a new approach to solve the optimal consensus problems of linear switching MASs. Firstly, a new augment local neighborhood tracking error (ALNTE) system, which is based on the joint communication topology, is developed to construct the control object, and the open-loop estimation method is used to estimate the ALNTE for individuals. Secondly, based on the ALNTE system, the performance index is designed, and the value iteration method is used to solve the coupled Hamilton-Jacobi-Bellman equations and obtain the optimal control. Finally, theoretical analysis is given to prove the learning stability and control stability of the value iteration method, and a numerical simulation is used to verify the effectiveness of the proposed method.

关键词： Switching topology multi-agent systems (MASs) optimal control value iteration augment local neighborhood tracking error (ALNTE)

来源：评论

学校读者我要写书评

暂无评论

TEMPORAL-SPATIAL REPRESENTATION LEARNING TRANSFORMER FOR EEG-BASED EMOTION RECOGNITION

arXiv

引用

arXiv 2022年

作者： Wang, Zhe Wang, Yongxiong Hu, Chuanfei Yin, Zhong Song, Yu School of Optical-Electrical and Computer Engineering University of Shanghai for Science and Technology China Key Laboratory of Measurement and Control of CSE Ministry of Education Southeast University China Tianjin Key Laboratory for Control Theory and Applications in Complicated Systems Tianjin University of Technology China

Both the temporal dynamics and spatial correlations of Electroencephalogram (EEG), which contain discriminative emotion information, are essential for the emotion recognition. However, some redundant information within the EEG signals would degrade the performance. Specifically, the subjects reach prospective intense emotions for only a fraction of the stimulus duration. Besides, it is a challenge to extract discriminative features from the complex spatial correlations among a number of electrodes. To deal with the problems, we propose a transformer-based model to robustly capture temporal dynamics and spatial correlations of EEG. Especially, temporal feature extractors which share the weight among all the EEG channels are designed to adaptively extract dynamic context information from raw signals. Furthermore, multi-head self-attention mechanism within the transformers could adaptively localize the vital EEG fragments and emphasize the essential brain regions which contribute to the performance. To verify the effectiveness of the proposed method, we conduct the experiments on two public datasets, DEAP and MAHNOB-HCI. The results demonstrate that the proposed method achieves outstanding performance on arousal and valence classification. Copyright © 2022, The Authors. All rights reserved.

关键词： Emotion Recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：