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

2018 2nd International Conference on Artificial Intelligence: Technologies and Applications（ICAITA2018）

作者： Shaozhi Dai Yanchun Liang Shuyan Liu Ying Wang Wenle Shao Xixun Lin Xiaoyue Feng Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Zhuhai Laboratory of Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Zhuhai College of Jilin University

With the growth of existing knowledge graph, the completion of knowledge graph has become a crucial problem. In this paper, we propose a novel model based on descriptionembodied knowledge representation learning framework, which is able to take advantages of both fact triples and entity description. Specifically, the relation projection is combined with description-embodied representation learning to learn entity and relation embeddings. Convolutional neural network and Trans R are adopted to get the description-based and structure-based representation of entity and relation, respectively. We employ FB15 K dataset generated from a large knowledge graph freebase, to evaluate the performances of the proposed model. Experimental results show that our proposed model greatly outperforms other existing baseline models.

关键词： knowledge graph completion entity description natural language processing

来源：评论

学校读者我要写书评

暂无评论

Group-attention Based Neural Machine Translation

引用

IOP Conference Series: Materials Science and engineering 2020年第2期782卷

作者： Renyu Hu Hao Xu Yang Xiao Chenjun Wu Haiyang Jia College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

Machine translation is a classic problem in natural language process (NLP). Recent years, the encoder and decoder through an attention mechanism has become a trend. Google proposed a new simple network architecture, the Transformer using attention mechanisms only rather than CNN or RNN in 2017. However, it may lose some important information (e.g., grammatical component, etc) when using attention mechanism for whole *** propose a new brand model based on transformer using Group attention layers and group position embedding. It absorbs the features of Group-CNN combines the algorithm in computer vision (CV) and NLP. The model not only pays more attention to the ingredients (e.g., subject, predicate and adverbial, etc), but also enhances the connection of phrase. It outperforms SofA Transformer in using more syntactic information.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Task Allocation Method for Stream Processing with Recovery Latency Constraint

引用

Journal of Computer Science & Technology 2018年第6期33卷 1125-1139页

作者： Hong-Liang Li Jie Wu Zhen Jiang Xiang Li Xiao-Hui Wei College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education Changchun 130012 China Department of Computer and Information Sciences Temple University Philadelphia PA 19122 U.S.A. Department of Computer Science West Chester University of Pennsylvania West Chester PA 19383 U.S.A.

Stream processing applications continuously process large amounts of online streaming data in real time or nearreal time. They have strict latency constraints. However, the continuous processing makes them vulnerable to any failures,and the recoveries may slow down the entire processing pipeline and break latency constraints. The upstream backupscheme is one of the most widely applied fault-tolerant schemes for stream processing systems. It introduces complexbackup dependencies to tasks, which increases the difficulty of controlling recovery latencies. Moreover, when dependenttasks are located on the same processor, they fail at the same time in processor-level failures, bringing extra recovery latencies that increase the impacts of failures. This paper studies the relationship between the task allocation and therecovery latency of a stream processing application. We present a correlated failure effect model to describe the recoverylatency of a stream topology in processor-level failures under a task allocation plan. We introduce a recovery-latency awaretask allocation problem （RTAP） that seeks task allocation plans for stream topologies that will achieve guaranteed recoverylatencies. We discuss the difference between RTAP and classic task allocation problems and present a heuristic algorithmwith a computational complexity of O（n log2 n） to solve the problem. Extensive experiments were conducted to verify thecorrectness and effectiveness of our approach. It improves the resource usage by 15%-20% on average.

关键词： stream processing task allocation fault-tolerance upstream backup, recovery latency

来源：评论

学校读者我要写书评

暂无评论

Heuristic black-box adversarial attacks on video recognition models

arXiv

引用

arXiv 2019年

作者： Wei, Zhipeng Chen, Jingjing Wei, Xingxing Jiang, Linxi Chua, Tat-Seng Zhou, Fengfeng Jiang, Yu-Gang Jilin University Fudan University Beihang University National University of Singapore Health Informatics Lab College of Computer Science and Technology Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin130012 China

