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

Optimization of Grouping Evacuation Strategy in High-rise Building Fires Based on Graph Theory and Computational Experiments

引用

IEEE/CAA Journal of Automatica Sinica 2018年第6期5卷 1104-1112页

作者： Yuling Hu Xiwei Liu School of Electrical and Information Engineering Beijing University of Civil Engineering and Architecture Beijing 100044China Beijing Key Laboratory of Intelligent Processing for Building Big Data Beijing 100044China State Key Laboratory fo Management and Control for Complex Systems Institute of Automation Chinese Academy of SciencesBeijing 100190China Qingdao Academy of Intelligent Industries Qingdao 266109China

It is difficult to rescue people from outside, and emergency evacuation is still a main measure to decrease casualties in high-rise building fires. To improve evacuation efficiency, a valid and easily manipulated grouping evacuation strategy is proposed. Occupants escape in groups according to the shortest evacuation route is determined by graph theory. In order to evaluate and find the optimal grouping, computational experiments are performed to design and simulate the evacuation processes. A case study shown the application in detail and quantitative research conclusions is obtained. The thoughts and approaches of this study can be used to guide actual high-rise building evacuation processes in future.

关键词： Computational experiments grouping evacuation graph theory high-rise building fire management strategies

来源：评论

学校读者我要写书评

暂无评论

Algorithm for elliptic curve diffie-hellman key exchange based on DNA tile self-assembly

Algorithm for elliptic curve diffie-hellman key exchange bas...

引用

作者： Cheng, Zhen Huang, Yufang Chen, Zhihua Shi, Xiaolong Xu, Jin Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology 430074 Wuhan China School of Electronics Engineering and Computer Science Peking University 100871 Beijing China

DNA tile self-assembly is a promising paradigm for nanotechnology. Recently, many researches show that computation by DNA tile self-assembly maybe scalable. In this paper, we propose the algorithm for elliptic curve Diffie-Hellman key exchange based on DNA tile self-assembly. First we give the DNA tile self-assembly model to compute the scalar multiplication, then we can successfully implement the Diffie-Hellman key exchange over elliptic curve by extracting the result strand of the scalar multiplication. Copyright © 2010 American Scientific Publishers. All rights reserved.

关键词： Self assembly

来源：评论

学校读者我要写书评

暂无评论

Fog images Generation About Unmanned Surface Vessels with Improved Generative Adversarial Network 42

Fog Images Generation About Unmanned Surface Vessels with Im...

引用

42nd Chinese control Conference, CCC 2023

作者： Tang, Yifeng Huang, Zhihui Tang, Chuancong Luo, Chuanshang Xu, Yifan Liu, Bin Zhang, Hai-Tao School of Artificial Intelligence and Automation The Engineering Research Center of Autonomous Intelligent Unmanned Systems The Key Laboratory of Image Processing and Intelligent Control Wuhan430074 China The State Key Laboratory of Digital Manufacturing Equipment and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9789887581543

This paper proposes a fog weather data augmentation method for the unmanned surface vessels (USVs) via improved Generative Adversarial Network(GAN) model. First, a generator scheme for GAN is proposed with the guided generation of the atmospheric scattering model in this paper. A Laplacian Pyramid Based Depth Residuals model is added to the generator which reduces the difficulty of generating fog images caused by the degradation of water surface image and improves the quality of generated images. Finally, fog images are generated from sunny weather images collected with HUST-12C by LPBDR-GAN model and experiments show that generated images are very close to real fog images. © 2023 Technical Committee on control Theory, Chinese Association of Automation.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Task Allocation and Path Planning for Multiple Destinations Oriented Towards Task Updates 6

Task Allocation and Path Planning for Multiple Destinations ...

引用

6th International Conference on Industrial Artificial Intelligence, IAI 2024

作者： Yang, Yong He, Dingxin Mao, Huantao Chen, Hong Wu, Hongtao Liu, Zhi-Wei Huazhong University of Science and Technology School of Artificial Intelligence and Automation China Huazhong University of Science and Technology Key Laboratory of Image Processing and Intelligent Control Ministry of Education Wuhan430074 China

