In the late 1980s, activities of (neo)pagan groups were renewed in Estonia, Latvia, and Lithuania. Today, (neo)pagans have taken a stable place among new religious movements Baltic states. The social inclusion is made difficult by state authorities, which applied to them same kinds legal regulations as for unregistered “non-traditional” communities. Currently, attempts be included life come up ...

We study in depth the equivalence between subshrubs and chaotic bands in the Mandelbrot set. In order to do so, we introduce the rules for chaotic bands and the rules for subshrubs, as well as the transformation rules that allow us to interchange them. From all the denominations of a chaotic band, we show the canonical form; that is, the one associated to the hyperbolic component that generates...

We document the phenomenon of “bias for the whole,” wherein greater value is perceived for money in the form of a whole (large denomination) than for equivalent amounts of money in parts (smaller denominations), resulting in a lower inclination to spend with the whole. We demonstrate across four experiments that the bias arises from greater processing fluency experienced in processing the whole...

Introduction Specialised translation and its corollaries – general translation, scientific translation, technical translation, legal translation, medical translation, and so on – are wellestablished denominations in our field, according to which many professional aspects have been organised: professional fees and standing, calls for employment, courses and degrees, academic events, etc. They ar...

We show that changes in assortative mating patterns along the dimensions of age, ethnicity, religion and education are not responsible for the increasing marital instability over the last four decades in Austria. Without the rise in the age at marriage, divorce rates would be considerably higher. Immigration and secularization, and the resulting supply of spouses with diverse ethnicity and reli...

Expanding on recent results of another an algorithm is presented that provides solution to the Frobenius Coin Problem in worst case O(n 2) in the magnitude of the largest denomination. The Frobenius Coin Problem (FCP) is one of those problems that in the past found little discussion in courses in theoretical computer science or computational complexity, while being somewhat more familiar in stu...