... The dyadic graph means that each vertex possesses two incident incoming edges and two incident outgoing edges. ... Consider the conditional probability pij to add a new maximal vertex vN +1 to the outgoing external edges numbers i and j if we choose the outgoing external edge number i. The edges i and j can coincide. ... Consider the addition of a new maximal vertex vN +1 to the outgoing external edges numbers i < n and j < n. In this case, the past set of vN +1 do es not include vN . ...
[
Текст
]
Ссылки http://temporology.bio.msu.ru/EREPORTS/krugly_a-sequential-growth.pdf -- 319.7 Кб -- 28.02.2014 Похожие документы
... The main feature of the modified Smyshlyaev's formula is that it uses the edge Green's functions instead of the usual Green's function on a sphere with a cut. ... The embedding formula expresses the diffraction coefficient in terms of the edge Green's functions. ... We assume that both Green's functions are found in consideration of the boundary, edge, vertex and radiation conditions formulated for the initial diffraction problem. ... Introduce the edge Green functions for the Neumann problem. ...
[
Текст
]
Ссылки http://acoustics.phys.msu.su/teachers/shanin_files/~shanin/papers/ursi1.pdf -- 278.5 Кб -- 14.03.2011
[
Текст
]
Ссылки http://acoustics.phys.msu.ru/teachers/shanin_files/~shanin/papers/ursi1.pdf -- 278.5 Кб -- 14.03.2011 Похожие документы