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

EEG-Based Brain-Computer Interfaces Are Vulnerable to Backdoor Attacks

学校读者我要写书评

暂无评论

Research Square

Research Square 2021年

作者： Meng, Lubin Huang, Jian Zeng, Zhigang Jiang, Xue Yu, Shan Jung, Tzyy-Ping Lin, Chin-Teng Chavarriaga, Ricardo Wu, Dongrui Ministry of Education Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Brainnetome Center and National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing China La Jolla CA United States Center for Advanced Neurological Engineering Institute of Engineering in Medicine UCSD La Jolla CA United States Centre of Artificial Intelligence Faculty of Engineering and Information Technology University of Technology Sydney Australia ZHAW DataLab Zürich University of Applied Sciences Winterthur8401 Switzerland

Research and development of electroencephalogram (EEG) based brain-computer interfaces (BCIs) have advanced rapidly, partly due to the wide adoption of sophisticated machine learning approaches for decoding the EEG signals. However, recent studies have shown that machine learning algorithms are vulnerable to adversarial attacks, e.g., the attacker can add tiny adversarial perturbations to a test sample to fool the model, or poison the training data to insert a secret backdoor. Previous research has shown that adversarial attacks are also possible for EEG-based BCIs. However, only adversarial perturbations have been considered, and the approaches are theoretically sound but very difficult to implement in practice. This article proposes to use narrow period pulse for poisoning attack of EEG-based BCIs, which is more feasible in practice and has never been considered before. One can create dangerous backdoors in the machine learning model by injecting poisoning samples into the training set. Test samples with the backdoor key will then be classified into the target class specified by the attacker. What most distinguishes our approach from previous ones is that the backdoor key does not need to be synchronized with the EEG trials, making it very easy to implement. The effectiveness and robustness of the backdoor attack approach is demonstrated, highlighting a critical security concern for EEG-based BCIs. © 2021, CC BY.

关键词： Electroencephalography

EEG-Based Brain-Computer Interfaces Are Vulnerable to Backdoor Attacks

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Meng, Lubin Huang, Jian Zeng, Zhigang Jiang, Xue Yu, Shan Jung, Tzyy-Ping Lin, Chin-Teng Chavarriaga, Ricardo Wu, Dongrui Ministry of Education Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Brainnetome Center National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing China La Jolla CA United States Center for Advanced Neurological Engineering Institute of Engineering in Medicine Ucsd La Jolla CA United States Centre of Artificial Intelligence Faculty of Engineering and Information Technology University of Technology Sydney Australia Zhaw DataLab Zürich University of Applied Sciences Winterthur8401 Switzerland

Research and development of electroencephalogram (EEG) based brain-computer interfaces (BCIs) have advanced rapidly, partly due to deeper understanding of the brain and wide adoption of sophisticated machine learning approaches for decoding the EEG signals. However, recent studies have shown that machine learning algorithms are vulnerable to adversarial attacks. This article proposes to use narrow period pulse for poisoning attack of EEG-based BCIs, which is implementable in practice and has never been considered before. One can create dangerous backdoors in the machine learning model by injecting poisoning samples into the training set. Test samples with the backdoor key will then be classified into the target class specified by the attacker. What most distinguishes our approach from previous ones is that the backdoor key does not need to be synchronized with the EEG trials, making it very easy to implement. The effectiveness and robustness of the backdoor attack approach is demonstrated, highlighting a critical security concern for EEG-based BCIs and calling for urgent attention to address it. Copyright © 2020, The Authors. All rights reserved.

关键词： Electroencephalography

Path Planning Algorithm for Unmanned Surface Vessel Based on Multiobjective Reinforcement Learning

学校读者我要写书评

暂无评论

Computational intelligence and neuroscience 2023年第1期2023卷 2146314页

作者： Caipei Yang Yingqi Zhao Xuan Cai Wei Wei Xingxing Feng Kaibo Zhou MOE Key Laboratory of Image Information Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan 430074 China. Wuhan Second Ship Design and Research Institute Wuhan 430205 China.

It is challenging to perform path planning tasks in complex marine environments as the unmanned surface vessel approaches the goal while avoiding obstacles. However, the conflict between the two subtarget tasks of obstacle avoidance and goal approaching makes the path planning difficult. Thus, a path planning method for unmanned surface vessel based on multiobjective reinforcement learning is proposed under the complex environment with high randomness and multiple dynamic obstacles. Firstly, the path planning scene is set as the main scene, and the two subtarget scenes including obstacle avoidance and goal approaching are divided from it. The action selection strategy in each subtarget scene is trained through the double deep -network with prioritized experience replay. A multiobjective reinforcement learning framework based on ensemble learning is further designed for policy integration in the main scene. Finally, by selecting the strategy from subtarget scenes in the designed framework, an optimized action selection strategy is trained and used for the action decision of the agent in the main scene. Compared with traditional value-based reinforcement learning methods, the proposed method achieves a 93% success rate in path planning in simulation scenes. Furthermore, the average length of the paths planned by the proposed method is 3.28% and 1.97% shorter than that of PER-DDQN and dueling DQN, respectively.

关键词：

High Information Density and Low Coverage Data Storage in DNA with Efficient Channel Coding Schemes

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ding, Yi He, Xuan Nguyen, Tuan Thanh Song, Wentu Yakhini, Zohar Yaakobi, Eitan Pan, Linqiang Tang, Xiaohu Cai, Kui Information Coding and Transmission Key Lab of Sichuan Province Southwest Jiaotong University Sichuan Chengdu611756 China Cluster Singapore University of Technology and Design 487372 Singapore Faculty of Computer Science Technion - Israel Institute of Technology Haifa3200003 Israel School of Computer Science RUNI Herzliya4615200 Israel Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Hubei Wuhan430074 China

DNA-based data storage has been attracting significant attention due to its extremely high data storage density, low power consumption, and long duration compared to conventional data storage media. Despite the recent advancements in DNA data storage technology, significant challenges remain. In particular, various types of errors can occur during the processes of DNA synthesis, storage, and sequencing, including substitution errors, insertion errors, and deletion errors. Furthermore, the entire oligo may be lost. In this work, we report a DNA-based data storage architecture that incorporates efficient channel coding schemes, including different types of error-correcting codes (ECCs) and constrained codes, for both the inner coding and outer coding for the DNA data storage channel. We also carried out large scale experiments to validate our proposed DNA-based data storage architecture. Specifically, 1.61 and 1.69 MB data were encoded into 30,000 oligos each, with information densities of 1.731 and 1.815, respectively. It has been found that the stored information can be fully recovered without any error at average coverages of 4.5 and 6.0, respectively. This experiment achieved the highest net information density and lowest coverage among existing DNA-based data storage experiments (with standard DNA), with data recovery rates and coverage approaching theoretical optima. Copyright © 2024, The Authors. All rights reserved.

关键词： Channel coding

Federated Multi-Agent Deep Reinforcement Learning Approach via Physics-Informed Reward for Multi-Microgrid Energy Management

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Li, Yuanzheng He, Shangyang Li, Yang Shi, Yang Zeng, Zhigang School of Artificial Intelligence and Automation Key Laboratory on Image Information Processing and Intelligent Control of Ministry of Education Huazhong University of Science and Technology Wuhan430074 China China-Belt and Road Joint Laboratory on Measurement and Control Technology Wuhan430074 China China-EU Institute for Clean and Renewable Energy Huazhong University of Science and Technology Wuhan430074 China School of Electrical Engineering Northeast Electric Power University Jilin132012 China The Department of Mechanical Engineering University of Victoria VictoriaBC V8P 5C2 Canada

