We use cookies in order to improve the quality and usability of the HSE website. More information about the use of cookies is available here, and the regulations on processing personal data can be found here. By continuing to use the site, you hereby confirm that you have been informed of the use of cookies by the HSE website and agree with our rules for processing personal data. You may disable cookies in your browser settings.

Mental health disorders are among the leading worldwide causes of disease and long-term disability. This issue has a long and painful history of gradual de-stigmatization of patients, coinciding with humanization of therapeutic approaches. What are the current trends in Russia regarding this issue and in what ways is it similar to and different from Western countries? IQ.HSE provides an overview of this problem based on research carried out by Svetlana Kolpakova.

On September 5, Laurie Manchester, Associate Professor of History at Arizona State University, presented her paper on voluntary repatriation of Russians from China to the Soviet Union between 1935 and 1960. The presentation was part of the research seminar, ‘Boundaries of History’, held regularly by the Department of History at HSE University in St. Petersburg. HSE News Service spoke with Laurie Manchester about her research interests, collaborating with HSE faculty members, and the latest workshop.

Dr. Sabyasachi Tripathi, from Kolkata, India, is a new research fellow at HSE University. He will be working at the Laboratory for Science and Technology Studies of the Institute for Statistical Studies and Economics of Knowledge.

We consider the problem of manipulability of social choice rules in the impartial anonymous and neutral culture model (IANC) and provide a new theoretical study of the IANC model, which allows us to analytically derive the difference between the Nitzan-Kelly index in the Impartial Culture (IC) and IANC models. We show in which cases this difference is almost zero, and in which the Nitzan-Kelly index for IANC is the same as for IC. However, in some cases this difference is large enough to cause changes in the relative manipulability of social choice rules. We provide an example of such cases.

The technological process considered in the paper is a rolling of a round bar in roughing mill group, which consist of four passes. The computer simulation of the process shows that the local plastic deformations occurring in the material are extremely large, which may lead to the appearing of defects. The investigations performed, led to the development of new roll pass design, which almost halved the maximum value of local plastic deformation in the material during rolling. Since full 3D finite element method (FEM) based models needs significant amount of computer memory and CPU time, it was not suitable for the performed study, which involves a bulk of simulations with different initial conditions. Therefore, the quick algorithms for simulation of rolling processes, which based on so-called “2.5D” method, have been used. This method, due to number of simplifications, is significant faster than conventional 3D FEM, and at the same time it allows to reach good accuracy of the model. The developed computer software SPLEN(Rolling) which implements “2.5D” FEM simulations was applied for computations and analysis of the results. This software is able to predict the shape evolution of rolled material, as well as distributions of strain, strain rate and temperature within the volume of deformation zone. It has been shown that computer simulation based on “2.5D” FEM implemented in SPLEN(Rolling) software can be efficiently used for roll pass design development and optimization.

In this paper, we present a modification of dynamic programming algorithms (DPA), which we denote as graphical algorithms (GrA). For the knapsack problem and some single machine scheduling problems, it is shown that the time complexity of the GrA is less that the time complexity of the standard DPA. Moreover, the average running time of the GrA is often essentially smaller. A GrA can also solve largescale instances and instances, where the parameters are not integer. In addition, for some problems, GrA has a polynomial time complexity in contrast to a pseudo-polynomial complexity of DPA.

Let G be a semisimple algebraic group whose decomposition into the product of simple components does not contain simple groups of type A, and P⊆G be a parabolic subgroup. Extending the results of Popov [7], we enumerate all triples (G, P, n) such that (a) there exists an open G-orbit on the multiple flag variety G/P × G/P × . . . × G/P (n factors), (b) the number of G-orbits on the multiple flag variety is finite.