نتایج جستجو برای: manns operations on ternary functions

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

Journal: :International journal of advanced network, monitoring, and controls 2022

Abstract TOC, as a new type of computer, uses the state light: it non light and two polarized states with orthogonal polarization directions to represent information, rotator polarizer change three states, thus completing ternary logic operations. This computer has advantages numerous processor bits, independent use bits in groups, reconfigurable computing functions bits; After more than 20 yea...

2006
BIN HAN

For any interpolatory ternary subdivision scheme with two-ring stencils for a regular triangular or quadrilateral mesh, we show that the critical Hölder smoothness exponent of its basis function cannot exceed log3 11(≈ 2.18266), where the critical Hölder smoothness exponent of a function f : R2 → R is defined to be ν∞(f) := sup{ν : f ∈ Lip ν}. On the other hand, for both regular triangular and ...

Journal: :Radio Electronics, Computer Science, Control 2020

Journal: :IJWMIP 2011
Amir Averbuch Valery A. Zheludev Gary B. Fatakhov Eduard H. Yakubov

A generic technique for construction of ternary interpolatory subdivision schemes, which is based on polynomial and discrete splines, is presented. These schemes have rational symbols. The symbols are explicitly presented in the paper. This is accompanied by a detailed description of the design of the refinement masks and by algorithms that verify the convergence of these schemes. In addition, ...

The aim of this paper is to classify all monogenic ternary semigroups, up to isomorphism. We divide them to two groups: finite and infinite. We show that every infinite monogenic ternary semigroup is isomorphic to the ternary semigroup O, the odd positive integers with ordinary addition. Then we prove that all finite monogenic ternary semigroups with the same index...

2014
Jouko Väänänen

In this thesis we investigate – under the assumption of the Axiom of Determinacy (AD) – the structure of the hierarchy of regular norms, a Wadge-type hierarchy of ordinal-valued functions that originally arose from Moschovakis’s proof of the First Periodicity Theorem in descriptive set theory. We introduce the notion of a very strong better quasi-order that will provide a framework to treat the...

Journal: :Formalized Mathematics 2009
Artur Kornilowicz

In this paper x, X, X1, X2 are sets. Let Y be a functional set. The functor DOMS(Y ) is defined by: (Def. 1) DOMS(Y ) = ⋃ {dom f : f ranges over elements of Y }. Let us consider X. We say that X is complex-functions-membered if and only if: (Def. 2) If x ∈ X, then x is a complex-valued function. Let us consider X. We say that X is extended-real-functions-membered if and only if: (Def. 3) If x ∈...

Journal: :Math. Comput. 2006
Bin Han Rong-Qing Jia

For any interpolatory ternary subdivision scheme with two-ring stencils for a regular triangular or quadrilateral mesh, in this paper we show that the critical Hölder smoothness exponent of its basis function cannot exceed log3 11(≈ 2.18266), where the critical Hölder smoothness exponent of a function f : R2 7→ R is defined to be ν∞(f) := sup{ν : f ∈ Lip ν}. On the other hand, for both regular ...

2010
C. Koukouvinos V. Pillwein D. E. Simos Z. Zafeirakopoulos Bruno Buchberger Bert Jüttler Ulrich Langer Esther Klann Peter Paule Clemens Pechstein Veronika Pillwein Ronny Ramlau Josef Schicho Wolfgang Schreiner Franz Winkler Walter Zulehner Christos Koukouvinos Dimitris E. Simos Zafeirakis Zafeirakopoulos

We give an average complexity analysis for a new formalism pertaining periodic and aperiodic ternary complementary pairs. The analysis is done in three levels, so that we end up with an accurate estimate. The way of separating the candidate pairs into suitable classes of ternary sequences is interesting, allowing us to use fundamental tools of Symbolic Computation, such as Holonomic functions a...

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

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