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

2020 ACM Turing Celebration Conference - China, ACM TURC 2020

作者： Jiang, Wenjie Hu, Donghui Yu, Cong Li, Meng Zhao, Zhong-Qiu Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education and College of Computer Science and Information Engineering !!!Hefei University of Technology Hefei China College of Computer Science and Information Engineering Hefei University of Technology Hefei230601 China

ISBN: (纸本)9781450375344

Steganography is an art to hide information in the carriers to prevent from being detected, while steganalysis is the opposite art to detect the presence of the hidden information. With the development of deep learning, several state-of-the-art steganography and steganalysis based on deep learning techniques have been proposed to improve hiding or detection capabilities. Generative Adversarial Networks (GANs) based steganography directly uses the minimax game between the generator and discriminator, to automatically generate steganography algorithms resisting being detected by powerful steganalysis. The steganography without embedding (SWE) based on GANs, where the generated cover images themselves are stego ones carrying secret information has shown its state-of-the-art steganography performance. However, SWE based on GANs has serious weaknesses, such as low information recovery accuracy, low steganography capacity and poor natural showing. To solve these problems, this paper proposes a new SWE based on adversarial training, with carefully designed generator, discriminator and extractor, as well as their loss functions and optimized training mode. The proposed method can achieve a very high information recovery accuracy (100% in some cases), and at the same time improve the steganography capacity and image quality. © 2020 ACM.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

Sparse Training data-Based Hyperspectral Image Super Resolution Via ANFIS Interpolation

Sparse Training Data-Based Hyperspectral Image Super Resolut...

引用

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)

作者： Jing Yang Changjing Shang Lu Chen Pan Su Qiang Shen School of Automation and Software Engineering Shanxi University Taiyuan China Department of Computer Science Aberystwyth University Aberystwyth UK Insti. of Big Data Science & Industry Shanxi University Taiyuan China Department of Computer Hebei Key Laboratory of Knowledge Computing for Energy & Power Baoding North China Electric Power University China

Hyperspectral image super resolution aims to improve the spatial resolution of given hyperspectral images, which has become a highly attractive topic in the field of image processing. Existing techniques typically focus on super resolution with sufficient training data. However, restricted by data acquisition conditions, certain hyperspectral images or band images are very different to obtain, resulted in insufficient training data. In order to solve this problem, a new hyperspectral image super resolution method is proposed in this paper in an effort to conduct the super resolution task over insufficient (sparse) training data, by applying the recently introduced ANFIS (Adaptive Network-based Fuzzy Inference System) interpolation method. Particularly, the training dataset is divided into several subsets. For the subsets with sufficient training data, the relevant ANFIS models are trained using standard ANFIS learning algorithm, while for the subsets with sparse training data, the corresponding ANFIS models are interpolated through the use of ANFIS interpolation. Experimental results indicate that compared with the methods using sufficient training data, the proposed method can achieve very similar result, showing its effectiveness for situations where only sparse training data is available.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FineFormer: Fine-Grained Adaptive Object Transformer for Image Captioning

FineFormer: Fine-Grained Adaptive Object Transformer for Ima...

引用

IEEE International Conference on data Mining (ICDM)

作者： Bo Wang Zhao Zhang Jicong Fan Mingbo Zhao Choujun Zhan Mingliang Xu School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) & Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China School of Data Science The Chinese University of Hong Kong Shenzhen China Shenzhen Research Institute of Big Data Shenzhen China School of Information Science and Technology Donghua University Shanghai China School of Electrical and Computer Engineering Nanfang College Guangzhou Guangzhou China School of Information Engineering Zhengzhou University Zhengzhou China

Image captioning is still a challenging task aiming at describing the contents of image by words. Current image caption methods usually assume the object relation to be important if the semantic and spatial geometric relationships between objects are close and large, but the relations meeting this assumption are not necessarily important to describe the contents of image in a fine-grained way. That is, the importance of fine-grained object relations is not properly taken into account. Besides, current Transformer based image caption models also fail to consider the importance of fine-grained objects, since they generate all the words of a sentence at one time, which cannot Figure out which objects are more important and vice versa. In this paper, we propose a novel Fine-grained Adaptive Object Transformer (FineFormer) network, which can jointly discover the importance of fine-grained objects and object relations for image captioning. Specifically, a new concept of adaptive soft-foreground attention is proposed to highlight the fine-grained objects dominating the descriptive contents. To characterize and calculate the important relations between fine-grained objects, we also propose an adaptive object relation attention to refine the object relation from the generation process of relation. As such, FineFormer can describe the contents of image more accurately, by reducing the interference of unimportant objects in the background. Extensive experiments on the highly-competitive MS-COCO dataset demonstrated the superiority of our FineFormer.

关键词： Adaptation models Adaptive systems Current transformers Semantics Interference data mining Task analysis

来源：评论

学校读者我要写书评

暂无评论

