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

arXiv 2021年

作者： Huang, Jing-Hui Duan, Xue-Ying Wang, Guang-Jun Hu, Xiang-Yun Institute of Geophysics and Geomatics China University of Geosciences Wuhan430074 China School of Automation China University of Geosciences Wuhan430074 China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan430074 China Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education China State Key Laboratory of Geological Processes and Mineral Resources China University of Geosciences Hubei Wuhan430074 China

Recently, weak value Aw derived in the pre- and post-selected weak measurement has been shown to be powerful in measuring minute physical effects. In principle, the decrease in the post-selection probability will increase the sensitivity. Besides, the sensitivity which characterizes the pointer position shift is proportional to the real part of Aw, and the sensitivity which characterizes the pointer shift in momentum space is proportional to the imaginary part of Aw. However, we find that the relationship between the post-selection probability and the sensitivity is true when Aw is a purely real number or a purely imaginary number. The plural Aw will lead to the abnormal behavior where the decrease in the post-selection probability reduce the sensitivity at certain pre- and post-selection. In addition, considering the device imperfections and the environmental instability in the WVA protocol, this anomaly raised from plural Aw will reduce the sensitivity and generate a systematic error of the measurement compared with the original scheme. Finally, three feasible methods are proposed to reduce these negative effects when the weak measurement inevitably changes into measurement with a plural weak value. © 2021, CC BY.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

A Reinforcement-Learning-Based Evolutionary Algorithm Using Solution Space Clustering For Multimodal Optimization Problems

A Reinforcement-Learning-Based Evolutionary Algorithm Using ...

引用

Congress on Evolutionary Computation

作者： Hai Xia Changhe Li Sanyou Zeng Qingshan Tan Junchen Wang Shengxiang Yang School of Automation China University of Geosciences Wuhan China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems School of Mechanical Engineering and Electronic Information China University of Geosciences Wuhan China School of Computer Science and Informatics De Montfort University Leicester United Kingdom

In evolutionary algorithms, how to effectively select interactive solutions for generating offspring is a challenging problem. Though many operators are proposed, most of them select interactive solutions (parents) randomly, having no specificity for the features of landscapes in various problems. To address this issue, this paper proposes a reinforcement-learning-based evolutionary algorithm to select solutions within the approximated basin of attraction. In the algorithm, the solution space is partitioned by the k-dimensional tree, and features of subspaces are approximated with respect to two aspects: objective values and uncertainties. Accordingly, two reinforcement learning (RL) systems are constructed to determine where to search: the objective-based RL exploits basins of attraction (clustered subspaces) and the uncertainty-based RL explores subspaces that have been searched comparatively less. Experiments are conducted on widely used benchmark functions, demonstrating that the algorithm outperforms three other popular multimodal optimization algorithms.

关键词： Uncertainty Clustering algorithms Evolutionary computation Reinforcement learning Benchmark testing Search problems Feature extraction

来源：评论

学校读者我要写书评

暂无评论

A Novel Scalable Framework For Constructing Dynamic Multi-objective Optimization Problems

A Novel Scalable Framework For Constructing Dynamic Multi-ob...

引用

Congress on Evolutionary Computation

作者： Qingshan Tan Changhe Li Hai Xia Sanyou Zeng Shengxiang Yang School of Automation China University of Geosciences Wuhan China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems School of Mechanical Engineering and Electronic Information China University of Geosciences Wuhan China School of Computer Science and Informatics De Montfort University Leicester United Kingdom

Modeling dynamic multi-objective optimization problems (DMOPs) has been one of the most challenging tasks in the field of dynamic evolutionary optimization. Based on the analysis of the existing DMOPs, several features widely existed in real-world applications are not taken into account: different objectives may have different function models and variables to be optimized; and the number of conflicting variables should be independent from the number of objectives; the time-linkage property is not considered. In order to overcome the above issues, a novel framework for constructing DMOPs is proposed, where all objectives can be designed independently, and the number of the conflicting variables can be tuned by users. Moreover, it is easy to add new dynamic features to this framework. Several classical dynamic multi-objective optimization algorithms are tested on four scenarios, results show that these characteristics are challenging for the existing algorithms.

关键词： Schedules Analytical models Heuristic algorithms Object oriented modeling Evolutionary computation Benchmark testing Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

Diffusion-Induced Barrier Coverage of Multi-Layer Robotic Sensing Networks With Adaptive Scheduling Strategy

引用

International Journal of Robust and Nonlinear control 2025年

作者： Fan, Pengyang Zhai, Chao Zhang, Hehong School of Automation China University of Geosciences Wuhan China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems China University of Geosciences Wuhan China Engineering Research Center of Intelligent Technology for Geo-exploration Ministry of Education China University of Geosciences Wuhan China College of Computer and Data Science Fuzhou University Fuzhou China