We study the problem of attacking video recognition models in the black-box setting, where the model information is unknown and the adversary can only make queries to detect the predicted top-1 class and its probability. Compared with the black-box attack on images, attacking videos is more challenging as the computation cost for searching the adversarial perturbations on a video is much higher due to its high dimensionality. To overcome this challenge, we propose a heuristic black-box attack model that generates adversarial perturbations only on the selected frames and regions. More specifically, a heuristic-based algorithm is proposed to measure the importance of each frame in the video towards generating the adversarial examples. Based on the frames’ importance, the proposed algorithm heuristically searches a subset of frames where the generated adversarial example has strong adversarial attack ability while keeps the perturbations lower than the given bound. Besides, to further boost the attack efficiency, we propose to generate the perturbations only on the salient regions of the selected frames. In this way, the generated perturbations are sparse in both temporal and spatial domains. Experimental results of attacking two mainstream video recognition methods on the UCF-101 dataset and the HMDB-51 dataset demonstrate that the proposed heuristic black-box adversarial attack method can significantly reduce the computation cost and lead to more than 28% reduction in query numbers for the untargeted attack on both datasets. Copyright © 2019, The Authors. All rights reserved.

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

Ordered proposition fusion based on consistency and uncertainty measurements

引用

Science China(Information Sciences) 2017年第8期60卷 117-135页

作者： Dayou LIU Yungang ZHU Ni NI Jie LIU College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Beijing Entry-Exit Inspection and Quarantine Bureau

The fusion of ordered propositions is an important and widespread problem in artificial intelligence,but existing fusion methods have difficulty handling the fusion of ordered propositions. In this paper, we propose a solution based on consistency and uncertainty measurements. The main contributions of this paper are as follows. First, we propose the concept of convexity degree, mean, and center of basic support function to comprehensively describe the basic support function of ordered propositions. Second, we introduce entropy as a measure of uncertainty in the basic support function of ordered propositions. Third, we generalize the indeterminacy of the basic support function and propose a novel method to measure the consistency between two basic support functions. Finally, based on the above researches, we propose a novel algorithm for fusing ordered propositions. Theoretical analysis and experimental results demonstrate that the proposed method outperforms state-of-the-art methods.

关键词： uncertainty processing ordered proposition evidence theory dempster rule of combination information fusion

来源：评论

学校读者我要写书评

暂无评论

Multi-Classification of Cancer Samples Based on Co-Expression Analyses

Multi-Classification of Cancer Samples Based on Co-Expressio...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Hongyang Jiang Qiang Huang Liang Chen Zhi Li Ying Xu Huiyan Sun Yi Chang Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun China College of Engineering Key Laboratory of Intelligent ManufacturingTechnology of Ministry of Education Shantou University Shantou China Key Laboratory of Anticancer Drugs and Biotherapy of Liaoning Province The First Hospital of China Medical University Shenyang China The China-Japan Union Hospital Cancer Systems Biology Center Jilin University Changchun China The China-Japan Union Hospital School of Artificial Intelligence Cancer Systems Biology Center Jilin University Changchun China School of Artificial Intelligence Jilin University Changchun China

Cancer staging, grading and subtyping all represent important problems for precision diagnosis, treatment and mechanistic studies of cancer. The majority of the existing computational methods solve this problem via multi-classification of differential gene-expressions of cancer samples of specific classes (Stages, Grades and subtypes) vs. controls. However, the performance of such classification techniques is generally not satisfactory since the discerning power of differential expression patterns in such classifications is limited. We present here a multi-classification technique, based on co-expression patterns specific to individual subclasses in provided training data as co-expression patterns tend to be more conserved than differential expressions within each subclass. A challenge in implementing this strategy lies in how to effectively derive co-expression patterns in individual samples, which is solved through comparing co-expression patterns within a subclass and those in the subclass plus a new sample. Compared with the state-of-the-art gene expression-based classification methods, our method outperforms them in cancer staging, grading and subtyping of cancer samples from TCGA in almost all the measures used. In addition, the co-expressed genes computationally selected for classifications are biologically meaningful, which will prove important for diagnostic biomarker design, treatment plan selection and possibly mechanistic studies of cancer.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An improved fruit fly optimization algorithm for solving traveling salesman problem

引用

Frontiers of Information Technology & Electronic engineering 2017年第10期18卷 1525-1533页

作者： Lan HUANG Gui-chao WANG Tian BAI Zhe WANG College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering (Jilin University) Ministry of Education Changchun 130012 China

