This research deals with the financial reporting for the non-current assets impairment from the viewpoint of international accounting standards, especially IAS 36 "Impairment of assets”. The research problem focused on the non-compliance with the requirements of IAS 36 which would negatively affect the accounting information quality, and its characteristics, especially the relevance of accounting information, that confirms the necessity of having such information for the three sub-characteristics in order to be useful for the decisions of users represented

Small and Medium Enterprises (SMEs) in Iraq have experienced low performance due to the limited usage of accounting information systems (AIS) and the inability to exploit knowledge of management capabilities (KMC). These deficiencies have led to competitive pressures in the marketplace that have adversely affected their sales and production. This study investigates the role of AIS in terms of operation support, knowledge support, regulatory support, and the role of KMC, including knowledge acquisition, knowledge transfer, and knowledge utilized to enhance organizational performance in Iraqi SMEs. The target population was managers and owners in SMEs using AIS in Iraq’s cities. A non-probability purposive sampling technique was use

Building Information Modeling (BIM) and Lean Construction (LC) are two quickly growing applied research areas in construction management. This study focuses on identifying the most essential benefits and analyzing the most affecting constraints on the construction sector that construction players face as they attempt to combine BIM-LC in Iraqi construction. Experts assessed 30 benefits and 28 constraints from examining the previous literature, and a two-round Delphi survey formed the responses. Expert consensus analysis was utilized to elaborate and validate responses after descriptive statistical checks had been used for data processing.

According to the study's findings, the benefits include ensuring the most ef

This paper includes the application of Queuing theory with of Particle swarm algorithm or is called (Intelligence swarm) to solve the problem of The queues and developed for General commission for taxes /branch Karkh center in the service stage of the Department of calculators composed of six  employees , and it was chosen queuing model is a single-service channel  M / M / 1 according to the nature of the circuit work mentioned above and it will be divided according to the letters system for each employee, and  it was composed of data collection times (arrival time , service time, departure time)

     Evolutionary algorithms (EAs), as global search methods, are proved to be more robust than their counterpart local heuristics for detecting protein complexes in protein-protein interaction (PPI) networks. Typically, the source of robustness of these EAs comes from their components and parameters. These components are solution representation, selection, crossover, and mutation. Unfortunately, almost all EA based complex detection methods suggested in the literature were designed with only canonical or traditional components. Further, topological structure of the protein network is the main information that is used in the design of almost all such components. The main contribution of this paper is to formulate a more robust E

Recently Genetic Algorithms (GAs) have frequently been used for optimizing the solution of estimation problems. One of the main advantages of using these techniques is that they require no knowledge or gradient information about the response surface. The poor behavior of genetic algorithms in some problems, sometimes attributed to design operators, has led to the development of other types of algorithms. One such class of these algorithms is compact Genetic Algorithm (cGA), it dramatically reduces the number of bits reqyuired to store the poulation and has a faster convergence speed. In this paper compact Genetic Algorithm is used to optimize the maximum likelihood estimator of the first order moving avergae model MA(1). Simulation results

Choosing antimicrobials is a common dilemma when the expected rate of bacterial resistance is high. The observed resistance values in unequal groups of isolates tested for different antimicrobials can be misleading. This can affect the decision to recommend one antibiotic over the other. We analyzed recalled data with the statistical consideration of unequal sample groups. Data was collected concerning children suspected to have typhoid fever at Al Alwyia Pediatric Teaching Hospital in Baghdad, Iraq. The study period extended from September 2021 to September 2022. A novel algorithm was developed to compare the drug sensitivity among unequal numbers of Salmonella typhi (S. Typhi) isolates tested with different antibacterials.

     This paper describes the application of consensus optimization for Wireless Sensor Network (WSN) system. Consensus algorithm is usually conducted within a certain number of iterations for a given graph topology. Nevertheless, the best Number of Iterations (NOI) to reach consensus is varied in accordance with any change in number of nodes or other parameters of . graph topology. As a result, a time consuming trial and error procedure will necessary be applied
to obtain best NOI. The implementation of an intellig ent optimization can effectively help to get the optimal NOI. The performance of the consensus algorithm has considerably been improved by the inclusion of Particle Swarm Optimization (PSO). As a case s

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord