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

Advanced Textbooks in control and Signal Processing 2019年 1-27页

作者： Keviczky, László Bars, Ruth Hetthéssy, Jenő Bányász, Csilla Institute for Computer Science and Control Hungarian Academy of Sciences Budapest Hungary Department of Automation and Applied Informatics Budapest University of Technology and Economics Budapest Hungary

MATLAB™ is an interactive environment for scientific and engineering calculations, simulations, and data visualization. MATLAB™ provides a powerful platform to solve mathematical and engineering problems related to matrix algebra, differential equations, etc. MATLAB is especially effective in solving control problems. SIMULINK provides block-oriented simulation. The chapter gives a short introduction to MATLAB and SIMULINK. © Springer Nature Singapore Pte Ltd. 2019.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The applied principles of EEG analysis methods in neuroscience and clinical neurology

引用

Military Medical Research 2024年第6期11卷 907-941页

作者： Hao Zhang Qing-Qi Zhou He Chen Xiao-Qing Hu Wei-Guang Li Yang Bai Jun-Xia Han Yao Wang Zhen-Hu Liang Dan Chen Feng-Yu Cong Jia-Qing Yan Xiao-Li Li School of Systems Science Beijing Normal UniversityBeijing 100875China College of Electrical and Control Engineering North China University of TechnologyBeijing 100041China School of Automation Science and Engineering South China University of TechnologyGuangzhou 510641China Department of Psychology the State Key Laboratory of Brain and Cognitive Sciencesthe University of Hong KongHong Kong SAR 999077China HKU-Shenzhen Institute of Research and Innovation Shenzhen 518057GuangdongChina Department of Health Technology and Informatics the Hong Kong Polytechnic UniversityHong Kong SAR 999077China Department of Rehabilitation Medicine the First Afliated Hospital of Nanchang UniversityNanchang 330006China Rehabilitation Medicine Clinical Research Center of Jiangxi Province Nanchang 330006China Beijing Key Laboratory of Learning and Cognition School of PsychologyCapital Normal UniversityBeijing 100048China School of Communication Science Beijing Language and Culture UniversityBeijing 100083China Institute of Electrical Engineering Yanshan UniversityQinhuangdao 066004HebeiChina School of Computer Science Wuhan UniversityWuhan 430072China School of Biomedical Engineering Faculty of Electronic Information and Electrical EngineeringDalian University of TechnologyDalian 116081LiaoningChina Guangdong Artifcial Intelligence and Digital Economy Laboratory(Guangzhou) Guangzhou 510335China.

Electroencephalography(EEG)is a non-invasive measurement method for brain *** to its safety,high resolution,and hypersensitivity to dynamic changes in brain neural signals,EEG has aroused much interest in scientific research and medical *** article reviews the types of EEG signals,multiple EEG signal analysis methods,and the application of relevant methods in the neuroscience feld and for diagnosing neurological ***,3 types of EEG signals,including time-invariant EEG,accurate event-related EEG,and random event-related EEG,are ***,5 main directions for the methods of EEG analysis,including power spectrum analysis,time-frequency analysis,connectivity analysis,source localization methods,and machine learning methods,are described in the main section,along with diferent sub-methods and effect evaluations for solving the same ***,the application scenarios of different EEG analysis methods are emphasized,and the advantages and disadvantages of similar methods are *** article is expected to assist researchers in selecting suitable EEG analysis methods based on their research objectives,provide references for subsequent research,and summarize current issues and prospects for the future.

关键词： Electroencephalogram analysis methods Applied principles Neuroscience Diagnosis Neurological diseases

来源：评论

学校读者我要写书评

暂无评论

EDOLAB: An Open-Source Platform for Education and Experimentation with Evolutionary Dynamic Optimization Algorithms

arXiv

引用

arXiv 2023年

作者： Peng, Mai Yazdani, Delaram She, Zeneng Yazdani, Danial Luo, Wenjian Li, Changhe Branke, Juergen Nguyen, Trung Thanh Gandomi, Amir H. Yang, Shengxiang Jin, Yaochu Yao, Xin School of Automation China University of Geosciences Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan China Research Institute Faculty of Engineering and Technology Liverpool John Moores University United Kingdom School of Computer Science and Technology Harbin Institute of Technology China Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies School of Computer Science and Technology Harbin Institute of Technology Peng Cheng Laboratory China School of Artificial Intelligence Anhui University of Sciences & Technology China Information Systems Management and Analytics in Warwick Business School University of Warwick United Kingdom Faculty of Engineering & Information Technology University of Technology Sydney Australia Obuda University Hungary School of Computer Science and Informatics De Montfort University United Kingdom Department of Artificial Intelligence School of Engineering Westlake University China School of Computer Science University of Birmingham United Kingdom

Many real-world optimization problems exhibit dynamic characteristics, posing significant challenges for traditional optimization techniques. Evolutionary Dynamic Optimization Algorithms (EDOAs) are designed to address these challenges effectively. However, in existing literature, the reported results for a given EDOA can vary significantly. This inconsistency often arises because the source codes for many EDOAs, which are typically complex, have not been made publicly available, leading to error-prone re-implementations. To support researchers in conducting experiments and comparing their algorithms with various EDOAs, we have developed an open-source MATLAB platform called the Evolutionary Dynamic Optimization LABoratory (EDOLAB). This platform not only facilitates research but also includes an educational module designed for instructional purposes. The education module allows users to observe: a) a 2-dimensional problem space and its morphological changes following each environmental change, b) the behaviors of individuals over time, and c) how the EDOA responds to environmental changes and tracks the moving optimum. The current version of EDOLAB features 25 EDOAs and four fully parametric benchmark generators. © 2023, CC BY-NC-SA.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Secure State Estimation against Sparse Attacks on a Time-varying Set of Sensors

arXiv

引用

arXiv 2022年

作者： Li, Zishuo Niazi, Muhammad Umar B. Liu, Changxin Mo, Yilin Johansson, Karl H. Department of Automation Tsinghua University Beijing100084 China Division of Decision and Control Systems Digital Futures School of Electrical Engineering and Computer Science KTH Royal Institute of Technology StockholmSE-100 44 Sweden Laboratory for Information and Decision Systems Massachusetts Institute of Technology 77 Massachusetts Avenue CambridgeMA02139 United States

This paper studies the problem of secure state estimation of a linear time-invariant (LTI) system with bounded noise in the presence of sparse attacks on an unknown, time-varying set of sensors. In other words, at each time, the attacker has the freedom to choose an arbitrary set of no more that p sensors and manipulate their measurements without restraint. To this end, we propose a secure state estimation scheme and guarantee a bounded estimation error subject to 2p-sparse observability and a mild, technical assumption that the system matrix has no degenerate eigenvalues. The proposed scheme comprises a design of decentralized observer for each sensor based on the local observable subspace decomposition. At each time step, the local estimates of sensors are fused by a median operator to obtain a secure estimation, which is then followed by a local detection-and-resetting process of the decentralized observers. The estimation error is shown to be upper-bounded by a constant which is determined only by the system parameters and noise magnitudes. Moreover, we design the detector threshold to ensure that the benign sensors never trigger the detector. The efficacy of the proposed algorithm is demonstrated by its application on a benchmark example of IEEE 14-bus system. © 2022, CC BY-NC-ND.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

Low-Cost Approach for Improving Video Transmission Efficiency in WVSN

引用

Journal of Shanghai Jiaotong university(Science) 2020年第5期25卷 600-605页

作者： LIU Min DENG Bin TANG Ying WU Minghu WANG Juan Hubei Key Laboratory for High-Efficiency Utilization of Solar Energy and Operation Control of Energy Storage System.Hubei University of Technology Wuhan 430068.China Department of Electrical and Computer Engineering.Rowan University GlassboroNJ 08028USA State Key Laboratory of Management and Control for Complex Systems Institute of AutomationChinese Academy of SciencesBeijing 100190China Institute of Smart Education Qingdao Academy of Intelligent IndustriesQingdao 266041ShandongChina

