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

arXiv 2024年

作者： Bian, Yuan Liu, Min Wang, Xueping Ma, Yunfeng Wang, Yaonan The College of Electrical and Information Engineering Hunan University National Engineering Research Center of Robot Visual Perception and Control Technology Hunan Changsha China The College of Information Science and Engineering Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Changsha China

Deep learning-based person re-identification (re-id) models are widely employed in surveillance systems and inevitably inherit the vulnerability of deep networks to adversarial attacks. Existing attacks merely consider cross-dataset and cross-model transferability, ignoring the cross-test capability to perturb models trained in different domains. To powerfully examine the robustness of real-world re-id models, the Meta Transferable Generative Attack (MTGA) method is proposed, which adopts meta-learning optimization to promote the generative attacker producing highly transferable adversarial examples by learning comprehensively simulated transfer-based cross-model&dataset&test black-box meta attack tasks. Specifically, cross-model&dataset black-box attack tasks are first mimicked by selecting different re-id models and datasets for meta-train and meta-test attack processes. As different models may focus on different feature regions, the Perturbation Random Erasing module is further devised to prevent the attacker from learning to only corrupt model-specific features. To boost the attacker learning to possess cross-test transferability, the Normalization Mix strategy is introduced to imitate diverse feature embedding spaces by mixing multi-domain statistics of target models. Extensive experiments show the superiority of MTGA, especially in cross-model&dataset and cross-model&dataset&test attacks, our MTGA outperforms the SOTA methods by 21.5% and 11.3% on mean mAP drop rate, respectively. The code of MTGA will be released after the paper is accepted. Copyright © 2024, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Policies of Subgoals for Safe Deep Reinforcement Learning 2nd

Hierarchical Policies of Subgoals for Safe Deep Reinforcem...

引用

2nd International Conference on Ubiquitous Security, UbiSec 2022

作者： Yu, Fumin Gao, Feng Yuan, Yao Xing, Xiaofei Dai, Yinglong College of Information Science and Engineering Hunan Normal University Changsha410081 China School of Computer Science and Cyber Engineering Guangzhou University Guangzhou510006 China College of Liberal Arts and Sciences National University of Defense Technology Changsha410073 China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Changsha410081 China

ISBN: (纸本)9789819902712

Reinforcement learning is a machine learning method that relies on the agent to learn by trial and error to solve decision optimization problems. It is well known that an agent based on deep reinforcement learning in complex environments is difficult to train. Moreover, the agent will generate unsafe and strange actions due to the lack of sufficient reward feedback from the environment. To make the agent converge to a better policy and make its behavior safer and more controllable under sparse rewards, we propose a subgoal embedding method based on prior knowledge and hierarchical strategy that can make the training process converge faster. The subgoal embedding method can be combined with existing reinforcement learning methods. In this paper, we combine the subgoal embedding method with REINFORCE algorithm and PPO(Proximal Policy Optimization) algorithm to test the method in the MiniGrid-Doorkey game environment of the gym platform. The experiments demonstrate the effectiveness of the subgoal embedding method. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

An Efficient Low Delay Task Scheduling Algorithm Based on Ant Colony System in Heterogeneous Environments 22

An Efficient Low Delay Task Scheduling Algorithm Based on An...

引用

22nd IEEE International Conference on High Performance Computing and Communications, 18th IEEE International Conference on Smart City and 6th IEEE International Conference on Data Science and Systems, HPCC-SmartCity-DSS 2020

作者： Yang, Pei Liu, Jing Chen, Cen Ding, Yucheng Deng, Chunhua Zeng, Zeng Wuhan University of Science and Technology College of Computer Science and Technology Wuhan China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan China Institute for Infocomm Research Singapore Hunan *** Interactive Entertainment Media Co Ltd Changsha China

ISBN: (纸本)9781728176499