ISBN: (纸本)9798350356618

This study addresses the complexities of orchestrating multi-target transportation tasks within multi-agent systems, constrained by load capacity. The primary objective is to engineer an advanced path planning framework that assures collision avoidance and optimal load distribution. Diverging from conventional single-path strategies, this research incorporates load factors and requires continuous dynamic multi-target point and path planning to ensure agents can efficiently navigate through a series of predetermined key points. To address this complex requirement, a two-stage multi-agent task allocation and path planning method is proposed. First, an initial solution is obtained using a suboptimal algorithm, followed by optimization iterations using the large neighborhood search algorithm to improve task allocation. In the second stage, an accelerated algorithm based on priority search is used to plan optimal paths for each agent in a predetermined order. The proposed algorithm's effectiveness is comprehensively evaluated through a series of experimental evaluations and comparisons with the commercial solver Gurobi within a limited time. The results show that the proposed method achieves optimality in both running time and minimum path cost while ensuring the load balance of agents. © 2024 IEEE.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Fast KNN search for big data with set compression tree and best bin first 2

Fast KNN search for big data with set compression tree and b...

引用

2nd International Conference on Cloud Computing and Internet of Things, CCIOT 2016

作者： Chen, Zhenjie Yan, Jingqi Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Key Laboratory of Ministry of Education for System Control and Information Processing China Shanghai China

ISBN: (纸本)9781467398213

This paper proposes k nearest neighbors (kNN) search based on set compression tree (SCT) and best bin first (BBF) to deal with the problem for big data. The large compression rate by set compression tree is achieved by compressing the set of descriptors jointly instead of compressing on a per-descript or basis. So set compression tree has a good performance in kNN search at a low bit rate. At the same time, the best bin first (BBF) is a very efficient algorithm to find the approximately kNN from a large number of high dimensional feature descriptors. SCT-BBF is a novel exploration and it improves search performance in three aspects: First, SCT-BBF requires less memory footprint, which is important in big data age. Second, it increases accuracy compared traditional method like KD-Tree and original SCT. SCT-BBF can be used with other data processing methods like PCA and SIFT to perform better. Third, this paper adopts finer search to increase accuracy at a slight loss of speed. And it can extend to big data easily. © 2016 IEEE.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

A Switching Approach to Designing Finite-Time Synchronization controllers of Coupled Neural Networks

引用

IEEE Transactions on Neural Networks and Learning Systems 2016年第2期27卷 471-482页

作者： Liu, Xiaoyang Su, Housheng Chen, Michael Z. Q. School of Computer Science and Technology Jiangsu Normal University Xuzhou221116 China Image Processing and Intelligent Control Key Laboratory School of Automation Huazhong University of Science and Technology Wuhan430074 China Department of Mechanical Engineering University of Hong Kong Hong Kong Hong Kong

This paper is concerned with the finite-Time synchronization issue of nonlinear coupled neural networks by designing a new switching pinning controller. For the fixed network topology and control strength, the newly d... 详细信息

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

Attention-stacking adaptive fuzzy neural networks for autism diagnosis

Attention-stacking adaptive fuzzy neural networks for autism...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Zhang, Shuzhan Xiao, Lei Huang, Hui Hu, Zhongyi Wenzhou University Institute of Intelligent Information System Wenzhou University Key Laboratory of Intelligent Image Processing and Analysis College of Computer Science and Artificial Intelligence Wenzhou China

ISBN: (纸本)9798350386226

