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

arXiv 2019年

作者： Li, Zekang Niu, Cheng Meng, Fandong Feng, Yang Li, Qian Zhou, Jie Dian Group School of Electronic Information and Communications Huazhong University of Science and Technology Pattern Recognition Center WeChat AI Tencent Inc China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences School of Computer Science and Engineering Northeastern University China

Document Grounded Conversations is a task to generate dialogue responses when chatting about the content of a given document. Obviously, document knowledge plays a critical role in Document Grounded Conversations, while existing dialogue models do not exploit this kind of knowledge effectively enough. In this paper, we propose a novel Transformerbased architecture for multi-turn document grounded conversations. In particular, we devise an Incremental Transformer to encode multi-turn utterances along with knowledge in related documents. Motivated by the human cognitive process, we design a two-pass decoder (Deliberation Decoder) to improve context coherence and knowledge correctness. Our empirical study on a real-world Document Grounded Dataset proves that responses generated by our model significantly outperform competitive baselines on both context coherence and knowledge relevance. Copyright © 2019, The Authors. All rights reserved.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

Design of gear reducer based on FOA optimization algorithm 1st

Design of gear reducer based on FOA optimization algorithm

引用

1st International Conference on Smart Vehicular technology, Transportation, Communication and Applications, VTCA 2017

作者： Lin, Xiaojia Zhang, Fuquan Xu, Lin Department of Computer Science Fujian Business University Fuzhou350012 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang Univeristy Fuzhou350121 China School of Software Beijing Institute of Technology Beijing100081 China Innovative Information Industry Research Institute Fujian Normal University Fuzhou350300 China

ISBN: (纸本)9783319707297

In order to optimize the design of gear reducer, gear reducer optimal design to improve reliability and security, slow convergence and local optimum for FOA algorithm is proposed based on the improved type FOA gear reducer optimization design model. To avoid falling into local optimum Drosophila optimization algorithms, improved FOA algorithm by introducing a correction factor. Superior to the gear reducer seven variables optimization design model for the study, to ensure the safety and reliability of the premise, the FOA has the advantage of improved convergence speed and avoid local optimization problems, in order to verify the proposed method and reliability. © Springer International Publishing AG 2018.

关键词： Reliability

来源：评论

学校读者我要写书评

暂无评论

Machine learning dynamical phase transitions in complex networks

引用

Physical Review E 2019年第5期100卷 052312-052312页

作者： Qi Ni Ming Tang Ying Liu Ying-Cheng Lai School of Information Science and Technology East China Normal University Shanghai 200241 China School of Mathematical Sciences Shanghai Key Laboratory of PMMP East China Normal University Shanghai 200241 China Shanghai Key Laboratory of Multidimensional Information Processing East China Normal University Shanghai 200241 China School of Computer Science Southwest Petroleum University Chengdu 610500 China Big Data Research Center University of Electronic Science and Technology of China Chengdu 610054 China School of Electrical Computer and Energy Engineering Arizona State University Tempe Arizona 85287 USA

Recent years have witnessed a growing interest in using machine learning to predict and identify critical dynamical phase transitions in physical systems (e.g., many-body quantum systems). The underlying lattice structures in these applications are generally regular. While machine learning has been adopted to complex networks, most existing works concern about the structural properties. To use machine learning to detect phase transitions and accurately identify the critical transition points associated with dynamical processes on complex networks thus stands out as an open and significant problem. Here we develop a framework combining supervised and unsupervised learning, incorporating proper sampling of training data set. In particular, using epidemic spreading dynamics on complex networks as a paradigmatic setting, we start from supervised learning alone and identify situations that degrade the performance. To overcome the difficulties leads to the idea of exploiting confusion scheme, effectively a combination of supervised and unsupervised learning. We demonstrate that the scheme performs well for identifying phase transitions associated with spreading dynamics on homogeneous networks, but the performance deteriorates for heterogeneous networks. To strive to meet this challenge leads to the realization that sampling the training data set is necessary for heterogeneous networks, and we test two sampling methods: one based on the hub nodes together with their neighbors and another based on k-core of the network. The end result is a general comprehensive machine learning framework for detecting phase transition and accurately identifying the critical transition point, which is robust, computationally efficient, and universally applicable to complex networks of arbitrary size and topology. Extensive tests using synthetic and empirical networks verify the virtues of the articulated framework, opening the door to exploiting machine learning for understanding, detection

