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

Chinese Control and Decision Conference, CCDC

作者： Xincheng Han Hongyan Ma Wei He Shun Wang School of Electrical and Information Engineering Beijing University of Civil Engineering and Architecture Beijing China School of Electrical and Information Engineering Institute of Distributed Energy Storage Safety Big Data Beijing Key Laboratory of Intelligent Processing for Building Big Data Beijing University of Civil Engineering and Architecture Beijing China

ISBN: (数字)9798350387780

ISBN: (纸本)9798350387797

College laboratory buildings have dense population, numerous electrical devices, and high fire risk. However, the existing evacuation A* algorithm has the disadvantages of long time and poor adaptability. In order to effectively solve the problems of long evacuation simulation time, low efficiency, and inability to change evacuation directions according to fire conditions in college laboratory buildings, this paper proposes an improved A* algorithm. This paper improves the heuristic function in the A* algorithm by introducing a logarithmic decay factor. By changing the weight of the estimated cost, it reduces the number of unnecessary search nodes and steers the search algorithm in the correct direction, thereby improving search efficiency. Secondly, it introduces a bidirectional A* search strategy to reduce search nodes and improve the efficiency of the algorithm. Simulation results show that the improved A* algorithm has fewer traversed nodes, shorter search paths, and higher search efficiency, which verifies the effectiveness and feasibility of the improved A* algorithm in experimental building fire evacuation. This study provides a solution for fire evacuation in college laboratory buildings.

关键词： Heuristic algorithms Simulation Buildings Sociology Laboratories Search problems Path planning

来源：评论

学校读者我要写书评

暂无评论

Specific Design and Implementation of the Characteristic Species database in Wuling Mountain Area

Specific Design and Implementation of the Characteristic Spe...

引用

Information Technology, Communication Ecosystem and Management (ITCEM), International Conference on

作者： Shaowei Deng Yujun Yang Yimei Yang College of Computer and Artificial Intelligence(Software College) Huaihua University Huaihua Hunan China Key Laboratory of Wuling-Mountain Health Big Data Intelligent Processing and Application in Hunan Province Universities Huaihua Hunan China Key Laboratory of Intelligent Control Technology for Wuling-Mountain Ecological Agriculture in Hunan Province

ISBN: (数字)9798331542696

ISBN: (纸本)9798331542702

This article aims to design and implement a database system for characteristic species in the Wuling Mountain area. The system will collect, organize, store, and analyze information on characteristic species in the Wuling Mountain area, providing data support for ecological research, biodiversity conservation, agricultural production, and other fields. This article will provide a detailed introduction to database requirements analysis, data model design, database structure implementation, data security management, and system testing and optimization.

关键词： System testing data security Ecosystems Production database systems data models Biodiversity Information technology Optimization

来源：评论

学校读者我要写书评

暂无评论

Automatic Life Event Tree Generation for Older Adults 1

引用

24th International Conference on Human-Computer Interaction, HCII 2022

作者： Gui, Fang Wu, Xi Hu, Min Yang, Jiaoyun School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei China National Smart Eldercare International S&T Cooperation Base Hefei University of Technology Hefei China Laboratory of Affective Computing and Advanced Intelligent Machine Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China

ISBN: (数字)9783031179020

ISBN: (纸本)9783031179013

Studies have shown that learning personal stories could help provide individualized eldercare services. However, personal stories are often disordered because of the scattered collection, including informal interviews or daily interactions, which brings difficulties in acquiring valuable information quickly. One solution to this problem is to extract events from personal stories and automatically organize them in chronological order. Events extracted by current methods from social media or news corpus are mainly organized in a linear structure. These works usually focus on the event time and ignore the consistency of event contents when organizing events. This paper aims to organize events into a tree structure based on an event network, with stem nodes representing key event topics and branch nodes representing detailed events. Social workers or caregivers can clarify the life experience of the older adults quickly through the event tree and have a preliminary understanding of them. The experiments show that the event tree generated by our method has a better performance in consistency than current event organization methods. A survey study shows that our method achieves the highest logical coherence for the event tree branches compared with other algorithms. © 2022, Springer Nature Switzerland AG.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Suppress content shift: better diffusion features via off-the-shelf generation techniques 24

Suppress content shift: better diffusion features via off-th...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Benyuan Meng Qianqian Xu Zitai Wang Zhiyong Yang Xiaochun Cao Qingming Huang Institute of Information Engineering CAS and School of Cyber Security University of Chinese Academy of Sciences Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and Peng Cheng Laboratory Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS School of Computer Science and Tech. University of Chinese Academy of Sciences School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and Key Laboratory of Big Data Mining and Knowledge Management CAS

ISBN: (纸本)9798331314385

