In this research was to use the method of classic dynamic programming (CDP) and the method of fuzzy dynamic programming (FDP) to controlling the inventory in N periods and only one substance ,in order to minimize the total cost and determining the required quantity in warehouse rusafa principal of the ministry of commerce . A comparison was made between the two techniques، We found that the value of fuzzy total cost is less than that the value of classic total cost

The paper presents an original method to make the geometric synthesis of the rotary cam and translated tappet with roll. Classical method uses to the geometric synthesis and the reduced tappet velocity, and in this mode the geometric classic method become a geometric and kinematic synthesis method. The new geometric synthesis method uses just the geometric parameters (without velocities), but one utilizes and a condition to realize at the tapped the velocities predicted by the tapped movement laws imposed by the cam profile. Then, it makes the dynamic analyze for the imposed cam profile, and one modify the cam profile geometric parameters to determine a good dynamic response (functionality). In this mode it realizes the dynamic synthesis

This study examines the causes of time delays and cost overruns in a selection of thirty post-disaster reconstruction projects in Iraq. Although delay factors have been studied in many countries and contexts, little data exists from countries under the conditions characterizing Iraq during the last 10-15 years. A case study approach was used, with thirty construction projects of different types and sizes selected from the Baghdad region. Project data was gathered from a survey which was used to build statistical relationships between time and cost delay ratios and delay factors in post disaster projects. The most important delay factors identified were contractor failure, redesigning of designs/plans and change orders, security is

Purpose/ to build clear perceptions about the level of the effects of organizational failures on the competitiveness of dairy factories and the role of dynamic knowledge capabilities in minimizing these impacts

Mythology/ Design approach Use deduction approach, the research was conducted in four dairy factories in Baghdad (Abu Ghraib, Agriculture, Halal and Ayon Al-Rafidain). It was applied to a sample of (155) individuals representing a sample of the research community from factory owners, managers, Engineers, technicians and experienced workers in the dairy industry. The questionnaire was used as a main tool for collecting data, information and statistical tools in the extraction, testing and analysis o

In the last few years, the Internet of Things (IoT) is gaining remarkable attention in both academic and industrial worlds. The main goal of the IoT is laying on describing everyday objects with different capabilities in an interconnected fashion to the Internet to share resources and to carry out the assigned tasks. Most of the IoT objects are heterogeneous in terms of the amount of energy, processing ability, memory storage, etc. However, one of the most important challenges facing the IoT networks is the energy-efficient task allocation. An efficient task allocation protocol in the IoT network should ensure the fair and efficient distribution of resources for all objects to collaborate dynamically with limited energy. The canonic

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed