{"title":"Modeling of nonstationary random processes and search engine optimization processes on simulation models of queuing systems","authors":"V. Stroganov, V. Chernenky, V. Mikheev","doi":"10.18127/j19997493-202201-01","DOIUrl":"https://doi.org/10.18127/j19997493-202201-01","url":null,"abstract":"","PeriodicalId":156447,"journal":{"name":"Highly available systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115466715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
V. Belenkov, M. V. Volkov, D.A. Godikov, A. V. Kan
{"title":"The methodology of proactive aviation safety management and the formation of reliable predictive assessments of the level of flight safety","authors":"V. Belenkov, M. V. Volkov, D.A. Godikov, A. V. Kan","doi":"10.18127/j20729472-202201-04","DOIUrl":"https://doi.org/10.18127/j20729472-202201-04","url":null,"abstract":"","PeriodicalId":156447,"journal":{"name":"Highly available systems","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127138264","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Improving the efficiency of working with a web resource due to the tools of a system programmer","authors":"B. Goryachkin, T.I. Khanmurzin","doi":"10.18127/j19997493-202203-03","DOIUrl":"https://doi.org/10.18127/j19997493-202203-03","url":null,"abstract":"","PeriodicalId":156447,"journal":{"name":"Highly available systems","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130812521","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"System for distributed training of Kernel forests","authors":"D. Devyatkin","doi":"10.18127/j20729472-202203-05","DOIUrl":"https://doi.org/10.18127/j20729472-202203-05","url":null,"abstract":"","PeriodicalId":156447,"journal":{"name":"Highly available systems","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123565167","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Signal processing algorithm for neural networks with integrodifferential splines as an activation function and its particular case of image classification","authors":"T.K. Biryukova","doi":"10.18127/j20729472-202102-02","DOIUrl":"https://doi.org/10.18127/j20729472-202102-02","url":null,"abstract":"Classic neural networks suppose trainable parameters to include just weights of neurons. This paper proposes parabolic integrodifferential splines (ID-splines), developed by author, as a new kind of activation function (AF) for neural networks, where ID-splines coefficients are also trainable parameters. Parameters of ID-spline AF together with weights of neurons are vary during the training in order to minimize the loss function thus reducing the training time and increasing the operation speed of the neural network. The newly developed algorithm enables software implementation of the ID-spline AF as a tool for neural networks construction, training and operation. It is proposed to use the same ID-spline AF for neurons in the same layer, but different for different layers. In this case, the parameters of the ID-spline AF for a particular layer change during the training process independently of the activation functions (AFs) of other network layers. In order to comply with the continuity condition for the derivative of the parabolic ID-spline on the interval (x x0, n) , its parameters fi (i= 0,...,n) should be calculated using the tridiagonal system of linear algebraic equations: To solve the system it is necessary to use two more equations arising from the boundary conditions for specific problems. For exam- ple the values of the grid function (if they are known) in the points (x x0, n) may be used for solving the system above: f f x0 = ( 0) , f f xn = ( n) . The parameters Iii+1 (i= 0,...,n−1 ) are used as trainable parameters of neural networks. The grid boundaries and spacing of the nodes of ID-spline AF are best chosen experimentally. The optimal selection of grid nodes allows improving the quality of results produced by the neural network. The formula for a parabolic ID-spline is such that the complexity of the calculations does not depend on whether the grid of nodes is uniform or non-uniform. An experimental comparison of the results of image classification from the popular FashionMNIST dataset by convolutional neural 0, x< 0 networks with the ID-spline AFs and the well-known ReLUx( ) =AF was carried out. The results reveal that the usage x x, ≥ 0 of the ID-spline AFs provides better accuracy of neural network operation than the ReLU AF. The training time for two convolutional layers network with two ID-spline AFs is just about 2 times longer than with two instances of ReLU AF. Doubling of the training time due to complexity of the ID-spline formula is the acceptable price for significantly better accuracy of the network. Wherein the difference of an operation speed of the networks with ID-spline and ReLU AFs will be negligible. The use of trainable ID-spline AFs makes it possible to simplify the architecture of neural networks without losing their efficiency. The modification of the well-known neural networks (ResNet etc.) by replacing traditional AFs with ID-spline AFs is a promising approach to increase the neural network operation","PeriodicalId":156447,"journal":{"name":"Highly available systems","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123392950","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Creation of an information management system for food industry enterprises in the CRM concept","authors":"V. Novitsky, A. Semenov","doi":"10.18127/j19997493-202202-03","DOIUrl":"https://doi.org/10.18127/j19997493-202202-03","url":null,"abstract":"","PeriodicalId":156447,"journal":{"name":"Highly available systems","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122729408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Comparatives assessments of the main indicators defining the conditions for the artificial intelligence industry development in the Russian Federation, USA and PRC","authors":"A. E. Nikolaev, I. A. Abramov","doi":"10.18127/j19997493-202203-06","DOIUrl":"https://doi.org/10.18127/j19997493-202203-06","url":null,"abstract":"","PeriodicalId":156447,"journal":{"name":"Highly available systems","volume":"283 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116094650","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Graphic dynamic modelling of information telecommunication network in interests of a rational distribution of resources","authors":"D.A. Tavalinskiy, D.A. Krasikov","doi":"10.18127/j19997493-202203-04","DOIUrl":"https://doi.org/10.18127/j19997493-202203-04","url":null,"abstract":"","PeriodicalId":156447,"journal":{"name":"Highly available systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125206586","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Intellectual capabilities of cluster analysis 5G-6G Transition Neuroprocessor Resource Architectures","authors":"V. Ruchkin, B. Kostrov, V. Fulin","doi":"10.18127/j19997493-202202-02","DOIUrl":"https://doi.org/10.18127/j19997493-202202-02","url":null,"abstract":"","PeriodicalId":156447,"journal":{"name":"Highly available systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125585822","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
E. Goncharov, P. Iljin, V. Munerman, T. A. Samoylova
{"title":"The approach to increasing the efficiency of convolution algorithms in modern high-availability systems","authors":"E. Goncharov, P. Iljin, V. Munerman, T. A. Samoylova","doi":"10.18127/j20729472-202101-02","DOIUrl":"https://doi.org/10.18127/j20729472-202101-02","url":null,"abstract":"Most modern high-availability information systems are either based on systems that are classified as artificial intelligence, or to a large extent include them as components. The solution of many problems of artificial intelligence is based on the use of algorithms that implement the convolution operation (for example, algorithms for training neural networks). The article proposes an approach that, on the one hand, provides a strict formalization of this operation based on the algebra of multidimensional matrices, and on the other hand, due to this, it provides such practical advantages as simplifying and reducing the cost of developing such information systems, as well as reducing the execution time of queries to them. due to the simplicity of the development of parallel algorithms and programs and the efficient use of parallel computing systems. Convolution is an indispensable operation for solving many scientific and technical problems, such as machine learning, data analysis, signal processing, image processing filters. An important role is played by multidimensional convolutions, which are widely used in various subject areas. At the same time, due to the complexity of the algorithms that implement them, in practice even three-dimensional convolutions are used much less frequently than one- and two-dimensional ones. Replacing a multidimensional convolution operation with a sequence of convolution operations of lower dimensions significantly increases its computational complexity. The main reason for this lies in the absence of a unified strict definition of the operation and overload in mathematics of the term «convolution». Therefore, the article discusses a multidimensional-matrix computation model, which allows one to effectively formalize problems whose solution uses multidimensional convolution operations, and to implement an effective solution to these problems due to the natural parallelism inherent in the operations of the algebra of multidimensional matrices.","PeriodicalId":156447,"journal":{"name":"Highly available systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126296592","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}