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

arXiv 2020年

作者： Abdar, Moloud Pourpanah, Farhad Hussain, Sadiq Rezazadegan, Dana Liu, Li Ghavamzadeh, Mohammad Fieguth, Paul Cao, Xiaochun Khosravi, Abbas Rajendra Acharya, U. Makarenkov, Vladimir Nahavandi, Saeid Deakin University Australia College of Mathematics and Statistics Guangdong Key Lab. of Intelligent Information Processing Shenzhen University Shenzhen518060 China Dibrugarh University Dibrugarh India Department of Computer Science and Software Engineering Swinburne University of Technology Melbourne Australia Center for Machine Vision and Signal Analysis University of Oulu Oulu Finland Google research United States Department of Systems Design Engineering University of Waterloo Waterloo Canada State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing China Department of Electronics and Computer Engineering Ngee Ann Polytechnic Clementi Singapore Department of Computer Science University of Quebec in Montreal MontrealQC Canada

—Uncertainty quantification (UQ) plays a pivotal role in the reduction of uncertainties during both optimization and decision making, applied to solve a variety of real-world applications in science and engineering. Bayesian approximation and ensemble learning techniques are two of the most widely-used UQ methods in the literature. In this regard, researchers have proposed different UQ methods and examined their performance in a variety of applications such as computer vision (e.g., self-driving cars and object detection), image processing (e.g., image restoration), medical image analysis (e.g., medical image classification and segmentation), natural language processing (e.g., text classification, social media texts and recidivism risk-scoring), bioinformatics, etc. This study reviews recent advances in UQ methods used in deep learning, investigates the application of these methods in reinforcement learning, and highlight the fundamental research challenges and directions associated with the UQ field. Copyright © 2020, The Authors. All rights reserved.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Otem&Utem: Over- and under-translation evaluation metric for NMT

arXiv

引用

arXiv 2018年

作者： Yang, Jing Zhang, Biao Qin, Yue Zhang, Xiangwen Lin, Qian Su, Jinsong Xiamen University Xiamen China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou China

Although neural machine translation(NMT) yields promising translation performance, it unfortunately suffers from over- and under-translation issues [Tu et al., 2016], of which studies have become research hotspots in NMT. At present, these studies mainly apply the dominant automatic evaluation metrics, such as BLEU, to evaluate the overall translation quality with respect to both adequacy and fluency. However, they are unable to accurately measure the ability of NMT systems in dealing with the above-mentioned issues. In this paper, we propose two quantitative metrics, the Otem and Utem, to automatically evaluate the system performance in terms of over- and under-translation respectively. Both metrics are based on the proportion of mismatched n-grams between gold reference and system translation. We evaluate both metrics by comparing their scores with human evaluations, where the values of Pearson Correlation Coefficient reveal their strong correlation. Moreover, in-depth analyses on various translation systems indicate some inconsistency between BLEU and our proposed metrics, highlighting the necessity and significance of our metrics. Copyright © 2018, The Authors. All rights reserved.

关键词： Neural machine translation

来源：评论

学校读者我要写书评

暂无评论

Cloud computing data security protection strategy 4th

Cloud computing data security protection strategy

引用

4th International Conference on Cloud Computing and Security, ICCCS 2018

作者： Wei, Yu Zhang, Yongsheng School of Information Science and Engineering Shandong Normal University Jinan250358 China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan250358 China

ISBN: (纸本)9783030000059

Cloud computing is a computing model that has emerged in recent years. It is of great significance for promoting massive information data calculations. We store large amounts of data in the cloud and use algorithms to make huge computations on large-scale data centers on the Internet. Big data cloud computing resources have a huge amount of information, which can provide convenient and fast computing while being a new type of storage. Due to the large amount of data that needs to be processed by cloud computing, many information processing methods are involved, and customer privacy data is difficult to be effectively protected in the cloud computing environment. Therefore, the protection of information security in the cloud computing environment becomes more important. Based on the analysis of the data security problems in the big data cloud computing environment, this paper analyzes the security protection of big data cloud computing data, which is of great significance for promoting the establishment of a complete data security system, and can also be further promoted the useful of cloud computing. © Springer Nature Switzerland AG 2018.

关键词： Data privacy

来源：评论

学校读者我要写书评

暂无评论

Automated Selection of Evolutionary Multi-objective Optimization Algorithms

Automated Selection of Evolutionary Multi-objective Optimiza...

引用

IEEE Symposium Series on Computational Intelligence (SSCI)

作者： Ye Tian Shichen Peng Tobias Rodemann Xingyi Zhang Yaochu Jin Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information Technology Anhui University Hefei China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei China Honda Research Institute Europe Offenbach/Main Germany Department of Computer Science University of Surrey Guildford Surrey United Kingdom

ISBN: (数字)9781728124858

ISBN: (纸本)9781728124865

In the last two decades, many evolutionary algorithms have shown promising performance in solving a variety of multi-objective optimization problems (MOPs). Since there does not exist an evolutionary algorithm having the best performance on all the MOPs, it is unreasonable to use a single evolutionary algorithm to tackle all the MOPs. Since many real-world MOPs are computationally expensive, selecting the best evolutionary algorithm from multiple candidates via empirical comparisons is also impractical. To address the above issues, this paper proposes an automated algorithm selection method for choosing the most suitable evolutionary algorithm for a given MOP. The proposed method establishes a predictor based on the performance of a set of candidate evolutionary algorithms on multiple benchmark MOPs, where the inputs of the predictor are the explicit and implicit features of an MOP, and the output is the index of the evolutionary algorithm having the best performance on the MOP. Experimental results indicate that the evolutionary algorithm suggested by the proposed method is highly competitive among all the candidate evolutionary algorithms, demonstrating the practical value of the proposed method for engineers to select an evolutionary algorithm for their applications.

关键词： Evolutionary computation Benchmark testing Feature extraction Optimization Prediction algorithms Convergence Linear programming

来源：评论

学校读者我要写书评

暂无评论

A deep neural information fusion architecture for textual network embeddings

arXiv

引用

arXiv 2019年

作者： Xu, Zenan Su, Qinliang Quan, Xiaojun Zhang, Weijia School of Data and Computer Science Sun Yat-Sen University Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China School of Electronics and Information Technology Sun Yat-Sen University

Textual network embeddings aim to learn a low-dimensional representation for every node in the network so that both the structural and textual information from the networks can be well preserved in the representations. Traditionally, the structural and textual embeddings were learned by models that rarely take the mutual influences between them into account. In this paper, a deep neural architecture is proposed to effectively fuse the two kinds of informations into one representation. The novelties of the proposed architecture are manifested in the aspects of a newly defined objective function, the complementary information fusion method for structural and textual features, and the mutual gate mechanism for textual feature extraction. Experimental results show that the proposed model outperforms the comparing methods on all three datasets. Copyright © 2019, The Authors. All rights reserved.

关键词： Network embeddings

来源：评论

学校读者我要写书评

暂无评论

On efficient and robust metrics for RANSAC hypotheses and 3D rigid registration

arXiv

引用

arXiv 2020年

作者： Yang, Jiaqi Huang, Zhiqiang Quan, Siwen Zhang, Qian Zhang, Yanning Cao, Zhiguo National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology School of Computer Science Northwestern Polytechnical University China School of Software Northwestern Polytechnical University Xi’an710129 China School of Electronic and Control Engineering Chang’an University Xi’an710064 China School of Resources and Environment Hubei University Wuhan430062 China National Key Laboratory of Science and Technology on Multi-spectral Information Processing School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China

This paper focuses on developing efficient and robust evaluation metrics for RANSAC hypotheses to achieve accurate 3D rigid registration. Estimating six-degree-of-freedom (6-DoF) pose from feature correspondences remains a popular approach to 3D rigid registration, where random sample consensus (RANSAC) is a de-facto choice to this problem. However, existing metrics for RANSAC hypotheses are either time-consuming or sensitive to common nuisances, parameter variations, and different application scenarios, resulting in performance deterioration in overall registration accuracy and speed. We alleviate this problem by first analyzing the contributions of inliers and outliers, and then proposing several efficient and robust metrics with different designing motivations for RANSAC hypotheses. Comparative experiments on four standard datasets with different nuisances and application scenarios verify that the proposed metrics can significantly improve the registration performance and are more robust than several state-of-the-art competitors, making them good gifts to practical applications. This work also draws an interesting conclusion, i.e., not all inliers are equal while all outliers should be equal, which may shed new light on this research problem. Copyright © 2020, The Authors. All rights reserved.

关键词： Deterioration

来源：评论

学校读者我要写书评

暂无评论

DeepACE: Automated chromosome enumeration in metaphase cell images using deep convolutional neural networks

arXiv

引用

arXiv 2019年

作者： Xiao, Li Luo, Chunlong Luo, Yufan Yu, Tianqi Tian, Chan Qiao, Jie Zhao, Yi Key Laboratory of Intelligent Information Processing Advanced Computer Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing China Peking University Third Hospital Beijing China Beijing China

