Ivan Kondratov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ivan Kondratov has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Aleksei Romanovskii
Huawei, Saint-Petersburg Research Institute, Russia
2 shared publications - Alexander Allahverdyan
Faculty of Applied Mathematics and Control Processes, Saint-Petersburg State University, St. Petersburg, Russia
2 shared publications - Anastasia Zhadan
St Petersburg State Univ, 7-9 Univ Skaya Nab, St Petersburg 199034, Russia
2 shared publications - Ovanes Petrosian
Shenzhen MSU-BIT University
2 shared publications - Vikenty Mikheev
Mathematics, Kansas State University, Manhattan, KS, 66502
2 shared publications - Vitaliy Kharin
Huawei, Saint-Petersburg Research Institute, Russia
2 shared publications
Latest Publications
- Open Access
- 4 August 2026
- Published by Saint Petersburg State University in Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes
- Vol. 22 (2) , 335–352
Building an interpretable performance model: A case study of the window-assisted load tracking module in Android
Performance testing of modern software systems is becoming increasingly demanding due to growing architectural complexity. Traditional methods focus on a limited set of critical configurations, which speeds up the process but reduces coverage and leaves potential performance bottlenecks undetected. To expand the coverage of system states, we introduce controlled perturbations into load estimation, which augments the data and improves the model’s ability to generalize to untested configurations. Using ensemble regression on tabular features and post-training model explanation, we accurately predict benchmark throughput and identify key factors influencing frequency selection and observed performance. In the case study of the Android kernel, the model achieves high accuracy, while Shapley Additive Explanations based interpretations align with the expected behavior of the scheduler and Dynamic Voltage and Frequency Scaling, suggesting a practical way to reduce testing effort and support engineering decisions in operating-system optimization.
- 4 August 2026
- Published by Saint Petersburg State University in Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes
- Vol. 22 (2) , 335–352
Open AccessBuilding an interpretable performance model: A case study of the window-assisted load tracking module in Android
Performance testing of modern software systems is becoming increasingly demanding due to growing architectural complexity. Traditional methods focus on a limited set of critical configurations, which speeds up the process but reduces coverage and leaves potential performance bottlenecks undetected. To expand the coverage of system states, we introduce controlled perturbations into load estimation, which augments the data and improves the model’s ability to generalize to untested configurations. Using ensemble regression on tabular features and post-training model explanation, we accurately predict benchmark throughput and identify key factors influencing frequency selection and observed performance. In the case study of the Android kernel, the model achieves high accuracy, while Shapley Additive Explanations based interpretations align with the expected behavior of the scheduler and Dynamic Voltage and Frequency Scaling, suggesting a practical way to reduce testing effort and support engineering decisions in operating-system optimization.
- Open Access
- 25 April 2026
- Published by Elsevier in SSRN Electronic Journal
LIT-002, a highly potent and selective nonpeptide oxytocin receptor agonist that improves social interaction in mouse models of autism
Oxytocin (OT) and its receptor (OT-R) are implicated in the aetiology of autism spectrum disorders (ASDs) and OT-R is a potential target for therapeutic intervention. We report here the design and pharmacological activity of a second-generation OT-R agonist that is more potent and selective than OT itself both in vitro and in vivo, in two animal models of autism after peripheral and oral administration. The preclinical potential of this new lead compound, LIT-002, is also evaluated and discussed.
- 25 April 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessLIT-002, a highly potent and selective nonpeptide oxytocin receptor agonist that improves social interaction in mouse models of autism
Oxytocin (OT) and its receptor (OT-R) are implicated in the aetiology of autism spectrum disorders (ASDs) and OT-R is a potential target for therapeutic intervention. We report here the design and pharmacological activity of a second-generation OT-R agonist that is more potent and selective than OT itself both in vitro and in vivo, in two animal models of autism after peripheral and oral administration. The preclinical potential of this new lead compound, LIT-002, is also evaluated and discussed.
- Open Access
- 3 October 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 14 (5) , 1-26
Multi-agent Reinforcement Learning-based Adaptive Heterogeneous DAG Scheduling
Static scheduling of computational workflow represented by a directed acyclic graph (DAG) is an important problem in many areas of computer science. The main idea and novelty of the proposed algorithm is an adaptive heuristic or graph metric that uses a different heuristic rule at each scheduling step depending on local workflow. It is also important to note that multi-agent reinforcement learning is used to determine scheduling policy based on adaptive metrics. To prove the efficiency of the approach, a comparison with the state-of-the-art DAG scheduling algorithms is provided: DONF, CPOP, HCPT, HPS, and PETS. Based on the simulation results, the proposed algorithm shows an improvement of up to 30% on specific graph topologies and an average performance gain of 5.32%, compared to the best scheduling algorithm, DONF (suitable for large-scale scheduling), on a large number of random DAGs. Another important result is that using the proposed algorithm it was possible to cover 30.01% of the proximity interval from the best scheduling algorithm to the global optimal solution. This indicates that the idea of an adaptive metric for DAG scheduling is important and requires further research and development.
- 3 October 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 14 (5) , 1-26
Open AccessMulti-agent Reinforcement Learning-based Adaptive Heterogeneous DAG Scheduling
Static scheduling of computational workflow represented by a directed acyclic graph (DAG) is an important problem in many areas of computer science. The main idea and novelty of the proposed algorithm is an adaptive heuristic or graph metric that uses a different heuristic rule at each scheduling step depending on local workflow. It is also important to note that multi-agent reinforcement learning is used to determine scheduling policy based on adaptive metrics. To prove the efficiency of the approach, a comparison with the state-of-the-art DAG scheduling algorithms is provided: DONF, CPOP, HCPT, HPS, and PETS. Based on the simulation results, the proposed algorithm shows an improvement of up to 30% on specific graph topologies and an average performance gain of 5.32%, compared to the best scheduling algorithm, DONF (suitable for large-scale scheduling), on a large number of random DAGs. Another important result is that using the proposed algorithm it was possible to cover 30.01% of the proximity interval from the best scheduling algorithm to the global optimal solution. This indicates that the idea of an adaptive metric for DAG scheduling is important and requires further research and development.
- 8 July 2023
- Published by Springer Nature
- p. 335-349
Monte Carlo Tree Search with Adaptive Estimation for DAG Scheduling
- 8 July 2023
- Published by Springer Nature
- p. 335-349
Monte Carlo Tree Search with Adaptive Estimation for DAG Scheduling