关键词： Collective behavior in networks Complex systems Network phase transitions Spreading Artificial neural networks Homogeneous networks Real world networks Scale free & inhomogeneous networks Centrality Monte Carlo methods Network Models SIS model

来源：评论

学校读者我要写书评

暂无评论

NTIRE 2020 Challenge on Image and Video Deblurring

arXiv

引用

arXiv 2020年

作者： Seungjun, Nah Sanghyun, Son Radu, Timofte Kyoung Mu, Lee Tseng, Yu Xu, Yu-Syuan Chiang, Cheng-Ming Tsai, Yi-Min Brehm, Stephan Scherer, Sebastian Xu, Dejia Chu, Yihao Sun, Qingyan Jiang, Jiaqin Duan, Lunhao Yao, Jian Purohit, Kuldeep Suin, Maitreya Rajagopalan, A.N. Ito, Yuichi Hrishikesh, P.S. Puthussery, Densen Akhil, K.A. Jiji, C.V. Kim, Guisik Deepa, P.L. Xiong, Zhiwei Huang, Jie Liu, Dong Kim, Sangmin Nam, Hyungjoon Kim, Jisu Jeong, Jechang Huang, Shihua Fan, Yuchen Yu, Jiahui Yu, Haichao Huang, Thomas S. Zhou, Ya Li, Xin Liu, Sen Chen, Zhibo Dutta, Saikat Das, Sourya Dipta Garg, Shivam Sprague, Daniel Patel, Bhrij Huck, Thomas Department of ECE ASRI SNU Korea Republic of Computer Vision Lab ETH Zurich Switzerland MediaTek Inc University of Augsburg Chair for Multimedia Computing and Computer Vision Lab Germany Peking University China Beijing University of Posts and Telecommunications China Beijing Jiaotong University China Wuhan University China Indian Institute of Technology Madras India Vermilion College of Engineering Trivandrum India CVML Chung-Ang University Korea Republic of APJ Abdul Kalam Technological University India University of Science and Technology of China China Image Communication Signal Processing Laboratory Hanyang University Korea Republic of Southern University of Science and Technology China University of Illinois at Urbana-Champaign United States CAS Key Laboratory of Technology in Geo-Spatial Information Processing and Application System University of Science and Technology of China China IIT Madra Jadavpur University India University of Texas Austin United States Duke University Computer Science Department United States

Motion blur is one of the most common degradation artifacts in dynamic scene photography. This paper reviews the NTIRE 2020 Challenge on Image and Video Deblurring. In this challenge, we present the evaluation results from 3 competition tracks as well as the proposed solutions. Track 1 aims to develop single-image deblurring methods focusing on restoration quality. On Track 2, the image deblurring methods are executed on a mobile platform to find the balance of the running speed and the restoration accuracy. Track 3 targets developing video deblurring methods that exploit the temporal relation between input frames. In each competition, there were 163, 135, and 102 registered participants and in the final testing phase, 9, 4, and 7 teams competed. The winning methods demonstrate the state-of-the-art performance on image and video deblurring tasks. Copyright © 2020, The Authors. All rights reserved.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Reversible Natural Language Watermarking Using Synonym Substitution and Arithmetic Coding

引用

computers, Materials & Continua 2018年第6期55卷 541-559页

作者： Lingyun Xiang Yan Li Wei Hao Peng Yang Xiaobo Shen Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and TechnologyChangsha 410114HunanChina School of Computer and Communication Engineering Changsha University of Science and TechnologyChangsha 410114HunanChina School of Traffic&Transportation Engineering Changsha University of Science&TechnologyChangsha 410114HunanChina Hunan Branch of CNCERT/CC Changsha 410004HunanChina School of Computer Science and Engineering Nanyang Technological University639798Singapore

For protecting the copyright of a text and recovering its original content harmlessly,this paper proposes a novel reversible natural language watermarking method that combines arithmetic coding and synonym substitution *** analyzing relative frequencies of synonymous words,synonyms employed for carrying payload are quantized into an unbalanced and redundant binary *** quantized binary sequence is compressed by adaptive binary arithmetic coding losslessly to provide a spare for accommodating additional ***,the compressed data appended with the watermark are embedded into the cover text via synonym substitutions in an invertible *** the receiver side,the watermark and compressed data can be extracted by decoding the values of synonyms in the watermarked text,as a result of which the original context can be perfectly recovered by decompressing the extracted compressed data and substituting the replaced synonyms with their original *** results demonstrate that the proposed method can extract the watermark successfully and achieve a lossless recovery of the original ***,it achieves a high embedding capacity.

