Comparative analysis of spherical focusing transducers from dense and porous piezoceramic materials

The second author is grateful for the support of the Ministry of Education and Science of the Russian Federation, project 9.1001.2017/4.6

Análisis de la propiedad estatal en la Federación de Rusia

The aim of the article is to compare the role of state property in developed countries and to obtain a more reliable estimate of the real share of the public sector in the Russian economy based on the dynamics of its change over the period from 2005 to 2017. The estimates obtained by the authors on the share of state property in the Russian economy show that the private sector plays the main role in the Russian economy. However, higher efficiency of the economy can be achieved by combining all the advantages of private and public partnership. On the basis of the study, we can conclude that Russia is gradually adopting the North American model of public sector participation in the economy, which is characterized by its specialization in purely state functions – defense and social infrastructure.El objetivo del artículo es comparar el papel de la propiedad estatal en los países desarrollados y obtener una estimación más confiable de la participación real del sector público en la economía rusa en función de la dinámica de su cambio durante el período comprendido entre 2005 y 2017. Las estimaciones obtenidas por los autores sobre la participación de la propiedad estatal en la economía rusa muestran que el sector privado desempeña el papel principal en la economía rusa. Sin embargo, se puede lograr una mayor eficiencia de la economía combinando todas las ventajas de la asociación pública y privada. Sobre la base del estudio, podemos concluir que Rusia está adoptando gradualmente el modelo norteamericano de participación del sector público en la economía, que se caracteriza por su especialización en funciones puramente estatales: defensa e infraestructura social

Automation of complex text CAPTCHA recognition using conditional generative adversarial networks

With the rapid development of Internet technologies, the problems of network security continue to worsen. So, one of the most common methods of maintaining security and preventing malicious attacks is CAPTCHA (fully automated public Turing test). CAPTCHA most often consists of some kind of security code, to bypass which it is necessary to perform a simple task, such as entering a word displayed in an image, solving a basic arithmetic equation, etc. However, the most widely used type of CAPTCHA is still the text type. In the recent years, the development of computer vision and, in particular, neural networks has contributed to a decrease in the resistance to hacking of text CAPTCHA. However, the security and resistance to recognition of complex CAPTCHA containing a lot of noise and distortion is still insufficiently studied. This study examines CAPTCHA, the distinctive feature of which is the use of a large number of different distortions, and each individual image uses its own different set of distortions, that is why even the human eye cannot always recognize what is depicted in the photo. The purpose of this work is to assess the security of sites using the CAPTCHA text type by testing their resistance to an automated solution. This testing will be used for the subsequent development of recommendations for improving the effectiveness of protection mechanisms. The result of the work is an implemented synthetic generator and discriminator of the CGAN architecture, as well as a decoder program, which is a trained convolutional neural network that solves this type of CAPTCHA. The recognition accuracy of the model constructed in the article was 63 % on an initially very limited data set, which shows the information security risks that sites using a similar type of CAPTCHA can carry

SCANDIUM WASHING FROM IMPURITIES IN THE SATURATED TWEX PHASE

The possibility of scandium separated from impurities by saturated TWEX phase washing by mixed solution Н2О2 (3%) + С2Н2О4 (100-110 g∙L-1) at different solid –liquid phase ratio was investigated. Maximum effective scandium separation from such impurities as Al, Fe, Zr, Th was reached by the use of solution Н2О2 (3%) + С2Н2О4 (110 g∙L-1) at solid – liquid phase ratio 1:25. It is necessary to choose another stripping solution for effective Ti and U elution

Heterologous Expression of Membrane Proteins: Choosing the Appropriate Host