UAV-enabled Collaborative Beamforming via Multi-Agent Deep Reinforcement Learning

arXiv

引用

arXiv 2024年

作者： Liu, Saichao Sun, Geng Li, Jiahui Liang, Shuang Wu, Qingqing Wang, Pengfei Niyato, Dusit The College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China The College of Computing and Data Science Nanyang Technological University 639798 Singapore The School of Information Science and Technology Northeast Normal University Changchun130117 China The Department of Electronic Engineering Shanghai Jiao Tong University Shanghai200240 China The School of Computer Science and Technology Dalian University of Technology Dalian116024 China

In this paper, we investigate an unmanned aerial vehicle (UAV)-assistant air-to-ground communication system, where multiple UAVs form a UAV-enabled virtual antenna array (UVAA) to communicate with remote base stations by utilizing collaborative beamforming. To improve the work efficiency of the UVAA, we formulate a UAV-enabled collaborative beamforming multi-objective optimization problem (UCBMOP) to simultaneously maximize the transmission rate of the UVAA and minimize the energy consumption of all UAVs by optimizing the positions and excitation current weights of all UAVs. This problem is challenging because these two optimization objectives conflict with each other, and they are non-concave to the optimization variables. Moreover, the system is dynamic, and the cooperation among UAVs is complex, making traditional methods take much time to compute the optimization solution for a single task. In addition, as the task changes, the previously obtained solution will become obsolete and invalid. To handle these issues, we leverage the multi-agent deep reinforcement learning (MADRL) to address the UCBMOP. Specifically, we use the heterogeneous-agent trust region policy optimization (HATRPO) as the basic framework, and then propose an improved HATRPO algorithm, namely HATRPO-UCB, where three techniques are introduced to enhance the performance. Simulation results demonstrate that the proposed algorithm can learn a better strategy compared with other methods. Moreover, extensive experiments also demonstrate the effectiveness of the proposed techniques. Copyright © 2024, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A key-phrase Extraction Method Based on Multi-size Convolution Windows for Scientific Literatures

A Key-phrase Extraction Method Based on Multi-size Convoluti...

引用

IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS)

作者： Yuhong Zhang Yuxin Xie Peipei Li Xuegang Hu Ministry of Education Ministry of Education Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Hefei Hefei University of Technology Hefei China

ISBN: (纸本)9781665441506

The key-phrase extraction is important for the downstream tasks in natural language process, and has attracted a lot of attention. Compared with other documents, scientific literatures contain many long phrases. Most existing methods perform poor on these literatures. To address this problem, a key-phrase extraction method based on multi-size convolution windows (KE-MCW) is proposed for scientific literatures in this paper. More specifically, in order to represent more contextual information, a convolutional neural network(CNN) with multi-size filters is introduced to map the documents into distributed feature vectors, then each vector can represent different size phrases. Next, in order to determine whether each word is a part of a keyphrase, a deep recurrent neural network is used to mark the role of each word. Finally, the attention mechanism is used to further judge the importance of each phrase. Experimental results show that our proposed method performs better than some competitive methods for technology literatures.

关键词： Cloud computing Recurrent neural networks Convolution Conferences Natural languages Information filters Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Research on Penetration Strategy of UAV 2020

Research on Penetration Strategy of UAV

引用

Proceedings of the 2020 International Conference on Cyberspace Innovation of Advanced Technologies

作者： Daojun Han Hongzhen Xiang Haolin Chen Yi Xie Institute of Data and Knowledge Engineering Henan University Kaifeng PR China School of Computer and Information Engineering Henan University Kaifeng PR China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng PR China

ISBN: (纸本)9781450387828

Taking a military operation as an example, this paper makes an in-depth study of what tactics a single UAV should adopt when facing the interception of multiple enemy UAV groups. According to the analysis of the impact diagram, the aerial range of the UAV standoff defines a threat area, that is, when the UAV arrives at the threat area, it needs to adopt a strategy for penetration, or it will be intercepted. The strategy adopted by UAV in the threat area is analyzed, and the decision control method is made.

关键词： Decision control Threat area Influence chart analysis UAV penetration

来源：评论

学校读者我要写书评

暂无评论

Research on Visualization Algorithm of Association Rules Based on Concept Lattice 2020

Research on Visualization Algorithm of Association Rules Bas...

引用

Proceedings of the 2020 International Conference on Cyberspace Innovation of Advanced Technologies

作者： Xiajiong Shen Lijie Bao Lei Zhang Institute of Data and Knowledge Engineering Henan University Kaifeng PR China School of Computer and Information Engineering Henan University Kaifeng PR China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng PR China

ISBN: (纸本)9781450387828

The traditional association rule representation method has no way to show the essential relationship between concepts and lacks understanding of the concept level. Concept lattice is a kind of data structure which can show the relationship between concepts, concept lattice also has unique advantages in the visualization and discovery of potential knowledge of association rules. In this paper, a visualization algorithm of association rules based on concept lattice is proposed. The algorithm visually displays the association rules extracted from concept lattice. Finally, this article combines the chronic disease record data of a certain hospital to analyze and visualize the association rules. The implementation results show that the visualization method has good effects in knowledge analysis and data display.

