نتایج جستجو برای: compatible pairs

تعداد نتایج: 160317  

2017
V. TEWARI

We introduce a generalization of semistandard composition tableaux called permuted composition tableaux. These tableaux are intimately related to permuted basement semistandard augmented fillings studied by Haglund, Mason and Remmel. Our primary motivation for studying permuted composition tableaux is to enumerate all possible ordered pairs of permutations (σ1, σ2) that can be obtained by stand...

1999
Xiaoping Xu

In this paper, we shall classify “quadratic” conformal superalgebras by certain compatible pairs of a Lie superalgebra and a Novikov superalgebra. Four general constructions of such pairs are given. Moreover, we shall classify such pairs related to simple Novikov algebras.

1994
Yuzo Hirai

Various constraints have been used to recover 3D structures from 2D images. They are classi ed into two categories: explicit constraints and implicit ones. In stereo matching algorithms, smoothness constraint is an example of explicit constraints, because it explicitly speci es which binocular pairs are compatible and it forces, for example, to nd a planar surface from a pair of random-dot ster...

2007
Zdenek Hanzlícek Jindrich Matousek

In this paper, several experiments on F0 transformation within the voice conversion framework are presented. The conversion system is based on a probabilistic transformation of line spectral frequencies and residual prediction. Three probabilistic methods of instantaneous F0 transformation are described and compared. Moreover, a new modification of inter-speaker residual prediction is proposed ...

1996
Joe Felsenstein Richard Lee

The sites that arouse skepticism in the parsimony method are the ones with the greatest number of changes. Compatibility is a technique related to parsimony, and is well suited to trees for which parsimony would produce frequent changes between states. Unfortunately, however, compatibility also treats small noise artifacts as significant. Definition 18.1: A site is compatible with a tree if and...

Journal: :Fuzzy Sets and Systems 2004
George Georgescu Andrei Popescu

Weak pseudo BL-algebras (WPBL-algebras) are non-commutative fuzzy structures which arise from pseudot-norms (i.e. the non-commutative versions of triangular norms). In this paper, we study the pairs of weak negations on WPBL-algebras, extending the case of weak negations on Esteva–Godo MTL-algebras. A geometrical characterization of the pairs of weak negations in bounded chains is provided. Our...

2017
Guillaume Launay Nicoletta Ceres Juliette Martin

The vast majority of proteins do not form functional interactions in physiological conditions. We have considered several sets of protein pairs from S. cerevisiae with no functional interaction reported, denoted as non-interacting pairs, and compared their 3D structures to available experimental complexes. We identified some non-interacting pairs with significant structural similarity with expe...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید