We participated in the WMT 2016 shared news translation task on English ? Chinese language pair. Our systems are based on the encoder-decoder neural machine translation model with the attention mechanism. We employ th...
详细信息
Formal concept analysis (FCA) and description logic (DL) are meant to be formalizations of concepts.A formal concept in the former consists of its intent and extent,where the intent is the set of all the attributes sh...
详细信息
Formal concept analysis (FCA) and description logic (DL) are meant to be formalizations of concepts.A formal concept in the former consists of its intent and extent,where the intent is the set of all the attributes shared by each object in the extent of the concept,and the extent is the set of all the objects sharing each property in the intent of the concept.A concept in the latter formalization is simply a concept name,the interpretation of which is a subset of a *** consider the correspondence between concepts in both formalizations,a multi-valued formal context must be represented both as a knowledge base and as a model of the DL for contexts,where concepts are decomposed into tuple concepts C,interpreted as a set of tuples and value concepts V,interpreted as a set of attribute-value *** show that there is a difference between the interpretation of concepts R.V /R.C and the Galois connection between the extent/intent of formal concepts in *** to the Galois connection,there should be concepts of the form + R.V and + R.C inter-preted in FCA,and hence the logical language L for DL is extended to be L + together with + as a constructor so that + R.V and + R.C are well-defined ***,according to the interpretation in DL there should be pseudo concepts in FCA so that the interpretation of concepts R.V /R.C is the extent/intent of pseudo *** correspondence between formal concepts and concepts in L +,and between pseudo concepts and concepts in L are presented in this paper.
An important obstacle to the success of the Semantic Web is that the establishment of the semantic relationship is labor-intensive. This paper proposes an automatic semantic relationship discovering approach for const...
详细信息
ISBN:
(纸本)1581139128
An important obstacle to the success of the Semantic Web is that the establishment of the semantic relationship is labor-intensive. This paper proposes an automatic semantic relationship discovering approach for constructing the semantic link network. The basic premise of this work is that the semantics of a web page can be reflected by a set of keywords, and the semantic relationship between two web pages can be determined by the semantic relationship between their keyword sets. The approach adopts the data mining algorithms to discover the semantic relationships between keyword sets, and then uses deductive and analogical reasoning to enrich the semantic relationships. The proposed algorithms have been implemented. Experiment shows that the approach is feasible.
We propose a dependency parsing pipeline, in which the parsing of long-distance projections and localized dependencies are explicitly decomposed at the input level. A chosen baseline dependency parsing model performs ...
详细信息
Nowadays, it is a heated topic for many industries to build intelligent conversational bots for customer service. A critical solution to these dialogue systems is to understand the diverse and changing intents of cust...
详细信息
The iterative solution of the sequence of linear systems arising from threetemperature(3-T)energy equations is an essential component in the numerical simulation of radiative hydrodynamic(RHD)***,due to the complicate...
详细信息
The iterative solution of the sequence of linear systems arising from threetemperature(3-T)energy equations is an essential component in the numerical simulation of radiative hydrodynamic(RHD)***,due to the complicated application features of the RHD problems,solving 3-T linear systems with classical preconditioned iterative techniques is *** address this difficulty,a physicalvariable based coarsening two-level(PCTL)preconditioner has been proposed by dividing the fully coupled system into four individual easier-to-solve *** its nearly optimal complexity and robustness,the PCTL algorithm suffers from poor efficiency because of the overhead associatedwith the construction of setup phase and the solution of ***,the PCTL algorithm employs a fixed strategy for solving the sequence of 3-T linear systems,which completely ignores the dynamically and slowly changing features of these linear *** address these problems and to efficiently solve the sequence of 3-T linear systems,we propose an adaptive two-level preconditioner based on the PCTL algorithm,referred to as α*** adaptive strategies of the αSetup-PCTL algorithm are inspired by those of αSetup-AMG algorithm,which is an adaptive-setup-based AMG solver for sequence of sparse linear *** proposed αSetup-PCTL algorithm could adaptively employ the appropriate strategies for each linear system,and thus increase the overall *** results demonstrate that,for 36 linear systems,the αSetup-PCTL algorithm achieves an average speedup of 2.2,and a maximum speedup of 4.2 when compared to the PCTL algorithm.
Unmanned Aerial Vehicle (UAV) detection in the wild is a challenging task due to the presence of background noise and the varying size of the object. To address these obstacles, we propose a novel learning framework f...
详细信息
intelligent agent technology has been raised as the primary technology in the intelligent Internet and mobile computing. In this paper, MAGE (multi-agent environment) is introduced which is an environment for rapidly ...
详细信息
Intelligence Science is an interdisciplinary subject which dedicates to joint research on basic theory and technology of intelligence by brain science, cognitive science, artificial intelligence and others. Brain scie...
详细信息
暂无评论