Numerous regions in the city of Baghdad experience the congestion and traffic problems. Due to the religious and economic significance, Al-Kadhimiya city (inside the metropolitan range of Baghdad) was chosen as study area. The data gathering stage was separated into two branches: the questionnaire method which is utilized to estimate the traffic volumes for the chosen roads and field data collection method which included video recording and manual counting for the volumes entering the selected signal intersections. The stage of analysis and evaluation for the seventeen urban roads, one highway, and three intersections was performed by HCS-2000 software.The presented work plots a system for assessing the level of service

The problem with research lies in hiding the Hanbali approach in building long and short travel provisions, as well as hiding some provisions relating to short travel that are not provided for by the jurists of Hanbali (in their books).

The research aims to demonstrate the approach and standards on which they based the long and short travel provisions, as well as to reflect the provisions of some of the issues that are silent on long and short travel, with evidence and significance.

The research included a preface and two researches, the researcher in the preface talked about the reality of long and short travel, in the first research on the approach of ha

In this article, we design an optimal neural network based on new LM training algorithm. The traditional algorithm of LM required high memory, storage and computational overhead because of it required the updated of Hessian approximations in each iteration. The suggested design implemented to converts the original problem into a minimization problem using feed forward type to solve non-linear 3D - PDEs. Also, optimal design is obtained by computing the parameters of learning with highly precise. Examples are provided to portray the efficiency and applicability of this technique. Comparisons with other designs are also conducted to demonstrate the accuracy of the proposed design.

Finding communities of connected individuals in complex networks is challenging, yet crucial for understanding different real-world societies and their interactions. Recently attention has turned to discover the dynamics of such communities. However, detecting accurate community structures that evolve over time adds additional challenges. Almost all the state-of-the-art algorithms are designed based on seemingly the same principle while treating the problem as a coupled optimization model to simultaneously identify community structures and their evolution over time. Unlike all these studies, the current work aims to individually consider this three measures, i.e. intra-community score, inter-community score, and evolution of community over

Optimizing the Access Point (AP) deployment has a great role in wireless applications due to the need for providing an efficient communication with low deployment costs. Quality of Service (QoS), is a major significant parameter and objective to be considered along with AP placement as well the overall deployment cost. This study proposes and investigates a multi-level optimization algorithm called Wireless Optimization Algorithm for Indoor Placement (WOAIP) based on Binary Particle Swarm Optimization (BPSO). WOAIP aims to obtain the optimum AP multi-floor placement with effective coverage that makes it more capable of supporting QoS and cost-effectiveness. Five pairs (coverage, AP deployment) of weights, signal thresholds and received s

RA Ali, LK Abood, Int J Sci Res, 2017 - Cited by 2

<p>In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. T