In light of the intellectual and technological progress within the current developments of time, as well as the emergence of digital tools and means of display and communication, which had a major role in the shifts of the time of globalization in various commercial and economic fields, as well as areas of transferring the design image and its stages of development to customers and the convergence of views between the customer and the interior designer, which are the most important pillars of the design process As a whole, and accordingly, there is an urgent need for a process of intellectual balance between them through digital tools from the technical side and through social media from the intellectual side. Customer comments via socia

The amount of information on the web is growing rapidly and number of web sites
becomes huge, so set of web applications used to help user and give him some information
about these sites, especially in e- business, news and sites introduce services.
Since Web site is built by comparatively free description, it is difficult to perform
absolute evaluation. So, rating of Web site is performed from various viewpoints.
In this paper we proposed method for ranking and rating using the web service and java
script to motivation remote server and return some public information to the site user and
other private information to owner.

In order to advance the education process and raise the educational level of the players, it became necessary to introduce new educational aids, programmed education in the education process, through which the basic skills to be learned are explained and clarified, and immediate feedback is provided that would enhance the information of the learner, and Reaching the goal to be achieved, taking into account the individual differences between the players, and thus it is possible to move away from the educational methods used in learning skills, which requires great effort and time, in addition to that the open playground may not perform the skill accurately and the player looks from one side, while when using the computer you look from severa

We present a reliable algorithm for solving, homogeneous or inhomogeneous, nonlinear ordinary delay differential equations with initial conditions. The form of the solution is calculated as a series with easily computable components. Four examples are considered for the numerical illustrations of this method. The results reveal that the semi analytic iterative method (SAIM) is very effective, simple and very close to the exact solution demonstrate reliability and efficiency of this method for such problems.

Oscillation criteria are obtained for all solutions of the first-order linear delay differential equations with positive and negative coefficients where we established some sufficient conditions so that every solution of (1.1) oscillate. This paper generalized the results in [11]. Some examples are considered to illustrate our main results.

Objective(s): to assess the factors which are associated with the prolonged prehospital delay of patients with
acute myocardial infarction.
Methodology: A descriptive study was conducted at the Coronary Care unit (CCU) in Al-Yarmok Teaching
Hospital, Ibn AL-Nafis Hospital for Cardiovascular Diseases, AL-Kadumia Teaching Hospital, Baghdad Teaching
Hospital, and AL-Kindy Teaching Hospital during the period of the study from February 2
nd
, 2009 to October 30th
,
2009. A random sample of (160) paƟent who were admiƩed to the hospitals were selected one by one. A
questionnaire was constructed for the purpose of the study, which is comprised of four parts that include (1)
sociodemographic data; (2) prehospital d

The traveling salesman problem (TSP) is a well-known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. In this paper we exploit the TSP to evaluate the minimum total cost (distance or time) for Iraqi cities. So two main methods are investigated to solve this problem; these methods are; Dynamic Programming (DP) and Branch and Bound Technique (BABT). For the BABT, more than one lower and upper bounds are be derived to gain the best one. The results of BABT are completely identical to DP, with less time for number of cities (n), 5 ≤ n ≤ 25. These results proof the efficiency of BABT compared with so