2021 XV International Scientific-Technical Conference on Actual Problems Of Electronic Instrument Engineering (APEIE), Nov 19, 2021
The modern development of rocket and space technology sets stringent requirements for hardware de... more The modern development of rocket and space technology sets stringent requirements for hardware developers - improving the overall spatial and weight characteristics, increasing the hardware functionality and increasing the period of active existence. The range of electronic devices used in spacecraft on-board equipment must have the following set of specific conditions: (1) a large set of tasks performed by rocket and space technology leads to the necessity of using a wide variety of electronic devices standard types with an extremely small quantitative requirement; (2) the wide electronic devices functional range requires the use of various technologies in production, many of which are unique and absent in the Russian Federation; (3) stringent requirements for the active existence period in the absence of repair opportunities lead to super-stringent requirements for reliability and resistance to outer space destabilizing factors. Due to the fact that the Russian Federation does not produce specialized electronic devices for rocket and space technology, the problems of completing on-board equipment are solved by using foreign-made electronic devices and domestically made electronic devices processed by specialized test technical centers with the total incoming control, additional screening tests, diagnostic non-destructive testing and selective destructive physical analysis. To reduce the computation time for the selection of potentially unreliable electronic products for space application, we propose parallel algorithms with a greedy agglomerative heuristic procedure for solving problems of automatic grouping with large amounts of data, adapted to the CUDA architecture.
Authors investigate the continuous multi-facility location problems with special metrics includin... more Authors investigate the continuous multi-facility location problems with special metrics including the lift metric and French Metro metric An approach to solving them by using their decomposition into series of simpler problems with the rectilinear (Manhattan, l1) metric is proposed. Well-known procedure, proposed by V. Trubin, is used for solving the problems with the rectilinear metric. Authors propose new location problem statement for systems which use lifting cranes, loading machines (forklifts) and special manipulators as transportation vehicles. An example problem is solved.
ABSTRACT The multi-facility Weber location problem is transformed into a pseudo-Boolean optimizat... more ABSTRACT The multi-facility Weber location problem is transformed into a pseudo-Boolean optimization problem and solved with use of a heuristic random search anytime-algorithm. Fermat-Weber problem in its simplest form (unconstrained, single facility, Euclidean metric) is well investigated. A lot of algorithms are developed for more complex cases. However, the generalized multi-facility problem with barriers, restricted zones and arbitrary metric has no well-known algorithm for its solving. In this report, we consider the planar multi-facility Weber problem with restricted zones and non-Euclidean distances, propose an algorithm based on the probability changing method and prove its efficiency for approximate solving this problem by replacing the continuous coordinate values by discrete ones. Version of the algorithm for multiprocessor systems is proposed. An example of a problem solution is given.
Authors provide a comparative analysis of the results of applying various automatic grouping (clu... more Authors provide a comparative analysis of the results of applying various automatic grouping (clustering) algorithms to a problem of separating homogeneous batches of electrical radio products from a mixed batch. Authors consider opportunities of optimizing the algorithm parameters as well as compilation of ensembles of clustering algorithms. The obtained results demonstrate that the homogeneity analysis of batches of the electronic components installed in real space systems is an actual problem, especially in the case of A high level of integration. Authors substantiate the necessity of centralized acquisition of spacecraft equipment on the principle of equal reliability by creating special production batches manufactured for space industry.
We propose an algorithm for clustering short text fragments such as lists of ingredients in food ... more We propose an algorithm for clustering short text fragments such as lists of ingredients in food products using the k-means algorithm in combination with the molecular chemical reactions algorithm. The solution obtained with k-means is used as an initial molecular structure solution to optimize chemical reactions in combination with k-means by generating new solutions using the four main types of chemical reactions. The computational experiment showed the comparative efficiency of new algorithm, taking into account numerical metrics: accuracy, precision, recall, and F-measure.
International journal of artificial intelligence, Sep 30, 2021
The continuous p-median problem is a classical unconstrained global optimization model of unsuper... more The continuous p-median problem is a classical unconstrained global optimization model of unsupervised machine learning and location theory where the aim is to find p points (medians) so that the sum of distances from known demand points to the closest of the p sought points reaches its minimum. The problem is NP-hard, and the researchers focus on the development of heuristic algorithms. A greedy agglomerative procedure starts its search from a solution with an excessive number of medians K > p and combines the elimination of the medians with local search procedures. Genetic algorithms with the crossover operator based on greedy agglomerative procedures are capable of obtaining rather precise results. However, they are computationally expensive, which limits their scope for mediumscale problems. In the case of running such algorithms on massive parallel processing systems with large-scale problems, the population degeneration plays more important role. We propose hybrid genetic algorithms with both crossover and mutation operators involving the greedy agglomerative procedures and partially isolated subpopulations (islands) for the p-median problem. Computational experiments show the comparative efficiency of new algorithmic combinations and demonstrate that with an increase in the input data volume, the instruments for maintaining the population diversity improve the obtained results.
Системы управления и информационные технологии, Sep 30, 2021
В статье обсуждается применение методов фрактального анализа для решения задачи автоматической фи... more В статье обсуждается применение методов фрактального анализа для решения задачи автоматической фильтрации сигнала ЭЭГ от артефактов различной природы. Изучается возможность использования показателя Херста в качестве информативного признака для алгоритмов интеллектуальной обработки данных. The article discusses the possibility of using fractal analysis to solve the problem of automatic filtering of the EEG signal from artifacts of various nature. The possibility of using the Hurst exponent as an informative feature for intelligent data processing algorithms is investigated
Системы управления и информационные технологии, Mar 1, 2021
В статье приводятся аспекты автоматического анализа долгосрочных временных корреляций данных элек... more В статье приводятся аспекты автоматического анализа долгосрочных временных корреляций данных электроэнцефалографии на основе оценки показателя Херста. Эксперименты позволили установить значения показателя, характерные для патологических состояний. The article presents the aspects of the automatic analysis of the long-range temporal correlation of the EEG data over Hurst exponent estimations. Its values characteristic for the neurological diseases were estimated by experiment.
2021 XV International Scientific-Technical Conference on Actual Problems Of Electronic Instrument Engineering (APEIE), Nov 19, 2021
The modern development of rocket and space technology sets stringent requirements for hardware de... more The modern development of rocket and space technology sets stringent requirements for hardware developers - improving the overall spatial and weight characteristics, increasing the hardware functionality and increasing the period of active existence. The range of electronic devices used in spacecraft on-board equipment must have the following set of specific conditions: (1) a large set of tasks performed by rocket and space technology leads to the necessity of using a wide variety of electronic devices standard types with an extremely small quantitative requirement; (2) the wide electronic devices functional range requires the use of various technologies in production, many of which are unique and absent in the Russian Federation; (3) stringent requirements for the active existence period in the absence of repair opportunities lead to super-stringent requirements for reliability and resistance to outer space destabilizing factors. Due to the fact that the Russian Federation does not produce specialized electronic devices for rocket and space technology, the problems of completing on-board equipment are solved by using foreign-made electronic devices and domestically made electronic devices processed by specialized test technical centers with the total incoming control, additional screening tests, diagnostic non-destructive testing and selective destructive physical analysis. To reduce the computation time for the selection of potentially unreliable electronic products for space application, we propose parallel algorithms with a greedy agglomerative heuristic procedure for solving problems of automatic grouping with large amounts of data, adapted to the CUDA architecture.
Authors investigate the continuous multi-facility location problems with special metrics includin... more Authors investigate the continuous multi-facility location problems with special metrics including the lift metric and French Metro metric An approach to solving them by using their decomposition into series of simpler problems with the rectilinear (Manhattan, l1) metric is proposed. Well-known procedure, proposed by V. Trubin, is used for solving the problems with the rectilinear metric. Authors propose new location problem statement for systems which use lifting cranes, loading machines (forklifts) and special manipulators as transportation vehicles. An example problem is solved.
ABSTRACT The multi-facility Weber location problem is transformed into a pseudo-Boolean optimizat... more ABSTRACT The multi-facility Weber location problem is transformed into a pseudo-Boolean optimization problem and solved with use of a heuristic random search anytime-algorithm. Fermat-Weber problem in its simplest form (unconstrained, single facility, Euclidean metric) is well investigated. A lot of algorithms are developed for more complex cases. However, the generalized multi-facility problem with barriers, restricted zones and arbitrary metric has no well-known algorithm for its solving. In this report, we consider the planar multi-facility Weber problem with restricted zones and non-Euclidean distances, propose an algorithm based on the probability changing method and prove its efficiency for approximate solving this problem by replacing the continuous coordinate values by discrete ones. Version of the algorithm for multiprocessor systems is proposed. An example of a problem solution is given.
Authors provide a comparative analysis of the results of applying various automatic grouping (clu... more Authors provide a comparative analysis of the results of applying various automatic grouping (clustering) algorithms to a problem of separating homogeneous batches of electrical radio products from a mixed batch. Authors consider opportunities of optimizing the algorithm parameters as well as compilation of ensembles of clustering algorithms. The obtained results demonstrate that the homogeneity analysis of batches of the electronic components installed in real space systems is an actual problem, especially in the case of A high level of integration. Authors substantiate the necessity of centralized acquisition of spacecraft equipment on the principle of equal reliability by creating special production batches manufactured for space industry.
We propose an algorithm for clustering short text fragments such as lists of ingredients in food ... more We propose an algorithm for clustering short text fragments such as lists of ingredients in food products using the k-means algorithm in combination with the molecular chemical reactions algorithm. The solution obtained with k-means is used as an initial molecular structure solution to optimize chemical reactions in combination with k-means by generating new solutions using the four main types of chemical reactions. The computational experiment showed the comparative efficiency of new algorithm, taking into account numerical metrics: accuracy, precision, recall, and F-measure.
International journal of artificial intelligence, Sep 30, 2021
The continuous p-median problem is a classical unconstrained global optimization model of unsuper... more The continuous p-median problem is a classical unconstrained global optimization model of unsupervised machine learning and location theory where the aim is to find p points (medians) so that the sum of distances from known demand points to the closest of the p sought points reaches its minimum. The problem is NP-hard, and the researchers focus on the development of heuristic algorithms. A greedy agglomerative procedure starts its search from a solution with an excessive number of medians K > p and combines the elimination of the medians with local search procedures. Genetic algorithms with the crossover operator based on greedy agglomerative procedures are capable of obtaining rather precise results. However, they are computationally expensive, which limits their scope for mediumscale problems. In the case of running such algorithms on massive parallel processing systems with large-scale problems, the population degeneration plays more important role. We propose hybrid genetic algorithms with both crossover and mutation operators involving the greedy agglomerative procedures and partially isolated subpopulations (islands) for the p-median problem. Computational experiments show the comparative efficiency of new algorithmic combinations and demonstrate that with an increase in the input data volume, the instruments for maintaining the population diversity improve the obtained results.
Системы управления и информационные технологии, Sep 30, 2021
В статье обсуждается применение методов фрактального анализа для решения задачи автоматической фи... more В статье обсуждается применение методов фрактального анализа для решения задачи автоматической фильтрации сигнала ЭЭГ от артефактов различной природы. Изучается возможность использования показателя Херста в качестве информативного признака для алгоритмов интеллектуальной обработки данных. The article discusses the possibility of using fractal analysis to solve the problem of automatic filtering of the EEG signal from artifacts of various nature. The possibility of using the Hurst exponent as an informative feature for intelligent data processing algorithms is investigated
Системы управления и информационные технологии, Mar 1, 2021
В статье приводятся аспекты автоматического анализа долгосрочных временных корреляций данных элек... more В статье приводятся аспекты автоматического анализа долгосрочных временных корреляций данных электроэнцефалографии на основе оценки показателя Херста. Эксперименты позволили установить значения показателя, характерные для патологических состояний. The article presents the aspects of the automatic analysis of the long-range temporal correlation of the EEG data over Hurst exponent estimations. Its values characteristic for the neurological diseases were estimated by experiment.
Uploads
Papers by Lev Kazakovtsev