In this paper, we propose forest-to-string rules to enhance the expressive power of tree-to-string translation models. A forest-to-string rule is capable of capturing non-syntactic phrase pairs by describing the corre...
详细信息
One basic observation for pedestrian detection in video sequences is that both appearance and motion information are important to model the moving people. Based on this observation, we propose a new kind of features, ...
详细信息
An Immune Genetic Algorithm (IGA) is used to solve weapon-target assignment problem (WTA). The used immune system serves as a local search mechanism for genetic algorithm. Besides, in our implementation, a new crossov...
详细信息
For Hyper Surface Classification (HSC), based on the concept of Minimal Consistent Subset for a disjoint Cover set (MCSC), a judgmental sampling method is proposed to select a representative subset from the original s...
详细信息
For Hyper Surface Classification (HSC), based on the concept of Minimal Consistent Subset for a disjoint Cover set (MCSC), a judgmental sampling method is proposed to select a representative subset from the original sample set in this *** sampling method depends on sample *** can directly solve the nonlinear multi-class classification problems and observe the sample *** sample distribution is obtained by adaptively dividing the sample space, and the classification model of hyper surface is directly used to classify large database based on Jordan Curve Theorem in Topology while sampling for *** number of MCSC is *** has the same classification model with the entire sample set and can totally reflect its classification *** any subset of the sample set that contains MCSC, the classification ability remains the ***, a formula is put forward that can predict the testing accuracy exactly when some samples are deleted from *** MCSC is the best way of sampling from the original sample set for Hyper Surface Classification method.
Superimpose one protein tertiary structure to another can help to find similarity between them and further identify functional and evolutionary relationships. We first extract invariant features under rigid body trans...
详细信息
Predicting functional properties of proteins is needed in a number of applications. A protein is represented as an ordered list of amino acids, where each amino acid has a sequence and a structure component (the terms...
详细信息
We demonstrate a new algorithm named FlexStem to predict RNA secondary structures with pseudoknots. Our approach is based on the free energy minimization criterion, and utilizes a sophisticated energy model that is mo...
详细信息
In this paper, we give an overview of the ICT statistical machine translation systems for the evaluation campaign of the International Workshop on Spoken Language Translation (IWSLT) 2007. In this year’s evaluation, ...
详细信息
Due to the existence of a large amount of legacy information systems, how to obtain the information and integrate the legacy systems is becoming more and more concerned. This paper introduces the integration pattern b...
详细信息
In the past decade, many papers about granular computing(GrC) have been published, but the key points about granular computing(GrC) are still unclear. In this paper, we try to find the key points of GrC in the informa...
详细信息
In the past decade, many papers about granular computing(GrC) have been published, but the key points about granular computing(GrC) are still unclear. In this paper, we try to find the key points of GrC in the information transformation of the pattern recognition. The information similarity is the main point in the original insight of granular computing (GrC) proposed by Zadeh(1997[1]). Many GrC researches are based on equivalence relation or more generally tolerance relation, equivalence relation or tolerance relation can be described by some distance functions and GrC can be geometrically defined in a framework of multiscale covering, at other hand, the information transformation in the pattern recognition can be abstracted as a topological transformation in a feature information space, so topological theory can be used to study GrC. The key points of GrC are (1) there are two granular computing approaches to change a high dimensional complex distribution domain to a low dimensional and simple domain, (2) these two kind approaches can be used in turn if feature vector itself can be arranged in a granular way.
暂无评论