Pub Date : 2022-06-24DOI: 10.31799/1684-8853-2022-3-9-19
S. Pchelintsev, Mikhail Liashkov, O. Kovaleva
Introduction: The lack of training data leads to low accuracy of visual pattern recognition. One way to solve this problem is to use real data in combination with synthetic data. Purpose: To improve the performance of pattern recognition systems in computer vision by mixing real and synthetic data for training, and to reduce the time needed for preparing training data. Results: We have built an intelligent information system on the basis of the proposed method which allows the generation of synthetic images. The system allows to generate large and representative samples of images for pattern recognition neural network training. We have also developed software for the synthetic image generator for neural network training. The generator has a modular architecture, which makes it easy to modify, remove or add individual stages to the synthetic image generation pipeline. One can adjust individual parameters (like lighting or blurring) for generated images. The experiment was aimed to compare the accuracy of pattern recognition for a neural network trained on different training samples. The combination of real and synthetic data in model training showed the best recognition performance. Artificially generated training samples, in which the scale of background objects is approximately equal to the scale of the object of interest, and the number of objects of interest in the frame is higher, turned out to be more efficient than other artificially constructed training samples. Changing focal length of the camera in the synthetic image generation scene had no effect on the recognition performance. Practical relevance: The proposed image generation method allows to create a large set of artificially constructed data for training neural networks in pattern recognition in less time than it would take to create the same set of real data.
{"title":"Method for creating synthetic data sets for training neural network models for object recognition","authors":"S. Pchelintsev, Mikhail Liashkov, O. Kovaleva","doi":"10.31799/1684-8853-2022-3-9-19","DOIUrl":"https://doi.org/10.31799/1684-8853-2022-3-9-19","url":null,"abstract":"Introduction: The lack of training data leads to low accuracy of visual pattern recognition. One way to solve this problem is to use real data in combination with synthetic data. Purpose: To improve the performance of pattern recognition systems in computer vision by mixing real and synthetic data for training, and to reduce the time needed for preparing training data. Results: We have built an intelligent information system on the basis of the proposed method which allows the generation of synthetic images. The system allows to generate large and representative samples of images for pattern recognition neural network training. We have also developed software for the synthetic image generator for neural network training. The generator has a modular architecture, which makes it easy to modify, remove or add individual stages to the synthetic image generation pipeline. One can adjust individual parameters (like lighting or blurring) for generated images. The experiment was aimed to compare the accuracy of pattern recognition for a neural network trained on different training samples. The combination of real and synthetic data in model training showed the best recognition performance. Artificially generated training samples, in which the scale of background objects is approximately equal to the scale of the object of interest, and the number of objects of interest in the frame is higher, turned out to be more efficient than other artificially constructed training samples. Changing focal length of the camera in the synthetic image generation scene had no effect on the recognition performance. Practical relevance: The proposed image generation method allows to create a large set of artificially constructed data for training neural networks in pattern recognition in less time than it would take to create the same set of real data.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44620000","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}
Pub Date : 2022-06-24DOI: 10.31799/1684-8853-2022-3-55-66
Dmitriy Levin, A. Parshutkin, A. Timoshenko
Introduction: Radar information processing methods are used to identify targets at short observation intervals, based on the identification of marks of different radar stations and the parametric identification of a target. However, a mutual comparison of the effectiveness of using such methods of target selection in the conditions of relayed interference has not been carried out. Purpose: The comparison of the reliability of target selection in the conditions of relayed interference in a network of geographically separated radar stations for space surveillance with the implementation of correlation ellipsoid method, strobe method of target selection and spatial separation of measured target positions method. Results: We give the decision rules for dividing the space of coordinate difference of a target into subdomains to make a decision about the truth of the target. We have carried out simulation modeling of the target selection in the conditions of relayed interference and have obtained the dependencies for the change in the probability of erroneous selection of false marks on the normalized range which is measured from the middle of the spacing base of the two geographically separated radar stations. There are also quantitative estimates of the reliability of target selection for various conditions of radar surveillance by two geographically separated radar stations. The gain in increasing the normalized range with the use of the correlation ellipsoid method as compared to strobe methods of target selection and spatial separation of measured target positions method ranged from 36% to 46%. It is shown that in most practical situations one can use the simplest method, that is the spatial separation of measured target positions method, and when solving most important problems the correlation ellipsoid method can be used. Practical relevance: Research results can be used in the development of target selection algorithms in the conditions of relayed interference.
{"title":"Reliability of target selection in the network of geographically separated radar stations in joint processing of radar information in the conditions of relayed interference","authors":"Dmitriy Levin, A. Parshutkin, A. Timoshenko","doi":"10.31799/1684-8853-2022-3-55-66","DOIUrl":"https://doi.org/10.31799/1684-8853-2022-3-55-66","url":null,"abstract":"Introduction: Radar information processing methods are used to identify targets at short observation intervals, based on the identification of marks of different radar stations and the parametric identification of a target. However, a mutual comparison of the effectiveness of using such methods of target selection in the conditions of relayed interference has not been carried out. Purpose: The comparison of the reliability of target selection in the conditions of relayed interference in a network of geographically separated radar stations for space surveillance with the implementation of correlation ellipsoid method, strobe method of target selection and spatial separation of measured target positions method. Results: We give the decision rules for dividing the space of coordinate difference of a target into subdomains to make a decision about the truth of the target. We have carried out simulation modeling of the target selection in the conditions of relayed interference and have obtained the dependencies for the change in the probability of erroneous selection of false marks on the normalized range which is measured from the middle of the spacing base of the two geographically separated radar stations. There are also quantitative estimates of the reliability of target selection for various conditions of radar surveillance by two geographically separated radar stations. The gain in increasing the normalized range with the use of the correlation ellipsoid method as compared to strobe methods of target selection and spatial separation of measured target positions method ranged from 36% to 46%. It is shown that in most practical situations one can use the simplest method, that is the spatial separation of measured target positions method, and when solving most important problems the correlation ellipsoid method can be used. Practical relevance: Research results can be used in the development of target selection algorithms in the conditions of relayed interference.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44416411","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}
Pub Date : 2022-06-24DOI: 10.31799/1684-8853-2022-3-20-30
I. Lebedev
Introduction: Achievement of specified qualitative indicators in machine learning solutions depends not only on the efficiency of algorithms, but also on data properties. One of the lines for the development of classification and regression models is the specification of local properties of data. Purpose: To improve the qualitative predictors when solving classification and regression problems based on the adaptive selection of various machine learning models on separate local segments of data sample. Results: We propose a method that uses a combination of different models and machine learning algorithms on subsamples in regression and classification problems. The method is based on the calculation of qualitative predictors and the selection of the best models on the local segments of data sample. The finding of transformations of data and time series allows to create sample sets, with the data having different properties (for example, variance, sampling fraction, data range, etc.). We consider the data segmentation based on the change point detection algorithm in time series trends and on analytical information. On the example of the real dataset, we show the experimental values of the loss function for the proposed method with different classifiers on separate segments and on the whole sample. Practical relevance: The results can be used in classification and regression problems for the development of machine learning models and methods. The proposed method allows to improve classification and regression qualitative predictors by assigning models that have the best performance on separate segments.
{"title":"Adaptive application of machine learning models on separate segments of a data sample in regression and classification problems","authors":"I. Lebedev","doi":"10.31799/1684-8853-2022-3-20-30","DOIUrl":"https://doi.org/10.31799/1684-8853-2022-3-20-30","url":null,"abstract":"Introduction: Achievement of specified qualitative indicators in machine learning solutions depends not only on the efficiency of algorithms, but also on data properties. One of the lines for the development of classification and regression models is the specification of local properties of data. Purpose: To improve the qualitative predictors when solving classification and regression problems based on the adaptive selection of various machine learning models on separate local segments of data sample. Results: We propose a method that uses a combination of different models and machine learning algorithms on subsamples in regression and classification problems. The method is based on the calculation of qualitative predictors and the selection of the best models on the local segments of data sample. The finding of transformations of data and time series allows to create sample sets, with the data having different properties (for example, variance, sampling fraction, data range, etc.). We consider the data segmentation based on the change point detection algorithm in time series trends and on analytical information. On the example of the real dataset, we show the experimental values of the loss function for the proposed method with different classifiers on separate segments and on the whole sample. Practical relevance: The results can be used in classification and regression problems for the development of machine learning models and methods. The proposed method allows to improve classification and regression qualitative predictors by assigning models that have the best performance on separate segments.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48828575","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}
Pub Date : 2022-06-24DOI: 10.31799/1684-8853-2022-3-2-8
N. Balonin, A. Sergeev
Introduction: Orthogonal Hadamard matrices consisting of elements 1 and –1 (real number) exist for orders that are multiples of 4. The study considers the product of an orthogonal Hadamard matrix and its core, which is called the Scarpis product, and is similar in meaning to the Kronecker product. Purpose: To show by revealing the symmetries of the block Hadamard matrices that their observance contributes to a product that generalizes the Scarpis method to the nonexistence of a finite field. Results: The study demonstrates that orthogonality is an invariant of the product under discussion, subject to the two conditions: one of the multipliers is inserted into the other one, the sign of the elements of the second multiplier taken into account (the Kronecker product), but with a selective action of the sign on the elements and, most importantly, with the cyclic permutation of the core which depends on the insertion location. The paper shows that such shifts can be completely avoided by using symmetries that are characteristic of the universal forms of Hadamard matrices. In addition, this technique is common for many varieties of adjustable Kronecker products. Practical relevance: Orthogonal sequences and effective methods for their finding by the theory of finite fields and groups are of direct practical importance for the problems of noiseless coding, video compression and visual masking.
{"title":"Hadamard matrices as a result of Scarpis product without cyclic shifts","authors":"N. Balonin, A. Sergeev","doi":"10.31799/1684-8853-2022-3-2-8","DOIUrl":"https://doi.org/10.31799/1684-8853-2022-3-2-8","url":null,"abstract":"Introduction: Orthogonal Hadamard matrices consisting of elements 1 and –1 (real number) exist for orders that are multiples of 4. The study considers the product of an orthogonal Hadamard matrix and its core, which is called the Scarpis product, and is similar in meaning to the Kronecker product. Purpose: To show by revealing the symmetries of the block Hadamard matrices that their observance contributes to a product that generalizes the Scarpis method to the nonexistence of a finite field. Results: The study demonstrates that orthogonality is an invariant of the product under discussion, subject to the two conditions: one of the multipliers is inserted into the other one, the sign of the elements of the second multiplier taken into account (the Kronecker product), but with a selective action of the sign on the elements and, most importantly, with the cyclic permutation of the core which depends on the insertion location. The paper shows that such shifts can be completely avoided by using symmetries that are characteristic of the universal forms of Hadamard matrices. In addition, this technique is common for many varieties of adjustable Kronecker products. Practical relevance: Orthogonal sequences and effective methods for their finding by the theory of finite fields and groups are of direct practical importance for the problems of noiseless coding, video compression and visual masking.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41802303","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}
Pub Date : 2022-05-11DOI: 10.31799/1684-8853-2022-2-11-19
V. Arseniev, A. Yadrenkin
Introduction: For the detection of most dangerous artificial space objects (space junk) in near-earth space, it is planned to use specialized spacecraft equipped with optoelectronic devices. In relation to this a problem arose when selecting the most dangerous object from the observed multitude, based on the measurements of inhomogeneous selective features that characterize these objects. Purpose: To form a composite non-dimensional indicator that depends on the quantity and quality of measurement information about the observed space objects, and that determines the decision rule for selecting the most dangerous object to maximize the probability of making the right decision. Results: A method is proposed for selecting the most dangerous space object under the condition of the limited amount of measurement information about physically inhomogeneous selective features of space objects located in the area which is observed by a specialized spacecraft. It should be noted that the measurement data on individual selective features of space objects may be absent. The proposed decision rule for the selection of the most dangerous space object takes into account not only inaccuracies and errors, but also the number of measurements of the selective characteristics of each object. The efficiency of the method has been demonstrated on a relevant example. Practical relevance: The simplicity of the determination of composite indicators characterizing space objects that are located in the area observed by a specialized spacecraft, and of the decision rule for selecting the most dangerous object makes it possible to solve this problem on board a specialized spacecraft in real time.
{"title":"Selection of a given space object from the multitude observed by a specialized spacecraft","authors":"V. Arseniev, A. Yadrenkin","doi":"10.31799/1684-8853-2022-2-11-19","DOIUrl":"https://doi.org/10.31799/1684-8853-2022-2-11-19","url":null,"abstract":"Introduction: For the detection of most dangerous artificial space objects (space junk) in near-earth space, it is planned to use specialized spacecraft equipped with optoelectronic devices. In relation to this a problem arose when selecting the most dangerous object from the observed multitude, based on the measurements of inhomogeneous selective features that characterize these objects. Purpose: To form a composite non-dimensional indicator that depends on the quantity and quality of measurement information about the observed space objects, and that determines the decision rule for selecting the most dangerous object to maximize the probability of making the right decision. Results: A method is proposed for selecting the most dangerous space object under the condition of the limited amount of measurement information about physically inhomogeneous selective features of space objects located in the area which is observed by a specialized spacecraft. It should be noted that the measurement data on individual selective features of space objects may be absent. The proposed decision rule for the selection of the most dangerous space object takes into account not only inaccuracies and errors, but also the number of measurements of the selective characteristics of each object. The efficiency of the method has been demonstrated on a relevant example. Practical relevance: The simplicity of the determination of composite indicators characterizing space objects that are located in the area observed by a specialized spacecraft, and of the decision rule for selecting the most dangerous object makes it possible to solve this problem on board a specialized spacecraft in real time.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43915167","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}
Pub Date : 2022-05-11DOI: 10.31799/1684-8853-2022-2-2-10
Dragomiru Z. Dokovic
Introduction: It is conjectured that the symmetric Hadamard matrices of order 4v exist for all odd integers v>0. In recent years, their existence has been proven for many new orders by using a special method known as the propus construction. This construction uses difference families Xk (k=1, 2, 3, 4) over the cyclic group Zv (integers mod v) with parameters (v; k1, k2, k3, k4; λ) where X1 is symmetric, X2=X3, and k1+2k2+k4=v+λ. It is also conjectured that such difference families (known as propus families) exist for all parameter sets mentioned above excluding the case when all the ki are equal. This new conjecture has been verified for all odd v≤53. Purpose: To construct many new symmetric Hadamard matrices by using the propus construction and to provide further support for the above-mentioned conjecture. Results: The first examples of symmetric Hadamard matrices of orders 4v are presented for v=127 and v=191. The systematic computer search for symmetric Hadamard matrices based on the propus construction has been extended to cover the cases v=55, 57, 59, 61, 63. Practical relevance: Hadamard matrices are used extensively in the problems of error-free coding, and compression and masking of video information.
{"title":"Some new symmetric Hadamard matrices","authors":"Dragomiru Z. Dokovic","doi":"10.31799/1684-8853-2022-2-2-10","DOIUrl":"https://doi.org/10.31799/1684-8853-2022-2-2-10","url":null,"abstract":"Introduction: It is conjectured that the symmetric Hadamard matrices of order 4v exist for all odd integers v>0. In recent years, their existence has been proven for many new orders by using a special method known as the propus construction. This construction uses difference families Xk (k=1, 2, 3, 4) over the cyclic group Zv (integers mod v) with parameters (v; k1, k2, k3, k4; λ) where X1 is symmetric, X2=X3, and k1+2k2+k4=v+λ. It is also conjectured that such difference families (known as propus families) exist for all parameter sets mentioned above excluding the case when all the ki are equal. This new conjecture has been verified for all odd v≤53. Purpose: To construct many new symmetric Hadamard matrices by using the propus construction and to provide further support for the above-mentioned conjecture. Results: The first examples of symmetric Hadamard matrices of orders 4v are presented for v=127 and v=191. The systematic computer search for symmetric Hadamard matrices based on the propus construction has been extended to cover the cases v=55, 57, 59, 61, 63. Practical relevance: Hadamard matrices are used extensively in the problems of error-free coding, and compression and masking of video information.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43085165","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}
Pub Date : 2022-05-11DOI: 10.31799/1684-8853-2022-2-42-52
Alexander V. Smirnov, N. Teslya
Introduction: The use of linear programming methods in making decisions on hospitalization in a fragile epidemiological situation may be hampered by the necessity to take account of a large number of parameters and limitations of the participants. Purpose: Development of an approach to selecting effective action strategies for the participants in a hospitalization process, with social factors taken into consideration. The approach is based on the theory of cooperative games which are solved with the use of a genetic algorithm. Results: A cost function has been developed for evaluating the effectiveness of the hospitalization process on the basis of the selected strategies and in consideration of social factors. A genetic algorithm has been designed in which the proposed effectiveness evaluation function is used as a fitness function for a population, while to determine chromosomes of individuals in the population the set of selected strategies of the hospitalization process participants is used. The approach has been tested using the data on hospitalizations of patients with suspected COVID-19, that were provided by several ambulance stations in Saint-Petersburg, Russia. The study shows the superiority of the proposed approach over the previously developed one in terms of the speed of solving a cooperative game, the quality of the solution being maintained. Practical relevance: Some software which is based on the proposed approach can be integrated into an ambulance dispatcher’s automated workstation to support decision-making during the process of hospitalization in a fragile epidemiological situation.
{"title":"Selecting effective action strategies for the participants in a hospitalization process with the use of a fuzzy cooperative game and a genetic algorithm","authors":"Alexander V. Smirnov, N. Teslya","doi":"10.31799/1684-8853-2022-2-42-52","DOIUrl":"https://doi.org/10.31799/1684-8853-2022-2-42-52","url":null,"abstract":"Introduction: The use of linear programming methods in making decisions on hospitalization in a fragile epidemiological situation may be hampered by the necessity to take account of a large number of parameters and limitations of the participants. Purpose: Development of an approach to selecting effective action strategies for the participants in a hospitalization process, with social factors taken into consideration. The approach is based on the theory of cooperative games which are solved with the use of a genetic algorithm. Results: A cost function has been developed for evaluating the effectiveness of the hospitalization process on the basis of the selected strategies and in consideration of social factors. A genetic algorithm has been designed in which the proposed effectiveness evaluation function is used as a fitness function for a population, while to determine chromosomes of individuals in the population the set of selected strategies of the hospitalization process participants is used. The approach has been tested using the data on hospitalizations of patients with suspected COVID-19, that were provided by several ambulance stations in Saint-Petersburg, Russia. The study shows the superiority of the proposed approach over the previously developed one in terms of the speed of solving a cooperative game, the quality of the solution being maintained. Practical relevance: Some software which is based on the proposed approach can be integrated into an ambulance dispatcher’s automated workstation to support decision-making during the process of hospitalization in a fragile epidemiological situation.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49001374","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}
Pub Date : 2022-05-11DOI: 10.31799/1684-8853-2022-2-32-41
Mariya Shelest
Introduction: An urgent task of today is to develop new analysis methods for complex information systems that now demand higher standards for maintaining data integrity. One of the important quality characteristics of such systems is average transaction time. However, currently there are almost no mathematical models and speed estimation tools for such systems. Purpose: To develop and analyze a distributed information system model based on queueing networks. Results: A type of information systems that demand higher standards for maintaining data integrity has been described, the corresponding assumptions for such systems are given. A convenient way to represent such systems as transaction paths dependency graphs has been proposed, with each path being represented as one tandem queueing system. The calculation of their functional characteristics have been provided. This method of representation has made it possible to simplify the analysis of complex systems, which resulted in obtaining closed-form expressions for temporal estimation of the system type in question. In addition, two mechanisms of decomposition of the proposed graph are considered with the subsequent calculation of the lower bound for average transaction time. The accuracy of both approaches is analyzed with simulation modeling methods. Practical relevance: The proposed models allow estimating speed limits of an information system during the design phase.
{"title":"Average delay estimation for one queueing network model with resource reservation","authors":"Mariya Shelest","doi":"10.31799/1684-8853-2022-2-32-41","DOIUrl":"https://doi.org/10.31799/1684-8853-2022-2-32-41","url":null,"abstract":"Introduction: An urgent task of today is to develop new analysis methods for complex information systems that now demand higher standards for maintaining data integrity. One of the important quality characteristics of such systems is average transaction time. However, currently there are almost no mathematical models and speed estimation tools for such systems. Purpose: To develop and analyze a distributed information system model based on queueing networks. Results: A type of information systems that demand higher standards for maintaining data integrity has been described, the corresponding assumptions for such systems are given. A convenient way to represent such systems as transaction paths dependency graphs has been proposed, with each path being represented as one tandem queueing system. The calculation of their functional characteristics have been provided. This method of representation has made it possible to simplify the analysis of complex systems, which resulted in obtaining closed-form expressions for temporal estimation of the system type in question. In addition, two mechanisms of decomposition of the proposed graph are considered with the subsequent calculation of the lower bound for average transaction time. The accuracy of both approaches is analyzed with simulation modeling methods. Practical relevance: The proposed models allow estimating speed limits of an information system during the design phase.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49286145","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}
Pub Date : 2022-05-11DOI: 10.31799/1684-8853-2022-2-20-31
Andrey Petrov, I. Nikiforov, Sergey Ustinov
Introduction: Hypervisor managers may become deprecated or outdated or may fail. In addition, customers may want to rebalance hypervisor load. All these can cause problems related to the incompatibility of software with different manager versions or to the level of application integration. An effective solution to such problems is to automatically migrate the configuration and resources between hypervisor manager instances. Purpose: To develop an algorithm of the automatic migration of configurations and resources of an ESXi cluster between different vCenter Server instances with the ability to rollback in the event of a failure. Results: An automatic migration algorithm has been proposed. On its basis a program module for enterprise storage has been developed, which allows migrating an ESXi cluster on which a storage system is deployed from one vCenter Server to another. The module handles errors, and in case an exception or error occurs the module initiates a rollback operation in order to revert to the original vCenter Server. The study presents an experimental evaluation based on the comparison of the manual migration and the execution of the developed module. The time needed for the migration procedure has been reduced from 55 minutes to about 3 minutes, i.e., by 15–18 times. The amount of information to be known or taken into consideration by a user has also been reduced. Practical relevance: The study results have been used for enterprise storage. The developed module makes migrations to a new vCenter Server easier and faster.
{"title":"Algorithm of ESXi cluster migration between different vCenter servers with the ability to rollback","authors":"Andrey Petrov, I. Nikiforov, Sergey Ustinov","doi":"10.31799/1684-8853-2022-2-20-31","DOIUrl":"https://doi.org/10.31799/1684-8853-2022-2-20-31","url":null,"abstract":"Introduction: Hypervisor managers may become deprecated or outdated or may fail. In addition, customers may want to rebalance hypervisor load. All these can cause problems related to the incompatibility of software with different manager versions or to the level of application integration. An effective solution to such problems is to automatically migrate the configuration and resources between hypervisor manager instances. Purpose: To develop an algorithm of the automatic migration of configurations and resources of an ESXi cluster between different vCenter Server instances with the ability to rollback in the event of a failure. Results: An automatic migration algorithm has been proposed. On its basis a program module for enterprise storage has been developed, which allows migrating an ESXi cluster on which a storage system is deployed from one vCenter Server to another. The module handles errors, and in case an exception or error occurs the module initiates a rollback operation in order to revert to the original vCenter Server. The study presents an experimental evaluation based on the comparison of the manual migration and the execution of the developed module. The time needed for the migration procedure has been reduced from 55 minutes to about 3 minutes, i.e., by 15–18 times. The amount of information to be known or taken into consideration by a user has also been reduced. Practical relevance: The study results have been used for enterprise storage. The developed module makes migrations to a new vCenter Server easier and faster.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45901308","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}
Pub Date : 2022-05-11DOI: 10.31799/1684-8853-2022-2-53-61
Vadim Titov, O. Dick
Introduction: The analysis of interrelationships between the bioelectric activity of the brain and heart is one of the topical issues in modern neuroscience. Special attention of researchers in this area is attracted by the study of these interrelationships in cases of cerebral vascular pathology. Purpose: The use of synchrosqueezed wavelet transforms to measure the relationship between the rhythms of the brain and heart in cases of vascular pathology of varying severity before and during hyperventilation load. Results: The analysis of instantaneous frequencies has been carried out in the low-frequency components of an electroencephalogram and the RR interval time series extracted from the electrocardiogram of patients with vascular pathology of varying severity before and during hyperventilation. The research shows that the time when a correlation between instantaneous frequencies of the infra-slow oscillations of an electroencephalogram and the RR interval time series occurs is related to the degree of severity of cerebral vascular pathology. It has been found that the greater the severity of the vascular pathology of the brain, the faster a correlation occurs between instantaneous frequencies in the low-frequency components of an electroencephalogram and heart rate variability. Practical relevance: The discovered peculiarities of the frequency interrelationships between the rhythms of the brain and heart during hyperventilation may be useful for the search of neurophysiological correlates of the degree of severity of cerebral vascular pathology.
{"title":"Frequency analysis based on synchrosqueezed wavelet transforms of brain and heart rhythms in cases of cerebral vascular pathology","authors":"Vadim Titov, O. Dick","doi":"10.31799/1684-8853-2022-2-53-61","DOIUrl":"https://doi.org/10.31799/1684-8853-2022-2-53-61","url":null,"abstract":"Introduction: The analysis of interrelationships between the bioelectric activity of the brain and heart is one of the topical issues in modern neuroscience. Special attention of researchers in this area is attracted by the study of these interrelationships in cases of cerebral vascular pathology. Purpose: The use of synchrosqueezed wavelet transforms to measure the relationship between the rhythms of the brain and heart in cases of vascular pathology of varying severity before and during hyperventilation load. Results: The analysis of instantaneous frequencies has been carried out in the low-frequency components of an electroencephalogram and the RR interval time series extracted from the electrocardiogram of patients with vascular pathology of varying severity before and during hyperventilation. The research shows that the time when a correlation between instantaneous frequencies of the infra-slow oscillations of an electroencephalogram and the RR interval time series occurs is related to the degree of severity of cerebral vascular pathology. It has been found that the greater the severity of the vascular pathology of the brain, the faster a correlation occurs between instantaneous frequencies in the low-frequency components of an electroencephalogram and heart rate variability. Practical relevance: The discovered peculiarities of the frequency interrelationships between the rhythms of the brain and heart during hyperventilation may be useful for the search of neurophysiological correlates of the degree of severity of cerebral vascular pathology.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49191588","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：