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

IEEE International Conference on cloud computing and Intelligence Systems (CCIS)

作者： Dan Luo Shumin Shi Rihai Su Heyan Huang School of Computer Sciences and Technology Beijing Institute of Technology Beijing China Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications Beijing China

ISBN: (数字)9781728138633

ISBN: (纸本)9781728138640

Neural Machine Translation (NMT) has achieved state-of-the-art performance depending on the availability of copious parallel corpora. However, for low-resource NMT task, the scarcity of training data will inevitably lead to poor translation performance. In order to relieve the dependence on scale of bilingual corpus and to cut down training time, we propose a novel data augmentation method named SMC under scarce condition that can Sample Monolingual Corpus containing difficult words only in back-translation process for Mongolian-Chinese (Mn-Ch) and English-Chinese (En-Ch) NMT. Inspired by work in curriculum learning, our approach takes into account the various difficulty-degree of the sample and the corresponding model capabilities. Experimental results show that our method improves translation quality respectively by up to 2.4 and 1.72 BLEU points over the baselines on En-Ch and Mn-Ch datasets while greatly reducing training time.

关键词： Training Data models Task analysis Training data information processing cloud computing Natural language processing

来源：评论

学校读者我要写书评

暂无评论

Prediction or comparison: Toward interpretable qualitative reasoning

arXiv

引用

arXiv 2021年

作者： Ren, Mucheng Huang, Heyan Gao, Yang School of Computer Science and Technology Beijing Institute of Technology Beijing China Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications Beijing China

Qualitative relationships illustrate how changing one property (e.g., moving velocity) affects another (e.g., kinetic energy) and constitutes a considerable portion of textual knowledge. Current approaches use either semantic parsers to transform natural language inputs into logical expressions or a "black-box" model to solve them in one step. The former has a limited application range, while the latter lacks interpretability. In this work, we categorize qualitative reasoning tasks into two types: prediction and comparison. In particular, we adopt neural network modules trained in an end-to-end manner to simulate the two reasoning processes. Experiments on two qualitative reasoning question answering datasets, QuaRTz and QuaRel, show our methods' effectiveness and generalization capability, and the intermediate outputs provided by the modules make the reasoning process interpretable. Copyright © 2021, The Authors. All rights reserved.

关键词： Kinetics

来源：评论

学校读者我要写书评

暂无评论

Ask to Understand: Question Generation for Multi-hop Question Answering

arXiv

引用

arXiv 2022年

作者： Li, Jiawei Ren, Mucheng Gao, Yang Yang, Yizhe School of Computer Science and Technology Beijing Institute of Technology Beijing China Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications Beijing China

Multi-hop Question Answering (QA) requires the machine to answer complex questions by finding scattering clues and reasoning from multiple documents. Graph Network (GN) and Question Decomposition (QD) are two common approaches at present. The former uses the "black-box" reasoning process to capture the potential relationship between entities and sentences, thus achieving good performance. At the same time, the latter provides a clear reasoning logical route by decomposing multi-hop questions into simple single-hop sub-questions. In this paper, we propose a novel method to complete multi-hop QA from the perspective of Question Generation (QG). Specifically, we carefully design an end-to-end QG module on the basis of a classical QA module, which could help the model understand the context by asking inherently logical sub-questions, thus inheriting interpretability from the QD-based method and showing superior performance. Experiments on the HotpotQA dataset demonstrate that the effectiveness of our proposed QG module, human evaluation further clarifies its interpretability quantitatively, and thorough analysis shows that the QG module could generate better sub-questions than QD methods in terms of fluency, consistency, and diversity. Copyright © 2022, The Authors. All rights reserved.

关键词： Decomposition

来源：评论

学校读者我要写书评

暂无评论

Distributed Dual Averaging for Composite Optimization

SSRN

引用

SSRN 2023年

作者： Wu, Ping Lu, Haolin Liu, Zhengyang Heyan, Huang School of Computer Science and Technology Beijing Institute of Technology Beijing100081 China Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications China

In the context of a multi-agent network, we investigate the distributed online composite optimization problem where the optimization objective of each local agent is a combination of a convex cost function and a convex regularized function. To handle this problem, we introduce two distributed algorithms based on approximate dual averaging. The first online distributed composite dual averaging algorithm, under the gradient feedback, achieves a composite regret bound of $\mathcal{O}(\sqrt{T})$ and $\mathcal{O}(\ln T)$ for general convex and strongly convex regularized functions, respectively, across a total time horizon of $T$. Furthermore, the second one, relying exclusively on the values of cost function rather than the full information of gradient, attains a comparable composite regret bound against the first algorithm. To illustrate the effectiveness of our proposed algorithms, we present a plethora of numerical simulations for both the distributed regularized regression task and the distributed regularized classification task. © 2023, The Authors. All rights reserved.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Dynamic Regret with Unknown Delays

SSRN

引用

SSRN 2023年

作者： Wu, Ping Liu, Zhengyang Lu, Haolin Huang, Heyan School of Computer Science and Technology Beijing Institute of Technology Beijing100081 China Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications China

In this paper, we delve into the realm of delayed online convex optimization, addressing scenarios where unknown delays exist between the querying and revealing of feedback. Obtaining dynamic regret in this case poses challenges arising from the uncertainties associated with both comparator sequence and delay sequence. First, to handle the uncertainty of comparator sequence, we introduce an adaptive delayed algorithm, yielding an $\mathcal{O}(\max{\sqrt{(1+\Delta_T)D_T},(\hat{d}-1)\Delta_T})$ dynamic regret bound for arbitrary comparator sequences. Here, $\Delta_T$ represents the path-length of the comparator sequence, $\hat{d}$ denotes the maximum delay, and $D_T$ signifies the cumulative delay over the entire horizon. Our approach centers around employing a delayed meta algorithm to track parallel delayed expert algorithms with varying step sizes. To complement our theoretical analysis, we establish an $\Omega(\sqrt{(1+\Delta_T)D_T})$ lower bound. Furthermore, to address the uncertainty of delay sequence, we extend our adaptive algorithm to scenarios where the time horizon and cumulative delay are unknown, incorporating a delayed doubling trick tailored to the number of missing feedback instances, thereby achieving a comparable dynamic regret. Finally, numerical simulations are presented to validate the effectiveness of our proposed approach. © 2023, The Authors. All rights reserved.

关键词： Comparators (optical)

来源：评论

学校读者我要写书评

暂无评论

Incorporating Option and Out-of-domain Knowledge for Multi-choice Machine Reading Comprehension

Incorporating Option and Out-of-domain Knowledge for Multi-c...

引用

IEEE International Conference on cloud computing and Intelligence Systems (CCIS)

作者： Yuan Xu Shumin Shi Heyan Huang School of Computer Science and Technology Beijing Institute of Technology Beijing China Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications Beijing China

ISBN: (纸本)9781665441506

Multi-choice Machine Reading Comprehension (MRC) requires the model to select the correct answer from a set of answer candidates given the corresponding passage and question. Previous studies mainly focus on complex matching networks to model the relationship among options, passage and question. However, these models obtain little improvement over the powerful Pre-trained language Models (PLMs). In this paper, we propose a simple method to incorporate option knowledge from PLMs and introduce out-of-domain knowledge by multi-task learning skillfully. Our approach obtains state-of-the-art results on Chinese multi-choice MRC dataset ReCO and also effectively improves the performance on C3.

关键词： Training cloud computing Conferences Computational modeling Multitasking Task analysis Intelligent systems

来源：评论

学校读者我要写书评

暂无评论

OneRel: Joint Entity and Relation Extraction with One Module in One Step

arXiv

引用

arXiv 2022年

作者： Shang, Yu-Ming Huang, Heyan Mao, Xian-Ling School of Computer Science & Technology Beijing Institute of Technology Beijing China Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications Beijing China

Joint entity and relation extraction is an essential task in natural language processing and knowledge graph construction. Existing approaches usually decompose the joint extraction task into several basic modules or processing steps to make it easy to conduct. However, such a paradigm ignores the fact that the three elements of a triple are interdependent and indivisible. Therefore, previous joint methods suffer from the problems of cascading errors and redundant information. To address these issues, in this paper, we propose a novel joint entity and relation extraction model, named OneRel, which casts joint extraction as a fine-grained triple classification problem. Specifically, our model consists of a scoring-based classifier and a relation-specific horns tagging strategy. The former evaluates whether a token pair and a relation belong to a factual triple. The latter ensures a simple but effective decoding process. Extensive experimental results on two widely used datasets demonstrate that the proposed method performs better than the state-of-the-art baselines, and delivers consistent performance gain on complex scenarios of various overlapping patterns and multiple triples. © 2022, CC BY.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