关键词： Visualization Concept lattice Association rules knowledge discovery

来源：评论

学校读者我要写书评

暂无评论

PSSL: Self-supervised learning for personalized search with contrastive sampling

arXiv

引用

arXiv 2021年

作者： Zhou, Yujia Dou, Zhicheng Zhu, Yutao Wen, Ji-Rong Gaoling School of Artificial Intelligence Renmin University of China School of Information Renmin University of China Université de Montréal MontréalQC Canada Beijing Key Laboratory of Big Data Management and Analysis Methods Key Laboratory of Data Engineering and Knowledge Engineering MOE

Personalized search plays a crucial role in improving user search experience owing to its ability to build user profiles based on historical behaviors. Previous studies have made great progress in extracting personal signals from the query log and learning user representations. However, neural personalized search is extremely dependent on sufficient data to train the user model. data sparsity is an inevitable challenge for existing methods to learn high-quality user representations. Moreover, the overemphasis on final ranking quality leads to rough data representations and impairs the generalizability of the model. To tackle these issues, we propose a Personalized Search framework with Self-supervised Learning (PSSL) to enhance data representations. Specifically, we adopt a contrastive sampling method to extract paired self-supervised information from sequences of user behaviors in query logs. Four auxiliary tasks are designed to pre-train the sentence encoder and the sequence encoder used in the ranking model. They are optimized by contrastive loss which aims to close the distance between similar user sequences, queries, and documents. Experimental results on two datasets demonstrate that our proposed model PSSL achieves state-of-the-art performance compared with existing *** Codes 68P20 Copyright © 2021, The Authors. All rights reserved.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

Learning Representations from Local to Global for Fine-grained Patient Similarity Measuring in Intensive Care Unit

Learning Representations from Local to Global for Fine-grain...

引用

IEEE International Conference on data Mining (ICDM)

作者： Xianli Zhang Buyue Qian Yang Li Zeyu Gao Chong Guan Renzhen Wang Yefeng Zheng Hansen Zheng Chen Li School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Beijing Chaoyang Hospital Capital Medical University Tencent Shenzhen Guandong China School of Mathematics and Statistics Xi’an Shaanxi China

Patient similarity measurement is an essential step in discovering clinically meaningful subgroups and building case retrieval systems. Most existing studies implement this procedure using similarity measurement algorithms on the multivariate clinical time-series (input space) or the low-dimensional patient representation (representation space) learned by a representation learning model. However, they either suffer from the adverse effects of irrelevant variables in the data or fail to assess the fine-grained similarity underneath the disease progress. In this paper, we propose a method to measure more fine-grained patient similarity in the state space, where each patient is represented by a series of state representations that reveal the dynamic health status. We discuss three desiderata, including stability, personality, and interpretability, for the state representations, and on this basis, develop a supervised predictive model that learns good state representations for identifying similar patients and predicting patient outcomes. Experimental results on the publicly available dataset MIMIC-III show that our method offers a promising direction for precisely identifying similar patients at the state trajectory level, as well as accurately predicting outcomes.

关键词： Training Representation learning Measurement units Precision medicine MIMICs Predictive models Extraterrestrial measurements

来源：评论

学校读者我要写书评

暂无评论

Multi-fuzzy-constrained graph pattern matching with big graph data

引用

Intelligent data Analysis 2020年第4期24卷 941-958页

作者： Liu, Guliu Li, Lei Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Hefei Anhui 230009 China School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China Mininglamp Academy of Sciences Mininglamp Technologies Beijing China

Graph pattern matching has been widespread used for protein structure analysis, expert finding and social group selection, ect. Recently, the study of graph pattern matching using the abundant attribute information of vertices and edges as constraint conditions has attracted the attention of scholars, and multi-constrained simulation has been proposed to address the problem in contextual social networks. Actually, multi-constrained graph pattern matching is an NP-complete problem and the fuzziness of constraint variables may exist in many applications. In this paper, we introduce a multi-fuzzy-constrained graph pattern matching problem in big graph data, and propose an efficient first-k algorithm Fuzzy-ETOF-K for solving it. Specifically, exploration-based method based on edge topology is adopted to improve the efficiency of edge connection, and breadth-first bounded search is used for edge matching instead of shortest path query between two nodes to improve the efficiency of edge matching. The results of our experiments conducted on three datasets of real social networks illustrate that our proposed algorithm Fuzzy-ETOF-K significantly outperforms existing approaches in efficiency and the introduction of fuzzy constraints makes our proposed algorithm more efficient and effective. © 2020 - IOS Press and the authors. All rights reserved.

关键词： big graph data Graph pattern matching multi-fuzzy-constrained

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：