The utilization of large-scale distributed renewable energy promotes the development of the multi-microgrid (MMG), which raises the need of developing an effective energy management method to minimize economic costs and keep self energy-sufficiency. The multi-agent deep reinforcement learning (MADRL) has been widely used for the energy management problem because of its real-time scheduling ability. However, its training requires massive energy operation data of microgrids (MGs), while gathering these data from different MGs would threaten their privacy and data security. Therefore, this paper tackles this practical yet challenging issue by proposing a federated multi-agent deep reinforcement learning (F-MADRL) algorithm via the physics-informed reward. In this algorithm, the federated learning (FL) mechanism is introduced to train the F-MADRL algorithm thus ensures the privacy and the security of data. In addition, a decentralized MMG model is built, and the energy of each participated MG is managed by an agent, which aims to minimize economic costs and keep self energy-sufficiency according to the physics-informed reward. At first, MGs individually execute the self-training based on local energy operation data to train their local agent models. Then, these local models are periodically uploaded to a server and their parameters are aggregated to build a global agent, which will be broadcasted to MGs and replace their local agents. In this way, the experience of each MG agent can be shared and the energy operation data is not explicitly transmitted, thus protecting the privacy and ensuring data security. Finally, experiments are conducted on Oak Ridge national laboratory distributed energy control communication lab microgrid (ORNL-MG) test system, and the comparisons are carried out to verify the effectiveness of introducing the FL mechanism and the outperformance of our proposed F-MADRL. Copyright © 2022, The Authors. All rights reserved.

关键词： Reinforcement learning

A deep learning-based remaining useful life prediction approach for bearings

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Cheng, Cheng Ma, Guijun Zhang, Yong Sun, Mingyang Teng, Fei Ding, Han Yuan, Ye The Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China The State Key Laboratory of Digital Manufacturing Equipment and Technology Huazhong University of Science and Technology Wuhan430074 China The School of Mechanical Science and Engineering Huazhong University of Science and Technology Wuhan430074 China School of Information Science and Engineering Wuhan University of Science and Technology Wuhan430081 China The College of Control Science and Engineering Zhejiang University Hangzhou310007 China The Department of Electrical & Electronic Engineering Imperial College London LondonSW7 2AZ United Kingdom

In industrial applications, nearly half the failures of motors are caused by the degradation of rolling element bearings (REBs). Therefore, accurately estimating the remaining useful life (RUL) for REBs is of crucial importance to ensure the reliability and safety of mechanical systems. To tackle this challenge, model-based approaches are limited by the complexity of mathematical modeling. Conventional data-driven approaches, on the other hand, require massive efforts to extract the degradation features and construct the health index. In this paper, a novel data-driven framework is proposed to exploit the adoption of deep convolutional neural networks (CNN) in predicting the RULs of bearings. More concretely, raw vibrations of training bearings are first processed using the Hilbert-Huang transform to construct a novel nonlinear degradation energy indicator which can be used as the training label. The CNN is then employed to identify the hidden pattern between the extracted degradation energy indicator and the raw vibrations of training bearings, which makes it possible to estimate the degradation of the test bearings automatically. Finally, testing bearings’ RULs are predicted through using a ǫ-support vector regression model. The superior performance of the proposed RUL estimation framework, compared with the state-of-the-art approaches, is demonstrated through the experimental results. The generality of the proposed CNN model is also validated by performance test on other bearings undergoing different operating conditions. Copyright © 2018, The Authors. All rights reserved.

关键词： Hilbert-Huang transform

A Single-Cell Clustering Algorithm Based on Structure Perturbation Non-Negative Matrix Factorization

学校读者我要写书评

暂无评论

A Single-Cell Clustering Algorithm Based on Structure Pertur...

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Hanjing Jiang Meineng Wang Luping Zhang Yu-An Huang Yangyuan Li Yabing Huang Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China Institute of Artificial Intelligence School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China School of Computer Science and Technology China University of Mining and Technology Xuzhou China School of Mathematics and Computer Science Yichun University Yichun China School of Information Engineering East China University of Technology Nanchang China School of Computer Science Northwestern Polytechnical University Xi’an China Department of Pathology Renmin Hospital of Wuhan University Wuhan China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

The advent of single-cell RNA sequencing (scRNA-seq) has facilitated the acquisition of high-resolution data regarding cell heterogeneity across various tissues. A fundamental and critical step in the analysis of scRNA-seq data is cell type identification. An appropriate graph construction strategy can reflect the topological structure between cells and allows for detailed exploration of the relationships between cells and genes. Given the sparsity of scRNA-seq data and the pronounced noise generated by shallow sequencing, choosing an appropriate graph construction strategy has become a significant challenge. In this paper, we propose a single-cell clustering method, named Sc-PNNMF, based on structural perturbation of nonnegative matrix factorization. Sc-PNNMF employs a structural perturbation algorithm to optimize the gene expression matrix. The optimized matrix guides the matrix factorization process, effectively overcoming the impact of data sparsity and significant noise in gene expression data on the graph construction strategy. We compared the clustering abilities of Sc-PNNMF with five other methods on ten real datasets.