The timely identification of external intruders is crucial to the protection of concerned regions or targets against malicious attacks. Multi-agent barrier coverage provides a powerful framework for the effective deployment of sensor networks to monitor baleful intruders. This paper aims to address the barrier coverage problem of robotic sensing networks by developing a multi-layer coverage formulation. Inspired by gas diffusion, a group of robotic sensors are scattered to expand the coverage territory from a gathering spot. With the assistance of a divide-and-conquer scheme, a distributed control algorithm is proposed to partition the defence barrier into multiple curve segments and integrate it with intruder monitoring. By adaptively scheduling robotic sensors among multi-layer networks, it contributes to maximizing the joint detection probability of sensing networks against external intruders. Moreover, theoretical analysis is conducted to acquire sufficient conditions for elevating the detection quality of a multi-layer sensing network. Finally, numerical simulations and robotic experiments are carried out to demonstrate the effectiveness of the proposed barrier coverage approach. © 2025 John Wiley & Sons Ltd.

关键词： Distributed parameter control systems

来源：评论

学校读者我要写书评

暂无评论

Adaptive control for asynchronously switched fractional-order multi-agent systems

Adaptive control for asynchronously switched fractional-orde...

引用

第三十九届中国控制会议

作者： Xiongliang Zhang Shiqi Zheng Feng Liu Mingyuan Zhao Yuan Sun School of Automation China University of Geosciences Hubei Key Laboratory of Advanced Control and Intelligent Automation of Complex Systems School of Electrical and Electronic Engineering The University of Adelaide

In this paper, we discuss the adaptive controller design for a class of fractional-order（FO） multi-agent systems（MAS）.All the agents are described by FO pure-feedback nonlinear systems. This is more general than the existing works, which only considered strict-feedback or integer-order nonlinear systems. Meanwhile, asynchronous switching are considered in FO MAS,meaning the agents have heterogeneous switching dynamics. A new neural network based adaptive controller is proposed for the considered FO MAS, which can make the consensus tracking error converge to a small neighborhood of origin. Simulation verifies the results obtained.

关键词： Consensus tracking fractional-order multi-agent systems asynchronously switched systems

来源：评论

学校读者我要写书评

暂无评论

H∞ Consensus control for Discrete-Time Stochastic Multi-agent systems with Infinite Markov Jumps

H∞ Consensus Control for Discrete-Time Stochastic Multi-age...

引用

Annual Conference of Industrial Electronics Society

作者： Jie Wang Xin Chen School of Automation China University of Geosciences Wuhan P. R. China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems

ISBN: (数字)9781728154145

ISBN: (纸本)9781728154152

This paper focuses on multi-agent systems under the disturbances of parameter uncertainties, noises and external disturbances simultaneously, which are more suitable for the changing environments than most ideal models. For this case, the robust H∞ consensus control problem is studied to attenuate the influence of disturbances below a given level. We aim to design a consensus controller such that the closed-loop muti-agent systems reach the desired H ∞ performance. By tools of Kronecker product, graph theory, and infinite horizon bounded real lemma, sufficient conditions for existence of H ∞ consensus protocol design are obtained in terms of linear matrix inequalities (LMIs). Finally, a numerical example is given to show the validity of the method.

关键词： Multi-agent systems Symmetric matrices Markov processes Stochastic systems Robot sensing systems Eigenvalues and eigenfunctions Topology

来源：评论

学校读者我要写书评

暂无评论

KSLIC: K-mediods clustering based simple linear iterative clustering 1

引用

2nd Chinese Conference on Pattern Recognition and Computer Vision, PRCV 2019

作者： Zhang, Houwang Zhu, Yuan School of Automation China University of Geosciences Wuhan430074 China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan430074 China

ISBN: (数字)9783030317232

ISBN: (纸本)9783030317225

Simple Linear Iterative Clustering (SLIC) is one of the most excellent superpixel segmentation algorithms with the most comprehensive performance and is widely used in various scenes of production and living. As a preprocessing step in image processing, superpixel segmentation should meet various demands in real life as much as possible, but SLIC is highly sensitive to noise. In this paper, a K-mediods clustering based simple linear iterative clustering (KSLIC) is proposed, which replaces the K-means clustering in SLIC with a modified local K-mediods clustering. To evaluate the performance of KSLIC, we test it on BSD500 benchmark dataset. The results show that it outperforms SLIC in terms of different noise environments including Gaussian noise, multiplicative noise and salt and pepper noise. © Springer Nature Switzerland AG 2019.

关键词： Salt and pepper noise

来源：评论

学校读者我要写书评

暂无评论

