Методика оценки сложных технических проектов с учетом фактора импортозамещения
There are some questions of application of decision-making support methods at administration and implementation of difficult projects are considered in the article, taking into account an import substitution factor. The problem definition of configuration of a product is given taking into account a factor of import substitution of element base. It is shown that these tasks have difficult and multicriteria character. Thus the person making the decision (the project manager, the head of design division, the development engineer) can make mistakes by search of the most rational decision. At implementation of difficult expensive projects the price of these errors of bike can also complicate the project fulfillment from the point of view of further certification of a product or obtaining the status of the entrusted equipment. In the article the technique of a choice of configuration and execution of elements of a product for various cases of basic data is offered.
The work is devoted to the mechanisms of preference policy in public procurement system in Russia. The paper discusses the technologies and risks of the preference policy of government in the public contracting and justify the need for the balance between preferential support and open competition.
The article is devoted to the practical aspects of procurement procedures in the medical organizations according to Russian public procurement law. The paper discusses the peculiarities and risks of purchasing procedures of medicines, medical tools and equipment in the budgetary medical organizations.
The Chapter describes the concept of import substitution and the approaches of different authors to this concept. The main emphasis is on the fact that import substitution is part of the state economic policy. The historical aspects of the emergence of this concept are considered.
The research was carried out an econometric analysis of the relationship of food spending residents of St. Petersburg on a number of factors. It has been established that the presence of the food embargo and the rise in oil prices increases the cost of food. High GDP growth reduces them. CPI product category affects differently.
In the article the analysis of the influence of economic sanctions on the processes of Russia’s political and economic self-identification is carried out. Also the evaluation of reciprocal measures of Russia is carried out. The conducted research has shown that for stabilization of Russian economy it is necessary not only to re-direct the foreign trade relations, but also to develop national industries carrying out effective policy of import substitution.
This article examines the relationship between import of components and export of products in Russian manufacturing companies. We test whether the import of components and semi-finished goods for further processing increases export intensity and innovativeness of export at the firm level. Additionally, the effect of imports of equipment and other means of production on the competitiveness of exports is tested. We employ cross-sectional data for 895 manufacturing firms in Russia in 2014 which comes from the RUFIGE database. To test the hypothesis, we use probit regression. The study shows that import of high-tech components provides higher competitiveness in export markets and is associated with higher share of export revenues in Russian manufacturing firms. We also find a positive impact of imports of machinery and equipment on the export of high-tech products in Russian manufacturing firms.
The monograph reveals one of the Central perspectives of import substitution, which is not a simple increase in production volumes, but a reduction in the costs of both production and circulation, based on the use of advanced technologies corresponding to higher technological structures. The monograph is intended for students and postgraduates, as well as a wide range of readers interested in the possibilities of mareting as a concept of company management.
A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.
Event logs collected by modern information and technical systems usually contain enough data for automated process models discovery. A variety of algorithms was developed for process models discovery, conformance checking, log to model alignment, comparison of process models, etc., nevertheless a quick analysis of ad-hoc selected parts of a journal still have not get a full-fledged implementation. This paper describes an ROLAP-based method of multidimensional event logs storage for process mining. The result of the analysis of the journal is visualized as directed graph representing the union of all possible event sequences, ranked by their occurrence probability. Our implementation allows the analyst to discover process models for sublogs defined by ad-hoc selection of criteria and value of occurrence probability
The geographic information system (GIS) is based on the first and only Russian Imperial Census of 1897 and the First All-Union Census of the Soviet Union of 1926. The GIS features vector data (shapefiles) of allprovinces of the two states. For the 1897 census, there is information about linguistic, religious, and social estate groups. The part based on the 1926 census features nationality. Both shapefiles include information on gender, rural and urban population. The GIS allows for producing any necessary maps for individual studies of the period which require the administrative boundaries and demographic information.
It is well-known that the class of sets that can be computed by polynomial size circuits is equal to the class of sets that are polynomial time reducible to a sparse set. It is widely believed, but unfortunately up to now unproven, that there are sets in EXPNP, or even in EXP that are not computable by polynomial size circuits and hence are not reducible to a sparse set. In this paper we study this question in a more restricted setting: what is the computational complexity of sparse sets that are selfreducible? It follows from earlier work of Lozano and Torán (in: Mathematical systems theory, 1991) that EXPNP does not have sparse selfreducible hard sets. We define a natural version of selfreduction, tree-selfreducibility, and show that NEXP does not have sparse tree-selfreducible hard sets. We also construct an oracle relative to which all of EXP is reducible to a sparse tree-selfreducible set. These lower bounds are corollaries of more general results about the computational complexity of sparse sets that are selfreducible, and can be interpreted as super-polynomial circuit lower bounds for NEXP.