Pub Date : 2019-10-01DOI: 10.1109/PICST47496.2019.9061468
A. Chemeris, Sergii Sushko
The paper considers actual methods of the software optimizations. Main attention is directed to the tiling method and parallelization. Showing the opportunities of the tiling method authors accent that tile size of the tiling method has critical influence of the optimization level. Main part of the paper dedicated to the searching of the optimal tile sizes for the better execution time of the test program. As a conclusion authors demonstrate results of the reducing execution time by applying of the particle swarm optimization method for the searching of the optimal tile sizes. The obtained results reveal that particle swarm optimization method can be used for the optimal tile size search. In the same time, parameters of the particle swarm optimization method should be picked up carefully for the faster method search.
{"title":"Usage of Discrete Particle Swarm Optimization Method for the Searching of Optimal Tile Size","authors":"A. Chemeris, Sergii Sushko","doi":"10.1109/PICST47496.2019.9061468","DOIUrl":"https://doi.org/10.1109/PICST47496.2019.9061468","url":null,"abstract":"The paper considers actual methods of the software optimizations. Main attention is directed to the tiling method and parallelization. Showing the opportunities of the tiling method authors accent that tile size of the tiling method has critical influence of the optimization level. Main part of the paper dedicated to the searching of the optimal tile sizes for the better execution time of the test program. As a conclusion authors demonstrate results of the reducing execution time by applying of the particle swarm optimization method for the searching of the optimal tile sizes. The obtained results reveal that particle swarm optimization method can be used for the optimal tile size search. In the same time, parameters of the particle swarm optimization method should be picked up carefully for the faster method search.","PeriodicalId":6764,"journal":{"name":"2019 IEEE International Scientific-Practical Conference Problems of Infocommunications, Science and Technology (PIC S&T)","volume":"258 1","pages":"202-206"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81056411","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 : 2019-10-01DOI: 10.1109/PICST47496.2019.9061563
L. Melnikova, E. Linnyk, D. Ageyev, O. Melnikova, Nikolay Kryvoshapka, Valeriy Barsouk
The introduction of mobile drain is one of the promising methods of energy balancing in wireless sensor networks. The model is based on the travelling salesman problem. The criteria of optimization and its metric are defined by the functionality of the network. To assess the efficiency and effectiveness of the method for solving the problem, an experimental study was conducted using the Matlab simulation software package. The traveling salesman problem was solved for uniform and normal distribution of distances between network routers for 10 and 30 routers. The values of the sample average length of the optimal mobile drain route and the length of the route without optimization on a sample of 500 experiments were obtained. It is shown that the use of optimization when choosing a mobile drain route in the wireless sensor network allows on average to reduce the length of the bypass path of mobile drain by 30%-40% compared with random bypass depending on the law of distribution of distances between nodes. Recommendations for conducting a full-scale experiment based on one of the many available wireless modules of well-known manufacturers are proposed.
{"title":"Minimizing the Route of Sink Node in Wireless Sensor Network","authors":"L. Melnikova, E. Linnyk, D. Ageyev, O. Melnikova, Nikolay Kryvoshapka, Valeriy Barsouk","doi":"10.1109/PICST47496.2019.9061563","DOIUrl":"https://doi.org/10.1109/PICST47496.2019.9061563","url":null,"abstract":"The introduction of mobile drain is one of the promising methods of energy balancing in wireless sensor networks. The model is based on the travelling salesman problem. The criteria of optimization and its metric are defined by the functionality of the network. To assess the efficiency and effectiveness of the method for solving the problem, an experimental study was conducted using the Matlab simulation software package. The traveling salesman problem was solved for uniform and normal distribution of distances between network routers for 10 and 30 routers. The values of the sample average length of the optimal mobile drain route and the length of the route without optimization on a sample of 500 experiments were obtained. It is shown that the use of optimization when choosing a mobile drain route in the wireless sensor network allows on average to reduce the length of the bypass path of mobile drain by 30%-40% compared with random bypass depending on the law of distribution of distances between nodes. Recommendations for conducting a full-scale experiment based on one of the many available wireless modules of well-known manufacturers are proposed.","PeriodicalId":6764,"journal":{"name":"2019 IEEE International Scientific-Practical Conference Problems of Infocommunications, Science and Technology (PIC S&T)","volume":"10 1","pages":"861-864"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84566653","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 : 2019-10-01DOI: 10.1109/PICST47496.2019.9061330
A. Semenov, O. Osadchuk, O. Semenova, K. Koval, S. Baraban, A. Savytskyi
The aim of the work is developing and investigating an electric circuit of a deterministic chaos ring oscillator having a delay element in a feedback loop and based on a MOS transistor structure with negative differential resistance. New circuits of active elements based on MOS transistor structures with electrically controlled parameters of static λ-type I-V curves for deterministic chaos ring oscillators have been proposed. Experimental facilities have been developed and results have been obtained after investigating static and dynamic I-V curves for the MOS transistor structures with negative resistance. Results of simulating the deterministic chaos ring oscillator based on the MOS transistor structure with negative differential resistance in PSPICE software have been obtained.
{"title":"A Deterministic Chaos Ring Oscillator Based on a MOS Transistor Structure with Negative Differential Resistance","authors":"A. Semenov, O. Osadchuk, O. Semenova, K. Koval, S. Baraban, A. Savytskyi","doi":"10.1109/PICST47496.2019.9061330","DOIUrl":"https://doi.org/10.1109/PICST47496.2019.9061330","url":null,"abstract":"The aim of the work is developing and investigating an electric circuit of a deterministic chaos ring oscillator having a delay element in a feedback loop and based on a MOS transistor structure with negative differential resistance. New circuits of active elements based on MOS transistor structures with electrically controlled parameters of static λ-type I-V curves for deterministic chaos ring oscillators have been proposed. Experimental facilities have been developed and results have been obtained after investigating static and dynamic I-V curves for the MOS transistor structures with negative resistance. Results of simulating the deterministic chaos ring oscillator based on the MOS transistor structure with negative differential resistance in PSPICE software have been obtained.","PeriodicalId":6764,"journal":{"name":"2019 IEEE International Scientific-Practical Conference Problems of Infocommunications, Science and Technology (PIC S&T)","volume":"14 1","pages":"709-714"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87280190","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 : 2019-10-01DOI: 10.1109/PICST47496.2019.9061268
Gorodianska Larisa, Nosenko Tetiana, V. Viktoriia
There is a steady tendency in the world to increase the level of use of the latest information technologies in the financial sphere, in particular new forms of banks -digital and neobank are gaining popularity. Such a business is promising, attractive to young people, people from remote places, so it is actively developing and is already a subject of interest of cybercriminals. Modern banks use open application programming interfaces to ensure the reception and transmission of information between information systems of different organizations through standard data transmission protocols. The use of open application interfaces affects the information security of banks, namely the security of information assets. Attackers who attack neobank information systems want to gain control of the information assets in order to further engage in illegal transactions or compromise the bank at the request of unfair competitors. Therefore, information banking systems must be protected against threats to internal and external interference and implement a comprehensive security strategy. This strategy should provide security and include technical solutions and procedures that will protect the security of all components of neobank information systems -electronic payment systems, electronic workflow, payment card services, banking software systems, remote systems, networking and more. The banking system security strategy must ensure high-performance processing of large volumes of information without loss of speed, tool collection, incident data analysis and response to security events, as well as reliability and fault tolerance.
{"title":"Neobanks Operations and Security Features","authors":"Gorodianska Larisa, Nosenko Tetiana, V. Viktoriia","doi":"10.1109/PICST47496.2019.9061268","DOIUrl":"https://doi.org/10.1109/PICST47496.2019.9061268","url":null,"abstract":"There is a steady tendency in the world to increase the level of use of the latest information technologies in the financial sphere, in particular new forms of banks -digital and neobank are gaining popularity. Such a business is promising, attractive to young people, people from remote places, so it is actively developing and is already a subject of interest of cybercriminals. Modern banks use open application programming interfaces to ensure the reception and transmission of information between information systems of different organizations through standard data transmission protocols. The use of open application interfaces affects the information security of banks, namely the security of information assets. Attackers who attack neobank information systems want to gain control of the information assets in order to further engage in illegal transactions or compromise the bank at the request of unfair competitors. Therefore, information banking systems must be protected against threats to internal and external interference and implement a comprehensive security strategy. This strategy should provide security and include technical solutions and procedures that will protect the security of all components of neobank information systems -electronic payment systems, electronic workflow, payment card services, banking software systems, remote systems, networking and more. The banking system security strategy must ensure high-performance processing of large volumes of information without loss of speed, tool collection, incident data analysis and response to security events, as well as reliability and fault tolerance.","PeriodicalId":6764,"journal":{"name":"2019 IEEE International Scientific-Practical Conference Problems of Infocommunications, Science and Technology (PIC S&T)","volume":"28 1","pages":"839-842"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91314906","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 : 2019-10-01DOI: 10.1109/PICST47496.2019.9061550
Yu. V. Lakh, Rostyslav Shymkiv
the main task of the work was to analyze the possible options for using honeypot lures to protect effectively the network perimeter of a banking system. The analyses have been performed using a low-interactive program honeypot, which purpose is to protect open Secure Shell ports on servers of the banking network infrastructure. As an experimental result of the honeypot’s successful using there were received data on the attacker’s actions. Their detailed carried out analysis as well as application results have been presented in the graphs and visualizations with additional programs. In particular, the most frequently used types of logins as well as passwords values during active phase of attacks had been analyzed and due to the obtained results were proposed methods and tools allowing avoid such types of attacks. Recommendations for developing network secure perimeter of a banking system according to the modern information security requirements had been proposed.
{"title":"Using Honeypot Programs for Providing Defense of Banking Network Infrastructure","authors":"Yu. V. Lakh, Rostyslav Shymkiv","doi":"10.1109/PICST47496.2019.9061550","DOIUrl":"https://doi.org/10.1109/PICST47496.2019.9061550","url":null,"abstract":"the main task of the work was to analyze the possible options for using honeypot lures to protect effectively the network perimeter of a banking system. The analyses have been performed using a low-interactive program honeypot, which purpose is to protect open Secure Shell ports on servers of the banking network infrastructure. As an experimental result of the honeypot’s successful using there were received data on the attacker’s actions. Their detailed carried out analysis as well as application results have been presented in the graphs and visualizations with additional programs. In particular, the most frequently used types of logins as well as passwords values during active phase of attacks had been analyzed and due to the obtained results were proposed methods and tools allowing avoid such types of attacks. Recommendations for developing network secure perimeter of a banking system according to the modern information security requirements had been proposed.","PeriodicalId":6764,"journal":{"name":"2019 IEEE International Scientific-Practical Conference Problems of Infocommunications, Science and Technology (PIC S&T)","volume":"22 1","pages":"527-532"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90282189","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 : 2019-10-01DOI: 10.1109/PICST47496.2019.9061538
V. Tarasov, E. Akhmetshina, Kada Othmane
The article considers two laws of distribution: hyperexponential and hypererlangian as input distributions for queuing systems. These two laws of distribution belong to a general form with a wide range of variation of the coefficients of variation. The main unique feature of these laws of distributions consists that they can unambiguously be defined by both two first initial moments, and three moments. An approach to the approximation of arbitrary distribution laws by these laws is proposed both at the level of two initial moments and at the level of three moments. The considered laws of distributions, starting from some values of the coefficients of variation, have a heavy tail, and, consequently, in queuing systems they will give a greater delay than other laws of distributions. Practical calculations show that approximation using two moments gives somewhat underestimated results in terms of average waiting time. The use of these laws of distributions in the queueing theory extends and complements the well-known incomplete formula for the average waiting time for systems of mass service with arbitrary laws of the distribution of intervals of input requirements and service time. The results obtained are important for modern teletraffic theory.
{"title":"Properties of Hyperexponential and Hypererlangian Distributions","authors":"V. Tarasov, E. Akhmetshina, Kada Othmane","doi":"10.1109/PICST47496.2019.9061538","DOIUrl":"https://doi.org/10.1109/PICST47496.2019.9061538","url":null,"abstract":"The article considers two laws of distribution: hyperexponential and hypererlangian as input distributions for queuing systems. These two laws of distribution belong to a general form with a wide range of variation of the coefficients of variation. The main unique feature of these laws of distributions consists that they can unambiguously be defined by both two first initial moments, and three moments. An approach to the approximation of arbitrary distribution laws by these laws is proposed both at the level of two initial moments and at the level of three moments. The considered laws of distributions, starting from some values of the coefficients of variation, have a heavy tail, and, consequently, in queuing systems they will give a greater delay than other laws of distributions. Practical calculations show that approximation using two moments gives somewhat underestimated results in terms of average waiting time. The use of these laws of distributions in the queueing theory extends and complements the well-known incomplete formula for the average waiting time for systems of mass service with arbitrary laws of the distribution of intervals of input requirements and service time. The results obtained are important for modern teletraffic theory.","PeriodicalId":6764,"journal":{"name":"2019 IEEE International Scientific-Practical Conference Problems of Infocommunications, Science and Technology (PIC S&T)","volume":"13 1","pages":"895-898"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89731806","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 : 2019-10-01DOI: 10.1109/PICST47496.2019.9061349
V. Pyliavskyi, O. Osharovska, M. Patlayenko, V. Solodka
This paper presents the results of color perception modeling, taking into account the spectral distribution of light sources and the spectral properties of light-signal converters. The results show that a bandpass filter, whose effect on the original colors of the scene elements leads to a shift in the chromaticity coordinates, can model the spectral characteristics of the light-signal transducers. The spectral properties of the light sources at the transmitting and receiving side can be simulated by convolution with the output spectra of the photosensitive arrays, and the combined effect can lead to a shift in color coordinates that exceed the color difference thresholds. The calculations of the maximum shifts for sources of daylight illumination, incandescent lamps and fluorescent sources are given. It is proposed to include in the path from light to light-special signals that correct color shifts.
{"title":"Compensation for Color Distortions in End-to-End Video Transmission Paths with Regards to the Spectral Composition of Light Sources","authors":"V. Pyliavskyi, O. Osharovska, M. Patlayenko, V. Solodka","doi":"10.1109/PICST47496.2019.9061349","DOIUrl":"https://doi.org/10.1109/PICST47496.2019.9061349","url":null,"abstract":"This paper presents the results of color perception modeling, taking into account the spectral distribution of light sources and the spectral properties of light-signal converters. The results show that a bandpass filter, whose effect on the original colors of the scene elements leads to a shift in the chromaticity coordinates, can model the spectral characteristics of the light-signal transducers. The spectral properties of the light sources at the transmitting and receiving side can be simulated by convolution with the output spectra of the photosensitive arrays, and the combined effect can lead to a shift in color coordinates that exceed the color difference thresholds. The calculations of the maximum shifts for sources of daylight illumination, incandescent lamps and fluorescent sources are given. It is proposed to include in the path from light to light-special signals that correct color shifts.","PeriodicalId":6764,"journal":{"name":"2019 IEEE International Scientific-Practical Conference Problems of Infocommunications, Science and Technology (PIC S&T)","volume":"77 1","pages":"671-674"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88910392","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 : 2019-10-01DOI: 10.1109/PICST47496.2019.9061375
O. Riznyk, N. Kustra, Yurii Kynash, R. Vynnychuk
The purpose of this work is method of constructing Barker-like sequence on the basis of ideal ring bundle families on the criterion of the minimum value of the function of autocorrelation of the discrete signal. The Barker-like sequence is taken as the main sequence, and then each element of the main sequence is replaced by a direct or inverse additional Barker-like sequence, depending on whether there is zero or one in the main Barker-like sequence. The use of ideal ring bundle families for the synthesis of Barker-like sequences makes it possible to simplify their construction, thanks to the application of the results of constructing different types of ideal ring bundles. It also makes possible to simplify of finding the complete families of these configurations, searching among them the Barker-like sequences with the best characteristics.
{"title":"Method of Constructing Barker-Like Sequence on the Basis of Ideal Ring Bundle Families","authors":"O. Riznyk, N. Kustra, Yurii Kynash, R. Vynnychuk","doi":"10.1109/PICST47496.2019.9061375","DOIUrl":"https://doi.org/10.1109/PICST47496.2019.9061375","url":null,"abstract":"The purpose of this work is method of constructing Barker-like sequence on the basis of ideal ring bundle families on the criterion of the minimum value of the function of autocorrelation of the discrete signal. The Barker-like sequence is taken as the main sequence, and then each element of the main sequence is replaced by a direct or inverse additional Barker-like sequence, depending on whether there is zero or one in the main Barker-like sequence. The use of ideal ring bundle families for the synthesis of Barker-like sequences makes it possible to simplify their construction, thanks to the application of the results of constructing different types of ideal ring bundles. It also makes possible to simplify of finding the complete families of these configurations, searching among them the Barker-like sequences with the best characteristics.","PeriodicalId":6764,"journal":{"name":"2019 IEEE International Scientific-Practical Conference Problems of Infocommunications, Science and Technology (PIC S&T)","volume":"3 1","pages":"207-211"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90246221","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 : 2019-10-01DOI: 10.1109/PICST47496.2019.9061296
O. Romanov, Volodymyr Mankivskyi
In practice, mobile network design uses the method of frequency territorial planning. According to existing methods, solution of the problem provides required performance of electromagnetic compatibility for network elements; as a result, it also provides optimal performance of network. This approach, questions of the uniform distribution of traffic among network elements fade into background. As a result, this approach has an impact on both throughput and quality of service. The paper proposes to improve the efficiency of network, in conjunction with use of method of frequency spatial planning, to apply the method of sectoral analysis for optimal distribution loading between base stations. For this purpose, in addition to statistical data of base stations enrich with data of the billing system. (Abstract).
{"title":"Optimal Traffic Distribution Based on the Sectoral Model of Loading Network Elements","authors":"O. Romanov, Volodymyr Mankivskyi","doi":"10.1109/PICST47496.2019.9061296","DOIUrl":"https://doi.org/10.1109/PICST47496.2019.9061296","url":null,"abstract":"In practice, mobile network design uses the method of frequency territorial planning. According to existing methods, solution of the problem provides required performance of electromagnetic compatibility for network elements; as a result, it also provides optimal performance of network. This approach, questions of the uniform distribution of traffic among network elements fade into background. As a result, this approach has an impact on both throughput and quality of service. The paper proposes to improve the efficiency of network, in conjunction with use of method of frequency spatial planning, to apply the method of sectoral analysis for optimal distribution loading between base stations. For this purpose, in addition to statistical data of base stations enrich with data of the billing system. (Abstract).","PeriodicalId":6764,"journal":{"name":"2019 IEEE International Scientific-Practical Conference Problems of Infocommunications, Science and Technology (PIC S&T)","volume":"32 1","pages":"683-688"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81344890","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 : 2019-10-01DOI: 10.1109/PICST47496.2019.9061396
A. Oliinyk, I. Fedorchenko, T. Zaiko, D. Goncharenko, Alexander Stepanenko, Anastasia Kharchenko
The genetic method of multicriteria optimization with modification of the mutation operator is proposed, which is intended to solve the problem of optimization of pharmacies' financial indicators by means of evolutionary methods in the field of pharmacy business, by optimizing the process of work of the drug procurement department. Three modifications of the mutation operator were developed. A system for solving the problem of optimization of pharmacies' financial indicators as a function of the distribution of commodity groups in the pharmacy's assortment is determined, which determines such a percentage distribution of the group of goods in which the conditions will be fulfilled.
{"title":"Development of Genetic Methods of Network Pharmacy Financial Indicators Optimization","authors":"A. Oliinyk, I. Fedorchenko, T. Zaiko, D. Goncharenko, Alexander Stepanenko, Anastasia Kharchenko","doi":"10.1109/PICST47496.2019.9061396","DOIUrl":"https://doi.org/10.1109/PICST47496.2019.9061396","url":null,"abstract":"The genetic method of multicriteria optimization with modification of the mutation operator is proposed, which is intended to solve the problem of optimization of pharmacies' financial indicators by means of evolutionary methods in the field of pharmacy business, by optimizing the process of work of the drug procurement department. Three modifications of the mutation operator were developed. A system for solving the problem of optimization of pharmacies' financial indicators as a function of the distribution of commodity groups in the pharmacy's assortment is determined, which determines such a percentage distribution of the group of goods in which the conditions will be fulfilled.","PeriodicalId":6764,"journal":{"name":"2019 IEEE International Scientific-Practical Conference Problems of Infocommunications, Science and Technology (PIC S&T)","volume":"13 1","pages":"607-612"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79235654","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
扫码关注我们
求助内容：
应助结果提醒方式：