Data processing center for radioastron project hardware optimization
Today we have the problem of big science data. The information collecting in science experiments, especially in bioinformatics and astrophysics grows in amazing rate. In this paper we consider special program techniques and computer technologies used for work with superlarge volumes of data. Also, we discuss the state of affairs with the big data in the Institute of Mathematical Problems of Biology RAS and in the Pushchino Radio Astronomy Observatory (Astro Space Center of Lebedev Physics Institute RAS).
Under current conditions, we see growth in demand for IT outsourcing services. This implies the activation of design and construction processes for data processing centers (DPC). Since a DPC is a complicated and expensive system, there arises the issue of justifying selection of the future project based on the estimated costs of designing and operating data processing centers. This paper analyzes one of the possible complexes of measures to estimate costs for development and operation of data processing centers. The analysis identifi ed main groups of capital cost in development of data processing centers which were not fully taken into account in assessments of the total volume of capital investments in previously proposed methods. The article proposes regression models to evaluate processing center construction projects based on two measures. We propose to estimate the capital cost as a function of the projected fl oor space of service platforms and projected number of server racks. On the basis of the models developed, analysis of the construction sites of processing data centers was conducted. This showed the model’s suitability to real data. The main groups of operating costs for DPC maintenance were established, and a regression model of their evaluation was proposed. Based on the regression equation, we propose to calculate the processing center’s power consumption depending on the area of the service platform or the number of server racks. The operating cost of the data processing center is determined by the power value. Analysis of information on the operating cost of various data processing centers is in fairly good agreement with the calculations obtained on the basis of the model developed. The proposed models make it possible to evaluate with reasonable accuracy the project characteristics of development and subsequent operation of a data processing center.
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 dynamics of a two-component Davydov-Scott (DS) soliton with a small mismatch of the initial location or velocity of the high-frequency (HF) component was investigated within the framework of the Zakharov-type system of two coupled equations for the HF and low-frequency (LF) fields. In this system, the HF field is described by the linear Schrödinger equation with the potential generated by the LF component varying in time and space. The LF component in this system is described by the Korteweg-de Vries equation with a term of quadratic influence of the HF field on the LF field. The frequency of the DS soliton`s component oscillation was found analytically using the balance equation. The perturbed DS soliton was shown to be stable. The analytical results were confirmed by numerical simulations.
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 , 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.
I give the explicit formula for the (set-theoretical) system of Resultants of m+1 homogeneous polynomials in n+1 variables