Abbas Musleh Salman
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
Abbas Musleh Salman has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Ahmed Alridha
Ministry of Education, General Directorate of Education in Babylon
3 shared publications - Ahmed Hadi Hussain
Department of Mathematics, College of Education for Pure Sciences, University of Babylon, Hilla 51002, Iraq
2 shared publications Ahmed Sabah Al-Jilawi
Mathematics Department, University of Babylon
1 shared publication- Ahmed Sabah Al-Jilawi
Department of Mathematics -University of Babylon
1 shared publication - Qasim Ali Shakir
College of computer science and information technology, University of Al-Qadisiyah, Diwaniyah, Iraq
1 shared publication Sahab Mohsen Abboud
University of Babylon, College of the Basic Education, Department of Mathematics, Babylon, Iraq
1 shared publication
Latest Publications
- Open Access
- 30 June 2025
- Published by Journal of Al-Qadisiyah for Computer Science and Mathematics in Journal of Al-Qadisiyah for Computer Science and Mathematics
- Vol. 17 (2) , 153–158
Enhancing ROSS Network Reliability Through Evolutionary Optimization Techniques
This research aims to develop computational models to improve resource allocation and increase the reliability of a ROSS (Relay-based Opportunistic Spectrum Sharing) network. The focus is on using two intelligent algorithms, the genetic algorithm (GA) and the particle swarm algorithm (PSO), to achieve efficient optimization. A mathematical model is constructed that determines relay locations and spectrum sharing methods to reduce the probability of failure and increase reliability. The algorithms are based on evaluating an objective function that takes into account spectrum efficiency, network delay, and connection reliability. The results show that using GA and PSO leads to significant performance improvements compared to traditional methods. The impact of the number of relays and secondary users on allocation efficiency is also analyzed. Combining the two algorithms contributes to accelerating the achievement of near-optimal solutions. Finally, the proposed model provides a general framework that can be applied to various types of dynamic spectrum networks.
- 30 June 2025
- Published by Journal of Al-Qadisiyah for Computer Science and Mathematics in Journal of Al-Qadisiyah for Computer Science and Mathematics
- Vol. 17 (2) , 153–158
Open AccessEnhancing ROSS Network Reliability Through Evolutionary Optimization Techniques
This research aims to develop computational models to improve resource allocation and increase the reliability of a ROSS (Relay-based Opportunistic Spectrum Sharing) network. The focus is on using two intelligent algorithms, the genetic algorithm (GA) and the particle swarm algorithm (PSO), to achieve efficient optimization. A mathematical model is constructed that determines relay locations and spectrum sharing methods to reduce the probability of failure and increase reliability. The algorithms are based on evaluating an objective function that takes into account spectrum efficiency, network delay, and connection reliability. The results show that using GA and PSO leads to significant performance improvements compared to traditional methods. The impact of the number of relays and secondary users on allocation efficiency is also analyzed. Combining the two algorithms contributes to accelerating the achievement of near-optimal solutions. Finally, the proposed model provides a general framework that can be applied to various types of dynamic spectrum networks.
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3097 (1) , 080025
Exploring optimization algorithms for challenging multidimensional optimization problems: A comparative approach
This paper investigates the Nelder-Mead, Powell, and Differential Evolution algorithms in the optimization of a multidimensional optimization problem. Actually, This paper investigates the Nelder-Mead, Powell, and Differential Evolution algorithms in the optimization of a multidimensional optimization problem. Actually,
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3097 (1) , 080025
Exploring optimization algorithms for challenging multidimensional optimization problems: A comparative approach
This paper investigates the Nelder-Mead, Powell, and Differential Evolution algorithms in the optimization of a multidimensional optimization problem. Actually, This paper investigates the Nelder-Mead, Powell, and Differential Evolution algorithms in the optimization of a multidimensional optimization problem. Actually,
- Open Access
- 8 April 2022
- Published by Universidad Tecnica de Manabi in International journal of health sciences
- p. 1576-1586
Solving nonlinear optimization problem using approximation methods
The goal of this paper is to find a better method for integrating the optimization problem faster, and we did so by using a relaxation of the solution area, which is one of the methodologies in the correlation between the penalty method and the Augmented Lagrange method, and we also built default properties for combining these two methods.
- 8 April 2022
- Published by Universidad Tecnica de Manabi in International journal of health sciences
- p. 1576-1586
Open AccessSolving nonlinear optimization problem using approximation methods
The goal of this paper is to find a better method for integrating the optimization problem faster, and we did so by using a relaxation of the solution area, which is one of the methodologies in the correlation between the penalty method and the Augmented Lagrange method, and we also built default properties for combining these two methods.
- Open Access
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1818 (1) , 012171
Some Topics on Convex Optimization
The aim of this paper is to clarify several important points, including a brief and adequate explanation of loving improvement, as well as laying out a number of important mathematical formulas that we need, supported with graphs.
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1818 (1) , 012171
Open AccessSome Topics on Convex Optimization
The aim of this paper is to clarify several important points, including a brief and adequate explanation of loving improvement, as well as laying out a number of important mathematical formulas that we need, supported with graphs.
- Open Access
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1818 (1) , 012179
The Applications of NP-hardness optimizations problem
In this paper we present a study on the problem of NP hardness and their applications in computer science. In addition, our study sheds light on the most important applications present in our daily life and how the problem of NP stiffness is an important primary focus in it. Moreover, the aim was to search for further modifications in order to obtain optimal methods for their adoption. Finally, the aim of this study is to seek to solve the decision problem of NP hardness to achieve the desired goals with the optimal result.
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1818 (1) , 012179
Open AccessThe Applications of NP-hardness optimizations problem
In this paper we present a study on the problem of NP hardness and their applications in computer science. In addition, our study sheds light on the most important applications present in our daily life and how the problem of NP stiffness is an important primary focus in it. Moreover, the aim was to search for further modifications in order to obtain optimal methods for their adoption. Finally, the aim of this study is to seek to solve the decision problem of NP hardness to achieve the desired goals with the optimal result.