关键词： Sequential analysis Perturbation methods Clustering methods RNA Noise Clustering algorithms Sparse matrices Gene expression Unsupervised learning Periodic structures

Real-time Multi-person Eyeblink Detection in the Wild for Untrimmed Video

学校读者我要写书评

暂无评论

Real-time Multi-person Eyeblink Detection in the Wild for Un...

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Wenzheng Zeng Yang Xiao Sicheng Wei Jinfang Gan Xintao Zhang Zhiguo Cao Zhiwen Fang Joey Tianyi Zhou Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China School of Biomedical Engineering Southern Medical University Guangzhou China Department of Rehabilitation Medicine Zhujiang Hospital Southern Medical University Guangzhou China Centre for Frontier AI Research Agency for Science Technology and Research (A*STAR) Singapore Institute of High Performance Computing Agency for Science Technology and Research (A*STAR) Singapore

Real-time eyeblink detection in the wild can widely serve for fatigue detection, face anti-spoofing, emotion analysis, etc. The existing research efforts generally focus on single-person cases towards trimmed video. However, multi-person scenario within untrimmed videos is also important for practical applications, which has not been well concerned yet. To address this, we shed light on this research field for the first time with essential contributions on dataset, theory, and practices. In particular, a large-scale dataset termed MPEblink that involves 686 untrimmed videos with 8748 eyeblink events is proposed under multi-person conditions. The samples are captured from uncon-strainedfilms to reveal “in the wild“ characteristics. Meanwhile, a real-time multi-person eyeblink detection method is also proposed. Being different from the existing counter-parts, our proposition runs in a one-stage spatio-temporal way with end-to-end learning capacity. Specifically, it simultaneously addresses the sub-tasks of face detection, face tracking, and human instance-level eyeblink detection. This paradigm holds 2 main advantages: (1) eyeblink features can be facilitated via the face's global context (e.g., head pose and illumination condition) with joint optimization and interaction, and (2) addressing these sub-tasks in parallel instead of sequential manner can save time remarkably to meet the real-time running requirement. Experiments on MPEblink verify the essential challenges of real-time multi-person eyeblink detection in the wild for untrimmed video. Our method also outperforms existing approaches by large margins and with a high inference speed.

关键词：

Distributed Online Optimization for Charging and Discharging of Plug-in Electric Vehicles

学校读者我要写书评

暂无评论

Distributed Online Optimization for Charging and Discharging...

IEEE International Conference on Cyborg and Bionic Systems (CBS)

作者： Haiming Xiong Ming Chi Zhi-Wei Liu Dandan Hu Liang-Liang Zhu Cheng Jiang Jun-Ping Gui Yao Rao School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Key Laboratory of Image Processing and Intelligent Control Ministry of Education Huazhong University of Science and Technology Wuhan China School of Management South-Central University for Nationalities Wuhan China Nari Group Corporation State Grid Electric Power Research Institute Nanjing China State Grid Electric Power Research Institute Wuhan Efficiency Evaluation Company Limited Wuhan China

The increasing number of uncoordinated charging and discharging for plug-in electric vehicles (PEVs) poses new challenges to the operation of the distribution network. We introduce a dynamic price mechanism so that charging at peak load will lead to an increase in cost. Then, a distributed online charging and discharging scheduling scheme for PEVs based on the dynamic price mechanism is proposed, considering the minimization of charging cost and battery degradation cost. Unlike most of the existing studies that require the future information of PEVs to schedule charging, the proposed algorithm can solve the scheduling problem for PEVs by taking advantage of a distributed alternating direction method of multipliers (ADMM). Simulation results demonstrate the effectiveness and correctness of the proposed scheduling scheme.

关键词： Plug-in electric vehicles Schedules Costs Heuristic algorithms Simulation Dynamic scheduling Minimization