Diffusion models are powerful generative models, and this capability can also be applied to discrimination. The inner activations of a pre-trained diffusion model can serve as features for discriminative tasks, namely, diffusion feature. We discover that diffusion feature has been hindered by a hidden yet universal phenomenon that we call content shift. To be specific, there are content differences between features and the input image, such as the exact shape of a certain object. We locate the cause of content shift as one inherent characteristic of diffusion models, which suggests the broad existence of this phenomenon in diffusion feature. Further empirical study also indicates that its negative impact is not negligible even when content shift is not visually perceivable. Hence, we propose to suppress content shift to enhance the overall quality of diffusion features. Specifically, content shift is related to the information drift during the process of recovering an image from the noisy input, pointing out the possibility of turning off-the-shelf generation techniques into tools for content shift suppression. We further propose a practical guideline named GATE to efficiently evaluate the potential benefit of a technique and provide an implementation of our methodology. Despite the simplicity, the proposed approach has achieved superior results on various tasks and datasets, validating its potential as a generic booster for diffusion features. Our code is available at https://***/Darkbblue/diffusion-content-shift.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SCALABLE ATTRIBUTION OF ADVERSARIAL ATTACKS VIA MULTI-TASK LEARNING

arXiv

引用

arXiv 2023年

作者： Guo, Zhongyi Han, Keji Ge, Yao Ji, Wei Li, Yun Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

Deep neural networks (DNNs) can be easily fooled by adversarial attacks during inference phase when attackers add imperceptible perturbations to original examples, i.e., adversarial examples. Many works focus on adversarial detection and adversarial training to defend against adversarial attacks. However, few works explore the tool-chains behind adversarial examples, which can help defenders to seize the clues about the originator of the attack, their goals, and provide insight into the most effective defense algorithm against corresponding attacks. With such a gap, it is necessary to develop techniques that can recognize tool-chains that are leveraged to generate the adversarial examples, which is called Adversarial Attribution Problem (AAP). In this paper, AAP is defined as the recognition of three signatures, i.e., attack algorithm, victim model and hyperparameter. Current works transfer AAP into single label classification task and ignore the relationship between these signatures. The former will meet combination explosion problem as the number of signatures is increasing. The latter dictates that we cannot treat AAP simply as a single task problem. We first conduct some experiments to validate the attributability of adversarial examples. Furthermore, we propose a multi-task learning framework named Multi-Task Adversarial Attribution (MTAA) to recognize the three signatures simultaneously. MTAA contains perturbation extraction module, adversarial-only extraction module and classification and regression module. It takes the relationship between attack algorithm and corresponding hyperparameter into account and uses the uncertainty weighted loss to adjust the weights of three recognition tasks. The experimental results on MNIST and ImageNet show the feasibility and scalability of the proposed framework as well as its effectiveness in dealing with false alarms. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Cross-Ray Neural Radiance Fields for Novel-view Synthesis from Unconstrained Image Collections

Cross-Ray Neural Radiance Fields for Novel-view Synthesis fr...

引用

International Conference on Computer Vision (ICCV)

作者： Yifan Yang Shuhai Zhang Zixiong Huang Yubing Zhang Mingkui Tan South China University of Technology Pazhou Lab Guangzhou Shiyuan Electronics Co. Ltd Key Laboratory of Big Data and Intelligent Robot Ministry of Education

Neural Radiance Fields (NeRF) is a revolutionary approach for rendering scenes by sampling a single ray per pixel and it has demonstrated impressive capabilities in novel-view synthesis from static scene images. However, in practice, we usually need to recover NeRF from unconstrained image collections, which poses two challenges: 1) the images often have dynamic changes in appearance because of different capturing time and camera settings; 2) the images may contain transient objects such as humans and cars, leading to occlusion and ghosting artifacts. Conventional approaches seek to address these challenges by locally utilizing a single ray to synthesize a color of a pixel. In contrast, humans typically perceive appearance and objects by globally utilizing information across multiple pixels. To mimic the perception process of humans, in this paper, we propose Cross-Ray NeRF (CR-NeRF) that leverages interactive information across multiple rays to synthesize occlusion-free novel views with the same appearances as the images. Specifically, to model varying appearances, we first propose to represent multiple rays with a novel cross-ray feature and then recover the appearance by fusing global statistics, i.e., feature covariance of the rays and the image appearance. Moreover, to avoid occlusion introduced by transient objects, we propose a transient objects handler and introduce a grid sampling strategy for masking out the transient objects. We theoretically find that leveraging correlation across multiple rays promotes capturing more global information. Moreover, extensive experimental results on large real-world datasets verify the effectiveness of CR-NeRF. The code and data can be found at https://***/YifYang993/***.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Air quality prediction based on ICEEMDAN-SSA-LSTM

Air quality prediction based on ICEEMDAN-SSA-LSTM

引用

Chinese Control and Decision Conference, CCDC

作者： Yanling Qin Hongyan Ma Wei He School of Electrical and Information Engineering Beijing University of Civil Engineering and Architecture Beijing China School of Electrical and Information Engineering Institute of Distributed Energy Storage Safety Big Data Beijing Key Laboratory of Intelligent Processing for Building Big Data Beijing University of Civil Engineering and Architecture Beijing China

ISBN: (数字)9798350387780

ISBN: (纸本)9798350387797

To address the problem that the Air Quality Index (AQI) is difficult to predict, a prediction model based on Improved Complete Ensemble Empirical Mode Decomposition with Adaptive Noise (ICEEMDAN), Sparrow Search Algorithm (SSA), and Long Short-Term Memory (LSTM) is proposed. First, the AQI sequence was decomposed by ICEEMDAN. Second, the initial learning rate, max training epoch and the number of hidden layers of the LSTM model are optimized by the SSA algorithm to establish the SSA-LSTM model. Last, the results decomposed were imported into the SSA-LSTM model to predict AQI. Compared with the prediction results of the LSTM, CEEMD-LSTM, and CEEMDAN-SSA-LSTM model, the accuracy (measured by correlation coefficients) of the CEEMDAN-SSA-LSTM is 98%. The result confirmed that the ICEEMDAN-SSA-LSTM can obtaining an improvement of the correlation coefficients and reduce the mean square error, which is valuable for engineering applications.

关键词： Training Correlation coefficient Adaptation models Accuracy Empirical mode decomposition Atmospheric modeling Predictive models

来源：评论

学校读者我要写书评

暂无评论

Large-Scale Fingerprint data Retrieval Based C-Means Clustering Model

Large-Scale Fingerprint Data Retrieval Based C-Means Cluster...

引用

Information Technology: IoT and Smart City (ITIoTSC), International Conference on

作者： Decai Wang Xia Chang Weibing Zhang Yuelin Gao The Key Laboratory of Intelligent Information and Big Data Processing of Ningxia Province Yinchuan China School of Math and Information Science North Minzu University Yinchuan China

ISBN: (数字)9798350328349

ISBN: (纸本)9798350328356

In the field of biometric identification, fingerprints, as one of the most unique and persistent biometric features, are widely used for identification. With the popularity of fingerprint recognition in society, how to quickly retrieval fingerprints is a challenging task in large-scale databases. In order to ensure the accuracy of fingerprints retrieval , we propose a new retrieval model based on minutia features. We introduce fuzzy C-means clustering algorithm and Dijkstra *** C-means clustering is used to extract the detail point features in the fingerprint, Dijkstra algorithm to solve the shortest path of the minutia *** number of features and the shortest path distance are compared to determine whether the fingerprints are the same. In this way, our method can achieve fast retrieval. In addition, we conducted extensive experiments on a large-scale datasets and tested the correctness of the experiments by different filtering levels to demonstrate the superiority of our method for fingerprint retrieval.

关键词： Accuracy Filtering databases Smart cities Filtration Clustering algorithms Fingerprint recognition

来源：评论

学校读者我要写书评

暂无评论

Fu-W:A Hyperspectral Image Classification Algorithm Combining Mini Graph Convolutional Networks and Convolutional neural network 23

Fu-W:A Hyperspectral Image Classification Algorithm Combinin...

引用

6th International Conference on big data Technologies, ICBDT 2023

作者： Shi, Jiechuan Liu, Kun Yuan, Hao Wang, Can Yang, Bo School of Information Science and Engineering University of Jinan Jinan250022 China China High-resolution Earth Observation System Shandong Center of Data and Application University of Jinan Jinan250022 China Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan Jinan250022 China

ISBN: (纸本)9798400707667

Convolutional Neural Network (CNN) is a widely used neural network in deep learning, and Graph Convolutional Network (GCN) is one of the most effective semi -supervised methods. It spread node information in a conversion way. In this article, we have studied the differences between CNN and GCN in the classification of high -spectrum image. Because the traditional GCN algorithm needs to build an adjacent matrix on all data, the calculation cost is very high, especially in large -scale remote sensing problems. MinigCNS uses a small -batch learning method to solve the problem of CCN calculation costs, and then it has not solved the problem of low efficiency of single model classification. This article studies the advantages of minigcns and CNN, and proposes a weighted fusion network FU-W, which weighs the minigcns and CNN weighted integration to break the bottleneck of single model performance. We experimented with the fusion algorithm on the two high -spectrum data sets, and its overall accuracy can reach 88.8%in Indian Pines. The experiment proves the superiority of the fusion strategy for a single CNN or GCN model. © 2023 ACM.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

A modified iterative algorithm for solving split equality problems

引用

UPB Scientific Bulletin, Series A: Applied Mathematics and Physics 2021年第3期83卷 45-54页

作者： Fu, Yuanmin Zhu, Li-Jun Wei, Haicheng School of Mathematics and Information Science North Minzu University Yinchuan750021 China The Key Laboratory of Intelligent Information and Big Data Processing of NingXia Province North Minzu University Yinchuan750021 China Health Big Data Research Institute of North Minzu University Yinchuan750021 China Advanced Intelligent Perception Control Technology Innovative Team of NingXia North Minzu University Yinchuan750021 China

In this paper, we investigate the split equality problems in Hilbert spaces. We propose an iterative algorithm with self-adaptive step-size for solving split equality prob-lems. Convergent analysis of the suggested algorithm is proved under some suitable conditions. © 2021, Politechnica University of Bucharest. All rights reserved.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：