|
«INFORMATICS AND APPLICATIONS»
Scientific journal
Volume 12, Issue 1, 2018
Content | About Authors
Abstract and Keywords.
- V. A. Serebryakov A. A. Dorodnicyn Computing Center, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 40 Vavilov Str., Moscow 119333, Russian Federation
- O. M. Ataeva A. A. Dorodnicyn Computing Center, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 40 Vavilov Str., Moscow 119333, Russian Federation
Abstract: During development of digital libraries, рarticular attention is paid to the library content data model. In this case, the content of digital libraries can be described in various formats and presented in various ways. The library defined by the LibMeta system is considered as a storehouse of structured diverse data with the possibility of their integration with other data sources and assumes the possibility of specifying its content by describing the subject area. The ontology of the semantic library content serves as a means of formalization. It also introduces the basic concepts for describing the task of data integration from sources of Linked Open Data (LOD), concepts for defining an arbitrary thesaurus. The ontology is constructed in such a way that it is possible to determine the semantic library in an arbitrary domain.
Keywords: semantic library; data model; ontology; data source; search in LOD
- Yu. E. Malashenko A. A. Dorodnicyn Computing Center, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 40 Vavilov Str., Moscow 119333, Russian Federation
- I. A. Nazarova A. A. Dorodnicyn Computing Center, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 40 Vavilov Str., Moscow 119333, Russian Federation
- N. M. Novikova A. A. Dorodnicyn Computing Center, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 40 Vavilov Str., Moscow 119333, Russian Federation
Abstract: The method of analysis of changes in functional capabilities of the flow network system after the damaging
effects is considered. To describe the processes of streams of different interchangeable products to various peer
users, the model of single-product network is used. The damage is defined as the total amount of unsatisfied
demands. Damage estimates are calculated for all users and all possible cases of failure of physical or logical
elements of the system. Optimal solutions of the sequence of problems of minimization of total relative damages
are used as damage estimates. Based on the obtained results for various destruction configurations, the vulnerability
diagrams of the initial network system are constructed. Diagrams allow an a priori analysis of both small and critical
damages, due to which the flows to some users vanish. The proposed method can be used to study the structural
and functional vulnerability of flow network systems.
Keywords: single-product flow network; functional vulnerability; damage assessment
- L. L. Vyshinsky A. A. Dorodnicyn Computing Center, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 40 Vavilov Str., Moscow 119333, Russian Federation
- Yu. A. Flerov A. A. Dorodnicyn Computing Center, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 40 Vavilov Str., Moscow 119333, Russian Federation
- N. I. Shirokov A. A. Dorodnicyn Computing Center, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 40 Vavilov Str., Moscow 119333, Russian Federation
Abstract: The article is devoted to the problems of computer-aided weight design of aircraft. Weight and
mass-inertial parameters are one of the basic values that affect the performance characteristics of aircraft. The
informational basis of the system is the weight model of the aircraft. The paper describes the structure of the weight
model and its individual components. The program implementation of the system, which is executed within the
framework of the client-server architecture, is shown. The automated system of weight design is implemented using
the software tool complex "Project Generator" (GP technology), which was developed at the Computing Centre
of the Russian Academy of Sciences. The creation of information and computing systems within the framework
of the GP technology is based on the so-called "project approach," when the formal description of the system
automatically generates code for the client and server components of the system.
Keywords: math modeling; design automation; aircraft; weight design; weighting model; design tree; project generator; code generation; client-server architecture
- G. A. Agasandyan A. A. Dorodnicyn Computing Center, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 40 Vavilov Str., Moscow 119333, Russian Federation
Abstract: The paper investigates problems of using continuous VaR-criterion (CC-VaR) in scenario market as a discrete analog of ideal theoretical one-period option market. The participation of an investor in the market supposes that the investor prepares a forecast of future underlier's price distribution and sets the risk-preferences function. A discrete optimization algorithm as the result of projecting the theoretical algorithm based on the Newman-Pearson procedure onto scenario market is suggested. An example of the market with three scenarios, for which the optimality can be broken, is adduced. However, such violations occur seldom and are insignificant.
To improve the quality of solutions, randomization of portfolio weights as remedy of smoothing the distribution function is proposed. Special algorithms for calculations connected with yield of randomized portfolios are suggested. The exposition is illustrated by diagrams.
Keywords: continuous VaR-criterion (CC-VaR); scenario; forecast density; price density; investor's risk-preferences function (r.p.f.); optimal portfolio; investment amount; income; yield; randomization
- I. S. Aleshin Faculty of Computational Mathematics and Cybernetics, M.V. Lomonosov Moscow State University, GSP-1, Leninskie Gory, Moscow 119991, Russian Federation
Abstract: In a significant part of data mining applications such as microbiology, gene expression data, text and web information, market baskets, customer environments, input information is represented as a two-dimensional matrix "subjects-objects" ("clients-services"). The main goal of such problems is biclustering of data, based on the selection of groups in a certain sense of similar rows and columns. A lot of such problems is characterized by strong sparseness of the corresponding matrices. An important aspect of biclustering is the search in some sense of dense submatrices in boolean matrices, which is the main purpose of this research. The author formalizes subject area within the framework of algebraic approach, describes the systems of universal and local constraints, proposes and proves the corresponding criteria for solvability of the problems under consideration.
Keywords: sparse matrices; dense submatrices; algebraic approach; set-theoretic constraints; biclustering
- D. V. Vinogradov Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
Abstract: At present, Data Mining expands usage of statistical machine learning methods. The similarity-based approach uses the probabilistic combinatorial formal method (VKF (variational Kalman filter) method). The main algorithm is based on a coupling Markov chain. The authors propose a mechanism to convert lengths of preliminary trajectories (before coalescence) to an upper bound on which it is necessary to stop excessively long successive runs. The main result claims that the change of probabilities is exponentially small with respect to total variation distance, if the chain uses sufficient number of preliminary runs. This proposal may be useful when there exists a small fraction of long trajectories with respect to the rest, because it provides a balance between the size of the bound and changes of probabilities.
Keywords: similarity; Markov chain; VKF candidate; total variation; coupling
- I. N. Sinitsyn Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
Abstract: Among known methods of stochastic processes (StP) analytical modeling in differential and inte- grodifferential stochastic systems (StS) based on the direct numerical solution of equation for one-dimensional characteristic function (c.f.), it is necessary to distinguish interpolational S. V. Mal'chikov method. In this case, for c.f. interpolation, the Kotelnikov theorem was implemented. The paper contains the treatment of interpolational methods of StP analytical modeling for two classes of nonlinear non-Gaussian StS. Special attention in paid to sensitivity analysis. Test example for discontinuous nonlinearity confirms the method efficiency. Some generalizations are mentioned.
Keywords: one dimensional characteristic functions (c.f.); one-dimensional probability density (p.d.); stochastic processes (StP); stochastic system (StS)
- A. A. Grusho Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
- M. I. Zabezhailo Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
- A. A. Zatsarinny Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
- E. E. Timonina Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
Abstract: Rational counteraction to computer attacks, described as event sequences, is discussed. The approach is based on the mathematical technique of learning by precedents, formalizing similarity as a binary algebraic operation. Similarities of event sequences are analyzed. The learned classes of similarity (tolerance classes) are used to recognize computer attacks on initial steps of their life cycle. A problem-oriented resource management technology aimed at developing rational counteraction to attacks of the discussed type is presented.
Keywords: information security; data analysis; similarity as binary algebraic operation; similarity of sequences; resource management
- M. P. Krivenko Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
Abstract: Principal component analysis (PCA) is a widely used technique for processing, compressing, and
visualizing of data. New possibilities are opened by probabilistic PCA (PPCA), realized within the maximum
likelihood principle for a Gaussian model with latent variables. Within the framework of PPCA, data processing
algorithms have appeared, aimed at reducing the dimensionality of data and providing the transition to the space of
the main components, but not explicitly giving the characteristics of the main components. The article is devoted to
details that deepen the understanding of the features of PPCA and corrections of the errors revealed in publications.
Two methods for reconstructing the characteristics of principal components are proposed and substantiated. One
of them is based on recalculation of the covariance matrix in the formed space of main components. The other
method consists in successively repeating the same steps: identifying the first main component and excluding it
from data analysis.
Keywords: principal component analysis; EM-algorithm; reconstruction of axes and dispersion
- A. A. Zatsarinny Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
- A. P. Suchkov Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
Abstract: The article discusses the approaches to creation of a unified management system as a set of services in cloud computing. The proposed approach is based on the five-stage processing model. It allows defining the general form (prototype) of a unified system of situational management, taking into account all types of internal and external information interactions in the structure of a hierarchical control system. It is shown that a unified system must have a means of configuration (localization) on a specific application field. The proposed list of services and localization services provides the main functions of the control system. It is expected that such services will be in demand in a wide range of organizational systems, which should lead to a significant reduction in the cost of development and implementation and ensure the possibility of implementation of uniform information, program, and technical policy in the field of interagency and interdepartmental electronic interaction.
Keywords: unified system of situational management; cloud service; process of localization
- I. Sochenkov Institute for Systems Analysis, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation, Skolkovo Institute of Science and Technology, 3 Nobelya Str., Moscow 121205, Russian Federation
- D. Zubarev Institute for Systems Analysis, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation, Peoples' Friendship University of Russia (RUDN University), 6 Miklukho-Maklaya Str., Moscow 117198, Russian Federation
- I. Tikhomirov Institute for Systems Analysis, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
Abstract: The paper presents an effective method for topically similar document retrieval. The exploratory patent search based on this method is proposed. The developed method reduces complexity and time of patent expertise providing the computer assistance of patent search and analysis. The phrases extracted by the parser as well as single lexemes are used as descriptors for a document. This approach prevents exponential growth of the feature space and provides effective indexing even for large text collections. The results of experiments show that the proposed method significantly outperforms the basic keyword-based approach. Conclusions are made about the prospects of using the method for solving other problems such as source retrieval for plagiarism detection and full-text clustering.
Keywords: exploratory search; patent search; topic modeling; topically similar document retrieval; search and analytical engines
- S. Kovalyov Institute of Control Sciences, Russian Academy of Sciences, 65 Profsoyuznaya Str., Moscow 117997, Russian Federation
Abstract: Mathematical device built upon the category theory is developed which was previously proposed to formally describe and rigorously explore procedures of employing models in engineering that constitute the pragmatics of model-based systems engineering. The essence of the device consists in mathematical representation of assembly drawings (megamodels of systems) as diagrams in categories whose objects are models, and morphisms represent actions associated with assembling system models from component models. Category-theoretical methods for solving direct and inverse pragmatic problems of assembling systems are proposed and explored. The key role of the diagram monad is revealed. Special attention is paid to the problem of recovering the configuration of a given system, taking into account technological limitations of the assembling means and procedures. A number of key systems engineering concepts are matched with relevant constructions of the category theory
Keywords: model-based systems engineering; pragmatics; megamodel; category theory; configuration recovery problem; diagram monad
- A. A. Kudryavtsev Department of Mathematical Statistics, Faculty of Computational Mathematics and Cybernetics, M.V. Lomonosov Moscow State University, 1-52 Leninskiye Gory, GSP-1, Moscow 119991, Russian Federation
- O. V. Shestakov Department of Mathematical Statistics, Faculty of Computational Mathematics and Cybernetics, M.V. Lomonosov Moscow State University, 1-52 Leninskiye Gory, GSP-1, Moscow 119991, Russian Federation, Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
Abstract: The paper considers a new approach to the verification tasks for the declared performance indicators of large groups of complex servicing devices when the total verification is impossible or expensive. The method used is based on the study of the asymptotics of statistics in the framework of the Bayesian approach to the problems of the queuing theory. By the example of the readiness coefficient in the M |M |1 model, the authors prove the proposition relating to the class of transfer theorems which makes it possible to compare real data in bench tests of complex aggregates with theoretical predictions. The specifics of the application of the method from the point of view of a device manufacturer and a customer of a large batch of similar devices are considered. The described method and results can find application not only in the field of Bayesian queuing problems but also in other areas that use randomization of the basic parameters of the model.
Keywords: Bayesian approach; mass service systems; mixed distributions; transfer theorem; statistical
- P. V. Shnurkov National Research University Higher School of Economics, 34 Tallinskaya Str., Moscow 123458, Russian Federation
- A. Y. Egorov National Research University Higher School of Economics, 34 Tallinskaya Str., Moscow 123458, Russian Federation
Abstract: The paper deals with a discrete semi-Markov stochastic model describing the operation of a control system of continuous supply of product with constant consumption. The model is a couple of random processes (x(t), Z(t)) where the main process x(t) describes the amount of stock in the system at time t and the accompanying random process is a semi-Markov process with a finite set of states. The optimal control problem is put in relation to the stationary indicators related to the accompanying process. This indicator is the average of the specific nature of the profits earned in the evolution of the initial inventory control system. An explicit analytical representation for the probability characteristics of semi-Markov models is obtained. In the future, the results will allow to find an explicit representation of the Quality Score and solving the problem of optimal control.
Keywords: inventory management; semi-Markov stochastic process; stationary value functional; optimal control of stochastic systems
- O.V. Syuntyurenko All Russian Institute of Scientific and Technical Information of the Russian Academy of Sciences, 20a Usievich Str., Moscow 125190, Russian Federation
Abstract: The article is devoted to development of a conceptual model of an information system focused on solution of the task of management of financing of basic research with use of methods of scientometrics and analysis of data. The basic principles and the methodology of creation are formulated. Functioning of the system of support of decision-making (SSDM) in the process of distribution of fund of the state order in thematic scientific directions is sugessted. The functional structure of SPPR is presented. The prospects of use of a new multipurpose information resource and analytical postinformation processing are considered. The interrelation of tasks of management of science with problems of innovative development of branches of economy is shown.
Keywords: scientometrics; analysis of data; control systems; scientific priorities; monitoring; scientific and technical potential; postdata processing
|