Chinese Calligraphy Character Generating via CGAN with a Multi-subnet Parallel and Cascade Generator

Chinese Calligraphy Character Generating via CGAN with a Mul...

引用

第三十九届中国控制会议

作者： Xiaoxue Zhou Ziying Zhang Xin Chen Mengxi Qin School of Automation China University of Geosciences Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems School of Arts and Communication China University of Geosciences

Chinese character generation is one of the key technologies in Chinese character intelligent design. Most generation methods cannot solve the situation where the generated Chinese character strokes have artifact or even miss. The main reason is that the generator is not strong enough. Therefore, in this paper, we propose a multi-subnet parallel and cascade generator, which combines the conditional generation adversarial network（CGAN） to realize the generation of calligraphy Chinese *** method divides a Chinese character generation task into several parts undertaken by each sub-generator, and the output of each sub-generator will contain certain image information, which will increase with the rise of sub-generator hierarchy. It allows each sub-generator to focus on its own task, generating more realistic characters eventually. Finally, the test set performs better than the CGAN with a single generator.

关键词： CGAN Chinese calligraphy character generation Multi-subnet parallel and cascade generator

来源：评论

学校读者我要写书评

暂无评论

An IoT Edge Computing System Architecture and its Application

An IoT Edge Computing System Architecture and its Applicatio...

引用

2020 IEEE International Conference on Networking, Sensing and control, ICNSC 2020

作者： Chen, Shichao Li, Qijie Zhang, Hua Zhu, Fenghua Xiong, Gang Tang, Ying Macau University of Science and Technology State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences China Beijing University of Technology State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China Beijing Aerospace Smart Manufacturing Technology Development Co. Ltd Platform Research and Development Department Beijing China State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China Engineering Research Center of Intelligent Systems and Technology Institute of Automation Cloud Computing Center Chinese Academy of Sciences Beijing China Rowan University Department of Electrical and Computer Engineering GlassboroNJ United States Institute of Smart Education Qingdao Academy of Intelligent Industries Qingdao China

ISBN: (纸本)9781728168531

As the number of devices connected to the Internet of things (IoT) surges, the amount of data explodes. Therefore it not only increases the bandwidth load of data transmission but also aggravates the computing and storage load of a cloud platform. At the same time, the traditional computing paradigm centered on cloud computing cannot meet the real-time requirements in many application scenarios. The emergence of edge computing can solve the problems of realtime data processing and network bandwidth occupation in the current IoT scene. In this paper, according to the characteristics of IoT, such as fragmented data, heterogeneous network, and limited energy consumption, the architecture of an IoT edge computing system is constructed to suit better an IoT scene. In addition, the application of edge computing key technologies such as virtualization, edge intelligence, computing offload, collaborative scheduling and micro-services in resource-constrained IoT scenarios is analyzed in detail. Finally, the functions and application of energy consumption monitoring and optimization to a central air-conditioning system are analyzed and summarized, which is a typical application of edge computing in the context of the IoT. © 2020 IEEE.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

Overlapped Human Pose Estimation using Non-Maximum Suppression based on Shape Similarity

Overlapped Human Pose Estimation using Non-Maximum Suppressi...

引用

Chinese automation Congress (CAC)

作者： Xuefu Yu Jinsheng Li Fei Xiao Wei Liu Dapeng Luo Longsheng Wei School of Automation China University of Geosciences Wuhan China Key Laboratory of Geological Survey and Evaluation of Ministry of Education Wuhan China Hubei key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan China Intelligent Technology co. Ltd of Chinese Construction Third Engineering Bureau Wuhan China School of Electronic Information and Mechanics China University of Geosciences Wuhan China

ISBN: (纸本)9781665426480

Deep Convolutional Neural Networks (DNNs) have made significant progress on human pose estimation task in recent years. However, the question of whether we are making the most use of the information we get from DNNs has not been well studied. Top-down approach which first detects person body box then utilizes single person pose estimation by heatmap is a widely used method in multi-person pose estimation. However, information that predicted by DNNs contains more information than we consider. In person box prediction process, when two persons are closed to each other, the Non-Maximum Suppression (NMS) we often use filters out the body boxes with smaller scores. For tackling this problem, we apply NMS based on Shape Similarity to person body boxes detection for tackling the problem that deleting the overlapped body boxes with smaller scores, and then extract keypoint coordinates and tag information for filter noise candidates from heatmap by Trasformer to improve the prediction accuracy. At last we develop an algorithm for refining keypoint coordinate by tag information. In experiment, we got mean Average Precision(mAP) of 76.0% in COCO2017 validation dataset, better than 75.6% with TransPose.

关键词： Heating systems Shape Pose estimation Refining Filtering algorithms Information filters Prediction algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：