The traveling salesman problem(TSP), a typical non-deterministic polynomial(NP) hard problem, has been used in many engineering applications. As a new swarm-intelligence optimization algorithm, the fruit fly optimization algorithm(FOA) is used to solve TSP, since it has the advantages of being easy to understand and having a simple implementation. However, it has problems, including a slow convergence rate for the algorithm, easily falling into the local optimum, and an insufficient optimization precision. To address TSP effectively, three improvements are proposed in this paper to improve FOA. First, the vision search process is reinforced in the foraging behavior of fruit flies to improve the convergence rate of FOA. Second, an elimination mechanism is added to FOA to increase the diversity. Third, a reverse operator and a multiplication operator are proposed. They are performed on the solution sequence in the fruit fly's smell search and vision search processes, respectively. In the experiment, 10 benchmarks selected from TSPLIB are tested. The results show that the improved FOA outperforms other alternatives in terms of the convergence rate and precision.

关键词： Traveling salesman problem Fruit fly optimization algorithm Elimination mechanism Vision search Operator

来源：评论

学校读者我要写书评

暂无评论

Topology-Aware Task Allocation for Distributed Stream Processing with Latency Guarantee

Topology-Aware Task Allocation for Distributed Stream Proces...

引用

作者： Xiaohui Wei Xun Wei Hongliang Li Yuan Zhuang Hengshan Yue College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education

Nowadays it becomes more and more critical to process the increasingly large amounts of data in timely *** order to meet this requirement and ensure the reliable processing of streaming data,a variety of distributed stream processing architectures and platforms have been developed,which handles the fundamental task of allocating processing tasks to the currently available physical resources and routing streaming data between these ***,many stream processing systems lack an intelligent scheduling mechanism,in which their default schedulers allocate tasks without taking resource demands and availability,or the transfer latency between resources into *** stream processing has a strict request for *** it's important to give latency guarantee for distributed stream *** this paper,we propose a new algorithm for stream processing with latency guarantee,the algorithm both consider transfer latency and resource demand in the process of task *** experiments verify the correctness and effectiveness of our *** the condition of satisfying the latency constraints,the heuristic algorithm AHA on average,reduce more than 21.3% and 58.9% resources compared with the greedy and the round-robin algorithms.

关键词： Distributed stream processing Task allocation Transfer latency

来源：评论

学校读者我要写书评

暂无评论

A randomized diversification strategy for solving satisfiability problem with long clauses

引用

Science China(Information Sciences) 2017年第9期60卷 121-131页

作者： Jian GAO Ruizhi LI Minghao YIN College of Computer Science Northeast Normal University College of Information Science and Technology Dalian Maritime University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University

Satisfiability problem(SAT) is a central problem in artificial intelligence due to its computational complexity and usefulness in industrial applications. Stochastic local search(SLS) algorithms are powerful to solve hard instances of satisfiability problems, among which CScore SAT is proposed for solving SAT instances with long clauses by using greedy mode and diversification mode. In this paper, we present a randomized variable selection strategy to improve efficiency of the diversification mode, and thus propose a new SLS *** perform a number of experiments to evaluate the new algorithm comparing with the recently proposed algorithms, and show that our algorithm is comparative with others for solving random instances near the phase transition threshold.

关键词： SAT local search randomized diversification strategy phase transition long clause

来源：评论

学校读者我要写书评

暂无评论

SFA: Small Faces Attention Face Detector

arXiv

引用

arXiv 2018年

作者： Luo, Shi Li, Xiongfei Zhang, Xiaoli Key Laboratory of Symbol Computation Knowledge Engineer of Ministry of Education Jilin University Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China

In recent year, tremendous strides have been made in face detection thanks to deep learning. However, most published face detectors deteriorate dramatically as the faces become smaller. In this paper, we present the Small Faces Attention (SFA) face detector to better detect faces with small scale. First, we propose a new scale-invariant face detection architecture which pays more attention to small faces, including 4-branch detection architecture and small faces sensitive anchor design. Second, feature maps fusion strategy is applied in SFA by partially combining high-level features into low-level features to further improve the ability of finding hard faces. Third, we use multi-scale training and testing strategy to enhance face detection performance in practice. Comprehensive experiments show that SFA significantly improves face detection performance, especially on small faces. Our real-time SFA face detector can run at 5 FPS on a single GPU as well as maintain high performance. Besides, our final SFA face detector achieves state-of-the-art detection performance on challenging face detection benchmarks, including WIDER FACE and FDDB datasets, with competitive runtime speed. Both our code and models will be available to the research community. Copyright © 2018, The Authors. All rights reserved.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：