International audienceBACKGROUND: Membrane proteins are the targets of 50% of drugs, although they only represent 1% of total cellular proteins. The first major bottleneck on the route to their functional and structural characterisation is their overexpression; and simply choosing the right system can involve many months of trial and error. This work is intended as a guide to where to start when faced with heterologous expression of a membrane protein. METHODOLOGY/PRINCIPAL FINDINGS: The expression of 20 membrane proteins, both peripheral and integral, in three prokaryotic (E. coli, L. lactis, R. sphaeroides) and three eukaryotic (A. thaliana, N. benthamiana, Sf9 insect cells) hosts was tested. The proteins tested were of various origins (bacteria, plants and mammals), functions (transporters, receptors, enzymes) and topologies (between 0 and 13 transmembrane segments). The Gateway system was used to clone all 20 genes into appropriate vectors for the hosts to be tested. Culture conditions were optimised for each host, and specific strategies were tested, such as the use of Mistic fusions in E. coli. 17 of the 20 proteins were produced at adequate yields for functional and, in some cases, structural studies. We have formulated general recommendations to assist with choosing an appropriate system based on our observations of protein behaviour in the different hosts. CONCLUSIONS/SIGNIFICANCE: Most of the methods presented here can be quite easily implemented in other laboratories. The results highlight certain factors that should be considered when selecting an expression host. The decision aide provided should help both newcomers and old-hands to select the best system for their favourite membrane protein

Personality profiles and the "russian soul": Literary and scholarly views evaluated

Many domestic and foreign observers have claimed that Russians have a unique constellation of personality traits that mirrors their distinctive historical and cultural experience. To examine the hypothesized uniqueness of Russian personality, members of the Russian Character and Personality Survey collected data from 39 samples in 33 administrative areas of the Russian Federation. Respondents (N = 7,065) identified an ethnically Russian adult or college-aged man or woman whom they knew well and rated the target using the Russian observer-rating version of the Revised NEO Personality Inventory. The mean personality profile of Russians was very similar to the international average based on 50 different countries, debunking the myth of a unique Russian soul.The small variations from world norms did not converge with depictions of Russian national character in fiction and the scholarly literature. New items intended to capture distinctive, emic aspects of Russian personality provided no new information beyond the familiar Big Five dimensions. Religion, ethnicity, and beliefs about the uniqueness of the Russian character and the malleability of personality traits had little effect on personality ratings. Perceptions of the Russian soul do not seem to be based on the personality traits of Russians

One algorithm for branch and bound method for solving concave optimization problem

© Published under licence by IOP Publishing Ltd.The article describes the algorithm for branch and bound method for solving the concave programming problem, which is based on the idea of similarity the necessary and sufficient conditions of optimum for the original problem and for a convex programming problem with another feasible set and reverse the sign of the objective function. To find the feasible set of the equivalent convex programming problem we construct an algorithm using the idea of the branch and bound method. We formulate various branching techniques and discusses the construction of the lower objective function evaluations for the node of the decision tree. The article discusses the results of experiments of this algorithm for some famous test problems of a particular form

Local history and museum: experience of Sverdlovsk regional museum of local lore

Статья рассказывает об опыте работы областного краеведческого музея, направленном на сохранение местной истории, популяризацию краеведческих знаний, поддержку краеведческого сообщества. Интересен опыт музея по проведению краеведческих конференций и круглых столов, присуждению уникальной краеведческой награды — медали имени Н. К. Чупина.Article tells about experience of regional museum of local lore, directed on preservation of local history, promoting local history knowledge, support of local history community. It is interesting experience of the museum on carrying out local history conferences and round tables and establishment of a unique local history award — the N. K. Chupin medal

One algorithm for branch and bound method for solving concave optimization problem

© Published under licence by IOP Publishing Ltd.The article describes the algorithm for branch and bound method for solving the concave programming problem, which is based on the idea of similarity the necessary and sufficient conditions of optimum for the original problem and for a convex programming problem with another feasible set and reverse the sign of the objective function. To find the feasible set of the equivalent convex programming problem we construct an algorithm using the idea of the branch and bound method. We formulate various branching techniques and discusses the construction of the lower objective function evaluations for the node of the decision tree. The article discusses the results of experiments of this algorithm for some famous test problems of a particular form

La Patrie : journal quotidien, politique, commercial et littéraire

18 juillet 18751875/07/18 (A35)