Chromosome enumeration is an important but tedious procedure in karyotyping analysis. In this paper, to automate the enumeration process, we developed a chromosome enumeration framework, DeepACE, based on the region based object detection scheme. Firstly, the ability of region proposal network is enhanced by a newly proposed Hard Negative Anchors Sampling to extract unapparent but important information about highly confusing partial chromosomes. Next, to alleviate serious occlusion problems, we novelly introduced a weakly-supervised mechanism by adding a Template Module into classification branch to heuristically separate overlapped chromosomes. The template features are further incorporated into the NMS procedure to further improve the detection of overlapping chromosomes. In the newly collected clinical dataset, the proposed method outperform all the previous method, yielding an mAP with respect to chromosomes as 99.45, and the error rate is about 2.4%. Copyright © 2019, The Authors. All rights reserved.

关键词： Chromosomes

来源：评论

学校读者我要写书评

暂无评论

A embedding model for text classification

引用

Expert Systems 2019年第6期36卷 e12460-e12460页

作者： Liu, Wenfeng Liu, Peiyu Yang, Yuzhen Yi, Jing Zhu, Zhenfang School of Information Science and Engineering Shandong Normal University Jinan China School of Computer Heze University Heze China Shandong Normal University Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Jinan China School of Computer Science and Technology Shandong Jianzhu University Jinan China School of Information Science and Electrical Engineering Shandong Jiaotong University Jinan China

Existing word embeddings learning algorithms only employ the contexts of words, but different text documents use words and their relevant parts of speech very differently. Based on the preceding assumption, in order to obtain appropriate word embeddings and further improve the effect of text classification, this paper studies in depth a representation of words combined with their parts of speech. First, using the parts of speech and context of words, a more expressive word embeddings can be obtained. Further, to improve the efficiency of look-up tables, we construct a two-dimensional table that is in the format to represent words in text documents. Finally, the two-dimensional table and a Bayesian theorem are used for text classification. Experimental results show that our model has achieved more desirable results on standard data sets. And it has more preferable versatility and portability than alternative models. © 2019 John Wiley & Sons, Ltd

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Research on Network Intrusion Detection Based on Support Vector Machine Optimized with Grasshopper Optimization Algorithm

Research on Network Intrusion Detection Based on Support Vec...

引用

IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems

作者： Zhiwei Ye Yiheng Sun Shuang Sun Sikai Zhan Han Yu Quanfeng Yao Key Laboratory of Intelligent Computing and Information Processing Fujian Province University School of computer Science Hubei university of Technology Wuhan China Wuhan FiberHome Technical Services Co. Ltd.

As one of the most important parts of network security, more significance is attached to intrusion detection system (IDS). Numerous techniques including support vector machine (SVM) have been applied to the intrusion detection. However, many methods are utilized to improve the original SVM whose performance is markedly depended on its kernel parameters. Evolutionary algorithms such as genetic algorithm (GA) and particle swarm algorithm (PSO) are also employed to search better kernel parameters while the traditional optimization methods are vulnerable to fall into local minima with slow speed of convergence. In order to improve the precision of SVM in intrusion detection, the support vector machine based on grasshopper optimization algorithm (GOA-SVM) is proposed in the paper. To verify the practicality of the proposed method, several contrast experiments have been carried out using tool of Matlab. The experimental results finally demonstrates the superior performance of the proposed method on intrusion detection.

关键词： Support vector machines Optimization Intrusion detection Kernel Genetic algorithms Particle swarm optimization Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

UWB SAR image segmentation algorithm based on polynomial analysis of statistical distribution

UWB SAR image segmentation algorithm based on polynomial ana...

引用

Asian and Pacific Conference on Synthetic Aperture Radar (APSAR)

作者： Wang Yuming Jin Tian Luo Chaopeng College of Information Science and Engineering Hunan Provincial Key Laboratory of Intelligent Computhing and Language Information Processing Science and Technology on Near-Surface Detection Laboratory Hunan Normal University Changsha R.P.China College of Electronic Science and Technology Science and Technology on Near-Surface Detection Laboratory National University of Defense Technology Changsha R.P.China Science and Technology on Near-Surface Detection Laboratory Wuxi China

ISBN: (数字)9781728129129

ISBN: (纸本)9781728129136

Aimed at the segmentation problem of ultrawideband synthetic aperture radar (UWB SAR) image, a novel algorithm based on polynomial analysis of statistical distribution is proposed in this letter. Firstly, we estimate the probability density function (PDF) for each pixel via sparse decomposition of which the dictionary consists of orthogonal polynomials (OP). Secondly, the weighting coefficients of corresponding OP are used to segment image using their maximum value. The experimental results validate the efficiency of this algorithm.

关键词： Image segmentation Probability density function Synthetic aperture radar Radar polarimetry Signal processing algorithms Scattering Statistical distributions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：