An Rb2CoSi5O12 leucite analogue has been synthesized. ambient temperature X-ray powder diffraction study shows that this the Pbca orthorhombic structure of Cs2CdSi5O12. A high on a to Pa3¯ cubic phase transition at 457 K. The unit cell volume initially decreases with increasing passing through transition.

This paper presents eecient ways to implement one-to-all scatter communication on k-ary n-cubes with multidestination message-passing. Earlier researchers have applied multidestination message-passing to support non-personalized communications. In this paper, for the rst time in the literature, we demonstrate that multidestina-tion message-passing can also be used to support eecient personalize...

The k-dimensional Weisfeiler–Leman algorithm is a powerful tool in graph isomorphism testing. For an input G, the determines canonical coloring of s-tuples vertices G for each s between 1 and k. We say that numerical parameter k-WL-invariant if it determined by tuple color. As application Dvo?ák’s result on k-WL-invariance homomorphism counts case k=2, we spot some non-obvious regularity proper...

For a Noetherian local domain (R, m, K), it is an open question whether strong F–regularity deforms. We provide an affirmative answer to this question when the canonical module satisfies certain additional assumptions. The techniques used here involve passing to a Gorenstein ring, using an anti– canonical cover.

We will give distributed approximation schemes for the maximum matching problem and the minimum connected dominating set problem in unit-disk graphs. The algorithms are deterministic, run in a poly-logarithmic number of rounds in the message passing model and the approximation error can be made O(1/ log |G|) where |G| is the order of the graph and k is a positive integer.

Graphical models provide a powerful framework for modelling statistical dependencies between variables [1]. Message passing techniques are typically used for inference in graphical models that can be represented by a sparse graph. Iterative message passing is guaranteed to converge to the globally correct estimate when the system is tree-like; there are no such guarantees for systems with loops...