关键词： Arithmetic coding synonym substitution lossless compression reversible watermarking.

来源：评论

学校读者我要写书评

暂无评论

Spatial-Spectral Feature Extraction via Deep ConvLSTM Neural Networks for Hyperspectral Image Classification

arXiv

引用

arXiv 2019年

作者： Hu, Wen-Shuai Li, Heng-Chao Pan, Lei Li, Wei Tao, Ran Du, Qian The Sichuan Provincial Key Laboratory of Information Coding and Transmission Southwest Jiaotong University Chengdu610031 China The School of Information and Electronics Beijing Institute of Technology Beijing100081 China The Department of Electrical and Computer Engineering Mississippi State University MS39762 United States

In recent years, deep learning has presented a great advance in hyperspectral image (HSI) classification. Particularly, Long Short-Term Memory (LSTM), as a special deep learning structure, has shown great ability in modeling long-term dependencies in the time dimension of video or the spectral dimension of HSIs. However, the loss of spatial information makes it quite difficult to obtain the better performance. In order to address this problem, two novel deep models are proposed to extract more discriminative spatial-spectral features by exploiting the Convolutional LSTM (ConvLSTM). By taking the data patch in a local sliding window as the input of each memory cell band by band, the 2-D extended architecture of LSTM is considered for building the spatial-spectral ConvLSTM 2-D Neural Network (SSCL2DNN) to model long-range dependencies in the spectral domain. To better preserve the intrinsic structure information of the hyperspectral data, the spatial-spectral ConvLSTM 3-D Neural Network (SSCL3DNN) is proposed by extending LSTM to 3-D version for further improving the classification performance. The experiments, conducted on three commonly used HSI data sets, demonstrate that the proposed deep models have certain competitive advantages and can provide better classification performance than other state-of-the-art approaches. Copyright © 2019, The Authors. All rights reserved.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

TransMut: a program to predict HLA-I peptide binding and optimize mutated peptides for vaccine design by the Transformer-derived self-attention model

Research Square

引用

Research Square 2021年

作者： Chu, Yanyi Zhang, Yan Wang, Qiankun Zhang, Lingfeng Wang, Xuhong Wang, Yanjing Wang, Jianmin Jiang, Xue Salahub, Dennis Russell Xiong, Yi Wei, Dong-Qing State Key Laboratory of Microbial Metabolism Shanghai-Islamabad-Belgrade Joint Innovation Center on Antibacterial Resistances Joint International Research Laboratory of Metabolic & Developmental Sciences School of Life Sciences and Biotechnology Shanghai Jiao Tong University Shanghai200030 China Department of Chemistry CMS - Centre for Molecular Simulation IQST - Institute for Quantum Science and Technology University of Calgary 2500 University Drive NW CalgaryABT2N 1N4 Canada Department of Clinical Oncology The University of Hong Kong-Shenzhen Hospital Shenzhen China School of Electrical Engineering and Computer Science University of Ottawa 75 Laurier Ave. OttawaONK1N 6N5 Canada The Ministry of Education Key Laboratory of System control and information processing Department of Automation School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai200030 China Integrative Biotechnology & Translational Medicine Yonsei University Incheon21983 Korea Republic of Peng Cheng Laboratory Vanke Cloud City Phase I Building 8 Xili Street Nanshan District Guangdong Shenzhen518055 China

Computational prediction of the interaction between human leukocyte antigen (HLA) and peptide (pHLA) can speed up epitope screening and vaccine design. Here, we develop the TransMut framework composed of TransPHLA for pHLA binding prediction and AOMP for mutated peptide optimization, which can be generalized to any binding and mutation task of biomolecules. Firstly, TransPHLA is developed by using a Transformer-derived self-attention model to predict pHLA binding, which is significantly superior to 11 previous methods on pHLA binding prediction, neoantigen and human papilloma virus vaccine identification. For vaccine design, the AOMP program is then developed to automatically optimize mutated peptides to search for mutant peptides with higher affinity to the target HLA and with high homology to the source peptide. Among 3660 non-binding pHLAs, 3630 were successfully mutated. Of these, 94% were verified by the IEDB recommended method, and 88% have homology higher than 80% to the source peptide. © 2021, CC BY.

关键词： Peptides

来源：评论

学校读者我要写书评

暂无评论

Learning compact target-oriented feature representations for visual tracking

arXiv

引用

arXiv 2019年

作者： Li, Chenglong Huang, Yan Wang, Liang Tang, Jin Lin, Liang Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Institute of Physical Science and Information Technology Anhui University Center for Research on Intelligent Perception and Computing NLPR CASIA School of Data and Computer Science Sun Yat-Sen University

Many state-of-the-art trackers usually resort to the pre-trained convolutional neural network (CNN) model for correlation filtering, in which deep features could usually be redundant, noisy and less discriminative for some certain instances, and the tracking performance might thus be affected. To handle this problem, we propose a novel approach, which takes both advantages of good generalization of generative models and excellent discrimination of discriminative models, for visual tracking. In particular, we learn compact, discriminative and target-oriented feature representations using the Laplacian coding algorithm that exploits the dependence among the input local features in a discriminative correlation filter framework. The feature representations and the correlation filter are jointly learnt to enhance to each other via a fast solver which only has very slight computational burden on the tracking speed. Extensive experiments on three benchmark datasets demonstrate that this proposed framework clearly outperforms baseline trackers with a modest impact on the frame rate, and performs comparably against the state-of-the-art methods. Copyright © 2019, The Authors. All rights reserved.

关键词： Target tracking

来源：评论

学校读者我要写书评

暂无评论

Hybrid roadside devices placement for advertisement disseminations in vehicular CPS 11th

Hybrid roadside devices placement for advertisement dissemin...

引用

11th EAI International Conference on Communications and Networking in China, ChinaCom 2016

作者： Cui, Junshan Li, Peng Yue, Dongdong Jin, Yu Liu, Yu Liu, Qin College of Computer Science and Technology Wuhan University of Science and Technology Hubei430065 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Hubei430065 China School of Computer Wuhan University Hubei430074 China

ISBN: (纸本)9783319666273

There are two types of roadside devices for advertisement dissemination in the Vehicular Cyber-Physical Systems (VCPS), one is roadside units (RSUs) and the other is roadside access points (RAPs). The placement cost of RSUs is lower than RAPs. However, the coverage of RSUs is limited. In this paper, we investigate the hybrid roadside device placement problem in the Vehicular Cyber-Physical Systems (VCPS). Given the budget constraint and the distribution of traffic conditions, our goal is to optimize the deployment of the hybrid roadside device for the merchants to maximize their benefits from advertisement dissemination. With the purpose of all advertisement can be effectively served, we propose a corresponding hybrid greedy placement algorithm. Our algorithm not only obtains the more benefits, but also consider the placement cost. Finally, we evaluate the performance of our proposed algorithm. Extensive simulations show that the performance of our proposed algorithm is superior to the other algorithms. © 2018, ICST Institute for computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： Cyber Physical System

来源：评论

学校读者我要写书评

暂无评论

Interactive Ontology Matching Based on Evolutionary Algorithm

Interactive Ontology Matching Based on Evolutionary Algorith...

引用

International Conference on Computational Intelligence and Security

作者： Xingsi Xue Junfeng Chen Aihong Ren College of Information Science and Engineering Intelligent Information Processing Research Center Fujian Key Lab for Automotive Electronics and Electric Drive Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou China College of IOT Engineering Hohai University ChanZhou China School of Mathematics and Information Science Baoji University of Arts and Sciences Baoji China

ISBN: (数字)9781728160924

ISBN: (纸本)9781728160931

Since different ontologies are mostly developed independently, establishing meaningful links between their entities, so-called ontology matching, is critical to ensure their communication. Due to the complexity of the ontology matching problem, Evolutionary Algorithm (EA) can present a good methodology for determining ontology alignments. However, since none of the similarity measure can distinguish all the identical ontology entities in any context, ontology alignments generated by the automatic matching tools should be validated by the users to ensure their qualities. To improve the quality of the ontology alignment, in this work, a similarity measure is first proposed to calculate the similarity value of two ontology entities; then, an optimal model for ontology matching problem is constructed; after that, an EA-based automatic matcher is presented to solve the ontology matching problem, which can also adaptively determine the timing of getting user involved; and finally, the ontology concept hierarchy graph based reasoning approaches are proposed to tradeoff the user's workload and his work's effect. The experiment is conducted on the Interactive track provided by the Ontology Alignment Evaluation Initiative (OAEI), and the comparisons with OAEI's participants show the effectiveness of our proposal.

关键词： Ontologies Graph theory Pattern matching Evolutionary computation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：