Domestic chores are a topic of great interest for couple relationships since they are a source of conflict between intimate partners. The purpose of the present research is to investigate offering and asking for help with domestic chores and the respondents’ tendency to be intuitive or verbal or to do chores alone. A vignette applied to children and married adults. The respondents were 116 boys and 116 girls and 110 male partners and 300 female partners, who completed individual questionnaires, online using Google Forms, regarding helping behaviour. Research findings indicate that men are more verbal and women are more intuitive when offering help, but when asking for help with domestic chores, men and women are statistically similar. The present research raises questions about the role of gender differences in couple relationships, and about educational solutions for couples and provides opportunities for future research.

No abstract

Postpartum depression (PPD) is common after birth and can have a profound effect on women and their families. It is therefore important to understand the conditions and factors that lead to the occurrence and maintenance of PPD. The first aim of the current study was to identify whether there is a relationship between alexithymia and postpartum depressive symptoms (PPDS) in a sample of Romanian mothers. The second aim was to explore whether self-criticism and self-compassion mediate the relationship between alexithymia and PPDS. The current cross-sectional study included 307 mothers with babies aged between four weeks and one year. The results show that alexithymia, self-compassion, self-criticism, PPDS all correlated with one another, and self-criticism, self-compassion and alexithymia are significant predictors of PPDS. Moreover, self-criticism and self-compassion mediated the relationship between alexithymia and PPDS. A psychological therapy that increases self-compassion and reduces alexithymia and self-criticism may be beneficial for preventing symptoms of PPD.

Получены условия глобальной сходимости алгоритмов, основанных на обратных итерациях в переменной метрике, в задаче идентификации параметров дискретной стохастической системы с возмущениями в невязке уравнения и наблюдениях процессов. Доказана сходимость оценок параметров к истинному значению при увеличении объема выборки наблюдений истинного процесса. Приведены примеры расчетов The article addresses the problem of identifying parameters of discrete stochastic systems with perturbations in the residual of the equation and observation of variables. The identification functional in the problem has a complex nature of isosurfaces, which is why universal minimization algorithms based on estimates of the first and second derivatives have a small radius of convergence. It is proposed to employ efficient computational identification algorithms with inverse iterations in a variable metric for solving the convergence problem for two classes of systems with simple correspondence between matrix elements and parameters of equivalent systems without state variables. These algorithms are used for systems without state variables due to the large radius and high convergence rate since the 1970s. At first, a theorem on the conditions for convergence of inverse iterations from almost any initial approximation to a small neighborhood of the global minimum of the identification functional was proved. Secondly, a theorem on the convergence of the points of the global minimum of the identification functional to the desired true value with an increase in the sample size of observations is taken into account. Assumption of a zero first and restricted second moments of stochastic disturbances in the residual of the equation and observation of variables was made. The convergence of inverse iterations is shown numerically in a model example with significant values of disturbances. The result of the article is new theorems on the conditions of global convergence of computational algorithms with inverse iterations in the problem with mixed disturbances and the justification of possibility of using these algorithms to identify the parameters for discrete stochastic systems of two classes with a simple correspondence between matrix elements and parameters of equivalent systems without state variables

No abstract