نتایج جستجو برای: k sorani has a suffix called
تعداد نتایج: 13654404 فیلتر نتایج به سال:
heuristics are often used to provide solutions for flow shop scheduling problems.the performance of a heuristic is usually judged by comparing solutions and run times on test cases.this investigation proposes an analytical alternative ,called asymptotic convergence ,which tests the convergence of the heuristic to a lower bound as problem size grows. the test is a stronger variation of worst cas...
a graph is called textit{circulant} if it is a cayley graph on a cyclic group, i.e. its adjacency matrix is circulant. let $d$ be a set of positive, proper divisors of the integer $n>1$. the integral circulant graph $icg_{n}(d)$ has the vertex set $mathbb{z}_{n}$ and the edge set e$(icg_{n}(d))= {{a,b}; gcd(a-b,n)in d }$. let $n=p_{1}p_{2}cdots p_{k}m$, where $p_{1},p_{2},cdots,p_{k}$ are disti...
When can two regular word languages K and L be separated by a simple language? We investigate this question and consider separation by piecewiseand suffix-testable languages and variants thereof. We give characterizations of when two languages can be separated and present an overview of when these problems can be decided in polynomial time if K and L are given by nondeterministic automata.
Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....
We consider an index data structure for similar strings. The generalized suffix tree can be a solution for this. The generalized suffix tree of two strings A and B is a compacted trie representing all suffixes in A and B. It has |A|+ |B| leaves and can be constructed in O(|A|+ |B|) time. However, if the two strings are similar, the generalized suffix tree is not efficient because it does not ex...
The stimulus suffix effect has been typically viewed as reflecting the displacement of the current information residing in a limited-capacity sensory store by the presentation of a subsequent speech sound. The present research was primarily concerned with determining if strategic factors will also influence the stimulus suffix effect. An experiment was conducted, based on the research by Aarons...
چکیده: a?b(h) کنید فرض ،در این صورت برد عددی و aشعاع عددی a به ترتیب به صورت زیر تعریف می شوند. w(a)={ : v?h , ??v??=1 } w (a)=sup{?? ? : ? ?w(a)} که درآن <.,.> و?? .?? به ترتیب حاصلضرب داخلی و نرم روی فضای هیلبرت h می باشند . هورن وجانسون نشان دادند کهw?(a)?^(k ) ? (w(a^k. فرض کنید a?b(h) نرمال باشد .در این صورت رابطه ی زیر را داریم conv?(a^k )=(w(a^k ) ?)?conv(w(a)) ?^k اما...
به طور کلی در فرآیندهای مارکوف ارگودیک دو بعدی یافتن فرم بسته توزیع ایستا، تنها برای حالات خیلی خاص امکان پذیر است. با توجه به این مشکل و نیز با توجه به اهمیت توزیع ایستا، بررسی و مطالعه رفتار مجانبی توزیع ایستای این فرآیندها مورد توجه قرار گرفته است. زنجیر قدم زدن تصادفی دو بعدی که در برخی متون به آن، فرآیند qbd دو طرفه نیز می گویند، یکی از این فرآیندها است. یک فرآیند qbd زمان گسسته یک زنجیر م...
The Tongan suffix -‘i has been variously analyzed as a transitivizer, a passive suffix, a perfective suffix, and a modifier of verbal semantics. It has a variety of effects on the valency and aspect of the verb to which it is affixed. The One Form/One Meaning Principle (Johns 1992) suggests that these various effects should be linked together. I show that the apparently divergent functions of -...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید