This paper proposes a new strategy to enhance the performance and accuracy of the Spiral dynamic algorithm (SDA) for use in solving real-world problems by hybridizing the SDA with the Bacterial Foraging optimization algorithm (BFA). The dynamic step size of SDA makes it a useful exploitation approach. However, it has limited exploration throughout the diversification phase, which results in getting trapped at local optima. The optimal initialization position for the SDA algorithm has been determined with the help of the chemotactic strategy of the BFA optimization algorithm, which has been utilized to improve the exploration approach of the SDA. The proposed Hybrid Adaptive Spiral Dynamic Bacterial Foraging (HASDBF)

There has been a great deal of research into the considerable challenge of managing of traffic at road junctions; its application to vehicular ad hoc network (VANET) has proved to be of great interest in the developed world. Dynamic topology is one of the vital challenges facing VANET; as a result, routing of packets to their destination successfully and efficiently is a non-simplistic undertaking. This paper presents a MDORA, an efficient and uncomplicated algorithm enabling intelligent wireless vehicular communications. MDORA is a robust routing algorithm that facilitates reliable routing through communication between vehicles. As a position-based routing technique, the MDORA algorithm, vehicles' precise locations are used to establish th

The integration of decision-making will lead to the robust of its decisions, and then determination optimum inventory level to the required materials to produce and reduce the total cost by the cooperation of purchasing department with inventory department and also with other company^,s departments. Two models are suggested to determine Optimum Inventory Level (OIL), the first model (OIL-model 1) assumed that the inventory level for materials quantities equal to the required materials, while the second model (OIL-model 2) assumed that the inventory level for materials quantities more than the required materials for the next period.             &nb

This paper provides an identification key to the species of Orthetrum Newman, 1833 (Odonata, Libellulidae), including six species that were collected from different localities in Iraq.

    The species of O. anceps (Schneider, 1845) is registered as a new record in Iraq; the most important characters which are used in diagnostic key are included

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith

Simultaneous determination of Furosemide, Carbamazepine, Diazepam, and Carvedilol in bulk and pharmaceutical formulation using the partial least squares regression (PLS-1 and PLS-2) is described in this study. The two methods were successfully applied to estimate the four drugs in their quaternary mixture using UV spectral data of 84synthetic mixtures in the range of 200-350nm with the intervals Δλ=0.5nm. The linear concentration range were 1-20 μg.mL-1 for all, with correlation coefficient (R2) and root mean squares error for the calibration (RMSE) for FURO, CARB, DIAZ, and CARV were 0.9996, 0.9998, 0.9997, 0.9997, and 0.1128, 0.1292, 0.1868,0.1562 respectively for PLS-1, and for PLS-2 were 0.9995, 0.9999, 0.9997, 0.9998, and 0.1127, 0.