A Mapping from TVPCCS into BPEL

A Mapping from TVPCCS into BPEL

引用

2012 IEEE 3rd International Conference on Software Engineering and Service Science(第三届IEEE软件工程与服务科学国际会议 ICSESS2010)

作者： Mohammed Lamine Beggar Liao Lejian Beijing Engineering Research Centre of High Volume Language Information Processing & Cloud Computing Applications Beijing Key Laboratory of Intelligent Information TechnologySchool of Computer ScienceBeijing Institute of Technology Beijing 100081China

The Web Services Business Process Execution language (BPEL) is a language used to specify compositions of web services. In the last few years, a considerable amount of work has been done on modeling (parts of) BPEL and developing verification techniques and tools for BPEL. Petri nets and formal languages have been widely used to model Web services composition, but temporal value passing calculus of communicating systems (TVPCCS) language seems to be more adequate for several reasons. Generally BPEL programs are mapped to other languages and then the verification is performed, A more promising way is to directly build TVPCCS model, to check it and then map it to a BPEL process model. This paper describes a mapping from TVPCCS onto BPEL process model.

关键词： Web services BPEL TVPCCS process algebra

来源：评论

学校读者我要写书评

暂无评论

A Mapping from TVPCCS into BPEL

A Mapping from TVPCCS into BPEL

引用

2012 IEEE 3rd International Conference on Software Engineering and Service Science（ICSESS 2012）

作者： Mohammed Lamine Beggar Beijing Engineering Research Centre of High Volume Language Information Processing & Cloud Computing Applications Beijing Key Laboratory of Intelligent Information TechnologySchool of Computer ScienceBeijing Institute of Technology Beijing 100081China

The Web Services Business Process Execution language (BPEL) is a language used to specify compositions of web *** the last few years,a considerable amount of work has been done on modeling (parts of) BPEL and developing verification techniques and tools for *** nets and formal languages have been widely used to model Web services composition,but temporal value passing calculus of communicating systems (TVPCCS) language seems to be more adequate for several *** BPEL programs are mapped to other languages and then the verification is performed,A more promising way is to directly build TVPCCS model,to check it and then map it to a BPEL process *** paper describes a mapping from TVPCCS onto BPEL process model.

关键词： Web services,BPEL,TVPCCS,process algebra.

来源：评论

学校读者我要写书评

暂无评论

A multi-channel SSVEP-based brain-computer interface using a canonical correlation analysis in the frequency domain

Advances in Intelligent Systems and Computing

引用

Advances in Intelligent Systems and computing 2014年 215卷 603-616页

作者： Chen, Guang Song, Dandan Liao, Lejian Beijing Eng. Research Center of High Volume Language Inf. Processing and Cloud Computing App. Beijing Lab of Intelligent Information Technology School of Computer Science Beijing Institute of Technology Beijing China

Brain-computer interface (BCI) is a new way for man-machine interaction with wide applications, in which steady-state visual evoked potentials (SSVEP) is a promising option. However, many characteristics of SSVEP show great user variation. So parameter optimization and channel selection for each subject were applied to improve the performance of BCI. These optimizations limit the practical applicability of the SSVEP-based BCI. The use of a canonical correlation analysis (CCA) method for multi-channel SSVEP in the time domain detection showed highly increased detection accuracy, but it is sensitive to the noise when the stimulate frequency is low. In this paper, a method of CCA in the frequency domain is presented for classifying multi-channel SSVEPs. First overlapping average is conducted on the original training signals. Then fast Fourier transform (FFT) is used to transform the signals from time domain to frequency domain to produce the reference data. Finally, according to the correlation coefficients of the new data and the references in the frequency domain, the SSVEP is classified. The experimental results show the enhanced accuracy of our method when applied to low stimulate frequencies. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Brain computer interface

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：