Low delay is an important issue in a variety of applications on heterogeneous computing platforms. A great number of algorithms including heuristics as well as metaheuristics have been designed to minimize the completion time (i.e., makespan) of applications and achieved good results. However, the demand of high performance never stops. In this paper, we propose a new and efficient Ant-Colony based Low Delay Scheduling (ACLDS) algorithm to minimize the makespan of applications which can form directed acyclic graphs and are executed on a heterogeneous system. Simulated results show that our proposed algorithm is highly efficient in reducing makespan in comparison with state-of-The-Art scheduling algorithms. For instance, the reduction ratio can be up to 15.2174% for a Fast Fourier Transform (FFT) benchmark. © 2020 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A Parallel Artificial Immune Model for Optimization

A Parallel Artificial Immune Model for Optimization

引用

International Conference on Computational Intelligence and Security

作者： Yutao Qi Fang Liu Licheng Jiao School of Computer Science And Technology Key Laboratory of Intelligent Perception and Imagee Understanding of Ministry of Education Xidian University Xi'an China Institute of Intelligent Information Processing and Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education Xidian University Xi'an China

This paper presents a parallel artificial immune model termed as tower master-slave model (TMSM) for solving optimising problems. Based on TMSM, the parallel immune memory clonal selection algorithm (PIMCSA) is also proposed. TMSM is a two level coarse-grained parallel artificial immune model with distributed immune response and distributed immune memory. In PIMCSA, vaccines are extracted and migrated between populations rather than individual migration as has been done in parallel genetic algorithms. It is a good balance between population diversity and the convergent speed. Experimental results on the numerical optimization and TSP problems show that PIMCSA achieves good performance in terms of both solution quality and computation time.

关键词： Immune system Genetic algorithms Artificial immune systems Competitive intelligence Master-slave Laboratories Computer science education Poles and towers Vaccines Parallel processing

来源：评论

学校读者我要写书评

暂无评论

A Fast and Effective Multiple Kernel Clustering Method on Incomplete Data

引用

Computers, Materials & Continua 2021年第4期67卷 267-284页

作者： Lingyun Xiang Guohan Zhao Qian Li Gwang-Jun Kim Osama Alfarraj Amr Tolba Changsha Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication EngineeringChangsha University of Science and TechnologyChangsha410114China Hunan Key Laboratory of Smart Roadway and Cooperative Vehicle-Infrastructure Systems Changsha University of Science and TechnologyChangsha410114China Faculty of Engineering and Information Technology Global Big Data Technologies CentreUniversity of Technology SydneyUltimoNSW2007Australia Department of Computer Engineering Chonnam National UniversityGwangju61186Korea Computer Science Department Community CollegeKing Saud UniversityRiyadh11437Saudi Arabia Department of Mathematics and Computer Science Faculty of ScienceMenoua UniversityShebin-El-kom32511Egyp

Multiple kernel clustering is an unsupervised data analysis method that has been used in various scenarios where data is easy to be collected but hard to be ***,multiple kernel clustering for incomplete data is a critical yet challenging *** the existing absent multiple kernel clustering methods have achieved remarkable performance on this task,they may fail when data has a high value-missing rate,and they may easily fall into a local *** address these problems,in this paper,we propose an absent multiple kernel clustering(AMKC)method on incomplete *** AMKC method rst clusters the initialized incomplete ***,it constructs a new multiple-kernel-based data space,referred to as K-space,from multiple sources to learn kernel combination ***,it seamlessly integrates an incomplete-kernel-imputation objective,a multiple-kernel-learning objective,and a kernel-clustering objective in order to achieve absent multiple kernel *** three stages in this process are carried out simultaneously until the convergence condition is *** on six datasets with various characteristics demonstrate that the kernel imputation and clustering performance of the proposed method is signicantly better than state-of-the-art ***,the proposed method gains fast convergence speed.

关键词： Multiple kernel clustering absent-kernel imputation incomplete data kernel k-means clustering

来源：评论

学校读者我要写书评

暂无评论

Image Denoising Using Bandelets and Hidden Markov Tree Models

