At the local level in the early 1990s first established an Islamic bank 1993 is called Iraqi Islamic bank and was established by Dr. abdullatef hmim and with capital of 200 Million Iraqi dinars .

After 2003 began the attention of Iraqis tend to create Islamic banks until now up to 30 banks in the present ,  He confirmed Mr. Governor of the Iraqi Central Bank recently that there is more than 40 iintroduction licence to establish an Islamic bank in Iraq , That banking activity which is compatible with Sharia law widely welcomed by savers and those in need for more development and modernization in order to gain a greater share within the Iraqi market , and allowed the Iraqi Central Bank in recent years

Crime is considered as an unlawful activity of all kinds and it is punished by law. Crimes have an impact on a society's quality of life and economic development. With a large rise in crime globally, there is a necessity to analyze crime data to bring down the rate of crime. This encourages the police and people to occupy the required measures and more effectively restricting the crimes. The purpose of this research is to develop predictive models that can aid in crime pattern analysis and thus support the Boston department's crime prevention efforts. The geographical location factor has been adopted in our model, and this is due to its being an influential factor in several situations, whether it is traveling to a specific area or livin

Used in the study especially calibrated Erwa to determine the number of neighborhood or the Alayoshi number of bacteria in the count modeling and casting method dishes in addition to using the drop method yielded significant results for a match between the methods used ..

In this work,  the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt

No. Due to their apparently extreme optical to X-ray properties, Narrow Line Seyfert 1s (NLSy1s) have been considered a special class of active galactic nuclei (AGN). Here, we summarize observational results from different groups to conclude that none of the characteristics that are typically used to define the NLSy1s as a distinct group – from the, nowadays called, Broad Line Seyfert 1s (BLSy1s) – is unique, nor ubiquitous of these particular sources, but shared by the whole Type 1 AGN. Historically, the NLSy1s have been distinguished from the BLSy1s by the narrow width of the broad Hb emission line. The upper limit on the full width at half maximum of this line is 2000kms−1 for NLSy1s, while in BLSy1s it can be of several thousands

In regression testing, Test case prioritization (TCP) is a technique to arrange all the available test cases. TCP techniques can improve fault detection performance which is measured by the average percentage of fault detection (APFD). History-based TCP is one of the TCP techniques that consider the history of past data to prioritize test cases. The issue of equal priority allocation to test cases is a common problem for most TCP techniques. However, this problem has not been explored in history-based TCP techniques. To solve this problem in regression testing, most of the researchers resort to random sorting of test cases. This study aims to investigate equal priority in history-based TCP techniques. The first objective is to implement

Metaheuristics under the swarm intelligence (SI) class have proven to be efficient and have become popular methods for solving different optimization problems. Based on the usage of memory, metaheuristics can be classified into algorithms with memory and without memory (memory-less). The absence of memory in some metaheuristics will lead to the loss of the information gained in previous iterations. The metaheuristics tend to divert from promising areas of solutions search spaces which will lead to non-optimal solutions. This paper aims to review memory usage and its effect on the performance of the main SI-based metaheuristics. Investigation has been performed on SI metaheuristics, memory usage and memory-less metaheuristics, memory char