The application of the double-difference ( DD) algorithm to the relocation of induced seismic events from the Upper Silesian Coal Basin is discussed. The method has been enhanced by combining it with the Monte Carlo sampling technique in order to evaluate relocation errors. Results of both synthetic tests and relocation of real events are shown. They are compared with estimates of the classical single-event (SE) appr oach obtained through the Monte Carlo sampling of the a posteriori probability. On the basis of this comparis on we have concluded that the double-difference approach yields better estimates of depth than the classical location technique., Łukasz Rudziński and Wojciech Dębski., and Obsahuje bibliografické odkazy
Two inequalities for the Laplacian spread of graphs are proved in this note. These inequalities are reverse to those obtained by Z. You, B. Liu: The Laplacian spread of graphs, Czech. Math. J. 62 (2012), 155–168.
For linear differential and functional-differential equations of the $n$-th order criteria of equivalence with respect to the pointwise transformation are derived.
A graph is called distance integral (or D-integral) if all eigenvalues of its distance matrix are integers. In their study of D-integral complete multipartite graphs, Yang and Wang (2015) posed two questions on the existence of such graphs. We resolve these questions and present some further results on D-integral complete multipartite graphs. We give the first known distance integral complete multipartite graphs {K_{{p_1},{p_2},{p_3}}} with p1 < p2 < p3, and {K_{{p_1},{p_2},{p_3},{p_4}}} with p1 < p2 < p3 < p4, as well as the infinite classes of distance integral complete multipartite graphs {K_{{a_1}{p_1},{a_2}{p_2},...,{a_s}{p_s}}} with s = 5, 6., Pavel Híc, Milan Pokorný., and Obsahuje seznam literatury