The current diagnostic methods for Autism Spectrum Disorder (ASD) based on Resting-State Functional Magnetic Resonance Imaging (rs-fMRI) face two significant challenges. Firstly, the functional connectivity networks (FCNs) of the brain are subject to uncertainty due to noise interference during the rs-fMRI acquisition process. Secondly, variations in equipment parameters across different imaging sites lead to diverse distributions of collected features. To address these issues, this paper introduces a novel Multi-Task Stacked Adaptive Fuzzy Neural Network (AT-STTSK) specifically designed for Autism Spectrum Disorder (ASD) classification. The proposed network seamlessly integrates a Multi-Output TSK (MO-TSK) fuzzy system, a Stacked Autoencoder (SAE), and a Transformer. This integration aims to reduce the impact of uncertainty factors, enhance the model's interpretability, and leverage the multi-head attention mechanisms to capture both local and global information, thus strengthening feature learning. Additionally, we explore the utilization of a Contrastive Learning (CL) strategy to further optimize the model. By incorporating these advancements, our AT-STTSK network offers a promising approach for improving the accuracy and reliability of ASD diagnosis based on rs-fMRI data. The validity of the method in this paper is verified on ABIDE dataset, and the result shows that the accuracy rate can reach 85.7% at most. © 2024 IEEE.

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

image fusion algorithm using nonsubsampled contourlet transform

Image fusion algorithm using nonsubsampled contourlet transf...

引用

MIPPR 2007: Multispectral image processing

作者： Yang, Xiao Zhiguo, Cao Kai, Wang Zhengxiang, Xu Institute of Pattern Recognition and Artificial Intelligence State Education Commission Key Laboratory for Image Processing and Intelligent Control Huazhong Uni. of Sci. and Tech. Wuhan 430074 China

ISBN: (纸本)9780819469519

In this paper, a pixel-level image fusion algorithm based on Nonsubsampled Contourlet Transform (NSCT) has been proposed. Compared with Contourlet Transform, NSCT is redundant, shift-invariant and more suitable for image fusion. Each image from different sensors could be decomposed into a low frequency image and a series of high frequency images of different directions by multi-sacle NSCT. For low and high frequency images, they are fused based on local-contrast enhancement and definition respectively. Finally, fused image is reconstructed from low and high frequency fused images. Experiment demonstrates that NSCT could preserve edge significantly and the fusion rule based on region segmentation performances well in local-contrast enhancement.

关键词： image fusion

来源：评论

学校读者我要写书评

暂无评论

Motion Blurred Star image Centroid Optimized Extraction Based on Prior Gaussian Distribution 29

Motion Blurred Star Image Centroid Optimized Extraction Base...

引用

第29届中国控制与决策会议

作者： Peng Dingbang Chen Hao Sang Xiaochong Li Jianxun School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai Institute of Spaceflight Control Technology Shanghai Key Laboratory of Aerospace Intelligent Control Technology

ISBN: (纸本)9781509046584

Star centroid extraction is the precondition of star recognition in star navigation *** image will be motion blurred under high dynamic *** methods such as Wiener filter method,restore the blurred star image with an estimated PSF to calculate the star *** unique characteristic of star images different from general images is ignored in conventional *** addition,the error of motion blur parameters estimation and the approximate linear motion model can decrease the accuracy of star centroids *** paper proposes a method utilizing the prior Gaussian distribution information of star energy to deal with the motion blurred star *** experimental results demonstrate that the proposed method gets smaller error in star centroids calculation compared with the conventional estimation method.

关键词： Motion blur Star image restoration Centroid extraction Gaussian distribution Optimize

来源：评论

学校读者我要写书评

暂无评论

Replaying Styles for Continual Semantic Segmentation Across Domains 7th

Replaying Styles for Continual Semantic Segmentation Across...

引用

7th Asian Conference on Pattern Recognition, ACPR 2023

作者： Deng, Yao Xiang, Xiang Key Lab of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783031476365

In the context of Domain Incremental Learning for Semantic Segmentation, catastrophic forgetting is a significant issue when a model learns new geographical domains. While replay-based approaches have been commonly used to mitigate this problem by allowing the model to review past knowledge, they require additional storage space for old data, which may not be feasible in real-world applications. To address this limitation, we propose a style replay method that leverages the characteristics of low-level representations in CNN to require only one style feature for each domain, leading to a significant reduction in storage overhead. By fusing the style features of past domains with the semantic features of current data, our method enables style transfer for new domain data, thereby improving the model’s generalization ability to the domain. Through extensive experimental evaluations on various autonomous driving datasets, we demonstrate the efficacy of our proposed method in addressing the challenges of continual semantic segmentation under both label and domain shift, outperforming the previous state-of-the-art methods. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：