Preferred Language
Articles
/
excl7I0BVTCNdQwCMSnL
Minimizing Costs of Transportation Problems Using the Genetic Algorithm
...Show More Authors

Scopus Crossref
View Publication
Publication Date
Tue Jan 01 2019
Journal Name
Ieee Access
Speech Enhancement Algorithm Based on Super-Gaussian Modeling and Orthogonal Polynomials
...Show More Authors

View Publication
Scopus (44)
Crossref (43)
Scopus Clarivate Crossref
Publication Date
Wed May 10 2023
Journal Name
Journal Of Engineering
A Proposal Algorithm to Solve Delay Constraint Least Cost Optimization Problem
...Show More Authors

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Fri Jan 01 2016
Journal Name
Journal Of Engineering
Enhanced Chain-Cluster Based Mixed Routing Algorithm for Wireless Sensor Networks
...Show More Authors

Energy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs). A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorit

... Show More
View Publication Preview PDF
Publication Date
Sun Apr 01 2018
Journal Name
2018 9th International Conference On Information And Communication Systems (icics)
An intersection-based segment aware algorithm for geographic routing in VANETs
...Show More Authors

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f

... Show More
View Publication
Scopus (5)
Crossref (5)
Scopus Crossref
Publication Date
Sun Dec 01 2019
Journal Name
Applied Soft Computing
A new evolutionary multi-objective community mining algorithm for signed networks
...Show More Authors

View Publication
Scopus (8)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Sat Dec 01 2018
Journal Name
Al-khwarizmi Engineering Journal
Applying A* Path Planning Algorithm Based on Modified C-Space Analysis
...Show More Authors

In this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons

... Show More
View Publication Preview PDF
Crossref (4)
Crossref
Publication Date
Sat May 24 2025
Journal Name
Iraqi Journal For Computer Science And Mathematics
Intrusion Detection System for IoT Based on Modified Random Forest Algorithm
...Show More Authors

An intrusion detection system (IDS) is key to having a comprehensive cybersecurity solution against any attack, and artificial intelligence techniques have been combined with all the features of the IoT to improve security. In response to this, in this research, an IDS technique driven by a modified random forest algorithm has been formulated to improve the system for IoT. To this end, the target is made as one-hot encoding, bootstrapping with less redundancy, adding a hybrid features selection method into the random forest algorithm, and modifying the ranking stage in the random forest algorithm. Furthermore, three datasets have been used in this research, IoTID20, UNSW-NB15, and IoT-23. The results are compared with the three datasets men

... Show More
View Publication Preview PDF
Scopus (1)
Crossref (1)
Scopus Crossref
Publication Date
Thu Feb 15 2024
Journal Name
Evolving Systems
Boosted Aquila Arithmetic Optimization Algorithm for multi-level thresholding image segmentation
...Show More Authors

View Publication
Scopus (10)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Sun Dec 15 2019
Journal Name
Journal Of Baghdad College Of Dentistry
Association of a genetic variant (rs689466) of Cyclooxygenase-2 gene with chronic periodontitis in a sample of Iraqi population
...Show More Authors

Background: periodontitis is a chronic inflammatory disease causing destruction of the tooth supporting structures, initiated by dental plaque and modified by environmental and genetic risk factors. Cyclooxygenase-2 (COX-2) enzyme is responsible for the production of prostaglandin E2, an important mediator in the chronic periodontitis (CP) pathogenesis. Polymorphisms in COX-2 gene have linked to CP in different populations. Aim: To study the association between Cyclooxygenase-2 single nucleotide polymorphism rs689466 (-1195A/G SNP) and chronic periodontitis in a sample of Iraqi population. Methods: One hundred Iraqi subjects divided into two groups: case group consisted of 70 CP patient (35 males and 35 females) with age range 30-55 year

... Show More
View Publication Preview PDF
Scopus (13)
Crossref (7)
Scopus Crossref
Publication Date
Wed Sep 30 2020
Journal Name
Journal Of Accounting And Financial Studies ( Jafs )
Adoption of the IFRS11 Financial Reporting Standard for Oil Service Contracts Costs and its Reflection on Measurement and Disclosure for National Oil Companies: بحث تطبيق في شركة نفط ميسان (ش . ع)
...Show More Authors

The research seeks to clarify the problems related to the aspects of the financial and accounting process resulting from entering into contractual arrangements with a period of more than 20 years, among which is the research problem represented by the lack of clarity of the foundations and procedures for the recognition of oil costs and additional costs borne by foreign invested companies, which led to a weakening of their credibility and reflection. Negatively "on the measurement and accounting disclosure of financial reports prepared by oil companies, and the research aims to lay down sound procedures for measuring and classifying oil costs and additional costs paid to foreign companies, and recognizing and recording them in th

... Show More
View Publication Preview PDF