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

This study examined the problematic of the ambiguous relationship between the media and terrorism and the problems that result from press coverage of terroristic incidents. The paper sought to show the classification and confrontation of such incidents had been established from the point of view of a sample of media professionals, researchers and writers who are frequenters of Al-Mutanabi Street in Baghdad. The media outlets that carry this coverage would not give up their media mission as well as the terrorists would not be given an opportunity to take advantage of this coverage in achieving their goals and objectives. Furthermore, the terrorist organizations would have no chance to exploit these means to deliver their terroristic messa

Recently, Image enhancement techniques can be represented as one of the most significant topics in the field of digital image processing. The basic problem in the enhancement method is how to remove noise or improve digital image details. In the current research a method for digital image de-noising and its detail sharpening/highlighted was proposed. The proposed approach uses fuzzy logic technique to process each pixel inside entire image, and then take the decision if it is noisy or need more processing for highlighting. This issue is performed by examining the degree of association with neighboring elements based on fuzzy algorithm. The proposed de-noising approach was evaluated by some standard images after corrupting them with impulse

This work aims to develop a secure lightweight cipher algorithm for constrained devices. A secure communication among constrained devices is a critical issue during the data transmission from the client to the server devices. Lightweight cipher algorithms are defined as a secure solution for constrained devices that require low computational functions and small memory. In contrast, most lightweight algorithms suffer from the trade-off between complexity and speed in order to produce robust cipher algorithm. The PRESENT cipher has been successfully experimented on as a lightweight cryptography algorithm, which transcends other ciphers in terms of its computational processing that required low complexity operations. The mathematical model of

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)

Abstract: Data mining is become very important at the present time, especially with the increase in the area of information it's became huge, so it was necessary to use data mining to contain them and using them, one of the data mining techniques are association rules here using the Pattern Growth method kind enhancer for the apriori. The pattern growth method depends on fp-tree structure, this paper presents modify of fp-tree algorithm called HFMFFP-Growth by divided dataset and for each part take most frequent item in fp-tree so final nodes for conditional tree less than the original fp-tree. And less memory space and time.