Diffraction and resonance analysis. (In Russian.) by G. S. Zhdanov, A. S. Ilyushin and S. V. Nikitina
نویسندگان
چکیده
منابع مشابه
Quotient G-systems and Green\'s Relations
In this paper, we first introduce the concepts of G-systems, quotient G-systems and isomorphism theorems on G-systems of n-ary semihypergroups . Also we consider the Green's equivalences on G-systems and further in-vestigate some of their properties. A number of n-ary semihypergroups are constructed and presented as examples in this paper.
متن کاملUnhomeliness and Hybridity in V. S. Naipaul’s Half a Life and Magic Seeds
In this study, the notions of homelessness and unhomeliness are studied in 2 novels by Naipaul: Half a Life (2001) and Magic Seeds (2004). Naipaul has been viewed by many postcolonial critics as an imperially complicit writer, for his controversial views of places and societies, particularly his disdain for non-Western societies. This study examines whether the imperatives of the postcolonial c...
متن کاملS Ight and S Ound : G
This paper presents an implemented system for automatically producing prosodically appropriate speech and corresponding facial expressions for animated, three-dimensional agents that respond to simple database queries. Unlike previous text-to-facial animation approaches, the system described here produces synthesized speech and facial animations entirely from scratch, starting with semantic rep...
متن کاملA New S-test for Haplotype Analysis: Concordance and Discordance
A new test of inheritance, S, is proposed, which uses information from affected as well as unaffected siblings in the fam­ ily. The siblings are analyzed in terms of similarities of haplotypes. The distribution of the proposed S­test is derived under the null hypothesis of random inheritance. Mean and variance are obtained for the distribution. The test is then applied to data sets publ...
متن کاملDeenition 1 given a Graph G = ( V E ) and a Subset S of V , the Cut (s) Induced
1 Minimum Cuts In this lecture we will describe an algorithm that computes the minimum cut (or simply mincut) in an undirected graph. A c u t is deened as follows. by S is the subset of edges (ii j) 2 E such that jfii jg \ Sj = 1. That is, (S) consists of all those edges with exactly one endpoint in S. Given an undirected graph G = (V E) and for each edge e 2 E a nonnegative cost (or capacity) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Crystallographica Section A
سال: 1981
ISSN: 0567-7394
DOI: 10.1107/s0567739481002040