Esmira Mustafayeva
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Esmira Mustafayeva has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Vagif Gasimov
Baku Engineering University
3 shared publications - Jabir Mammadov
Baku Engineering University, Khirdalan, Azerbaijan
2 shared publications - Artughrul Gayibov
Baku Engineering University
1 shared publication - Dilara Guluzada
Baku Engineering University
1 shared publication - Kamala Alieva
Department of Cybersecurity and Computer Engineering, Faculty of Information and Computer Technologies, Baku Engineering University, Hasan Aliyev str., 120, Khirdalan AZ0101, Azerbaijan
1 shared publication - Kamala Aliyeva
Baku Engineering University
1 shared publication
Latest Publications
- Open Access
- 27 August 2026
- Published by MDPI AG in Information
- Vol. 17 (9) , 830
Linear-Time Correlation-Controlled Shuffling on Random Regular Graphs with Spectral Guarantees
This article proposes a linear-time correlation-controlled shuffling method that attenuates Pearson correlation by permuting one variable through local swaps on a random regular graph. Each round processes a fixed edge order and accepts only vertex-disjoint swaps, producing greedy matching rather than a standard interchange-process update. The analysis uses the induced first-moment operator. A uniform lower bound on edge acceptance yields a Laplacian-domination relation, while a lower bound on the probability that vertices remain unmatched controls the negative spectrum. Conditional on the loop-deleted realized graph being connected and having a spectral gap bounded away from zero, the absolute value of the expected correlation contracts exponentially. For every fixed same-sign attenuation target, an activation probability exists that attains the target in expectation. Finite-sample calibration uses a fixed-budget multi-resolution direct search without assuming monotonicity. Because the procedure applies only permutations, the marginal distribution is preserved exactly. Under fixed degree and fixed calibration budgets, both calibration and shuffling scale linearly with sample size. Experiments show small target errors, exact marginal preservation, and approximately linear runtime scaling. A matched-degree spectral ablation further shows that, with degree and edge count held fixed, the higher-gap random regular graph exhibits substantially faster decay of the mean correlation than the low-gap regular circulant graph.
- 27 August 2026
- Published by MDPI AG in Information
- Vol. 17 (9) , 830
Open AccessLinear-Time Correlation-Controlled Shuffling on Random Regular Graphs with Spectral Guarantees
This article proposes a linear-time correlation-controlled shuffling method that attenuates Pearson correlation by permuting one variable through local swaps on a random regular graph. Each round processes a fixed edge order and accepts only vertex-disjoint swaps, producing greedy matching rather than a standard interchange-process update. The analysis uses the induced first-moment operator. A uniform lower bound on edge acceptance yields a Laplacian-domination relation, while a lower bound on the probability that vertices remain unmatched controls the negative spectrum. Conditional on the loop-deleted realized graph being connected and having a spectral gap bounded away from zero, the absolute value of the expected correlation contracts exponentially. For every fixed same-sign attenuation target, an activation probability exists that attains the target in expectation. Finite-sample calibration uses a fixed-budget multi-resolution direct search without assuming monotonicity. Because the procedure applies only permutations, the marginal distribution is preserved exactly. Under fixed degree and fixed calibration budgets, both calibration and shuffling scale linearly with sample size. Experiments show small target errors, exact marginal preservation, and approximately linear runtime scaling. A matched-degree spectral ablation further shows that, with degree and edge count held fixed, the higher-gap random regular graph exhibits substantially faster decay of the mean correlation than the low-gap regular circulant graph.
- Open Access
- 30 April 2026
- Published by Private Company Technology Center in Eastern-European Journal of Enterprise Technologies
- Vol. 2 (2 (140)) , 52-64
Evaluation of a machine learning-assisted interactive evolutionary non-dominated sorting genetic algorithm -II framework for hyperparameter optimization of U-Net in agricultural land segmentation
The object of the study is the hyperparameter configuration space of the U-Net architecture for agricultural land segmentation from Sentinel-2 satellite imagery. The problem being solved is the excessive cost of multi-objective hyperparameter optimization, because non-dominated sorting in the non-dominated sorting genetic algorithm II (NSGA-II), with complexity O(MN2), becomes a bottleneck for deep segmentation models. To address this problem, an interactive evolutionary non-dominated sorting genetic algorithm II (IENSGA-II) framework is evaluated, in which a logistic regression classifier is trained on hyperparameter vectors and Pareto ranks from initial NSGA-II generations, then used to predict ranks in subsequent generations instead of full sorting. Unlike existing surrogate-assisted approaches, this work predicts Pareto ranks without additional model evaluations. On the panoptic agricultural satellite time series (PASTIS) benchmark, the framework reduced execution time by 20.07%, 16.39%, and 38.80% for 5, 10, and 15 generations, and in the 10-generation setting improved validation criteria, reaching an area under the receiver operating characteristic curve (AUC) of 0.9072 versus 0.9004 and validation loss of 0.6057 versus 0.6212. These results were achieved because the method accelerates selection rather than replacing model evaluation, while AUC-based tie-breaking preserves preference for more accurate solutions among candidates with same predicted rank. Effectiveness stems from a regular relationship between hyperparameters and Pareto ranks in early evolutionary data. In practice, the method is used in resource-constrained multi-objective learning when initial generations provide representative data for rank prediction
- 30 April 2026
- Published by Private Company Technology Center in Eastern-European Journal of Enterprise Technologies
- Vol. 2 (2 (140)) , 52-64
Open AccessEvaluation of a machine learning-assisted interactive evolutionary non-dominated sorting genetic algorithm -II framework for hyperparameter optimization of U-Net in agricultural land segmentation
The object of the study is the hyperparameter configuration space of the U-Net architecture for agricultural land segmentation from Sentinel-2 satellite imagery. The problem being solved is the excessive cost of multi-objective hyperparameter optimization, because non-dominated sorting in the non-dominated sorting genetic algorithm II (NSGA-II), with complexity O(MN2), becomes a bottleneck for deep segmentation models. To address this problem, an interactive evolutionary non-dominated sorting genetic algorithm II (IENSGA-II) framework is evaluated, in which a logistic regression classifier is trained on hyperparameter vectors and Pareto ranks from initial NSGA-II generations, then used to predict ranks in subsequent generations instead of full sorting. Unlike existing surrogate-assisted approaches, this work predicts Pareto ranks without additional model evaluations. On the panoptic agricultural satellite time series (PASTIS) benchmark, the framework reduced execution time by 20.07%, 16.39%, and 38.80% for 5, 10, and 15 generations, and in the 10-generation setting improved validation criteria, reaching an area under the receiver operating characteristic curve (AUC) of 0.9072 versus 0.9004 and validation loss of 0.6057 versus 0.6212. These results were achieved because the method accelerates selection rather than replacing model evaluation, while AUC-based tie-breaking preserves preference for more accurate solutions among candidates with same predicted rank. Effectiveness stems from a regular relationship between hyperparameters and Pareto ranks in early evolutionary data. In practice, the method is used in resource-constrained multi-objective learning when initial generations provide representative data for rank prediction
- Open Access
- 17 February 2022
- Published by State University "Kyiv Aviation Institute" in Problems of Informatization and Management
- Vol. 1 (69) , 18-23
Intersymbol interval method for hiding secret information based on pseudo-random number sequences
In the article, an efficient method of hiding secret information in text-type containers based on changing inter-symbol intervals is suggested. Here, the hiding process is performed by selecting the symbols of the container in a pseudo-random sequence to increase reliability. To obtain a pseudo-random sequence the linear congruent method and Feigenbaum's quadratic function were used.
- 17 February 2022
- Published by State University "Kyiv Aviation Institute" in Problems of Informatization and Management
- Vol. 1 (69) , 18-23
Open AccessIntersymbol interval method for hiding secret information based on pseudo-random number sequences
In the article, an efficient method of hiding secret information in text-type containers based on changing inter-symbol intervals is suggested. Here, the hiding process is performed by selecting the symbols of the container in a pseudo-random sequence to increase reliability. To obtain a pseudo-random sequence the linear congruent method and Feigenbaum's quadratic function were used.
- Open Access
- 31 December 2020
- Published by International Journal of 3D Printing Technologies and Digital Industry in International Journal of 3D Printing Technologies and Digital Industry
- Vol. 4 (3) , 264-269
ПРИНЦИПЫ ВЫБОРА КОНТЕЙНЕРОВ ДЛЯ СТЕГАНОГРАФИЧЕСКИХ СИСТЕМ
In this study, the general principles of choosing containers to create perfect steganographic systems, as well as the characteristics, types, volume, size, format, stability of containers against attacks are considered. The process of entering information into a container is described, and the stability of steganograms with respect to passive and active attacks is analyzed. The distinguishing aspects of the formats of modern graphic containers, the advantage and disadvantages of the Internet protocols TCP, IP, VoIP and SCTP which are used as containers are discussed. To determine the effect of containers on steganographic stability, a theoretical information model of steganographic system with a passive intruder has been suggested. The dependence of the stability of steganographic systems on the technology of introducing hidden messages into a container is explained and the probability distributions of containers and steganograms are analyzed. It was shown that the stability of steganographic systems depends on the probability distributions of containers and steganograms, and only in the case they are identically distributed, the steganographic system is completely stable.
- 31 December 2020
- Published by International Journal of 3D Printing Technologies and Digital Industry in International Journal of 3D Printing Technologies and Digital Industry
- Vol. 4 (3) , 264-269
Open AccessПРИНЦИПЫ ВЫБОРА КОНТЕЙНЕРОВ ДЛЯ СТЕГАНОГРАФИЧЕСКИХ СИСТЕМ
In this study, the general principles of choosing containers to create perfect steganographic systems, as well as the characteristics, types, volume, size, format, stability of containers against attacks are considered. The process of entering information into a container is described, and the stability of steganograms with respect to passive and active attacks is analyzed. The distinguishing aspects of the formats of modern graphic containers, the advantage and disadvantages of the Internet protocols TCP, IP, VoIP and SCTP which are used as containers are discussed. To determine the effect of containers on steganographic stability, a theoretical information model of steganographic system with a passive intruder has been suggested. The dependence of the stability of steganographic systems on the technology of introducing hidden messages into a container is explained and the probability distributions of containers and steganograms are analyzed. It was shown that the stability of steganographic systems depends on the probability distributions of containers and steganograms, and only in the case they are identically distributed, the steganographic system is completely stable.