引用

Chinese Journal of Electronics 2023年第4期19卷 646-650页

作者： Wenge Zhang Suang Wang Fang Liu Xinbo Gao Licheng Jiao School of Computer Science and Technology Xidian University Xi'an China Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China Institute of Intelligent Information Processing Xidian University Xi'an China

In this paper, both the marginal and joint statistics of second generation Orthogonal bandelet transform (OBT) coefficients of natural images are firstly studied, and the highly non-Gaussian marginal statistics and strong interscale, interlocation and interdirection dependencies among OBT coefficients are found. Then a Hidden Markov tree (HMT) model in OBT domain which can effectively capture all dependencies across scales, locations and directions is developed. The main contribution of this paper is that it exploits the edge direction information of OBT coefficients, and proposes an image denoising algorithm (B-HMT) based on HMT model in OBT domain. We apply B-HMT to denoise natural images which contaminated by additive Gaussian white noise, and experimental results show that B-HMT outperforms the Wavelet HMT (W-HMT) and Contourlet HMT (C-HMT) in terms of visual effect and objective evaluation criteria.

关键词： Geometry Analytical models Additives Hidden Markov models Transforms White noise Visual effects

来源：评论

学校读者我要写书评

暂无评论

Efficient differentiated storage architecture for large-scale flow tables in openflow networks 21

Efficient differentiated storage architecture for large-scal...

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on Data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Xiong, Bing Wu, Rengeng Liao, Zhuofan Wang, Jin School of Computer AND Communication Engineering Changsha University of Science AND Technology Changsha410114 China Department of Computer and Information Sciences Temple University Philadelphia19122 United States Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science AND Technology Changsha China

ISBN: (纸本)9781728120584

As a novel network paradigm, Software Defined Networking (SDN) decouples control logic functions from data forwarding devices, and introduces a separate control plane to manipulate underlying switches via southbound interfaces like OpenFlow. However, it leads to large-scale flow tables and poses serious challenges on their storage resources and lookup performance in OpenFlow switches. This paper is thus motivated to propose an efficient differentiated storage architecture for large-scale flow tables in OpenFlow networks. Firstly, we investigate into the impact of wildcards in match fields on packet-in-batch property within a flow based on network traffic locality. Then, packet flows are dynamically distinguished into active ones and idle ones in terms of their short-term states. Subsequently, we store the match fields of active flows and idle flows respectively in TCAM and SRAM, and the content fields of both types of flows in DRAM, to effectively relieve the insufficiency of TCAM capacity. Finally, we evaluate the performance of our proposed flow table storage architecture with real network traffic traces by experiments. The experimental results indicate that our proposed storage architecture obviously outperforms the traditional one applying the elephant/mice flow differentiation method in terms of TCAM hit rates and average flow table access time. © 2019 IEEE.

关键词： Software defined networking

来源：评论

学校读者我要写书评

暂无评论

A Survey of Multimodal Composite Editing and Retrieval

arXiv

引用

arXiv 2024年

作者： Li, Suyan Huang, Fuxiang Zhang, Lei The Chongqing Key Laboratory of Bio-perception and Multimodal Intelligent Information Processing Chongqing University Chongqing400044 China The Hong Kong University of Science and Technology Hong Kong The Chongqing Key Laboratory of Bio-perception and Multimodal Intelligent Information Processing the School of Microelectronics and Communication Engineering Chongqing University Chongqing400044 China

In the real world, where information is abundant and diverse across different modalities, understanding and utilizing various data types to improve retrieval systems is a key focus of research. Multimodal composite retrieval integrates diverse modalities such as text, image and audio, etc. to provide more accurate, personalized, and contextually relevant results. To facilitate a deeper understanding of this promising direction, this survey explores multimodal composite editing and retrieval in depth, covering image-text composite editing, image-text composite retrieval, and other multimodal composite retrieval. In this survey, we systematically organize the application scenarios, methods, benchmarks, experiments, and future directions. Multimodal learning is a hot topic in large model era, and have also witnessed some surveys in multimodal learning and vision-language models with transformers published in the PAMI journal. To the best of our knowledge, this survey is the first comprehensive review of the literature on multimodal composite retrieval, which is a timely complement of multimodal fusion to existing reviews. To help readers’ quickly track this field, we build the project page for this survey, which can be found at https://***/fuxianghuang1/Multimodal-Composite-Editing-and-Retrieval. © 2024, CC BY-NC-ND.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Hexagonal Convolutional Neural Network for Spatial Transcriptomics Classification

Hexagonal Convolutional Neural Network for Spatial Transcrip...

引用

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Gao, Jing Zhang, Fa Hu, Kai Cui, Xuefeng Xiangtan University Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan China Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Medical Technology Beijing Institute of Technology Beijing China Xiangnan University Key Laboratory of Medical Imaging and Artificial Intelligence of Hunan Province Chenzhou China Shandong University School of Computer Science and Technology Qingdao China

ISBN: (纸本)9781665468190

Recent advances in spatial transcriptomics have enabled the comprehensive measurement of transcriptional profiles while retaining the spatial contextual information. Identifying spatial domains is a critical step in the analysis of spatially resolved transcriptomics. Existing unsupervised methods perform poorly on this task owing to the large amount of noise and dropout events in the transcriptomic profiles. To address this problem, we first extend an unsupervised algorithm to a supervised learning method that can identify useful features and reduce noise hindrance. Second, inspired by the classical convolution in convolutional neural networks (CNNs), we designed a regular hexagonal convolution to compensate for the missing gene expression patterns from adjacent nodes. Compared with the graph convolution in graph neural networks (GNNs), our hexagonal convolution can preserve the relative spatial location information of different nodes in graph-structured data. Third, based on the hexagonal convolution, a novel hexagonal Convolutional Neural Network (hexCNN) is proposed for spatial transcriptomics classification. Finally, we compared the proposed hexCNN with existing methods on the DLPFC dataset. The results show that hexCNN achieves a classification accuracy of 87.2% and an average Rand index (ARI) of 78.2% (1.9% and 3.3% higher than those of GNNs). © 2022 IEEE.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Semantic Matching Algorithm for Legal Issues Based on BERT and Graph Convolution with Multi-granularity Features 23

Semantic Matching Algorithm for Legal Issues Based on BERT a...

引用

Proceedings of the 2023 12th International Conference on Computing and Pattern Recognition

作者： Baohua Qiang Shijie Pang Keliang Teng Zhiguang Liu Weigang Liu Guilin University of Electronic Technology China Hebei Key Laboratory of Intelligent Information Perception and Processing The 54th Research Institute of CETC China

ISBN: (纸本)9798400707988

In recent years, pre-training models represented by BERT have shown amazing text semantic representation capabilities supported by large-scale corpus, and now have become one of the mainstream solutions for semantic matching tasks in legal Q&A systems. However, pre-training models generally do not set specific pre-training tasks in terms of syntactic information, but implicitly and incidentally learn in large-scale unsupervised, which does not make good use of syntactic information as an important factor for representing semantics. To address this problem, this paper proposes a multi-granularity feature semantic matching model based on BERT and graph convolution. The model first obtains syntactic features of sentences in the form of dependent syntactic trees using existing tools, and then fuses syntactic features with word features and sentence features of BERT using an attention mechanism and graph convolutional neural network to enhance the characterization of text semantics and make the model better for semantic matching tasks. Experimental results show that the algorithm achieves significant improvements in the semantic matching task and outperforms the five comparison methods in the DIAC2019 dataset. Compared to the baseline model Sentenct-BERT, the accuracy, precision, recall and F1 values are improved by 0.33%, 1.18%, 1.03% and 1.05% improvement.

关键词： BERT Graph Convolutional Neural Network Legal Q&A Semantic matching

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：