نتایج جستجو برای: b simple

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

2001
Lily Lee

This paper describes a representation of the dynamics of human walking action for the purpose of person identification and classification by gait appearance. Our gait representation is based on simple features such as moments extracted from video silhouettes of human walking motion. We claim that our gait dynamics representation is rich enough for the task of recognition and classification. The...

1983
William McCune Lawrence J. Henschen

We present a new strategy for semantic paramodulation for Horn sets and prove its completeness The strategy requires for each paramoduiation that either both parents be false positive units or that one parent and the paramodulant both be false relative to an interpretation We also discuss some of the issues involved in choosing an interpretation that has a chance of giving better performance th...

2002
S. S. GONCHAROV F. D. MCCOY

Let R be a relation on the domain of a computable structure A. We establish that the existence of an isomorphic copy B ofA such that the image of R (¬R, resp.) is h-simple (h-immune, resp.) relative to B is equivalent to a syntactic condition, termed R is formally h-simple (formally h-immune, resp.) on A.

1998
Mihai Ciucu

The number of plane partitions contained in a given box was shown by MacMahon [8] to be given by a simple product formula. By a simple bijection, this formula also enumerates lozenge tilings of hexagons of side-lengths a, b, c, a, b, c (in cyclic order) and angles of 120 degrees. We present a generalization in the case b = c by giving simple product formulas enumerating lozenge tilings of regio...

2005
Matthew A. Valeriote

A finite universal algebra is called strictly simple if it is simple and has no nontrivial subalgebras. An algebra is said to be Abelian if for every term t(x, ȳ) and for all elements a, b, c̄, d̄, we have the following implication: t(a, c̄) = t(a, d̄) −→ t(b, c̄) = t(b, d̄). It is shown that every finite simple Abelian universal algebra is strictly simple. This generalizes a well known fact about Ab...

2010
MATTHEW A. VALERIOTE

A finite universal algebra is called strictly simple if it is simple and has no nontrivial subalgebras. An algebra is said to be Abelian if for every term t(x,y) and for all elements a, b, c, d, we have the following implication: t(a,c) = t(a,d) —> t(b,c) = t(b,d) . It is shown that every finite simple Abelian universal algebra is strictly simple. This generalizes a well-known fact about Abelia...

Journal: :Journal of Noncommutative Geometry 2022

We classify all essential extensions of the form $$ 0 \rightarrow \mathcal{B} \mathcal{D} C(X) where $\mathcal{B}$ is a nonunital, simple, separable, finite, real rank zero, $\mathcal{Z}$-stable $C^\*$-algebra with continuous scale, and $X$ finite CW complex. In fact, we prove that there group isomorphism \mathbf{Ext}(C(X), \mathcal{B}) KK(C(X), \mathcal{M}(\mathcal{B})/\mathcal{B}).

Journal: :Physical review 2021

A simple exactly solvable model is proposed for describing the decays $\Upsilon (4S) \rightarrow B^0\bar B^0$ and B^+B^-$. Our predictions agree with available experimental data. Using this model, we analyze Coulomb effects in spectra of these decays. It shown that frequently used assumption factorization not fulfilled. The interaction leads to difference positions heights peaks corresponding c...

Journal: :Bulletin of The Australian Mathematical Society 2021

Abstract We provide an easy method for the construction of characteristic polynomials simple ordinary abelian varieties ${{\mathcal A}}$ dimension g over a finite field ${{\mathbb F}}_q$ , when $q\ge 4$ and $2g=\rho ^{b-1}(\rho -1)$ some prime $\rho \ge 5$ with $b\ge 1$ . Moreover, we show that is absolutely if $b=1$ prime, but not any $b>1$

2004
Huaxin Lin

We give a classification theorem for unital separable nuclear simple C∗-algebras with tracial rank no more than one. Let A and B be two unital separable simple nuclear C∗-algebras with TR(A), TR(B) ≤ 1 which satisfy the universal coefficient theorem. We show that A ∼= B if and only if (K0(A),K0(A)+, [1A], K1(A), T (A)) ∼= (K0(B), K0(B)+, [1B ], K1(B), T (B)).

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

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