The wireless visual sensor network(WVSN)as a new emerged intelligent visual system,has been applied in many video monitoring ***,there is still great challenge because of the limited wireless network *** resolve the problem,we propose a real-time dynamic texture approach which can detect and reduce the temporal redundancy during many successive image ***,an adaptively learning background model is improved to discover successive similar image frames from the inputting video ***,the dynamic texture model based on the singular value decomposition is adopted to distinguish foreground and background element ***,a background discarding strategy based on visual motion coherence is proposed to determine whether each image frame is streamed or *** evaluate the trade-off performance of the proposed method,it is tested on the CDW-2014 dataset,which can accurately detect the first foreground frame when the moving objects of interest appear in the field of view in the most tested dynamic scenes,and the misdetection rate of the undetected foreground frames is near to *** to the original stream,it can reduce the occupied bandwidth a lot and its computational cost is relatively lower than the state-of-the-art methods.

关键词： wireless visual sensor network(WVSN) temporal redundancy foreground background dynamic texture

来源：评论

学校读者我要写书评

暂无评论

A Many-Objective Evolutionary Algorithm Assisted by Ideal Hyperplane

SSRN

引用

SSRN 2022年

作者： Zhang, Zhixia Wen, Jie Wang, Hui Cai, Xingjuan Cui, Zhihua Zhang, Wensheng School of Computer Science and Technology Taiyuan University of Science and Technology China School of Information Engineering Nanchang Institute of Technology Nanchang330099 China State Key Laboratory of Intelligent Control and Management of Complex System Institute of Automation Chinese Academy of Sciences China State Key Lab. for Novel Software Technology Nanjing University China

In many-objective optimization problems (MaOPs), it is a difficult task for evolutionary algorithms to balance convergence and diversity while rapidly converging to the Pareto front. As the number of objectives increases, the difficulty of evolutionary algorithms increases with individual selection pressure. To address above problems, we propose a many-objective evolution algorithm assisted by an ideal hyperplane (MaOEA-IH). Firstly, the ideal hyperplane as a reference surface to guide the individual to search the Pareto front, which is established from the extremum of each dimension of the objective space. Secondly, a parallel p -norm mating selection strategy is proposed to improve convergence. In addition, two factors are considered in this strategy: 1) different p -norm are used to measure different spatial scales;2) individual selection uncertainty is defined by incorporating a probabilistic perturbation mechanism. Thirdly, the improved shift-based density estimation strategy is used as the evaluation criterion for environmental selection to improve the convergence and diversity of solution sets and enhance selection pressure. To verify the effectiveness of the proposed algorithm, MAOEA-IH is compared with seven excellent algorithms in three benchmark sets (DTLZ, WFG and MaF). The results show that the proposed MAOEA-IH is highly competitive in solving MaOPs. © 2022, The Authors. All rights reserved.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Fusionplanner: A Multi-Task Motion Planner for Mining Trucks Using Multisensor Fusion Method

SSRN

引用

SSRN 2023年

作者： Teng, Siyu Chen, Long Li, Luxi Li, Yuchen Hu, Xuein Li, Lingxi Ai, Yunfeng Department of Computer Science Hong Kong Baptist University Hong Kong The School of Artificial Intelligence Hubei University Wuhan China State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences China Waytous Inc. Haidian Distinct Beijing China Indianapolis United States School of Artificial Intelligence University of Chinese Academy of Sciences Beijing China

In recent years, significant achievements have been made in motion planning for intelligent vehicles. However, as a typical unstructured environment, open-pit mining attracts limited attention due to its complex operational conditions and adverse environmental factors. A comprehensive paradigm for unmanned transportation in open-pit mines is proposed in this research, including a simulation platform, a testing benchmark, and a trustworthy and robust motion planner. Firstly, we introduce the Parallel Mining Simulator (PMS), a high-fidelity simulator specifically designed for open-pit mining scenarios. PMS enables to management and control of open-pit mine transportation from both the single-truck control and multi-truck scheduling perspectives. Then, we develop a novel benchmark called MiningNav, which offers three validation approaches suitable for transportation roads. The purpose of MiningNav is to evaluate the trustworthiness and robustness of algorithms in open-pit mines. Finally, we propose the first multi-task motion planning algorithm, called FusionPlanner, for the mining truck by the multisensor fusion method to adapt both lateral and longitudinal control tasks for unmanned transportation. We validate the performance of our planner using MiningNav in PMS, and empirical results demonstrate a significant reduction in the number of collisions and takeovers of FusionPlanner, thereby improving overall trustworthiness and robustness. © 2023, The Authors. All rights reserved.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

A Prediction Approach Based on Long Short-Term Memory Networks for Dynamic Multiobjective Optimization

SSRN

引用

SSRN 2024年

作者： Xu, Biao Rang, Gejie Li, Wenji Fan, Zhun Gong, Dunwei Yang, Shengxiang He, Jie College of Engineering Shantou University Shantou515063 China College of Automation and Electronic Engineering Qingdao University of Science and Technology Qingdao266100 China Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University Wuzhou543002 China School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom School of Energy and Mechanical Engineering Nanchang Institute of Technology Nanchang330013 China Minjiang University China

Dynamic multiobjective optimization problems (DMOPs) have posed considerable hurdles for traditional evolutionary optimization techniques due to the perpetual variations in their Pareto-optimal sets (PSs) and fronts (PFs). Prediction-based methods have shown promise in swiftly tracking these alterations. However, the majority of current methods rely on linear models to anticipate changing PSs, which can be limiting. When PSs across different environments exhibit nonlinear patterns, accurately predicting the PS in a novel problem becomes challenging. To address this issue, this study introduces a dynamic multiobjective evolutionary optimization algorithm leveraging long short-term memory (LSTM) network predictions. In our approach, the PS of each problem is first divided into several clusters, and the center of each cluster can then be obtained. Thereafter, the cluster centers for the PSs of the problems with different environments form a number of time series. Subsequently, the LSTM network models are trained using the time seriesdata as training samples. Furthermore, the cluster centers of the new PS are predicted utilizing the trained models. LSTM networks excel at capturing historical information and modeling nonlinear relationships, ensuring high prediction accuracy. To enhance the algorithm’s performance, a novel population-generation strategy is employed, ensuring a well-converged and diverse initial population. The proposed algorithm is rigorously tested using benchmark functions, and the results demonstrate its effectiveness in handling DMOPs, outperforming state-of-the-art algorithms. © 2024, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Point Cloud Completion by Larger Receptive Fields for Intelligent Vehicles

Point Cloud Completion by Larger Receptive Fields for Intell...

引用

International Conference on Intelligent Transportation

作者： Yunqing Zhang Xiaotong Zhang Kunhua Liu Yisheng Lv Wei He Long Chen School of Computer Science and Engineering Sun Yat-Sen University Guangzhou China School of Mechanical and Automotive Engineering Qingdao University of Technology Qingdao China State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China School of Intelligence Science and Technology University of Science and Technology Beiing Beijing China Waytous Inc. Beijing China

Point cloud completion is a critical task for intelligent vehicles in the Intelligent Transportation Systems (ITS). Due to the disordered nature of point clouds, current point-based point completion methods utilize max pooling operations and Convolutional Neural Networks (CNNs) with a convolution kernel size of 1 to extract point features. However, a network with a kernel size of 1 has a small receptive field and can only extract one point feature at a time; as a result, such a network struggles to precisely extract highly abstracted features. To address this issue, we propose a point cloud completion network with larger receptive fields, termed PLRF-Net, which is composed of two parts: a reconstruction network and a completion network. The reconstruction network focuses on repairing the structures of partial points and includes an offset-attention embedding module, a rearrangement module, several convolution layers with varying kernel sizes, a pooling and repeating layer, and transposed convolution layers with different kernel sizes. Meanwhile, the completion network strives to improve the precision of the completed point cloud and consists of several convolution layers, along with a downsampling and upsampling module. Experimental results indicate that our approach achieves superior quantitative and qualitative outcomes on both the Multiview Partial Point Cloud (MVP) and KITTI datasets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater’s Condition

arXiv

引用

arXiv 2023年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. Lab for Information & Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems China The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China School of Electrical and Electronic Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with adversarial constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize network regret and cumulative constraint violation. A novel distributed online algorithm is proposed and it achieves an O(T max{c,1−c}) network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the number of rounds and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T 1−c). Moreover, if the loss functions are strongly convex, then the network regret bound is reduced to O(log(T)), and the network cumulative constraint violation bound is reduced to O(√log(T)T) and O(log(T)) without and with Slater’s condition, respectively. To the best of our knowledge, this paper is the first to achieve reduced (network) cumulative constraint violation bounds for (distributed) online convex optimization with adversarial constraints under Slater’s condition. Finally, the theoretical results are verified through numerical simulations. Copyright © 2023, The Authors. All rights reserved.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：