نتایج جستجو برای: locally gcd domain
تعداد نتایج: 483868 فیلتر نتایج به سال:
Euclid’s algorithm gives the greatest common divisor (gcd) of two integers, gcd(a, b) = max{d ∈ Z | d|a, d|b} If for simplicity we define gcd(0, 0) = 0, we have a function gcd : Z× Z −→ N with the following properties: Lemma 1 For any a, b, c, q ∈ Z we have: (i) gcd(a, b) = gcd(b, a). (ii) gcd(a,−b) = gcd(a, b). (iii) gcd(a, 0) = |a|. (iv) gcd(a− qb, b) = gcd(a, b). Proof. Trivial; for (iv) use...
We prove tight bounds for Sort, Merge, Insert, Gcd of integers, Gcd of polynomials and Rational functions with finite inputs domain in random access machine with arithmetic operations, direct and indirect addressing, unlimited power of answering YES/NO questions, branching and tables with bounded size. These bounds are also true even if we do not count additions, subtractions, multiplication an...
In this correspondence, a new viewpoint is proposed for estimating an image from its distorted versions in presence of noise without the a priori knowledge of the distortion functions. In z-domain, the desired image can be regarded as the greatest common polynomial divisor among the distorted versions. With the assumption that the distortion filters are finite impulse response (FIR) and relativ...
Many efficient interior-point methods (IPMs) are based on the use of a self-concordant barrier function for the domain of the problem that has to be solved. Recently, a wide class of new barrier functions has been introduced in which the functions are not self-concordant, but despite this fact give rise to efficient IPMs. Here, we introduce the notion of locally self-concordant barrier functio...
PURPOSE We analyzed the association of granule cell dispersion (GCD) with memory performance, clinical data and surgical outcome in a series of patients with mesial temporal lobe epilepsy (MTLE) and mesial temporal sclerosis (MTS). METHOD Hippocampal specimens from 54 patients with MTLE (27 patients with right MTLE and 27 with left MTLE) and unilateral MTS, who were separated into GCD and no-...
We present the w constraint combinator that models while loops in Constraint Programming. Embedded in a finite domain constraint solver, it allows programmers to develop non-trivial arithmetical relations using loops, exactly as in an imperative language style. The deduction capabilities of this combinator come from abstract interpretation over the polyhedra abstract domain. This combinator has...
نسبت بهره ایزومری 115m,gCd با انجام واکنش در کادمیوم طبیعی با استفاده از فوتونهای تابش ترمزی با بیشینه انرژی 40، 45، 50، 55، 60، 65، 70 وMeV 75 برای اولین بار اندازهگیری شده است. آزمایشها با روش طیفسنجی غیر بر خط پرتو گاما با استفاده از شتابدهنده خطی الکترون MeV 100 در آزمایشگاه شتابدهنده شهرپوهانگ (PAL) در کشور کره جنوبی انجام گردید. همچنین نسبت بهره ایزومری115m,gCd با استفاده از کد 1.6 T...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید